✦ LIBER ✦

The multiplicative complexity of the Discrete Fourier Transform

✍ Scribed by L Auslander; E Feig; S Winograd

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 910 KB
Volume: 5
Category: Article
ISSN: 0196-8858
DOI: 10.1016/0196-8858(84)90005-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Linear Complexity, k-Error Linear Comple

Linear Complexity, k-Error Linear Complexity, and the Discrete Fourier Transform

✍ Wilfried Meidl; Harald Niederreiter 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 129 KB

The multiplicative complexity of discret

The multiplicative complexity of discrete cosine transforms

✍ Ephraim Feig; Elliot Linzer 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 436 KB

Generalizing the discrete fourier transf

Generalizing the discrete fourier transform

✍ Thomas Beth 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 297 KB

The Heisenberg inequality for the discre

The Heisenberg inequality for the discrete Fourier transform

✍ F.Alberto Grünbaum 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 138 KB

The Discrete Fourier Transform (DFT) in

The Discrete Fourier Transform (DFT) in Behavioural Analysis

✍ T.G. Forrest; Robert B. Suter 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 547 KB

Spectral analysis is an important tool for examining time-series data and can be particularly powerful in detecting periodicity in animal behaviour patterns. Because of its simplicity and the speed of current computing algorithms, the discrete Fourier transform is most often used in spectral analysi

Fast mersenne number transforms for the

Fast mersenne number transforms for the computation of discrete fourier transforms

✍ Wan-Chi Siu; A.G. Constantinides 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 422 KB