检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李引凡[1]
机构地区:[1]重庆通信学院信息工程系,重庆沙坪坝400035
出 处:《重庆文理学院学报(社会科学版)》2014年第5期53-57,共5页Journal of Chongqing University of Arts and Sciences(Social Sciences Edition)
摘 要:介绍了天线调谐器阻抗匹配网络的结构和调谐的本质,提出采用基于启发式算法的邻域搜索算法来解决这一个NP-hard问题;给出了基于固定步长的最近邻域搜索算法的迭代步骤,通过对邻域结构和搜索方式的改进,降低了搜索空间、加快了调谐速度;最后采用基于最近邻域搜索的4种算法对10 m短波鞭状天线进行匹配仿真,验证了改进算法的有效性.The structure of impedance matching network and the essence of tuning algorithm in antenna tuner are introduced,and the heuristic algorithm called neighbor searching algorithm is proposed to solve the NP-hard problem. Then the iteration steps of nearest neighbor searching algorithm with fixed step size is described in detail which are applied to antenna tuner,and the algorithm is improved by different neighbor structures and searching patterns,so the searching space is reduced and the tuning speed is accelerated. At last four tuning algorithms based on nearest neighbor searching are simulated with a 10 m HF whip antenna and the validity of the improved algorithm is certified.
分 类 号:TN820.8[电子电信—信息与通信工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117