首页> 外文会议>European Conference on Antennas and Propagation >Reducing Elements in Linear Antenna Array Using Levenberg-Marquardt Algorithm
【24h】

Reducing Elements in Linear Antenna Array Using Levenberg-Marquardt Algorithm

机译:使用Levenberg-Marquardt算法减少线性天线阵列中的元素

获取原文

摘要

Design of a non-uniform antenna array with reduced number of elements may be required for some applications. This paper introduces an iterative procedure, which is based on the Levenberg-Marquardt Algorithm (LMA), for reducing the number of elements in a linear array. By applying small perturbations on a given configuration, the algorithm finds the gradient that makes the total square error to be minimal, and then tests the new point in this direction until it converges to an optimal positions, amplitudes and phase, of array elements, regarding array factor requirements. Sensitivity of the resulted design to amplitude and frequency errors is examined. Simulation CST results of the theoretical design is also carried out, demonstrating the accuracy of the algorithm.
机译:对于某些应用,可能需要设计元素数量减少的非均匀天线阵列。本文介绍了一种基于Levenberg-Marquardt算法(LMA)的迭代过程,用于减少线性数组中的元素数量。通过在给定的配置上施加较小的扰动,该算法找到使总平方误差最小的梯度,然后测试该方向上的新点,直到收敛到阵列元素的最佳位置,幅度和相位为止,数组因子要求。检查了所得设计对幅度和频率误差的敏感性。还进行了理论设计的CST仿真结果,证明了算法的准确性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号