Grant: Engage Grants Program
University of Waterloo
$25,000.00
Low complexity conditional lattice decoding
FY 2012-13
Summary
Reliable communications requires efficient decoding algorithms that have reduced complexity for saving in
processing time and device's battery life. Optimal, or maximum-likelihood (ML) decoding has often huge
complexity that is exponential in the signal dimension and data rate. Using matrix representation on the
baseband model of the received signals, the decoding procedure can be performed by applying some matrix
algebraic manipulations. Considering the practical issues, we need to achieve near-optimal detection
performance, while offering polynomial computational complexity.
Among the promising near-optimal decoding algorithms are lattice reduction based decoders and conditional
decoders. In the former, the lattice properties of the combined coding scheme and communication medium are
utilized to approximate an orthogonalization on the equivalent channel matrix, which improves the
performance of subsequent low-complexity decoders such as zero-forcing and decision feedback equalization.
In conditional decoding, the near-orthogonal structure of some sub-block is used to facilitate near-optimal
detection. In this proposal we aim to benefit from both worlds in smartly combining lattice reduction and
conditional decoding algorithms in order to facilitate near-optimal decoding. We consider linear vector
channels with additive white Gaussian noise.
The importance of this problem is well recognized since several relevant applications in wireless
communications fall in this category. Inter-symbol interference and multiple-input multiple-output channels are
such applications. We will consider mobile users over fading channels and test our algorithms in the context of
vehicular wireless communications standards.
Program
Engage Grants Program
Recipient
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
445332-2012
Name nom
Damen, MohamedOussama
Department département
Electrical & Computer Engineering
Organization id
33
Institution établissement
University of Waterloo
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2012
Competition year année de concours
2012
Award amount
25000
Program id
EGP
Program name en
Engage Grants Program
Program name fr
Programme de subventions d'engagement partenariat
Group en
Research partnerships programs
Group fr
Programmes de partenariat
Committee code
1553
Committee name en
Ontario Internal Decision Committee
Committee name fr
Comité de décision interne pour l'Ontario
Area of application code
805
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Communications technologies (satellites, radar, etc.)
Area of application fr
Technologie des télécommunications (satellites, radar,etc.)
Research subject code
2507
Research subject group en
Electrical and electronic engineering
Research subject group fr
Génie électrique et électronique
Research subject en
Communications systems
Research subject fr
Systèmes de télécommunications
Partie
1
Nb partie
1
Application title
Low complexity conditional lattice decoding
Keyword
NSERC
Application summary
Reliable communications requires efficient decoding algorithms that have reduced complexity for saving in
processing time and device's battery life. Optimal, or maximum-likelihood (ML) decoding has often huge
complexity that is exponential in the signal dimension and data rate. Using matrix representation on the
baseband model of the received signals, the decoding procedure can be performed by applying some matrix
algebraic manipulations. Considering the practical issues, we need to achieve near-optimal detection
performance, while offering polynomial computational complexity.
Among the promising near-optimal decoding algorithms are lattice reduction based decoders and conditional
decoders. In the former, the lattice properties of the combined coding scheme and communication medium are
utilized to approximate an orthogonalization on the equivalent channel matrix, which improves the
performance of subsequent low-complexity decoders such as zero-forcing and decision feedback equalization.
In conditional decoding, the near-orthogonal structure of some sub-block is used to facilitate near-optimal
detection. In this proposal we aim to benefit from both worlds in smartly combining lattice reduction and
conditional decoding algorithms in order to facilitate near-optimal decoding. We consider linear vector
channels with additive white Gaussian noise.
The importance of this problem is well recognized since several relevant applications in wireless
communications fall in this category. Inter-symbol interference and multiple-input multiple-output channels are
such applications. We will consider mobile users over fading channels and test our algorithms in the context of
vehicular wireless communications standards.