Fast and low-complexity orthogonal matching pursuit based channel estimation in ISDB-T receiver with 3-element ESPAR antenna

2016 ◽  
Author(s):  
Rian Ferdian ◽  
Yafei Hou ◽  
Minoru Okada
Keyword(s):  
Channel Estimation ◽  
Matching Pursuit ◽  
Low Complexity ◽  
Orthogonal Matching Pursuit

scholarly journals Low Complexity FFT Factorization for CS Reconstruction

2020 ◽  
Vol 9 (3) ◽  
pp. 438-442
Keyword(s):  
Real Time ◽  
High Speed ◽  
Performance Metrics ◽  
Matching Pursuit ◽  
Matrix Multiplication ◽  
Low Complexity ◽  
Orthogonal Matching Pursuit ◽  
Reconstruction Algorithms ◽  
Wide Range ◽  
Computationally Intensive

In this paper is presented a novel area efficient Fast Fourier transform (FFT) for real-time compressive sensing (CS) reconstruction. Among various methodologies used for CS reconstruction algorithms, Greedy-based orthogonal matching pursuit (OMP) approach provides better solution in terms of accurate implementation with complex computations overhead. Several computationally intensive arithmetic operations like complex matrix multiplication are required to formulate correlative vectors making this algorithm highly complex and power consuming hardware implementation. Computational complexity becomes very important especially in complex FFT models to meet different operational standards and system requirements. In general, for real time applications, FFT transforms are required for high speed computations as well as with least possible complexity overhead in order to support wide range of applications. This paper presents an hardware efficient FFT computation technique with twiddle factor normalization for correlation optimization in orthogonal matching pursuit (OMP). Experimental results are provided to validate the performance metrics of the proposed normalization techniques against complexity and energy related issues. The proposed method is verified by FPGA synthesizer, and validated with appropriate currently available comparative analyzes.

scholarly journals Sparse Channel Estimation of Underwater TDS-OFDM System Using Look-Ahead Backtracking Orthogonal Matching Pursuit

IEEE Access ◽  
2018 ◽  
Vol 6 ◽  
pp. 74389-74399 ◽  
Author(s):  
Naveed Ur Rehman Junejo ◽  
Hamada Esmaiel ◽  
Mingzhang Zhou ◽  
Haixin Sun ◽  
Jie Qi ◽  
...  
Keyword(s):  
Channel Estimation ◽  
Matching Pursuit ◽  
Orthogonal Matching Pursuit ◽  
Ofdm System ◽  
Sparse Channel Estimation ◽  
Look Ahead ◽  
Sparse Channel

The Research on Sparse Channel Estimation in Multi-Relay Cooperative Communication System

2014 ◽  
Vol 556-562 ◽  
pp. 5153-5158
Author(s):  
Yi Xuan Wang ◽  
Shou Yi Yang ◽  
Tao Ge ◽  
Ai Hua Zhang
Keyword(s):  
Channel Estimation ◽  
Mean Square Error ◽  
Cooperative Communication ◽  
Communication System ◽  
Matching Pursuit ◽  
Estimation Algorithm ◽  
Orthogonal Matching Pursuit ◽  
Mean Square ◽  
Relay System ◽  
Matching Pursuit Algorithm

In a frequency selective fading environment amplify and forward relay system, the channel estimation algorithm and least squares (LS) estimation of mean square error is relatively high. And when using the compressed sensing (CS) which was proposed recently in orthogonal matching pursuit algorithm (OMP) for the single relay channel and multi relay system estimation, in order to reduce the mean square error of the system. In multi-relay cooperative communication system, allocated the power to the relay node, then respectively using the LS and OMP for channel estimation. The results show that, the orthogonal matching pursuit algorithm can greatly reduce the system mean square error, and the same channel estimation algorithm was used for the relay power allocation is also effectively reduce the estimation error, to further improve the accuracy of channel estimation.

Sign in / Sign up

Export Citation Format

Share Document