학술논문

An Efficient Dimensional Reduction of the Blocking Matrix for the Multistage Wiener Filter
Document Type
Conference
Source
2007 Conference Record of the Forty-First Asilomar Conference on Signals, Systems and Computers Signals, Systems and Computers, 2007. ACSSC 2007. Conference Record of the Forty-First Asilomar Conference on. :592-596 Nov, 2007
Subject
Signal Processing and Analysis
Computing and Processing
Wiener filter
Matrix decomposition
Degradation
Signal processing algorithms
Computational modeling
Sensor systems
Systems engineering and theory
Power engineering and energy
Signal processing
Adaptive algorithm
Language
ISSN
1058-6393
Abstract
The multistage Wiener filter (MWF) is a powerful adaptive processing in low sample support environments. Because the MWF solution is provided by a stage-by-stage decomposition, the computational load increases depending on degrees-of-freedom (DOF). In this paper, we propose two efficient approaches by reducing dimensions of the blocking matrix. One approach is to delete some rows of the blocking matrix at the 1st stage, and following stages are calculated by the normal method. The second approach is to delete some rows at all stages consistently. Although the MWF adaptive process of the proposed approaches must be stopped at the optimum stage to avoid a performance degradation, it was solved by applying a simple stopping criterion based on a cross-correlation coefficient. The performance was evaluated by simulation examples, examining the effectiveness.