Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: 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. >
['Nicholas Kalouptsidis', 'Sergios Theodoridis']
I am writing a research paper on a idea Efficient structurally symmetric algorithms for least squares FIR filters with linear phase
[{"from": "human", "value": "I am writing a research paper on a idea Efficient structurally symmetric algorithms for least squares FIR filters with linear phase"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: 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. >"}]