Binary code imbalance and two measures of average sidelobe level

Abstract

The relationship between binary code imbalance and each of two measures of average autocorrelation sidelobe level is examined. For the first one, the arithmetic mean of signed sidelobes, an especially simple relationship is derived. It is found that the size of this average is minimized when imbalance is as dose as possible to the square root of the code length. The second is the square root of the average mean square sidelobe, where the average is taken over codes having the same imbalance. For this second measure, it is found that for any code length N /spl ges/ 4, there are three extreme points: a local maximum at zero imbalance and two global minima at /spl plusmn/U/sub 0/ for some U/sub 0/ > 0 that depends on N. Formulae are derived for U/sub 0/ in terms of N valid for any integer N /spl ges/ 4. These formulae behave like (3/2)/spl radic/N asymptotically as N increases.