Meeting the Welch and Karystinos-Pados Bounds on DS-CDMA Binary Signature Sets
Designs, Codes and Cryptography
Separable Convex Optimization Problems with Linear Ascending Constraints
SIAM Journal on Optimization
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
A rate-splitting approach to the Gaussian multiple-access channel
IEEE Transactions on Information Theory
Optimal sequences and sum capacity of synchronous CDMA systems
IEEE Transactions on Information Theory
Optimal sequences for CDMA under colored noise: a Schur-saddle function property
IEEE Transactions on Information Theory
Ensuring convergence of the MMSE iteration for interference avoidance to the global optimum
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Finite-step algorithms for constructing optimal CDMA signature sequences
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
Separable Convex Optimization Problems with Linear Ascending Constraints
SIAM Journal on Optimization
| Hi-index | 0.00 |
Rate-constrained power minimization (PMIN) over a code division multiple-access (CDMA) channel with correlated noise is studied. PMIN is shown to be an instance of a separable convex optimization problem subject to linear ascending constraints. PMIN is further reduced to a dual problem of sumrate maximization (RMAX). The results highlight the underlying unity between PMIN, RMAX, and a problem closely related to PMIN but with linear receiver constraints. Subsequently, conceptually simple sequence design algorithms are proposed to explicitly identify an assignment of sequences and powers that solve PMIN. The algorithms yield an upper bound of 2N - 1 on the number of distinct sequences where N is the processing gain. The sequences generated using the proposed algorithms are in general real-valued. If a rate-splitting and multi-dimensional CDMA approach is allowed, the upper bound reduces to N distinct sequences, in which case the sequences can form an orthogonal set and be binary ±1-valued.