Depending on the amount of data to process, file generation may take longer.

If it takes too long to generate, you can limit the data by, for example, reducing the range of years.

Chapter

Download BibTeX

Title

Decoding Algorithms for Iterative Receivers with Reduced Computational Requirements

Authors

[ 1 ] Katedra Radiokomunikacji, Wydział Elektroniki i Telekomunikacji, Politechnika Poznańska | [ P ] employee

Year of publication

2014

Chapter type

paper

Publication language

english

Abstract

EN Iterative processing, originated from the introduction of turbo codes, has become prevalent technique in modern receiver design. Its applications extend beyond channel decoding and include signal detection, channel estimation and equalization, interference suppression, and synchronization. In this paper, in the aspect of energy efficiency in wireless communication systems, we present and compare several reduced complexity algorithms for component decoding modules in iterative receivers. The comparison is carried out in terms of computational requirements and error performance for the case of turbo TCM systems.

Pages (from - to)

1 - 6

DOI

10.34385/proc.19.NEWCOM-4

URL

https://www.ieice.org/publications/proceedings/summary.php?expandable=6&iconf=ICTF&session_num=NEWCOM&number=NEWCOM-4&year=2014

Book

Proceedings of the IEICE Information and Communication Technology Forum (ICTF 2014), Poznań, Poland, 28-30 maj 2014

Presented on

IEICE Information and Communication Technology Forum (ICTF 2014), 28-30.05.2014, Poznań, Poland

This website uses cookies to remember the authenticated session of the user. For more information, read about Cookies and Privacy Policy.