The peak sidelobe level of families of binary sequences

Authors:
J. Jedwab;K. Yoshida
Affiliations:
Dept. of Math., Simon Fraser Univ., Burnaby, BC, Canada;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 4

There are no Barker arrays having more than two dimensions

Designs, Codes and Cryptography
Golay complementary array pairs

Designs, Codes and Cryptography
Simplified ranging systems using discrete wavelet decomposition

IEEE Transactions on Signal Processing
Typical peak sidelobe level of binary sequences

IEEE Transactions on Information Theory

Quantified Score

Hi-index	754.90

Visualization

Abstract

A numerical investigation is presented for the peak sidelobe level (PSL) of Legendre sequences, maximal length shift register sequences (m-sequences), and Rudin-Shapiro sequences. The PSL gives an alternative to the merit factor for measuring the collective smallness of the aperiodic autocorrelations of a binary sequence. The growth of the PSL of these infinite families of binary sequences is tested against the desired growth rate o(√nlnn) for sequence length n. The claim that the PSL of m-sequences grows like O(√n), which appears frequently in the radar literature, is concluded to be unproven and not currently supported by data. Notable similarities are uncovered between the PSL and merit factor behavior under cyclic rotations of the sequences.