http://iet.metastore.ingenta.com
1887

Computational efficiency of number-theoretic-transform-implemented finite-impulse-response filters

Computational efficiency of number-theoretic-transform-implemented finite-impulse-response filters

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

Buy article PDF
$19.95
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.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 computational merits of using number-theoretic transforms to spectrally implement f.i.r. filters are discussed. It is demonstrated for all but low-tap filters that the spectral method can significantly reduce the multiply load and modestly reduce the add load by comparison with the usual time-domain method and the recursive ‘moving-window’ finite-field spectral method.

References

    1. 1)
      • R.C. Agarwal , C.S. Burrus . Number theoretic transforms to implement fast digital convolution. Proc. IEEE , 550 - 560
    2. 2)
      • L.R. Rabiner . Techniques for designing finite-duration impulse response digital filters. IEEE Trans. , 188 - 195
    3. 3)
      • H. Murakami , I.S. Reed . Recursive realization of finite impulse filters using finite field arithmetic. IEEE Trans. , 232 - 242
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19780495
Loading

Related content

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