Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userSuccessful Recovery Performance Guarantees of Noisy SOMP
96
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
The simultaneous orthogonal matching pursuit (SOMP) is a popular, greedy approach for common support recovery of a row-sparse matrix. The support recovery guarantee of SOMP has been extensively studied under the noiseless scenario. Compared to the noiseless scenario, the performance analysis of noisy SOMP is still nascent, in which only the restricted isometry property (RIP)-based analysis has been studied. In this paper, we present the mutual incoherence property (MIP)-based study for performance analysis of noisy SOMP. Specifically, when noise is bounded, we provide the condition on which the exact support recovery is guaranteed in terms of the MIP. When noise is unbounded, we instead derive a bound on the successful recovery probability (SRP) that depends on the specific distribution of noise. Then we focus on the common case when noise is random Gaussian and show that the lower bound of SRP follows Tracy-Widom law distribution. The analysis reveals the number of measurements, noise level, the number of sparse vectors, and the value of MIP constant that are required to guarantee a predefined recovery performance. Theoretically, we show that the MIP constant of the measurement matrix must increase proportional to the noise standard deviation, and the number of sparse vectors needs to grow proportional to the noise variance. Finally, we extensively validate the derived analysis through numerical simulations.
rate research
Read More
We present a detailed analysis of the unconstrained $ell_1$-method Lasso method for sparse recovery of noisy data. The data is recovered by sensing its compressed output produced by randomly generated class of observing matrices satisfying a Restricted Isometry Property. We derive a new $ell_1$-error estimate which highlights the dependence on a certain compressiblity threshold: once the computed re-scaled residual crosses that threshold, the error is driven only by the (assumed small) noise and compressiblity. Here we identify the re-scaled residual as a key quantity which drives the error and we derive its sharp lower bound of order square-root of the size of the support of the computed solution.
In this paper, we investigate the uplink transmission performance of low-power wide-area (LPWA) networks with regards to coexisting radio modules. We adopt long range (LoRa) radio technique as an example of the network of focus even though our analysis can be easily extended to other situations. We exploit a new topology to model the network, where the node locations of LoRa follow a Poisson cluster process (PCP) while other coexisting radio modules follow a Poisson point process (PPP). Unlike most of the performance analysis based on stochastic geometry, we take noise into consideration. More specifically, two models, with a fixed and a random number of active LoRa nodes in each cluster, respectively, are considered. To obtain insights, both the exact and simple approximated expressions for coverage probability are derived. Based on them, area spectral efficiency and energy efficiency are obtained. From our analysis, we show how the performance of LPWA networks can be enhanced through adjusting the density of LoRa nodes around each LoRa receiver. Moreover, the simulation results unveil that the optimal number of active LoRa nodes in each cluster exists to maximize the area spectral efficiency.
A new family of operators, coined hierarchical measurement operators, is introduced and discussed within the well-known hierarchical sparse recovery framework. Such operator is a composition of block and mixing operations and notably contains the Kronecker product as a special case. Results on their hierarchical restricted isometry property (HiRIP) are derived, generalizing prior work on recovery of hierarchically sparse signals from Kronecker-structured linear measurements. Specifically, these results show that, very surprisingly, sparsity properties of the block and mixing part can be traded against each other. The measurement structure is well-motivated by a massive random access channel design in communication engineering. Numerical evaluation of user detection rates demonstrate the huge benefit of the theoretical framework.
Employing reconfigurable intelligent surfaces (RIS) is emerging as a game-changer candidate, thanks to their unique capabilities in improving the power efficiency and supporting the ubiquity of future wireless communication systems. Conventionally, a wireless network design has been limited to the communicating end points, i.e., the transmitter and the receiver. In general, we take advantage of the imposed channel state knowledge to manipulate the transmitted signal and to improve the detection quality at the receiver. With the aid of RISs, and to some extent, the propagation channel has become a part of the design problem. In this paper, we consider a single-input single-output cooperative network and investigate the effect of using RISs in enhancing the physical layer security of the system. Specifically, we formulate an optimization problem to study the effectiveness of the RIS in improving the system secrecy by introducing a weighted variant of the secrecy capacity definition. Numerical simulations are provided to show the design trade-offs and to present the superiority of RIS-assisted networks over the conventional ones in terms of the systems secrecy performance.
High hardware cost and high power consumption of massive multiple-input and multiple output (MIMO) are still two challenges for the future wireless communications including beyond 5G. Adopting the low-resolution analog-to-digital converter (ADC) is viewed as a promising solution. Additionally, the direction of arrival (DOA) estimation is an indispensable technology for beam alignment and tracking in massive MIMO systems. Thus, in this paper, the performance of DOA estimation for massive MIMO receive array with mixed-ADC structure is first investigated, where one part of radio frequency (RF) chains are connected with high-resolution ADCs and the remaining ones are connected with low-resolution ADCs. Moreover, the Cramer-Rao lower bound (CRLB) for this architecture is derived based on the additive quantization noise model approximation for the effect of low-resolution ADCs. Then, the root-MUSIC method is designed for such a receive structure. Eventually, a performance loss factor and the associated energy efficiency factor is defined for analysis in detail. Simulation results find that a mixed-ADC architecture can strike a good balance among RMSE performance, circuit cost and energy efficiency. More importantly, just 1-4 bits of low-resolution ADCs can achieve a satisfactory performance for DOA measurement.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
