Efficient distance measurement method for turbo codes that use structured interleavers

被引:0
|
作者
Ould-Cheikh-Mouhamedou, Youssouf [1 ]
Crozier, Stewart
Kabal, Peter
机构
[1] Commun Res Ctr, Ottawa, ON K2H 8S2, Canada
[2] McGill Univ, Dept Elect & Comp Engn, Montreal, PQ, Canada
关键词
turbo codes; tail-biting; minimum distance; structured interleavers; DRP interleaver; DVB-RCS; UMTS;
D O I
10.1109/LCOMM.2006.1638621
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
This letter presents an efficient and accurate distance measurement method for tail-biting turbo codes that use structured interleavers. This method takes advantage of the structure in the interleaver as well as the circular property of tail-biting. As such, it significantly reduces the computational complexity, which allows the accurate determination of high minimum distance (d(min)) in reasonable time. The efficiency of this method is demonstrated by its ability to determine the true d(min) of 51 and the corresponding true multiplicities for a rate-1/3 turbo code that uses the UNITS 8-state polynomial generators and an MPEG-sized interleaver (1504 information bits) in reasonable time.
引用
收藏
页码:477 / 479
页数:3
相关论文
共 50 条
  • [1] Reducing the complexity of distance measurement methods for circular turbo codes that use structured interleavers
    Ould-Cheikh-Mouhamedou, Youssouf
    [J]. INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, 2015, 28 (09) : 1572 - 1579
  • [2] A Simple and Efficient Method for Lowering the Error Floors of Turbo Codes that Use Structured Interleavers
    Ould-Cheikh-Mouhamedou, Youssouf
    [J]. IEEE COMMUNICATIONS LETTERS, 2012, 16 (03) : 392 - 395
  • [3] Interleavers for turbo codes that yield a minimum distance growing with blocklength
    Boutros, J
    Zémor, G
    [J]. 2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2004, : 55 - 55
  • [4] On the Minimum Distance of Turbo Codes With Quadratic Permutation Polynomial Interleavers
    Rosnes, Eirik
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2012, 58 (07) : 4781 - 4795
  • [5] On the Equivalence of Interleavers for Turbo Codes
    Bohorquez, Ronald Garzon
    Nour, Charbel Abdel
    Douillard, Catherine
    [J]. IEEE WIRELESS COMMUNICATIONS LETTERS, 2015, 4 (01) : 58 - 61
  • [6] Bolt interleavers for turbo codes
    Le Bars, P
    Le Dantec, C
    Piret, P
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (02) : 391 - 400
  • [7] Upper bounds on the minimum distance for turbo codes using CPP interleavers
    Lucian Trifina
    Daniela Tarniceriu
    Jonghoon Ryu
    Ana-Mirela Rotopanescu
    [J]. Telecommunication Systems, 2021, 76 : 423 - 447
  • [8] Two Methods To Increase The Minimum Distance For Turbo Codes With QPP Interleavers
    Trifina, Lucian
    Munteanu, Valeriu
    Tarniceriu, Daniela
    [J]. ISSCS 2009: INTERNATIONAL SYMPOSIUM ON SIGNALS, CIRCUITS AND SYSTEMS, VOLS 1 AND 2, PROCEEDINGS,, 2009, : 453 - 456
  • [9] Computing the free distance of turbo codes and serially concatenated codes with interleavers: Algorithms and applications
    Garello, R
    Pierleoni, P
    Benedetto, S
    [J]. IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2001, 19 (05) : 800 - 812
  • [10] Upper bounds on the minimum distance for turbo codes using CPP interleavers
    Trifina, Lucian
    Tarniceriu, Daniela
    Ryu, Jonghoon
    Rotopanescu, Ana-Mirela
    [J]. TELECOMMUNICATION SYSTEMS, 2021, 76 (03) : 423 - 447