• Title/Summary/Keyword: estimation algorithm

Search Result 5,180, Processing Time 0.029 seconds

Group-Sparse Channel Estimation using Bayesian Matching Pursuit for OFDM Systems

  • Liu, Yi;Mei, Wenbo;Du, Huiqian
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.2
    • /
    • pp.583-599
    • /
    • 2015
  • We apply the Bayesian matching pursuit (BMP) algorithm to the estimation of time-frequency selective channels in orthogonal frequency division multiplexing (OFDM) systems. By exploiting prior statistics and sparse characteristics of propagation channels, the Bayesian method provides a more accurate and efficient detection of the channel status information (CSI) than do conventional sparse channel estimation methods that are based on compressive sensing (CS) technologies. Using a reasonable approximation of the system model and a skillfully designed pilot arrangement, the proposed estimation scheme is able to address the Doppler-induced inter-carrier interference (ICI) with a relatively low complexity. Moreover, to further reduce the computational cost of the channel estimation, we make some modifications to the BMP algorithm. The modified algorithm can make good use of the group-sparse structure of doubly selective channels and thus reconstruct the CSI more efficiently than does the original BMP algorithm, which treats the sparse signals in the conventional manner and ignores the specific structure of their sparsity patterns. Numerical results demonstrate that the proposed Bayesian estimation has a good performance over rapidly time-varying channels.

Online estimation of noise parameters for Kalman filter

  • Yuen, Ka-Veng;Liang, Peng-Fei;Kuok, Sin-Chi
    • Structural Engineering and Mechanics
    • /
    • v.47 no.3
    • /
    • pp.361-381
    • /
    • 2013
  • A Bayesian probabilistic method is proposed for online estimation of the process noise and measurement noise parameters for Kalman filter. Kalman filter is a well-known recursive algorithm for state estimation of dynamical systems. In this algorithm, it is required to prescribe the covariance matrices of the process noise and measurement noise. However, inappropriate choice of these covariance matrices substantially deteriorates the performance of the Kalman filter. In this paper, a probabilistic method is proposed for online estimation of the noise parameters which govern the noise covariance matrices. The proposed Bayesian method not only estimates the optimal noise parameters but also quantifies the associated estimation uncertainty in an online manner. By utilizing the estimated noise parameters, reliable state estimation can be accomplished. Moreover, the proposed method does not assume any stationarity condition of the process noise and/or measurement noise. By removing the stationarity constraint, the proposed method enhances the applicability of the state estimation algorithm for nonstationary circumstances generally encountered in practice. To illustrate the efficacy and efficiency of the proposed method, examples using a fifty-story building with different stationarity scenarios of the process noise and measurement noise are presented.

VOICE SOURCE ESTIMATION USING SEQUENTIAL SVD AND EXTRACTION OF COMPOSITE SOURCE PARAMETERS USING EM ALGORITHM

  • Hong, Sung-Hoon;Choi, Hong-Sub;Ann, Sou-Guil
    • Proceedings of the Acoustical Society of Korea Conference
    • /
    • 1994.06a
    • /
    • pp.893-898
    • /
    • 1994
  • In this paper, the influence of voice source estimation and modeling on speech synthesis and coding is examined and then their new estimation and modeling techniques are proposed and verified by computer simulation. It is known that the existing speech synthesizer produced the speech which is dull and inanimated. These problems are arised from the fact that existing estimation and modeling techniques can not give more accurate voice parameters. Therefore, in this paper we propose a new voice source estimation algorithm and modeling techniques which can not give more accurate voice parameters. Therefore, in this paper we propose a new voice source estimation algorithm and modeling techniques which can represent a variety of source characteristics. First, we divide speech samples in one pitch region into four parts having different characteristics. Second, the vocal-tract parameters and voice source waveforms are estimated in each regions differently using sequential SVD. Third, we propose composite source model as a new voice source model which is represented by weighted sum of pre-defined basis functions. And finally, the weights and time-shift parameters of the proposed composite source model are estimeted uning EM(estimate maximize) algorithm. Experimental results indicate that the proposed estimation and modeling methods can estimate more accurate voice source waveforms and represent various source characteristics.

  • PDF

Channel estimation of OFDM System using Matching Pursuit method (Matching Pursuit 방식을 이용한 OFDM 시스템의 채널 추정)

  • Choi Jae Hwan;Lim Chae Hyun;Han Dong Seog;Yoon Dae Jung
    • Journal of Broadcast Engineering
    • /
    • v.10 no.2
    • /
    • pp.166-173
    • /
    • 2005
  • In this paper, we propose a mobile channel estimation algorithm using matching pursuit algorithm for orthogonal frequency division multiplexing (OFDM) systems. Least square (LS) algorithm, which is used as a conventional channel estimation algorithm for OFDM systems, has error probability of channel estimation affected by effects of noise. By estimating the channel of sparse type, the proposed algorithm reduces effects of noise during time intervals that multi-path signal doesn't exist. The proposed algorithm estimates a mobile receivingchannel using pilot information transmitted consequently. We compare performance of the proposed algorithm with the LS algorithm by measuring symbol error rate with 64QAM under a mobile multi-path fading channel model.

