FFTc: An MLIR Dialect for Developing HPC Fast Fourier Transform Libraries

• URL: http://arxiv.org/abs/2207.06803v1
• Date: Thu, 14 Jul 2022 10:31:21 GMT
• Title: FFTc: An MLIR Dialect for Developing HPC Fast Fourier Transform Libraries
• Authors: Yifei He, Artur Podobas, M{\aa}ns I. Andersson, and Stefano Markidis
• Abstract summary: We introduce FFTc, a domain-specific language for expressing Fourier Transform algorithms. We present the initial design, implementation, and preliminary results of FFTc.
• Score: 1.181206257787103
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Discrete Fourier Transform (DFT) libraries are one of the most critical software components for scientific computing. Inspired by FFTW, a widely used library for DFT HPC calculations, we apply compiler technologies for the development of HPC Fourier transform libraries. In this work, we introduce FFTc, a domain-specific language, based on Multi-Level Intermediate Representation (MLIR), for expressing Fourier Transform algorithms. We present the initial design, implementation, and preliminary results of FFTc.

Related papers

• Fourier Learning Machines: Nonharmonic Fourier-Based Neural Networks for Scientific Machine Learning [0.5097809301149341]
  We introduce the Fourier Learning Machine (FLM), a neural network (NN) architecture designed to represent a multidimensional nonharmonic Fourier series.<n>The FLM uses a simple feedforward structure with cosine activation functions to learn the frequencies, amplitudes, and phase shifts of the series as trainable parameters.<n> Computational experiments show that the performance of FLMs is comparable, and often superior, to that of established architectures like SIREN and vanilla feedforward NNs.
  arXiv  Detail & Related papers  (2025-09-10T16:49:20Z)
• FFTArray: A Python Library for the Implementation of Discretized Multi-Dimensional Fourier Transforms [0.0]
  We present FFTArray, a Python library that automates the general discretization of Fourier transforms.<n>Built on the Python Array API Standard, FFTArray integrates seamlessly with array backends like NumPy, JAX and PyTorch.
  arXiv  Detail & Related papers  (2025-07-17T17:05:39Z)
• Fourier Controller Networks for Real-Time Decision-Making in Embodied Learning [42.862705980039784]
  Transformer has shown promise in reinforcement learning to model time-varying features. It still suffers from the issues of low data efficiency and high inference latency. In this paper, we propose to investigate the task from a new perspective of the frequency domain.
  arXiv  Detail & Related papers  (2024-05-30T09:43:59Z)
• WFTNet: Exploiting Global and Local Periodicity in Long-term Time Series Forecasting [61.64303388738395]
  We propose a Wavelet-Fourier Transform Network (WFTNet) for long-term time series forecasting. Tests on various time series datasets show WFTNet consistently outperforms other state-of-the-art baselines.
  arXiv  Detail & Related papers  (2023-09-20T13:44:18Z)
• Transform Once: Efficient Operator Learning in Frequency Domain [69.74509540521397]
  We study deep neural networks designed to harness the structure in frequency domain for efficient learning of long-range correlations in space or time. This work introduces a blueprint for frequency domain learning through a single transform: transform once (T1)
  arXiv  Detail & Related papers  (2022-11-26T01:56:05Z)
• Deep Fourier Up-Sampling [100.59885545206744]
  Up-sampling in the Fourier domain is more challenging as it does not follow such a local property. We propose a theoretically sound Deep Fourier Up-Sampling (FourierUp) to solve these issues.
  arXiv  Detail & Related papers  (2022-10-11T06:17:31Z)
• New Approaches to Long Document Summarization: Fourier Transform Based Attention in a Transformer Model [0.0]
  We extensively redesign the newly introduced method of token mixing using Fourier Transforms (FNET) to replace the computationally expensive self-attention mechanism. We also carry out long document summarization using established methods that are capable of processing over 8000 tokens. All modifications showed better performance on the summarization task than when using the original FNET encoder in a transformer architecture.
  arXiv  Detail & Related papers  (2021-11-25T18:03:41Z)
• Fourier Image Transformer [10.315102237565734]
  We show that an auto-regressive image completion task is equivalent to predicting a higher resolution output given a low-resolution input. We demonstrate the practicality of this approach in the context of computed tomography (CT) image reconstruction.
  arXiv  Detail & Related papers  (2021-04-06T14:48:57Z)
• Learning Set Functions that are Sparse in Non-Orthogonal Fourier Bases [73.53227696624306]
  We present a new family of algorithms for learning Fourier-sparse set functions. In contrast to other work that focused on the Walsh-Hadamard transform, our novel algorithms operate with recently introduced non-orthogonal Fourier transforms. We demonstrate effectiveness on several real-world applications.
  arXiv  Detail & Related papers  (2020-10-01T14:31:59Z)
• Fast Partial Fourier Transform [28.36925669222461]
  Fast Fourier transform (FFT) is a widely used algorithm that computes the discrete Fourier transform in many machine learning applications. Despite its pervasive use, all known FFT algorithms do not provide a fine-tuning option for the user to specify one's demand. In this paper, we propose a fast Partial Fourier Transform (PFT), a careful modification of the Cooley-Tukey algorithm that enables one to specify an arbitrary consecutive range where the coefficients should be computed.
  arXiv  Detail & Related papers  (2020-08-28T10:01:49Z)
• FedML: A Research Library and Benchmark for Federated Machine Learning [55.09054608875831]
  Federated learning (FL) is a rapidly growing research field in machine learning. Existing FL libraries cannot adequately support diverse algorithmic development. We introduce FedML, an open research library and benchmark to facilitate FL algorithm development and fair performance comparison.
  arXiv  Detail & Related papers  (2020-07-27T13:02:08Z)
• DFTpy: An efficient and object-oriented platform for orbital-free DFT simulations [55.41644538483948]
  In this work, we present DFTpy, an open source software implementing OFDFT written entirely in Python 3. We showcase the electronic structure of a million-atom system of aluminum metal which was computed on a single CPU. DFTpy is released under the MIT license.
  arXiv  Detail & Related papers  (2020-02-07T19:07:41Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.