Bipartite matching based user grouping for grouped OFDM-IDMA

Xiaotian Zhou, Liuqing Yang, Dongfeng Yuan

Research output: Contribution to journalArticlepeer-review

16 Scopus citations


In this paper, we present a novel user grouping method for grouped OFDM-IDMA systems. Aiming at maximizing the system capacity, we adaptively distribute users among the pre-allocated subcarrier groups according to their respective channel conditions. Using the notion of SNR evolution function, we first analyze the achievable capacity of the system and formulate the optimization problem as a weighted bipartite matching problem. Due to the analytically intractability of the SNR evolution function, we opt to use either the worst case or best case of the achievable capacity to approximate the original problem. Then Kuhn-Munkres method is employed to solve the approximated problems. The performance of the proposed scheme is evaluated by both theoretical analyses and simulations. Results show that with our proposed algorithm, the system capacity is markedly improved and is very close to the theoretical capacity upper bound.

Original languageEnglish (US)
Article number6594793
Pages (from-to)5248-5257
Number of pages10
JournalIEEE Transactions on Wireless Communications
Issue number10
StatePublished - Oct 2013
Externally publishedYes


  • bipartite matching
  • Grouped OFDM-IDMA
  • subcarrier allocation
  • user grouping

Fingerprint Dive into the research topics of 'Bipartite matching based user grouping for grouped OFDM-IDMA'. Together they form a unique fingerprint.

Cite this