805 research outputs found

    Robust Transmit Designs for Secrecy Rate Constrained MISO NOMA System

    Get PDF
    This paper studies the secure transmission for downlink multiple-input single-output (MISO) non-orthogonal multiple access (NOMA) system in which imperfect channel state information (CSI) of the eavesdropper links is considered. We propose the novel robust beamforming strategies for the direct transmission NOMA (DT NOMA) and cooperative jamming NOMA (CJ NOMA) with a helper. We formulate our problem as the worst-case sum power minimization subject to secrecy rate constraint. The semidefinite relaxation (SDR) method is firstly applied to relax the quadratic terms and rank-one optimality is proved. Then an iterative algorithm based on successive convex approximation (SCA) is proposed to transform the nonconvex problem into convex approximations. Simulation results show that both the proposed NOMA schemes outperform the orthogonal multiple scheme, and CJ NOMA scheme can achieve much better system performance gain than DT NOMA scheme

    WMMSE resource allocation for FD-NOMA

    Get PDF
    Resource allocation in interference-limited systems is a key enabler for beyond 5G (B5G) technologies, such as multi-carrier full duplex non-orthogonal multiple access (FD-NOMA). In FD-NOMA systems resource allocation is a computation-intensive non-convex problem due to the presence of strong interference and the integrality condition on channel allocation. In this paper, we propose an iterative algorithm based on the combination of channel and power allocations aimed at the minimization of the weighted mean square error, which converges to a feasible allocation of the original problem. Experimental results show that the proposed algorithm has lower complexity than other state-of-the-art solutions for the same problem. Moreover, the presented results assess the validity of our approach showing performance close to the theoretical optimum

    Energy-Efficient Non-Orthogonal Transmission under Reliability and Finite Blocklength Constraints

    Full text link
    This paper investigates an energy-efficient non-orthogonal transmission design problem for two downlink receivers that have strict reliability and finite blocklength (latency) constraints. The Shannon capacity formula widely used in traditional designs needs the assumption of infinite blocklength and thus is no longer appropriate. We adopt the newly finite blocklength coding capacity formula for explicitly specifying the trade-off between reliability and code blocklength. However, conventional successive interference cancellation (SIC) may become infeasible due to heterogeneous blocklengths. We thus consider several scenarios with different channel conditions and with/without SIC. By carefully examining the problem structure, we present in closed-form the optimal power and code blocklength for energy-efficient transmissions. Simulation results provide interesting insights into conditions for which non-orthogonal transmission is more energy efficient than the orthogonal transmission such as TDMA.Comment: accepted by IEEE GlobeCom workshop on URLLC, 201
    • …
    corecore