Codeword optimization for uplink CDMA dispersive channels

Authors:
D. C. Popescu;C. Rose
Affiliations:
Dept. of Electr. Eng., Univ. of Texas, San Antonio, TX, USA;-
Venue:
IEEE Transactions on Wireless Communications
Year:
2005

Citing 0
Cited 4

Greedy SINR maximization in collaborative multibase wireless systems

EURASIP Journal on Wireless Communications and Networking - Special issue on multiuser MIMO networks
Widely-linear filtering and non-cooperative transceiver optimization in wireless data networks

GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
Game-theoretic approach to joint transmitter adaptation and power control in wireless systems

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on game theory
Transmitter waveform and widely linear receiver design: noncooperative games for wireless multiple-access networks

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.07

Visualization

Abstract

We present the application of greedy interference avoidance methods to codeword optimization in the uplink of a code division multiple access (CDMA) system in which the channel between a given user and the base station receiver is assumed known and stable for the duration of the transmission. Repeated application of greedy interference avoidance monotonically increases sum capacity and yields an optimal codeword ensemble that satisfies a simultaneous water-filling distribution. However, algorithms for codeword optimization based on the greedy interference avoidance procedure are in general different from water-filling schemes. We illustrate the algorithms with examples and look at properties of optimal codeword ensembles.