TY - GEN
T1 - Reduced-complexity power-efficient wireless OFDMA using an equally probable CSI quantizer
AU - Marques, Antonio G.
AU - Dighamt, Fadel F.
AU - Giannakis, Georgios B.
AU - Ramos, F. Javier
PY - 2007
Y1 - 2007
N2 - Emerging applications involving low-cost wireless sensor networks motivate well optimization of multi-user orthogonal frequency-division multiple access (OFDMA) in the powerlimited regime. In this context, the present paper relies on limitedrate feedback (LRF) sent from the access point to terminals to acquire quantized channel state information (CSI) in order to minimize the total average transmit-power under individual average rate and error probability constraints. Specifically, we introduce two suboptimal reduced-complexity schemes to: (i) allocate power, rate and subcarriers across users; and (ii) design accordingly the channel quantizer. The latter relies on the solution of (i) to design equally probable quantization regions per subcarrier and user. Numerical examples corroborate the analytical claims and reveal that the power savings achieved by our reduced-complexity LRF designs are close to those achieved by the optimal solution.
AB - Emerging applications involving low-cost wireless sensor networks motivate well optimization of multi-user orthogonal frequency-division multiple access (OFDMA) in the powerlimited regime. In this context, the present paper relies on limitedrate feedback (LRF) sent from the access point to terminals to acquire quantized channel state information (CSI) in order to minimize the total average transmit-power under individual average rate and error probability constraints. Specifically, we introduce two suboptimal reduced-complexity schemes to: (i) allocate power, rate and subcarriers across users; and (ii) design accordingly the channel quantizer. The latter relies on the solution of (i) to design equally probable quantization regions per subcarrier and user. Numerical examples corroborate the analytical claims and reveal that the power savings achieved by our reduced-complexity LRF designs are close to those achieved by the optimal solution.
UR - http://www.scopus.com/inward/record.url?scp=38549135150&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=38549135150&partnerID=8YFLogxK
U2 - 10.1109/ICC.2007.484
DO - 10.1109/ICC.2007.484
M3 - Conference contribution
AN - SCOPUS:38549135150
SN - 1424403537
SN - 9781424403530
T3 - IEEE International Conference on Communications
SP - 2912
EP - 2917
BT - 2007 IEEE International Conference on Communications, ICC'07
T2 - 2007 IEEE International Conference on Communications, ICC'07
Y2 - 24 June 2007 through 28 June 2007
ER -