Research and Realization by FPGA of Turbo Codes

Article Preview

Abstract:

Turbo Code is a channel coding with excellent error-correcting performance in the condition of low noise-signal ratio.It has a superior decoding performance approaching the Shannon limit by adopting the random coding and decoding. This paper focuses on Turbo code and its implementation with FPGA and deeply analyzes the decoding theory and algorithm of Turbo code. Firstly, it analyzes the decoding theory of Turbo code. Then, it discusses key issues in the process of implementation with the most excellent and complicated Max—log—MAP algorithm. At last, it ends up with the Turbo encoder and decoding algorithm which hardware is successfully implemented finally.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 588-589)

Pages:

765-768

Citation:

Online since:

November 2012

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Y. Liu and G.X. Zhu: Development of Turbo Code, Information and Communications(A Treatise on Electricity and Magnetism, China 2006) p.68–73(In Chinese).

Google Scholar

[2] J. Sun and O.Y. Takeshita: IEEE Communication Letters (Boston, American, 2005)Vol. 9, pp.252-254.

Google Scholar

[3] P. Robertson, P. Hoeher and E. Villebrun: Optimal and sub-optimal maximum a posteriori algorithms suitable for turbo decoding(European Transactions on Telecommunications, August 8, 1997) pp.119-125.

DOI: 10.1002/ett.4460080202

Google Scholar

[4] C. Berrou: IEEE Transactions on Communications (Boston, American, 1996). pp.1261-1271.

Google Scholar

[5] Dolinar S. and Divsalar D. Weight: Distribution for Turbo Codes using random and nonrandom permutations(TDA Progress Report, 1995). pp.42-122.

Google Scholar