Early termination techniques for MIMO lattice sequential decoders

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In practical communication systems and realistic radio applications, there are throughput and latency restraints that have to be fulfilled together with a fixed hardware decoding complexity constraint that should be satisfied. Because of these requirements, in some bad channel realizations, a guaranteed throughput needs to be enforced with a premature end of the decoding process at the expense of a bit error rate performance penalty. In such scenarios, the decoding algorithm should stop and return a premature estimation of the original data such that the authorized decoding complexity and convergence time are respected. This problem is known as early termination decoding. In this work we propose efficient termination techniques for best-first tree-search sequential decoders applicable to a plurality of linear communication systems including MIMO channels addressed in this paper.

Original languageEnglish
Title of host publication2015 5th International Conference on Communications and Networking, COMNET 2015 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781509001965
DOIs
Publication statusPublished - 13 Sept 2016
Event5th International Conference on Communications and Networking, COMNET 2015 - Hammamet, Tunisia
Duration: 4 Nov 20157 Nov 2015

Publication series

Name2015 5th International Conference on Communications and Networking, COMNET 2015 - Proceedings

Conference

Conference5th International Conference on Communications and Networking, COMNET 2015
Country/TerritoryTunisia
CityHammamet
Period4/11/157/11/15

Keywords

  • Early termination
  • MIMO channels
  • Stack decoder
  • lattice decoding
  • sequential decoders

Fingerprint

Dive into the research topics of 'Early termination techniques for MIMO lattice sequential decoders'. Together they form a unique fingerprint.

Cite this