Elements of information theory
Elements of information theory
VLSI architectures for turbo codes
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Turbo codes: principles and applications
Turbo codes: principles and applications
Memory optimization of MAP turbo decoder algorithms
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Turbo Coding, Turbo Equalisation and Space-Time Coding for Transmission over Fading Channels
Turbo Coding, Turbo Equalisation and Space-Time Coding for Transmission over Fading Channels
Truncated Turbo Decoding with Reduced Computational Complexity
Wireless Personal Communications: An International Journal
Error Control Coding, Second Edition
Error Control Coding, Second Edition
Turbo-BLAST for wireless communications: theory and experiments
IEEE Transactions on Signal Processing
Iterative decoding of binary block and convolutional codes
IEEE Transactions on Information Theory
Turbo decoding as an instance of Pearl's “belief propagation” algorithm
IEEE Journal on Selected Areas in Communications
Early detection and trellis splicing: reduced-complexity iterative decoding
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
Near-capacity performance of turbo codes is generally achieved with a large number of decoding iterations. Various iteration stopping rules introduced in the literature often induce performance loss. This paper proposes a novel partial decoding iteration scheme using a bit-level convergence test. We first establish decoding optimality of windowed partial iteration for non-converged bits given that convergence has been achieved on window boundaries. We next present two criteria for testing bit convergence based on cross-entropy, and propose a windowed partial iteration algorithm. The overall complexity and memory requirements of the new algorithm are evaluated and compared with known algorithms. Simulations reveal that the proposed scheme suffers essentially no performance loss compared to full iterations, while reducing the decoding complexity. We also briefly discuss possible extensions of the proposed scheme to general iterative receivers.