By Topic

Efficient list decoding for parallel concatenated convolutional 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
$33 $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)
Chunlong Bai ; TRLabs, Alberta Univ., Edmonton, Alta., Canada ; B. Mielczarek ; W. A. Krzymien ; I. J. Fair

The focus of this research work is the sub-optimal list decoding algorithms for parallel concatenated convolutional codes (PCCCs) which improve the frame error rate (FER) performance. Error events and weight spectra for convolutional codes and PCCCs are analyzed with emphasis on their effects on list decoding. We explain the inefficiencies of list decoding algorithms for PCCCs that use a list generated from the component codes, and introduce a new algorithm based on the sub-block structure that generates a list directly for the PCCC. The additional complexity of the new algorithm is low and does not depend on the complexity of the component code. Simulations on the additive white Gaussian noise (AWGN) channel show that the new algorithm can lower the frame error floor by more than one order of magnitude.

Published in:

Personal, Indoor and Mobile Radio Communications, 2004. PIMRC 2004. 15th IEEE International Symposium on  (Volume:4 )

Date of Conference:

5-8 Sept. 2004