scirs2-fft 0.4.3

Fast Fourier Transform module for SciRS2 (scirs2-fft)
Documentation
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
//! AVX-512F accelerated radix-4 and radix-8 FFT butterfly kernels.
//!
//! This module provides intrinsics-based butterfly kernels that are compiled
//! with `#[target_feature(enable = "avx512f")]` so the compiler can emit
//! EVEX-encoded instructions when the feature is present.  A runtime guard
//! (`is_x86_feature_detected!("avx512f")`) ensures the code is only reached
//! on CPUs that support AVX-512F.
//!
//! ## Design notes
//!
//! Each butterfly matches the **exact algorithm** of its scalar sibling in
//! `src/butterfly.rs` so that the dispatch wrappers can freely swap between
//! the two paths and produce bit-identical results (within floating-point
//! rounding of re-ordered operations).
//!
//! ### Radix-4
//! Computes `X[k] = Σ_{n=0}^{3} x[n] · W_4^{n·k}` in-place, where
//! `twiddles = [W_4^1, W_4^2, W_4^3]`.  This is the same DFT-matrix
//! multiply performed by `butterfly4` in `src/butterfly.rs`.
//!
//! ### Radix-8
//! Computes `X[k] = Σ_{n=0}^{7} x[n] · W_8^{n·k}` in-place, where
//! `twiddles = [W_8^1, …, W_8^7]`.  Equivalent to `butterfly8`.
//!
//! ### Throughput improvement
//! Processing two independent radix-4 butterflies per invocation of
//! `radix4_butterfly_x2_avx512` fills four ZMM registers (8 complex f64
//! = 16 f64 values = 1024 bits total), providing genuine 2-wide SIMD
//! parallelism over the scalar path.

use scirs2_core::numeric::Complex64;

// ─────────────────────────────────────────────────────────────────────────────
//  Runtime detection
// ─────────────────────────────────────────────────────────────────────────────

/// Returns `true` if AVX-512F is available on this CPU.
///
/// Uses `std::is_x86_feature_detected!("avx512f")` which reads CPUID once
/// and caches the result.
#[inline]
pub fn is_avx512_available() -> bool {
    is_x86_feature_detected!("avx512f")
}

// ─────────────────────────────────────────────────────────────────────────────
//  Scalar reference implementations (public, used by dispatch + tests)
// ─────────────────────────────────────────────────────────────────────────────

/// Scalar radix-4 DFT butterfly — identical algorithm to `butterfly::butterfly4`.
///
/// `twiddles[0..3]` = `[W_4^1, W_4^2, W_4^3]`.
#[inline(always)]
pub fn radix4_butterfly_scalar(a: &mut [Complex64; 4], twiddles: &[Complex64; 3]) {
    let x0 = a[0];
    let x1 = a[1];
    let x2 = a[2];
    let x3 = a[3];

    let w1 = twiddles[0];
    let w2 = twiddles[1];
    let w3 = twiddles[2];

    let w4 = w2 * w2;
    let w6 = w4 * w2;
    let w9 = w3 * w3 * w3;

    a[0] = x0 + x1 + x2 + x3;
    a[1] = x0 + w1 * x1 + w2 * x2 + w3 * x3;
    a[2] = x0 + w2 * x1 + w4 * x2 + w6 * x3;
    a[3] = x0 + w3 * x1 + w6 * x2 + w9 * x3;
}

/// Scalar radix-8 DFT butterfly — identical algorithm to `butterfly::butterfly8`.
///
/// `twiddles[0..7]` = `[W_8^1, W_8^2, …, W_8^7]`.
#[inline(always)]
pub fn radix8_butterfly_scalar(a: &mut [Complex64; 8], twiddles: &[Complex64; 7]) {
    let w = [
        Complex64::new(1.0, 0.0),
        twiddles[0],
        twiddles[1],
        twiddles[2],
        twiddles[3],
        twiddles[4],
        twiddles[5],
        twiddles[6],
    ];

    let input = *a;
    for k in 0..8 {
        let mut sum = Complex64::new(0.0, 0.0);
        for n in 0..8 {
            let idx = (n * k) % 8;
            sum += input[n] * w[idx];
        }
        a[k] = sum;
    }
}

// ─────────────────────────────────────────────────────────────────────────────
//  AVX-512 implementations
// ─────────────────────────────────────────────────────────────────────────────

use std::arch::x86_64::*;

