Optimize exponential functions with FEXPA
Introduction
Learn exponential function optimization techniques
Implement exponential with SVE intrinsics
Optimize with FEXPA instruction
Review benefits and next steps
Next Steps

  Log an issue

  Fork and edit

  Discuss on Discord

About this Learning Path

Skill level:  Introductory
Reading time:  15 min
Last updated:  14 Sep 2026
Skill level:
  Introductory
Reading time:
  15 min
Last updated:
  14 Sep 2026
Authors:Arnaud Grasset
Claudio Martino
Alexandre Romana
Arm IP:Neoverse
Tags: Performance and Architecture AWS Graviton Microsoft Azure Cobalt Google Axion Linux macOS C CPP
Authors:
  • Arnaud Grasset
  • Claudio Martino
  • Alexandre Romana
Arm IP:
Neoverse
Tags:
Performance and Architecture AWS Graviton Microsoft Azure Cobalt Google Axion Linux macOS C CPP

Who is this for?

This is an introductory topic for developers interested in accelerating exponential function computations using Arm's Scalable Vector Extension (SVE). The Floating Point Exponential Accelerator (FEXPA) instruction provides hardware acceleration for exponential calculations on Arm Neoverse processors.

What will you learn?

Upon completion of this Learning Path, you will be able to:

  • Implement the exponential function using SVE intrinsics
  • Optimize the function with FEXPA

Prerequisites

Before starting, you will need the following:

Summary

AI-assisted

This summary was drafted with an approved AI-assisted workflow and reviewed by Arm contributors before publication. Human technical review remains part of the process so the final page reflects engineering rigor, accuracy, and Arm editorial standards.

Close
?
You’ll implement an exponential function with Arm SVE intrinsics, starting with range reduction and polynomial approximation. First, you’ll select an approximation interval, choose a polynomial degree, and validate your result against a reference. Then, you’ll use the SVE FEXPA instruction for hardware-assisted reconstruction, reducing the polynomial work while preserving accuracy for your performance-sensitive Neoverse code.

Frequently asked questions

AI-assisted

These FAQs were drafted with an approved AI-assisted workflow and reviewed by Arm contributors before publication. Human technical review remains part of the process so the final page reflects engineering rigor, accuracy, and Arm editorial standards.

Close
?
How do I compile the SVE example?
Install gcc, then compile exp_sve.c with gcc -O3 -march=armv8-a+sve exp_sve.c -o exp_sve -lm. Use an SVE-capable Arm processor to execute the SVE implementation.
Which floating-point precision am I building with in this example?
The provided implementation uses single precision: its coefficients are float values and its SVE vectors use svfloat32_t. The example therefore builds the FP32 version described in the precision table.
When should I switch my code from the polynomial-only version to the FEXPA-optimized version?
After the baseline SVE polynomial version compiles and produces correct results, replace the range-reduction sequence with the FEXPA-based approach. Re-validate accuracy against your target error before continuing.
What result should I expect after I enable FEXPA?
FEXPA performs table lookup and bit manipulation in hardware, which lets you use a lower-degree polynomial for the same target precision. Confirm this by checking approximation error over a representative input range.
How do I choose my polynomial degree and input range?
Use range reduction to map inputs into an interval where the polynomial is accurate, then tune the polynomial degree to meet your error goal. Evaluate absolute or relative error across representative inputs before finalizing the choice.
Next