Abstract
We propose a new design of the optimal resource element (RE) mapping patterns to maximize the sum-rate of a sparse spreading non-orthogonal multiple access system. In this system, the grouped users who use the same radio resource have different channel conditions. First, we formulate a sum-rate optimization problem subject to sparsity and power constraints. To solve this non-trivial optimization problem, we transform it to an equivalent penalized problem by deriving the closed-form penalty parameters. We then convert this problem to a sequence of subproblems using the difference of convex programming and propose an efficient algorithm to find the optimal solution. Numerical results demonstrate that the proposed algorithm achieves a higher sum-rate and a superior block error rate performance than the conventional RE mapping schemes.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.