On the performance of several 2-D harmonic retrieval techniques

Author

Pepin, Matthew P. ; Clark, Michael P.

Author_Institution

Air Force Inst. of Technol., Wright-Patterson AFB, OH, USA

Volume

1

fYear

1994

fDate

31 Oct-2 Nov 1994

Firstpage

254

Abstract

The paper investigates the performance of 2-D harmonic retrieval techniques based on two criteria: computational complexity and mean-squared estimation error. Computational complexity is described in terms of order of computation and FLOPS required for an example test case. Mean-square estimation performance is measured for this test case and compared with the Cramer-Rao bound. Each technique is assigned a point in a Cartesian coordinate system with axes corresponding to computation and estimation error

Keywords

computational complexity; harmonic analysis; least mean squares methods; signal detection; 2-D harmonic retrieval techniques; Cramer-Rao bound; computational complexity; estimation error; mean-square estimation; mean-squared estimation error; order of computation; performance; Computational complexity; Equations; Estimation error; Least squares approximation; Maximum likelihood estimation; Military computing; Prediction methods; Sensor arrays; State-space methods; Testing;

fLanguage

English

Publisher

ieee

Conference_Titel

Signals, Systems and Computers, 1994. 1994 Conference Record of the Twenty-Eighth Asilomar Conference on

Conference_Location

Pacific Grove, CA

ISSN

1058-6393

Print_ISBN

0-8186-6405-3

Type

conf

DOI

10.1109/ACSSC.1994.471455

Filename

471455