Two dimensional spreading for dispersive channels

J. Acharya, Roy D. Yates, Leonid Razoumov
{"title":"Two dimensional spreading for dispersive channels","authors":"J. Acharya, Roy D. Yates, Leonid Razoumov","doi":"10.1109/MILCOM.2005.1605762","DOIUrl":null,"url":null,"abstract":"Systems supporting broadband mobile services over wireless channels suffer from dispersion along time and frequency. Hence transmission by spreading information along both these dimensions leads to diversity gain in each dimension. Motivated by this principle, we propose a generalized two dimensional spreading scheme, in which a symbol is transmitted across several subcarriers with a total power constraint and along each subcarrier it is spread with CDMA codewords. The information theoretic bounds on capacity for this scheme are derived under different assumptions about the channel state information (CSI) available at the transmitter. These are perfect CSI, partial CSI characterized by one bit of channel information per subcarrier and no CSI. The receiver is assumed to have perfect CSI. The optimal codeword and power allocation strategies to achieve these bounds are derived for the single user point to point transmission. The solutions also apply to the cases of synchronous multi-user uplink transmission, or when the receiver schedules transmissions of multiple users. For asynchronous uplink communications, we show that the problem of optimal resource allocation is analytically intractable and instead suggest a heuristic solution, which can be implemented in a distributed manner","PeriodicalId":223742,"journal":{"name":"MILCOM 2005 - 2005 IEEE Military Communications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"MILCOM 2005 - 2005 IEEE Military Communications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MILCOM.2005.1605762","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Systems supporting broadband mobile services over wireless channels suffer from dispersion along time and frequency. Hence transmission by spreading information along both these dimensions leads to diversity gain in each dimension. Motivated by this principle, we propose a generalized two dimensional spreading scheme, in which a symbol is transmitted across several subcarriers with a total power constraint and along each subcarrier it is spread with CDMA codewords. The information theoretic bounds on capacity for this scheme are derived under different assumptions about the channel state information (CSI) available at the transmitter. These are perfect CSI, partial CSI characterized by one bit of channel information per subcarrier and no CSI. The receiver is assumed to have perfect CSI. The optimal codeword and power allocation strategies to achieve these bounds are derived for the single user point to point transmission. The solutions also apply to the cases of synchronous multi-user uplink transmission, or when the receiver schedules transmissions of multiple users. For asynchronous uplink communications, we show that the problem of optimal resource allocation is analytically intractable and instead suggest a heuristic solution, which can be implemented in a distributed manner
色散通道的二维扩展
在无线信道上支持宽带移动服务的系统会受到时间和频率分散的影响。因此,沿着这两个维度传播信息的传播导致每个维度的多样性增益。基于这一原理,我们提出了一种广义的二维传播方案,该方案在总功率约束下将一个符号在多个子载波上传输,并在每个子载波上使用CDMA码字进行传播。在对发射机可用信道状态信息(CSI)的不同假设下,推导了该方案容量的信息理论边界。这些是完美CSI,部分CSI,每个子载波的信道信息为1位,没有CSI。假定接收方具有完美的CSI。针对单用户点对点传输,给出了实现这些边界的最佳码字和功率分配策略。该方案也适用于多用户同步上行传输,或接收方调度多用户传输的情况。对于异步上行通信,我们证明了最优资源分配问题是难以解析的,并提出了一种启发式解决方案,该解决方案可以以分布式方式实现
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信