Abstract
Fast algorithms exist for computing cyclic convolutions. To obtain the linear convolution required for an FIR filter, the data records must be overlapped by at least L - 1 points, where L is the length of the filter impulse response. If the overlap is too small, wraparound error occurs. This error transforms a linear time-invariant filter into a periodic time-varying filter, whose output is periodically nonstationary for a wide-sense stationary input. The first part of this paper contains a review of the frequency domain theory of periodic filters and processes, in the second part of the paper the theory is applied to the specific periodic filter that results from wraparound error in fast convolution algorithms.
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 callMore From: IEEE Transactions on Acoustics, Speech, and Signal Processing
Disclaimer: 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.
