By Topic

Binary pulse compression codes

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)

An analytical technique for generating good binary pulse compression codes is developed. The first step in constructing a code of a given length N is to divide all the residues modulo N and less than N into residue classes. A code digit a(i)=\pm 1 is assigned to all members, i , of certain of these classes and a(i)=-1 to N and all members, i , of the remaining classes. Many of these divisions resulted in difference sets and corresponding binary codes with single-level periodic code correlations. Other divisions resulted in two-level periodic code correlations. In order for a binary pulse compression code to have low autocorrelation sidelobes, its periodic correlation sidelobes must be low. Therefore, codes with low periodic correlations were sought. Good binary codes for lengths just above 100 digits down to lengths near 10 digits were found. Several of them are known to be optimum codes. When programmed on an IBM 7094 , this analytical technique produced codes for lengths near 100 digits as good as, or better than, any previously known binary pulse compression codes in less than 15 minutes computer time.

Published in:

IEEE Transactions on Information Theory  (Volume:13 ,  Issue: 2 )