Linear Array Thinning Exploiting Almost Difference Sets
Linear Array Thinning Exploiting Almost Difference Sets
复制标题
DOI：
10.1109/tap.2009.2027243
复制
发表时间：
2009-12-01
影响因子：
5.7
通讯作者：
Massa, Andrea
中科院分区：
文献类型：
--
作者：
Oliveri, Giacomo;Donelli, Massimo;Massa, Andrea
本文描述了一类具有良好旁瓣的线性稀疏阵列。的元素的位置是基于几乎差集和阵列功率图案被迫通过均匀间隔的值，虽然既不等于也不恒定的差集，是先验已知的知识的孔径大小，有源阵列元件的数量，和相关函数的功能。这样一个属性允许一个预测的置信范围的界限的峰值旁瓣的容许阵列可通过简单的移位操作的二进制序列。预期的峰值旁瓣性能原来是可比的，从差集，即使在更广泛的阵列配置，并改善与切割和尝试随机布局相比。
This paper describes a class of linear thinned arrays with predictable and well-behaved sidelobes. The element placement is based on almost difference sets and the array power pattern is forced to pass through uniformly-spaced values that, although neither equal nor constant as for difference sets, are a-priori known from the knowledge of the aperture size, the number of active array elements, and the features of the correlation function. Such a property allows one to predict the bounds of the confidence range of the peak sidelobe of the admissible arrays obtainable through simple shift operations on a binary sequence. The expected peak sidelobe performances turn out to be comparable with those from difference sets, even though obtainable in a wider set of array configurations, and improved in comparison with cut-and-try random-placements.