1997
DOI: 10.1117/12.280825
|View full text |Cite
|
Sign up to set email alerts
|

High-performance implementation of convolution on multiple field-programmable gate array boards using number theoretic transforms defined over the Eisenstein residue number system

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2007
2007
2007
2007

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(3 citation statements)
references
References 9 publications
0
3
0
Order By: Relevance
“…2. The ERNS FFT, from Meyer-Bäse et al [174], uses the Rader algorithm in combination with the number theoretic transform, which will also be discussed in Chap. 7.1.…”
Section: Comparison Of Dft and Fft Algorithmsmentioning
confidence: 99%
See 2 more Smart Citations
“…2. The ERNS FFT, from Meyer-Bäse et al [174], uses the Rader algorithm in combination with the number theoretic transform, which will also be discussed in Chap. 7.1.…”
Section: Comparison Of Dft and Fft Algorithmsmentioning
confidence: 99%
“…7.1a. In addition this allows a simplified bus structure if a multi-FPGA implementation [174] is used. • Fermat NTTs with M = 2 (2 t ) + 1 have a power-of-two length N = 2 t , and can therefore be implemented with the usual Cooley-Tukey radix-2-type FFT algorithm, which we discussed in Chap.…”
Section: 8mentioning
confidence: 99%
See 1 more Smart Citation