Abstract
This paper proposes a dynamic bound restriction iterative algorithm (DBRIA) framework, which can make iterative algorithms converge quickly. We apply this framework to realize computationally efficient iteration-based suboptimal bit and power allocation in OFDM systems. The implementation methods for three classes of suboptimal allocation algorithms are analyzed; margin-based, water-filling-based, and Lagrange-multiplier-based. We extend the water-filling-based power allocation algorithm to implement the bit allocation as well. Additional techniques for further reducing the computational complexity for all three allocation methods are also discussed. Simulation results show that both the maximum and the average computational complexity of all three allocation algorithms are reduced dramatically by applying the DBRIA and the additional techniques. For the water-filling-based algorithm, the allocation performance is also improved.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.