Conjugate pair fast Fourier transform

1989 ◽  
Vol 25 (5) ◽  
pp. 324 ◽  
Author(s):  
I. Kamar ◽  
Y. Elcherif
Keyword(s):  
Fourier Transform ◽  
Fast Fourier Transform ◽  
Conjugate Pair

Erratum: Conjugate pair fast Fourier transform

1989 ◽  
Vol 25 (22) ◽  
pp. 1547
Author(s):  
I. Kamar ◽  
Y. Elcherif
Keyword(s):  
Fourier Transform ◽  
Fast Fourier Transform ◽  
Conjugate Pair

Comment: Conjugate pair fast Fourier transform

1992 ◽  
Vol 28 (12) ◽  
pp. 1143 ◽  
Author(s):  
A.M. Krot ◽  
H.B. Minervina
Keyword(s):  
Fourier Transform ◽  
Fast Fourier Transform ◽  
Conjugate Pair

Comment: Conjugate pair fast Fourier transform

1990 ◽  
Vol 26 (8) ◽  
pp. 541 ◽  
Author(s):  
H.-S. Qian ◽  
Z.-J. Zhao
Keyword(s):  
Fourier Transform ◽  
Fast Fourier Transform ◽  
Conjugate Pair

scholarly journals A Depth-First Iterative Algorithm for the Conjugate Pair Fast Fourier Transform

2020 ◽  
Author(s):  
Alexandre Becoulet ◽  
Amandine Verguet
Keyword(s):  
Fourier Transform ◽  
Fast Fourier Transform ◽  
Memory Bandwidth ◽  
Conjugate Pair ◽  
Arithmetic Complexity ◽  
Function Calls ◽  
Novel Approaches ◽  
The Cost ◽  
Execution Pattern ◽  
Bitwise Operations

The Split-Radix Fast Fourier Transform has the same low arithmetic complexity as the related Conjugate Pair Fast Fourier Transform. Both transforms have an irregular datapath structure which is straightforwardly expressed only in recursive forms. Furthermore, the conjugate pair variant has a complicated input indexing pattern which requires existing iterative implementations to rely on precomputed tables. It however allows optimization of the memory bandwidth as it requires a single twiddle factor load per radix-4 butterfly. In existing algorithms, this comes at the cost of using additional precomputed tables or performing recursive function calls. In this paper we present two novel approaches that handle both the butterfly scheduling and the input index generation of the Conjugate Pair Fast Fourier Transform. The proposed algorithm is cache-friendly because it is depth-first, non-recursive and does not rely on precomputed index tables. In order to achieve this, we relate the butterfly execution pattern of the Split-Radix and Conjugate Pair FFTs to the binary carry sequence. Based on this finding, we describe how common integer arithmetic and bitwise operations can be used to perform input reordering and depth-first traversal of the transform datapath with O(1) space complexity.<br>

scholarly journals A Depth-First Iterative Algorithm for the Conjugate Pair Fast Fourier Transform

2020 ◽  
Author(s):  
Alexandre Becoulet ◽  
Amandine Verguet
Keyword(s):  
Fourier Transform ◽  
Fast Fourier Transform ◽  
Memory Bandwidth ◽  
Conjugate Pair ◽  
Arithmetic Complexity ◽  
Function Calls ◽  
Novel Approaches ◽  
The Cost ◽  
Execution Pattern ◽  
Bitwise Operations

The Split-Radix Fast Fourier Transform has the same low arithmetic complexity as the related Conjugate Pair Fast Fourier Transform. Both transforms have an irregular datapath structure which is straightforwardly expressed only in recursive forms. Furthermore, the conjugate pair variant has a complicated input indexing pattern which requires existing iterative implementations to rely on precomputed tables. It however allows optimization of the memory bandwidth as it requires a single twiddle factor load per radix-4 butterfly. In existing algorithms, this comes at the cost of using additional precomputed tables or performing recursive function calls. In this paper we present two novel approaches that handle both the butterfly scheduling and the input index generation of the Conjugate Pair Fast Fourier Transform. The proposed algorithm is cache-friendly because it is depth-first, non-recursive and does not rely on precomputed index tables. In order to achieve this, we relate the butterfly execution pattern of the Split-Radix and Conjugate Pair FFTs to the binary carry sequence. Based on this finding, we describe how common integer arithmetic and bitwise operations can be used to perform input reordering and depth-first traversal of the transform datapath with O(1) space complexity.<br>

Sign in / Sign up

Export Citation Format

Share Document