✦ LIBER ✦

A Novel Approach to Fast Discrete Fourier Transform

✍ Scribed by J.G. Liu; H.F. Li; F.H.Y. Chan; F.K. Lam

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 324 KB
Volume: 54
Category: Article
ISSN: 0743-7315
DOI: 10.1006/jpdc.1998.1472

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fast parallel complex discrete fourier t

Fast parallel complex discrete fourier transforms using a multichannel optical correlator

✍ Hong Xin Huang; Li Ren Liu; Yao Zu Yin; Li Ying Zhao 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 318 KB

Fourier transform approach to potential

Fourier transform approach to potential harmonics

✍ John Avery; Wensheng Bian; John Loeser; Frank Antonsen 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 192 KB

Because of the high degeneracy of hyperspherical harmonics, a method is needed for selecting the most important ones for inclusion in hyperangular basis sets. Such a method was developed by M. Fabre de la Ripelle, who showed that the most important harmonics are -projections of the product of the po

Four67, a fast fourier transform package

✍ J.P. Christiansen; R.W. Hockney 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 855 KB

Title of program (32 characters maximum): FOUR67 Catalogue number: ABUA Computer for which the program is designed and others upon which it is operable Computer: ICL KDF9. Installation: UKAEA Cuiham Laboratory Operating system or monitor under which the program is executed: EGDON 3 Programming langu

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

A Fast Recursive Pruned Discrete Cosine

A Fast Recursive Pruned Discrete Cosine Transform

✍ M. Elsharkawy; W. Eshmawy 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 379 KB

El-Sharkawy, M., and Eshmawy, W., A Fast Recursive Pruned Discrete Cosine Transform, Digital Signal Processing 5 (1995), 140-148. This paper presents a recursive algorithm for computing the pruned DCT with a structure that allows the generation of the next higher-order pruned DCT from two identical

Partial discrete Fourier transform (PDFT

Partial discrete Fourier transform (PDFT) multiband encoding

✍ Charles H. Cunningham; Jeffrey A. Stainsby; Graham A. Wright; Michael L. Wood 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 323 KB

For conventional multiband encoding techniques such as Hadamard encoding, scan time scales linearly with the number of slices encoded simultaneously. In this work, a new multiband encoding technique called partial discrete Fourier transform (PDFT) encoding is introduced, which overcomes this restric