Title :
Minimum distance bounding techniques for individual trellis codes
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;
Journal_Title :
Communications, IEEE Transactions on
