Cart (Loading....) | Create Account
Close category search window
 

Performance analysis of PUM codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Nelson, C. ; Dept of Commun. Syst., Lancaster Univ., Lancaster ; Stankovic, L. ; Stankovic, V. ; Cheng, S.

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.

Published in:

Turbo Codes and Related Topics, 2008 5th International Symposium on

Date of Conference:

1-5 Sept. 2008

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.