TY - GEN
T1 - On Maximum-Likelihood Decoding of Time-Varying Trellis Codes
AU - Li, Wenhui
AU - Sidorenko, Vladimir
AU - Jerkovits, Thomas
AU - Kramer, Gerhard
N1 - Publisher Copyright:
© 2019 IEEE.
PY - 2019/10
Y1 - 2019/10
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85081602516&partnerID=8YFLogxK
U2 - 10.1109/REDUNDANCY48165.2019.9003340
DO - 10.1109/REDUNDANCY48165.2019.9003340
M3 - Conference contribution
AN - SCOPUS:85081602516
T3 - 2019 16th International Symposium "Problems of Redundancy in Information and Control Systems", REDUNDANCY 2019
SP - 104
EP - 109
BT - 2019 16th International Symposium "Problems of Redundancy in Information and Control Systems", REDUNDANCY 2019
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 16th International Symposium "Problems of Redundancy in Information and Control Systems", REDUNDANCY 2019
Y2 - 21 October 2019 through 25 October 2019
ER -