arXiv subjects

Yuhao Chi

Publications and source records attributed to Yuhao Chi.

21 records · Page 2Linked to original sources

arXiv2018

Over-the-Air Implementation of Uplink NOMA

Though the concept of non-orthogonal multiple access (NOMA) was proposed several years ago, the performance of uplink NOMA has only been verified in theory, but not in practice. This paper presents an over-the-air implementation of a uplink NOMA system, while providing solutions to most common practical problems, i.e., carrier frequency offset (CFO) synchronization, time synchronization, and channel estimation. The implemented CFO synchronization method adopts the primary synchronization signal (PSS) of LTE. Also, we design a novel preamble for each uplink user, and it is appended to every frame before it is transmitted through the air. This preamble will be used for time synchronization and channel estimation at the BS. Also, a low-complexity, iterative linear minimum mean squared error (LMMSE) detector has been implemented for multi-user decoding. The paper also validates the proposed architecture numerically, as well as experimentally.

cs.NI↗

arXiv2017

Message Passing in C-RAN: Joint User Activity and Signal Detection

In cloud radio access network (C-RAN), remote radio heads (RRHs) and users are uniformly distributed in a large area such that the channel matrix can be considered as sparse. Based on this phenomenon, RRHs only need to detect the relatively strong signals from nearby users and ignore the weak signals from far users, which is helpful to develop low-complexity detection algorithms without causing much performance loss. However, before detection, RRHs require to obtain the realtime user activity information by the dynamic grant procedure, which causes the enormous latency. To address this issue, in this paper, we consider a grant-free C-RAN system and propose a low-complexity Bernoulli-Gaussian message passing (BGMP) algorithm based on the sparsified channel, which jointly detects the user activity and signal. Since active users are assumed to transmit Gaussian signals at any time, the user activity can be regarded as a Bernoulli variable and the signals from all users obey a Bernoulli-Gaussian distribution. In the BGMP, the detection functions for signals are designed with respect to the Bernoulli-Gaussian variable. Numerical results demonstrate the robustness and effectivity of the BGMP. That is, for different sparsified channels, the BGMP can approach the mean-square error (MSE) of the genie-aided sparse minimum mean-square error (GA-SMMSE) which exactly knows the user activity information. Meanwhile, the fast convergence and strong recovery capability for user activity of the BGMP are also verified.

cs.IT↗

arXiv2017

Sparse Vector Recovery: Bernoulli-Gaussian Message Passing

Low-cost message passing (MP) algorithm has been recognized as a promising technique for sparse vector recovery. However, the existing MP algorithms either focus on mean square error (MSE) of the value recovery while ignoring the sparsity requirement, or support error rate (SER) of the sparse support (non-zero position) recovery while ignoring its value. A novel low-complexity Bernoulli-Gaussian MP (BGMP) is proposed to perform the value recovery as well as the support recovery. Particularly, in the proposed BGMP, support-related Bernoulli messages and value-related Gaussian messages are jointly processed and assist each other. In addition, a strict lower bound is developed for the MSE of BGMP via the genie-aided minimum mean-square-error (GA-MMSE) method. The GA-MMSE lower bound is shown to be tight in high signal-to-noise ratio. Numerical results are provided to verify the advantage of BGMP in terms of final MSE, SER and convergence speed.

cs.IT↗