相干信号DOA估计的研究

《相干信号DOA估计的研究》由会员上传分享，免费在线阅读，更多相关内容在教育资源-天天文库。

1、大连海事大学┊┊┊┊┊┊┊装┊┊┊┊┊┊┊订┊┊┊┊┊┊┊线┊┊┊┊┊┊┊毕业论文二○○八年六月18相干信号DOA估计方法的研究与仿真专业班级：通信二班姓名：雷福亮指导教师：李森信息工程学院18内容摘要相干信号的DOA估计是阵列信号处理中的一个研究热点，也是阵列信号处理中的一个重要研究课题，也是雷达、声纳、通信等领域基本任务之一。为了解决相干信号的处理问题，各国学者提出了不少算法，这些算法大致可分为两类:一类以牺牲有效阵元数来换取信号的不相关性，即先对阵列信号进行去相干的预处理，而后应用普通的各种算法以获取精确的到达

2、角，如空间平滑法，前后向预测投影矩阵法，数据矩阵分解法。另一类是不损失阵列孔径而利用移动阵列的方法或采用频率平滑法处理相干信号。本文重点是关于相干信号DOA估计算法的研究。首先介绍了DOA估计问题的原理，对部分非相干信号DOA估计的经典算法进行了分析与比较。之后重点研究了解决相干信号DOA估计的前向空间平滑算法和前后向空间平滑算法。最后通过MATLAB仿真验证了以上算法的有效性。关键词:相干信号DOA估计；阵列信号处理;空间平滑。18AbstractTheDOA(Direction-of-Arrival)estima

3、tionofcoherentsignalsisaresearchhotspotandimportantresearchsubjectofarraysignalprocessing,itisalsooneofthebasictaskofradar,sonarcommunicationareasandsoon.InordertosolvetheproblemoftheDOAestimationofcoherentsignals,researchersallovertheworldproposedalotofalgorit

4、hms,allthealgorithmscanbedepartedtwotypes:hefirsttypecandecreasetherelativityofcoherentsignalsbysacrificingthenumberofarrays,thatispreprocessingthecoherentsignalsthenestimatethepreciseDOAwiththecommonalgorithmssuchasthespatialsmoothing,forwardbackwardprediction

5、projectionanddatamatrixdecompositionalgorithm.Theothertypeneedn'tdecreasetheapertureofthearrays,whichshiftthearraysormakeuseoffrequencysmoothingtodecreasetherelativity.Thisdissertationputtheemphasisonresearchesofdirection-of-arrivalestimationalgorithms.Itfirsti

6、ntroducestheprinciplesofDOAestimation,andmakesanalysisandcomparisonabouttheclassicalalgorithmsoftheDOAestimationofincoherentsignal.Andthen,itputstheemphasisonresearchingtoresolvethefrontspacesmoothalgorithmandfront-rearspacesmoothalgorithmofDOAestimationofcoher

7、entsignals.Atlast,throughMATLABsimulationprovetheefficiencyofthealgorithm.Keywords:DOAestimationofcoherentsignals;SignalProcessing;spacesmooth18目录1　绪论···············································································································

8、·········································11.1　课题研究背景及意义·················································································································11.1.