A Simplified CE Stopping Criterion for BICM-ID System

Abstract:

The iterative process of bit-interleaved coded modulation iterative decoding (BICM-ID) leads to the increase of computational complexity and decoding delay at the receiver, although it owns remarkable bit-error-rate (BER) performance both in additive Gaussian noise (AWGN) channel and Rayleigh fading channel. A variety of the stopping criteria are put forward to reduce the unnecessary iterations in the process. This paper presents a simplified cross-entropy (CE) stopping criterion based on CE criterion, which sets self-adaptive thresholds for different SNRs to decide whether to calculate the CE in the receiver. Simulation results show that the simplified CE criterion can obtain a better performance and lower computational complexity. The iterative number of the simplified CE criterion is about 12.2% less than the conventional CE criterion.

• Periodical: Applied Mechanics and Materials (Volumes 433-435)
• Pages: 1530-1534
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.433-435.1530
• Online since: October 2013
• Authors: Miao Miao Li, Jian Ping Li
• Keywords: BICM-ID, Ce, Simplified Ce, Stopping Criterion

References

[1] E. Zehavi, 8-PSK trellis codes for a rayleigh fading channel, IEEE Trans. Commun., vol. 40, May. 1992, pp.873-883.

DOI: 10.1109/26.141453

[2] Yuheng Huang, Ritcey J.A., 16-QAM BICM-ID in Fading Channels With Imperfect Channel State Information, IEEE Trans. Wireless Communications, vol. 2, No. 5, September, 2006. pp.1000-1007.

DOI: 10.1109/twc.2003.817432

[3] X. Li, J. Ritcey, Bit-interleaved coded modulation with iterative decoding,. Communications Letters, IEEE, 1997, Nov, 1(6): 169-171.

DOI: 10.1109/4234.649929

[4] X. Li, A. Chindapol, and J.A. Ritcey, Bit interleaved coded modulation with iterative decoding and 8-PSK signaling, IEEE trans Commun., vol. 50, pp.1250-1257, Aug (2002).

DOI: 10.1109/tcomm.2002.801524

[5] Samahi S.S., Goff S., and Sharif B.S., Comparative study for bit-interleavedcoded modulation with iterative decoding, IEEE AICT, pp.316-318, May (2009).

DOI: 10.1109/aict.2009.61

[6] S. Le Goff, A. Glavieux, and C. Berrou, Turbo-codes and high spectral efficiency modulation, " presented at IEEE International Conference on Communications, 1994. ICC 94, SUPERCOMM/ICC, 94, Conference Record, Serving Humanity Through Communications, (1994).

DOI: 10.1109/icc.1994.368804

[7] R. Y. Shao, S. Lin, and M. P.C. Fossorier, Two simple stopping criteria for turbo decoding, IEEE Trans. Commun., vol. 47, pp.1117-1120, Aug (1999).

DOI: 10.1109/26.780444

[8] N. Y. Yu, M. G. Kim, Y. S. Kim, and S. U. Chung, Efficient stopping criterion for iterative decoding of turbo codes, Electron. Lett., vol. 39, pp.73-75, Jan (2003).

DOI: 10.1049/el:20030003

[9] D. Bokolamulla and T. Aulin, A new stopping criterion for iterative decoding, in Proc. IEEE Int. Conf. Commun., pp.538-541, Jun (2004).

DOI: 10.1109/icc.2004.1312547

[10] J. Wu, Z. Wang, B. Vojcic, Partial Iterative Decoding for Binary Turbo Codes via Cross-Entropy Based Bit Selection, Communications, IEEE Trans. Vol. 57, No. 11, Nov. 2009, pp.3298-3306.

DOI: 10.1109/tcomm.2009.11.080182

[11] Li Shan, Xie Lei, Chen Huifang, Wang Kuang, A new stopping criterion for Duo-binary Turbo codes, CMC. IEEE, Vol. 2, 2010, pp.271-274.

DOI: 10.1109/cmc.2010.272

[12] Zhang Shuai, Li Jianping, Cai Chaoshi, An average-entropy-value-based stopping criterion for BICM-ID, WCNIS. 2010, IEEE International Conference on Digital Object Identifier, 2010, pp.98-101.

DOI: 10.1109/wcins.2010.5541897