Du är här

Minimal and canonical rational generator matrices for convolutional codes

Författare:
Publiceringsår: 1996
Språk: Engelska
Sidor: 1865-1880
Publikation/Tidskrift/Serie: IEEE Transactions on Information Theory
Volym: 42
Nummer: 6, Part 1
Dokumenttyp: Artikel

Sammanfattning

A full-rank IC x n matrix G(D) over the rational
functions F(D) generates a rate R = k/n convolutional code
C. G(D) is minimal if it can be realized with as few memory
elements as any encoder for C, and G(D) is canonical if it has a minimal realization in controller canonical form. We show that G(D) is minimal if and only if for all rational input sequences p1 (D), the span of U (D) G (D) covers the span of ZL (D). Alternatively, G(D) is minimal if and only if G(D) is globally zero-free, or globally invertible. We show that G(D) is canonical if and only if G(D) is minimal and also globally orthogonal, in the valuation-theoretic sense of Monna.

Disputation

Nyckelord

  • Technology and Engineering

Övriga

Published
Yes
"This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder."
  • ISSN: 0018-9448

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

 

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen