Name
Abstract | ||
|---|---|---|
Decoding complexity of convolutional and trellis codes by Viterbi decoder can be reduced by applying suggested merging algorithm to the Forney code trellis. The algorithm can be applied for every trellis section separately, which is convenient for time-varying codes, and it outputs the minimal trellis of the section. In case of convolutional codes, the same minimal trellis of every section can be obtained from the syndrome trellis of proposed split code. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/REDUNDANCY48165.2019.9003340 | 2019 XVI International Symposium "Problems of Redundancy in Information and Control Systems" (REDUNDANCY) |
Keywords | DocType | ISSN |
maximum-likelihood decoding,time-varying trellis codes,decoding complexity,Viterbi decoder,Forney code trellis,time-varying codes,minimal trellis,convolutional codes,syndrome trellis,split code,merging algorithm | Conference | 2377-6781 |
ISBN | Citations | PageRank |
978-1-7281-1945-8 | 0 | 0.34 |
References | Authors | |
7 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wenhui Li | 1 | 0 | 1.35 |
| Vladimir Sidorenko | 2 | 123 | 17.04 |
| Thomas Jerkovits | 3 | 0 | 0.34 |
| G. Kramer | 4 | 1053 | 77.88 |