Name
Abstract | ||
|---|---|---|
Number theoretic transforms, which operate in the ring or field of integers and use modular arithmetic operations, can perform the operations of convolution and correlation efficiently and without round off errors. Thus, they are very useful for the implementation of digital filters. One such a transform is the new Mersenne number transform (NMNT) which solves the problem of the rigid relationship between the transform length and the modulus, and also the lack of fast algorithms in traditional Mersenne number transforms (MNTs). In this paper, a new architecture that implements this transform is presented. The proposed architecture is scalable and easily parameterised. An implementation in an XC2V4000 FPGA chip has shown that this architecture can work at a frequency of up to 114MHz with a throughput rate of 228MS/s. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/ICC.2006.255302 | Communications, 2006. ICC '06. IEEE International Conference |
Keywords | Field | DocType |
Mersenne transform,convolution,correlation,number theoretic transforms | Kernel (linear algebra),Throughput (business),Integer,Digital filter,Mersenne prime,Convolution,Computer science,Modular arithmetic,Arithmetic,Fast Fourier transform | Conference |
Volume | ISSN | ISBN |
7 | 8164-9547 E-ISBN : 1-4244-0355-3 | 1-4244-0355-3 |
Citations | PageRank | References |
3 | 0.48 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Omar Nibouche | 1 | 89 | 13.50 |
| S. Boussakta | 2 | 135 | 11.59 |
| Michael Darnell | 3 | 75 | 32.32 |