检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:窦慧晶 郭威 谢东旭 郭宏亮 DOU Huijing;GUO Wei;XIE Dongxu;GUO Hongliang(Faculty of Information Technology,Beijing University of Technology,Beijing 100124,China)
出 处:《北京工业大学学报》2024年第9期1061-1068,共8页Journal of Beijing University of Technology
基 金:国家自然科学基金资助项目(61171137);北京市教育委员会科研发展计划资助项目(KM201210005001)。
摘 要:针对四阶累积量在多重信号分类(multiple signal classification, MUSIC)算法中计算复杂度高和在低信噪比情况下性能差的问题,提出一种去冗余后平均的四阶累积量传播算子算法(modified fourth-order cumulant propagator method, MFOC-PM)。该算法通过引入传播算子算法线性地获得噪声子空间,避免了特征值分解造成的计算量,然后在保持四阶累积量阵列孔径扩展和抑制高斯噪声的优势下,通过求平均后去除的方法将四阶累积量中冗余的部分去除,降低了算法的复杂度。实验结果表明,所提算法显著减少了算法的计算量,可以实现角度的精确估计,在低信噪比的情况下表现良好,具有较好的实用价值。Aiming at the problem that the fourth-order cumulant has high computational complexity in multiple signal classification(MUSIC)and poor performance under low signal-to-noise ratio conditions,a modified fourth-order cumulant propagator method(MFOC-PM)was proposed.By introducing the propagation operator algorithm to obtain the noise subspace linearly,the algorithm avoided the computation caused by eigenvalue decomposition.To maintain the advantage of the aperture expansion of the fourth-order cumulant array and suppress Gaussian noise,the redundant part of the fourth-order cumulant was removed by the method of averaging and then removing.The experimental results demonstrate that the effectiveness and feasibility of the proposed MFOC-PM algorithm,which significantly reduces the computational complexity of the algorithm.Specifically,it achieves accurate angle estimation and performs well under low signal-to-noise ratio conditions.This indicates that the algorithm has significant practical value and can meet the requirements of DOA estimation in many practical application scenarios.
关 键 词:DOA估计 传播算子算法 四阶累积量 去冗余 阵列信号处理 阵列扩展
分 类 号:TN911[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.33