Fast Digital Convolution by Polynomial Transforms
Original Publication Date: 1980-Jul-01
Included in the Prior Art Database: 2005-Feb-13
In this paper, we introduce an efficient method for the computation of one-dimensional circular convolutions. We consider the length-N circular convolution y(l) of two length-N sequences x(m) and h(n), with N = 2(t) and (see original).