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

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 4, Pages 15–35 (Mi ppi531)  

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

Information Theory

To the Theory of Low-Density Convolutional Codes. II

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


Abstract: A theoretical and experimental analysis of iterative decoding of low-density convolutional (LDC) codes is given. Two families are investigated: homogeneous LDC codes and a convolutional code version of turbo-codes.

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

English version:
Problems of Information Transmission, 2001, 37:4, 288–306

Bibliographic databases:

UDC: 621.391.15
Received: 19.12.2000
Revised: 23.08.2001

Citation: M. Lentmaier, D. V. Trukhachev, K. Sh. Zigangirov, “To the Theory of Low-Density Convolutional Codes. II”, Probl. Peredachi Inf., 37:4 (2001), 15–35; Problems Inform. Transmission, 37:4 (2001), 288–306

Citation in format AMSBIB
\Bibitem{LenTruZig01}
\by M.~Lentmaier, D.~V.~Trukhachev, K.~Sh.~Zigangirov
\paper To the Theory of Low-Density Convolutional Codes.~II
\jour Probl. Peredachi Inf.
\yr 2001
\vol 37
\issue 4
\pages 15--35
\mathnet{http://mi.mathnet.ru/ppi531}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2101318}
\zmath{https://zbmath.org/?q=an:1038.94012}
\transl
\jour Problems Inform. Transmission
\yr 2001
\vol 37
\issue 4
\pages 288--306
\crossref{https://doi.org/10.1023/A:1013815115684}


Linking options:
  • http://mi.mathnet.ru/eng/ppi531
  • http://mi.mathnet.ru/eng/ppi/v37/i4/p15

    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
    Cycle of papers

    This publication is cited in the following articles:
    1. 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
    2. Wintzell O., Lentmaier M., Zigangirov K.S., “On the asymptotic analysis of superorthogonal turbo codes”, IEEE International Symposium on Information Theory, 2002, 85–85  crossref  isi
    3. Lentmaier M., Truhachev D., Zigangirov K., “Analytic Expression for the Exact BIT Error Probability of the (7,5) Convolutional Code”, ISIT: 2002 IEEE International Symposium on Information Theory, Proceedings, IEEE, 2002, 7  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. Truhachev D., Lentmaier M., Zigangirov K., “On Braided Block Codes”, 2003 IEEE International Symposium on Information Theory - Proceedings, IEEE, 2003, 32  crossref  isi
    6. Pittermann J., Lentmaier M., Zigangirov K., “On Bandwidth-Efficient Convolutional Ldpc Codes”, 2003 IEEE International Symposium on Information Theory - Proceedings, IEEE, 2003, 235  crossref  isi
    7. Lentmaier, M, “Analytic expressions for the bit error probabilities of rate-1/2 memory 2 convolutional encoders”, IEEE Transactions on Information Theory, 50:6 (2004), 1303  crossref  mathscinet  zmath  isi
    8. Lentmaier, M, “An analysis of the block error probability performance of iterative decoding”, IEEE Transactions on Information Theory, 51:11 (2005), 3834  crossref  mathscinet  zmath  isi
    9. Chen, ZG, “Construction of low-density parity-check convolutional codes through progressive edge-growth”, IEEE Communications Letters, 9:12 (2005), 1058  crossref  isi
    10. Ma, LH, “Irregular low-density convolutional codes”, Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences, E88A:8 (2005), 2240  isi
    11. Huebner A., Lentmaier M., Zigangirov K.S., Costello D.J., “Laminated turbo codes”, 2005 IEEE International Symposium on Information Theory (ISIT), 2005, 597–601  crossref  isi
    12. Lentmaier M., Sridharan A., Zigangirov K.S., Costello D.J., “Terminated LDPC convolutional codes with thresholds close to capacity”, 2005 IEEE International Symposium on Information Theory (ISIT), 2005, 1372–1376  crossref  isi
    13. Lehmann F., Maggio G., “Nonlinear Analysis of the Iterative Decoding of Parallel Concatenated Convolutional Codes”, IEEE Trans. Inf. Theory, 51:6 (2005), 2190–2198  crossref  mathscinet  zmath  isi
    14. Pittermann J., Lentmaier M., Zigangirov K., “On Coded Modulation Using Ldpc Convolutional Codes”, AEU-Int. J. Electron. Commun., 59:4 (2005), 254–257  crossref  isi
    15. Wu Ch.-J., Chou Y.-Ch., Wang Ch.-H., Chao Ch.-Ch., “New Construction of LDPC Convolutional Codes”, 2008 IEEE International Symposium on Information Theory Proceedings, 2008, 1040–1044  isi
    16. Lentmaier M., Sridharan A., Costello Daniel J. Jr., Zigangirov K.Sh., “Iterative Decoding Threshold Analysis for LDPC Convolutional Codes”, IEEE Trans Inform Theory, 56:10 (2010), 5274–5289  crossref  mathscinet  isi  elib
    17. Kudekar Sh., Richardson T., Urbanke R., “Threshold Saturation via Spatial Coupling: Why Convolutional LDPC Ensembles Perform so well over the BEC”, IEEE International Symposium on Information Theory, 2010, 684–688  isi
    18. Hassani S.H. Macris N. Urbanke R., “Coupled Graphical Models and their Thresholds”, 2010 IEEE Information Theory Workshop (Itw), IEEE, 2010  isi
    19. Kudekar Sh., Richardson T.J., Urbanke R.L., “Threshold Saturation via Spatial Coupling: Why Convolutional LDPC Ensembles Perform So Well over the BEC”, IEEE Trans Inform Theory, 57:2 (2011), 803–834  crossref  mathscinet  isi  elib
    20. Kasai K., Sakaniwa K., “Spatially-Coupled Mackay-Neal Codes and Hsu-Anastasopoulos Codes”, IEICE Trans. Fundam. Electron. Commun. Comput. Sci., E94A:11 (2011), 2161–2168  crossref  adsnasa  isi  elib
    21. Pusane A.E., Smarandache R., Vontobel P.O., Costello Jr. Daniel J., “Deriving Good Ldpc Convolutional Codes From Ldpc Block Codes”, IEEE Trans. Inf. Theory, 57:2 (2011), 835–857  crossref  mathscinet  isi  elib
    22. Kasai K., Sakaniwa K., “Spatially-Coupled Mackay-Neal Codes and Hsu-Anastasopoulos Codes”, 2011 IEEE International Symposium on Information Theory Proceedings (ISIT), IEEE, 2011, 747–751  crossref  isi
    23. Hassani S.H., Macris N., Urbanke R., “Chains of mean-field models”, J Stat Mech Theory Exp, 2012, P02011  crossref  mathscinet  isi
    24. Tazoe K., Kasai K., Sakaniwa K., “Efficient Termination of Spatially-Coupled Codes”, 2012 IEEE Information Theory Workshop (Itw), IEEE, 2012, 30–34  crossref  isi
    25. Kasai K., Nozaki T., Sakaniwa K., “Spatially-Coupled Binary Mackay-Neal Codes for Channels with Non-Binary Inputs and Affine Subspace Outputs”, 2012 IEEE International Symposium on Information Theory Proceedings (ISIT), IEEE International Symposium on Information Theory, IEEE, 2012, 463–467  isi
    26. Mitchell D.G.M., Pusane A.E., Costello Jr. Daniel J., “Minimum Distance and Trapping Set Analysis of Protograph-Based Ldpc Convolutional Codes”, IEEE Trans. Inf. Theory, 59:1 (2013), 254–281  crossref  mathscinet  isi  elib
    27. Kudekar Sh. Richardson T. Urbanke R.L., “Spatially Coupled Ensembles Universally Achieve Capacity Under Belief Propagation”, IEEE Trans. Inf. Theory, 59:12 (2013), 7761–7813  crossref  mathscinet  isi  elib
    28. Iyengar A.R. Siegel P.H. Urbanke R.L. Wolf J.K., “Windowed Decoding of Spatially Coupled Codes”, IEEE Trans. Inf. Theory, 59:4 (2013), 2277–2292  crossref  mathscinet  isi  elib
    29. Mitchell D.G.M., Dolecek L., Costello Jr. Daniel J., “Absorbing Set Characterization of Array-Based Spatially Coupled Ldpc Codes”, 2014 IEEE International Symposium on Information Theory (Isit), IEEE International Symposium on Information Theory, IEEE, 2014, 886–890  isi
    30. Bocharova I.E., Kudryashov B.D., Johannesson R., “Ldpc Convolutional Codes Versus Qc Ldpc Block Codes in Communication Standard Scenarios”, 2014 IEEE International Symposium on Information Theory (Isit), IEEE International Symposium on Information Theory, IEEE, 2014, 2774–2778  isi
    31. Mitchell D.G.M., Lentmaier M., Costello Jr. Daniel J., “Spatially Coupled Ldpc Codes Constructed From Protographs”, IEEE Trans. Inf. Theory, 61:9 (2015), 4866–4889  crossref  mathscinet  isi  elib
    32. Kudekar Sh., Richardson T.J., Urbanke R.L., “Wave-Like Solutions of General 1-D Spatially Coupled Systems”, IEEE Trans. Inf. Theory, 61:8 (2015), 4117–4157  crossref  mathscinet  isi  elib
    33. Liu K., El-Khamy M., Lee J., “Finite-Length Algebraic Spatially-Coupled Quasi-Cyclic Ldpc Codes”, IEEE J. Sel. Areas Commun., 34:2 (2016), 329–344  crossref  isi
    34. Mori H., Wadayama T., “Band Splitting Permutations For Spatially Coupled Ldpc Codes Achieving Asymptotically Optimal Burst Erasure Immunity”, IEICE Trans. Fundam. Electron. Commun. Comput. Sci., E100A:2 (2017), 663–669  crossref  isi  scopus
    35. Mitchell D.G.M., Rosnes E., 2017 IEEE International Symposium on Information Theory (Isit), IEEE International Symposium on Information Theory, IEEE, 2017  isi
  • Проблемы передачи информации Problems of Information Transmission
    Number of views:
    This page:541
    Full text:206
    References:32

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