Abstract
We obtain an efficient algorithm for computing the sum capacity of vector broadcast channel. This algorithm utilizes the duality between broadcast and multiple access channels and the Kuhn-Tucker conditions of sum power multiple access channel.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 467 |
| Number of pages | 1 |
| Journal | IEEE International Symposium on Information Theory - Proceedings |
| State | Published - 2003 |
| Externally published | Yes |
| Event | Proceedings 2003 IEEE International Symposium on Information Theory (ISIT) - Yokohama, Japan Duration: Jun 29 2003 → Jul 4 2003 |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Information Systems
- Modeling and Simulation
- Applied Mathematics
Fingerprint
Dive into the research topics of 'Sum power iterative waterfilling for Gaussian vector broadcast channels'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver