On the Sum-Rate Capacity and Spectral Efficiency Gains of Massively Concurrent NOMA Systems

Hara, Takanori; Stoica, Razvan-Andrei; Ishibashi, Koji; Abreu, Giuseppe

doi:10.1109/wcnc.2019.8885768

Cited by 4 publications

(3 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…where h k is the channel matrix, E[. ]is the ergodic capacity, and N 0 is the spectral power density at each receiver [35],…”

Section: The Uplink Receiver Model May Use a Unit Norm Receive Filter...mentioning

confidence: 99%

New Algorithm with less Coherence for Generating Uplink Complex Non-Orthogonal Multiple Access Spreading Codes and Reduce Program Execution Time

Banob,

Zaki,

M.ASHOUR

2024

Preprint

View full text Add to dashboard Cite

Non-orthogonal multiple access (NOMA)-assisted 5G wireless communication networks in uplink and downlink transmissions can provide high demands of low latency, high data rate, massive connectivity, and high access speed without compromising security. Algorithms to produce minimal coherence (cross-correlation) codebooks are desired in various applications. The authors built an algorithm capable of generating complex NOMA spreading codes based on the equiangular tight frame (ETF) method. Execution time is one of the computer sciences terms that refer to the various stages of running software programs and determining the performance of programs. The created algorithm was reasonably fast to find enough NOMA spreading codes that have the minimum cross-correlation. It modified the initial value with the algorithm to reduce the execution time and generate complex value-spreading codes. This algorithm achieved the optimal cross-correlation for multiple access and implemented the lowest running time compared to the "best complex antipodal spherical code" (BCASC) method, the "approximate nearest neighbors’ best complex antipodal spherical code" (ANN BCASC) method, the method of constructing packing in Grassmannian manifolds via alternating projection, the method of constructing packing in Grassmannian manifolds via sequential smooth optimization, the "coherence-based Grassmannian codebook" (CBGC) method, the “Grassmannian package” method, the “original best complex antipodal spherical code" (ORIG-BCASC) method, and the "Grassmannian package" method. The algorithm achieved optimal coherence (maximum cross-correlation) for matrix dimension (m, n), where m, n denotes the size of the collection set of vectors in the frame. The optimal coherence (maximum cross-correlation) is 0.4472 for (3, 6), 0.4714 for (3, 7), 0.3536 for (4, 7), 0.3780 for (4, 8), 0.4472 for (4, 16), 0.3333 for (5, 10), 0.3464 for (5, 11), 0.4082 for (5, 25), 0.2500 for (6, 9), 0.2887 for (6, 11), 0.3015 for (6, 12), and 0.3333 for (7, 28) with an enhancement the parameters number of iterations and tolerance value in time less than one second. Moreover, superior to the “Grassmannian package” method in execution time, the execution time for the BCASC, CBGC, and ORIG-BCASC methods was more than one second. The simulations verified the uplink spectral efficiency and total capacity rate after applying the spreading codes generated from the suggested algorithm. In conclusion, the proposed algorithm creates complex matrices that achieve minimal coherence (maximum cross-correlation) at the least running time.

show abstract

“…where h k is the channel matrix, E[. ]is the ergodic capacity, and N 0 is the spectral power density at each receiver [35],…”

Section: The Uplink Receiver Model May Use a Unit Norm Receive Filter...mentioning

confidence: 99%

New Algorithm with less Coherence for Generating Uplink Complex Non-Orthogonal Multiple Access Spreading Codes and Reduce Program Execution Time

Banob,

Zaki,

M.ASHOUR

2024

Preprint

View full text Add to dashboard Cite

show abstract

“…where , h k is the channel matrix, E[. ]is the ergodic capacity, and N 0 is the spectral power density at each receiver [32], It is clear that, the rate performance for the uplink NOMA system is influenced by the instances of the matrix F and channel h.…”

Section: Fig (1) Uplink Noma Transmitter Model For K Usersmentioning

confidence: 99%

An algorithm for generating uplink complex nonorthogonal multiple access spreading codes to reduce execution time

Amir¹

2023

Preprint

View full text Add to dashboard Cite

Non-orthogonal multiple access (NOMA)-assisted 5G wireless communication networks in uplink and downlink transmissions can provide high demands of low latency, high data rate, massive connectivity, and high access speed without compromising security. Algorithms to produce minimal coherence (cross-correlation) codebooks are desired in various applications. The authors built an algorithm capable of generating complex NOMA spreading codes based on the equiangular tight frame (ETF) method. Execution time is one of the computer science terms that refers to the various stages of running software programs and determining the performance of programs. The created algorithm was reasonably fast to find a enough of NOMA spreading codes that have the minimum cross-correlation. It modified the initial value with the algorithm to reduce the execution time and generate complex value-spreading codes. This algorithm achieved the optimal cross-correlation for multiple access and implemented the lowest running time compared to the "best complex antipodal spherical code" (BCASC) method, the "approximate nearest neighbors’ best complex antipodal spherical code" (ANN BCASC) method, the "Dhillon et al." method, the "Medra et al." method, the "coherence-based Grassmannian codebook" (CBGC) method, the “Grassmannian package” method, the “original best complex antipodal spherical code" (ORIG-BCASC) method, and the "Grassmannian package" method. The algorithm achieved optimal coherence (maximum cross-correlation) for matrix dimension (m, n), where m, n denotes the size of the collection set of vectors in the Frame. The optimal coherence (maximum cross-correlation) is 0.4472 for (3, 6), 0.4714 for (3, 7), 0.3536 for (4, 7), 0.3780 for (4, 8), 0.4472 for (4, 16), 0.3333 for (5, 10), 0.3464 for (5, 11), 0.4082 for (5, 25), 0.2500 for (6, 9), 0.2887 for (6, 11), 0.3015 for (6, 12), and 0.3333 for (7, 28) with an enhancement the parameters number of iterations and tolerance value in time less than one second. Also, superior to the “Grassmannian package” method in execution time, also the execution time for BCASC, CBGC, and ORIG-BCASC methods was more than one second. The performed simulations verified the uplink spectral efficiency and total capacity rate after applying the spreading codes generated from the suggested algorithm. In conclusion, the proposed algorithm for generating NOMA spreading codes tokens based on complex ETFs and exported from our algorithm provided better performance and capacity than other multi-access signatures.

show abstract

“…As a result, the ergodic CCMC capacity at the j-th user for the described NOMA system is generally (regardless of the employed scheme ETF, GWBE, PDMA, 64QAMquantized Grassmannian, Grassmannian, and WSMA where SNR= =frame gain, k is the width dimension of the frame, is ergodic capacity, and N 0 is the spectral power density at each j receiver given by [32] (16)…”

Section: Ccmc Capacitymentioning

confidence: 99%

The effect of quantized ETF, grouping, and power allocation on non-orthogonal multiple accesses for wireless communication networks

Banob

Zaki

Ashour

2022

Int. j. electr. comput. eng. syst. (Online)

View full text Add to dashboard Cite

Nonorthogonal multiple access (NOMA) is a significant technology in radio resource sharing and it has been recognized as a favorable method in fifth-generation (5G) wireless networks to meet the requirements of system capacity, service latency, and user connectivity. Many schemes for NOMA have been proposed in the last few years. such as transmitter linear spreading-based NOMA as a code domain, as well as a linear minimum mean square error (LMMSE), parallel interference cancellation (PIC), and serial interference cancellation (SIC) with power allocation and grouping as a power domain at the receiver side for uplink NOMA. This work aims to evaluate the performance of multiple types of linear spreading-based NOMA schemes. Simulations are achieved for the error-rate performance evaluation of these NOMA schemes, received signal after detection, and received signal and effect of every user on the other. Evaluating the performance of these technologies with comparison is also achieved through using grouping and power allocation. Simulations are achieved for the sum rate and spectral efficiency. For the future, 5G NOMA development, an equiangular tight frame (ETF) is suggested for improving performance and suggests grouping with 64qam-quantized Grassmannian for improving performance favorite about grouping with Generalized welch-bound equality (GWBE)

show abstract

On the Sum-Rate Capacity and Spectral Efficiency Gains of Massively Concurrent NOMA Systems

Cited by 4 publications

References 23 publications

New Algorithm with less Coherence for Generating Uplink Complex Non-Orthogonal Multiple Access Spreading Codes and Reduce Program Execution Time

New Algorithm with less Coherence for Generating Uplink Complex Non-Orthogonal Multiple Access Spreading Codes and Reduce Program Execution Time

An algorithm for generating uplink complex nonorthogonal multiple access spreading codes to reduce execution time

The effect of quantized ETF, grouping, and power allocation on non-orthogonal multiple accesses for wireless communication networks

Contact Info

Product

Resources

About