Du är här

Systematic feed-forward convolutional encoders are better than other encoders with an M-algorithm decoder

Författare:
Publiceringsår: 1998
Språk: Engelska
Sidor: 831-838
Publikation/Tidskrift/Serie: IEEE Transactions on Information Theory
Volym: 44
Dokumenttyp: Artikel

Sammanfattning

Consider nonbacktracking convolutional decoders that keep a fixed number of trellis survivors. It is shown that the error performance of these depends on the early part of the distance profile and on the number of survivors kept, and not on the free distance or the details of the code generators. Particularly, the encoder may be feedforward systematic without loss. Furthermore, this kind of encoder solves the correct path loss problem in reduced-search decoders. Other kinds do not. Therefore, with almost any other decoding method than the Viterbi algorithm, systematic feed-forward encoders should be used. The conclusions in this correspondence run counter to much accepted wisdom about convolutional codes

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