Parallel concatenated gallager codes for CDMA applications

Conference Record / IEEE Global Telecommunications Conference

Volumn 2, Issue , 2001, Pages 1002-1006

  Behairy, Hatim ^a   Chang, Shih Chun ^a  

^a GEORGE MASON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CHANNEL CAPACITY; CODE DIVISION MULTIPLE ACCESS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DECODING; ENCODING (SYMBOLS); GAUSSIAN NOISE (ELECTRONIC); RAYLEIGH FADING; WHITE NOISE;

LOW-DENSITY PARITY-CHECK (LDPC) CODES; PARALLEL CONCATENATED GALLAGER CODES;

CODES (SYMBOLS);

EID: 0035684626     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. Gallager codes for CDMA applications - Part 1: Generalizations, constructions, and performance bounds
2. Gallager codes for CDMA applications - Part II: Implementations, complexity, and system capacity
3. Cellular CDMA
4. Good error-correcting codes based on very sparse matrices
5. Good error-correcting codes based on very sparse matrices
6. Near Shannon limit error-correcting coding and decoding: Turbo-codes
7. Parallel concatenated gallager codes
8. Parallel concatenated gallager codes
9. Iterative decoding of binary block and convolutional codes
10. A low complexity FEC scheme based on the intersection of interleaved block codes
11. The capacity of low-density parity-check codes under message-passing decoding