Suboptimal Greedy Power Allocation Schemes for Discrete Bit Loading
We consider low cost discrete bit loading based on greedy power allocation (GPA) under the constraints of total transmit power budget, target BER, and maximum permissible QAM modulation order. Compared to the standard GPA, which is optimal in terms of maximising the data throughput, three suboptimal...
Saved in:
Main Authors: | Waleed Al-Hanafy, Stephan Weiss |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2013-01-01
|
Series: | The Scientific World Journal |
Online Access: | http://dx.doi.org/10.1155/2013/370261 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Phasor Measurement Units Allocation Against Load Redistribution Attacks Based on Greedy Algorithm
by: Ali Rahdan, et al.
Published: (2023-09-01) -
Erasure channel modelling–based secure bit allocation schemes for multipath routing in wireless sensor networks
by: Zhenhua Yuan, et al.
Published: (2016-12-01) -
A Scheme of Restricted Flooding and Greedy Forwarding Routing for Object Tracking Sensor Networks
by: Yuanguo Cheng, et al.
Published: (2009-01-01) -
INTER-LAYER BIT ALLOCATION FOR SCALABLE HIGH-EFFICIENCY VIDEO CODING
by: Võ Phương Bình
Published: (2016-06-01) -
Greedy algorithms: a review and open problems
by: Andrea García
Published: (2025-02-01)