pith. the verified trust layer for science. sign in

arxiv: 1505.05735 · v1 · pith:COZPNX72new · submitted 2015-05-21 · 💻 cs.IT · math.IT

A Minorization-Maximization Method for Optimizing Sum Rate in Non-Orthogonal Multiple Access Systems

classification 💻 cs.IT math.IT
keywords accessmultipleproblemnomasystemsalgorithmcomplexityfeasibility
0
0 comments X p. Extension
Add this Pith Number to your LaTeX paper What is a Pith Number?
\usepackage{pith}
\pithnumber{COZPNX72}

Prints a linked pith:COZPNX72 badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more

read the original abstract

Non-orthogonal multiple access (NOMA) systems have the potential to deliver higher system throughput, compared to contemporary orthogonal multiple access techniques. For a linearly precoded multiple-input multiple-output (MISO) system, we study the downlink sum rate maximization problem, when the NOMA principles are applied. Being a non-convex and intractable optimization problem,we resort to approximate it with a minorization-maximization algorithm (MMA), which is a widely used tool in statistics. In each step of the MMA, we solve a second-order cone program, such that the feasibility set in each step contains that of the previous one, and is always guaranteed to be a subset of the feasibility set of the original problem. It should be noted that the algorithm takes a few iterations to converge. Furthermore, we study the conditions under which the achievable rates maximization can be further simplified to a low complexity design problem, and we compute the probability of occurrence of this event. Numerical examples are conducted to show a comparison of the proposed approach against conventional multiple access systems. NOMA is reported to provide better spectral and power efficiency with a polynomial time computational complexity.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.