RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Probl. Peredachi Inf., 2001, Volume 37, Issue 3, Pages 6–23 (Mi ppi523)  

This article is cited in 32 scientific papers (total in 32 papers)

Information Theory and Coding Theory

Some Results Concerning the Design and Decoding of Turbo-Codes

D. V. Trukhachev, M. Lentmaier, K. Sh. Zigangirov


Abstract: We consider the following problems related to the construction and analysis of turbo-codes: asymptotic behavior of interleavers (permutors), asymptotic behavior of the minimum distance, and also some examples of practical application of the developed methods to concrete turbo-codes.

Full text: PDF file (2135 kB)
References: PDF file   HTML file

English version:
Problems of Information Transmission, 2001, 37:3, 190–205

Bibliographic databases:

UDC: 621.391.15
Received: 13.02.2001
Revised: 22.05.2001

Citation: D. V. Trukhachev, M. Lentmaier, K. Sh. Zigangirov, “Some Results Concerning the Design and Decoding of Turbo-Codes”, Probl. Peredachi Inf., 37:3 (2001), 6–23; Problems Inform. Transmission, 37:3 (2001), 190–205

Citation in format AMSBIB
\Bibitem{TruLenZig01}
\by D.~V.~Trukhachev, M.~Lentmaier, K.~Sh.~Zigangirov
\paper Some Results Concerning the Design and Decoding of Turbo-Codes
\jour Probl. Peredachi Inf.
\yr 2001
\vol 37
\issue 3
\pages 6--23
\mathnet{http://mi.mathnet.ru/ppi523}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2098981}
\zmath{https://zbmath.org/?q=an:1021.94035}
\transl
\jour Problems Inform. Transmission
\yr 2001
\vol 37
\issue 3
\pages 190--205
\crossref{https://doi.org/10.1023/A:1013821922527}


Linking options:
  • http://mi.mathnet.ru/eng/ppi523
  • http://mi.mathnet.ru/eng/ppi/v37/i3/p6

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. M. Lentmaier, D. V. Trukhachev, K. Sh. Zigangirov, “To the Theory of Low-Density Convolutional Codes. II”, Problems Inform. Transmission, 37:4 (2001), 288–306  mathnet  crossref  mathscinet  zmath
    2. Zigangirov K.S., Lentmaier M., Truhachev D., “Two approaches to the analysis of low-density parity-check codes”, ISIT: 2002 IEEE International Symposium on Information Theory, Proceedings, 2002, 29–29  crossref  isi
    3. Truhachev D., Lentmaier M., Wintzell O., Zigangirov K.S., “On the minimum distance of turbo codes”, ISIT: 2002 IEEE International Symposium on Information Theory, Proceedings, 2002, 84–84  crossref  isi
    4. Wintzell O., Lentmaier M., Zigangirov K.Sh., “Asymptotic analysis of superorthogonal turbo codes”, IEEE Trans. Inform. Theory, 49:1 (2003), 253–258  crossref  mathscinet  zmath  isi
    5. Huebner A., Truhachev D., Zigangirov K.S., “On cycle-based permutor designs for serially concatenated convolutional codes”, 2003 IEEE International Symposium on Information Theory - Proceedings, 2003, 279–279  crossref  isi
    6. Perotti A., Benedetto S., “A new upper bound on the minimum distance of turbo codes”, IEEE Trans. Inform. Theory, 50:12 (2004), 2985–2997  crossref  mathscinet  zmath  isi
    7. Huebner A., Truhachev D.V., Zigangirov K.Sh., “On permutor designs based on cycles for serially concatenated convolutional codes”, IEEE Transactions on Communications, 52:9 (2004), 1494–1503  crossref  isi
    8. Breiling M., “A logarithmic upper bound on the minimum distance of turbo codes”, IEEE Trans. Inform. Theory, 50:8 (2004), 1692–1710  crossref  mathscinet  zmath  isi
    9. Lentmaier M., Truhachev D.V., Zigangirov K.Sh., “Analytic expressions for the bit error probabilities of rate-1/2 memory 2 convolutional encoders”, IEEE Trans. Inform. Theory, 50:6 (2004), 1303–1311  crossref  mathscinet  zmath  isi
    10. Boutros J., Zemor G., “Interleavers for turbo codes that yield a minimum distance growing with blocklength”, 2004 IEEE International Symposium on Information Theory, Proceedings, 2004, 55–55  crossref  isi
    11. Huebner A., Costello D.J., “A simple method of approximating the error floor of turbo codes with S-type permutors”, 2004 IEEE International Symposium on Information Theory, Proceedings, 2004, 474–474  isi
    12. Lentmaier M., Truhachev D.V., Zigangirov K.Sh., Costello D.J. (Jr.), “An analysis of the block error probability performance of iterative decoding”, IEEE Trans. Inform. Theory, 51:11 (2005), 3834–3855  crossref  mathscinet  zmath  isi  elib
    13. He Ching, Lentmaier M., Costello D.J. (Jr.), Zigangirov K.Sh., “Joint permutor analysis and design for multiple turbo codes”, IEEE Trans. Inform. Theory, 52:9 (2006), 4068–4083  crossref  mathscinet  zmath  isi
    14. Huebner A., Zigangirov K.Sh., Costello D.J., “A new cycle-based joint permutor design for multiple turbo codes”, IEEE Transactions on Communications, 54:6 (2006), 961–965  crossref  isi
    15. Liu Ruoheng, Spasojević P., Soljanin E., “Reliable channel regions for good binary codes transmitted over parallel channels”, IEEE Trans. Inform. Theory, 52:4 (2006), 1405–1424  crossref  mathscinet  zmath  adsnasa  isi
    16. Boutros J.J., Zémor G., “On quasi-cyclic interleavers for parallel turbo codes”, IEEE Trans. Inform. Theory, 52:4 (2006), 1732–1739  crossref  mathscinet  zmath  isi
    17. Huebner A., Jordan R., “On higher order permutors for serially concatenated convolutional codes”, IEEE Trans. Inform. Theory, 52:3 (2006), 1238–1248  crossref  mathscinet  zmath  isi  elib
    18. Mazumdar A., Chaturvedi A.K., Banerjee A., “Construction of turbo code interleavers from 3-regular Hamiltonian graphs”, IEEE Communications Letters, 10:4 (2006), 284–286  crossref  isi
    19. Huebner A., Costello D. J. Jr., “On the design of S-type permutors for double serially concatenated convolutional codes”, 2006 IEEE Information Theory Workshop, 2006, 188–192  crossref  isi
    20. Huebner A., Zigangirov K.Sh., Costello D. J. Jr., “On the free distance of convolutional turbo codes”, 2006 IEEE International Symposium on Information Theory, 2006, 1638–1642  crossref  isi
    21. Zhang W., Costello Daniel J. Jr., “On the design of high rate multiple turbo codes”, 2006 IEEE International Symposium on Information Theory, 2006, 2564–2568  crossref  isi
    22. Garin F., Fagnani F., “Analysis of serial turbo codes over abelian groups for symmetric channels”, SIAM J. Discrete Math., 22:4 (2008), 1488–1526  crossref  mathscinet  zmath  isi
    23. Huebner A., Zigangirov K.Sh., Costello D.J. (Jr.), “Laminated turbo codes: A new class of block-convolutional codes”, IEEE Trans. Inform. Theory, 54:7 (2008), 3024–3034  crossref  mathscinet  zmath  isi  elib
    24. Fagnani F., “Performance of parallel concatenated coding schemes”, IEEE Trans. Inform. Theory, 54:4 (2008), 1521–1535  crossref  mathscinet  zmath  isi
    25. Saouter Ya., “Selection procedure for binary turbocode permutation parameters”, 2008 5th International Symposium on Turbo Codes and Related Topics, 2008, 272–276  crossref  isi
    26. Li H., Ji H., Hu J., Liu Q., “A new joint permutor design for multiple turbo codes”, Iciea 2008: 3rd IEEE Conference on Industrial Electronics and Applications, Proceedings, IEEE Conference on Industrial Electronics and Applications, 2008, 2259–2262  crossref  isi
    27. Huebner A., Kliewer J., Costello D.J., “Double serially concatenated convolutional codes with jointly designed S-type permutors”, IEEE Transactions on Information Theory, 55:12 (2009), 5811–5821  crossref  mathscinet  isi
    28. Sakzad A., Sadeghi M.-R., Panario D., “Cycle Structure of Permutation Functions Over Finite Fields and their Applications”, Adv. Math. Commun., 6:3 (2012), 347–361  crossref  mathscinet  zmath  isi
    29. Rosnes E., “On the Minimum Distance of Turbo Codes with Quadratic Permutation Polynomial Interleavers”, IEEE Trans. Inf. Theory, 58:7 (2012), 4781–4795  crossref  mathscinet  isi
    30. Ravazzi Ch., Fagnani F., “On the Growth Rate of the Input-Output Weight Distribution of Convolutional Encoders”, SIAM Discret. Math., 26:3 (2012), 1310–1345  crossref  mathscinet  zmath  isi  elib
    31. Garzon-Bohorquez R., Nour Ch.A., Douillard C., “Protograph-Based Interleavers For Punctured Turbo Codes”, IEEE Trans. Commun., 66:5 (2018), 1833–1844  crossref  isi  scopus
    32. Hosseinalipour S., Sakzad A., Sadeghi M.-R., “Performance of Mobius Interleavers For Turbo Codes”, Wirel. Pers. Commun., 98:1 (2018), 271–291  crossref  isi  scopus
  • Проблемы передачи информации Problems of Information Transmission
    Number of views:
    This page:654
    Full text:253
    References:46

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020