Normalized Cyclic Convolution: The Case of Even Length
From MaRDI portal
Abstract: A novel method for computation of the discrete Fourier transform over a finite field with reduced multiplicative complexity is described. If the number of multiplications is to be minimized, then the novel method for the finite field of even extension degree is the best known method of the discrete Fourier transform computation. A constructive method of constructing for a cyclic convolution over a finite field is introduced.
This page was built for publication: Normalized Cyclic Convolution: The Case of Even Length
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580844)