Rectangular universal iterative array

A rectangular universal iterative array consisting of cells having three inputs and one output is described. This array achieves the best known rate of increase in area.     

High-speed iterative array for binary multiplication

An iterative array for the multiplication of binary numbers and also the addition of either one or two other numbers is proposed, employing r.o.m.s. as lookup tables. The regularity of this array should make it attractive for l.s.i. fabrication.     

Fully iterative array for extracting square roots

A cellular array is proposed for extracting square roots. In contrast to an earlier proposal, both the cells and the interconnection of cells are identical.     

Binary division using a data-dependent iterative array

An iterative array is proposed which can be used to carry out binary division based on the principle of successive subtraction. The function of each cell of the array is dependent on the result of subtraction in the array.     

Fully iterative fast array for binary multiplication and addition

A fast combinational circuit is described which can be used both as a multiplier and as an adder, either separately or together, giving a parallel binary output. The structure, which is completely iterative in terms of both cell logic and cell-interconnection pattern, is advantageous in large-scale integration.     

阵列结构辐射与散射特性分析的迭代方法

给出一种适用于有限阵列结构辐射及特性分析的迭代方法。该法不受阵列单元排布形式、单元电流分布情况和单元数量的限制，对有限周期和非周期阵列的分析都有着较高的计算效率和稳定的收敛性。文中着重以有限周期及非周期带栅的散射分析为例，验证了方法的有效性，并同有限阵格林函数法和逐元法作了比较，给出了有关的数值计算结果。     

基于迭代FFT算法的平面阵列交错稀疏布阵方法

交错稀疏阵列天线的设计需要实现“稀疏布阵”和“子阵交错机制”两个关键技术的有机“协同”.提出一种基于改进迭代快速傅里叶变换(Fast Fourier Transformation, FFT)算法的均匀面阵交错稀疏布阵机制.鉴于均匀矩形平面阵列天线激励与方向图存在二维傅里叶变换的关系, 该方法通过对均匀面阵方向图采样的频谱能量分析, 采用交错选取子阵激励的方法, 实现了面阵天线方向图频谱能量的均匀分配, 获得了近似相同方向图的交错子阵设计.在此基础上, 采用迭代FFT算法对交错子阵激励进行迭代循环, 有效降低了交错子阵的峰值旁瓣电平.理论分析与实验仿真证明, 相对于基于循环差集和互补差集的稀疏交错优化方法, 该算法实现的交错稀疏阵列设计具有方向图近似程度更高, 且峰值旁瓣电平更低的优点.     

宽间距麦克风阵列迭代信噪比加权聚合角度谱方法研究

针对宽间距传声器阵列在混响环境下的多声源波达方向(DOA)估计问题,基于弥漫噪声模型研究了一种能有效抑制空间混叠影响的迭代信噪比加权聚合角度谱方法.该方法利用声源信号的时频稀疏和短时正交性,在每个时频点针对空间混叠周期的频变特点迭代消除各个真实声源在时频局域角度谱中的伪峰,从而在最终的聚合角度谱中有效抑制了空间混叠影响.在混响条件下针对不同声源数目进行了仿真实验,结果验证了所述方法的有效性.     

A knowledge-based test generator for standard cell and iterative array logic circuits

The use of Prolog for test generation is discussed and an implementation in Prolog of an automatic test generator, Protean, for stuck-at faults in scan-designed standard cell VLSI circuits and iterative logic arrays is described. Protean comprises a cell test generator, which generates test knowledge and propagation characteristics for cells, and a hierarchical test generator, which uses this high-level test knowledge in conjunction with low-level structural information to generate tests for the circuit.<>     

基于迭代FFT算法的平面稀疏阵列优化方法

提出了一种基于迭代FFT算法的优化方法来实现平面稀疏阵列的峰值旁瓣电平优化,并给出了详细的优化步骤.在给定的旁瓣约束条件下,利用阵列因子与阵元激励之间存在的傅里叶变换关系,对不同的初始随机阵元激励分别进行迭代循环,就可以降低稀疏阵列的旁瓣电平.在迭代过程中,根据稀疏率将阵元激励按幅度大小置1置0来完成阵列稀疏.仿真实验...     

General orthogonal sequences via a Routh-type stability array

It is shown that orthogonal functions are easily extracted from a Routh-type array widely used for testing the stability of discrete systems. As an application, computation of the optimal numerator of a reduced discrete model without inverting a Gram matrix is presented.<>     

曲面阵列结构散射与辐射特性的迭代分析

建立了一种适用于曲面有限阵列结构辐射与散射特性分析的迭代方法。首先根据阵列结构相同单元电流分布的相似性,对曲面有限阵列单元几何形状和表面电流分布作了两个假定,将有阵阵格林函数法推广应用于曲面有限阵列结构的分析;然后给出曲面有限阵列结构迭代分析的一般公式,通过迭代运算来消除两个假定近似的影响;最后迭代运算来消除两个假定近似的影响;最后以有两曲面带栅的散射和线源激励曲面带栅结构的辐射分析为例,验证了方法的有效性,并同逐元法作了比较,给出了有关的数值计算结果。结果表明：这种迭代法不受阵面曲率变化、单元数量和分布情况的限制,对有限周期和非周期阵列的分析都有着较高的计算效率和稳定性。     

