aboutsummaryrefslogtreecommitdiff
path: root/fft.c
blob: 84e8a9599de710d4e9a5c8c948a72cca0a30b299 (plain)
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
/* $Id$ */
/*
 * Copyright (c) 2010 Dimitri Sokolyuk <demon@dim13.org>
 *
 * Permission to use, copy, modify, and distribute this software for any
 * purpose with or without fee is hereby granted, provided that the above
 * copyright notice and this permission notice appear in all copies.
 *
 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
 * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
 */

#include <assert.h>
#include <stdint.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <complex.h>		/* must be prior fftw3 */
#include <fftw3.h>

#include "fft.h"

static fftw_plan plan;
static fftw_complex *out;
static double	*in;
static size_t	sz;
static double	*window;
static double	*sq;

static double *
hamming(size_t n)
{
	double	alpha = 0.53836;
	double	beta = 1.0 - alpha;
	double	*p;
	int	i;

	p = calloc(n, sizeof(double));
	assert(p);

	for (i = 0; i < n; i++) {
		p[i] = alpha - beta * cos(2 * M_PI * i / (n - 1));
		p[i] /= INT16_MAX;
	}

	return p;
}

static double *
squares(size_t n)
{
	double	*p;
	int	i;

	p = calloc(n, sizeof(double));
	assert(p);

	for (i = 0; i < n; i++)
		p[i] = sqrt(i + 1);

	return p;
}

int
init_fft(size_t maxn, size_t n)
{
	in = fftw_malloc(maxn * sizeof(double));
	out = fftw_malloc(maxn * sizeof(fftw_complex) / 2);
	assert(in && out);

	plan = fftw_plan_dft_r2c_1d(n, in, out, FFTW_MEASURE);
	window = hamming(n);
	sq = squares(n / 2);
	sz = n;

	return 0;
}

int
exec_fft(double *io)
{
	int	i;

	for (i = 0; i < sz; i++)
		in[i] = window[i] * io[i];

	fftw_execute(plan);

	for (i = 0; i < sz / 2; i++)
		io[i] = sq[i] * cabs(out[i]);

	return 0;
}

void
free_fft(void)
{
	fftw_free(in);
	fftw_free(out);
	free(window);
	free(sq);
}