Investigation of Turbo Code Polynimials under Constraints Length Four and Deterministic Interleaver

Hassan, Alaa Eldin; Shokair, M.; Abou Elazem, Atef; Schlegel, C.; Truhachev, D.

doi:10.21608/mjeer.2010.66789

Investigation of Turbo Code Polynimials under Constraints Length Four and Deterministic Interleaver

Document Type : Original Article

Authors

¹ Dept. Space Science, National Authority for Remote Sensing and Space Science (NARSS), Cairo, Egypt.

² Dept. Electrical Communication, El-Minufiya University, Menouf, Egypt.

³ Dept. of Computing Science University of Alberta, Edmonton, Canada

⁴ Dept. of Computing Science University of Alberta, Edmonton, Canada.

10.21608/mjeer.2010.66789

Abstract

Turbo coding Technique is one from very powerful error correction techniques that have made a tremendous impact on channel coding in the last few years. It had been recommended for increased capacity at higher transmission rates due to their superior performance over conventional codes. Recursive systematic convolutional (RSC) turbo code uses two polynomials in its encoding circuit which are feed-forward and feed-back polynomials. Those polynomials make great effects on performance of turbo codes in all regions. In this paper, the primitive and non-primitive polynomials will be investigated which are not clarified until now. Their effects on the performance in water-fall region and error floor regions will be elaborated. The minimum Hamming distance and their multiplicities are the criteria for comparison. Simulation results over the AWGN channel show that primitive polynomials in the Feed-back and feed-forward can achieve better performance at high SNR by improving the minimum distance (large minimum distance) which leads to decrease BER in the region of high signal to noise ratio to be used in the satellites new missions. Moreover, the results give a larger minimum distance by factor of 1.12dB compared with the CCSDS interleaver. The simulation is applied for frame length 1784, and code rate 1/2.

References

[1] C. Berrou, A. Glavieux, “Near Optimum Error Correcting Coding and Decoding: Turbo Codes”, IEEE Transactions on Communications, vol. 44, pp. 1261-1271, Oct. 1996.

[2] Consultative Committee for Space Data Systems “Telemetry Channel Coding” Blue Book 2002, 101.0-B-6.

[3] Alaa Eldin Hassan, Mona Shokair, Atef abou Elazm, D.truhachev, C.Schlegel, “Proposed Deterministic interleavers for CCSDS turbo code standard”, Journal of Applied & Theoretical Information Technology (JATIT), vol. 16, no.1, pp 72-79, June 2010.

[4] University of Ancona, Highly Efficient Channel Codes for High Data Rate Missions. Final Report.ESA/ESOC Contract No.15048/01/D/HK(SC).

[5] J. Seghers “On the Free Distance of Turbo Codes and Related Product Codes” Diploma project, Nr 6613, SS 1995.

[6] T. Mingxin, N. He “Turbo Code with Non-primitive Component Codes” WuhanUniversity, 2005.

[7] R. Garello, P .Pierleoni, and S. Benedetto “Computing the Free Distance of Turbo Codes and Serially Concatenated Codes with Interleavers”, IEEE Journal. on Selected Areas in Communications, vol. 19, no.5, May 2001.

[8] O. Takeshita, M. Collins, C. Massey, J. Costello, “A Note on Asymmetric Turbo-Codes”, IEEE Communication Letter, vol. 3, no. 3, Mar. 1999.

[9] P. Calzolari1, F. Chiaraluce, R. Garello and E. Vassallo, Turbo Code Applications: a Journey from a Paper to Realization, pp.321–344, Springer 2005.