中文
相关论文

相关论文: Exploring Fast Fourier Transforms on the Tenstorre…

200 篇论文

The RISC-V Instruction Set Architecture (ISA) has enjoyed phenomenal growth in recent years, however it still to gain popularity in HPC. Whilst adopting RISC-V CPU solutions in HPC might be some way off, RISC-V based PCIe accelerators offer…

分布式、并行与集群计算 · 计算机科学 2024-09-30 Nick Brown , Ryan Barton

Fast Fourier Transform (FFT) is an essential tool in scientific and engineering computation. The increasing demand for mixed-precision FFT has made it possible to utilize half-precision floating-point (FP16) arithmetic for faster speed and…

分布式、并行与集群计算 · 计算机科学 2021-04-26 Binrui Li , Shenggan Cheng , James Lin

As investment in AI-focused accelerators grows and their deployment in supercomputing facilities expands, understanding whether these architectures can efficiently support traditional scientific kernels is critical for the future of…

分布式、并行与集群计算 · 计算机科学 2026-05-11 Lorenzo Piarulli , Daniele De Sensi

Although originally developed primarily for artificial intelligence workloads, RISC-V-based accelerators are also emerging as attractive platforms for high-performance scientific computing. In this work, we present our approach to…

分布式、并行与集群计算 · 计算机科学 2025-09-24 Jenny Lynn Almerol , Elisabetta Boella , Mario Spera , Daniele Gregori

While RISC-V-based accelerators were initially designed with artificial intelligence applications in mind, they are increasingly being recognized as promising platforms for high performance scientific computing. In this work, we present…

分布式、并行与集群计算 · 计算机科学 2026-05-05 Jenny Lynn Almerol , Elisabetta Boella , Mario Spera , Daniele Gregori

While Transformers are dominated by Floating-Point (FP) Matrix-Multiplications, their aggressive acceleration through dedicated hardware or many-core programmable systems has shifted the performance bottleneck to non-linear functions like…

硬件体系结构 · 计算机科学 2025-04-16 Run Wang , Gamze Islamoglu , Andrea Belano , Viviane Potocnik , Francesco Conti , Angelo Garofalo , Luca Benini

This research introduces an FPGA-based hardware accelerator to optimize the Singular Value Decomposition (SVD) and Fast Fourier transform (FFT) operations in AI models. The proposed design aims to improve processing speed and reduce…

硬件体系结构 · 计算机科学 2025-04-15 Hong Ding , Chia Chao Kang , SuYang Xi , Zehang Liu , Xuan Zhang , Yi Ding

The Fast Fourier Transform (FFT), as a core computation in a wide range of scientific applications, is increasingly threatened by reliability issues. In this paper, we introduce TurboFFT, a high-performance FFT implementation equipped with…

分布式、并行与集群计算 · 计算机科学 2024-05-07 Shixun Wu , Yujia Zhai , Jinyang Liu , Jiajun Huang , Zizhe Jian , Huangliang Dai , Sheng Di , Zizhong Chen , Franck Cappello

This research explores the use of superconductor electronics (SCE) for accelerating fully homomorphic encryption (FHE), focusing on the Number-Theoretic Transform (NTT), a key computational bottleneck in FHE schemes. We present SCE-NTT, a…

Fast Fourier Transform (FFT) libraries are widely used for evaluating discrete convolutions. Most FFT implementations follow some variant of the Cooley-Tukey framework, in which the transform is decomposed into butterfly operations and…

数值分析 · 数学 2026-04-30 Nicolas Venkovic , Hartwig Anzt

Fast Fourier transform (FFT) of large number of samples requires huge hardware resources of field programmable gate arrays (FPGA), which needs more area and power. In this paper, we present an area efficient architecture of FFT processor…

硬件体系结构 · 计算机科学 2015-02-26 Atin Mukherjee , Amitabha Sinha , Debesh Choudhury

Reconfigurable architectures like Field Programmable Gate Arrays (FPGAs) have been used for accelerating computations in several domains because of their unique combination of flexibility, performance, and power efficiency. However, FPGAs…

硬件体系结构 · 计算机科学 2023-04-26 Murat Isik , Kayode Inadagbo , Hakan Aktas

GPU-based fast Fourier transform (FFT) is extremely important for scientific computing and signal processing. However, we find the inefficiency of existing FFT libraries and the absence of fault tolerance against soft error. To address…

分布式、并行与集群计算 · 计算机科学 2024-12-10 Shixun Wu , Yujia Zhai , Jinyang Liu , Jiajun Huang , Zizhe Jian , Huangliang Dai , Sheng Di , Franck Cappello , Zizhong Chen

The Number Theoretic Transform (NTT) is an indispensable tool for computing efficient polynomial multiplications in post-quantum lattice-based cryptography. It has strong resemblance with the Fast Fourier Transform (FFT), which is the most…

密码学与安全 · 计算机科学 2025-04-16 Rishabh Shrivastava , Chaitanya Prasad Ratnala , Durga Manasa Puli , Utsav Banerjee

As AI accelerators gain prominence, their potential for traditional scientific computing workloads remains unclear. This paper explores Tenstorrent's Wormhole architecture, a spatial computing platform designed for neural network…

性能 · 计算机科学 2026-03-25 Maya Taylor , Carl Pearson , Luc Berger-Vergiat , Giovanni Long , Jan Ciesko

Recent advances in high-resolution CT-imaging technology are creating a new class of ultra-high resolved micro-structural datasets that challenge the limits of traditional homogenization approaches. While state-of-the-art FFT-based…

材料科学 · 物理学 2025-12-10 Sascha H. Hauck , Matthias Kabel , Nicolas R. Gauger

RISC-V is a RISC based open and loyalty free instruction set architecture which has been developed since 2010, and can be used for cost-effective soft processors on FPGAs. The basic 32-bit integer instruction set in RISC-V is defined as…

硬件体系结构 · 计算机科学 2020-12-30 Hiromu Miyazaki , Takuto Kanamori , Md Ashraful Islam , Kenji Kise

RISC-V CPUs leverage the RVV (RISC-V Vector) extension to accelerate data-parallel workloads. In addition to arithmetic operations, RVV includes powerful permutation instructions that enable flexible element rearrangement within vector…

硬件体系结构 · 计算机科学 2025-06-02 Vasileios Titopoulos , George Alexakis , Chrysostomos Nicopoulos , Giorgos Dimitrakopoulos

In this paper, we propose TensorFHE, an FHE acceleration solution based on GPGPU for real applications on encrypted data. TensorFHE utilizes Tensor Core Units (TCUs) to boost the computation of Number Theoretic Transform (NTT), which is the…

硬件体系结构 · 计算机科学 2023-01-02 Shengyu Fan , Zhiwei Wang , Weizhi Xu , Rui Hou , Dan Meng , Mingzhe Zhang

For a sample set of 1024 values, the FFT is 102.4 times faster than the discrete Fourier transform (DFT). The basis for this remarkable speed advantage is the `bit-reversal' scheme of the Cooley-Tukey algorithm. Eliminating the burden of…

历史与综述 · 数学 2007-05-23 Randall D. Peters
‹ 上一页 1 2 3 10 下一页 ›