By Topic

A constructive analysis of the aperiodic binary correlation function

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 aperiodic binary correlation function or correlogramX ast Yoccurs as the output of the detector in the correlation detection of a binary code wordYin an unsynchronized code streamX. In most applications, such as self-synchronizing data links, the correlation properties are determined by the desired system characteristics, and the problem is to find codes that approximate the desired correlation. As a partial solution to this problem, the general algebraic properties ofX ast Yas a function of the code wordsXandYare developed in this paper. In particular, sufficient conditions for the general quadratic equationX ast Y = W ast Zto possess solutions are demonstrated, as well as for the restricted cases in whichW = pm YandZ = pm X, i.e., commutative or anticommutative code word pairs, orY = XandZ = W. The principal tool used in this development is a repeated Kronecker product of palindromic factor code words, which we call pseudo-Rademacher-Walsh (PRW) codes since the simplest examples of such products are the normal Rademacher-Walsh codes. The PRW codes are used as a basis for constructing arbitrarily many nontrivial solutions to each of the four possible correlogram identities.

Published in:

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