Back to Results
First PageMeta Content
Algebra / Digital signal processing / Numerical analysis / Unitary operators / Matrices / Fast Fourier transform / Cooley–Tukey FFT algorithm / Discrete Fourier transform / Convolution / Mathematical analysis / Mathematics / Fourier analysis


Document Date: 2004-01-29 14:02:08

Open Document

File Size: 162,42 KB

Share Result on Facebook

Company

IBM / REAL POSITIVE DEFINITE TOEPLITZ SYSTEMS / REAL TOEPLITZ SYSTEMS / FFTs / performed using in-place FFTs / /

Currency

pence / /

Facility

DII complex / University of Kentucky Lexington / Northern Illinois University / /

IndustryTerm

analogous algorithms / classical algorithm / post-processing procedure / decimation-in-frequency algorithm / computational tool / superfast algorithm / above algorithm / decimation-in-time algorithm / superfast solution / /

Organization

Bergen Scientific Centre / National Science Foundation / Northern Illinois University / Department of Mathematics / University of Kentucky Lexington / Department of Mathematical Sciences / /

Person

GREGORY S. AMMAR / WILLIAM B. GRAGG / /

/

Position

Prime Minister / /

Product

Schur / /

ProvinceOrState

Kentucky / Illinois / /

Region

Northern Illinois / /

Technology

decimation-in-time algorithm / above algorithm / Levinson-Durbin algorithm / Edson-Bergland algorithm / 1 2 G. S. AMMAR AND W. B. GRAGG algorithm / following algorithm / superfast algorithm / known FFT algorithms / classical algorithm / generalized Schur algorithm / de Hoog-Musicus algorithm / Cooley-Tukey algorithm / Cooley-Tukey FFT algorithm / classical Schur algorithm / Progressive Schur Algorithm / real split-radix FFT algorithm / FFT algorithms / real FFT algorithms / radix-two Cooley-Tukey decimation-in-frequency algorithm / above two FFT algorithms / radix-two FFT algorithms / EdsonBergland algorithm / /

SocialTag