{"title":"色散通道的二维扩展","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":"{\"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}","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}
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