Title :
A note on permutation modulation
Author :
Peterson, W. Wesley
Author_Institution :
Dept. of Inf. & Comput. Sci., Hawaii Univ., Honolulu, HI, USA
fDate :
1/1/1997 12:00:00 AM
Abstract :
Slepian (1962) observed that the code points in an n-dimensional variant-1 permutation modulation code actually lie in an n-1-dimensional subspace. In this correspondence, a change of coordinates which gives the representation explicitly in n-1 dimensions is derived. Slepian´s optimum decoding algorithm can be adapted to the codes in this form using an idea of Biglieri and Elia (1976)
Keywords :
decoding; modulation coding; code points; coordinates; n-1 dimensions; n-1-dimensional subspace; n-dimensional variant-1 permutation modulation code; optimum decoding algorithm; permutation modulation; representation; Decoding; Error probability; Gaussian channels; Modulation coding; Symmetric matrices;
Journal_Title :
Information Theory, IEEE Transactions on