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 条

[31] On the design of prunable interleavers for Turbo codes
Eroz, M
Hammons, AR
1999 IEEE 49TH VEHICULAR TECHNOLOGY CONFERENCE, VOLS 1-3: MOVING INTO A NEW MILLENIUM, 1999, : 1669 - 1673
[32] Performance Evaluation of Interleavers for Turbo Codes
Devamane, Shridhar
Itagi, Rajeshwari
2018 3RD INTERNATIONAL CONFERENCE ON ELECTRICAL, ELECTRONICS, COMMUNICATION, COMPUTER, AND OPTIMIZATION TECHNIQUES (ICEECCOT - 2018), 2018, : 1484 - 1488
[33] Optimum distance quadratic permutation polynomial-based interleavers for turbo codes
Rosnes, Eirik
Takeshita, Oscar Y.
2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6, PROCEEDINGS, 2006, : 1988 - +
[34] Comparison between Ω'- QPP and Random Interleavers for Space-Time Turbo Codes using Doubly Iterative Decoding Algorithm
Rotopanescu, Ana-Mirela
Trifina, Lucian
2011 10TH INTERNATIONAL SYMPOSIUM ON SIGNALS, CIRCUITS AND SYSTEMS (ISSCS), 2011,
[35] On the design of prunable interleavers for turbo codes
Eroz, Mustafa
Hammons Jr., A.Roger
IEEE Vehicular Technology Conference, 1999, 2 : 1669 - 1673
[36] On the performance of turbo codes with convolutional interleavers
Vafi, S
Wysocki, T
2005 ASIA-PACIFIC CONFERENCE ON COMMUNICATIONS (APCC), VOLS 1& 2, 2005, : 222 - 226
[37] Performance of Mobius Interleavers for Turbo Codes
Hosseinalipour, Seyyedali
Sakzad, Amin
Sadeghi, Mohammad-Reza
WIRELESS PERSONAL COMMUNICATIONS, 2018, 98 (01) : 271 - 291
[38] On random interleavers for turbo-codes
Blazek, Z
Gulliver, TA
Bhargava, VK
2001 IEEE PACIFIC RIM CONFERENCE ON COMMUNICATIONS, COMPUTERS AND SIGNAL PROCESSING, VOLS I AND II, CONFERENCE PROCEEDINGS, 2001, : 111 - 114
[39] Permutation polynomials for interleavers in turbo codes
Bravo, CJC
Kumar, PV
2003 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 2003, : 318 - 318
[40] Performance enhancement of modified turbo codes with two-stage interleavers
Bhise, A.
Vyavahare, P. D.
IET COMMUNICATIONS, 2011, 5 (10) : 1336 - 1342

← 1 2 3 4 5 →