Phase interpolation circuits for scanning phased arrays
Phase interpolation circuits for scanning phased arrays
SEARCH · Engineering Papers
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Phase interpolation circuits for scanning phased arrays
Subroutine for interpolation of data tables on solar continuous absorption coefficient
Phase interpolation circuits for scanning phased array antennas, using doublers and frequency multipliers
Algorithms based on Newton formula for polynomial interpolation and numerical differentiation
Alouette 2 ionograms frequency interpolation correction allowing measurement accuracy comparable to sounder system resolution
Errors resulting from linear interpolation use in opacity tables for stellar interior calculations
Using only a one-dimensional subscripted variable, a FORTRAN computer subprogram was developed to linearly interpolate tabulated data of functions of four or less variables. The primary motivation was for faster computation.
Values of band oscillator strengths and rotational line widths for the Schumann-Runge band system have been used to derive interpolation constants from which the transmittance and rate of dissociation of molecular oxygen can be calculated. These constants, valid for temperatures between 150 and 300 K and for column densities between 1 x 10 to the 17th power/cm sq and 7 x 10 to the 24th power/cm sq, cover the wavelength range 1750 and 2050A.
A surface spline is a mathematical tool for interpolating a function of two variables. It is based upon the small deflection equation of an infinite plate. The surface spline depends upon the solution of a system of linear equations, and thus, will ordinarily require the use of a digital computer. The closed form solution involves no functions more complicated than logarithms, and is easily coded. Several modifications which can be incorporated are discussed.
The set of programs described has been used for rapidly introducing, checking out and very efficiently using aerodynamic tables in complex aircraft simulations on the IBM 360. The preprocessor program reads in tables with different names and dimensions and stores then on disc storage according to the specified dimensions. The tables are read in from IBM cards in a format which is convenient to reduce the data from the original graphs. During table processing, new auxiliary tables are generated which are required for table cataloging and for efficient interpolation. In addition, DIMENSION statements for the tables as well as READ statements are punched so that they may be used in other programs for readout of the data from disc without chance of programming errors. A quick data checking graphical output for all tables is provided in a separate program.
A method is presented, based on linear interpolation, for detecting and correcting bad data points in a set of data without contaminating the good data points. The method used is not concerned with the small random errors usually attributed to a noisy system. It assumes that the data points which are in error are relatively isolated from each other and that the number of such points is small compared to the total number of data points.
Optimal solid-rocket thrust profiles for the parallel-burn, solid-rocket-assisted space shuttle are investigated. Solid-rocket thrust profiles are simulated by using third-degree spline functions, with the values of the thrust ordinates defined as parameters. The profiles are optimized parametrically, using the Davidon-Fletcher-Powell penalty function method, by minimizing propellant weight subject to state and control inequality constraints and to terminal boundary conditions. This study shows that optimizing a control variable parametrically by using third-degree spline function interpolation allows the control to be shaped so that inequality constraints are strictly adhered to and all corners are eliminated. The absence of corners, which is realistic in nature, makes this method attractive from the viewpoint of solid rocket grain design.
The present work discusses the generation of the cubic-spline interpolator in numerical optimization methods which use a variable-step integrator with step size control based on local relative truncation error. An algorithm for generating the cubic spline with successive over-relaxation is presented which represents an improvement over that given by Ralston and Wilf (1967). Rewriting the code reduces the number of N-vectors from eight to one. The algorithm is formulated in such a way that the solution of the linear system set up yields the first derivatives at the nodal points. This method is as accurate as other schemes but requires the minimum amount of storage.
A tabulation of selected altitude-correlated values of pressure, density, speed of sound, and coefficient of viscosity for each of six models of the atmosphere is presented in block data format. Interpolation for the desired atmospheric parameters is performed by using cubic spline functions. The recursive relations necessary to compute the cubic spline function coefficients are derived and implemented in subroutine form. Three companion subprograms, which form the preprocessor and processor, are also presented. These subprograms, together with the data element, compose the spline fit atmosphere package. Detailed FLOWGM flow charts and FORTRAN listings of the atmosphere package are presented in the appendix.
Those who design piloted aircraft simulations must contend with the finite size and speed of the available digital computer and the requirement for simulation reality. With a fixed computational plant, the more complex the model, the more computing cycle time is required. While increasing the cycle time may not degrade the fidelity of the simulated aircraft dynamics, the larger steps in the pilot cue feedback variables (such as the visual scene cues), may be disconcerting to the pilot. The first-order-hold interpolation (FOHI) digital-to-analog converter (DAC) is presented as a device which offers smooth output, regardless of cycle time. The Laplace transforms of these three conversion types are developed and their frequency response characteristics and output smoothness are compared. The FOHI DAC exhibits a pure one-cycle delay. Whenever the FOHI DAC input comes from a second-order (or higher) system, a simple computer software technique can be used to compensate for the DAC phase lag. When so compensated, the FOHI DAC has (1) an output signal that is very smooth, (2) a flat frequency response in frequency ranges of interest, and (3) no phase error. When the input comes from a first-order system, software compensation may cause the FOHI DAC to perform as an FOHE DAC, which, although its output is not as smooth as that of the FOHI DAC, has a smoother output than that of the ZOH DAC.
The problem of mathematically defining a smooth surface, passing through a finite set of given points is studied. Literature relating to the problem is briefly reviewed. An algorithm is described that first constructs a triangular grid in the (x,y) domain, and first partial derivatives at the modal points are estimated. Interpolation in the triangular cells using a method that gives C sup.1 continuity overall is examined. Performance of software implementing the algorithm is discussed. Theoretical results are presented that provide valuable guidance in the development of algorithms for constructing triangular grids.
A report on the computer routine INTERP3 is presented. The routine is designed to linearly interpolate a variable which is a function of three independent variables. The variables within the parameter arrays do not have to be distinct, or equally spaced, and the array variables can be in increasing or decreasing order.
Higher-order collocation procedures resulting in tridiagonal matrix systems are derived from polynomial spline interpolation and by Hermitian (Taylor series) finite-difference discretization. The similarities and special features of these different developments are discussed. The governing systems apply for both uniform and variable meshes. Hybrid schemes resulting from two different polynomial approximations for the first and second derivatives lead to a nonuniform mesh extension of the so-called compact or Pad? difference technique (Hermite 4). A variety of fourth-order methods are described and the Hermitian approach is extended to sixth-order (Hermite 6). The appropriate spline boundary conditions are derived for all procedures. For central finite differences, this leads to a two-point, second-order accurate generalization of the commonly used three-point end-difference formula. Solutions with several spline and Hermite procedures are presented for the boundary layer equations, with and without mass transfer, and for the incompressible viscous flow in a driven cavity. Divergence and nondivergence equations are considered for the cavity. Among the fourth-order techniques, it is shown that spline 4 has the smallest truncation error. The spline 4 procedure generally requires one-quarter the number of mesh points in a given coordinate direction as a central finite-difference calculation of equal accuracy. The Hermite 6 procedure leads to remarkably accurate boundary layer solutions.