On Lattice Sequential Decoding for The Unconstrained AWGN Channel

Handle URI:
http://hdl.handle.net/10754/292324
Title:
On Lattice Sequential Decoding for The Unconstrained AWGN Channel
Authors:
Abediseid, Walid; Alouini, Mohamed-Slim ( 0000-0003-4827-1793 )
Abstract:
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.
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division; Communication Theory Lab
Publisher:
Institute of Electrical and Electronics Engineers (IEEE)
Journal:
IEEE Transactions on Communications
Issue Date:
4-Apr-2013
DOI:
10.1109/TCOMM.2013.042313.120746
Type:
Article
ISSN:
0090-6778
Appears in Collections:
Articles; Communication Theory Lab; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorAbediseid, Waliden
dc.contributor.authorAlouini, Mohamed-Slimen
dc.date.accessioned2013-05-19T07:14:53Z-
dc.date.available2013-05-19T07:14:53Z-
dc.date.issued2013-04-04en
dc.identifier.issn0090-6778en
dc.identifier.doi10.1109/TCOMM.2013.042313.120746en
dc.identifier.urihttp://hdl.handle.net/10754/292324en
dc.description.abstractIn 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.en
dc.language.isoenen
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en
dc.rightsElectronic Preprints. Before submitting an article to an IEEE publication, authors frequently post their manuscripts to their own web site, their employers site, or to another server that invites constructive comment from colleagues.Upon submission of an article to IEEE, an author is required to transfer copyright in the article to IEEE, and the author must update any previously posted version of the article with a prominently displayed IEEE copyright notice. Upon publication of an article by the IEEE, the author must replace any previously posted electronic versions of the article with either (1) the full citation to the IEEE work with a Digital Object Identifier (DOI) or link to the article abstract in IEEE Xplore, or (2) the accepted version only (not the IEEE-published version), including the IEEE copyright notice and full citation, with a link to the final, published article in IEEE Xplore.en
dc.subjectLatticesen
dc.subjectSequential Decodingen
dc.subjectAWGNen
dc.subjectLattice Coding/Decodingen
dc.titleOn Lattice Sequential Decoding for The Unconstrained AWGN Channelen
dc.typeArticleen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.contributor.departmentCommunication Theory Laben
dc.identifier.journalIEEE Transactions on Communicationsen
dc.eprint.versionPre-printen
dc.contributor.institutionElectronics and Communication Department, Faculty of Engineering, Cairo University, Cairo, Egypten
dc.contributor.affiliationKing Abdullah University of Science and Technology (KAUST)en
kaust.authorAbediseid, Waliden
kaust.authorAlouini, Mohamed-Slimen
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.