Xin Su

TL;DR: This paper proposes to exploit the Gauss-Seidel method to iteratively realize the MMSE algorithm without the complicated matrix inversion, and proposes a diagonal-approximate initial solution to the GS method, which is much closer to the final solution than the traditional zero-vector initial solution.

TL;DR: In this paper, the Gauss-Seidel (GS) method was used to iteratively realize the MMSE algorithm without the complicated matrix inversion, and a diagonal-approximate initial solution to the GS method was proposed to accelerate the convergence rate and reduce the complexity.

TL;DR: This paper reveals that the NOMA techniques have evolved from single-carrier NomA (SC-NOMA) into multi- carrier NOMa (MC-N OMA), and comprehensively investigated on the basic principles, enabling schemes and evaluations of the two most promising MC-NomA techniques, namely sparse code multiple access (SCMA) and pattern division multiple access(PDMA).

TL;DR: Numerical results verify that massive MU-MIMO can support a large number of UL URLLC users even when users are randomly deployed under shadow fading, and finite blocklength (FBL) information theory is utilized to derive the error probability of accessing users with a given latency.

TL;DR: A closed-form upper bound for the delay target violation probability in the downlink MIMO-NOMA is derived by applying stochastic network calculus to the Mellin transforms of service processes and it is proved that the infinite-length Mellin transform resulting from the non-negligible interferences of NOMA are Cauchy convergent and can be asymptotically approached by a finite truncated binomial series in the closed form.