By Topic

Soft-output decoding algorithms for continuous decoding of 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
$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)
Benedetto, S. ; Dipartimento di Elettronica, Politecnico di Torino, Italy ; Divsalar, D. ; Montorsi, G. ; Pollara, F.

We propose new decoding algorithms to be embedded in the iterative decoding strategy of parallel concatenated convolutional codes. They are derived from the optimum maximum-a-posteriori algorithm and permit a continuous decoding of the coded sequence without requiring trellis termination of the constituent codes. Two basic versions of the continuous algorithm and their suboptimum simplifications are described. Simulation results refer to the applications of the new algorithms to a highly efficient rate 1/3 concatenated code; they show performance only 0.6 dB worse than the Shannon limit

Published in:

Communications, 1996. ICC '96, Conference Record, Converging Technologies for Tomorrow's Applications. 1996 IEEE International Conference on  (Volume:1 )

Date of Conference:

23-27 Jun 1996