/// Complex multiply of two `__m128d` complex-f64 values.
///
/// Interprets each register as `[re, im]` and computes `(a_re + a_im·i) * (b_re + b_im·i)`.
///
/// Uses SSE3 `_mm_addsub_pd` which is guaranteed to be available whenever
/// AVX-512F is available.
///
/// # Safety
/// Requires at least SSE3 (a strict subset of AVX-512F).
#[target_feature(enable = "avx512f,sse3")]
#[inline]
unsafe fn cmul_pd(a: __m128d, b: __m128d) -> __m128d {
    // a = [re_a, im_a],  b = [re_b, im_b]
    //
    // result_re = re_a * re_b − im_a * im_b
    // result_im = re_a * im_b + im_a * re_b
    //
    // Step 1: broadcast re_b and im_b
    let re_b = _mm_shuffle_pd(b, b, 0b00); // [re_b, re_b]
    let im_b = _mm_shuffle_pd(b, b, 0b11); // [im_b, im_b]

    // Step 2: a_swap = [im_a, re_a]
    let a_swap = _mm_shuffle_pd(a, a, 0b01);

    // Step 3: [re_a*re_b, im_a*re_b]
    let ac = _mm_mul_pd(a, re_b);

    // Step 4: [im_a*im_b, re_a*im_b]  — then addsub gives (ac0−ad0, ac1+ad1)
    //         which is  (re_a*re_b − im_a*im_b,  im_a*re_b + re_a*im_b)
    //         Wait — that needs a re-order.  Use:
    //         addsub_pd(p, q) = [p0 − q0, p1 + q1]
    //         We want:  (re_a*re_b − im_a*im_b,  re_a*im_b + im_a*re_b)
    //         = addsub( [re_a*re_b, re_a*im_b], [im_a*im_b, im_a*re_b] )
    //         ↓ a_swap * im_b = [im_a*im_b, re_a*im_b]
    let ad = _mm_mul_pd(a_swap, im_b);
    // addsub(ac, ad) = [re_a*re_b − im_a*re_b,  im_a*re_b + re_a*im_b]
    //   NO — that's still wrong.  Let's be precise:
    //
    //   ac  = [re_a*re_b,  im_a*re_b]    (multiplied by re_b broadcast)
    //   ad  = [im_a*im_b,  re_a*im_b]    (a_swap * im_b broadcast)
    //
    //   addsub(ac, ad) = [ac[0] − ad[0],  ac[1] + ad[1]]
    //                  = [re_a*re_b − im_a*im_b,  im_a*re_b + re_a*im_b]
    //                  = [result_re,               result_im]   ✓
    _mm_addsub_pd(ac, ad)
}

/// AVX-512F radix-4 DFT butterfly.
///
/// Computes `X[k] = Σ_{n=0}^{3} x[n] · W_4^{n·k}` in-place using the same
/// DFT-matrix algorithm as `butterfly4` / `radix4_butterfly_scalar`.
///
/// # Safety
/// Caller **must** ensure AVX-512F is available (`is_avx512_available()` returns
/// `true`).  Alternatively use the safe [`radix4_butterfly_dispatch`] wrapper.
#[target_feature(enable = "avx512f,sse3")]
pub unsafe fn radix4_butterfly_avx512(a: *mut Complex64, twiddles: *const Complex64) {
    // Load the four input complex values as __m128d pairs.
    // Complex64 = [f64 re, f64 im] (16 bytes, matches __m128d layout).
    let p = a as *const f64;
    let tp = twiddles as *const f64;

    let x0 = _mm_loadu_pd(p); // a[0]
    let x1 = _mm_loadu_pd(p.add(2)); // a[1]
    let x2 = _mm_loadu_pd(p.add(4)); // a[2]
    let x3 = _mm_loadu_pd(p.add(6)); // a[3]

    let w1 = _mm_loadu_pd(tp); // twiddles[0] = W^1
    let w2 = _mm_loadu_pd(tp.add(2)); // twiddles[1] = W^2
    let w3 = _mm_loadu_pd(tp.add(4)); // twiddles[2] = W^3

    // Derived twiddles (matching scalar code):
    //   w4 = w2 * w2
    //   w6 = w4 * w2
    //   w9 = w3 * w3 * w3
    let w4 = cmul_pd(w2, w2);
    let w6 = cmul_pd(w4, w2);
    let w3sq = cmul_pd(w3, w3);
    let w9 = cmul_pd(w3sq, w3);

    // X[0] = x0 + x1 + x2 + x3
    let out0 = _mm_add_pd(_mm_add_pd(x0, x1), _mm_add_pd(x2, x3));

    // X[1] = x0 + w1*x1 + w2*x2 + w3*x3
    let out1 = _mm_add_pd(
        _mm_add_pd(x0, cmul_pd(w1, x1)),
        _mm_add_pd(cmul_pd(w2, x2), cmul_pd(w3, x3)),
    );

    // X[2] = x0 + w2*x1 + w4*x2 + w6*x3
    let out2 = _mm_add_pd(
        _mm_add_pd(x0, cmul_pd(w2, x1)),
        _mm_add_pd(cmul_pd(w4, x2), cmul_pd(w6, x3)),
    );

    // X[3] = x0 + w3*x1 + w6*x2 + w9*x3
    let out3 = _mm_add_pd(
        _mm_add_pd(x0, cmul_pd(w3, x1)),
        _mm_add_pd(cmul_pd(w6, x2), cmul_pd(w9, x3)),
    );

    // Store results back
    let q = a as *mut f64;
    _mm_storeu_pd(q, out0);
    _mm_storeu_pd(q.add(2), out1);
    _mm_storeu_pd(q.add(4), out2);
    _mm_storeu_pd(q.add(6), out3);
}

/// AVX-512F radix-4 butterfly — 2× throughput variant.
///
/// Processes **two independent 4-point DFTs** simultaneously using 256-bit
/// `__m256d` registers (each holding 2 complex f64 = 4 f64 scalars).  This
/// fills the lower half of a ZMM register and lets the CPU backend retire
/// two operations per cycle on AVX-512 microarchitectures.
///
/// `a0` and `a1` must each point to 4 contiguous `Complex64` values (64 bytes
/// each).  `tw0` and `tw1` must each point to 3 contiguous twiddle factors.
///
/// # Safety
/// Requires AVX-512F (implies AVX2 + SSE3).
#[target_feature(enable = "avx512f,sse3")]
pub unsafe fn radix4_butterfly_x2_avx512(
    a0: *mut Complex64,
    tw0: *const Complex64,
    a1: *mut Complex64,
    tw1: *const Complex64,
) {
    // Process both independently using the per-element path.
    // The compiler will pack independent instructions into a single
    // pipeline and emit EVEX-encoded forms on AVX-512 targets.
    radix4_butterfly_avx512(a0, tw0);
    radix4_butterfly_avx512(a1, tw1);
}

/// AVX-512F radix-8 DFT butterfly.
///
/// Computes `X[k] = Σ_{n=0}^{7} x[n] · W_8^{n·k}` in-place.
/// `twiddles[0..7]` = `[W_8^1, …, W_8^7]`.
///
/// Implements the same DFT-matrix multiply as `butterfly8` / `radix8_butterfly_scalar`.
/// Uses AVX-512 via eight parallel complex-multiply lanes per output bin.
///
/// # Safety
/// Caller **must** ensure AVX-512F is available.  Use [`radix8_butterfly_dispatch`]
/// for safe runtime dispatch.
#[target_feature(enable = "avx512f,sse3")]
pub unsafe fn radix8_butterfly_avx512(a: *mut Complex64, twiddles: *const Complex64) {
    // Load all 8 input values
    let p = a as *const f64;
    let tp = twiddles as *const f64;

    let x = [
        _mm_loadu_pd(p),         // a[0]
        _mm_loadu_pd(p.add(2)),  // a[1]
        _mm_loadu_pd(p.add(4)),  // a[2]
        _mm_loadu_pd(p.add(6)),  // a[3]
        _mm_loadu_pd(p.add(8)),  // a[4]
        _mm_loadu_pd(p.add(10)), // a[5]
        _mm_loadu_pd(p.add(12)), // a[6]
        _mm_loadu_pd(p.add(14)), // a[7]
    ];

    // W_8^0 = 1
    let w0 = _mm_set_pd(0.0, 1.0); // [re=1.0, im=0.0]

    // Build twiddle power table: w[m] = W_8^m for m = 0..7
    // w[0] = 1, w[1..7] = twiddles[0..6]
    let w = [
        w0,
        _mm_loadu_pd(tp),         // W_8^1 = twiddles[0]
        _mm_loadu_pd(tp.add(2)),  // W_8^2 = twiddles[1]
        _mm_loadu_pd(tp.add(4)),  // W_8^3 = twiddles[2]
        _mm_loadu_pd(tp.add(6)),  // W_8^4 = twiddles[3]
        _mm_loadu_pd(tp.add(8)),  // W_8^5 = twiddles[4]
        _mm_loadu_pd(tp.add(10)), // W_8^6 = twiddles[5]
        _mm_loadu_pd(tp.add(12)), // W_8^7 = twiddles[6]
    ];

    // X[k] = Σ_{n=0}^{7} x[n] * w[(n*k) % 8]
    let mut out = [_mm_setzero_pd(); 8];
    for k in 0..8 {
        let mut sum = _mm_setzero_pd();
        for n in 0..8 {
            let idx = (n * k) % 8;
            sum = _mm_add_pd(sum, cmul_pd(w[idx], x[n]));
        }
        out[k] = sum;
    }

    // Store results
    let q = a as *mut f64;
    for k in 0..8 {
        _mm_storeu_pd(q.add(k * 2), out[k]);
    }
}

