Results 261 to 270 of about 84,950 (295)

FFTs in external of hierarchical memory

Proceedings of the 1989 ACM/IEEE conference on Supercomputing - Supercomputing '89, 1989
Conventional algorithms for computing large one-dimensional fast Fourier transforms (FFTs), even those algorithms recently developed for vector and parallel computers, are largely unsuitable for systems with external or hierarchical memory. The principal reason for this is the fact that most FFT algorithms require at least m complete passes through the
openaire   +4 more sources

Compute intensity and the FFT

Proceedings of the 1993 ACM/IEEE conference on Supercomputing - Supercomputing '93, 1993
This paper describes how high compute intensity programming techniques combined with algorithms in the literature can result in efficient single- and multi-dimensional FFTs on large numbers of processors on the CRAY APP. The CRAY APP is a shared-memory parallel computer based on the Intel i860 microprocessor.
openaire   +2 more sources

FFT Length in Digital Filtering

IEEE Transactions on Computers, 1979
When the FFT is employed for nonrecursive digital filtering, the time required to process one block of input data, N samples long, is often approximately of the form N(logr (N) + Q), where Q ≥ 0. Earlier results on determining optimum N have assued Q ≥0, becauese it has long been informally observed that typically little is to be gained by taking the ...
openaire   +2 more sources

FFT-DRAM

2022
THOMAS MAMMEN, STRAIN ROBERT J
openaire   +2 more sources

The FFT as a Multigrid Algorithm

SIAM Review, 1990
William L. Briggs, Van Emden Henson
openaire   +1 more source

Long-Term Structural State Trend Forecasting Based on an FFT–Informer Model

Applied Sciences (Switzerland), 2023
Jingpei Dan, Jihao Ma
exaly  

FFT

2010
Joris C Verster, Thomas M. Tzschentke, Kieran O’Malley, Francis C Colpaert, Bart Ellenbroek, Bart Ellenbroek, R. Hamish McAllister-Williams, Joachim Liepert, Cecilia J. Hillard, Sheldon Preskorn, Megan M Dahmen, Janka Lincoln, Oliver Stiedl, Sven Ove Ögren, E C Warburton, Bernard Le Foll, Mohammed Shoaib, Victoria L Harvey, Tony Dickenson, Ennio Esposito, Roberto William Invernizzi, Ennio Esposito, Robert William Invernizzi, Edoardo Spina, Cyril Höschl, Kim Wolff, Andreas Marneros, Anthony L. Riley, Steve Kohut, Samuel R. Chamberlain, Barbara J. Sahakian, David C.S. Roberts, Joseph Zohar, Seiya Miyamoto, Malcolm Lader, Emma Childs, Lawrence H. Price, Harriet de Wit, Wolfgang Fleischhacker, Lance Richard McMahon, Bernard Le Foll, Bernard Le Foll, Lawrence H. Price, Kieran O’Malley, Kieran O’Malley, Stephen M. Stahl, Meghan M Grady, Stephen C Fowler, Francis C. Colpaert, Alex Hofer, Etienne Sibille, Nicole Edgar, Linda P. Spear, Sam Hutton, Linda Lundstroem, Silvia Gatti McArthur, Will Spooren, Maria Isabel Colado, Richard Green, Marcy J. Bubar, Kathryn A Cunningham, Stephan G. Anagnostaras, Jennifer R Sage, Stephanie A. Carmack, Peter H. Boeijinga, Peter H. Boeijinga, Paul Newhouse, Heather Wilkins, Gary Remington, John Atack, Hilde Lavreysen   +70 more
openaire   +1 more source

ATON - FFT: Metallrumpf Technologien ökologisch nachhaltig - FFT

[no abstract available]
openaire   +1 more source

A versatile method of discrete convolution and FFT (DC-FFT) for contact analyses

Wear, 2000
Shuangbiao Liu, Qian Wang, Geng Liu
exaly  

A Generalized Prime Factor FFT Algorithm for any $N = 2^p 3^q 5^r $

SIAM Journal on Scientific and Statistical Computing, 1992
Clive Temperton
exaly