Iteration-Aware LDPC Code Design for Low-Power Optical Communications

Recent low-density parity-check (LDPC) codes have shown capacity-approaching performance for various communications systems. However, their promising performance cannot always be obtained due to practical constraints, such as finite codeword length, finite iteration, finite memory, and finite precis...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of lightwave technology Ročník 34; číslo 2; s. 573 - 581
Hlavní autoři: Koike-Akino, Toshiaki, Millar, David S., Kojima, Keisuke, Parsons, Kieran, Miyata, Yoshikuni, Sugihara, Kenya, Matsumoto, Wataru
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 15.01.2016
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
BICM
coded modulation
Decoding
Design methodology
EXIT chart
Iterative decoding
LDPC codes
limited number of BP iterations
Modulation
Pareto optimum
Signal to noise ratio
Trajectory
Pareto optimum
EXIT chart
LDPC codes
limited number of BP iterations
coded modulation
BICM
ISSN:0733-8724, 1558-2213
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Recent low-density parity-check (LDPC) codes have shown capacity-approaching performance for various communications systems. However, their promising performance cannot always be obtained due to practical constraints, such as finite codeword length, finite iteration, finite memory, and finite precision. In this paper, we focus on a practical design method of high-performance LDPC codes under a constraint of finite-iteration decoding for low-power optical communications. We introduce an iteration-aware LDPC code design approach, which is based on decoding trajectory in extrinsic information transfer chart analysis. It is demonstrated that an LDPC code designed by the conventional curve-fitting method exhibits nearly 2 dB of penalty, when the maximum number of iterations is limited. The results suggest that the LDPC code should be adaptively changed, e.g., when the number of decoding iterations is decreased to save power consumption. We also extend our design method to a multi-objective optimization concept by taking average degrees into account, so that the threshold and the computational complexity are minimized at the same time. The proposed Pareto-optimal codes can achieve additional 2-dB gain or 50% complexity reduction at maximum, in low-power decoding scenarios.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0733-8724
1558-2213
DOI:10.1109/JLT.2015.2477881