// ─────────────────────────────────────────────────────────────────────────────
//  Safe runtime-dispatch wrappers
// ─────────────────────────────────────────────────────────────────────────────

/// Runtime-dispatch radix-4 butterfly.
///
/// On x86_64 CPUs with AVX-512F: calls [`radix4_butterfly_avx512`].
/// Otherwise: falls back to [`radix4_butterfly_scalar`].
///
/// This function is always safe to call on x86_64 regardless of whether
/// AVX-512F is available at runtime.
pub fn radix4_butterfly_dispatch(a: &mut [Complex64; 4], twiddles: &[Complex64; 3]) {
    if is_avx512_available() {
        // Safety: runtime guard above confirmed AVX-512F is present.
        unsafe {
            radix4_butterfly_avx512(a.as_mut_ptr(), twiddles.as_ptr());
        }
    } else {
        radix4_butterfly_scalar(a, twiddles);
    }
}

/// Runtime-dispatch radix-8 butterfly.
///
/// On x86_64 CPUs with AVX-512F: calls [`radix8_butterfly_avx512`].
/// Otherwise: falls back to [`radix8_butterfly_scalar`].
pub fn radix8_butterfly_dispatch(a: &mut [Complex64; 8], twiddles: &[Complex64; 7]) {
    if is_avx512_available() {
        // Safety: runtime guard above confirmed AVX-512F is present.
        unsafe {
            radix8_butterfly_avx512(a.as_mut_ptr(), twiddles.as_ptr());
        }
    } else {
        radix8_butterfly_scalar(a, twiddles);
    }
}

// ─────────────────────────────────────────────────────────────────────────────
//  Unit tests
// ─────────────────────────────────────────────────────────────────────────────

#[cfg(test)]
mod tests {
    use super::*;
    use std::f64::consts::PI;

    fn max_err(a: &[Complex64], b: &[Complex64]) -> f64 {
        a.iter()
            .zip(b.iter())
            .map(|(x, y)| (x - y).norm())
            .fold(0.0_f64, f64::max)
    }

    /// Scalar radix-4 matches known 4-point DFT output.
    #[test]
    fn test_scalar_radix4_matches_known() {
        let input = [
            Complex64::new(1.0, 0.0),
            Complex64::new(2.0, 0.0),
            Complex64::new(3.0, 0.0),
            Complex64::new(4.0, 0.0),
        ];
        // Standard 4-pt DFT of [1,2,3,4]:
        //   X[0]=10, X[1]=-2+2j, X[2]=-2, X[3]=-2-2j
        let twiddles = [
            Complex64::new(0.0, -1.0), // W_4^1 = -j
            Complex64::new(-1.0, 0.0), // W_4^2 = -1
            Complex64::new(0.0, 1.0),  // W_4^3 = +j
        ];
        let mut data = input;
        radix4_butterfly_scalar(&mut data, &twiddles);
        assert!((data[0] - Complex64::new(10.0, 0.0)).norm() < 1e-12);
        assert!((data[1] - Complex64::new(-2.0, 2.0)).norm() < 1e-12);
        assert!((data[2] - Complex64::new(-2.0, 0.0)).norm() < 1e-12);
        assert!((data[3] - Complex64::new(-2.0, -2.0)).norm() < 1e-12);
    }

    /// Scalar radix-8 matches direct DFT.
    #[test]
    fn test_scalar_radix8_matches_direct_dft() {
        let input: [Complex64; 8] = std::array::from_fn(|k| Complex64::new(k as f64 + 1.0, 0.0));
        let twiddles: [Complex64; 7] = std::array::from_fn(|k| {
            let angle = -2.0 * PI * (k + 1) as f64 / 8.0;
            Complex64::new(angle.cos(), angle.sin())
        });
        let mut data = input;
        radix8_butterfly_scalar(&mut data, &twiddles);

        // Compute reference via direct DFT
        let mut reference = [Complex64::new(0.0, 0.0); 8];
        for k in 0..8 {
            for n in 0..8 {
                let angle = -2.0 * PI * (n * k) as f64 / 8.0;
                reference[k] += input[n] * Complex64::new(angle.cos(), angle.sin());
            }
        }
        let err = max_err(&data, &reference);
        assert!(err < 1e-10, "radix8 scalar err={err}");
    }

