Abstract
It has been shown that recursive digital filters can be synthesized using the fast Fourier transform. An algorithm for computer implementation has been developed and used in comparing the computation times and noise figures of filters synthesized in this manner with the computation times and noise figures of filters synthesized by recursion. A model has been proposed for analysis of noise in the two-pole filter. Predictions of this model have been found to be in good agreement with noise measurements.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
