By Topic

A note on permutation modulation

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
$33 $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)
W. W. Peterson ; Dept. of Inf. & Comput. Sci., Hawaii Univ., Honolulu, HI, USA

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)

Published in:

IEEE Transactions on Information Theory  (Volume:43 ,  Issue: 1 )