Gallager codes for CDMA applications .I. Generalizations, constructions, and performance bounds

Author

Sorokine, Vladislav ; Kschischang, Frank R. ; Pasupathy, Subbarayan

Author_Institution

Dept. of Electr. & Comput. Eng., Toronto Univ., Ont., Canada

Volume

48

Issue

10

fYear

2000

fDate

10/1/2000 12:00:00 AM

Firstpage

1660

Lastpage

1668

Abstract

We focus on applications of low-rate Gallager (1963) (low-density parity-check) codes in code-division multiple-access schemes. The codes that we present here achieve good performance with relatively short frame-lengths in additive white Gaussian noise channels and, perhaps more importantly, in fading channels. These codes can be decoded with low complexity by using iterative decoding procedures. We present a construction that yields good short frame-length Gallager codes. Bounds on the frame-error probability for a maximum-likelihood decoder are obtained.

Keywords

AWGN channels; binary codes; cellular radio; code division multiple access; computational complexity; error correction codes; error detection codes; error statistics; fading channels; iterative decoding; linear codes; maximum likelihood decoding; random codes; CDMA applications; IS-95 cellular radio; additive white Gaussian noise channels; code constructions; code generalizations; code-division multiple-access; error correcting codes; fading channels; frame-error probability; iterative decoding; linear binary code; low complexity; low-density parity-check codes; low-rate Gallager codes; maximum-likelihood decoder; performance; performance bounds; random linear codes; short frame-length Gallager codes; Algorithm design and analysis; Channel capacity; Gaussian channels; Iterative algorithms; Iterative decoding; Maximum likelihood decoding; Multiaccess communication; Parity check codes; Sum product algorithm; Turbo codes;

fLanguage

English

Journal_Title

Communications, IEEE Transactions on

Publisher

ieee

ISSN

0090-6778

Type

jour

DOI

10.1109/26.871391

Filename

871391