✦ LIBER ✦

Timing of some fast DFT-algorithms

✍ Scribed by A.J. van der Steen

Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 382 KB
Volume: 5
Category: Article
ISSN: 0165-1684
DOI: 10.1016/0165-1684(83)90085-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Timing of some bit reversal algorithms

✍ Petr Rösel 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 494 KB

Timing results of some internal sorting

Timing results of some internal sorting algorithms on the IBM 3090

✍ P Carnevali 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 224 KB

Timing results of some internal sorting

Timing results of some internal sorting algorithms on the ETA 10-P

✍ J Moscinski; Z.A Rycerz; P.W.M Jacobs 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 161 KB

Fast segmentation algorithms for long hy

Fast segmentation algorithms for long hydrometeorological time series

✍ Hafzullah Aksoy; Abdullah Gedikli; N. Erdem Unal; Athanasios Kehagias 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 256 KB

## Abstract A time series with natural or artificially created inhomogeneities can be segmented into parts with different statistical characteristics. In this study, three algorithms are presented for time series segmentation; the first is based on dynamic programming and the second and the third—t

A Fast Algorithm for Adapted Time–Freque

A Fast Algorithm for Adapted Time–Frequency Tilings

✍ Christoph M. Thiele; Lars F. Villemoes 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 221 KB

We first consider orthonormal bases of R N consisting of discretized rescaled Walsh functions, where N is a power of two. Given a vector, the best basis with respect to an additive cost function is found with an algorithm of order O(N log N). The algorithm operates in the time-frequency plane by con

Fast stability test algorithm for discre

Fast stability test algorithm for discrete time systems

✍ Kaoru Kurosawa 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 413 KB