By Topic

A simple way to compute minimum Euclidean distance for synchronous coded multiuser systems

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

1 Author(s)
Lei Wei ; Dept. of Eng., Australian Nat. Univ., Canberra, ACT, Australia

We show that the minimum squared Euclidean distance for a synchronous multiuser system using convolutional codes is no less than the product of the free distance of the code and the minimum Euclidean distance for the corresponding uncoded synchronous multiuser system. When all users use an identical convolutional code, equality holds. Thus the relationship can be used to compute the minimum squared Euclidean distance for a coded system. The results also indicate that in terms of maximizing the minimum squared Euclidean distance, it is better if all users use nonidentical error control codes.

Published in:

Communications Letters, IEEE  (Volume:2 ,  Issue: 5 )