Improved Decoding Algorithm of Bit-Interleaved Coded Modulation for LDPC Code

Bit-interleaved coded modulation (BICM), which has been proven to be powerful when applied in low-density parity-check (LDPC) sum-product algorithm (SPA) decoder, is a bandwidth efficient coding scheme. However, the BICM-SPA decoder does not take the statistical dependencies between bits from the sa...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on broadcasting Ročník 56; číslo 1; s. 103 - 109
Hlavní autori: Wang, Ying, Xie, Lei, Chen, Huifang, Wang, Kuang
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York, NY IEEE 01.03.2010
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
Algorithms
Applied sciences
Asymptotic properties
Bandwidth
Bit-Interleaved Coded Modulation (BICM)
Channels
Codes
Coding, codes
Computational complexity
Computational modeling
Decoders
Decoding
Demodulation
Exact sciences and technology
Generalized Distributive Law (GDL)
Information, signal and communications theory
Interleaved codes
Law
Low density parity check codes
Low-Density Parity-Check (LDPC) code
Maximum a posteriori estimation
Modulation
Modulation coding
Modulation, demodulation
Parity check codes
Signal and communications theory
Sum product algorithm
Sum-Product Algorithm (SPA)
Symbols
Telecommunications and information theory
Error estimation
Mapping
Decoding
Algorithm
Computational complexity
Low-Density Parity-Check (LDPC) code
AWGN channels
Bit-Interleaved Coded Modulation (BICM)
Generalized Distributive Law (GDL)
Simulation
Coding
Sum-Product Algorithm (SPA)
Modulation
A posteriori estimation
Interleaved codes
Error correcting code
Parity check codes
Parity check
Demodulation
ISSN:0018-9316, 1557-9611
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Bit-interleaved coded modulation (BICM), which has been proven to be powerful when applied in low-density parity-check (LDPC) sum-product algorithm (SPA) decoder, is a bandwidth efficient coding scheme. However, the BICM-SPA decoder does not take the statistical dependencies between bits from the same L -ary modulated symbol into account so that it cannot converge to the maximum a-posteriori (MAP) decoding algorithm. In this paper, an improved SPA decoding algorithm for the LDPC code, which combines decoding and demodulation, is proposed. The proposed decoding algorithm, referred to as the BICM-ISPA, is based on generalized distributive law and derived from the generalized symbol SPA under certain rational assumptions. And the BICM-ISPA can asymptotically converge to the MAP decoding solution algorithm. Simulation results show that the BICM-ISPA decoder jointly optimizes the decoding error performance and the computational complexity of the LDPC code over the additive white Gaussian noise channel. Compared with the BICM-SPA decoder, the advantage of the BICM-ISPA is quite significant with a large modulation size and in the scenario where Gray mapping cannot be used.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ObjectType-Article-2
ObjectType-Feature-1
ISSN:0018-9316
1557-9611
DOI:10.1109/TBC.2009.2036950