More accurate complex multiplication for embedded processors - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

More accurate complex multiplication for embedded processors

Claude-Pierre Jeannerod
  • Function : Author
  • PersonId : 855152
Christophe Monat
  • Function : Author
  • PersonId : 855154
Laurent Thévenoux

Abstract

This paper presents some work in progress on the development of fast and accurate support for complex floating-point arithmetic on embedded processors. Focusing on the case of multiplication, we describe algorithms and implementations for computing both the real and imaginary parts with high relative accuracy. We show that, in practice, such accuracy guarantees can be achieved with reasonable overhead compared with conventional algorithms (which are those offered by current implementations and for which the real or imaginary part of a product can have no correct digit at all). For example, the average execution-time overheads when computing an FFT on the ARM Cortex-A53 and -A57 processors range from 1.04x to 1.17x only, while arithmetic costs suggest overheads from 1.5x to 1.8x.
Fichier principal
Vignette du fichier
Jeannerod_Monat_Thevenoux_SIES17.pdf (349.01 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01512760 , version 1 (24-04-2017)
hal-01512760 , version 2 (11-05-2017)

Identifiers

  • HAL Id : hal-01512760 , version 2

Cite

Claude-Pierre Jeannerod, Christophe Monat, Laurent Thévenoux. More accurate complex multiplication for embedded processors. 12th IEEE International Symposium on Industrial Embedded Systems (SIES 2017), Jun 2017, Toulouse, France. ⟨hal-01512760v2⟩
366 View
699 Download

Share

Gmail Facebook X LinkedIn More