On the robustness of several array processing algorithms /
Robustness in array signal processing has several different meanings. Most generally, it refers to algorithms with performance that is insensitive to incorrect assumptions. These assumptions can take different forms, leading to different notions of robustness. This dissertation consists of three...
| Main Author: | |
|---|---|
| Format: | Thesis Book |
| Language: | English |
| Published: |
[Place of publication not identified] :
[publisher not identified] ;
2000.
|
| Subjects: | |
| Online Access: | http://proxy.library.tamu.edu/login?url=http://proquest.umi.com/pqdweb?did=727853401&sid=1&Fmt=2&clientId=2945&RQT=309&VName=PQD |
| Summary: | Robustness in array signal processing has several different meanings. Most generally, it refers to algorithms with performance that is insensitive to incorrect assumptions. These assumptions can take different forms, leading to different notions of robustness. This dissertation consists of three studies of array signal processing algorithms, with respect to different notions of robustness. The first study is an investigation into the numerical robustness of a beamforming algorithm. Numerical robustness refers to the ability of an algorithm to perform well when implemented on finite-precision hardware. The second study analyzes the performance of a blind signal separation algorithm operating in a environment significantly different from that which it was designed for. The last study investigates the effect of a incorrect modeling of the probability density function of additive noise on an array processing signal detection algorithm. |
|---|---|
| Item Description: | Vita. "Major Subject: Electrical Engineering". |
| Physical Description: | x, 115 leaves : illustrations ; 28 cm. Issued also on microfiche from University Microfilm Inc. |
| Bibliography: | Includes bibliographical references (leaves 111-114). |