Presentation 2014-10-16
A Study on PF Scheduling for Downlink Non-orthogonal Multiple Access with SIC
Takashi SEYAMA, Takashi DATEKI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) This paper proposes a method which reduces complexity of proportional fair (PF) scheduling for downlink non-orthogonal multiple access (NOMA) with successive interference cancellation (SIC). The proposed method searches only the user combinations that are worth non-orthogonally-multiplexing by detecting monotonic increase/decrease of PF metric with respect to power allocation among users. We also propose a closed-form solution of optimal power allocation for 2-user multiplexing. Simulation results show that the proposed method reduces approximately 55% of all the user combinations to be searched in resource scheduling while keeping almost identical average and cell-edge throughput performance compared with conventional exhaustive search method.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Non-orthogonal multiple access / NOMA / Proportional fair scheduling
Paper # RCS2014-164
Date of Issue

Conference Information
Committee RCS
Conference Date 2014/10/9(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Radio Communication Systems (RCS)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A Study on PF Scheduling for Downlink Non-orthogonal Multiple Access with SIC
Sub Title (in English)
Keyword(1) Non-orthogonal multiple access
Keyword(2) NOMA
Keyword(3) Proportional fair scheduling
1st Author's Name Takashi SEYAMA
1st Author's Affiliation Network System Laboratories, FUJITSU LABORATORIES LTD.()
2nd Author's Name Takashi DATEKI
2nd Author's Affiliation Network System Laboratories, FUJITSU LABORATORIES LTD.
Date 2014-10-16
Paper # RCS2014-164
Volume (vol) vol.114
Number (no) 254
Page pp.pp.-
#Pages 6
Date of Issue