Convolutional Codes with Optimum Bidirectional Distance Profile
Ivan Stanojevi\'c, Vojin \v{S}enk
TL;DR
This paper introduces the bidirectional distance profile for convolutional codes, identifies codes with optimal profiles to enhance decoding efficiency, and compares their performance through simulations.
Contribution
It defines the bidirectional distance profile, presents tables of codes with optimal profiles, and introduces a method to construct such codes efficiently.
Findings
Optimal bidirectional distance profile codes minimize decoding complexity.
Construction of OBDP codes leverages smaller memory ODP codes.
Simulation shows improved performance of OBDP codes.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsError Correcting Code Techniques · Coding theory and cryptography · DNA and Biological Computing