RADIATION OF A POINT CHARGE MOVING UNIFORMLY OVER AN INFINITE ARRAY OF CONDUCTING HALF-PLANES.

Abstract

The problem of the excitation of an infinite array of parallel, semi-infinite metallic plates by a uniformly moving point charge is studied by the Wiener-Hopf method. It is treated as a boundary value problem for the potentials of the diffracted electromagnetic fields. The formulation of this problem makes use of the well-known conditions on the electromagnetic fields at a metallic boundary. A method is used to translate these boundary conditions on the fields into boundary conditions on the potentials. In this way the problem is formulated in terms of a set of dual integral equations for the current densities induced on the plates by the point charge. These integral equations are exactly soluble by the Wiener-Hopf technique. The solutions are found to satisfy the famous edge conditions for diffraction problems, and are therefore unique. From these solutions exact expressions for the diffracted fields are derived in the form of Fourier integrals. It is seen that these fields represent a radiation of electromagnetic energy. The method of steepest descent is then used to obtain expressions for the radiation fields, the Poynting vector, the frequency spectrum and the radiation pattern. The radiation shows that the array of plates behaves both like a diffraction grating and a series of parallel-plate waveguides. (Author)

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1966
Accession Number
AD0640819

Entities

People

  • John Lam

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Boundaries
  • Boundary Value Problems
  • Current Density
  • Diffraction
  • Electromagnetic Fields
  • Electromagnetic Radiation
  • Equations
  • Gratings (Spectra)
  • Integral Equations
  • Integrals
  • Radiation
  • Radiation Patterns
  • Spectra

Fields of Study

  • Physics

Readers

  • Electromagnetic Wave Scattering and Antenna Radiation Engineering
  • Graph Algorithms and Convex Optimization.