Performance analysis of PUM codes

C. Nelson, L. Stankovic, Vladimir M. Stankovic, S. Cheng

Research output: Chapter in Book/Report/Conference proceedingConference contribution book

2 Citations (Scopus)

Abstract

Partial unit memory (PUM) codes are low complexity, nonbinary, multimemory codes with competitive performance to standard recursive systematic convolutional (RSC) codes. We design turbo codes using parallel concatenation of two identical systematic recursive PUM codes and compare their performance to equivalent standard RSC-based turbo codes. Our analysis of extrinsic information transfer (EXIT) charts shows that the designed PUM-based turbo codes outperform equivalent standard turbo codes at the error-floor region, with comparable performance in the waterfall region. Simulated bit error rate (BER) performance curves of the two codes confirm the behavior predicted using EXIT charts. For example, our PUM-based turbo code design outperforms the standard Inmarsat turbo code by 0.5 dB for the same number of decoder iterations. Similarly, the UMTS standardized turbo code loses roughly 0.5 dB in the error-floor region compared to the PUM-based turbo code of same complexity.
Original languageEnglish
Title of host publication5th International Symposium on Turbo Codes and Related Topics
PublisherIEEE
Pages260-265
Number of pages5
ISBN (Print)978-1-4244-2862-5
DOIs
Publication statusPublished - Sep 2008

Keywords

  • concatenated codes
  • convolutional codes
  • error statistics
  • turbo codes

Fingerprint Dive into the research topics of 'Performance analysis of PUM codes'. Together they form a unique fingerprint.

  • Cite this

    Nelson, C., Stankovic, L., Stankovic, V. M., & Cheng, S. (2008). Performance analysis of PUM codes. In 5th International Symposium on Turbo Codes and Related Topics (pp. 260-265). IEEE. https://doi.org/10.1109/TURBOCODING.2008.4658708