By Topic

Strictly complex impulse-equivalent codes and subsets with very uniform amplitude distributions

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)

The generation of a code of length N + 1 with an impulse-equivalent autocorrelation leads to a class of 2^{N} possible signals. Examination of the root patterns of the generating polynomials of these signals shows that many of the codes that appear to be complex have real counterparts with identical amplitude distributions. The existence of a certain subclass of complex codes with no real equivalents is demonstrated. It is conjectured that this subclass, owing to its nontrivially complex nature, will contain those impulse-equivalent codes possessing the most uniform amplitudes. A theorem is offered which provides a necessary and sufficient condition for determining this subclass of purely complex signals. To test the conjecture, all impulse-equivalent codes up to the length 13 of several energy levels are examined under two distinct uniformity-of-amplitude criteria. In every case the most uniform codes are found to be members of the subclass. Finally, "randomly" generated impulse-equivalent codes are investigated. It is shown that a logical interpretation of the notion of random selection leads to a set of impulse-equivalent codes that is generated from maximal shift-register sequences. This set is, in turn, proven to be contained within the nontrivially complex subclass. The amplitude distributions of these shift register-generated codes up to length 64 are examined.

Published in:

Information Theory, IEEE Transactions on  (Volume:15 ,  Issue: 6 )