Faster Convolution using FFT by Polynomial Matrix Multiplication
Priyanka Bhalawi; Ashish Raghuwanshi
Matrix multiplication is a primary computation for several scientific computing, graphics processing units and engineering applications. Matrix multiplication is also use in convolution operation of two discrete signals in DFT (Discrete Fourier Transform) and FFT (Fast Fourier Transform) application. For the timing simulation of, Xilinx tool is used. Xilinx is a digital front end design tool which supports the simulation and synthesis of VHDL and Verilog HDL codes. In this work, we considered two different examples (circular convolution and linear convolution) of matrix multiplier architecture where speed is the main constraint.