Efficient water-filling algorithms for a Gaussian multiaccess channel with ISI

Author

Zeng, Chaohuang ; Hoo, Louise M C ; Cioff, J.M.

Author_Institution

Dept. of Electr. Eng., Stanford Univ., CA, USA

Volume

3

fYear

2000

fDate

2000

Firstpage

1072

Abstract

Although the optimum transmit power spectral density (PSD) of each user in a Gaussian multiaccess channel is theoretically available, efficient algorithms are needed to obtain the optimal PSD numerically. This paper presents two water-filling algorithms for the scenario where all users have the same priorities. First we propose for a two-user channel an exact algorithm with a computational complexity of O(Nlog₂N), where N is the number of subchannels. Then we develop a heuristic algorithm for K>2 users that has O(K²Nlog₂N) complexity and achieves more than 98% of the optimum data rate in all of the channels we simulated

Keywords

Gaussian channels; computational complexity; intersymbol interference; multi-access systems; spectral analysis; Gaussian multiaccess channel; ISI; channel simulation; computational complexity; efficient water-filling algorithms; heuristic algorithm; optimum data rate; optimum transmit power spectral density; subchannels; two-user channel; Approximation algorithms; Chaos; Computational complexity; Computational modeling; Filling; Frequency conversion; Gaussian channels; Heuristic algorithms; Intersymbol interference; Transfer functions;

fLanguage

English

Publisher

ieee

Conference_Titel

Vehicular Technology Conference, 2000. IEEE-VTS Fall VTC 2000. 52nd

Conference_Location

Boston, MA

ISSN

1090-3038

Print_ISBN

0-7803-6507-0

Type

conf

DOI

10.1109/VETECF.2000.886272

Filename

886272