1. What are the contributions mentioned in the paper "A computationally efficient discrete bit-loading algorithm for ofdm systems subject to spectral-compatibility limits" ?
This paper considers bit-loading algorithms to maximize throughput under total power and spectral mask constraints in interference-free OFDM systems.. First, the authors propose a simple criterion to switch between two wellknown algorithms of the literature: the conventional Greedy and Greedy-based bit-removing ( with maximum allowable bit loading initialization ) algorithms.. Second, the authors present a new lowcomplexity loading algorithm that exploits the bit vector obtained by rounding the water-filling algorithm solution to the associated continuous-input rate maximization problem as an efficient initial bit vector of the Greedy algorithm.. The authors theoretically prove that this bit vector has two interesting properties.
read more
2. What is the principle of the WFR-GBL algorithm?
Its principle consists in exploiting the bit vector obtained by rounding the water-filling algorithm solution of problem (4) as an efficient initial bit vector of the Greedy algorithm.
read more
3. What is the principle of the proposed algorithm?
Its principle consists in first exploiting the bit vector obtained by rounding the Water-filling solution to the associated continuous bit allocation problem as an initial bit-vector in the Greedy algorithm and secondly to load up or to remove bits on the subcarriers to be loaded up or be removed at most once.
read more
4. What is the spectral mask value for a subcarrier?
Allowable set of number of bits on a subcarrier A = {0, 1, 2, 3, 4, 5..., 11, 12}.• Pmaxn = 1, ∀n ∈ {1, 2, ..., N} (normalized to P0∆f where P0 = −55 dBm (1 Hz) is the spectral mask value defined by the IEEE P1901 standard and ∆f is the subcarrier spacing between two consecutive subcarriers).
read more
