In Situ Optimal Reshading of Arrays with Failed Elements

Abstract

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 one and two minutes on a HP9836C microcomputer.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 14, 1986
Accession Number
ADA631357

Entities

People

  • Michael S. Sherrill
  • Roy L. Streit

Organizations

  • Naval Facilities Engineering Systems Command

Tags

Communities of Interest

  • Materials and Manufacturing Processes
  • Sensors

DTIC Thesaurus Topics

  • Algorithms
  • Arrays
  • Complex Numbers
  • Computations
  • Computer Programming
  • Computers
  • Contracts
  • Geometry
  • Intervals
  • Iterations
  • Linear Arrays
  • Linear Programming
  • Operating Systems
  • Optimization
  • Personal Computers
  • Sidelobes
  • Simplex Method

Fields of Study

  • Engineering

Readers

  • Cardiovascular Physiology
  • Phased Array Antenna Design.
  • Software Engineering.