本文選題：無源時差定位 + 二相編碼信號　； 參考：《西安電子科技大學(xué)》2014年碩士論文

【摘要】：無源時差定位以其作用距離遠、隱蔽性好等特點在電子戰(zhàn)系統(tǒng)中占有越來越重要的地位。無源時差定位的精度直接由時延估計的性能決定。自適應(yīng)時延估計較少依賴信號與噪聲的統(tǒng)計先驗知識,更加適用于無源時差定位的環(huán)境。因此,對自適應(yīng)時延估計方法的研究具有重要的理論意義與實用價值。本文研究最小均方誤差準則下一般自適應(yīng)時延估計方法與基于信號循環(huán)平穩(wěn)性的自適應(yīng)時延估計方法應(yīng)用于二相編碼信號時的性能。在分析一般自適應(yīng)時延估計方法的估計精度、收斂速度以及時間復(fù)雜度的基礎(chǔ)上,重點研究基于信號循環(huán)平穩(wěn)性的自適應(yīng)時延估計方法。針對二相編碼信號的帶限非平穩(wěn)特性,在傳統(tǒng)型信號循環(huán)平穩(wěn)性算法基礎(chǔ)上,本文提出了一種基于信號循環(huán)平穩(wěn)性的約束型自適應(yīng)時延估計算法,以解決傳統(tǒng)型循環(huán)平穩(wěn)算法不能直接估計整數(shù)時延與應(yīng)用插值法導(dǎo)致的復(fù)雜度高的問題。理論分析與仿真結(jié)果表明,本文所提出的基于信號循環(huán)平穩(wěn)性的約束型自適應(yīng)時延估計算法在不損失估計精度與收斂速度的前提下,其時間復(fù)雜度是最低的,是現(xiàn)存循環(huán)平穩(wěn)約束型算法的一半。針對一般的自適應(yīng)時延估計方法與基于信號循環(huán)平穩(wěn)性的自適應(yīng)時延估計方法中涉及到的約束型算法存在局部最優(yōu)點問題,本文通過傳統(tǒng)型算法估計整數(shù)時延為約束類算法提供初值的方法,避免約束型算法收斂到局部最優(yōu)點。
[Abstract]:Passive moveout location plays a more and more important role in EW system because of its long distance and good concealment. The accuracy of passive time difference location is directly determined by the performance of time delay estimation. Adaptive time delay estimation is less dependent on the statistical prior knowledge of signal and noise, so it is more suitable for passive time difference location. Therefore, the study of adaptive time delay estimation has important theoretical significance and practical value. In this paper, the general adaptive time delay estimation method based on minimum mean square error criterion and the adaptive time delay estimation method based on signal cyclic stationarity are studied. Based on the analysis of the estimation accuracy, convergence speed and time complexity of the general adaptive time delay estimation method, the adaptive time delay estimation method based on the signal cyclic stationarity is studied. Aiming at the band-limited nonstationarity of two-phase coded signals, a constrained adaptive time-delay estimation algorithm based on the cyclic stationarity of conventional signals is proposed. In order to solve the problem that the traditional cyclic stationary algorithm can not estimate the integer delay directly and the complexity caused by the application of interpolation method is high. Theoretical analysis and simulation results show that the proposed adaptive time delay estimation algorithm based on signal cyclic stationarity has the lowest time complexity without loss of estimation accuracy and convergence speed. Is half of the existing cyclic stationary constraint algorithm. In view of the local optimal problem in the conventional adaptive time delay estimation method and the adaptive time delay estimation method based on signal cyclic stationarity, the constrained algorithm has a local optimum problem. In this paper, we use the traditional algorithm to estimate the integer delay to provide the initial value for the constrained class algorithm, so as to avoid the constrained algorithm converging to the local optimum.
【學(xué)位授予單位】：西安電子科技大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2014
【分類號】：TN911.7

【參考文獻】

相關(guān)期刊論文 前1條

1 龔曉冬;田孝華;耿曉明;;基于信號循環(huán)平穩(wěn)特性的自適應(yīng)時延估計[J];微計算機信息;2008年21期

，

本文編號：1967150