A low-complexity recursive approach toward code-domain NOMA for massive communications
MV Jamali, H Mahdavifar - 2018 IEEE Global Communications …, 2018 - ieeexplore.ieee.org
Nonorthogonal multiple access (NOMA) is a promising technology to meet the demands of
the next generation wireless networks on massive connectivity, high throughput and
reliability, improved fairness, and low latency. In this context, code-domain NOMA which
attempts to serve K users in M≤ K orthogonal resource blocks, using a pattern matrix, is of
utmost interest. However, extending the pattern matrix dimensions severely increases the
detection complexity and hampers on the significant advantages that can be achieved using …
the next generation wireless networks on massive connectivity, high throughput and
reliability, improved fairness, and low latency. In this context, code-domain NOMA which
attempts to serve K users in M≤ K orthogonal resource blocks, using a pattern matrix, is of
utmost interest. However, extending the pattern matrix dimensions severely increases the
detection complexity and hampers on the significant advantages that can be achieved using …
A Low-Complexity Recursive Approach Toward Code-Domain NOMA for Massive Communications
M Vahid Jamali, H Mahdavifar - arXiv e-prints, 2018 - ui.adsabs.harvard.edu
Nonorthogonal multiple access (NOMA) is a promising technology to meet the demands of
the next generation wireless networks on massive connectivity, high throughput and
reliability, improved fairness, and low latency. In this context, code-domain NOMA which
attempts to serve $ K $ users in $ M\leq K $ orthogonal resource blocks, using a pattern
matrix, is of utmost interest. However, extending the pattern matrix dimensions severely
increases the detection complexity and hampers on the significant advantages that can be …
the next generation wireless networks on massive connectivity, high throughput and
reliability, improved fairness, and low latency. In this context, code-domain NOMA which
attempts to serve $ K $ users in $ M\leq K $ orthogonal resource blocks, using a pattern
matrix, is of utmost interest. However, extending the pattern matrix dimensions severely
increases the detection complexity and hampers on the significant advantages that can be …