Performance-complexity tradeoff in sequential decoding for the unconstrained AWGN channel

Handle URI:
http://hdl.handle.net/10754/564722
Title:
Performance-complexity tradeoff in 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. © 2013 IEEE.
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division; Electrical Engineering Program; Young Talent Development; Communication Theory Lab
Publisher:
Institute of Electrical and Electronics Engineers (IEEE)
Journal:
2013 IEEE International Conference on Communications (ICC)
Conference/Event name:
2013 IEEE International Conference on Communications, ICC 2013
Issue Date:
Jun-2013
DOI:
10.1109/ICC.2013.6655016
ARXIV:
arXiv:1210.0516
Type:
Conference Paper
ISSN:
15503607
ISBN:
9781467331227
Additional Links:
http://arxiv.org/abs/arXiv:1210.0516v2
Appears in Collections:
Conference Papers; Electrical Engineering Program; 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.accessioned2015-08-04T07:13:44Zen
dc.date.available2015-08-04T07:13:44Zen
dc.date.issued2013-06en
dc.identifier.isbn9781467331227en
dc.identifier.issn15503607en
dc.identifier.doi10.1109/ICC.2013.6655016en
dc.identifier.urihttp://hdl.handle.net/10754/564722en
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. © 2013 IEEE.en
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en
dc.relation.urlhttp://arxiv.org/abs/arXiv:1210.0516v2en
dc.titlePerformance-complexity tradeoff in sequential decoding for the unconstrained AWGN channelen
dc.typeConference Paperen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.contributor.departmentElectrical Engineering Programen
dc.contributor.departmentYoung Talent Developmenten
dc.contributor.departmentCommunication Theory Laben
dc.identifier.journal2013 IEEE International Conference on Communications (ICC)en
dc.conference.date9 June 2013 through 13 June 2013en
dc.conference.name2013 IEEE International Conference on Communications, ICC 2013en
dc.conference.locationBudapesten
dc.identifier.arxividarXiv:1210.0516en
kaust.authorAbediseid, Waliden
kaust.authorAlouini, Mohamed-Slimen
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.