Design of Incidence Matrices With Limited Constellation Expansion in Massive Connectivity NOMA Systems
Open Access
- 10 January 2023
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 6524-6540
Abstract
Non-orthogonal multiple-access (NOMA) is designed to transmit massive amounts of user communications. The incidence matrix manages the relationship between users and resources. This study focused on increasing user supportability and complexity reduction using larger incidence matrices. Our approach to optimizing the incidence matrix to improve system capacity and reduce complexity is based on two critical mathematical concepts: Parallel classes in hypergraph theory and combinatorial designs allow us to explore and extend incidence matrices. Frame theory is used to estimate matrix structures. Then, we investigate applications utilizing our incidence matrix designs–Simple Orthogonal Multi-Arrays (SOMA). The characteristics of SOMA reflect the unique Latin Square pattern, allowing us to produce a highly flexible and fair resource allocation matrix. SOMA designs let us support overload factors over 500%. The theoretical performance analysis equations of our NOMA system were established to support dynamic adaptability and optimization. We implemented and evaluated security methods for eavesdroppers. The prototype of the user hierarchy allows a higher-priority group to have a lower error rate without significantly affecting the system’s performance. Finally, the Monte Carlo simulation indicated that our NOMA systems allow higher degrees of freedom and lower complexity than other NOMA schemes while maintaining graceful error rates with a maximum 33% improvement.Keywords
This publication has 59 references indexed in Scilit:
- Diversity–Multiplexing Tradeoff in Multiple-Access ChannelsIEEE Transactions on Information Theory, 2004
- Multiuser detection for overloaded CDMA systemsIEEE Transactions on Information Theory, 2003
- Perfect matchings in random uniform hypergraphsRandom Structures & Algorithms, 2003
- Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channelsIEEE Transactions on Information Theory, 2003
- Grassmannian frames with applications to coding and communicationApplied and Computational Harmonic Analysis, 2003
- BER performance of MQAM withL‐branch MRC diversity reception over correlated Nakagami‐mfading channelsWireless Communications and Mobile Computing, 2002
- Design and analysis of turbo codes on Rayleigh fading channelsIEEE Journal on Selected Areas in Communications, 1998
- The complexity of completing partial Latin squaresDiscrete Applied Mathematics, 1984
- A Note on the Construction of Mutually Orthogonal Latin Squares1976
- Transversals of Latin squares and their generalizationsPacific Journal of Mathematics, 1975