TY - GEN
T1 - Two dimensional spreading for dispersive channels
AU - Acharya, Joydeep
AU - Yates, Roy D.
AU - Razoumov, Leonid
PY - 2005
Y1 - 2005
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=33847376801&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33847376801&partnerID=8YFLogxK
U2 - 10.1109/MILCOM.2005.1605762
DO - 10.1109/MILCOM.2005.1605762
M3 - Conference contribution
AN - SCOPUS:33847376801
SN - 0780393937
SN - 9780780393936
T3 - Proceedings - IEEE Military Communications Conference MILCOM
BT - MILCOM 2005
T2 - MILCOM 2005: Military Communications Conference 2005
Y2 - 17 October 2005 through 20 October 2005
ER -