Information Theory and Reliable Communication
Information Theory and Reliable Communication
On the completeness of a generalized matching problem
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Wireless Communications
Fundamentals of wireless communication
Fundamentals of wireless communication
Fundamentals of WiMAX: Understanding Broadband Wireless Networking (Prentice Hall Communications Engineering and Emerging Technologies Series)
Orthogonal Frequency Division Multiplexing for Wireless Communications (Signals and Communication Technology)
Diversity-multiplexing tradeoff in ISI channels
IEEE Transactions on Information Theory
Diversity-multiplexing tradeoff in OFDMA systems with coherence bandwidth splitting
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
High-order analysis of outage probability in OFDMA wireless networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Optimal diversity-multiplexing tradeoff in OFDMA systems
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Max-matching diversity in OFDMA systems
IEEE Transactions on Communications
Dynamic multiuser resource allocation and adaptation for wireless systems
IEEE Wireless Communications
Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels
IEEE Transactions on Information Theory
Approximately universal codes over slow-fading channels
IEEE Transactions on Information Theory
Finite-SNR Diversity–Multiplexing Tradeoff for Correlated Rayleigh and Rician MIMO Channels
IEEE Transactions on Information Theory
Multiuser OFDM with adaptive subcarrier, bit, and power allocation
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
OFDMA performs a fundamental role in wired/wireless communications. One of the key techniques in OFDMA is the resource allocation, which has been attaching much attention from both academia and industry. In this paper, we describe an innovative combinatorial method to study this problem. An OFDMA system will first be formulated into a random bipartite graph (RBG). To meet various system configurations and requirements, different matching methods will be proposed to perform subcarrier allocation. By studying the properties of RBG matching, we will obtain close-form formulas for outage probabilities so as to evaluate the performance of subcarrier allocation algorithms. It is then demonstrated that by exploiting the frequency diversity and multi-user diversity, the proposed matching method can minimize the outage probability with fairness assurance, and achieve the same diversity-multiplexing tradeoff as point-to-point OFDM systems. The induced subcarrier allocation algorithms also enjoy a sub-linear computation complexity of O(N2/3) for parallel implementations, where N is the number of subcarriers. Besides, the proposed RBG matching method only needs one-bit CSI feedback.