• Title/Summary/Keyword: norm estimation

Search Result 109, Processing Time 0.026 seconds

Performance analysis of DoA estimation algorithm using a circular array antenna (원형 배열 안테나의 DoA 추정 알고리즘 성능 분석)

  • Lim, Seung-Gag;Kang, Dae-Soo
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.9 no.2
    • /
    • pp.395-400
    • /
    • 2008
  • This paper relates to the performance analysis of DoA estimation algorithm in 2-dimensional circular array antenna for the receiving of GPS signal which is used for the performance improvement by elimination of jammer signal. By performing the spatial filtering after the DoA estimation in array antenna, the quality of receiving signal can improve by the nulling of jammer signal from the undesired direction and the forming of beam from the desired direction. In this paper, the MUSIC and MinNorm algorithm used for DoA estimation were applied after fixing the angle and power of jammer signal in 4 element and 7 element circular array antenna. In order to performance analysis, the estimation result and estimation error were computed by computer simulation. As a result, the MUSIC and MinNorm were fairly good in azimuth and elevation angle estimation of DoA in case of good signal to noise ratio and the MUSIC has better performance compared to MinNorm in case of poor signal to noise ratio.

A Robust Estimation Procedure for the Linear Regression Model

  • Kim, Bu-Yong
    • Journal of the Korean Statistical Society
    • /
    • v.16 no.2
    • /
    • pp.80-91
    • /
    • 1987
  • Minimum $L_i$ norm estimation is a robust procedure ins the sense that it leads to an estimator which has greater statistical eficiency than the least squares estimator in the presence of outliers. And the $L_1$ norm estimator has some desirable statistical properties. In this paper a new computational procedure for $L_1$ norm estimation is proposed which combines the idea of reweighted least squares method and the linear programming approach. A modification of the projective transformation method is employed to solve the linear programming problem instead of the simplex method. It is proved that the proposed algorithm terminates in a finite number of iterations.

  • PDF

A PARAMETER ESTIMATION METHOD FOR MODEL ANALYSIS

  • Oh Se-Young;Kwon Sun-Joo;Yun Jae-Heon
    • Journal of applied mathematics & informatics
    • /
    • v.22 no.1_2
    • /
    • pp.373-385
    • /
    • 2006
  • To solve a class of nonlinear parameter estimation problems, a method combining the regularized structured nonlinear total least norm (RSNTLN) method and parameter separation scheme is suggested. The method guarantees the convergence of parameters and has an advantages in reducing the residual norm over the use of RSNTLN only. Numerical experiments for two models appeared in signal processing show that the suggested method is more effective in obtaining solution and parameter with minimum residual norm.

THE CONSISTENCY OF NONLINEAR REGRESSION MINIMIZING $L_p$-NORM

  • Choi, Seung-Hoe;Park, Kyung-Ok
    • East Asian mathematical journal
    • /
    • v.14 no.2
    • /
    • pp.421-427
    • /
    • 1998
  • In this paper we provide sufficient conditions which ensure the strong consistency of $L_p$-norm estimation in nonlinear regression model when the probability distribution of the errors term is symmetric about zero. The least absolute deviation and least square estimation are discussed as special cases of the proposed estimation.

  • PDF

Kernel Density Estimation in the L$^{\infty}$ Norm under Dependence

  • Kim, Tae-Yoon
    • Journal of the Korean Statistical Society
    • /
    • v.27 no.2
    • /
    • pp.153-163
    • /
    • 1998
  • We investigate density estimation problem in the L$^{\infty}$ norm and show that the iii optimal minimax rates are achieved for smooth classes of weakly dependent stationary sequences. Our results are then applied to give uniform convergence rates for various problems including the Gibbs sampler.

  • PDF

