Skip to main content
SpringerLink
Log in

Convolutional Codes with Optimum Bidirectional Distance Profile

  • CODING THEORY
  • Published:
Problems of Information Transmission Aims and scope Submit manuscript

Abstract

We define the bidirectional distance profile (BDP) of a convolutional code as the minimum of the distance profiles of the code and its corresponding “reverse” code. We present tables of codes with the optimum BDP (OBDP), which minimize the average complexity of bidirectional sequential decoding algorithms. The computer search is accelerated by the facts that optimum distance profile (ODP) codes of larger memory must have ODP codes of smaller memory as their “prefixes”, and that OBDP codes can be obtained by “concatenating” ODP and reverse ODP codes of smaller memory. We compare the performance of OBDP codes and other codes by simulation.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1.
Fig. 2.
Fig. 3.
Fig. 4.
Fig. 5.
Fig. 6.

References

  1. Johannesson, R. and Zigangirov, K.Sh., Fundamentals of Convolutional Coding, Pisacataway, NJ: IEEE Press; Hoboken, NJ: Wiley, 2015, 2nd ed.

  2. Zigangirov, K.Sh., Some Sequential Decoding Procedures, Probl. Peredachi Inf., 1966, vol. 2, no. 4, pp. 13–25 [Probl. Inf. Transm. (Engl. Transl.), 1966, vol. 2, no. 4, pp. 1–10]. https://www.mathnet.ru/eng/ppi1966

    Google Scholar 

  3. Jelinek, F., Fast Sequential Decoding Algorithm Using a Stack, IBM J. Res. Develop., 1969, vol. 13, no. 6, pp. 675–685. https://doi.org/10.1147/rd.136.0675

    Article  MathSciNet  Google Scholar 

  4. Fano, R.M., A Heuristic Discussion of Probabilistic Decoding, IEEE Trans. Inform. Theory, 1963, vol. 9, no. 2, pp. 64–74. https://doi.org/10.1109/TIT.1963.1057827

    Article  MathSciNet  Google Scholar 

  5. Chevillat, P. and Costello, D., An Analysis of Sequential Decoding for Specific Time-Invariant Convolutional Codes, IEEE Trans. Inform. Theory, 1978, vol. 24, no. 4, pp. 443–451. https://doi.org/10.1109/TIT.1978.1055916

    Article  MathSciNet  Google Scholar 

  6. Narayanaswamy, B., Negi, R., and Khosla, P., An Analysis of the Computational Complexity of Sequential Decoding of Specific Tree Codes over Gaussian Channels, in Proc. 2008 IEEE Int. Symp. on Information Theory (ISIT’2008), Toronto, ON, Canada, July 6–11, 2008, pp. 2508–2512. https://doi.org/10.1109/ISIT.2008.4595443

  7. Johannesson, R., Robustly Optimal Rate One-Half Binary Convolutional Codes, IEEE Trans. Inform. Theory, 1975, vol. 21, no. 4, pp. 464–468. https://doi.org/10.1109/TIT.1975.1055397

    Article  MathSciNet  Google Scholar 

  8. Johannesson, R., Some Long Rate One-Half Binary Convolutional Codes with an Optimum Distance Profile, IEEE Trans. Inform. Theory, 1976, vol. 22, no. 5, pp. 629–631. https://doi.org/10.1109/TIT.1976.1055599

    Article  MathSciNet  Google Scholar 

  9. Johannesson, R., Some Rate \(1/3\) and \(1/4\) Binary Convolutional Codes with an Optimum Distance Profile, IEEE Trans. Inform. Theory, 1977, vol. 23, no. 2, pp. 281–283. https://doi.org/10.1109/TIT.1977.1055687

    Article  MathSciNet  Google Scholar 

  10. Hagenauer, J., High Rate Convolutional Codes with Good Distance Profiles, IEEE Trans. Inform. Theory, 1977, vol. 23, no. 5, pp. 615–618. https://doi.org/10.1109/TIT.1977.1055777

    Article  Google Scholar 

  11. Johannesson, R. and Paaske, E., Further Results on Binary Convolutional Codes with an Optimum Distance Profile, IEEE Trans. Inform. Theory, 1978, vol. 24, no. 2, pp. 264–268. https://doi.org/10.1109/TIT.1978.1055850

    Article  Google Scholar 

  12. Johannesson, R. and Ståhl, P., New Rate \(1/2\), \(1/3\), and \(1/4\) Binary Convolutional Encoders with an Optimum Distance Profile, IEEE Trans. Inform. Theory, 1999, vol. 45, no. 5, pp. 1653–1658. https://doi.org/10.1109/18.771238

    Article  MathSciNet  Google Scholar 

  13. Sone, N., Mohri, M., Morii, M., and Sasano, H., Optimal Free Distance Convolutional Codes for Rates \(1/2\), \(1/3\), and \(1/4\), Electron. Lett., 1999, vol. 35, no. 15, pp. 1240–1241. https://doi.org/10.1049/el:19990871

    Article  Google Scholar 

  14. Frenger, P., Orten, P., and Ottosson, T., Convolutional Codes with Optimum Distance Spectrum, IEEE Commun. Lett., 1999, vol. 3, no. 11, pp. 317–319. https://doi.org/10.1109/4234.803468

    Article  Google Scholar 

  15. Hug, F., Codes on Graphs and More, PhD Thesis, Dept. of Electrical and Information Technology, Lund Univ., Lund, Sweden, 2012.

  16. Šenk, V. and Radivojac, P., The Bidirectional Stack Algorithm, in Proc. 1997 IEEE Int. Symp. on Information Theory (ISIT’97), Ulm, Germany, June 29 – July 4, 1997, p. 500. https://doi.org/10.1109/ISIT.1997.613437

  17. Kallel, S. and Li, K., Bidirectional Sequential Decoding, IEEE Trans. Inform. Theory, 1997, vol. 43, no. 4, pp. 1319–1326. https://doi.org/10.1109/18.605602

    Article  MathSciNet  Google Scholar 

  18. Bocharova, I.E., Handlery, M., Johannesson, R., and Kudryashov, B.D., BEAST Decoding of Block Codes Obtained via Convolutional Codes, IEEE Trans. Inform. Theory, 2005, vol. 51, no. 5, pp. 1880–1891. https://doi.org/10.1109/TIT.2005.846448

    Article  MathSciNet  Google Scholar 

  19. Xu, R., Kocak, T., Woodward, G., Morris, K., and Dolwin, C., High Throughput Parallel Fano Decoding, IEEE Trans. Commun., 2011, vol. 59, no. 9, pp. 2394–2405. https://doi.org/10.1109/TCOMM.2011.062011.100236

    Article  Google Scholar 

  20. Stanojević, I. and Šenk, V., Convolutional Codes with Optimum Bidirectional Distance Profile, https://arXiv:2210.15787v4 [cs.IT], 2022.

Download references

Funding

This research has been supported by the Ministry of Education, Science and Technological Development of the Republic of Serbia, through the project no. 451-03-68/2020-14/200156: “Innovative Scientific and Artistic Research from the FTS Domain.”

Author information

Authors and Affiliations

  1. Faculty of Technical Sciences, University of Novi Sad, Novi Sad, Serbia

    I. Stanojević & V. Šenk

Authors
  1. I. Stanojević
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. Šenk
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to I. Stanojević.

Ethics declarations

The authors of this work declare that they have no conflicts of interest.

Additional information

Publisher’s Note. Pleiades Publishing remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Stanojević, I., Šenk, V. Convolutional Codes with Optimum Bidirectional Distance Profile. Probl Inf Transm 59, 181–203 (2023). https://doi.org/10.1134/S0032946023030018

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0032946023030018

Keywords

Search

Navigation