Grant: Discovery Grants Program - Individual
University of Alberta
$40,000.00
Novel channel coding techniques under practical assumptions
EF 2013-14
Résumé
Our modern life relies heavily on reliable, fast and efficient data communication. Some of the most important inventions of the 20th century are indeed motivated by this need (e.g., telephones, digital data storage devices, the Internet, and various wireless devices). Shannon's noisy channel coding theorem states that error-free communication is possible, even in the presence of noise. Moreover, depending on the strength of the noise, there is a fundamental limit on the amount of the information that can be conveyed error-free. This limit is called the channel capacity. The key to error-free communication is channel coding, i.e., adding redundancy to the data to make it robust against the channel noise. Since Shannon's theorem (1948), there have been many scholarly works on design of channel coding solutions. However, it was only in the past decade that modern coding methods made approaching the channel capacity possible. The existing literature on modern coding, however, almost always assumes that each transmitted symbol is read by the receiver exactly one time. In practice, due to inevitable timing errors, some symbols may be read more than once or not at all. Such insertions and/or deletions have a devastating effect on existing decoders, causing them to fail almost surely. As a result, timing recovery modules are designed with special care and at high cost to reduce the possibility of timing errors. This practice is against the main philosophy of channel coding, which suggest adding redundancy to data instead of paying for a more reliable channel. This research program aims at developing a profound understanding of channels with timing errors and devising efficient coding solutions that can correct timing errors. The successful outcome of this project will contribute to the progress of the important field of channel coding. It will reduce the cost of communication systems, while making them more reliable. The results of this research program will also impact a number of other fields of research.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Alberta, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
327650-2011
Name nom
Ardakani, Masoud
Department département
Electrical and Computer Engineering
Organization id
9
Institution établissement
University of Alberta
Province en
Alberta
Province fr
Alberta
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2013
Competition year année de concours
2011
Award amount
40000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
1510
Committee name en
Electrical and Computer Engineering
Committee name fr
Génie électrique et informatique
Area of application code
1207
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Information, computer and communication technologies
Area of application fr
Technologie de l'information, des ordinateurs et des réseaux de communications
Research subject code
2513
Research subject group en
Electrical and electronic engineering
Research subject group fr
Génie électrique et électronique
Research subject en
Data communications
Research subject fr
Transmission des données
Partie
3
Nb partie
5
Application title
Novel channel coding techniques under practical assumptions
Keyword
NSERC
Application summary
Our modern life relies heavily on reliable, fast and efficient data communication. Some of the most important inventions of the 20th century are indeed motivated by this need (e.g., telephones, digital data storage devices, the Internet, and various wireless devices). Shannon's noisy channel coding theorem states that error-free communication is possible, even in the presence of noise. Moreover, depending on the strength of the noise, there is a fundamental limit on the amount of the information that can be conveyed error-free. This limit is called the channel capacity. The key to error-free communication is channel coding, i.e., adding redundancy to the data to make it robust against the channel noise. Since Shannon's theorem (1948), there have been many scholarly works on design of channel coding solutions. However, it was only in the past decade that modern coding methods made approaching the channel capacity possible. The existing literature on modern coding, however, almost always assumes that each transmitted symbol is read by the receiver exactly one time. In practice, due to inevitable timing errors, some symbols may be read more than once or not at all. Such insertions and/or deletions have a devastating effect on existing decoders, causing them to fail almost surely. As a result, timing recovery modules are designed with special care and at high cost to reduce the possibility of timing errors. This practice is against the main philosophy of channel coding, which suggest adding redundancy to data instead of paying for a more reliable channel. This research program aims at developing a profound understanding of channels with timing errors and devising efficient coding solutions that can correct timing errors. The successful outcome of this project will contribute to the progress of the important field of channel coding. It will reduce the cost of communication systems, while making them more reliable. The results of this research program will also impact a number of other fields of research.