Name
Abstract | ||
|---|---|---|
This paper is about a new efficient method for the implementation of convolvers and correlators using the Fermat Number Transform (FNT) and the inverse (IFNT). The latter present advantages compared to Inverse Fast Fourier Transform (IFFT). An efficient state space method for implementing the Inverse FNT (IFNT) over rectangular windows is proposed for the cases where there is a large overlap between the consecutive input signals. This is called Inverse Generalized Sliding Fermat Number Transform (IGSFNT) and is useful for reducing the computational complexity of finite ring convolvers and correlators. This algorithm uses the technique of Generalized Sliding associated to matricial calculation in the Galois Field. The computational complexity of this method is compared with that of standard IFNT. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1587/transfun.E94.A.1656 | IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES |
Keywords | Field | DocType |
sliding fast fourier transform, fermat number transform, sliding fermat number transform | Non-uniform discrete Fourier transform,Discrete mathematics,Discrete Fourier transform (general),Discrete Hartley transform,Hartley transform,Discrete Fourier transform,S transform,Fractional Fourier transform,Inverse Laplace transform,Mathematics | Journal |
Volume | Issue | ISSN |
E94A | 8 | 0916-8508 |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hamzé Haidar Alaeddine | 1 | 2 | 1.81 |
| E. H. Baghious | 2 | 14 | 3.21 |
| Gilles Burel | 3 | 297 | 113.35 |