Bounds on the Minimum Distance of High D
โ
Xiangyu Song; Jeffrey Dill; Alan R. Lindsey
๐
Article
๐
2002
๐
Elsevier Science
๐
English
โ 132 KB
This paper derives the upper and lower bounds on the minimum distance of 4-ary circular trellis-coded modulation using a simplex signal constellation. The bounds are shown to be tight and reachable, and the code is shown to achieve simplex distance between parallel paths at each stage of the trellis