✦ LIBER ✦

New algorithms for calculating discrete fourier transforms

✍ Scribed by A.M. Grigoryan

Publisher: Elsevier Science
Year: 1986
Weight: 516 KB
Volume: 26
Category: Article
ISSN: 0041-5553
DOI: 10.1016/0041-5553(86)90044-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Vector coding algorithms for multidimens

Vector coding algorithms for multidimensional discrete Fourier transform

✍ Zhaodou Chen; Lijing Zhang 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 186 KB

A new fast algorithm is presented for the multidimensional discrete Fourier transform (DFT). This algorithm is derived using an interesting technique called "vector coding" (VC), and we call it the vector-coding fast Fourier transform (VC-FFT) algorithm. Since the VC-FFT is an extension of the Coole

A new fast Fourier transform algorithm

✍ I.E. Kaporin 📂 Article 📅 1980 🏛 Elsevier Science ⚖ 367 KB

Fourier transform algorithms for interfe

Fourier transform algorithms for interferometry

✍ Horst Ziegler 📂 Article 📅 1975 🏛 Elsevier Science ⚖ 492 KB

Fast and numerically stable algorithms f

Fast and numerically stable algorithms for discrete cosine transforms

✍ Gerlind Plonka; Manfred Tasche 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 477 KB

Fast computation algorithm for the discr

Fast computation algorithm for the discrete Fourier transform of a real-valued sequence

✍ Mamoru Tsuchiya 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 986 KB

Discrete Fourier transform computation f

Discrete Fourier transform computation for digital relaying

✍ A. Gómez Expósito; J.A. Rosendo Macias; J.L. Ruis Macías 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 383 KB