mirror of
https://gitlab.freedesktop.org/pipewire/pipewire.git
synced 2025-11-01 22:58:50 -04:00
a57f2f25b6
Use a wrap around delay ringbuffer. We can then avoid some modulo arithmetic and read more efficiently. Also handle the delay convolver case better by reversing the taps and reading the taps and delay buffer without extra overhead.
57 lines
1 KiB
C
57 lines
1 KiB
C
/* Hilbert function */
|
|
/* SPDX-FileCopyrightText: Copyright © 2021 Wim Taymans */
|
|
/* SPDX-License-Identifier: MIT */
|
|
|
|
#ifndef HILBERT_H
|
|
#define HILBERT_H
|
|
|
|
#ifdef __cplusplus
|
|
extern "C" {
|
|
#endif
|
|
|
|
#include <errno.h>
|
|
#include <stddef.h>
|
|
#include <math.h>
|
|
|
|
|
|
static inline void blackman_window(float *taps, int n_taps)
|
|
{
|
|
int n;
|
|
for (n = 0; n < n_taps; n++) {
|
|
float w = 2.0f * (float)M_PI * n / (n_taps-1);
|
|
taps[n] = 0.3635819f - 0.4891775f * cosf(w)
|
|
+ 0.1365995f * cosf(2 * w) - 0.0106411f * cosf(3 * w);
|
|
}
|
|
}
|
|
|
|
static inline int hilbert_generate(float *taps, int n_taps)
|
|
{
|
|
int i;
|
|
|
|
if ((n_taps & 1) == 0)
|
|
return -EINVAL;
|
|
|
|
for (i = 0; i < n_taps; i++) {
|
|
int k = -(n_taps / 2) + i;
|
|
if (k & 1) {
|
|
float pk = (float)M_PI * k;
|
|
taps[i] *= (1.0f - cosf(pk)) / pk;
|
|
} else {
|
|
taps[i] = 0.0f;
|
|
}
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
static inline void reverse_taps(float *taps, int n_taps)
|
|
{
|
|
int i;
|
|
for (i = 0; i < n_taps/2; i++)
|
|
SPA_SWAP(taps[i], taps[n_taps-1-i]);
|
|
}
|
|
|
|
#ifdef __cplusplus
|
|
} /* extern "C" */
|
|
#endif
|
|
|
|
#endif /* HILBERT_H */
|