Cart (Loading....) | Create Account
Close category search window
 

Convolution algorithms for small-word-length digital-filtering applications

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Sridhar Reddy, N. ; Indian Institute of Technology, Radar and Communication Centre, Kharagpur, India ; Umapathi reddy, V.

Implementation of rectangular transforms (r.t.) in modular arithmetic and computation of number theoretic transforms through Winograd's algorithm are discussed. The computational effort of various algorithms to implement real convolution is investigated. Considering the signal/noise ratio performance and hardware complexity, it is shown that the r.t.s are best suited for digital-filtering applications with word lengths less than about 16 bits. Finally, r.t.s are shown to be the most amenable to the application of the Chinese remainder theorem for increasing the dynamic range

Published in:

Electronic Circuits and Systems, IEE Journal on  (Volume:3 ,  Issue: 6 )

Date of Publication:

November 1979

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.