By Topic

BER bounds on parallel concatenated single parity check arrays and zigzag 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)
Xiaoling Huang ; Dept. of Electr. & Comput. Eng., State Univ. of New York, Stony Brook, NY, USA ; Phamdo, N. ; Li Ping

A union bound analysis of the bit error probability of parallel concatenated single parity check (SPC) array and zigzag code is presented. It is shown that the union bounds for these codes can be generated very efficiently. It is also shown that the simple codes studied can achieve comparable performances as the turbo codes (yet has much lower decoding costs as discussed in an earlier paper). It illustrates that, for a fixed interleaver size, the concatenated code has increased code potential as its dimension, i.e., the number of interleavers, increases (which raises decoding costs linearly, not exponentially as for increased constraint length). Finally, the analysis shows that the zigzag codes with dimension greater than three have lower error floors than comparable two-dimensional turbo codes.

Published in:

Global Telecommunications Conference, 1999. GLOBECOM '99  (Volume:5 )

Date of Conference:

1999