Title :
Reduced state computation of distance spectrum for certain optimal convolutional codes
Author :
Zhang, Weimin ; Schlegel, Christian
Author_Institution :
Mobile Commun. Res. Centre, Univ. of South Australia, The Levels, SA, Australia
Abstract :
For the class of rate 1/2 N-state linear convolutional codes with complementary structure, which includes all of the presently known optimal codes, the authors show that no more than 3N/4 states are required to compute dfree and the distance spectrum. Similar state reductions can also be achieved (although to a smaller extent) for rate 1/n codes, n even. A recursive algorithm is presented for distance spectrum calculation using the reduced state transition matrix
Keywords :
convolutional codes; finite state machines; linear codes; recursive estimation; transfer functions; complementary structure; distance spectrum calculation; linear convolutional codes; optimal convolutional codes; recursive algorithm; reduced state transition matrix; Australia; Convolutional codes; Decoding; Feedforward systems; Hamming distance; Hamming weight; Labeling; Mobile communication; Shift registers; Transfer functions;
Conference_Titel :
Networks, 1993. International Conference on Information Engineering '93. 'Communications and Networks for the Year 2000', Proceedings of IEEE Singapore International Conference on
Print_ISBN :
0-7803-1445-X
DOI :
10.1109/SICON.1993.517758
