scholarly journals Leveraging the Restricted Isometry Property: Improved Low-Rank Subspace Decomposition for Hybrid Millimeter-Wave Systems

2018 ◽  
Vol 66 (11) ◽  
pp. 5814-5827 ◽  
Author(s):  
Wei Zhang ◽  
Taejoon Kim ◽  
David J. Love ◽  
Erik Perrins
IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 123355-123366 ◽  
Author(s):  
Long Cheng ◽  
Guangrong Yue ◽  
Daizhong Yu ◽  
Yueyue Liang ◽  
Shaoqian Li

Entropy ◽  
2020 ◽  
Vol 22 (10) ◽  
pp. 1121
Author(s):  
Prateek Saurabh Srivastav ◽  
Lan Chen ◽  
Arfan Haider Wahla

Millimeter wave (mmWave) relying upon the multiple output multiple input (MIMO) is a new potential candidate for fulfilling the huge emerging bandwidth requirements. Due to the short wavelength and the complicated hardware architecture of mmWave MIMO systems, the conventional estimation strategies based on the individual exploitation of sparsity or low rank properties are no longer efficient and hence more modern and advance estimation strategies are required to recapture the targeted channel matrix. Therefore, in this paper, we proposed a novel channel estimation strategy based on the symmetrical version of alternating direction methods of multipliers (S-ADMM), which exploits the sparsity and low rank property of channel altogether in a symmetrical manner. In S-ADMM, at each iteration, the Lagrange multipliers are updated twice which results symmetrical handling of all of the available variables in optimization problem. To validate the proposed algorithm, numerous computer simulations have been carried out which straightforwardly depicts that the S-ADMM performed well in terms of convergence as compared to other benchmark algorithms and also able to provide global optimal solutions for the strictly convex mmWave joint channel estimation optimization problem.


2019 ◽  
Vol 9 (1) ◽  
pp. 157-193 ◽  
Author(s):  
Marius Junge ◽  
Kiryung Lee

Abstract The restricted isometry property (RIP) is an integral tool in the analysis of various inverse problems with sparsity models. Motivated by the applications of compressed sensing and dimensionality reduction of low-rank tensors, we propose generalized notions of sparsity and provide a unified framework for the corresponding RIP, in particular when combined with isotropic group actions. Our results extend an approach by Rudelson and Vershynin to a much broader context including commutative and non-commutative function spaces. Moreover, our Banach space notion of sparsity applies to affine group actions. The generalized approach in particular applies to high-order tensor products.


2017 ◽  
Vol 16 (5) ◽  
pp. 2748-2759 ◽  
Author(s):  
Parisa A. Eliasi ◽  
Sundeep Rangan ◽  
Theodore S. Rappaport

2014 ◽  
Vol 644-650 ◽  
pp. 2378-2381 ◽  
Author(s):  
Li Cui ◽  
Lu Liu ◽  
Xue Zhi Huang

In this pape, we propose a matrix Iterative Hard thresholding pursuit algorithm for low-rank minimization that extends Foucart's Hard Thresholding Pursuit (HTP) algorithm from the sparse vector to the low-rank matrix case. The performance guarantee is given in terms of the rank-restricted isometry property and a low-rank solotion is presented. The numerical experiments empirically demonstrate that, although the affine constraints does not satisfy the restricted isometry property in matrix completion, our algorithm also recovers the low-rank matrix from a number of uniformly sampled entries and is more efficient compared with SVT and ADMiRA.


2021 ◽  
Vol 67 ◽  
pp. 101877
Author(s):  
Gang Wang ◽  
Qunxi Dong ◽  
Jianfeng Wu ◽  
Yi Su ◽  
Kewei Chen ◽  
...  

2018 ◽  
Vol 17 (2) ◽  
pp. 1123-1133 ◽  
Author(s):  
Xingjian Li ◽  
Jun Fang ◽  
Hongbin Li ◽  
Pu Wang

2013 ◽  
Vol 2013 ◽  
pp. 1-6
Author(s):  
Qingshan You ◽  
Qun Wan ◽  
Haiwen Xu

The principal component prsuit with reduced linear measurements (PCP_RLM) has gained great attention in applications, such as machine learning, video, and aligning multiple images. The recent research shows that strongly convex optimization for compressive principal component pursuit can guarantee the exact low-rank matrix recovery and sparse matrix recovery as well. In this paper, we prove that the operator of PCP_RLM satisfies restricted isometry property (RIP) with high probability. In addition, we derive the bound of parameters depending only on observed quantities based on RIP property, which will guide us how to choose suitable parameters in strongly convex programming.


Author(s):  
Aarab Mohamed Nassim ◽  
Chakkor Otman

With the explosive growth in demand for mobile data traffic, the contradiction between capacity requirements and spectrum scarcity becomes more and more prominent. The bandwidth is becoming a key issue in 5G mobile networks. However, with the huge bandwidth from 30 GHz to 300 GHz, mmWave communications considered an important part of the 5G mobile network providing multi communication services, where channel state information considers a challenging task for millimeter wave MIMO systems due to the huge number of antennas. Therefore, this paper discusses the channel and signal models of the mmWave, with a novel formulation for mmWave channel estimation inclusive low rank features, that we improved using a developed theory of matrix completion with Alternating Direction Method.


Sign in / Sign up

Export Citation Format

Share Document