Podrobná bibliografie
| Název: |
Convolutional Codes with Optimum Bidirectional Distance Profile. |
| Autoři: |
Stanojević, I., Šenk, V. |
| Zdroj: |
Problems of Information Transmission; Jul2023, Vol. 59 Issue 3, p181-203, 23p |
| Témata: |
DECODING algorithms, ELECTRONIC information resource searching, DATABASE searching, SUFFIXES & prefixes (Grammar) |
| Abstrakt: |
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. [ABSTRACT FROM AUTHOR] |
|
Copyright of Problems of Information Transmission is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Databáze: |
Complementary Index |
Full Text Finder 
Nájsť tento článok vo Web of Science