Paper Titles

An Energy-Awareness and Congestion-Avoidance Routing Protocol for Mobile Ad Hoc Networks
p.727

Development and Research of an Integrated Platform System for Management and Control
p.732

Accuracy Improvement of GPS Positioning Based on GA-Aided Particle Filter
p.737

A Routing Protocol for Emergency Communication Based on Load Balancing
p.744

Generation of New Collision Free S-Random Interleavers of Turbo Codes
p.750

Optimized Prefetching Scheme to Support VCR-Like Operations in P2P VoD Applications with Guided Seeks
p.756

Dual-Hop Amplify-and-Forward Variable Gain Relaying over Mixture Gamma Fading Channels
p.767

A Privacy-Preserving Intra-Cluster Data Aggregation Method in Wireless Sensor Networks
p.773

Power-Law Property of High Clustering Network Induced by Deactivation Mechanism
p.779

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 719-720Generation of New Collision Free S-Random...

Generation of New Collision Free S-Random Interleavers of Turbo Codes

Article Preview

Abstract:

For high data rate transmission, the parallel turbo decoding can guarantee high communication reliability as well as reduce the decoding latency greatly. A challenge in the design of parallel turbo decoder is the design of collision-free interleavers in order to avoid the memory access collision in the decoding process. In this letter, a novel algorithm for the generation of collision free S-random interleavers of turbo codes is proposed. The proposed algorithm can obtain larger spreading factor, S, and better average code distance than the existing collision free row column S-random interleavers.

You might also be interested in these eBooks

Materials and Engineering Technology

Info:

Periodical:

Applied Mechanics and Materials (Volumes 719-720)

Pages:

750-755

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.719-720.750

Citation:

Cite this paper

Online since:

January 2015

Authors:

Xuan Feng Qiu*, Hong Yu Zhao, Ping Zhi Fan

Keywords:

Collision Free, Interleaver, S-Random, Turbo Code

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

© 2015 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] C. Berrou, A. Glavieux, P. Thitimajshima, Near Shannon limit error-correcting codes and decoding: turbo-codes, Proc. IEEE Int. Conf. Commun., Geneva, Switzerland, 1993, pp.1064-1070.

DOI: 10.1109/icc.1993.397441

[2] J. Sun, O. Takeshita, Interleavers for Turbo Codes Using Permutation Polynomials Over Integer Ring, IEEE Trans. on Inform. Theory, vol. 51, no. 1, pp.101-109, (2005).

DOI: 10.1109/tit.2004.839478

[3] A. Nimbalker, T. K. Blankenship, B. Classon, T. E. Fuja, D. J. Costello Jr., Contention-free interleavers, Proc. 2004 IEEE Int. Symp. Information Theory, Chicago, IL, 2004, p.52.

DOI: 10.1109/isit.2004.1365089

[4] LTE; Evolved Universal Terrestrial Radio Access(E-UTRA); Multiplexing and channel coding(3GPP TS 36. 212 version 10. 6. 0 Release 10), ETSI TS 136 212 V10. 6. 0, 2012-07.

[5] O. Y. Takeshita, On maximum contention-free interleavers and permutation polynomials over integer rings, IEEE Trans. Inform. Theory, vol. 52, no. 3, pp.1249-1253, (2006).

DOI: 10.1109/tit.2005.864450

[6] Charles C. Wang, On the Performance of Turbo Codes, IEEE Military. Conf. on Comm., vol. 3, pp.987-992, (1998).

[7] Hongyu Zhao, Pingzhi Fan, On the equivalence of interleavers for turbo codes using quadratic permutation polynomials over integer rings, IEEE Commun. lett., vol. 14, no. 3, pp.236-238, (2010).

DOI: 10.1109/lcomm.2010.03.091695

[8] Rostislav Dobkin, Michael Peleg, Ran Ginosar, parallel interleaver design and VLSI architecture for low-latency MAP turbo decoders, IEEE Transactions on very large scale integration systems, vol. 13, no. 4, pp.427-438, (2005).

DOI: 10.1109/tvlsi.2004.842916

[9] A. Giulietti, L. Van der Perre, M. Strum, parallel turbo coding interleavers: avoiding collisions in accesses to storage elements, IEEE Electronics lett., vol. 38, no. 5, pp.232-234, (2002).

DOI: 10.1049/el:20020148

[10] Orhan Gazi, Ozgur Yilmaz, Collision free row column S-random interleaver, IEEE Commun. lett., vol. 13, no4, pp.257-259, (2009).

DOI: 10.1109/lcomm.2009.082142

[11] Na Guo, WenPing Ma, Sheng Gao, Tao Ruan, Novel parallel interleaver based on Chinese Remainder Theorem, Information Science and Engineering (ICISE), 2010 2nd International Conference on，Hangzhou, China, pp.1-3, (2010).

DOI: 10.1109/icise.2010.5690432

[12] D. Divsalar, F. Pollara, Turbo codes for PCS applications, IEEE Int. Conf. on Commun. (ICC' 95), Seattle, Gateway to Globalization, vol. 1, pp.54-59, (1995).

DOI: 10.1109/icc.1995.525138

[13] R. Garello, P. Pierleoni, S. Benedetto, Computing the Free Distance of Turbo Codes and Serially Concatenated Codes with Interleavers: Algorithms and Application, IEEE. J. Select. Areas Commun., vol. 19, No. 5, pp.800-812, (2001).

DOI: 10.1109/49.924864

[14] Oscar Y. Takeshita, Permutation Polynomial Interleavers: An Algebraic-Geometric Perspective, IEEE Trans. on Inform. Theory, vol. 32, No. 6, pp.2116-2132, (2007).

DOI: 10.1109/tit.2007.896870

[15] J. Hokfelt, O. Edfors, and T. Maseng, A Turbo code Interleaver Design Criterion Based on the Performance of Iterative Decoding, IEEE Commun. lett., vol. 5, No. 2, pp.52-54, (2001).

DOI: 10.1109/4234.905933