Fast Computation of Waterfilling Algorithms

Naidu, Kalpana (2016) Fast Computation of Waterfilling Algorithms. PhD thesis, Indian Institute of Technology Hyderabad.

[img] Text
EE10P002.pdf - Submitted Version
Restricted to Registered users only until 2 August 2021.

Download (1MB) | Request a copy


The ever-increasing growth of the wireless applications and services reaffirms the importance of the effective usage of radio resources. Waterfilling plays a crucial role in effective use of resources, by optimizing power allocation to various available resources. The term `waterfilling' was first introduced by Shannon and popularized by Gallager to describe the `optimal transmit (power) mask as a function of the channel and noise characteristics'. Waterfilling is hugely relevant, even today, as various `versions' keep propping up in `almost' all fields of communications and signal processing like Cognitive Radio, MIMO (Multiple-Input and Multiple-Output), mmWave, OFDM (Orthogonal Frequency Division Multiplexing), OFDMA (Orthogonal Frequency Division Multiple Access), DSL (Digital Subscriber Line), etc to name a few.

[error in script]
IITH Creators:
IITH CreatorsORCiD
Item Type: Thesis (PhD)
Uncontrolled Keywords: water filling, fast, flops, capacity optimization, power allocation, interference minimization, constraints, TD686
Subjects: Others > Electricity
Divisions: Department of Electrical Engineering
Depositing User: Team Library
Date Deposited: 03 Aug 2016 10:32
Last Modified: 03 Aug 2016 10:32
Publisher URL:
Related URLs:

Actions (login required)

View Item View Item
Statistics for RAIITH ePrint 2604 Statistics for this ePrint Item