Scheduling for an adaptive number of iterations in turbo equalizers combined with LDPC decoders

Authors:
Myung-Kyu Lee;Kyeongcheol Yang
Affiliations:
Dept. of Electronic and Electrical Engineering, Pohang University of Science and Technology, Pohang, Kyungbuk, Korea;Dept. of Electronic and Electrical Engineering, Pohang University of Science and Technology, Pohang, Kyungbuk, Korea
Venue:
IEEE Transactions on Communications
Year:
2010

Citing 5
Cited 0

The capacity of low-density parity-check codes under message-passing decoding

IEEE Transactions on Information Theory
Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation

IEEE Transactions on Information Theory
Joint message-passing decoding of LDPC codes and partial-response channels

IEEE Transactions on Information Theory
Binary intersymbol interference channels: Gallager codes, density evolution, and code performance bounds

IEEE Transactions on Information Theory
Quasi-cyclic LDPC codes for fast encoding

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new scheduling to reduce the complexity of a turbo equalizer (TE) combined with a low-density parity-check (LDPC) decoder is proposed. Simple metrics and criteria for the proposed scheduling are derived from its convergence behavior. The TE with the proposed scheduling monitors the status of its iterative process and determines whether additional equalization is needed or not. Based on the decision, it adjusts performing equalization and reduces the execution number of equalization. Consequently, this leads to lowering the overall complexity of the TE. Numerical results show that the proposed scheduling has lower complexity than conventional schedulings, while they have almost the same performance.