|1/2010 - 19|
New Code Matched Interleaver for Turbo Codes with Short FramesLAZAR, G. A. , BUZATU, N. R. , COJOCARIU, E. , TRIFINA, L.
|Click to see author's profile on SCOPUS, IEEE Xplore, Web of Science|
|Download PDF (507 KB) | Citation | Downloads: 787 | Views: 2,868|
communication standards, information theory, interleaved coding, modulation coding, permutation codes
turbo(12), codes(11), communications(9), distance(5)
Blue keywords are present in both the references section and the paper title.
About this article
Date of Publication: 2010-02-27
Volume 10, Issue 1, Year 2010, On page(s): 106 - 109
ISSN: 1582-7445, e-ISSN: 1844-7600
Digital Object Identifier: 10.4316/AECE.2010.01019
Web of Science Accession Number: 000275458900019
SCOPUS ID: 77954667270
Turbo codes are a parallel concatenation of two or more convolutional codes, separated by interleavers, therefore their performance is not influenced just by the constituent encoders, but also by the interleaver. For short frame turbo codes, the selection of a proper interleaver becomes critical. This paper presents a new algorithm of obtaining a code matched interleaver leading to a very high minimum distance and improved performance.
|References|||||Cited By «-- Click to see who has cited this paper|
| L. Perez, J. Seghers, D. Costello, "A Distance Spectrum Interpretation of Turbo Codes", IEEE Transactions of Information Theory, Special issue on coding and complexity 1996, pp. 1698-1709 |
[CrossRef] [Web of Science Times Cited 259] [SCOPUS Times Cited 295]
 R. Garello, F. Chiaraluce, P. Pierleoni, M. Scaloni, S. Benedetto, "On the Error Floor and Free Distance of Turbo Codes", IEEE International Conference on Communications 2001, pp. 45-49
[CrossRef] [SCOPUS Times Cited 36]
 F. Chan, "Matched Interleavers for Turbo Codes with Short Frames", Canadian Workshop on Information Theory, 2001
 J. Yuan, B. Vucetic, W. Feng, "Combined Turbo Codes and Interleaver Design", IEEE Transactions on Communications 1999, pp. 484-487
[CrossRef] [Web of Science Times Cited 43] [SCOPUS Times Cited 57]
 W. Feng, J. Yuan, B. Vucetic, "A Code Matched Interleaver Design for Turbo Codes", IEEE Transactions on Communications 2002, pp. 926-937
[CrossRef] [Web of Science Times Cited 31] [SCOPUS Times Cited 42]
 M. C. Valenti, J. Sun, "The UMTS Turbo Code and an Efficient Decoder Implementation Suitable for Software-Defined Radios", International Journal of Wireless Information Networks 2001, pp. 203-215
 J. Hokfelt, O. Edfors, T. Maseng, "On the Theory and Performance of Trellis Termination Methods for Turbo Codes", IEEE Journal on Selected Areas in Communications 2001, pp. 838-847
[CrossRef] [Web of Science Times Cited 18] [SCOPUS Times Cited 25]
 E. Rosnes, O. Ytrehus, "On the Design of Bit-Interleaved Turbo-Coded Modulation with Low Error Floors", IEEE Transactions on Communications 2006, pp. 1563-1573
[CrossRef] [Web of Science Times Cited 12] [SCOPUS Times Cited 13]
 J. Anderson, A. Svensson, "Coded Modulation Systems", Springer Link, 2003 [PermaLink]
 E. Biglieri, "Coding for Wireless Channels", Springer Link, 2005 [PermaLink]
 A. Guillen i Fabregas, A. Martinez, G. Caire, "Bit-Interleaved Coded Modulation", Now Publishers, 2008
 P. Robertson, "Illuminating the Structure of Code and Decoder of parallel concatenated recursive systematic (turbo) codes", IEEE International Conference on Communications 1994, pp 1298-1303
 C. Heegard, S. Wicker, "Turbo Coding", Kluwer Academic Publishers, 1999 [PermaLink]
 R. Garello, P. Pierleoni, S. Benedetto, "Computing the Free Distance of Turbo Codes and Serially Concatenated Codes with Interleavers: Algorithms and Applications", IEEE Journal on Selected Areas in Communications 2001, pp 800-812
[CrossRef] [Web of Science Times Cited 115] [SCOPUS Times Cited 142]
 C. Berrou, S. Vaton, M. Jezequel, C. Douillard, "Computing the minimum distance of linear codes by the error impulse method", Proceedings IEEE Globecommunications, Taipei 2002
 R. Garello, A. Vila, "The all-zero iterative decoding algorithm", Proceedings IEEE International Conference on Communications Paris, pp. 361-364, 2004
[CrossRef] [Web of Science Times Cited 19]
 S. Crozier, P. Guinand, A. Hunt, "Computing the minimum distance of turbo-codes using iterative decoding techniques", Proceedings of Symposium of Communications Kingston 2004, pp. 306-308
Web of Science® Citations for all references: 497 TCR
SCOPUS® Citations for all references: 610 TCR
Web of Science® Average Citations per reference: 29 ACR
SCOPUS® Average Citations per reference: 36 ACR
TCR = Total Citations for References / ACR = Average Citations per Reference
We introduced in 2010 - for the first time in scientific publishing, the term "References Weight", as a quantitative indication of the quality ... Read more
Citations for references updated on 2017-11-17 11:08 in 104 seconds.
Note1: Web of Science® is a registered trademark of Thomson Reuters.
Note2: SCOPUS® is a registered trademark of Elsevier B.V.
Disclaimer: All queries to the respective databases were made by using the DOI record of every reference (where available). Due to technical problems beyond our control, the information is not always accurate. Please use the CrossRef link to visit the respective publisher site.
Faculty of Electrical Engineering and Computer Science
Stefan cel Mare University of Suceava, Romania
All rights reserved: Advances in Electrical and Computer Engineering is a registered trademark of the Stefan cel Mare University of Suceava. No part of this publication may be reproduced, stored in a retrieval system, photocopied, recorded or archived, without the written permission from the Editor. When authors submit their papers for publication, they agree that the copyright for their article be transferred to the Faculty of Electrical Engineering and Computer Science, Stefan cel Mare University of Suceava, Romania, if and only if the articles are accepted for publication. The copyright covers the exclusive rights to reproduce and distribute the article, including reprints and translations.
Permission for other use: The copyright owner's consent does not extend to copying for general distribution, for promotion, for creating new works, or for resale. Specific written permission must be obtained from the Editor for such copying. Direct linking to files hosted on this website is strictly prohibited.
Disclaimer: Whilst every effort is made by the publishers and editorial board to see that no inaccurate or misleading data, opinions or statements appear in this journal, they wish to make it clear that all information and opinions formulated in the articles, as well as linguistic accuracy, are the sole responsibility of the author.