DocumentCode :
775776
Title :
Asymptotic Upper Bounds on the Minimum Distance of Trellis Codes
Author :
Calderbank, A. Robert ; Mazo, J.E. ; Wei, Victor K.
Author_Institution :
AT&T Bell Labs., Murray Hill, NJ
Volume :
33
Issue :
4
fYear :
1985
fDate :
4/1/1985 12:00:00 AM
Firstpage :
305
Lastpage :
309
Abstract :
A trellis code is a "sliding window" method of encoding a binary data stream as a sequence of signal points in Rn. When a trellis code is used to encode data at the rate of k bits/channel symbol, each channel input depends not only on the most recent block of k bits to enter the encoder, but will also depend on a set of ν bits preceding this block. The ν bits determine the state of the encoder and the most recent block of k bits generates the channel symbol conditional on the encoder state. The performance of a trellis code depends on a suitably defined minimum distance property of that code. This paper obtains upper bounds on this minimum distance that are better than any previously known.
Keywords :
Trellis coding; Code standards; Communications Society; Convolution; Convolutional codes; Signal mapping; Upper bound;
fLanguage :
English
Journal_Title :
Communications, IEEE Transactions on
Publisher :
ieee
ISSN :
0090-6778
Type :
jour
DOI :
10.1109/TCOM.1985.1096299
Filename :
1096299
Link To Document :
بازگشت