Accession Number : ADA298992

Title :   An Analysis of Gauss Elimination for Adaptive Beamforming.

Descriptive Note : Final rept.,

Corporate Author : NAVAL AIR WARFARE CENTER AIRCRAFT DIV WARMINSTER PA

Personal Author(s) : Turner, Peter R. ; Kirsch, Barry J.

PDF Url : ADA298992

Report Date : 09 AUG 1994

Pagination or Media Count : 30

Abstract : There are many formulations of the Adaptive Beamforming (ABF) problem. We are motivated to use an algorithm that uses the least number of divisions or square root operations, since these operations are very expensive in time or chip area. One method solves the solution of a Hermitian matrix. The Gauss Elimination (GE) algorithm has no square roots. In this paper, we analyze dynamic range requirements and precision analysis for an integer processor implementation of GE (as opposed to fixed point or floating point), to solve the ABF problem. This analysis differs from the standard Wilkinson analysis which is based on fixed point arithmetic, where the multiplier is formed once per row, whereas the integer formulation requires that we perform explicit divisions on each element of the reduced matrix. We present formulas to determine input quantization, storage wordlengths and accumulator wordlengths for a desired weight precision.

Descriptors :   *BEAM FORMING, *ADAPTIVE SYSTEMS, ALGORITHMS, INPUT, CHIPS(ELECTRONICS), PROCESSING EQUIPMENT, PRECISION, QUANTIZATION, FLOATING POINT OPERATION, DYNAMIC RANGE, SQUARE ROOTS.

Subject Categories : Radiofrequency Wave Propagation

Distribution Statement : APPROVED FOR PUBLIC RELEASE