New tailbiting encoders
Författare
Summary, in English
In B tailbiting trellis encoder, the starting
state of the encoder is set to the state at which
the machine will be at the end of the encoded frame.
By this means the probability of decoding error at the
end of the frame can be kept low without the addition
of termination bits and the consequent rate loss. We
report on an extensive search for short and moderatelength
convoluticinal encoders for tailbiting trellis representations
of bllock codes at rates 1/4, 1/3, 1/2, and
2/3. The short tailbiting representations found are
typically as good as the best known block codes.
state of the encoder is set to the state at which
the machine will be at the end of the encoded frame.
By this means the probability of decoding error at the
end of the frame can be kept low without the addition
of termination bits and the consequent rate loss. We
report on an extensive search for short and moderatelength
convoluticinal encoders for tailbiting trellis representations
of bllock codes at rates 1/4, 1/3, 1/2, and
2/3. The short tailbiting representations found are
typically as good as the best known block codes.
Publiceringsår
1998
Språk
Engelska
Sidor
389-389
Publikation/Tidskrift/Serie
[Host publication title missing]
Fulltext
- Available as PDF - 130 kB
- Download statistics
Länkar
Dokumenttyp
Konferensbidrag
Ämne
- Electrical Engineering, Electronic Engineering, Information Engineering
Conference name
IEEE International Symposium on Information Theory (ISIT), 1998
Conference date
1998-08-16 - 1998-08-21
Conference place
Cambridge, MA, United States
Status
Published
ISBN/ISSN/Övrigt
- ISBN: 0-7803-5000-6