Simplified LLRs for the decoding of single parity check turbo product codes transmitted using 16QAM

Authors:
Maher Arar;Claude D'Amours;Abbas Yongacoglu
Affiliations:
School of Information Technology and Engineering (SITE), University of Ottawa, Ottawa, Ontario, Canada;School of Information Technology and Engineering (SITE), University of Ottawa, Ottawa, Ontario, Canada;School of Information Technology and Engineering (SITE), University of Ottawa, Ottawa, Ontario, Canada
Venue:
Research Letters in Communications - Regular issue
Year:
2007

Citing 2
Cited 0

Iterative decoding of binary block and convolutional codes

IEEE Transactions on Information Theory
A primer on turbo code concepts

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

Iterative soft-decision decoding algorithms require channel log-likelihood ratios (LLRs) which, when using 16QAM modulation, require intensive computations to be obtained. Therefore, we derive four simple approximate LLR expressions. When using the maximum a posteriori probability algorithm for decoding single parity check turbo product codes (SPC/TPCs), these LLRs can be simplified even further. We show through computer simulations that the bit-error-rate performance of (8,7)2 and (8,7)3 SPC/TPCs, transmitted using 16QAM and decoded using the maximum a posteriori algorithm with our simplified LLRs, is nearly identical to the one achieved by using the exact LLRs.