Remarks on the convolution algorithm of Agarwal and Cooley

Access Full Text

Remarks on the convolution algorithm of Agarwal and Cooley

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

The algorithm of the title naturally computes cyclic convolutions. We discuss some ways in which it can be applied to noncyclic convolutions as required for digital filters; we can sometimes obtain a significant improvement in efficiency over the well-known ‘overlap-add’ method.

Inspec keywords: transforms; digital filters; signal processing

Other keywords: convolution algorithm; cyclic convolutions; digital filters; overlap add method; noncyclic convolutions

Subjects: Integral transforms; Digital filters; Information theory; Digital filters; Signal processing and detection; Integral transforms

References

    1. 1)
      • J.H. McClelland , C.M. Rader . (1970) , Number theory in digital signal processing.
    2. 2)
      • R.C Agarwal , J.W. Cooley . New algorithms for digital convolution. IEEE Trans. , 392 - 410
    3. 3)
      • S. Winograd . On computing the discrete Fourier transform. Math. Comput , 175 - 199
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19790426
Loading

Related content

content/journals/10.1049/el_19790426
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading