By Topic

Free distance computation of turbo BCH 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

1 Author(s)
Vafi, S. ; Sch. of Eng. & IT, Charles Darwin Univ., Darwin, NT, Australia

The paper presents an algorithm for the free distance determination of turbo Bose Ray Chaudhuri Hocquenghem (BCH) codes constructed by row-column interleavers. The algorithm calculates the minimum weights of turbo BCH codes obtained from input bitstreams having different weights. Among the minimum weights calculated in different cases, the minimum one is being considered as the free distance of turbo BCH codes. This is being achieved applying specifications of the interleaver and constituent BCH codes. Based on the computed free distances, the upper bound of probability of error for different turbo BCH codes is determined. It agrees with simulation results of the code performance in the error floor region.

Published in:

Personal, Indoor and Mobile Radio Communications, 2009 IEEE 20th International Symposium on

Date of Conference:

13-16 Sept. 2009