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 条
  • [21] Up to Five Degree Permutation Polynomial Interleavers for Short Length LTE Turbo Codes With Optimum Minimum Distance
    Trifina, Lucian
    Ryu, Jonghoon
    Tarniceriu, Daniela
    2017 INTERNATIONAL SYMPOSIUM ON SIGNALS, CIRCUITS AND SYSTEMS (ISSCS), 2017,
  • [22] Computing the free distance of turbo codes and serially concatenated codes with interleavers: Algorithms and applications
    Garello, R
    Pierleoni, P
    Benedetto, S
    IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2001, 19 (05) : 800 - 812
  • [23] Combinatorial analysis of the minimum distance of turbo codes
    Breiling, M
    Huber, JB
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (07) : 2737 - 2750
  • [24] The Minimum Distance of Turbo-Like Codes
    Bazzi, Louay
    Mahdian, Mohammad
    Spielman, Daniel A.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (01) : 6 - 15
  • [25] Upper bound on the minimum distance of turbo codes
    Breiling, M
    Huber, JB
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2001, 49 (05) : 808 - 815
  • [26] The performances of interleavers used in turbo codes
    Kovaci, M
    Balta, HG
    Nafornita, MM
    ISSCS 2005: INTERNATIONAL SYMPOSIUM ON SIGNALS, CIRCUITS AND SYSTEMS, VOLS 1 AND 2, PROCEEDINGS, 2005, : 363 - 366
  • [27] Computation of the free distance and low weight distribution of turbo codes with convolutional interleavers
    Vafi, S
    Wysocki, T
    2004 IEEE 15TH INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR AND MOBILE RADIO COMMUNICATIONS, VOLS 1-4, PROCEEDINGS, 2004, : 1356 - 1359
  • [28] On aspects in designing interleavers for turbo codes
    Qi, F
    Wang, MZ
    Shao, DR
    Zhang, YZ
    CHINESE JOURNAL OF ELECTRONICS, 2000, 9 (04): : 410 - 414
  • [29] Performance of turbo codes with matrix interleavers
    Kousa, MA
    ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING, 2003, 28 (2B): : 211 - 220
  • [30] On the Performance of Interleavers for Quantum Turbo Codes
    Etxezarreta Martinez, Josu
    Crespo, Pedro M.
    Garcia-Frias, Javier
    ENTROPY, 2019, 21 (07)
12345