Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: Discrete Fourier transform over a ring (view), Non-uniform discrete Fourier transform (view)

searching for Discrete Fourier transform 47 found (241 total)

alternate case: discrete Fourier transform

Short-time Fourier transform (4,055 words) [view diff] case mismatch in snippet view article find links to article

"Short Time Spectral Analysis, Synthesis, and Modification by Discrete Fourier Transform". IEEE Transactions on Acoustics, Speech, and Signal Processing

Sliding DFT (396 words) [view diff] exact match in snippet view article find links to article

In applied mathematics, the sliding discrete Fourier transform is a recursive algorithm to compute successive STFTs of input data frames that are a single

Patrick Ion (243 words) [view diff] exact match in snippet view article find links to article

Heidelberg in the field of quantum stochastics, q-analogues and the discrete Fourier transform in elementary geometry. He has also translated several mathematical

Fredric J. Harris (410 words) [view diff] case mismatch in snippet view article find links to article

1978 paper "On the use of Windows for Harmonic Analysis with the Discrete Fourier Transform." He is also the author of the textbook Multi-rate Signal Processing

Normalized frequency (signal processing) (479 words) [view diff] case mismatch in snippet view article

(2021). "Discrete Fourier Transform - Frequencies", Lectures on matrix algebra. https://www.statlect.com/matrix-algebra/discrete-Fourier-transform-frequencies

Reed–Solomon error correction (12,395 words) [view diff] exact match in snippet view article find links to article

and since a discrete Fourier transform is a linear operator, R(x) = C(x) + E(x). Transform r(x) to R(x) using discrete Fourier transform. Since the calculation

Principal root of unity (226 words) [view diff] exact match in snippet view article find links to article

principal is that it is a necessary condition for the theory of the discrete Fourier transform to work out correctly. Bini, D.; Pan, V. (1994), Polynomial and

Carrier interferometry (1,628 words) [view diff] exact match in snippet view article find links to article

codes. In the simplest case, CI code values are coefficients of a discrete Fourier transform (DFT) matrix. Each row or column of the DFT matrix provides an

Multidimensional signal processing (835 words) [view diff] case mismatch in snippet view article find links to article

representation of the signal. In the case of digital processing, a discrete Fourier Transform (DFT) is utilized to transform a sampled signal domain representation

Order tracking (signal processing) (797 words) [view diff] case mismatch in snippet view article

recent formulation of such transforms is the Velocity Synchronous Discrete Fourier Transform, defined as follows: X ( Ω ) = Δ t Θ ∑ n = 1 N x ( n Δ t ) e −

Constant amplitude zero autocorrelation waveform (275 words) [view diff] case mismatch in snippet view article find links to article

impulse r ( τ ) = δ ( n ) {\displaystyle r(\tau )=\delta (n)} The discrete fourier transform of the autocorrelation is flat R ( f ) = 1 / N {\displaystyle

Digital delay line (2,449 words) [view diff] exact match in snippet view article find links to article

(1978). "On the use of windows for harmonic analysis with the discrete Fourier transform". Proceedings of the IEEE. 66 (1): 51–83. doi:10.1109/proc.1978

Web Coverage Processing Service (679 words) [view diff] case mismatch in snippet view article find links to article

classification, filter kernels and general convolutions, histograms, and Discrete Fourier Transform are expressible. Open Geospatial Consortium Web Map Service (WMS)

Chebotarev theorem on roots of unity (319 words) [view diff] exact match in snippet view article find links to article

All submatrices of a discrete Fourier transform matrix of prime length are invertible

Hexagonal Efficient Coordinate System (1,774 words) [view diff] exact match in snippet view article find links to article

{\displaystyle -k\mathbf {p} =k(-\mathbf {p} ).} The hexagonal discrete Fourier transform (HDFT) was developed by Mersereau and was converted to an HECS

Kaiser window (983 words) [view diff] case mismatch in snippet view article find links to article

1978). "On the use of Windows for Harmonic Analysis with the Discrete Fourier Transform" (PDF). Proceedings of the IEEE. 66 (1): 73 (eq 46b). CiteSeerX 10

