A novel algorithm for efficient generation of large sets of good periodic binary sequences of arbitrary length

Abstract

The author addresses the problem of generating large sets of balanced preferred periodic binary sequences (-1, 1) of arbitrary length N with good correlation properties. The PRHL (phase randomization/hard limiting) algorithm for the generation of such sequences is described and compared to the coin-tossing approach. The PRHL algorithm is shown to yield considerable gain in efficiency in generation of sequences with the required properties. In addition, the sequences found have special average energy properties.<>