检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《计算机仿真》2010年第11期336-339,共4页Computer Simulation
摘 要:目前将酉变换算法用于奇数阵元均匀圆阵时需要利用模式空间算法进行预处理,而模式空间算法需要阵元数过多,且与酉变换算法结合后只能针对特定俯仰角在方位向上进行一维搜索。针对问题提出利用高阶累积量算法对阵列接收数据进行预处理,为提高测向精度和估角性能,利用酉变换算法将预处理得到的高阶累积量矩阵实数化。与模式空间算法相比上述方法降低了对阵元个数的需要,并且能够直接进行二维谱峰搜索。与经典多重信号分类算法(MUSIC)相比,在不增加特征值分解及谱峰搜索计算量的情况下,提高了算法的分辨力。按照给出的算法原理,通过仿真试验验证了所得的结论的正确性。At present,pre-processing should be done by using the pattern space algorithm when the unitary transformation is applied for the odd array element of uniform circular array.However,too many elements are needed in the pattern space algorithm.And only 1-dimensional search can be operated according to special elevation angle under the combination with unitary transformation.Aiming at the problem,the high-order cumulant algorithm is pro-posed to do preprocessing based on the array receiving data.And then the high-order cumulant matrix is realvalued using the unitary transformation algorithm.Compared with the pattern space algorithm,this method can decrease the demand to element number and can do 2-dimensional spectrum peak search.Compared with the classical MUSIC algorithm,the resolution is improved without increasing computation cost of eigenvalue-decomposition and spectrum peak search.The algorithm principle is given and the conclusion is verified using simulation experiments.
分 类 号:TN911.7[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.137.202.126