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
C. Berrou, A. Glavieux, and P. Thitimajshima, “Near Shannon limit error-correcting coding and decoding: turbo-codes. 1,” in Proceedings of IEEE International Conference on Communications (ICC '93), vol. 2, pp. 1064–1070, Geneva, Switzerland, May 1993.
View at: Publisher Site | Google ScholarD. M. Rankin and T. A. Gulliver, “Single parity check product codes,” IEEE Transactions on Communications, vol. 49, no. 8, pp. 1354–1362, 2001.
View at: Publisher Site | Google ScholarJ. Hagenauer, E. Offer, and L. Papke, “Iterative decoding of binary block and convolutional codes,” IEEE Transactions on Information Theory, vol. 42, no. 2, pp. 429–445, 1996.
View at: Publisher Site | Google ScholarB. Sklar, “A primer on turbo code concepts,” IEEE Communications Magazine, vol. 35, no. 12, pp. 94–102, 1997.
View at: Publisher Site | Google ScholarR. Pyndiah, A. Picart, and A. Glavieux, “Performance of block turbo coded 16-QAM and 64-QAM modulations,” in Proceedings of IEEE Global Telecommunications Conference (GLOBECOM '95), vol. 2, pp. 1039–1043, Singapore, November 1995.
View at: Publisher Site | Google ScholarS. Allpress, C. Luschi, and S. Felix, “Exact and approximated expressions of the log-likelihood ratio for 16-QAM signals,” in Proceedings of the 38th Asilomar Conference on Signals, Systems and Computers (ACSSC '04), vol. 1, pp. 794–798, Pacific Grove, Calif, USA, November 2004.
View at: Publisher Site | Google Scholar