Zigzag codes and concatenated zigzag codes

Author

Ping, Li ; Phamdo, Nam

Author_Institution

Dept. of Electron. Eng., Hong Kong Univ., Hong Kong

fYear

1999

fDate

1999

Firstpage

70

Abstract

This paper introduces a family of error-correcting codes called zigzag codes. A zigzag code is described by a highly structured zigzag graph. Due to the structural properties of the graph, very low-complexity soft-in, soft-out decoding rules can be implemented. We present a decoding rule, based on the Max-Log-MAP (MLM) formulation, which requires a total of only 20 addition-equivalent-operations per information bit, per iteration. Simulation of a rate-1/2, four-dimensional concatenated zigzag code with interleaver length 65536 yields a bit error rate (BER) of 10^-5 at 0.9 dB and 1.4 dB away from the Shannon theoretical limit by optimal (MAP) and low-cost sub-optimal (MLM) decoders, respectively. Furthermore, these codes appear to have lower error floors than the comparable two-dimensional turbo codes

Keywords

concatenated codes; decoding; error correction codes; error statistics; interleaved codes; turbo codes; BER; Max-Log-MAP formulation; bit error rate; decoding rule; error-correcting codes; four-dimensional concatenated zigzag code; highly structured zigzag graph; interleaver length; turbo codes; zigzag codes; Arithmetic; Bit error rate; Concatenated codes; Costs; Data communication; Error correction codes; Iterative decoding; Turbo codes;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory and Networking Workshop, 1999

Conference_Location

Metsovo

Print_ISBN

0-7803-5954-2

Type

conf

DOI

10.1109/ITNW.1999.814376

Filename

814376