By Topic

Reduced complexity iterative decoding for concatenated coding schemes

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

2 Author(s)
Bokolamulla, D. ; Dept. of Comput. Eng., Chalmers Univ. of Technol., Gothenburg, Sweden ; Aulin, Tor

A new algorithm to reduce the computational complexity of iterative decoding is presented. The algorithm reduces the complexity by removing certain branches from the corresponding trellis diagram. A threshold on a priori values is used as the elimination criterion. To assess the performance, numerical results for serially concatenated convolutional codes transmitted over an additive white Gaussian noise channel is presented. The results show that for the system considered, the algorithm can reduce the complexity by one third with a negligible degradation in error performance.

Published in:

Communications, 2003. ICC '03. IEEE International Conference on  (Volume:5 )

Date of Conference:

11-15 May 2003