TY - GEN
T1 - Construction of minimal error-trellises for convolutional codes
AU - Ariel, Meir
AU - Snyders, Jakov
PY - 1994
Y1 - 1994
N2 - A method is presented to construct minimal error-trellises for convolutional codes over GF(q). The number of states of the error-trellis is qσ, where σ is a modified version of the constraint length of the parity check matrix of the code. In comparison with the Viterbi algorithm, substantial reduction in the computational complexity of maximum likelihood soft decoding is enabled by employing an appropriate error-trellis, in combination with methods for accelerated error-search.
AB - A method is presented to construct minimal error-trellises for convolutional codes over GF(q). The number of states of the error-trellis is qσ, where σ is a modified version of the constraint length of the parity check matrix of the code. In comparison with the Viterbi algorithm, substantial reduction in the computational complexity of maximum likelihood soft decoding is enabled by employing an appropriate error-trellis, in combination with methods for accelerated error-search.
UR - http://www.scopus.com/inward/record.url?scp=84894383489&partnerID=8YFLogxK
U2 - 10.1109/ISIT.1994.394955
DO - 10.1109/ISIT.1994.394955
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:84894383489
SN - 0780320158
SN - 9780780320154
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 16
BT - Proceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 1994 IEEE International Symposium on Information Theory, ISIT 1994
Y2 - 27 June 1994 through 1 July 1994
ER -