Higher radix aperiodic-convolution algorithms

Digital Signal Processing with Field Programmable Gate Arrays

“…Computational effort for the recursive FIR decomposition[104,105]. Computational effort for the recursive FIR decomposition[104,105].…”

An efficient architecture for multi-dimensional convolution

“…It should be mentioned that the computation complexity in our proposed algorithm depends on the computations involved in the core computations C n =2;n =2 = C (n 1 =2) C (n 2 =2). The number of multiplications in our proposed algorithm based on [1] as a core, compared to the direct method and FFT method, is shown in Table I. The table shows a significant reduction of the number of multiplications of the proposed multiplexed algorithm over the direct and FFT methods.…”

“…Recently, several fast algorithms (other than the well-known rowcolumn method) have been proposed for two-dimensional discrete cosine transform (2-D-DCT) or multidimensional discrete cosine (MD-DCT). Among them, the polynomial transform (PT) based algorithms for 2-D-DCT in [2] and [3], the algorithms in [4] and [5], and the algorithm for MD-DCT in [1] are reported to offer savings on the required Manuscript received December 1999; revised August 2000. This paper was recommended by Associate A. Skodras.…”