scispace - formally typeset
F

Fangyu Cui

Researcher at Zhejiang University

Publications -  12
Citations -  783

Fangyu Cui is an academic researcher from Zhejiang University. The author has contributed to research in topics: Optimization problem & Filter bank. The author has an hindex of 7, co-authored 12 publications receiving 543 citations.

Papers
More filters
Journal ArticleDOI

Modulation and Multiple Access for 5G Networks

TL;DR: In this paper, a comprehensive overview of the most promising modulation and multiple access (MA) schemes for 5G networks is presented, including modulation techniques in orthogonal MA (OMA) and various types of non-OMA (NOMA).
Journal ArticleDOI

Dual-UAV-Enabled Secure Communications: Joint Trajectory Design and User Scheduling

TL;DR: This paper investigates a novel unmanned aerial vehicle (UAV)-enabled secure communication system where one UAV moves around to communicate with multiple users on the ground using orthogonal time-division multiple access while the other UAV in the area jams the eavesdroppers to protect communications of the desired users.
Journal ArticleDOI

Multiple Access for Mobile-UAV Enabled Networks: Joint Trajectory Design and Resource Allocation

TL;DR: This paper transforms the original problems for UAV communications with the OMA and NOMA modes into more tractable forms and develops novel algorithms based on penalty dual-decomposition technique to solve them, which outperform the benchmarks.
Posted Content

Modulation and Multiple Access for 5G Networks

TL;DR: This paper presents a comprehensive overview of the most promising modulation and MA schemes for 5G networks, including modulation techniques in orthogonal MA (OMA) and various types of non-OMA (NOMA), and NOMA multiplexing in multiple domains.
Journal ArticleDOI

Rethinking Outage Constraints for Resource Management in NOMA Networks

TL;DR: This paper investigates user scheduling and power allocation for a downlink NOMA system with imperfect SIC by using the alternative outage probability as a constraint and proposes a two-phase algorithm, in which the user scheduling is first optimized through a matching theory based algorithm, and then power allocation is performed with the aid of the branch and bound technique and the concave–convex procedure method.