Abstract
A discrete filtering technique based on circular convolution is presented. The discrete Hilbert transform (DHT), in matrix form and other matrices for filtering by circular convolution, is shown to compare favorably with DFT and FFT filtering. The comparison is presented in terms of error accumulation.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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 call
