Construction of complex-valued simplex signature sets with constant chip magnitude

Authors:
Paul Cotae
Affiliations:
Department of Electrical and Computer Engineering, University of Texas at San Antonio, San Antonio, TX
Venue:
MILCOM'03 Proceedings of the 2003 IEEE conference on Military communications - Volume II
Year:
2003

Citing 6
Cited 0

Matrix analysis

Matrix analysis
Wireless systems and interference avoidance

IEEE Transactions on Wireless Communications
Optimal sequences and sum capacity of synchronous CDMA systems

IEEE Transactions on Information Theory
CDMA systems in fading channels: admissibility, network capacity, and power control

IEEE Transactions on Information Theory
Iterative construction of optimum signature sequence sets in synchronous CDMA systems

IEEE Transactions on Information Theory
Spectral efficiency in the wideband regime

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new algorithm for the design of overloaded real-valued signature sets with total-squared-correlation equal to Welch Bound Equality (WBE) set is presented. It is proved that if K=N+1 the normalized cross correlation between any pair of signatures in a set obtained by the proposed algorithm is either -1/(K-1) or +1/(K-1) and the entire cross correlation matrix G is obtained analytically. Using this algorithm we solved the open problem of existence of complex valued WBE sequence sets with constant chip magnitude in the simplex case. The results are derived in the context of synchronous code division multiple access (CDMA) channels and a numerical example for K=3 and N=2 is given.