Multiple satellite imaging (946 words) [view diff] case mismatch in snippet view article find links to article

Overcast, Marshall C. and Paul W. Nugent. Computing the 2-D Discrete Fourier Transform or Sweet-talking MATLAB into Making Cool Pictures. Owens, Robyn

Julius von Hann (659 words) [view diff] case mismatch in snippet view article find links to article

1978). "On the use of Windows for Harmonic Analysis with the Discrete Fourier Transform" (PDF). Proceedings of the IEEE. 66 (1): 51–83. Bibcode:1978IEEEP

Toeplitz matrix (2,056 words) [view diff] exact match in snippet view article find links to article

Hurvich, C. M.; Lu, Y. (2006), "On the correlation matrix of the discrete Fourier transform and the fast solution of large Toeplitz systems for long-memory

Trigonometric tables (1,648 words) [view diff] exact match in snippet view article find links to article

Applications 4(1): 1–18. James C. Schatzman (1996) "Accuracy of the discrete Fourier transform and the fast Fourier transform", SIAM Journal on Scientific Computing

Ronald N. Bracewell (2,559 words) [view diff] exact match in snippet view article find links to article

Fourier analysis, in 1983 he discovered a new factorisation of the discrete Fourier transform matrix leading to a fast algorithm for spectral analysis. This

Analytic signal (2,675 words) [view diff] case mismatch in snippet view article find links to article

Signals and Hilbert Transform Filters", in Mathematics of the Discrete Fourier Transform (DFT) with Audio Applications, Second Edition, https://ccrma.stanford

Parks–McClellan filter design algorithm (1,798 words) [view diff] exact match in snippet view article find links to article

set {ωi(0)} and the interpolation formula to compute an inverse discrete Fourier transform to obtain the filter coefficients. The Parks–McClellan Algorithm

Gaussian process approximations (2,033 words) [view diff] case mismatch in snippet view article find links to article

{\Lambda } } very sparse. The second extends the domain and uses Discrete Fourier Transform to decorrelate the data, which results in a diagonal precision

List of named matrices (1,336 words) [view diff] no match in snippet view article find links to article

matrix with all entries outside the main diagonal equal to zero. Discrete Fourier-transform matrix Multiplying by a vector gives the DFT of the vector as

Audio bit depth (3,619 words) [view diff] case mismatch in snippet view article find links to article

Julius (2007). "Pulse Code Modulation (PCM)". Mathematics of the Discrete Fourier Transform (DFT) with Audio Applications, Second Edition, online book. Retrieved

Bach Temperament (1,423 words) [view diff] case mismatch in snippet view article find links to article

Temperaments: Theory, History and Practice" (e-book) Amiot E. (2008) : "Discrete Fourier Transform and Bach’s Good Temperament" Martinez Ruiz S. (2011) : "Temperament

Astronomical seeing (3,902 words) [view diff] exact match in snippet view article find links to article

Re[] represents taking the real part, and FT[] represents a discrete Fourier transform of the resulting two-dimensional square array (typically an FFT)

Random-fuzzy variable (2,177 words) [view diff] exact match in snippet view article find links to article

Pietrosanto, Antonio (2000-06-01). "Propagation of uncertainty in a discrete Fourier transform algorithm". Measurement. 27 (4): 231–239. Bibcode:2000Meas...27

Photoemission orbital tomography (2,480 words) [view diff] exact match in snippet view article find links to article

orbital is transformed from real space to momentum space via a discrete Fourier transform. By taking a hemispherical cut, one obtains a so-called momentum

Schönhage–Strassen algorithm (4,580 words) [view diff] exact match in snippet view article find links to article