Eigen-Analysis Based Super-Resolution Time Delay Estimation Algorithms for Spread Spectrum Signals (대역 확산 신호를 위한 고유치 해석 기반의 초 분해능 지연 시간 추정 알고리즘)

  • Park, Hyung-Rae;Shin, Joon-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38A no.12
    • /
    • pp.1013-1020
    • /
    • 2013
  • In this paper the super-resolution time delay estimation algorithms based on eigen-analysis are developed for spread spectrum signals along with their comparative performance analysis. First, we shall develop super-resolution time delay estimation algorithms using the representative eigen-analysis based AOA (angle-of-arrival) estimation algorithms such as MUSIC, Minimum-Norm, and ESPRIT, and apply them to the ISO/IEC 24730-2.1 real-time locating system (RTLS) employing a direct sequence spread spectrum (DS-SS) technique to compare their performances in RTLS environments. Simulation results illustrate that all the three algorithms can resolve multipath signals whose delay differences are even smaller than the Rayleigh resolution limit. Simulation results also show that MUSIC and Minimum-Norm provide a similar performance while ESPRIT is inferior to both algorithms in RTLS environments.

ROBUST $L_{p}$-NORM ESTIMATORS OF MULTIVARIATE LOCATION IN MODELS WITH A BOUNDED VARIANCE

  • Georgly L. Shevlyakov;Lee, Jae-Won
    • The Pure and Applied Mathematics
    • /
    • v.9 no.1
    • /
    • pp.81-90
    • /
    • 2002
  • The least informative (favorable) distributions, minimizing Fisher information for a multivariate location parameter, are derived in the parametric class of the exponential-power spherically symmetric distributions under the following characterizing restrictions; (i) a bounded variance, (ii) a bounded value of a density at the center of symmetry, and (iii) the intersection of these restrictions. In the first two cases, (i) and (ii) respectively, the least informative distributions are the Gaussian and Laplace, respectively. In the latter case (iii) the optimal solution has three branches, with relatively small variances it is the Gaussian, them with intermediate variances. The corresponding robust minimax M-estimators of location are given by the $L_2$-norm, the $L_1$-norm and the $L_{p}$ -norm methods. The properties of the proposed estimators and their adaptive versions ar studied in asymptotics and on finite samples by Monte Carlo.

  • PDF

Optimal Estimation within Class of James-Stein Type Decision Rules on the Known Norm

  • Baek, Hoh Yoo
    • Journal of Integrative Natural Science
    • /
    • v.5 no.3
    • /
    • pp.186-189
    • /
    • 2012
  • For the mean vector of a p-variate normal distribution ($p{\geq}3$), the optimal estimation within the class of James-Stein type decision rules under the quadratic loss are given when the underlying distribution is that of a variance mixture of normals and when the norm ${\parallel}\underline{{\theta}}{\parallel}$ in known. It also demonstrated that the optimal estimation within the class of Lindley type decision rules under the same loss when the underlying distribution is the previous type and the norm ${\parallel}{\theta}-\overline{\theta}\underline{1}{\parallel}$ with $\overline{\theta}=\frac{1}{p}\sum\limits_{i=1}^{n}{\theta}_i$ and $\underline{1}=(1,{\cdots},1)^{\prime}$ is known.

A New Block Matching Algorithm for Motion Estimation (움직임 추정을 위한 새로운 블록 정합 알고리즘)

  • Jung, Soo-Mok
    • Journal of Information Technology Services
    • /
    • v.2 no.2
    • /
    • pp.111-119
    • /
    • 2003
  • In this paper, an efficient block matching algorithm which is based on the Block Sum Pyramid Algorithm (BSPA) is presented. The cost of BSPA[1] was reduced in the proposed algorithm by using l2 norm and partial distortion elimination technique. Motion estimation accuracy of the proposed algorithm is equal to that of BSPA. The efficiency of the proposed algorithm was verified by experimental results.

A fast motion estimation method prediction of motion estimation error (움직임 추정오차의 예측을 이용한 고속 움직임 추정 방법)

  • Kang, Hyun-Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.9C
    • /
    • pp.1323-1329
    • /
    • 2004
  • This paper presents an enhanced MSEA(multi-level successive elimination algorithm) which is a fast algorithm of the full-search motion estimation. We predict the SAD at the final level using the values of norms at the preceding levels in MSEA and then decide on whether the processing at the following levels should be proceeded or not. We skip the computation at the following levels where the processing is not meaningful anymore. Consequently, we take computational gain. For the purpose of predicting the values of SAD at each level, we first show the theoretical analysis of the value of norm at each level, which is verified by experiments. Based on the analysis a new motion estimation method is proposed and its performance is evaluated.