Theory and Applications of Digital Speech Processing
Theory and Applications of Digital Speech Processing
A Parallel Architecture for Digital Filtering Using Fermat Number Transforms
IEEE Transactions on Computers
Cancelable Biometrics with Perfect Secrecy for Correlation-Based Matching
ICB '09 Proceedings of the Third International Conference on Advances in Biometrics
| Hi-index | 14.98 |
A transform analogous to the discrete Fourier transform is defined on the Galois field GF(p), where p is a prime of the form k X 2n + 1, where k and n are integers. Such transforms offer a substantial variety of possible transform lengths and dynamic ranges. The fast Fourier transform (FFT) algorithm of this transform is faster than the conventional radix-2 FFT. A transform of this type is used to filter a two-dimensional picture (e.g., 256 X 256 samples), and the results are presented with a comparison to the standard FFT. An absence of roundoff errors is an important feature of this technique.