• Title/Summary/Keyword: least squares problem

Search Result 347, Processing Time 0.03 seconds

Gauss-Newton Based Emitter Location Method Using Successive TDOA and FDOA Measurements (연속 측정된 TDOA와 FDOA를 이용한 Gauss-Newton 기법 기반의 신호원 위치추정 방법)

  • Kim, Yong-Hee;Kim, Dong-Gyu;Han, Jin-Woo;Song, Kyu-Ha;Kim, Hyoung-Nam
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.7
    • /
    • pp.76-84
    • /
    • 2013
  • In the passive emitter localization using instantaneous TDOA (time difference of arrival) and FDOA (frequency difference of arrival) measurements, the estimation accuracy can be improved by collecting additional measurements. To achieve this goal, it is required to increase the number of the sensors. However, in electronic warfare environment, a large number of sensors cause the loss of military strength due to high probability of intercept. Also, the additional processes should be considered such as the data link and the clock synchronization between the sensors. Hence, in this paper, the passive localization of a stationary emitter is presented by using the successive TDOA and FDOA measurements from two moving sensors. In this case, since an independent pair of sensors is added in the data set at every instant of measurement, each pair of sensors does not share the common reference sensor. Therefore, the QCLS (quadratic correction least squares) methods cannot be applied, in which all pairs of sensor should include the common reference sensor. For this reason, a Gauss-Newton algorithm is adopted to solve the non-linear least square problem. In addition, to show the performance of the proposed method, we compare the RMSE (root mean square error) of the estimates with CRLB (Cramer-Rao lower bound) and derived the CEP (circular error probable) planes to analyze the expected estimation performance on the 2-dimensional space.

On the Behavior of the Signed Regressor Least Mean Squares Adaptation with Gaussian Inputs (가우시안 입력신호에 대한 Signed Regressor 최소 평균자승 적응 방식의 동작 특성)

  • 조성호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.18 no.7
    • /
    • pp.1028-1035
    • /
    • 1993
  • The signed regressor (SR) algorithm employs one bit quantization on the input regressor (or tap input) in such a way that the quantized input sequences become +1 or -1. The algorithm is computationally more efficient by nature than the popular least mean square (LMS) algorithm. The behavior of the SR algorithm unfortunately is heavily dependent on the characteristics of the input signal, and there are some Inputs for which the SR algorithm becomes unstable. It is known, however, that such a stability problem does not take place with the SR algorithm when the input signal is Gaussian, such as in the case of speech processing. In this paper, we explore a statistical analysis of the SR algorithm. Under the assumption that signals involved are zero-mean and Gaussian, and further employing the commonly used independence assumption, we derive a set of nonlinear evolution equations that characterizes the mean and mean-squared behavior of the SR algorithm. Experimental results that show very good agreement with our theoretical derivations are also presented.

  • PDF

An Empirical Study on the factors for Information Protection Policy of Employee's Compliance Intention (정보보호정책 준수의도에 미치는 요인에 관한 경험적 연구)

  • Kwon, Jang-Kee;Lee, Joon-Taik
    • Journal of Convergence Society for SMB
    • /
    • v.4 no.3
    • /
    • pp.7-13
    • /
    • 2014
  • In recent years, according to the increasing of information security compliance, information security management system's requirements is not a matter of choice but an essential problem. In this respect, this research have an invention to survey what it will affect employees in compliance with the privacy policy antecedents and how to apply this information for the future, and to suggest ways to improve the employees' information security policy compliance intentions. In this paper, To investigate the factors affecting the degree of information security policy compliance using the structural equation of least squares (PLS Partial Least Square) in the confumatory level (confirmatory), the factor analysis of the primary factor analysis and secondary last. The results is that almost of influencing factors affect to the compliance with information security policies directly, but not affect self-efficacy.

  • PDF

