Improved computing-efficiency least-squares algorithm with application to all-pass filter design (Q460114)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Improved computing-efficiency least-squares algorithm with application to all-pass filter design |
scientific article; zbMATH DE number 6354371
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved computing-efficiency least-squares algorithm with application to all-pass filter design |
scientific article; zbMATH DE number 6354371 |
Statements
Improved computing-efficiency least-squares algorithm with application to all-pass filter design (English)
0 references
13 October 2014
0 references
Summary: All-pass filter design can be generally achieved by solving a system of linear equations. The associated matrices involved in the set of linear equations can be further formulated as a Toeplitz-plus-Hankel form such that a matrix inversion is avoided. Consequently, the optimal filter coefficients can be solved by using computationally efficient Levinson algorithms or Cholesky decomposition technique. In this paper, based on trigonometric identities and sampling the frequency band of interest uniformly, the authors proposed closed-form expressions to compute the elements of the Toeplitz-plus-Hankel matrix required in the least-squares design of IIR all-pass filters. Simulation results confirm that the proposed method achieves good performance as well as effectiveness.
0 references
0.777576744556427
0 references
0.7527031302452087
0 references
0.7475875020027161
0 references
0.7449219822883606
0 references