scholarly journals FPGA-Based Time-Domain Channel Estimation in Gaussian Mixture Model

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Muhammad Khalid ◽  
Abid Muhammad Khan ◽  
Muhammad Rauf ◽  
Muhammad Taha Jilani ◽  
Sheraz Afzal

The performance of time-domain channel estimation deteriorates due to the presence of Gaussian mixture model (GMM) noise, which results in high mean squared error (MSE) as a challenging issue. The performance of the estimator further decreases when the complexity of the estimator is high due to the high convergence rate. In this paper, an optimized channel estimation method is proposed with low complexity and high accuracy in the GMM environment. In this channel estimation, an improved Gauss-Seidel iterative method is utilized with a minimum number of iterations. The convergence rate of the Gauss-Seidel method is improved by estimating an appropriate initial guess value when no guard bands are used in the orthogonal frequency-division multiplexing (OFDM) symbol. Simulation results provide an acceptable MSE for GMM environments, up to the probability of 5% impulsive noise component. This paper also presents the design and implementation of the proposed estimator in the NEXYS-2 FPGA platform that provides resources allocation, reconfigurability, schematic, and the timing diagram for detailed insight.

2016 ◽  
Vol 87 (3) ◽  
pp. 036107 ◽  
Author(s):  
A. K. Fedorov ◽  
M. N. Anufriev ◽  
A. A. Zhirnov ◽  
K. V. Stepanov ◽  
E. T. Nesterov ◽  
...  

2013 ◽  
Vol 694-697 ◽  
pp. 1919-1924
Author(s):  
Hao Zhou ◽  
Yun Gao ◽  
Guo Wu Yuan ◽  
Xue Jie Zhang

It is a key step to extract moving objects from background for computer vision applications. GMM based methods are the most commonly used technique for background subtraction in video sequence. However, how to establish efficient and precision background model with fast convergence rate is a Research-Worthy problem. In this paper, an effective scheme is proposed to accelerate the convergence rate of Adaptive-K Gaussian Mixture Model (AKGMM). The AKGMM algorithm alters the dimension of the parameter space at each pixel based on the changing frequency of pixel value. The number of GMM reflects the complexity of pattern at the pixel. An improved learning method is proposed for Gaussian Mixture Model. An adaptive learning rate is calculated for each Gaussian at every frame for speeding up the convergence without compromising model stability. Experimental results demonstrated that the proposed method gets a faster convergence while maintaining good robustness against complex environment compared to a conventional method.


Author(s):  
Saveeta Bai ◽  
◽  
Abid Muhammad Khan ◽  
Muhammad Rauf ◽  
Suresh Kumar ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document