From ccdaca80c910047e16f710d44f640a6d6f86a195 Mon Sep 17 00:00:00 2001
From: Chris Robinson <chris.kcat@gmail.com>
Date: Sat, 17 Nov 2018 04:14:57 -0800
Subject: Use standard complex types instead of custom
---
common/alcomplex.c | 122 -----------------------------------------------------
1 file changed, 122 deletions(-)
delete mode 100644 common/alcomplex.c
(limited to 'common/alcomplex.c')
diff --git a/common/alcomplex.c b/common/alcomplex.c
deleted file mode 100644
index 851f4105..00000000
--- a/common/alcomplex.c
+++ /dev/null
@@ -1,122 +0,0 @@
-
-#include "config.h"
-
-#include "alcomplex.h"
-#include "math_defs.h"
-
-
-/** Addition of two complex numbers. */
-static inline ALcomplex complex_add(ALcomplex a, ALcomplex b)
-{
- ALcomplex result;
-
- result.Real = a.Real + b.Real;
- result.Imag = a.Imag + b.Imag;
-
- return result;
-}
-
-/** Subtraction of two complex numbers. */
-static inline ALcomplex complex_sub(ALcomplex a, ALcomplex b)
-{
- ALcomplex result;
-
- result.Real = a.Real - b.Real;
- result.Imag = a.Imag - b.Imag;
-
- return result;
-}
-
-/** Multiplication of two complex numbers. */
-static inline ALcomplex complex_mult(ALcomplex a, ALcomplex b)
-{
- ALcomplex result;
-
- result.Real = a.Real*b.Real - a.Imag*b.Imag;
- result.Imag = a.Imag*b.Real + a.Real*b.Imag;
-
- return result;
-}
-
-
-void complex_fft(ALcomplex *FFTBuffer, ALsizei FFTSize, ALdouble Sign)
-{
- ALsizei i, j, k, mask, step, step2;
- ALcomplex temp, u, w;
- ALdouble arg;
-
- /* Bit-reversal permutation applied to a sequence of FFTSize items */
- for(i = 1;i < FFTSize-1;i++)
- {
- for(mask = 0x1, j = 0;mask < FFTSize;mask <<= 1)
- {
- if((i&mask) != 0)
- j++;
- j <<= 1;
- }
- j >>= 1;
-
- if(i < j)
- {
- temp = FFTBuffer[i];
- FFTBuffer[i] = FFTBuffer[j];
- FFTBuffer[j] = temp;
- }
- }
-
- /* Iterative form of Danielson–Lanczos lemma */
- for(i = 1, step = 2;i < FFTSize;i<<=1, step<<=1)
- {
- step2 = step >> 1;
- arg = M_PI / step2;
-
- w.Real = cos(arg);
- w.Imag = sin(arg) * Sign;
-
- u.Real = 1.0;
- u.Imag = 0.0;
-
- for(j = 0;j < step2;j++)
- {
- for(k = j;k < FFTSize;k+=step)
- {
- temp = complex_mult(FFTBuffer[k+step2], u);
- FFTBuffer[k+step2] = complex_sub(FFTBuffer[k], temp);
- FFTBuffer[k] = complex_add(FFTBuffer[k], temp);
- }
-
- u = complex_mult(u, w);
- }
- }
-}
-
-void complex_hilbert(ALcomplex *Buffer, ALsizei size)
-{
- const ALdouble inverse_size = 1.0/(ALdouble)size;
- ALsizei todo, i;
-
- for(i = 0;i < size;i++)
- Buffer[i].Imag = 0.0;
-
- complex_fft(Buffer, size, 1.0);
-
- todo = size >> 1;
- Buffer[0].Real *= inverse_size;
- Buffer[0].Imag *= inverse_size;
- for(i = 1;i < todo;i++)
- {
- Buffer[i].Real *= 2.0*inverse_size;
- Buffer[i].Imag *= 2.0*inverse_size;
- }
- Buffer[i].Real *= inverse_size;
- Buffer[i].Imag *= inverse_size;
- i++;
-
- for(;i < size;i++)
- {
- Buffer[i].Real = 0.0;
- Buffer[i].Imag = 0.0;
- }
-
- complex_fft(Buffer, size, -1.0);
-}
--
cgit v1.2.3