basic_dsp_vector 0.5.6

Digital signal processing based on real or complex vectors in time or frequency domain. Vectors come with basic arithmetic, convolution, Fourier transformation and interpolation operations. The vectors are optimized for sizes of a couple of thousand elements or more.
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
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
mod ocl_kernels32;
mod ocl_kernels64;

use self::ocl_kernels32 as o32;
use self::ocl_kernels64 as o64;
use super::GpuSupport;
use clfft::{builder, ClFftPrm, Direction, Layout, Precision};
use ocl::builders::ProgramBuilder;
use ocl::enums::*;
use ocl::flags::DeviceType;
use ocl::prm::{Double2, Float4};
use ocl::traits::{OclPrm, OclVec};
use ocl::*;
use std::cmp;
use std::mem;
use std::ops::Range;
use {array_to_complex, array_to_complex_mut, RealNumber, Zero};

/// This trait is required to interface between `basic_dsp` and `opencl`.
/// Without the feature flag `use_gpu` is will default to a `num` trait so
/// that other code can always rely that this type is defined.
pub type Gpu32 = Float4;

/// This trait is required to interface between `basic_dsp` and `opencl`.
/// Without the feature flag `use_gpu` is will default to a `num` trait so
/// that other code can always rely that this type is defined.
pub type Gpu64 = Double2;

pub trait GpuRegTrait: OclPrm + OclVec {}

pub trait GpuFloat: ClFftPrm {}

impl<T> GpuRegTrait for T where T: OclPrm + OclVec {}

impl<T> GpuFloat for T where T: ClFftPrm {}

fn has_f64_support(device: Device) -> bool {
    const F64_SUPPORT: &str = "cl_khr_fp64";
    match device.info(DeviceInfo::Extensions) {
        Ok(DeviceInfoResult::Extensions(ext)) => ext.contains(F64_SUPPORT),
        _ => false,
    }
}

/// Integrated GPUs are typically less powerful but data transfer from memory to the
/// integrated device can be faster.
fn is_integrated_gpu(device: Device) -> bool {
    const INTEL_VENDOR_ID: &str = "8086";
    match device.info(DeviceInfo::VendorId) {
        Ok(DeviceInfoResult::Extensions(vid)) => vid == INTEL_VENDOR_ID,
        _ => false,
    }
}

/// Returns an indicator of how powerful the device is. More powerful
/// devices should get the calculations done faster. The higher the
/// returned value, the higher the device is rated.
///
/// For now we only look at the number of computational units. Likely this
/// should be a good enough indication for normal consumer PCs which come
/// with up to two GPUs: One on the CPU and one dedicated GPU. The dedicated
/// GPU is likely the better choice in most cases for large data sets and it should
/// have more computational units.
///
/// As an optimization the integrated GPU is preffered for
/// small data sets since the latency is much lower (since we don't need t ogo over
/// the PCI bus).
fn determine_processing_power(device: Device, data_length: usize) -> u32 {
    if data_length < 50000 && is_integrated_gpu(device) {
        return u32::max_value();
    }

    match device.info(DeviceInfo::MaxComputeUnits) {
        Ok(DeviceInfoResult::MaxComputeUnits(units)) => units,
        _ => 0,
    }
}

fn find_gpu_device(require_f64_support: bool, data_length: usize) -> Option<(Platform, Device)> {
    let mut result: Option<(Platform, Device)> = None;
    for p in Platform::list() {
        let devices_op = Device::list(&p, DeviceType::from_bits(ffi::CL_DEVICE_TYPE_GPU));
        if let Ok(devices) = devices_op {
            for d in devices {
                if !require_f64_support || has_f64_support(d) {
                    result = match result {
                        Some((cp, cd))
                            if determine_processing_power(d, data_length)
                                < determine_processing_power(cd, data_length) =>
                        {
                            Some((cp, cd))
                        }
                        _ => Some((p, d)),
                    }
                }
            }
        }
    }

    result
}

fn array_to_gpu_simd<T, R>(array: &[T]) -> &[R] {
    super::super::transmute_slice(array)
}

fn array_to_gpu_simd_mut<T, R>(array: &mut [T]) -> &mut [R] {
    super::super::transmute_slice_mut(array)
}

/// Prepare impulse response
///
/// The data is layout so that it's easier/faster for the kernel to go through the
/// coefficients.
///
/// An example for the data layout can be found in the unit test section.
fn prepare_impulse_response<T: Clone + Copy + Zero>(
    imp_resp: &[T],
    destination: &mut [T],
    vec_len: usize,
) {
    for (n, j) in imp_resp.iter().rev().zip(0..) {
        for i in 0..vec_len {
            let p = j + i;
            let tuple_pos = p % vec_len;
            let tuple = ((p - tuple_pos) + i) * vec_len;
            destination[tuple + tuple_pos] = *n;
        }
    }
}

impl<T> GpuSupport<T> for T
where
    T: RealNumber,
{
    fn has_gpu_support() -> bool {
        find_gpu_device(mem::size_of::<T>() == 8, 0).is_some()
    }

    fn gpu_convolve_vector(
        is_complex: bool,
        source: &[T],
        target: &mut [T],
        imp_resp: &[T],
    ) -> Option<Range<usize>> {
        assert!(target.len() >= source.len());
        let is_f64 = mem::size_of::<T>() == 8;
        let vec_len = if is_f64 { 2 } else { 4 };
        let data_set_size = (source.len() / vec_len) * vec_len;
        let conv_size = imp_resp.len();

        let conv_size_rounded = (conv_size as f32 / vec_len as f32).ceil() as usize * vec_len;
        let conv_size_padded = conv_size_rounded + vec_len;

        if conv_size_padded >= data_set_size {
            return None;
        }

        let num_conv_vectors = conv_size_padded / vec_len;
        let phase = match conv_size % (2 * vec_len) {
            0 => 0,
            x => vec_len - x / 2,
        };

        let (platform, device) = find_gpu_device(is_f64, data_set_size)
            .expect("No GPU device available which supports this data type");

        let kernel_src = if is_f64 {
            o64::CONV_KERNEL
        } else {
            o32::CONV_KERNEL
        };

        let mut prog_bldr = Program::builder();
        prog_bldr
            .src_file(kernel_src)
            .cmplr_def("FILTER_LENGTH", num_conv_vectors as i32)
            .cmplr_opt("-cl-fast-relaxed-math -DMAC");
        let source =
            array_to_gpu_simd::<T, T::GpuReg>(&source[phase..data_set_size - vec_len + phase]);
        let ocl_pq = ProQue::builder()
            .prog_bldr(prog_bldr)
            .platform(platform)
            .device(device)
            .dims([source.len()])
            .build()
            .expect("Building ProQue");

        let step_size = if is_complex { 2 } else { 1 };
        let mut imp_vec_padded = vec![T::zero(); vec_len * conv_size_padded / step_size];
        if is_complex {
            let complex = array_to_complex(&imp_resp);
            let complex_dest = array_to_complex_mut(&mut imp_vec_padded);
            prepare_impulse_response(complex, complex_dest, vec_len / 2);
        } else {
            prepare_impulse_response(imp_resp, &mut imp_vec_padded, vec_len);
        }

        // Create buffers
        let in_buffer = unsafe {
            Buffer::builder()
                .queue(ocl_pq.queue().clone())
                .flags(MemFlags::new().read_only().copy_host_ptr())
                .len(ocl_pq.dims().clone())
                .use_host_slice(source)
                .build()
                .expect("Failed to create GPU input buffer")
        };

        let imp_vec_padded = array_to_gpu_simd::<T, T::GpuReg>(&imp_vec_padded);
        let imp_buffer = unsafe {
            Buffer::builder()
                .queue(ocl_pq.queue().clone())
                .flags(MemFlags::new().read_only().copy_host_ptr())
                .len([imp_vec_padded.len()])
                .use_host_slice(&imp_vec_padded)
                .build()
                .expect("Failed to create GPU impulse response buffer")
        };

        let res_buffer = Buffer::builder()
            .queue(ocl_pq.queue().clone())
            .flags(MemFlags::new().write_only())
            .len(ocl_pq.dims().clone())
            .build()
            .expect("Failed to create GPU result buffer");

        let kenel_name = if is_complex {
            "conv_vecs_c"
        } else {
            "conv_vecs_r"
        };

        // Compile the kernel
        let kernel = ocl_pq
            .kernel_builder(kenel_name)
            .arg_named("src", Some(&in_buffer))
            .arg_named("conv", Some(&imp_buffer))
            .arg(&res_buffer)
            .build()
            .expect("ocl program build");

        // Execute kernel, do this in chunks so that the GPU watchdog isn't
        // terminating our kernel
        let gws_total = (data_set_size - conv_size_padded) / vec_len;
        let chunk_size = 100_000;
        let mut chunk = conv_size_padded / vec_len;
        while chunk < gws_total {
            let current_size = cmp::min(chunk_size, gws_total - chunk);
            unsafe {
                kernel
                    .cmd()
                    .global_work_offset([chunk]) // Offset
                    .global_work_size([current_size])
                    .enq()
                    .expect("Running kernel")
            };
            chunk += chunk_size;
        }

        // Wait for all kernels to finish
        res_buffer
            .cmd()
            .read(array_to_gpu_simd_mut::<T, T::GpuReg>(
                &mut target[0..data_set_size - vec_len],
            ))
            .enq()
            .expect("Transferring result vector from the GPU back to memory failed");

        Some(Range {
            start: conv_size_padded,
            end: data_set_size - conv_size_padded,
        })
    }

    fn is_supported_fft_len(is_complex: bool, len: usize) -> bool {
        if !is_complex || len <= 1 {
            // Since we divide the number by two in the `fft` routine, we need the result to be
            // dividable by two.
            false
        } else if len == 2 {
            true
        } else if len % 2 == 0 {
            Self::is_supported_fft_len(is_complex, len / 2)
        } else if len % 3 == 0 {
            Self::is_supported_fft_len(is_complex, len / 3)
        } else if len % 5 == 0 {
            Self::is_supported_fft_len(is_complex, len / 5)
        } else if len % 7 == 0 {
            Self::is_supported_fft_len(is_complex, len / 7)
        } else if len % 11 == 0 {
            Self::is_supported_fft_len(is_complex, len / 11)
        } else if len % 13 == 0 {
            Self::is_supported_fft_len(is_complex, len / 13)
        } else {
            false
        }
    }

    fn fft(is_complex: bool, source: &[T], target: &mut [T], reverse: bool) {
        if !is_complex {
            panic!("Real fft isn't supported, call `has_gpu_support` first.")
        }
        let len = source.len();
        // Build ocl ProQue
        let prog_bldr = ProgramBuilder::new();
        // clFFT sometimes fails if we try to force it to use a certain device. Therefore
        // we don't set a device in the builder.
        let ocl_pq = ProQue::builder()
            .prog_bldr(prog_bldr)
            .dims([source.len()])
            .build()
            .expect("Building ProQue");

        // Create buffers
        let in_buffer = unsafe {
            Buffer::builder()
                .queue(ocl_pq.queue().clone())
                .flags(MemFlags::new().read_only().copy_host_ptr())
                .len(ocl_pq.dims().clone())
                .use_host_slice(&source)
                .build()
                .expect("Failed to create GPU input buffer")
        };

        let mut res_buffer = Buffer::builder()
            .queue(ocl_pq.queue().clone())
            .flags(MemFlags::new().write_only())
            .len(ocl_pq.dims().clone())
            .build()
            .expect("Failed to create GPU result buffer");

        // Make a plan
        let mut plan = builder::<T>()
            .precision(Precision::Precise)
            .dims([len / 2])
            .input_layout(Layout::ComplexInterleaved)
            .output_layout(Layout::ComplexInterleaved)
            .bake_out_of_place_plan(&ocl_pq)
            .unwrap();

        let direction = if reverse {
            Direction::Backward
        } else {
            Direction::Forward
        };
        // Execute plan
        plan.enq(direction, &in_buffer, &mut res_buffer).unwrap();

        // Wait for calculation to finish and read results
        res_buffer
            .cmd()
            .read(target)
            .enq()
            .expect("Transferring result vector from the GPU back to memory failed");
    }

    fn overlap_discard(
        x_time: &mut [T],
        tmp: &mut [T],
        _: &mut [T],
        h_freq: &[T],
        imp_len: usize,
        step_size: usize,
    ) -> usize {
        let is_f64 = mem::size_of::<T>() == 8;
        let kernel = if is_f64 {
            o64::MUL_KERNEL
        } else {
            o32::MUL_KERNEL
        };
        let fft_len = h_freq.len();
        let x_len = x_time.len();
        // Build ocl ProQue
        let ocl_pq = ProQue::builder()
            .src(kernel)
            .dims([fft_len])
            .build()
            .expect("Building ProQue");

        // Use events to schedule our kernels.
        // When `fft_finish_event` is signaled
        // then `start_mul_event` gets triggered.
        // Also when `mul_finish_event` is signaled
        // then `start_ifft_event` gets triggered.
        // That leads to a schedule where first the FFT
        // is executed, then the multiplication and afterwards
        // the IFFT.
        let mut fft_finish_event = EventList::new();
        let start_mul_event = fft_finish_event.clone();
        let mut mul_finish_event = EventList::new();
        let start_ifft_event = mul_finish_event.clone();
        // Make a plan
        let mut forward_fft = builder::<T>()
            .precision(Precision::Precise)
            .dims([fft_len / 2])
            .input_layout(Layout::ComplexInterleaved)
            .output_layout(Layout::ComplexInterleaved)
            .bake_inplace_plan(&ocl_pq)
            .unwrap();

        forward_fft = forward_fft.enew(&mut fft_finish_event);

        let mut reverse_fft = builder::<T>()
            .precision(Precision::Precise)
            .dims([fft_len / 2])
            .input_layout(Layout::ComplexInterleaved)
            .output_layout(Layout::ComplexInterleaved)
            .bake_inplace_plan(&ocl_pq)
            .unwrap();

        reverse_fft = reverse_fft.ewait(&start_ifft_event);

        let coef_buffer = unsafe {
            Buffer::builder()
                .queue(ocl_pq.queue().clone())
                .flags(MemFlags::new().read_only().copy_host_ptr())
                .len([fft_len])
                .use_host_slice(&h_freq)
                .build()
                .expect("Failed to create GPU input buffer")
        };

        // Execute plan
        let mut position = 0;

        // `prev_buffer` is used to overlap transfer and calculation.
        let mut prev_buffer = {
            let range = position..fft_len + position;
            // Create buffers
            let mut in_buffer = unsafe {
                Buffer::builder()
                    .queue(ocl_pq.queue().clone())
                    .flags(MemFlags::new().read_write().copy_host_ptr())
                    .len([fft_len])
                    .use_host_slice(&x_time[range])
                    .build()
                    .expect("Failed to create GPU input buffer")
            };

            forward_fft
                .enq(Direction::Forward, &mut in_buffer)
                .expect("Enq FFT");

            let mul = ocl_pq
                .kernel_builder("multiply_vector")
                .arg_named("coef", Some(&coef_buffer))
                .arg_named("srcres", Some(&in_buffer))
                .build()
                .unwrap();
            unsafe {
                mul.cmd()
                    .ewait(&start_mul_event)
                    .enew(&mut mul_finish_event)
                    .global_work_size([fft_len / 2])
                    .enq()
                    .expect("Enq Mul")
            };

            reverse_fft
                .enq(Direction::Backward, &mut in_buffer)
                .expect("Enq IFFT");
            (&mut x_time[0..imp_len / 2]).copy_from_slice(&tmp[0..imp_len / 2]);
            position += step_size;
            in_buffer
        };

        while position + fft_len < x_len {
            let range = position..fft_len + position;
            // Create buffers
            let mut in_buffer = unsafe {
                Buffer::builder()
                    .queue(ocl_pq.queue().clone())
                    .flags(MemFlags::new().read_write().copy_host_ptr())
                    .len([fft_len])
                    .use_host_slice(&x_time[range])
                    .build()
                    .expect("Failed to create GPU input buffer")
            };

            forward_fft
                .enq(Direction::Forward, &mut in_buffer)
                .expect("Enq FFT");

            let mul = ocl_pq
                .kernel_builder("multiply_vector")
                .arg_named("coef", Some(&coef_buffer))
                .arg_named("srcres", Some(&in_buffer))
                .build()
                .unwrap();
            unsafe {
                mul.cmd()
                    .ewait(&start_mul_event)
                    .enew(&mut mul_finish_event)
                    .global_work_size([fft_len / 2])
                    .enq()
                    .expect("Enq Mul")
            };

            reverse_fft
                .enq(Direction::Backward, &mut in_buffer)
                .expect("Enq IFFT");

            prev_buffer
                .cmd()
                .read(&mut tmp[..])
                .enq()
                .expect("Transferring result vector from the GPU back to memory failed");
            (&mut x_time[position - step_size + imp_len / 2..position + imp_len / 2])
                .copy_from_slice(&tmp[imp_len - 2..fft_len]);
            prev_buffer = in_buffer;
            position += step_size;
        }
        prev_buffer
            .cmd()
            .read(&mut tmp[..])
            .enq()
            .expect("Transferring result vector from the GPU back to memory failed");
        position
    }
}

