Application of convolutional interleavers in turbo codes with unequal error protection

• Autorzy: Vafi S. , Wysoki T. A.
• Języki publikacji: EN

Abstrakty

EN

This paper deals with an application of convolutional interleavers in unequal error protection (UEP) turbo codes. The constructed convolutional interleavers act as block interleavers by inserting a number of stuff bits into the interleaver memories at the end of each data block. Based on the properties of this interleaver, three different models of UEP turbo codes are suggested. Simulation results confirm that utilizing UEP can provide better protection for important parts of each data block, while significantly decreasing the number of stuff bits.

Słowa kluczowe

EN

convolutional interleavers; unequal error protection; turbo codes

• Wydawca: Instytut Łączności - Państwowy Instytut Badawczy
• Czasopismo: Journal of Telecommunications and Information Technology
• Rocznik: 2006
• Tom: nr 1
• Strony: 17--23
• Opis fizyczny: Bibliogr. 12 poz., rys., tab.

Twórcy

autor

Vafi S.

autor

Wysoki T. A.

• University of Wollongong, Northfileds Ave, Wollongong, NSW 2522, Australia,

Bibliografia

• [1] C. Berrou, A. Glavieux, and P. Thitimajshima, “Near Shannon limit error-correcting coding and decoding: turbo codes”, in Int. Conf. Commun. ICC, Geneva, Switzerland, 1993, pp. 1064–1070.
• [2] A. S. Barbulescu and S. S. Pietrobon, “Rate compatible turbo codes”, IEE Electron. Lett., vol. 31, no. 7, pp. 535–536, 1995.
• [3] M. Salah, R. A. Rains, and A. Temple, “A general interleaver for equal and unequal error protections of turbo codes with short frames”, in Int. Conf. Inform. Technol. Cod. Comput. ITCC, Las Vegas, USA, 2000, pp. 412–415.
• [4] M. Grangetto, E. Magli, and G. Olmo, “Embedding unequal error protection into turbo codes”, in 35th Asil. Conf. Sig. Syst. Comput., Pacific Grove, USA, 2001, vol. 1, pp. 300–304.
• [5] S. Dolinar and D. Divsalar, “Weight distributions for turbo codes using random and nonrandom permutations”, TDA Progr. Rep., pp. 56–65, 1995.
• [6] M. Ferrari, F. Scalise, and S. Bellini, “Prunable s-random inter-leavers”, in IEEE Int. Conf. Commun. ICC, New York, USA, 2002, vol. 3, pp. 1711–1715.
• [7] P. Popovski, L. Kocarev, and A. Risteski, “Design of flexible-length s-random interleaver for turbo codes”, IEEE Commun. Let., vol. 8, no. 7, pp. 461–463, 2004.
• [8] L. Dioni and S. Benedetto, “Design of fast-prunable s-random interleavers”, IEEE Trans. Wirel. Commun., vol. 4, pp. 2540–2548, 2005.
• [9] S. Vafi and T. Wysocki, “On the performance of turbo codes with convolutional interleavers”, in 11th Asia-Pacific Conf. Commun. APCC, Perth, Australia, 2005, pp. 222–226.
• [10] S. Vafi and T. Wysocki, “Modified convolutional interleavers and their performance in turbo codes”, in 2nd SympoTIC’04, Bratislava, Slovakia, 2004, pp. 54–57.
• [11] G. Caire and E. Biglieri, “Parallel concatenated codes with unequal error protection”, IEEE Trans. Commun., vol. 46, no. 5, pp. 565–567, 1998.
• [12] J. Hagenauer, E. Offer, and L. Papke, “Iterative decoding of bi-nary block and convolutional codes”, IEEE Trans. Inform. Theory, vol. 42, no. 2, pp. 429–445, 1996.