Abstract

A point to point wireless communication system based on Orthogonal Frequency Division Multiplexing (OFDM) is considered, wherein R bits of information have to be scheduled within a hard delay deadline of T time slots over a frequency selective slow fading channel. The scheduling objective is to minimize the energy expenditure with non-causal knowledge of channel state over a limited time horizon, number of bits to be served and delay constraints. We assume a convex monomial energy-bit cost function and propose novel efficient two stage heuristic algorithm that allocate the R bits on the time slots, followed by greedy optimal bit loading over the OFDM subcarriers. An analytical model is developed and numerical simulations are performed to validate the proposed approach as well as the results show that our algorithms outperform existing approaches in published literature by up to 10 dB in power margin on an average in high load conditions while meeting the deadline of T timeslots.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.