All Topics
All Topics
Technology
Technology
AI
AI
Business
Business
Entertainment
Entertainment
News
News
Programming
Programming
Science
Science
Design
Design
Environment
Environment
Finance
Finance
Crypto
Crypto
Politics
Politics
Sports
Sports
Education
Education
Gaming
Gaming
Art
Art
Music
Music
Health
Health
Security
Security
Books
Books
Food
Food
Travel
Travel
Personal
Personal
Bluesky
Twitter

FP8 Tensor Cores Enable FP64-Equivalent 3-D FFT on NVIDIA Blackwell Ultra via Ozaki-Bailey Decomposition

By

[Submitted on 28 May 2026 (v1), last revised 26 Jun 2026 (this version, v2)]

4d ago· 2 min readenInsight

Summary

This technical paper presents the Ozaki-Bailey FFT, a method for achieving full FP64-equivalent 3-D FFT performance on NVIDIA's Blackwell Ultra (B300) GPU, which has severely reduced native FP64 throughput (~1.3 TFLOPS, ~30x below B200). The approach uses the Ozaki Scheme II framework to route dense matrix multiply through FP8 tensor cores with mantissa-sliced Chinese-remainder reconstruction. The FFT implementation uses Bailey's six-step decomposition with both 1-D FFT GEMMs on FP8 tensor cores. Garner reconstruction splits into Phase A (inner products on FP8/INT8 tensor cores) and Phase B (per-output reduction), where the authors identify Kulisch fixed-point complete arithmetic as a reformulation that maintains full FP64 accuracy on the INT32 SIMT pipe. The paper derives bandwidth-parity floors and projects ~18 ms for 1024^3 at full FP64, approaching the 12.9 ms memory roof. If the projection holds, B300 becomes viable for full-FP64 FFT through software alone, motivating a libKulisch library and benchmark campaign.

Source

bskyFP8 Tensor Cores Enable FP64-Equivalent 3-D FFT on NVIDIA Blackwell Ultra via Ozaki-Bailey Decompositionarxiv.org

Key quotes

· 5 pulled
The Ozaki Scheme II framework recovers FP64-equivalent throughput by routing dense matrix multiply through FP8 tensor cores with a mantissa-sliced Chinese-remainder reconstruction.
Garner reconstruction splits into Phase A (inner products on FP8/INT8 tensor cores, ~1 ms for 1024^3 on B300) and Phase B (per-output reduction).
We identify Kulisch fixed-point complete arithmetic as a Phase B reformulation that keeps full FP64 accuracy while running entirely on the INT32 SIMT pipe.
A GPU meets memory-roof FFT parity if it satisfies either the native floor or both Kulisch floors.
If the projection holds in practice, B300 becomes viable for full-FP64 FFT through software alone, motivating a libKulisch library and benchmark campaign.
Snippet from the RSS feed
NVIDIA's Blackwell Ultra (B300) cuts FP64 vector throughput to ~1.3 TFLOPS per GPU, roughly 30x below B200 and well below the level at which bandwidth-limited FP64 workloads stay memory-bound. The Ozaki Scheme II framework recovers FP64-equivalent through

You might also wanna read

Comments

Sign in to join the conversation.

No comments yet. Be the first.