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., 1999, Volume 35, Issue 4, Pages 12–28 (Mi ppi458)  

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

Information Theory and Coding Theory

To the Theory of Low-Density Convolutional Codes. I

K. Engdahl, K. Sh. Zigangirov


Abstract: In this paper (which is the first part in a series of three), a formal theory and construction methods for low-density convolutional (LDC) codes (including turbo-codes) are presented. Principles of iterative decoding of LDC codes are formulated and an iterative algorithm for the decoding of homogeneous LDC codes is described. Simulation results are also presented. In the following two parts of this work, the authors intend to perform the statistical analysis of LDC codes and theoretical analysis of iterative decoding.

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

English version:
Problems of Information Transmission, 1999, 35:4, 295–310

Bibliographic databases:
UDC: 621.391.15
Received: 15.12.1998
Revised: 22.02.1999

Citation: K. Engdahl, K. Sh. Zigangirov, “To the Theory of Low-Density Convolutional Codes. I”, Probl. Peredachi Inf., 35:4 (1999), 12–28; Problems Inform. Transmission, 35:4 (1999), 295–310

Citation in format AMSBIB
\Bibitem{EngZig99}
\by K.~Engdahl, K.~Sh.~Zigangirov
\paper To the Theory of Low-Density Convolutional Codes.~I
\jour Probl. Peredachi Inf.
\yr 1999
\vol 35
\issue 4
\pages 12--28
\mathnet{http://mi.mathnet.ru/ppi458}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=1737743}
\zmath{https://zbmath.org/?q=an:0980.94031}
\transl
\jour Problems Inform. Transmission
\yr 1999
\vol 35
\issue 4
\pages 295--310


Linking options:
  • http://mi.mathnet.ru/eng/ppi458
  • http://mi.mathnet.ru/eng/ppi/v35/i4/p12

    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. Engdahl, K, “On the theory of low-density convolutional codes”, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Proceedings, 1719 (1999), 77  crossref  zmath  isi
    2. K. Sh. Zigangirov, M. Lentmaier, “Mathematical Analysis of an Iterative Decoding Algorithm for Low-Density Codes”, Problems Inform. Transmission, 36:4 (2000), 314–324  mathnet  mathscinet  zmath
    3. Engdahl K., Lentmaier M., Truhachev D.V., Zigangirov K.S., “Analytical approach to low-density convolutional codes”, 2000 IEEE International Symposium on Information Theory, Proceedings, 2000, 201–201  crossref  isi
    4. D. V. Trukhachev, M. Lentmaier, K. Sh. Zigangirov, “Some Results Concerning the Design and Decoding of Turbo-Codes”, Problems Inform. Transmission, 37:3 (2001), 190–205  mathnet  crossref  mathscinet  zmath
    5. 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
    6. Wintzell, O, “Asymptotic analysis of superorthogonal turbo codes”, IEEE Transactions on Information Theory, 49:1 (2003), 253  crossref  mathscinet  zmath  isi
    7. Sun J., Valenti M.C., “Optimum frame synchronization for preamble-less packet transmission of turbo codes”, Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems & Computers, Conference Record of the Asilomar Conference on Signals, Systems and Computers, 2004, 1126–1130  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. 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
    10. Chen Z.G., Bates S., Dong X.D., “Low-density parity-check convolutional codes applied to packet based communication systems”, GLOBECOM '05: IEEE Global Telecommunications Conference, IEEE Global Telecommunications Conference (Globecom), 2005, 1250–1254  adsnasa  isi
    11. Sridharan, A, “Distance bounds for an ensemble of LDPC convolutional codes”, IEEE Transactions on Information Theory, 53:12 (2007), 4537  crossref  mathscinet  zmath  isi
    12. Chen Zh., Brandon T.L., Bates S., Elliott D.G., Cockburn B.F., “Efficient Implementation of Low-Density Parity-Check Convolutional Code Encoders With Built-In Termination”, IEEE Transactions on Circuits and Systems i-Regular Papers, 55:11 (2008), 3628–3640  crossref  mathscinet  isi
    13. 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
    14. 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
    15. Truhachev D., Zigangirov K.Sh., Costello Daniel J. Jr., “Distance Bounds for Periodically Time-Varying and Tail-Biting LDPC Convolutional Codes”, IEEE Trans Inform Theory, 56:9 (2010), 4301–4308  crossref  mathscinet  isi  elib
    16. 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
    17. Weng J.-J., Lai Ch.-Ch., Wang Ch.-H., “Decoding of LDPC Convolutional Codes with Rational Parity-Check Matrices from a New Graphical Perspective”, 2010 IEEE International Symposium on Information Theory, IEEE International Symposium on Information Theory, 2010, 789–793  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. Weng J.-J., Wu M.-Ch., Wang Ch.-H., Su Y.-Sh., Wu Ts.-Ch., “Dynamic Scheduling-Aided Decoding Strategies for LDPC Convolutional Codes with Rational Parity-Check Matrices”, 2011 IEEE International Symposium on Information Theory Proceedings (ISIT), 2011  isi
    21. Rathi V., Urbanke R., Andersson M., Skoglund M., “Rate-Equivocation Optimal Spatially Coupled LDPC Codes for the BEC Wiretap Channel”, 2011 IEEE International Symposium on Information Theory Proceedings (ISIT), 2011  isi
    22. Hassani S.H., Macris N., Urbanke R., “Chains of mean-field models”, J Stat Mech Theory Exp, 2012, P02011  crossref  mathscinet  isi
    23. 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
    24. 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
    25. 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
    26. 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
  • Проблемы передачи информации Problems of Information Transmission
    Number of views:
    This page:493
    Full text:200
    References:32
    First page:1

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