Handle URI:
http://hdl.handle.net/10754/246551
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 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:
arxiv
Issue Date:
1-Oct-2012
Type:
Technical Report
Additional Links:
http://arxiv.org/abs/1210.0516
Appears in Collections:
Technical Reports; 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.accessioned2012-10-02T11:17:49Z-
dc.date.available2012-10-02T11:17:49Z-
dc.date.issued2012-10-01en
dc.identifier.urihttp://hdl.handle.net/10754/246551en
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 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.publisherarxiven
dc.relation.urlhttp://arxiv.org/abs/1210.0516en
dc.subjectLattice Theoryen
dc.subjectLattice Coding/Decodingen
dc.subjectSequential Decodingen
dc.subjectCapacityen
dc.titleOn Lattice Sequential Decoding for The Unconstrained AWGN Channelen
dc.typeTechnical Reporten
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.contributor.departmentCommunication Theory Laben
dc.eprint.versionPre-printen
dc.contributor.affiliationKing Abdullah University of Science and Technology (KAUST)en
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.