Application of Sliding Mode fuzzy Control with Disturbance Prediction (외란 예측기가 포함된 슬라이딩 모드 퍼지 제어기의 응용)

  • 김상범;윤정방;구자인
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2000.04b
    • /
    • pp.365-370
    • /
    • 2000
  • A sliding mode fuzzy control (SMFC) algorithm is applied to design a controller for a benchmark problem on a wind- excited building. The structure is a 76-story concrete office tower with a height of 306 meters, hence the wind resistance characteristics are very important for the serviceability as well as the safety. A control system with an active tuned mass damper is assumed to be installed on the top floor. Since the structural acceleration is measured only at ,limited number of locations without measurement of the wind force, the structure of the conventional continuous sliding mode control may have the feed-back loop only. So, an adaptive least mean squares (LMS) filter is employed in the SMFC algorithm to generate a fictitious feed-forward loop. The adaptive LMS filter is designed based on the information of the stochastic characteristics of the wind velocity along the structure. A numerical study is carried out. and the performance of the present SMFC with the ,adaptive LMS filter is investigated in comparison with those of' other control, of algorithms such as linear quadratic Gaussian control, frequency domain optimal control, quadratic stability control, continuous sliding mode control, and H/sub ∞///sub μ/, control, which were reported by other researchers. The effectiveness of the adaptive LMS filter is also examined. The results indicate that the present algorithm is very efficient .

  • PDF

A downlink beam synthesized method considering phase matching between common overhead channel and traffic channel in FDD/CDMA systems (FDD/CDMA 시스템에서 공통채널과 통화채널의 위상정합을 고려한 순방향 빔 합성 기법)

  • 이준성;이충용
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.41 no.11
    • /
    • pp.67-72
    • /
    • 2004
  • In this paper, we propose a downlink beamforming method which is considered common pilot channel for coherent detection and dedicated traffic channel for desired user in FDD/CDMA systems. The existing downlink beamforming system produces phase mismatch between traffic and pilot signals at desired mobile as well as interference to other mobiles. A new downlink beamforming method can solve above problem based on least squares method between reference function and beamforming function. A numerical analysis shows that the proposed downlink beamforming method matches well and gives low BER performance.

Combined Time Synchronization And Channel Estimation For MB-OFDM UWB Systems

  • Kareem, Aymen M.;El-Saleh, Ayman A.;Othman, Masuri
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.7
    • /
    • pp.1792-1801
    • /
    • 2012
  • Symbol timing error amounts to a major degradation in the system performance. Conventionally, timing error is estimated by predefined preamble on both transmitter and receiver. The maximum of the correlation result is considered the start of the OFDM symbol. Problem arises when the prime path is not the strongest one. In this paper, we propose a new combined time and channel estimation method for multi-band OFDM ultra wide-band (MB-OFDM UWB) systems. It is assumed that a coarse timing has been obtained at a stage before the proposed scheme. Based on the coarse timing, search interval is set (or time candidates). Exploiting channel statistics that are assumed to be known by the receiver, we derive a maximum a posteriori estimate (MAP) of the channel impulse response. Based on this estimate, we discern for the timing error. Timing estimation performance is compared with the least squares (LS) channel estimate in terms of mean squared error (MSE). It is shown that the proposed timing scheme is lower in MSE than the LS method.

Visualizing (X,Y) Data by Partial Least Squares Method (PLS 기법에 의한 (X,Y) 자료의 시각화)

  • Huh, Myung-Hoe;Lee, Yong-Goo;Yi, Seong-Keun
    • The Korean Journal of Applied Statistics
    • /
    • v.20 no.2
    • /
    • pp.345-355
    • /
    • 2007
  • PLS methods are suited for regressing q-variate Y variables on p-variate X variables even in the presence of multicollinearity problem among X variables. Consequently, they are useful for analyzing datasets with smaller number of observations compared to the number of variables, such as NIR(near-infrared) spectroscopy data in chemometrics. In this study, we propose two visualizing methods of p-variate X variables and q-variate Y variable that can be used in connection with PLS analysis.

