Power Minimization for CDMA under Colored Noise
Data(s) |
01/10/2009
|
---|---|
Resumo |
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 sum-rate 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. |
Formato |
application/pdf |
Identificador |
http://eprints.iisc.ernet.in/24918/1/1.pdf Padakandla, Arun and Sundaresan, Rajesh (2009) Power Minimization for CDMA under Colored Noise. In: IEEE Transactions on communications, 57 (10). pp. 3103-3112. |
Publicador |
IEEE |
Relação |
http://ieeexplore.ieee.org/search/wrapper.jsp?arnumber=5288511 http://eprints.iisc.ernet.in/24918/ |
Palavras-Chave | #Electrical Communication Engineering |
Tipo |
Journal Article PeerReviewed |