By Topic

Partition turbo decoding of linear block 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

3 Author(s)
Dian-Wu Yue ; Dept. of Electr. & Comput. Eng., Waterloo Univ., Ont., Canada ; Ha Hoang Nguyen ; Shwedyk, E.

Turbo codes, due to their novel coding and decoding techniques and remarkable performance, have attracted considerable interest since 1993. Especially, the turbo decoding principle has been successfully applied to solve many problems in digital communications. We consider how to use the turbo decoding principle to decode a general linear block code, and attempt to give a unified decoding method. It is shown that by partitioning a parity check matrix or a generator matrix of a linear block code, the code can be decoded using the turbo-decoding technique. Simulation results show that different partitions result in different error performance. To compare the error performance of a linear block code using different partitioning strategies, a concept called partition signal-to-noise ratio hierarchy is proposed. Based on this concept, several observations, which include some relating to classical turbo block codes, are given.

Published in:

Telecommunications, 2003. ICT 2003. 10th International Conference on  (Volume:1 )

Date of Conference:

23 Feb.-1 March 2003