DocumentCode
414917
Title
LDPC codes over channels with memory
Author
Colavolpe, Giulio
Author_Institution
Dipt. di Ingegneria dell´´Informazione, Parma Univ., Italy
Volume
2
fYear
2004
fDate
20-24 June 2004
Firstpage
757
Abstract
In this paper, the problem of detection and decoding of low-density parity-check (LDPC) codes transmitted over channels with memory is addressed. A general method to build a factor graph which takes into account both the code constraints and the channel behavior is described and the a posteriori probabilities of the transmitted symbols are derived by using the sum-product algorithm. A noncoherent channel and a flat fading channel are considered as examples of application.
Keywords
channel coding; demodulation; fading channels; graph theory; maximum likelihood decoding; maximum likelihood detection; parity check codes; LDPC codes; a posteriori probabilities; flat fading channel; low-density parity-check codes; noncoherent channel; sum-product algorithm; transmitted symbols; AWGN; Additive white noise; Decoding; Fading; Gaussian noise; Intersymbol interference; Memoryless systems; Parity check codes; Sum product algorithm; Turbo codes;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications, 2004 IEEE International Conference on
Print_ISBN
0-7803-8533-0
Type
conf
DOI
10.1109/ICC.2004.1312603
Filename
1312603
Link To Document