Analyzing the Spectral Deformation Inherent in Binary Pattern Polarity Correlators
M.I.A. Harba · Control 95: Meeting the Challenge of Asia Pacific Growth; Preprints · 1995
The Binary Pattern Correlators are efficient software polarity correlation algorithms. Their efficiency is derived from the fact they rely in their estimation of polarity correlation, on the binary patterns of the polarity sampled signals rather than on individual signals' samples. Further, not all such patterns are necessary, since some patterns have a low probability of occurrence, and hence are ignored. However, this probability is a function of the ratio of sampling rate to the operational bandwidth of the correlated signals. Ignoring the less probable patterns introduce spectral deformation on the correlated signals, and this paper analyses this deformation.