English
Related papers

Related papers: Sparse Recovery with Attention: A Hybrid Data/Mode…

200 papers

Greedy approaches in general, and orthogonal matching pursuit in particular, are the most commonly used sparse recovery techniques in a wide range of applications. The complexity of these approaches is highly dependent on the size of the…

Signal Processing · Electrical Eng. & Systems 2022-08-25 Joan Palacios , Nuria González-Prelcic , Cristian Rusu

This paper proposes and analyzes a mmWave sparse channel estimation technique for OFDM systems that uses the Orthogonal Matching Pursuit (OMP) algorithm. This greedy algorithm retrieves one additional multipath component (MPC) per iteration…

Information Theory · Computer Science 2018-12-19 Felipe Gomez-Cuba , Andrea J. Goldsmith

Greedy sparse recovery has become a popular tool in many applications, although its complexity is still prohibitive when large sparsifying dictionaries or sensing matrices have to be exploited. In this paper, we formulate first a new class…

Signal Processing · Electrical Eng. & Systems 2022-11-01 Joan Palacios , Nuria González-Prelcic

Channel tracking in millimeter wave (mmWave) vehicular systems is crucial for maintaining robust vehicle-to-infrastructure (V2I) communication links, which can be leveraged to achieve high accuracy vehicle position and orientation tracking…

Signal Processing · Electrical Eng. & Systems 2025-03-10 Yun Chen , Nuria González-Prelcic , Takayuki Shimizu , Chinmay Mahabal

One strategy to obtain user location information in a wireless network operating at millimeter wave (mmWave) is based on the exploitation of the geometric relationships between the channel parameters and the user position. These…

Signal Processing · Electrical Eng. & Systems 2025-03-11 Yun Chen , Nuria González-Prelcic , Takayuki Shimizu , Hongsheng Lu

High resolution compressive channel estimation provides information for vehicle localization when a hybrid mmWave MIMO system is considered. Complexity and memory requirements can, however, become a bottleneck when high accuracy…

Signal Processing · Electrical Eng. & Systems 2022-04-05 Yun Chen , Joan Palacios , Nuria González-Prelcic , Takayuki Shimizu , Hongsheng Lu

We consider the problem of high-dimensional channel estimation in fast time-varying millimeter-wave MIMO systems with a hybrid architecture. By exploiting the low-rank and sparsity properties of the channel matrix, we propose a two-phase…

Signal Processing · Electrical Eng. & Systems 2025-11-04 Tianyu Jiang , Yan Yang , Hongjin Liu , Runyu Han , Bo Ai , Mohsen Guizani

Conventional correlation-based frame synchronization techniques can suffer significant performance degradation over multi-path frequency-selective channels. As a remedy, in this paper we consider joint frame synchronization and channel…

Information Theory · Computer Science 2017-09-06 Ozgur Ozdemir , Ridha Hamila , Naofal Al-Dhahir , Ismail Guvenc

Support recovery of sparse signals from compressed linear measurements is a fundamental problem in compressed sensing (CS). In this paper, we study the orthogonal matching pursuit (OMP) algorithm for the recovery of support under noise. We…

Information Theory · Computer Science 2015-10-28 Jian Wang

Accurate parameter estimation such as angle of arrival (AOA) is essential to enhance the performance of integrated sensing and communication (ISAC) in mmWave multiple-input multiple-output (MIMO) systems. This work presents a sensing-aided…

Information Theory · Computer Science 2025-03-05 Ngoc-Son Duong , Khac-Hoang Ngo , Thai-Mai Dinh , Van-Linh Nguyen

Orthogonal matching pursuit (OMP) is a greedy algorithm popularly being used for the recovery of sparse signals. In this paper, we study the performance of OMP for support recovery of sparse signal under noise. Our analysis shows that under…

Information Theory · Computer Science 2020-12-14 Hengkuan Lu , Jian Wang

The orthogonal matching pursuit (OMP) algorithm is a commonly used algorithm for recovering $K$-sparse signals $\x\in \mathbb{R}^{n}$ from linear model $\y=\A\x$, where $\A\in \mathbb{R}^{m\times n}$ is a sensing matrix. A fundamental…

Information Theory · Computer Science 2019-04-23 Jinming Wen , Wei Yu

Orthogonal Matching Pursuit (OMP) has been a powerful method in sparse signal recovery and approximation. However, OMP suffers computational issues when the signal has a large number of non-zeros. This paper advances OMP and its extension…

Computer Vision and Pattern Recognition · Computer Science 2025-04-28 Huiyuan Yu , Jia He , Maggie Cheng

We address the problem of joint sparsity pattern recovery based on low dimensional multiple measurement vectors (MMVs) in resource constrained distributed networks. We assume that distributed nodes observe sparse signals which share the…

Information Theory · Computer Science 2015-06-16 Thankshila Wimalajeewa , Pramod K. Varshney

The orthogonal matching pursuit (OMP) is one of the mainstream algorithms for sparse data reconstruction or approximation. It acts as a driving force for the development of several other greedy methods for sparse data reconstruction, and it…

Information Theory · Computer Science 2023-03-31 Yun-Bin Zhao , Zhi-Quan Luo

Orthogonal Matching Pursuit (OMP) is a canonical greedy pursuit algorithm for sparse approximation. Previous studies of OMP have mainly considered the exact recovery of a sparse signal $\bm x$ through $\bm \Phi$ and $\bm y=\bm \Phi \bm x$,…

Information Theory · Computer Science 2015-05-28 Jie Ding , Laming Chen , Yuantao Gu

Direction of Arrival (DOA) estimation of multiple narrow-band coherent or partially coherent sources is a major challenge in array signal processing. Though many subspace- based algorithms are available in literature, none of them tackle…

Information Theory · Computer Science 2018-01-26 Abhishek Aich , P. Palanisamy

This paper considers the problem of tracking a dynamic sparse channel in a broadband wireless communication system. A probabilistic signal model is firstly proposed to describe the special features of temporal correlations of dynamic sparse…

Information Theory · Computer Science 2016-11-15 Xudong Zhu , Linglong Dai , Wei Dai , Zhaocheng Wang , Marc Moonen

Orthogonal matching pursuit (OMP) is a greedy algorithm widely used for the recovery of sparse signals from compressed measurements. In this paper, we analyze the number of iterations required for the OMP algorithm to perform exact recovery…

Information Theory · Computer Science 2016-02-23 Jian Wang , Byonghyo Shim

In this paper we revisit the sparse multiple measurement vector (MMV) problem where the aim is to recover a set of jointly sparse multichannel vectors from incomplete measurements. This problem has received increasing interest as an…

Information Theory · Computer Science 2015-03-14 Mike E. Davies , Yonina C. Eldar
‹ Prev 1 2 3 10 Next ›