Zigzag Codes and Concatenated Zigzag Codes

Li Ping, Nam Phamdo

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review

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.
Original languageEnglish
Title of host publicationProceedings: 1999 IEEE International Symposium on Information Theory
PublisherIEEE
Pages70-70
ISBN (Print)0780359542
DOIs
Publication statusPublished - Jul 1999
Event1999 IEEE International Symposium on Information Theory (ITW 1999): Information Theory and Networking Workshop - Metsovo, Greece
Duration: 27 Jun 19991 Jul 1999

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
Volume1999-June
ISSN (Print)2157-8095

Conference

Conference1999 IEEE International Symposium on Information Theory (ITW 1999)
Abbreviated titleITW 1999
PlaceGreece
CityMetsovo
Period27/06/991/07/99

Fingerprint

Dive into the research topics of 'Zigzag Codes and Concatenated Zigzag Codes'. Together they form a unique fingerprint.

Cite this