Title :
Reduced complexity algebraic type Viterbi decoding of q-ary convolutional codes
Author :
Zigangirov, Kamil Sh
Author_Institution :
Dept. of Telecommun., Lund Univ., Sweden
Abstract :
A reduced complexity algebraic type algorithm is described for decoding of convolutional codes over GF(q), q>2. It is founded on the same principles as algebraic-sequentia1 decoding. It is proved that for large q, the algorithm has better complexity-reliability tradeoff than the conventional Viterbi algorithm
Keywords :
Viterbi decoding; Viterbi decoding; algebraic-sequentia1 decoding; complexity-reliability tradeoff; discrete symmetric memoryless channel; q-ary convolutional codes; reduced complexity algebraic type algorithm; Convolutional codes; Equations; Maximum likelihood decoding; Memoryless systems; Viterbi algorithm;
Conference_Titel :
Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on
Conference_Location :
Whistler, BC
Print_ISBN :
0-7803-2453-6
DOI :
10.1109/ISIT.1995.535738
