WLCp1-18: SINR-optimized Binary Signatures by Linear Search

When data symbols modulate a signature waveform/pattern to move across a channel in the presence of disturbance, as in common spread-spectrum (SS) or code-division multiple-access (CDMA) or multiuser ultra-wideband (UWB) communication systems, the signature/spreading code that maximizes the signal-to- interference-plus-noise ratio (SINR) at the output of the maximum SINR filter is the smallest-eigenvalue eigenvector of the disturbance autocovariance matrix. In digital communication systems, however, the signature alphabet is finite and digital signature optimization is NP-hard. In this paper, we present a formal search procedure of cost linear in the signature length that returns the maximum-SINR binary signature near lines of least SINR decrease in the Euclidean vector space. The quality of the proposed adaptive binary design is compared against the theoretical upper bound of the complex/real eigenvector maximizer and other known static and adaptive binary signature designs.