Efficient structurally symmetric algorithms for least squares FIR filters with linear phase

Nicholas Kalouptsidis, Sergios TheodoridisIEEE Trans. Acoust. Speech Signal Process 1988 · DOI · OpenReview

Abstract

Two novel least-squares algorithms are derived for the computation of the FIR coefficients of multichannel filters with linear (affine) phase. One is for block processing and requires 2 Np+4.25 p/sup 2/ additions and 2 Np+3p/sup 2/ multiplications, with N being the number of input data samples and p the order of the filter. The second algorithm computes the linear (affine) phase filter's coefficients in an adaptive manner with a computational complexity of 8.5 p additions and 6.5 p multiplications per time recursion. Thus, a reduction in computational complexity of the order of 40-50% is obtained compared to previously derived algorithms. A Fortran subroutine is presented for the time recursive algorithm.<
BibTeX
@article{kalouptsidis1988efficient,
  author = {Nicholas Kalouptsidis and Sergios Theodoridis},
  title = {{Efficient structurally symmetric algorithms for least squares FIR filters with linear phase}},
  journal = {IEEE Trans. Acoust. Speech Signal Process.},
  year = {1988},
  doi = {10.1109/29.90374},
}

Loading related content...

Figure