1975
DOI: 10.1109/t-c.1975.224085
|View full text |Cite
|
Sign up to set email alerts
|

A Parallel Radix-4 Fast Fourier Transform Computer

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

1980
1980
2023
2023

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 16 publications
(7 citation statements)
references
References 9 publications
0
7
0
Order By: Relevance
“…In addition to the preceding analogue techniques, digital FFT processors [58] are developing rapidly. 1024-point FFTs using state-of-the-art (16 x 16)-bit digital multipliers can be designed with 5 MHz real-time complex bandwidths for small-quantity prices approaching £5000.…”
Section: Digital Fast Fourier Transforms (Fft)mentioning
confidence: 99%
See 1 more Smart Citation
“…In addition to the preceding analogue techniques, digital FFT processors [58] are developing rapidly. 1024-point FFTs using state-of-the-art (16 x 16)-bit digital multipliers can be designed with 5 MHz real-time complex bandwidths for small-quantity prices approaching £5000.…”
Section: Digital Fast Fourier Transforms (Fft)mentioning
confidence: 99%
“…Thus, utimately, there will be strong competition with the SAW and IMCON compressive receivers, see Table 5. Table 5 specifies the likely current performance for a multiplexed radix-4 [58] FFT. Increased speed (bandwidth) can be obtained with fully pipelined structures [59], but cost and power consumption become much less competitive with SAW compressive receiver designs.…”
Section: Digital Fast Fourier Transforms (Fft)mentioning
confidence: 99%
“…Corinthios [20,21,22] has used the formalism of Pease to implement an algorithm (previously noted by Cochran, Cooley, et. ale [16]) which does not produce the output in bit reversed order.…”
Section: Previous Workmentioning
confidence: 99%
“…Wlog N r rOp (22) cycles. As noted in section 3.1 a factor of 4 is gained in processing speed for each factor of 2 increase in radix.…”
Section: Perfect Shuffle Data Handlingmentioning
confidence: 99%
“…A popular method of investigation is based on frequency analysis of rotating machines (Brock et al, 2016;Han et al, 2022;Łuczak, 2021;Miletic et al, 2022;Peeters et al, 2018;Pindoriya et al, 2018;Ramteke et al, 2022;Strakosch et al, 2021;Wszołek et al, 2020). The option that is mostly used is the fast Fourier transform (FFT) based on the radix-2 (Cooley and Tukey, 1965) or radix-4 algorithm (Corinthios et al, 1975); however, very often, there is no information available concerning the question which FFT algorithm has been employed (Duda et al, 2021;Gong and Deng, 2022). The limitation of FFT analysis is the length of time window.…”
Section: Introductionmentioning
confidence: 99%