DocumentCode
769370
Title
Minimum distance bounding techniques for individual trellis codes
Author
Porath, J.-E.
Volume
43
Issue
38020
fYear
1995
Firstpage
691
Lastpage
694
Abstract
Lower- and upper distance bounds are developed for arbitrary individual trellis codes. The bounds are evaluated with help of error state trellises. The computational complexity is significantly reduced since pair states are avoided. The bounds may be applied to non-regular codes.<>
Keywords
computational complexity; minimisation; trellis coded modulation; computational complexity; error state trellises; lower-distance bounds; minimum distance bounding techniques; nonregular codes; pair states; trellis codes; upper distance bounds; Computational complexity; Convolutional codes;
fLanguage
English
Journal_Title
Communications, IEEE Transactions on
Publisher
ieee
ISSN
0090-6778
Type
jour
DOI
10.1109/26.380092
Filename
380092
Link To Document