IEEE transactions on communications, 2006-01, Vol.54 (1), p.23-28
2006
Volltextzugriff (PDF)
Details
- Autor(en) / Beteiligte
- Titel
- Constant-power waterfilling: performance bound and low-complexity implementation
- Ist Teil von
- IEEE transactions on communications, 2006-01, Vol.54 (1), p.23-28
- Ort / Verlag
- New York, NY: IEEE
- Erscheinungsjahr
- 2006
- Quelle
- IEEE Xplore
- Beschreibungen/Notizen
- In this letter, we investigate the performance of constant-power waterfilling algorithms for the intersymbol interference channel and for the independent identically distributed fading channel where a constant power level is used across a properly chosen subset of subchannels. A rigorous performance analysis that upper bounds the maximum difference between the achievable rate under constant-power waterfilling and that under true waterfilling is given. In particular, it is shown that for the Rayleigh fading channel, the spectral efficiency loss due to constant-power waterfilling is at most 0.266 b/s/Hz. Furthermore, the performance bound allows a very-low-complexity, logarithm-free, power-adaptation algorithm to be developed. Theoretical worst-case analysis and simulation show that the approximate waterfilling scheme is very close to the optimum.
- Sprache
- Englisch
- Identifikatoren
- ISSN: 0090-6778eISSN: 1558-0857DOI: 10.1109/TCOMM.2005.861678Titel-ID: cdi_pascalfrancis_primary_17432464
- Format
- –
- Schlagworte
- Algorithms, Analytical models, Applied sciences, Approximation, Bit loading, Channels, Communication channels, Computer simulation, Discrete Fourier transforms, duality gap, Exact sciences and technology, Fading, Intersymbol interference, Optimization, Performance analysis, Performance loss, Spectra, State feedback, Systems, networks and services of telecommunications, Telecommunications, Telecommunications and information theory, Transmission and modulation (techniques and equipments), Transmitters, Upper bound, Upper bounds, waterfilling