2023
DOI: 10.1109/access.2023.3236966
|View full text |Cite
|
Sign up to set email alerts
|

M-Ary QAM Asynchronous-NOMA D2D Network With Cyclic Triangular-SIC Decoding Scheme

Abstract: The complexity of successive interference cancellation at the receiver's end is a challenging issue in conventional non-orthogonal multiple access assisted massive wireless networks. The computational complexity of decoding increases exponentially with the number of users. Further, under realistic channel conditions, a synchronous non-orthogonal multiple access scheme is impractical in the uplink deviceto-device communications. In this paper, an asynchronous non-orthogonal multiple access-based cyclic triangul… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 50 publications
(79 reference statements)
0
1
0
Order By: Relevance
“…The authors model the problem as a mixed integer linear programming problem by joint user pairing and resource allocation, and prove the superiority of the proposed scheme using a three-dimensional game, branch definition method, and successive convex approximations.Literature [26] proposes a NOMA and D2D communication scheme to improve the physical layer security of D2D users, and at the same time to obtain higher rates by clustering, using matching theory and sub-optimization algorithms to solve the user clustering and power allocation problems, respectively, and finally the significant advantages of the authors' proposed approach are confirmed by simulations.With the introduction of D2D pairs in the NOMA system, the decoding complexity of the system also increases. Literature [27] addresses the large decoding complexity by mentioning the use of the Lagrangian pairwise method and the cyclic triangular successive elimination scheme to reduce the computational complexity of decoding.…”
Section: B Motivation and Contributionsmentioning
confidence: 99%
“…The authors model the problem as a mixed integer linear programming problem by joint user pairing and resource allocation, and prove the superiority of the proposed scheme using a three-dimensional game, branch definition method, and successive convex approximations.Literature [26] proposes a NOMA and D2D communication scheme to improve the physical layer security of D2D users, and at the same time to obtain higher rates by clustering, using matching theory and sub-optimization algorithms to solve the user clustering and power allocation problems, respectively, and finally the significant advantages of the authors' proposed approach are confirmed by simulations.With the introduction of D2D pairs in the NOMA system, the decoding complexity of the system also increases. Literature [27] addresses the large decoding complexity by mentioning the use of the Lagrangian pairwise method and the cyclic triangular successive elimination scheme to reduce the computational complexity of decoding.…”
Section: B Motivation and Contributionsmentioning
confidence: 99%