Catastrophicity Test for Time-Varying Convolutional Encoders
A new catastrophicity test for convolutional encoders whose rate and generator polynomials vary with time is presented. Based on this test computationally efficient algorithm to determine whether or not a time-varying convolutional encoder is catastrophic is derived. This algorithm is shown to be simpler than the catastrophicity test proposed by Balakirsky . Furthermore, the algorithm can easily be generalised to rate k/n time-varying convolutional encoders.
Unable to display preview. Download preview PDF.
- 1.V.B. Balakirsky, “A necessary and su_cient condition for time-variant convolutional encoders to be noncatastrophic,” Lecture Notes in Computer Science, No. 781, pp. 1–10, Springer-Verlag, 1993.Google Scholar
- 9.C. O’Donoghue, and C.J. Burkley, “Minimality and canonicity tests for rational generator matrices for convolutional codes,” in Proc. 1998 IEEE Information Theory Workshop, pp. 112–114, Killarney, 22-26 June, 1998.Google Scholar