By Topic

Comments on "A lower bound on the minimum Euclidean distance of trellis-coded modulation schemes"

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Chi-chao Chao ; Dept. of Electr. Eng., Nat. Tsing Hua Univ., Hsinchu, Taiwan ; Mao-Ching Chiu ; Schlegel, C.

Commentson a paper by Rouanne and Costello Jr. (IEEE Trans. Inform. Theory, vol.34, p.1011-20, 1988). It is shown that the derivation in the above paper is incorrect and hence the lower bound obtained is not valid for general trellis-coded modulation schemes. A corrected bound is presented to remedy this flaw. Also shown is a similar lower bound derived from the average distance structure. Both bounds have similar asymptotic behavior and are linear in the constraint length. Unfortunately, they are bad and not very useful for short and medium constraint lengths. The present author points out that there is still much room for further research in finding a good lower bound on the maximal minimum distance for trellis-coded modulation schemes.<>

Published in:

Information Theory, IEEE Transactions on  (Volume:41 ,  Issue: 5 )