On the Correlation between the Noise and a Priori Error Vectors in Affine Projection Algorithms
This paper analyzes the correlation matrix between the a priori error and measurement noise vectors for affine projection algorithms (APA). This correlation stems from the dependence between the filter tap estimates and the noise samples, and has a strong influence on the mean square behavior of the algorithm. We show that the correlation matrix is upper triangular, and compute the diagonal elements in closed form, showing that they are independent of the input process statistics. Also, for white inputs we show that the matrix is fully diagonal. These results are valid in the transient and steady states of the algorithm considering a possibly variable step-size. Our only assumption is that the filter order is large compared to the projection order of APA and we make no assumptions on the input signal except for stationarity. Using these results, we perform a steady-state analysis of the algorithm for small step size and provide a new simple closed-form expression for mean-square error, which has comparable or better accuracy to many preexisting expressions, and is much simpler to compute. Finally, we also obtain expressions for the steady-state energy of the other components of the error vector.
Code (0)
등록된 구현이 없습니다.
Tasks
validSimilar Papers 제목 키워드 기반
SVT-AV1 Encoding Bitrate Estimation Using Motion Search Information
Enabling high compression efficiency while keeping encoding energy consumption at a low level, requires prioritization of which videos need more sophisticated encoding techniques. However, the effects vary highly based o…
Cross-validation of matching correlation analysis by resampling matching weights
The strength of association between a pair of data vectors is represented by a nonnegative real number, called matching weight. For dimensionality reduction, we consider a linear transformation of data vectors, and defin…
Dimensionality ReductionGraph EmbeddingA Robust Matching Pursuit Algorithm Using Information Theoretic Learning
Current orthogonal matching pursuit (OMP) algorithms calculate the correlation between two vectors using the inner product operation and minimize the mean square error, which are both suboptimal when there are non-Gaussi…
Image ReconstructionMatrix Denoising with Doubly Heteroscedastic Noise: Fundamental Limits and Optimal Spectral Methods
We study the matrix denoising problem of estimating the singular vectors of a rank-$1$ signal corrupted by noise with both column and row correlations. Existing works are either unable to pinpoint the exact asymptotic es…
DenoisingSignal and Noise Statistics Oblivious Orthogonal Matching Pursuit
Orthogonal matching pursuit (OMP) is a widely used algorithm for recovering sparse high dimensional vectors in linear regression models. The optimal performance of OMP requires \textit{a priori} knowledge of either the s…
regression