Iterative detection/decoding of majority-logic decodable nonbinary LDPC codes over partial response channels

This paper is concerned with the applications of majority-logic decodable nonbinary low-density parity-check (LDPC) codes to partial response (PR) channels. We propose a joint detection/decoding algorithm that works in an iterative manner by exchanging messages between the Viterbi detector and a gen...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC) s. 200 - 204
Hlavní autori: Shancheng Zhao, Xiao Ma, Baoming Bai
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 01.08.2012
Predmet:
Algorithm design and analysis
Complexity theory
Decoding
Iterative decoding
Low-complexity joint detection/decoding
majority-logic decodable
nonbinary LDPC codes
partial response channels
Signal processing algorithms
turbo equalization
Viterbi algorithm
ISBN:9781457721144, 1457721147
ISSN:2165-4700
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:This paper is concerned with the applications of majority-logic decodable nonbinary low-density parity-check (LDPC) codes to partial response (PR) channels. We propose a joint detection/decoding algorithm that works in an iterative manner by exchanging messages between the Viterbi detector and a generalized majority logic decoder (GMLGD). The Viterbi detector is implemented over a sectionalized trellis. The hard-decisions made by the Viterbi detector are then passed to the decoder. The decoder delivers as output estimates of each coded symbols, which will be utilized in next iteration to update the branch metrics of the trellis. Since the proposed algorithm requires only integer operations and finite field operations, it can be implemented with simple combinational logic circuits. Simulation results and complexity analysis show that, when compared with the conventional turbo equalizer implemented with the BCJR algorithm and the Q-ary sum-product algorithm (BCJR-QSPA), the proposed algorithm has a much lower complexity but suffers from a little performance degradation. So the proposed algorithm provides a good candidate for trade-offs between performance and complexity.
ISBN:9781457721144
1457721147
ISSN:2165-4700
DOI:10.1109/ISTC.2012.6325227