bit mapping

5 次查看（过去 30 天）

mahaveer hanuman 2011-6-23

0
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/10141-bit-mapping

lets A =[ 1 1 0 after dng some steps i got z=[ 0.2345 1 0 1 1.456 0 0 1 0.0673 . . . ..... . . . ...... . . . ..... 1 1 0] 6.987]

both A and Z have 90 rows in each .now for least value of Z i need to take co-responding value as my out put so can u help me. from above my out is 0 0 1. can any one help me out please

3 个评论
显示 1更早的评论隐藏 1更早的评论

Sean de Wolski 2011-6-23

The answer is in your identical post here:

http://www.mathworks.com/matlabcentral/answers/10135-euclidean-distance-output

Combine that with my hint below.

mahaveer hanuman 2011-6-23

just to give you an idea, this project belongs to 'Channel Coding' subject. So, I have many code words (=90) for which i have computed euclidean distances.

now i want to get the code word corresponding to the minimum euclidean distance as my output!

hope this helps!!

请先登录，再进行评论。

请先登录，再回答此问题。