An Improved Viterbi Algorithm for a Class of Optimal Binary Convolutional Codes
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929436114288640 |
|---|---|
| author | Abreu, Zita Lieb, Julia Schaller, Michael |
| author_facet | Abreu, Zita Lieb, Julia Schaller, Michael |
| contents | The most famous error-decoding algorithm for convolutional codes is the Viterbi algorithm. In this paper, we present a new reduced complexity version of this algorithm which can be applied to a class of binary convolutional codes with optimum column distances called k-partial simplex convolutional codes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_01279 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | An Improved Viterbi Algorithm for a Class of Optimal Binary Convolutional Codes Abreu, Zita Lieb, Julia Schaller, Michael Information Theory The most famous error-decoding algorithm for convolutional codes is the Viterbi algorithm. In this paper, we present a new reduced complexity version of this algorithm which can be applied to a class of binary convolutional codes with optimum column distances called k-partial simplex convolutional codes. |
| title | An Improved Viterbi Algorithm for a Class of Optimal Binary Convolutional Codes |
| topic | Information Theory |
| url | https://arxiv.org/abs/2402.01279 |