/// These testa are only compiled&run with the feature flag `gpu_support`.
/// The tests assume that the machine running the tests has a GPU which at least supports
/// 32bit floating point numbers. However the library can be compiled with enabled GPU support
/// even if the machine doesn't have a suitable GPU.
#[cfg(test)]
mod tests {
    use super::super::super::*;
    use super::super::GpuSupport;
    use super::prepare_impulse_response;
    use std::fmt::Debug;
    use {array_to_complex, array_to_complex_mut};

    fn assert_eq_tol<T>(left: &[T], right: &[T], tol: T)
    where
        T: RealNumber + Debug,
    {
        assert_eq!(left.len(), right.len());
        for i in 0..left.len() {
            if (left[i] - right[i]).abs() > tol {
                panic!("assertion failed: {:?} != {:?}", left, right);
            }
        }
    }

    #[test]
    fn gpu_real_convolution32() {
        assert!(f32::has_gpu_support());

        let source: Vec<f32> = vec![0.2; 1000];
        let mut target = vec![0.0; 1000];
        let imp_resp = vec![0.1; 64];
        let mut source_vec = source.clone().to_real_time_vec();
        let imp_resp_vec = imp_resp.clone().to_real_time_vec();
        let mut buffer = SingleBuffer::new();
        source_vec
            .convolve_signal(&mut buffer, &imp_resp_vec)
            .unwrap();
        let range =
            f32::gpu_convolve_vector(false, &source[..], &mut target[..], &imp_resp[..]).unwrap();
        assert_eq_tol(&target[range.clone()], &source_vec[range.clone()], 1e-6);
    }

    #[test]
    fn gpu_real_convolution64() {
        if !f64::has_gpu_support() {
            // Allow to skip tests on a host without GPU for f64
            return;
        }

        let source: Vec<f64> = vec![0.2; 1000];
        let mut target = vec![0.0; 1000];
        let imp_resp = vec![0.1; 64];
        let mut source_vec = source.clone().to_real_time_vec();
        let imp_resp_vec = imp_resp.clone().to_real_time_vec();
        let mut buffer = SingleBuffer::new();
        source_vec
            .convolve_signal(&mut buffer, &imp_resp_vec)
            .unwrap();
        let range =
            f64::gpu_convolve_vector(false, &source[..], &mut target[..], &imp_resp[..]).unwrap();
        assert_eq_tol(&target[range.clone()], &source_vec[range.clone()], 1e-6);
    }

    #[test]
    fn gpu_complex_convolution32() {
        assert!(f32::has_gpu_support());

        let source = vec![0.2; 1000];
        let mut target = vec![0.0; 1000];
        let imp_resp = vec![0.1; 64];
        let mut source_vec = source.clone().to_complex_time_vec();
        let imp_resp_vec = imp_resp.clone().to_complex_time_vec();
        let mut buffer = SingleBuffer::new();
        source_vec
            .convolve_signal(&mut buffer, &imp_resp_vec)
            .unwrap();
        let range =
            f32::gpu_convolve_vector(true, &source[..], &mut target[..], &imp_resp[..]).unwrap();
        assert_eq_tol(&target[range.clone()], &source_vec[range.clone()], 1e-6);
    }

