Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Digital filtering using polynomial transforms

Digital filtering using polynomial transforms

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

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

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 Institution of Electrical Engineers
Published

We define discrete transforms in a ring of polynomials. These polynomial transforms have the circular convolution property and can be used for the fast computation of 2-dimensional cyclic convolutions. This yields efficient algorithms for the implementation of 1- and 2-dimensional digital filters.

Inspec keywords: digital filters; transforms

Other keywords: digital filters; circular convolution property; polynomial transforms

Subjects: Digital filters; Digital filters; Signal processing and detection

References

    1. 1)
      • H.J. Nussbaumer . Digital filtering using complex Mersenne transforms. IBM J. Res. & Der. , 498 - 504
    2. 2)
      • Winograd, S.: `The effect of the field of constants on the number ol multiplications', Proceedings of 16th symposium of Found. Comput. Science, 1975, p. 1–2.
    3. 3)
      • T. Nagell . (1964) , Introduction to number theory.
    4. 4)
      • R.C. Agarwal , C.S. Burrus . Fast one-dimensional digital convolution by multidimensional techniques. IEEE Trans. , 1 - 10
    5. 5)
      • S. Winograd . On computing the discrete Fourier transform. Proc. Nat. Acad. Sci. USA , 1005 - 1006
    6. 6)
      • J.M. Pollard . The fast Fourier transform in a finite field. Math. Comput. , 365 - 374
    7. 7)
      • C.M. Rader . Discrete convolution via Mersenne transforms. IEEE Trans. , 1269 - 1273
    8. 8)
      • R.C. Agarwal , C.S. Burrus . Number theoretic transforms to implement fast digital convolution. Proc. IEEE , 550 - 560
    9. 9)
      • J.W. Cooley , J.W. Tukey . An algorithm for machine calculation of complex Fourier series. Math. Comput. , 297 - 301
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19770280
Loading

Related content

content/journals/10.1049/el_19770280
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
Print this page
This is a required field
Please enter a valid email address