Goertzel algorithm
Algorithm
The Goertzel algorithm is a technique in digital signal processing (DSP) for efficient evaluation of the individual terms of the discrete Fourier transform (DFT). It is useful in certain practical applications, such as recognition of dual-tone multi-frequency signaling (DTMF) tones produced by the push buttons of the keypad of a traditional analog telephone.
Nº Q1472192 ★★
Poco común · Saberes
Goertzel algorithm
Algorithm
The Goertzel algorithm is a technique in digital signal processing (DSP) for efficient evaluation of the individual terms of the discrete Fourier transform (DFT). It is useful in certain practical applications, such as recognition of dual-tone multi-frequency signaling (DTMF) tones produced by the push buttons of the keypad of a traditional analog telephone.
En Wikipedia
Texto en inglés Aún no hay artículo en tu idioma: extracto en inglés.
The Goertzel algorithm is a technique in digital signal processing (DSP) for efficient evaluation of the individual terms of the discrete Fourier transform (DFT). It is useful in certain practical applications, such as recognition of dual-tone multi-frequency signaling (DTMF) tones produced by the push buttons of the keypad of a traditional analog telephone. The algorithm was first described by Gerald Goertzel in 1958. Like the DFT, the Goertzel algorithm analyses one selectable frequency component from a discrete signal. Unlike direct DFT calculations, the Goertzel algorithm applies a single real-valued coefficient at each iteration, using real-valued arithmetic for real-valued input sequences. For covering a full spectrum (except when using for continuous stream of data where coefficients are reused for subsequent calculations, which has computational complexity equivalent of sliding DFT), the Goertzel algorithm has a higher order of complexity than fast Fourier transform (FFT) algorithms, but for computing a small number of selected frequency components, it is more numerically efficient. The simple structure of the Goertzel algorithm makes it well suited to small processors and embedded applications. The Goertzel algorithm can also be used "in reverse" as a sinusoid synthesis function, which requires only 1 multiplication and 1 subtraction per generated sample.
Texto: Wikipedia en inglés, CC BY-SA 4.0. ·
Cartas cercanas
-
D
DSA
Algoritmo criptografico de firma digital
Nº Q1224829 ★★
Sin ofertas
-
Algoritmo de Grover
Algoritmo cuántico de búsqueda
Nº Q1028292 ★★
Sin ofertas
-
Transformada de Laplace
Nº Q199691 ★★★★
Sin ofertas
-
Método de Newton
Método iterativo creado por Isaac Newton que produce aproximaciones a las raíces (soluciones) de funciones reales
Nº Q374195 ★★★
Sin ofertas
-
Filtro de Savitzky–Golay
Nº Q1228952 ★★
Sin ofertas
-
Método de Box-Muller
Nº Q895514 ★
Sin ofertas
-
A
Algoritmo de Viterbi
Nº Q83886 ★★
Sin ofertas
-
T
Transformada de Hough
Nº Q195076 ★
Sin ofertas
-
Transformador (modelo de aprendizaje automático)
Modelo de aprendizaje automático
Nº Q85810444 ★★★★
Sin ofertas
-
Scale-invariant feature transform
Nº Q767770 ★
Sin ofertas
-
Marcación por tonos
Nº Q941685 ★★★
Sin ofertas
-
A
Algoritmo de Kabsch
Nº Q6344361 ★
Sin ofertas
-
B
Brent's method
Root-finding algorithm
Nº Q905988 ★
Sin ofertas
-
Double Ratchet Algorithm
Cryptographic key management algorithm
Nº Q22079944 ★
Sin ofertas
-
M
Multigrid method
Method of solving system of linear algebrayes equations based on the use of a sequence of decreasing grids and operator
Nº Q1413101 ★
Sin ofertas
-
Pohlig–Hellman algorithm
Algorithm for computing discrete logarithms
Nº Q1755812 ★
Sin ofertas
-
Algoritmo de Euclides
Método eficiente para calcular el máximo común divisor (MCD) de dos números enteros
Nº Q230848 ★★★
Sin ofertas
-
Teorema de Norton
Nº Q651593 ★★
Sin ofertas