On Lattice Sequential Decoding for The Unconstrained AWGN Channel

Walid Abediseid, Mohamed-Slim Alouini

Research output: Contribution to journalArticlepeer-review

6 Scopus citations


In this paper, the performance limits and the computational complexity of the lattice sequential decoder are analyzed for the unconstrained additive white Gaussian noise channel. The performance analysis available in the literature for such a channel has been studied only under the use of the minimum Euclidean distance decoder that is commonly referred to as the \textit{lattice decoder}. Lattice decoders based on solutions to the NP-hard closest vector problem are very complex to implement, and the search for low complexity receivers for the detection of lattice codes is considered a challenging problem. However, the low computational complexity advantage that sequential decoding promises, makes it an alternative solution to the lattice decoder. In this work, we characterize the performance and complexity tradeoff via the error exponent and the decoding complexity, respectively, of such a decoder as a function of the decoding parameter --- the bias term. For the above channel, we derive the cut-off volume-to-noise ratio that is required to achieve a good error performance with low decoding complexity.
Original languageEnglish (US)
Pages (from-to)2446-2456
Number of pages11
JournalIEEE Transactions on Communications
Issue number6
StatePublished - May 1 2013


Dive into the research topics of 'On Lattice Sequential Decoding for The Unconstrained AWGN Channel'. Together they form a unique fingerprint.

Cite this