Skip to main content
MathOverflow

Return to Answer

Changed 'Digital' to 'Discrete;' caught by Rodrigo de Azevedo
Source Link
skbmoore
skbmoore
  • 894
  • 4
  • 8

Two instances come to mind in digital signal processing (applied mathematics).

  1. The Fast Fourier Transform (FFT) computes the DigitalDiscrete Fourier Transform in $O(N \log N)$ instead of $O(N^2)$. Supposedly, Gauss had a version of the FFT long before (electronic) computers made their impact.

  2. The second is the original wavelet transform, by A. Haar in 1909. Research in wavelet transforms has exploded since.

Two instances come to mind in digital signal processing (applied mathematics).

  1. The Fast Fourier Transform (FFT) computes the Digital Fourier Transform in $O(N \log N)$ instead of $O(N^2)$. Supposedly, Gauss had a version of the FFT long before (electronic) computers made their impact.

  2. The second is the original wavelet transform, by A. Haar in 1909. Research in wavelet transforms has exploded since.

Two instances come to mind in digital signal processing (applied mathematics).

  1. The Fast Fourier Transform (FFT) computes the Discrete Fourier Transform in $O(N \log N)$ instead of $O(N^2)$. Supposedly, Gauss had a version of the FFT long before (electronic) computers made their impact.

  2. The second is the original wavelet transform, by A. Haar in 1909. Research in wavelet transforms has exploded since.

added 14 characters in body
Source Link
Rodrigo de Azevedo
Rodrigo de Azevedo
  • 1
  • 3
  • 16
  • 35

Two instances come to mind in digital signal processing (applied mathematics). The Fast Fourier Transform (FFT) computes the Digital Fourier Transform in $O(N \log N)$ instead of $O(N^2).$ Supposedly Gauss had a version of the FFT, long before (electronic) computers made their impact. The second is the original wavelet transform, by A. Haar in 1909. Research in wavelet transforms has exploded since.

  1. The Fast Fourier Transform (FFT) computes the Digital Fourier Transform in $O(N \log N)$ instead of $O(N^2)$. Supposedly, Gauss had a version of the FFT long before (electronic) computers made their impact.

  2. The second is the original wavelet transform, by A. Haar in 1909. Research in wavelet transforms has exploded since.

Two instances come to mind in digital signal processing (applied mathematics). The Fast Fourier Transform (FFT) computes the Digital Fourier Transform in $O(N \log N)$ instead of $O(N^2).$ Supposedly Gauss had a version of the FFT, long before (electronic) computers made their impact. The second is the original wavelet transform, by A. Haar in 1909. Research in wavelet transforms has exploded since.

Two instances come to mind in digital signal processing (applied mathematics).

  1. The Fast Fourier Transform (FFT) computes the Digital Fourier Transform in $O(N \log N)$ instead of $O(N^2)$. Supposedly, Gauss had a version of the FFT long before (electronic) computers made their impact.

  2. The second is the original wavelet transform, by A. Haar in 1909. Research in wavelet transforms has exploded since.

Source Link
skbmoore
skbmoore
  • 894
  • 4
  • 8

Two instances come to mind in digital signal processing (applied mathematics). The Fast Fourier Transform (FFT) computes the Digital Fourier Transform in $O(N \log N)$ instead of $O(N^2).$ Supposedly Gauss had a version of the FFT, long before (electronic) computers made their impact. The second is the original wavelet transform, by A. Haar in 1909. Research in wavelet transforms has exploded since.

Post Made Community Wiki by skbmoore