检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]吉林师范大学信息技术学院 [2]哈尔滨工程大学水声技术国防科技重点实验室 [3]海军92330部队
出 处:《计算机应用研究》2012年第2期514-517,共4页Application Research of Computers
基 金:国家自然科学基金资助项目(51009042);高等学校博士学科点专项科研基金资助项目(20102304120030);黑龙江省自然科学基金资助项目(E201024)
摘 要:为了达到有效缩短算法运行时间、加快定位速度的目的,研究并分析了匹配场声源定位算法中存在的固有并行性,构建了匹配场声源定位的并行计算算法框架。详细介绍了匹配场声源定位算法的网格法并行化方法;并以互连的双核PC机作为并行计算硬件平台,选用Windows操作系统、FORTRAN编译器,使用TCP/IP作为标准的通信协议,在MPI并行环境中对并行算法进行了测试和相应分析。研究表明,提出的并行算法运行效果较好,可以通过开发匹配场处理方法的并行性,有效解决信号匹配处理中遇到的计算量大、耗时长等问题,为实现快速声源定位提供解决途径。Through studying and analyzing the inherent parallelism which existed in algorithm of the match field sound source localization,frame of parallel computing algorithm had constructed in the match field localization in order to shorten the running time and accelerate the speed of localization algorithm effectively.Parallelization grid method was introduced in detail,which was applied to the match field localization algorithm.And parallel algorithm had been carried on the test and the corresponding analysis in the MPI parallel environment,in the way of interconnecting binuclear PC machines as the parallel computing hardware platform through fast internet,choosing Windows operate system and FORTRAN compiler,and using TCP/IP as the standard communication protocols.The study shows the proposed parallel algorithm running results are better,so questions of the load big computation and long time-consuming etc.can be settled effectively to exploiting parallelization in matched field processing methods,in order to provide settle path for fast sound source localization.
分 类 号:TP31[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222