Meeting the Welch and Karystinos-Pados Bounds on DS-CDMA Binary Signature Sets
Designs, Codes and Cryptography
Code-search for optimal TSC binary sequences with low cross-correlation spectrum
MILCOM'03 Proceedings of the 2003 IEEE conference on Military communications - Volume II
Wireless systems and interference avoidance
IEEE Transactions on Wireless Communications
Binary signature sets for increased user capacity on the downlink of cdma systems
IEEE Transactions on Wireless Communications
IEEE Transactions on Information Theory
Iterative construction of optimum signature sequence sets in synchronous CDMA systems
IEEE Transactions on Information Theory
Ensuring convergence of the MMSE iteration for interference avoidance to the global optimum
IEEE Transactions on Information Theory
Sum capacity and TSC bounds in collaborative multibase wireless systems
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Optimal sequences and sum capacity of symbol asynchronous CDMA systems
IEEE Transactions on Information Theory
Rank-2-Optimal Adaptive Design of Binary Spreading Codes
IEEE Transactions on Information Theory
Transmitter adaptation in multicode DS-CDMA systems
IEEE Journal on Selected Areas in Communications
Signature sequence adaptation for DS-CDMA with multipath
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
When data symbols modulate a signature waveform /pattern to move across a channel in the presence of disturbance, 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 will present a formal search procedure of cost linear in the signature code length that returns the maximum-SINR binary signature near chords of least SINR decrease in the Euclidean vector space. The quality of the proposed adaptive binary design will be compared against the theoretical upper bound of the complex/real eigenvector maximizer.