Torusity Tolerance Verification using Swarm Intelligence

  • Prakasvudhisarn, Chakguy;Kunnapapdeelert, Siwaporn
    • Industrial Engineering and Management Systems
    • /
    • v.6 no.2
    • /
    • pp.94-105
    • /
    • 2007
  • Measurement technology plays an important role in discrete manufacturing industry. Probe-type coordinate measuring machines (CMMs) are normally used to capture the geometry of part features. The measured points are then fit to verify a specified geometry by using the least squares method (LSQ). However, it occasionally overestimates the tolerance zone, which leads to the rejection of some good parts. To overcome this drawback, minimum zone approaches defined by the ANSI Y14.5M-1994 standard have been extensively pursued for zone fitting in coordinate form literature for such basic features as plane, circle, cylinder and sphere. Meanwhile, complex features such as torus have been left to be dealt-with by the use of profile tolerance definition. This may be impractical when accuracy of the whole profile is desired. Hence, the true deviation model of torus is developed and then formulated as a minimax problem. Next, a relatively new and simple population based evolutionary approach, particle swarm optimization (PSO), is applied by imitating the social behavior of animals to find the minimum tolerance zone torusity. Simulated data with specified torusity zones are used to validate the deviation model. The torusity results are in close agreement with the actual torusity zones and also confirm the effectiveness of the proposed PSO when compared to those of the LSQ.

Estimation of Demand Functions for Imported Fisheries Products Using Cointegration Analysis: Effect Analysis of Tariff Reduction (공적분 분석을 이용한 우리나라 수입수산물의 수요함수 추정 : 관세감축영향분석)

  • Nam, Jong-Oh;Kim, Soo-Jin
    • Ocean and Polar Research
    • /
    • v.32 no.1
    • /
    • pp.23-40
    • /
    • 2010
  • This study investigated the effects of imported fisheries products on WTO/DDA tariff negotiations. To calculate the results, the study estimated the demand functions of imported fisheries products by using unit root and cointegration approaches. These approaches allowed us to solve spurious regression problems with macro-economic variables. In addition, this study surmised the effects of change by individually imported fish products from a tariff negotiation model using price elasticities of estimated import demand function. In a process of the analysis for estimating import effects, this study found out that 39 out of 128 imported fish products had positive (+) price elasticities or did not exhibit cointegrations. To cure this problem, this study suggested that the effects of these 39 imported products be estimated with the average variation rate of import volume, rather than by the Ordinary Least Squares approach. In this study, a case-study of tariff formula with coefficient 8 based on a 'Swiss formula' for priority duty rate of 2001 and 2008 was used by to analyze the effect of change in the 128 imported fish products of both years, respectively.

ON THE M-SOLUTION OF THE FIRST KIND EQUATIONS

  • Rim, Dong-Il;Yun, Jae-Heon;Lee, Seok-Jong
    • Communications of the Korean Mathematical Society
    • /
    • v.10 no.1
    • /
    • pp.235-249
    • /
    • 1995
  • Let K be a bounded linear operator from Hilbert space $H_1$ into Hilbert space $H_2$. When numerically solving the first kind equation Kf = g, one usually picks n orthonormal functions $\phi_1, \phi_2,...,\phi_n$ in $H_1$ which depend on the numerical method and on the problem, see Varah [12] for more details. Then one findes the unique minimum norm element $f_M \in M$ that satisfies $\Vert K f_M - g \Vert = inf {\Vert K f - g \Vert : f \in M}$, where M is the linear span of $\phi_1, \phi_2,...,\phi_n$. Such a solution $f_M \in M$ is called the M-solution of K f = g. Some methods for finding the M-solution of K f = g were proposed by Banks [2] and Marti [9,10]. See [5,6,8] for convergence results comparing the M-solution of K f = g with $f_0$, the least squares solution of minimum norm (LSSMN) of K f = g.

  • PDF