    #[test]
    fn gpu_complex_convolution64() {
        if !f64::has_gpu_support() {
            // Allow to skip tests on a host without GPU for f64
            return;
        }

        let source: Vec<f64> = vec![0.2; 1000];
        let mut target = vec![0.0; 1000];
        let imp_resp = vec![0.1; 64];
        let mut source_vec = source.clone().to_complex_time_vec();
        let imp_resp_vec = imp_resp.clone().to_complex_time_vec();
        let mut buffer = SingleBuffer::new();
        source_vec
            .convolve_signal(&mut buffer, &imp_resp_vec)
            .unwrap();
        let range =
            f64::gpu_convolve_vector(true, &source[..], &mut target[..], &imp_resp[..]).unwrap();
        assert_eq_tol(&target[range.clone()], &source_vec[range.clone()], 1e-6);
    }

    #[test]
    fn gpu_prepare_real_impulse_response() {
        let imp_resp = [1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0];
        let mut padded = vec![0.0; 8 * 2];
        prepare_impulse_response(&imp_resp, &mut padded, 2);
        // Explanation of the result:
        // The data is chunked in pairs since `vec_len` is 2. So that means the data is
        // put into a format so that if the GPU loads a vector of size 2 it always
        // loads a correct value. If there is not enough data to form a pair then a zero is added.
        //
        // The convolution requires that the we iterate through the impulse response in
        // reversed order. However for some systems its faster to access data in forward order
        // (e.g. because of cache prediction). So that the reason why the result here is already
        // inverted.
        //
        // Finally every second pair is shifted by one byte. That's because the previous steps
        // mean that we can only access the `vec_len` samples at once, but to calculate
        // the convolution we need to access every sample. The shifted version give us that
        let expected = [
            7.0, 6.0, 0.0, 7.0, 5.0, 4.0, 6.0, 5.0, 3.0, 2.0, 4.0, 3.0, 1.0, 0.0, 2.0, 1.0,
        ];
        assert_eq_tol(&padded, &expected, 1e-6);
    }

    #[test]
    fn gpu_prepare_complex_impulse_response() {
        let imp_resp = [1.0, 2.0, 3.0, 4.0, 5.0, 6.0];
        let mut padded = vec![0.0; 8 * 2];
        prepare_impulse_response(
            array_to_complex(&imp_resp),
            array_to_complex_mut(&mut padded),
            2,
        );
        let expected = [
            5.0, 6.0, 3.0, 4.0, 0.0, 0.0, 5.0, 6.0, 1.0, 2.0, 0.0, 0.0, 3.0, 4.0, 1.0, 2.0,
        ];
        assert_eq_tol(&padded, &expected, 1e-6);
    }
}