Fast biased polynominal transforms
The fast biased polynomial transforms (FBPT's) are defined directly on the ZN- 1 ring, then two-dimensional convolutions can be carried out without using the Chinese remainder theorem (CRT), complex mapping, and column-row reordering processes. Furthermore, for N prime, these FBPT's are used for the evaluation of 2-D prime length DFT's very efficiently.