通用的全帧型面阵CCD时序发生器设计方法

介绍了面阵CCD485的内部结构、工作模式,并给出了其基本驱动电路设计。然后通过对面CCD485驱动时序图的分析,分析了全帧型大面阵CCD 的正常工作、快速擦除、图像窗口输出和像元合并的驱动时序,提出了一种基于时序细分和有限状态机的通用型全帧型面阵CCD驱动时序发生器设计方法。该方法通过对CCD 驱动时序进行分组,将每一组时序的波形划分为若干个基本输出状态,这样CCD 各个工作阶段所需的驱动时序都可以由各基本状态组合出来,使用摩尔型有限状态机来描述,将时序驱动器进行了模块化设计。给出了各个模块的具体设计,使时序发生器的设计过程更加简单,最后采用Xilinx公司的Virtex-ⅡPro系列FPGA-XC2VP20、ISE软件平台,设计了CCD驱动时序发生器,并进行了波形仿真分析。输出信号完全满足485芯片的驱动时序要求,证明了该设计方法的有效性。     

General gate array routing using a k-terminal net routing algorithmwith failure prediction

A general approach to gate array routing based on an abstract routing space model is presented. An efficient k-terminal net maze runner is described. It does not partition nets into two-terminal net routing problems, but solves the problem by simultaneously growing k search waves. It is shown that the explored routing space diminishes when compared to bidirectional routing schemes. Experimental data show a reduction of CPU time up to 55% and a decrease of total net length up to 6% compared to a bidirectional maze router. For k-terminal nets it is shown that net length decreases with increasing k. Additional routing space restriction is attained by use of variable search space restriction and by the introduction of a dynamic routing space partitioning method based on the concept of regions. This concept allows for determination of nonroutable nets or parts of nets in an efficient way. The new partitioning method may be implemented in any maze runner without increasing the complexity of the maze runner algorithm. Results show an additional decrease of CPU time up to 35%     

General relations for a phased array of printed antennas derived from infinite current sheets

Simple and general relations characterizing the behavior of infinite phased arrays of printed antenna elements are derived from a model based on infinite current sheets. The Green's function of an electric current source on a grounded dielectric slab is used in various limiting forms to treat arrays in free space, arrays above a ground plane, arrays on a semi-infinite substrate, and arrays on a grounded dielectric slab. Current sheets are selected, using the orthogonality properties of the Floquet modes of the infinite array Green's function, to excite only a few specific low-order Floquet modes. Results from this idealized model, in the form of reflection coefficient magnitudes and input resistance, are compared with rigorous moment method solutions for specific elements (dipoles and microstrip patches). It is shown how the dominant scanning characteristics of a printed phased array, such as reflection coefficient and input resistance trends, scan blindnesses, and grating lobe effects, are dictated more by factors such as element spacing and substrate parameters than by the particular element type itself.     

High-speed iterative multiplier

An iterative array is proposed which reduces the multiplication of two binary numbers to one pass through the array and a summation of the outputs produced.     

Shuffled iterative decoding

Shuffled versions of iterative decoding of low-density parity-check codes and turbo codes are presented. The proposed schemes have about the same computational complexity as the standard versions, and converge faster. Simulations show that the new schedules offer better performance/complexity tradeoffs, especially when the maximum number of iterations has to remain small.     

Time-domain array factor for UWB antenna array

A cross-correlation formulation for the computation of time-domain array factor for ultra-wideband (UWB) antenna arrays is presented. In addition, a dual band UWB waveform is proposed for high directivity and high-resolution radar imaging. The dual band UWB waveform is based on a frequency truncated, Gaussian modulated, higher-order sinusoidal UWB pulse.     

Accelerated iterative hard thresholding

The iterative hard thresholding algorithm (IHT) is a powerful and versatile algorithm for compressed sensing and other sparse inverse problems. The standard IHT implementation faces several challenges when applied to practical problems. The step-size and sparsity parameters have to be chosen appropriately and, as IHT is based on a gradient descend strategy, convergence is only linear. Whilst the choice of the step-size can be done adaptively as suggested previously, this letter studies the use of acceleration methods to improve convergence speed. Based on recent suggestions in the literature, we show that a host of acceleration methods are also applicable to IHT. Importantly, we show that these modifications not only significantly increase the observed speed of the method, but also satisfy the same strong performance guarantees enjoyed by the original IHT method.     

交织多址与迭代多用户检测

介绍了一种新的多址方式IDMA，它采用不同的交织序列作为用户的标识特征。作为一种特殊的CDMA，IDMA继承了CDMA的很多优点，而且它以非常低的解码代价支持多用户，具有复杂度低、运算量小的特点。IDMA与迭代多用户检测技术相结合，在计算复杂度增加较少的情况下，有效提高了频谱利用率。