publication . Conference object . 2018

Mitigating Correlation Problems in Turbo Decoders

Garzón-Bohórquez, Ronald; Klaimi, Rami; Abdel Nour, Charbel; Douillard, Catherine;
Open Access
  • Published: 03 Dec 2018
  • Publisher: IEEE
Abstract
International audience; In this paper, new interleaver design criteria for turbo codes are proposed, targeting the reduction of the correlation between component decoders. To go beyond the already known correlation girth maximization, we propose several additional criteria that limit the impact of short correlation cycles and increase code diversity. Two application examples are elaborated, targeting an 8-state binary turbo code and a non-binary turbo code defined over GF(64). The proposed design criteria are shown to improve the error correcting performance of the code, especially in the error floor region.
Subjects
free text keywords: Computer science, Interleaving, Maximization, Turbo code, Algorithm, Binary number, Turbo, biology.organism_classification, biology, Error floor, Correlation, Code diversity, turbo codes, correlation in decoding, asymptotic performance, [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, [SPI.TRON]Engineering Sciences [physics]/Electronics
Funded by
EC| EPIC
Project
EPIC
Enabling Practical Wireless Tb/s Communications with Next Generation Channel Coding
  • Funder: European Commission (EC)
  • Project Code: 760150
  • Funding stream: H2020 | RIA
18 references, page 1 of 2

[1] R. Garzo´n Boho´rquez, C. Abdel Nour, and C. Douillard, “Protographbased interleavers for punctured turbo codes,” IEEE Trans. Commun., vol. 66, no. 5, pp. 1833-1844, May 2018.

[2] J. Hokfelt, O. Edfors, and T. Maseng, “Turbo codes: correlated extrinsic information and its impact on iterative decoding performance,” in Proc. IEEE 49th VTC 1999-Spring, vol. 3, Houston, TX, USA, May 1999, pp. 1871-1875 vol.3. [OpenAIRE]

[3] H. R. Sadjadpour, M. Salehi, N. Sloane, and G. Nebe, “Interleaver design for short block length turbo codes,” in IEEE ICC 2000, vol. 2, New Orleans, LA, USA, June 2000, pp. 628-632. [OpenAIRE]

[4] Y. Saouter, “Selection procedure of turbocode parameters by combinatorial optimization,” in Proc. 6th ISTC, Brest, France, Sept. 2010, pp. 156-160. [OpenAIRE]

[5] J. Sun and O. Takeshita, “Interleavers for turbo codes using permutation polynomials over integer rings,” IEEE Trans. Inf. Theory, vol. 51, no. 1, pp. 101-119, Jan. 2005.

[6] ETSI, “LTE Envolved Universal Terrestrial Radio Access(E-UTRA): Multiplexing and channel coding,” TS 136 212 (V10.0.0), January 2011.

[7] S. Crozier and P. Guinand, “Distance upper bounds and true minimum distance results for turbo-codes designed with DRP interleavers,” Annals of Telecommunications, vol. 60, no. 1-2, pp. 10-28, 2005.

[8] C. Berrou, Y. Saouter, C. Douillard, S. Kerouedan, and M. Jezequel, “Designing good permutations for turbo codes: towards a single model,” in Proc. IEEE ICC'04 , vol. 1, Paris, France, June 2004, pp. 341-345. [OpenAIRE]

[9] ETSI, “Digital Video Broadcasting (DVB): interaction channel for satellite distribution systems,” EN 301 790 (V1.3.1), March 2003.

[10] --, “Digital Video Broadcasting (DVB): second generation DVB interactive satellite system (DVB-RCS2): Part 2: Lower layers for satellite standard,” EN 301 545-2 (V1.1.1), January 2012.

[11] IEEE, “IEEE standard for local and metropolitan area networks, Part 16: Air interface for fixed and mobile broadband wireless access systems,” IEEE Std 802.16-2004/Cor 1-2005, Feb. 2006.

[12] R. Garzo´n Boho´rquez, C. Abdel Nour, and C. Douillard, “On the equivalence of interleavers for turbo codes,” IEEE Wireless Commun. Lett., vol. 4, no. 1, pp. 58-61, Feb. 2015.

[13] X.-Y. Hu, E. Eleftheriou, and D.-M. Arnold, “Progressive edge-growth tanner graphs,” in Proc. IEEE Global Telecommun. Conf., vol. 2, San Antonio, TX, USA, Nov. 2001, pp. 995-1001.

[14] E. Dijkstra, “A note on two problems in connexion with graphs,” Numerische Mathematik, no. 1, pp. 269-271, 1959.

[15] N. Biggs, “Minimal regular graphs with given girth,” in Algebraic graph theory. New York, NY, USA: Cambridge University Press, 1974, pp. 180-190.

18 references, page 1 of 2
Powered by OpenAIRE Open Research Graph
Any information missing or wrong?Report an Issue
publication . Conference object . 2018

Mitigating Correlation Problems in Turbo Decoders

Garzón-Bohórquez, Ronald; Klaimi, Rami; Abdel Nour, Charbel; Douillard, Catherine;