THE TRELLIS COMPLEXITY OF CONVOLUTIONAL CODES

摘要

IT HAS LONG BEEN KNOWN THAT CONVOLUTIONAL CODES HAVE A NATURAL, REGULAR TRELLIS STRUCTURE THAT FACILITATES THE IMPLEMENTATION OF VITERBI'S ALGORITHM. IT HAS GRADUALLY BECOME APPARENT THAT LINEAR BLOCK CODES ALSO HAVE A NATURAL, THOUGH NOT IN GENERAL A REGULAR, 'MINIMAL' TRELLIS STRUCTURE, WHICH ALLOWS THEM TO BE DECODED WITH A VITERBI-LIKE ALGORITHM. IN BOTH CASES, THE COMPLEXITY OF THE VITERBI DECODING ALGORITHM CAN BE ACCURATELY ESTIMATED BY THE NUMBER OF TRELLIS EDGES PER ENCODED BIT. IT WOULD, THEREFORE, APPEAR THAT WE ARE IN A GOOD POSITION TO MAKE A FAIR COMPARISON OF THE VITERBI DECODING COMPLEXITY OF BLOCK AND CONVOLUTIONAL CODES. UNFORTUNATELY, HOWEVER, THIS COMPARISON IS SOMEWHAT MUDDLED BY THE FACT THAT SOME CONVOLUTIONAL CODES, THE PUNCTURED CONVOLUTIONAL CODES, ARE KNOWN TO HAVE TRELLIS REPRESENTATIONS THAT ARE SIGNIFICANTLY LESS COMPLEX THAN THE CONVENTIONAL TRELLIS. IN OTHER WORDS, THE CONVENTIONAL TRELLIS REPRESENTATION FOR A CONVOLUTIONAL CODE MAY NOT BE THE MINIMAL TRELLIS REPRESENTATION. THUS, IRONICALLY, AT PRESENT WE SEEM TO KNOW MORE ABOUT THE MINIMAL TRELLIS REPRESENTATION FOR BLOCK THAN FOR CONVOLUTIONAL CODES. IN THIS ARTICLE, WE PROVIDE A REMEDY, BY DEVELOPING A THEORY OF MINIMAL TRELLISES FOR CONVOLUTIONAL CODES. (A SIMILAR THEORY HAS RECENTLY BEEN GIVEN BY SIDORENKO AND ZYABLOV). THIS ALLOWS US TO MAKE A DIRECT PERFORMANCE-COMPLEXITY COMPARISON FOR BLOCK AND CONVOLUTIONAL CODES. A BY-PRODUCT OF OUR WORK IS AN ALGORITHM FOR CHOOSING, FROM AMONG ALL GENERATOR MATRICES FOR A GIVEN CONVOLUTIONAL CODE, WHAT WE CALL A TRELLIS-MINIMAL GENERATOR MATRIX, FROM WHICH THE MINIMAL TRELLIS FOR THE CODE CAN BE DIRECTLY CONSTRUCTED. ANOTHER BY-PRODUCT IS THAT, IN THE NEW THEORY, PUNCTURED CONVOLUTIONAL CODES NO LONGER APPEAR AS A SPECIAL CLASS, BUT SIMPLY AS HIGH-RATE CONVOLUTIONAL CODES WHOSE TRELLIS COMPLEXITY IS UNEXPECTEDLY SMALL.