Two Methods To Increase The Minimum Distance For Turbo Codes With QPP Interleavers

被引：0
|
作者：
Trifina, Lucian [1 ]
Munteanu, Valeriu [1 ]
Tarniceriu, Daniela [1 ]
机构：
[1] Tech Univ Gh Asachi Iasi, Fac Elect Telecommun & Informat Technol, Iasi 700506, Romania
来源：
ISSCS 2009: INTERNATIONAL SYMPOSIUM ON SIGNALS, CIRCUITS AND SYSTEMS, VOLS 1 AND 2, PROCEEDINGS, | 2009年
关键词：
D O I：
暂无
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
Two search methods of quadratic permutation polynomials (QPP) for interleavers used in turbo codes are proposed. These methods lead to larger minimum distances and smaller multiplicities compared to interleavers proposed by Takeshita in [1]. The search is accomplished in a limited set of polynomials, that is, those for which the spreading factor and Omega' metric are maximum. The minimum distance is computed by means of Garello algorithm in which the maximum weight of information sequence is 3 or 4, reducing the search time. The results obtained for various lengths show the efficiency of the proposed methods.
引用
收藏
页码：453 / 456
页数：4
相关论文
共 50 条
  • [1] About minimum distance for QPP interleavers
    Tarniceriu, Daniela
    Trifina, Lucian
    Munteanu, Valeriu
    ANNALS OF TELECOMMUNICATIONS-ANNALES DES TELECOMMUNICATIONS, 2009, 64 (11-12): : 745 - 751
  • [2] About minimum distance for QPP interleavers
    Daniela Tarniceriu
    Lucian Trifina
    Valeriu Munteanu
    annals of telecommunications - annales des télécommunications, 2009, 64
  • [3] Interleavers for turbo codes that yield a minimum distance growing with blocklength
    Boutros, J
    Zémor, G
    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
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2012, 58 (07) : 4781 - 4795
  • [5] Upper bounds on the minimum distance for turbo codes using CPP interleavers
    Lucian Trifina
    Daniela Tarniceriu
    Jonghoon Ryu
    Ana-Mirela Rotopanescu
    Telecommunication Systems, 2021, 76 : 423 - 447
  • [6] Upper bounds on the minimum distance for turbo codes using CPP interleavers
    Trifina, Lucian
    Tarniceriu, Daniela
    Ryu, Jonghoon
    Rotopanescu, Ana-Mirela
    TELECOMMUNICATION SYSTEMS, 2021, 76 (03) : 423 - 447
  • [7] Further upper bounds on the minimum distance for turbo codes using CPP interleavers
    Trifina, Lucian
    Tarniceriu, Daniela
    Ryu, Jonghoon
    Rotopanescu, Ana-Mirela
    PHYSICAL COMMUNICATION, 2020, 43
  • [8] Further upper bounds on the minimum distance for turbo codes using CPP interleavers
    Trifina, Lucian
    Tarniceriu, Daniela
    Ryu, Jonghoon
    Rotopanescu, Ana-Mirela
    Trifina, Lucian (luciant@etti.tuiasi.ro), 1600, Elsevier B.V., Netherlands (43):
  • [9] Design of Turbo codes based on QPP interleavers for deep-space communication
    Zhang, Guihua
    Ji, Hongbing
    Hu, Jiaquan
    Li, Huilian
    ICIEA 2008: 3RD IEEE CONFERENCE ON INDUSTRIAL ELECTRONICS AND APPLICATIONS, PROCEEDINGS, VOLS 1-3, 2008, : 591 - 595
  • [10] ARP and QPP interleavers for LTE turbo coding
    Nimbalker, Ajit
    Blankenship, Yufei
    Classon, Brian
    Blankenship, T. Keith
    WCNC 2008: IEEE WIRELESS COMMUNICATIONS & NETWORKING CONFERENCE, VOLS 1-7, 2008, : 1032 - 1037
12345