检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]中国科学院研究生院,北京100049 [2]中国科学院空间科学与应用研究中心,北京100080
出 处:《计算机仿真》2007年第10期103-106,共4页Computer Simulation
摘 要:提出一种基于时域抽样法的近远场变换算法以改善经典时域近远场变换算法计算量大、计算速度慢的缺点。时域抽样法是基于这样一个事实:在时域近远场变换过程中不需要与时域有限差分计算同样的时间精度。在近远场变换前先对时域近场数据进行采样以减少数据的冗余,然后用改进后的算法进行近远场变换计算从而达到减少数据量、提高计算速度的目的。为验证本算法,以计算七元八木天线远场方向图为例进行算法说明,并与经典时域法进行比较,结果表明本算法在保证与经典法具有同样精度的前提下,减少了90%数据存储空间,同时提高计算速度80%。应用本算法可以为天线仿真优化设计、雷达散射截面(RCS)计算等提供一种快速的时域计算方法。A new algorithm: FDTD near-to far-field transform is proposed based on time-domain sampling to improve the classical time-domain near-to far-field calculation which consumes too much memory and CPU times.The new algorithm based on a fact of that it doesn't need such a fine time interval in time-domain near-to farfield calculation as finite-difference time-domain calculation.In order to reduce the memory storage and save the CPU time,first sampling the time-domain near-field data to reduce the data redundancy before the near-to far-field calculation,and using the improved algorithm to calculate the far-field pattern.To verify this algorithm,the new algorithm is compared with the classical method by calculating the far-field pattern of 7-element Yagi-Uda antenna,the result shows that the new algorithm has the same accuracy as the classical method,at the same time it can reduce the memory storage by 90% and save the CPU time by 80%.It will be a fast time-domain method in antenna optimization and radar cross section(RCS) calculation.
分 类 号:TP391.9[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.3