Fast biased polynomial transforms for 2D prime length discrete Fourier transforms
The fast biased polynomial transform (FBPT) is defined directly over a ZN − 1 ring instead of the conventional cyclotomic polynomial rings. For N prime, these FBPTs can be used for the efficient evaluation of the 2D prime length DFT.