Sum capacity of DS-CDMA with colored noise

P. Viswanath, V. Anantharam
{"title":"Sum capacity of DS-CDMA with colored noise","authors":"P. Viswanath, V. Anantharam","doi":"10.1109/ISIT.2000.866422","DOIUrl":null,"url":null,"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. The 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.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"1999 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2000.866422","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

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. The 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.
带彩色噪声的DS-CDMA总容量
考虑了彩色加性高斯噪声下的直接序列码分多址(DS-CDMA)信道,重点研究了该信道的和容量。从信息论的意义上讲,总容量是用户能够共同可靠传输的速率的最大总和。通过适当地选择用户的签名序列,完整地刻画了最优和容量。我们的表征是建设性的,因为我们提供了一种组合算法来生成最优签名序列,作为附加背景噪声和用户功率约束协方差的函数。该表征还允许我们确定最优和容量的鞍形特性:加性噪声协方差矩阵的凸性和用户功率约束向量的凹性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信