Published June 1997
| public
Book Section - Chapter
Trellis-Canonical Generator Matrices for Convolutional Codes
- Creators
- Lin, Wei
- McEliece, Robert J.
- Xu, Meina
Abstract
It was asserted in without proof, that a canonical generator matrix G(D) is trellis-canonical if and only if G(D) has the property that the span-length of the corresponding scalar matrix "G¯" cannot be reduced by a row operation of the form Row[m]= Row[n]D^s + Row[m], where s is an integer in the range 0⩽s⩽L and m ≠ n. In this paper, we prove a stronger result, viz., a basic PGM is trellis-canonical if and only if it is "row-reduced". An efficient algorithm for converting a basic PGM into a trellis-canonical PGM is presented. We also correct an error in the general algorithm given in [3].
Additional Information
© 1997 IEEE. Date of Current Version: 06 August 2002. This work was partially supported by NSF grant no. NCR-9505975 and a grant from Pacific Bell.Additional details
- Eprint ID
- 28883
- Resolver ID
- CaltechAUTHORS:20120120-100255991
- NCR-9505975
- NSF
- Pacific Bell
- Created
-
2012-01-20Created from EPrint's datestamp field
- Updated
-
2021-11-09Created from EPrint's last_modified field
- Other Numbering System Name
- INSPEC Accession Number
- Other Numbering System Identifier
- 5848779