论文信息 - In Situ Optimal Reshading of Arrays With Failed Elements

In Situ Optimal Reshading of Arrays With Failed Elements

An algorithm is presented which computes optimal weights for arbitrary linear arrays. The application of this algorithm to in situ optimal reshading of arrays with failed elements is discussed. It is shown that optimal reshading can often regain the original sidelobe level by slightly increasing the mainlobe beamwidth. Three examples are presented to illustrate the algorithm's effectiveness. Hardware and software issues are discussed. Execution time for a 25-element array is typically between 1 and 2 min on an HP9836C microcomputer.

R. L. Streit | M. S. Sherrill | R. Streit | M. Sherrill

[1] Real excitation coefficients suffice for sidelobe control in a linear array , 1982 .

[2] A. H. Nuttall,et al. A general Chebyshev complex function approximation procedure and an application to beamforming , 1982 .

[3] R. Streit. Solution of systems of complex linear equations in the l ∞ 0E norm with constraints on the unknowns , 1986 .

[4] Ian Barrodale,et al. Algorithm 495: Solution of an Overdetermined System of Linear Equations in the Chebychev Norm [F4] , 1975, TOMS.

[5] Roy L. Streit,et al. ALGORITHM 635: an algorithm for the solution of systems of complex linear equations in the L∞ norm with constraints on the unknowns , 1985, TOMS.