### Abstract

We consider a Direct Sequence Code Division Multiple Access (DS-CDMA) channel in colored additive Gaussian noise and focus on the sum capacity of this channel. Sum Capacity is the maximum sum of rates at which users can jointly reliably transmit, in an information theoretic sense. We completely characterize optimum sum capacity, which is obtained by choosing the signature sequences of the users appropriately. Our characterization is constructive in that we provide a combinatorial algorithm to generate the optimum signature sequences as a function of the covariance of the additive background noise and power constraints of the users. The characterization also allows us to identify a saddle property of the optimum sum capacity: convexity in the covariance matrix of the additive noise and concavity in the vector of user power constraints.

Original language | English (US) |
---|---|

Number of pages | 1 |

Journal | IEEE International Symposium on Information Theory - Proceedings |

State | Published - Dec 1 2000 |

Externally published | Yes |

Event | 2000 IEEE International Symposium on Information Theory - Serrento, Italy Duration: Jun 25 2000 → Jun 30 2000 |

### Fingerprint

### ASJC Scopus subject areas

- Theoretical Computer Science
- Information Systems
- Modeling and Simulation
- Applied Mathematics

### Cite this

*IEEE International Symposium on Information Theory - Proceedings*.

**Sum capacity of DS-CDMA with colored noise.** / Viswanath, P.; Anantharam, V.

Research output: Contribution to journal › Conference article

}

TY - JOUR

T1 - Sum capacity of DS-CDMA with colored noise

AU - Viswanath, P.

AU - Anantharam, V.

PY - 2000/12/1

Y1 - 2000/12/1

N2 - We consider a Direct Sequence Code Division Multiple Access (DS-CDMA) channel in colored additive Gaussian noise and focus on the sum capacity of this channel. Sum Capacity is the maximum sum of rates at which users can jointly reliably transmit, in an information theoretic sense. We completely characterize optimum sum capacity, which is obtained by choosing the signature sequences of the users appropriately. Our characterization is constructive in that we provide a combinatorial algorithm to generate the optimum signature sequences as a function of the covariance of the additive background noise and power constraints of the users. The characterization also allows us to identify a saddle property of the optimum sum capacity: convexity in the covariance matrix of the additive noise and concavity in the vector of user power constraints.

AB - We consider a Direct Sequence Code Division Multiple Access (DS-CDMA) channel in colored additive Gaussian noise and focus on the sum capacity of this channel. Sum Capacity is the maximum sum of rates at which users can jointly reliably transmit, in an information theoretic sense. We completely characterize optimum sum capacity, which is obtained by choosing the signature sequences of the users appropriately. Our characterization is constructive in that we provide a combinatorial algorithm to generate the optimum signature sequences as a function of the covariance of the additive background noise and power constraints of the users. The characterization also allows us to identify a saddle property of the optimum sum capacity: convexity in the covariance matrix of the additive noise and concavity in the vector of user power constraints.

UR - http://www.scopus.com/inward/record.url?scp=0034449175&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034449175&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:0034449175

JO - IEEE International Symposium on Information Theory - Proceedings

JF - IEEE International Symposium on Information Theory - Proceedings

SN - 2157-8095

ER -