In this paper, polynomial matrix fraction descriptions (MFD’s) are used as a tool for investigating the structure of a (linear) convolutional code and the family of its encoders and syndrome formers. As static feedback and precompensation allow to obtain all minimal encoders (in particular, polynomial encoders and decoupled encoders) of a given code, a sim- ple parametrization of their MFD’s is provided. All minimal syndrome formers, by a duality argument, are obtained by resorting to output injection and postcompensation. Decoupled encoders are finally discussed as well as the possibility of representing a convolutional code as a direct sum of smaller ones.
Matrix fraction descriptions in convolutional coding
FORNASINI, ETTORE;
2004
Abstract
In this paper, polynomial matrix fraction descriptions (MFD’s) are used as a tool for investigating the structure of a (linear) convolutional code and the family of its encoders and syndrome formers. As static feedback and precompensation allow to obtain all minimal encoders (in particular, polynomial encoders and decoupled encoders) of a given code, a sim- ple parametrization of their MFD’s is provided. All minimal syndrome formers, by a duality argument, are obtained by resorting to output injection and postcompensation. Decoupled encoders are finally discussed as well as the possibility of representing a convolutional code as a direct sum of smaller ones.File | Dimensione | Formato | |
---|---|---|---|
science(1)
accesso aperto
Tipologia:
Published (Publisher's Version of Record)
Licenza:
Accesso libero
Dimensione
424.42 kB
Formato
Unknown
|
424.42 kB | Unknown | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.