DocumentCode :
939537
Title :
A new description of trellis codes
Author :
Calderbank, Robert ; Mazo, James E.
Volume :
30
Issue :
6
fYear :
1984
fDate :
11/1/1984 12:00:00 AM
Firstpage :
784
Lastpage :
791
Abstract :
A trellis code is a "sliding window" method of encoding a binary data stream as a sequence of real or complex numbers that are input to a noisy transmission channel. Ungerboeck has constructed simple trellis codes that provide the same noise immunity as is given by increasing the power of uncoded transmission by factors ranging from two to four. His method is to specify an underlying convolutional code and a rule (mapping by set partitioning) that maps the output of this code onto a fixed signal constallation. A new description of a trellis code is given that combines these two steps into one. The new description is analytic rather than graphical. Many practical codes can be described very simply, and strict bounds on performance can be obtained. A method for differential encoding trellis codes is presented that was suggested by the authors\´ representation.
Keywords :
Trellis coding; Convolutional codes; Indexing; Signal mapping;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1984.1056976
Filename :
1056976
Link To Document :
بازگشت