New FFT structures based on the Bruun algorithm

Wu, Y. (1990). New FFT structures based on the Bruun algorithm. IEEE.

Type

Unclassified

Intellectual base

Unclassified

Year

1990

DOI

10.1109/29.45572

Link

https://doi.org/10.1109/29.45572

Cited by

1 citation across 1 artifact.

Domain-specific

• Bruun's FFT algorithm
  • … sequence, recursive factorization generates real intermediate polynomials and combines their values into conjugate Fourier coefficients at the last stage. to An implementer counts operations and tests numerical error against a real-data Cooley-Tukey implementation before choosing Bruun's less-common factorization..

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:15ec6f6dc3a0 · see in the full table