Space-time adaptive processing on the Mesh Synchronous Processor

Author

McMahon, Janice S. ; Teitelbaum, Ken

Author_Institution

Lincoln Lab., MIT, Lexington, MA, USA

fYear

1996

fDate

15-19 Apr 1996

Firstpage

734

Lastpage

740

Abstract

This paper presents an assessment of the applicability of the Mesh Synchronous Processor (MeshSP) architecture to a class of radar signal processing algorithms known as space-time adaptive processing (STAP). The MeshSP is a SIMD processor developed at MIT Lincoln Laboratory and marketed by Integrated Computing Engines, Inc. A high-level overview of the MeshSP architecture is presented. Mappings of a matrix decomposition algorithm to the MeshSP architecture are described. A performance model for estimating computation and communication latencies for the Householder algorithm on the MeshSP using different mapping approaches is presented. Results of the performance model are discussed

Keywords

adaptive radar; computational complexity; matrix decomposition; parallel algorithms; parallel architectures; parallel machines; performance evaluation; radar computing; radar signal processing; telecommunication computing; Householder algorithm; Integrated Computing Engines; MIT; Mesh Synchronous Processor; MeshSP; SIMD processor; STAP; communication latency; computation latency; mapping approaches; matrix decomposition algorithm; performance model; radar signal processing; space-time adaptive processing; Adaptive arrays; Array signal processing; Clutter; Computational modeling; Computer architecture; Covariance matrix; Delay; Engines; Laboratories; Matrix decomposition; Radar signal processing; Signal processing algorithms;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel Processing Symposium, 1996., Proceedings of IPPS '96, The 10th International

Conference_Location

Honolulu, HI

Print_ISBN

0-8186-7255-2

Type

conf

DOI

10.1109/IPPS.1996.508140

Filename

508140