A Fast Motion Estimation Algorithm Using Adaptive Elimination of Sub-block Partial Coefficient (서브블록 부분 계수 적응제거를 통한 고속 움직임 추정 알고리즘)

  • Ryu, Tae-Kyung;Moon, Kwang-Seok;Kim, Jong-Nam
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.4
    • /
    • pp.483-491
    • /
    • 2009
  • In this paper, we propose a fast motion estimation algorithm using adaptive elimination of sub-block partial coefficients. The proposed algorithm predicts an adaptive threshold for each sub-block by using relationship of an initial sum of absolute difference(SAD) and a minimum SAD at the current point, and efficiently reduces unnecessary calculation time of the conventional partial distortion elimination(PDE) algorithm with the predicted threshold. Our algorithm reduces about 60% of computations of the conventional PDE algorithm without any degradation of prediction quality compared with the con ventional full search. Additionally, the proposed algorithm can be applied to other fast motion estimation 떠gorithms. the proposed Our proposing algorithm will be useful to real-time video coding applications using MPEG-2 or MPEG-4 AVC standards.

  • PDF

New algorithm to estimate proton beam range for multi-slit prompt-gamma camera

  • Ku, Youngmo;Jung, Jaerin;Kim, Chan Hyeong
    • Nuclear Engineering and Technology
    • /
    • v.54 no.9
    • /
    • pp.3422-3428
    • /
    • 2022
  • The prompt gamma imaging (PGI) technique is considered as one of the most promising approaches to estimate the range of proton beam in the patient and unlock the full potential of proton therapy. In the PGI technique, a dedicated algorithm is required to estimate the range of the proton beam from the prompt gamma (PG) distribution acquired by a PGI system. In the present study, a new range estimation algorithm was developed for a multi-slit prompt-gamma camera, one of PGI systems, to estimate the range of proton beam with high accuracy. The performance of the developed algorithm was evaluated by Monte Carlo simulations for various beam/phantom combinations. Our results generally show that the developed algorithm is very robust, showing very high accuracy and precision for all the cases considered in the present study. The range estimation accuracy of the developed algorithm was 0.5-1.7 mm, which is approximately 1% of beam range, for 1×109 protons. Even for the typical number of protons for a spot (1×108), the range estimation accuracy of the developed algorithm was 2.1-4.6 mm and smaller than the range uncertainties and typical safety margin, while that of the existing algorithm was 2.5-9.6 mm.

Delay Time Estimation in Frequency Selective Fading Channels

  • Lee Kwan-Houng;Song Woo-Young
    • Journal of information and communication convergence engineering
    • /
    • v.3 no.3
    • /
    • pp.119-121
    • /
    • 2005
  • This paper aims to estimate the delay time of multiple signals in a multi-path environment. It also seeks to carry out a comparative analysis with the existing delay time under the proposed algorithm to develop a new algorithm that applies the space average method in a MUSIC algorithm. Unlike the existing delay time estimation algorithm, the developed algorithm was able to estimate the delay time in 5ns low. Therefore, the algorithm proposed in this paper improved the existing delay time estimated algorithm.

Partitioned State Estimation in Electric Power Systems (계통분할에 의한 전력계통 상태추정)

  • 박석춘;최상봉;문영현
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.37 no.7
    • /
    • pp.427-433
    • /
    • 1988
  • This paper presents a partitioned state estimation algorithm on the basis of network reduction by using a estimation technique of boundary line flows. The network is partitioned into several subnetworks, which generates boundary lines. The accurate estimation of boundary line flows enables us to perform state estimation on each sub-system independently. A precise method to estimate boundary line flows is presented for the partitioned state estimation. The proposed algorithm redices computation time and memory requirements remarkably. The proposed algorithm have been tested for IEEE sample system and verified to be applicable to practical power systems.

Estimation of Distributed Signal's Direction of Arrival Using Advanced ESPRIT Algorithm (개선된 ESPRIT 알고리즘을 이용한 퍼진 신호의 신호도착방향 추정)

  • Chung, Sung-Hoon;Lee, Dong-Wook
    • Proceedings of the KIEE Conference
    • /
    • 1999.11c
    • /
    • pp.703-705
    • /
    • 1999
  • In this paper, we introduce the direction of arrival(DOA) estimation of distributed signal based on the improved ESPRIT algorithm. Most research on the estimation of DOA has been performed based on the assumption that the signal sources are point sources. However, we consider a two-dimensional distributed signal source model using improved ESPRIT algorithm. In the distributed signal source model, a source is represented by two parameters, the azimuth angle and elevation angle. We address the estimation of the elevation and azimuth angles of distributed sources based on the parametric source modeling in the three-dimensional space with two uniform linear arrays. The array output vector is obtained by integrating a steering vector over all direction of arrival with the weighting of a distributed source density function. We also develop an efficient estimation procedures that can reduce the computational complexity. Some examples are shown to demonstrate explicity the estimation procedures under the distributed signal source model.

  • PDF

An algorithm for Video Object Detection using Multiresolution Motion Estimation (다해상도 움직임 예측을 이용한 동영상 물체탐지 알고리즘)

  • 조철훈;박장한;이한우;남궁재찬
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.40 no.1
    • /
    • pp.87-95
    • /
    • 2003
  • This paper proposes an object detection algorithm using the Multiresolution Motion Estimation(MRME) in wavelet d야main. A existing motion estimation method has characteristics of motion estimation but it requires having computation. Motion estimation in higher resolution used the motion vector of the lower resolution with the MRME that has parent-child relationship on wavelet coefficients. This method reduces the search area of motion estimation in higher resolution and computational complexity. The computational complexity of the proposed method is about 40% of the existing method using 3-level Set Partitioning in Hierarchical Trees(SPIHT) wavelet transform. The experimental results with the proposed method showed about 11% decrease of Mean Absolute Difference(MAD) and gains able to precise tracking of object.