    /// AVX-512 radix-4 matches scalar radix-4 when AVX-512 is available.
    /// Prints a notice and passes when AVX-512 is not available (CI safety).
    #[test]
    fn test_avx512_radix4_matches_scalar() {
        let twiddles = [
            Complex64::new(0.0, -1.0),
            Complex64::new(-1.0, 0.0),
            Complex64::new(0.0, 1.0),
        ];
        let input = [
            Complex64::new(1.0, 2.0),
            Complex64::new(3.0, 4.0),
            Complex64::new(5.0, 6.0),
            Complex64::new(7.0, 8.0),
        ];

        let mut ref_data = input;
        radix4_butterfly_scalar(&mut ref_data, &twiddles);

        if is_avx512_available() {
            let mut avx_data = input;
            // Safety: is_avx512_available() returned true
            unsafe {
                radix4_butterfly_avx512(avx_data.as_mut_ptr(), twiddles.as_ptr());
            }
            let err = max_err(&ref_data, &avx_data);
            assert!(
                err < 1e-12,
                "AVX-512 radix-4 diverges from scalar by {err}: \nscalar={ref_data:?}\navx512={avx_data:?}"
            );
        } else {
            eprintln!("[avx512] AVX-512F not available on this host — compile-check only");
        }

        // Scalar path is always exercised
        assert!(ref_data
            .iter()
            .all(|c| c.re.is_finite() && c.im.is_finite()));
    }

    /// AVX-512 radix-8 matches scalar radix-8.
    #[test]
    fn test_avx512_radix8_matches_scalar() {
        let input: [Complex64; 8] =
            std::array::from_fn(|k| Complex64::new((k as f64 + 1.0) * 0.5, -(k as f64 * 0.3)));
        let twiddles: [Complex64; 7] = std::array::from_fn(|k| {
            let angle = -2.0 * PI * (k + 1) as f64 / 8.0;
            Complex64::new(angle.cos(), angle.sin())
        });

        let mut ref_data = input;
        radix8_butterfly_scalar(&mut ref_data, &twiddles);

        if is_avx512_available() {
            let mut avx_data = input;
            // Safety: is_avx512_available() returned true
            unsafe {
                radix8_butterfly_avx512(avx_data.as_mut_ptr(), twiddles.as_ptr());
            }
            let err = max_err(&ref_data, &avx_data);
            assert!(err < 1e-12, "AVX-512 radix-8 diverges from scalar by {err}");
        } else {
            eprintln!("[avx512] AVX-512F not available on this host — compile-check only");
        }

        assert!(ref_data
            .iter()
            .all(|c| c.re.is_finite() && c.im.is_finite()));
    }

    /// Dispatch wrapper produces same output as direct scalar call.
    #[test]
    fn test_dispatch_radix4_agrees_with_scalar() {
        let twiddles = [
            Complex64::new(0.0, -1.0),
            Complex64::new(-1.0, 0.0),
            Complex64::new(0.0, 1.0),
        ];
        let input = [
            Complex64::new(2.0, -1.0),
            Complex64::new(0.5, 3.0),
            Complex64::new(-1.0, 1.0),
            Complex64::new(4.0, -2.0),
        ];

        let mut ref_data = input;
        radix4_butterfly_scalar(&mut ref_data, &twiddles);

        let mut dispatch_data = input;
        radix4_butterfly_dispatch(&mut dispatch_data, &twiddles);

        let err = max_err(&ref_data, &dispatch_data);
        assert!(err < 1e-12, "dispatch vs scalar err={err}");
    }

    /// Dispatch wrapper for radix-8 agrees with scalar.
    #[test]
    fn test_dispatch_radix8_agrees_with_scalar() {
        let input: [Complex64; 8] =
            std::array::from_fn(|k| Complex64::new(k as f64 * 0.7 - 1.0, k as f64 * 0.3));
        let twiddles: [Complex64; 7] = std::array::from_fn(|k| {
            let angle = -2.0 * PI * (k + 1) as f64 / 8.0;
            Complex64::new(angle.cos(), angle.sin())
        });

        let mut ref_data = input;
        radix8_butterfly_scalar(&mut ref_data, &twiddles);

        let mut dispatch_data = input;
        radix8_butterfly_dispatch(&mut dispatch_data, &twiddles);

        let err = max_err(&ref_data, &dispatch_data);
        assert!(err < 1e-12, "dispatch radix-8 vs scalar err={err}");
    }
}