7,433 research outputs found
Sparse Message Passing Based Preamble Estimation for Crowded M2M Communications
Due to the massive number of devices in the M2M communication era, new
challenges have been brought to the existing random-access (RA) mechanism, such
as severe preamble collisions and resource block (RB) wastes. To address these
problems, a novel sparse message passing (SMP) algorithm is proposed, based on
a factor graph on which Bernoulli messages are updated. The SMP enables an
accurate estimation on the activity of the devices and the identity of the
preamble chosen by each active device. Aided by the estimation, the RB
efficiency for the uplink data transmission can be improved, especially among
the collided devices. In addition, an analytical tool is derived to analyze the
iterative evolution and convergence of the SMP algorithm. Finally, numerical
simulations are provided to verify the validity of our analytical results and
the significant improvement of the proposed SMP on estimation error rate even
when preamble collision occurs.Comment: submitted to ICC 2018 with 6 pages and 4 figure
Compressed Sensing Using Binary Matrices of Nearly Optimal Dimensions
In this paper, we study the problem of compressed sensing using binary
measurement matrices and -norm minimization (basis pursuit) as the
recovery algorithm. We derive new upper and lower bounds on the number of
measurements to achieve robust sparse recovery with binary matrices. We
establish sufficient conditions for a column-regular binary matrix to satisfy
the robust null space property (RNSP) and show that the associated sufficient
conditions % sparsity bounds for robust sparse recovery obtained using the RNSP
are better by a factor of compared to the
sufficient conditions obtained using the restricted isometry property (RIP).
Next we derive universal \textit{lower} bounds on the number of measurements
that any binary matrix needs to have in order to satisfy the weaker sufficient
condition based on the RNSP and show that bipartite graphs of girth six are
optimal. Then we display two classes of binary matrices, namely parity check
matrices of array codes and Euler squares, which have girth six and are nearly
optimal in the sense of almost satisfying the lower bound. In principle,
randomly generated Gaussian measurement matrices are "order-optimal". So we
compare the phase transition behavior of the basis pursuit formulation using
binary array codes and Gaussian matrices and show that (i) there is essentially
no difference between the phase transition boundaries in the two cases and (ii)
the CPU time of basis pursuit with binary matrices is hundreds of times faster
than with Gaussian matrices and the storage requirements are less. Therefore it
is suggested that binary matrices are a viable alternative to Gaussian matrices
for compressed sensing using basis pursuit. \end{abstract}Comment: 28 pages, 3 figures, 5 table
Blind Signal Detection in Massive MIMO: Exploiting the Channel Sparsity
In practical massive MIMO systems, a substantial portion of system resources
are consumed to acquire channel state information (CSI), leading to a
drastically lower system capacity compared with the ideal case where perfect
CSI is available. In this paper, we show that the overhead for CSI acquisition
can be largely compensated by the potential gain due to the sparsity of the
massive MIMO channel in a certain transformed domain. To this end, we propose a
novel blind detection scheme that simultaneously estimates the channel and data
by factorizing the received signal matrix. We show that by exploiting the
channel sparsity, our proposed scheme can achieve a DoF very close to the ideal
case, provided that the channel is sufficiently sparse. Specifically, the
achievable degree of freedom (DoF) has a fractional gap of only from the
ideal DoF, where is the channel coherence time. This is a remarkable
advance for understanding the performance limit of the massive MIMO system. We
further show that the performance advantage of our proposed scheme in the
asymptotic SNR regime carries over to the practical SNR regime. Numerical
results demonstrate that our proposed scheme significantly outperforms its
counterpart schemes in the practical SNR regime under various system
configurations.Comment: 32 pages, 9 figures, submitted to IEEE Trans. Commu
- …