unity modulo 2 n ′ + 1 {\displaystyle 2^{n'}+1} . We now take the discrete Fourier transform of the arrays A , B {\displaystyle A,B} in the ring Z / ( 2 n

Schönhage–Strassen algorithm (4,580 words) [view diff] exact match in snippet view article find links to article

unity modulo 2 n ′ + 1 {\displaystyle 2^{n'}+1} . We now take the discrete Fourier transform of the arrays A , B {\displaystyle A,B} in the ring Z / ( 2 n

Polar coordinate system (6,702 words) [view diff] case mismatch in snippet view article find links to article

Smith, Julius O. (2003). "Euler's Identity". Mathematics of the Discrete Fourier Transform (DFT). W3K Publishing. ISBN 0-9745607-0-7. Archived from the original

Terence Tao (6,687 words) [view diff] exact match in snippet view article find links to article

and Tao first studied the case where the matrix is given by the discrete Fourier transform.[CRT06a] Candes and Tao abstracted the problem and introduced

Cyclic code (5,214 words) [view diff] exact match in snippet view article find links to article

the signal processing. Fourier transform over finite fields The discrete Fourier transform of vector v = v 0 , v 1 , . . . . , v n − 1 {\displaystyle v=v_{0}

Number theory (11,250 words) [view diff] exact match in snippet view article find links to article

transform (FFT) algorithm, which is used to efficiently compute the discrete Fourier transform, has important applications in signal processing and data analysis

Quartic function (6,854 words) [view diff] exact match in snippet view article find links to article

a resolvent cubic whose roots may be variously described as a discrete Fourier transform or a Hadamard matrix transform of the roots; see Lagrange resolvents

Multislice (3,812 words) [view diff] case mismatch in snippet view article find links to article

048,576 10,240 102.4 2,048 11 4,194,304 22,528 186.2 Table 1 - Computational efficiency of Discrete Fourier Transform compared to Fast Fourier Transform

Moore–Penrose inverse (7,644 words) [view diff] case mismatch in snippet view article find links to article

coefficients. Let ⁠ F {\displaystyle {\mathcal {F}}} ⁠ be the Discrete Fourier Transform (DFT) matrix; then C = F ⋅ Σ ⋅ F ∗ , C + = F ⋅ Σ + ⋅ F ∗ . {\displaystyle

Quartic equation (7,117 words) [view diff] exact match in snippet view article find links to article

using a resolvent whose roots may be variously described as a discrete Fourier transform or a Hadamard matrix transform of the roots. Suppose ri for i

Pulse compression (5,513 words) [view diff] exact match in snippet view article find links to article

of electromagnetic wave in air. After conducting sampling and discrete Fourier transform on y(t) the sinusoid frequency F b {\displaystyle F_{b}} can be

Reassignment method (4,004 words) [view diff] exact match in snippet view article find links to article

is most common to sample the time and frequency domains. The discrete Fourier transform is used to compute samples X ( k ) {\displaystyle X(k)} of the

Synthetic-aperture radar (11,256 words) [view diff] exact match in snippet view article find links to article

there are many fast algorithms for computing the multidimensional discrete Fourier transform. Computational Kronecker-core array algebra is a popular algorithm

Orthogonal frequency-division multiplexing (11,274 words) [view diff] case mismatch in snippet view article find links to article

"Data Transmission by Frequency-Division Multiplexing Using the Discrete Fourier Transform". IEEE Transactions on Communication Technology. 19 (5): 628–634

Mojette transform (3,873 words) [view diff] case mismatch in snippet view article find links to article

Kingston, and N. Normand, “Recovering Missing Slices of the Discrete Fourier Transform using Ghosts,” IEEE Transactions on Image Processing, vol. 21

Parallel multidimensional digital signal processing (3,692 words) [view diff] exact match in snippet view article find links to article

into a parallel form, let’s consider the parallelization of the discrete Fourier transform, which is generally implemented using a form of the Fast Fourier

Chirp compression (10,411 words) [view diff] case mismatch in snippet view article find links to article

F. J., "On the Use of Windows for Harmonic Analysis with the Discrete Fourier Transform", Proc. IEEE, Vol.66, Jan 1978, pp.174–204 Thor R. C., "A large