OFDM-IDMA with user grouping

Jian Dang, Wenshu Zhang, Liuqing Yang, Zaichen Zhang

Research output: Contribution to journalArticlepeer-review

16 Scopus citations

Abstract

A generalized version of orthogonal frequency division multiplexing interleave division multiple access (OFDM-IDMA) referred to as grouped OFDM-IDMA (G-OFDM-IDMA) is introduced in this paper. By dividing users into groups and transmitting each group's data only on some (as opposed to all) subcarriers, G-OFDM-IDMA can have much lower decoding complexity compared with conventional OFDM-IDMA while preserving the bit error probability (BEP) performance and the bandwidth efficiency. The user grouping problem is formulated into an integer linear programming problem whose suboptimal solution is proposed and compared with the lower bound. The optimization complexity issue is also addressed. Simulations are carried out to test the performance of G-OFDM-IDMA under various system configurations. It is observed that up to 80% complexity could be saved when the conventional OFDM-IDMA is substituted by G-OFDM-IDMA configured according to the suboptimal grouping solution.

Original languageEnglish (US)
Article number6476607
Pages (from-to)1947-1955
Number of pages9
JournalIEEE Transactions on Communications
Volume61
Issue number5
DOIs
StatePublished - 2013
Externally publishedYes

Keywords

  • complexity reduction
  • diversity order
  • linear programming
  • OFDM-IDMA
  • user grouping

Fingerprint

Dive into the research topics of 'OFDM-IDMA with user grouping'. Together they form a unique fingerprint.

Cite this