2 * Copyright (c) 2000, 2001, 2002 Fabrice Bellard
3 * Copyright (c) 2002-2004 Michael Niedermayer <michaelni@gmx.at>
5 * This file is part of Libav.
7 * Libav is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU Lesser General Public
9 * License as published by the Free Software Foundation; either
10 * version 2.1 of the License, or (at your option) any later version.
12 * Libav is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * Lesser General Public License for more details.
17 * You should have received a copy of the GNU Lesser General Public
18 * License along with Libav; if not, write to the Free Software
19 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
25 #ifndef CONFIG_FFT_FLOAT
26 #define CONFIG_FFT_FLOAT 1
31 #include "libavutil/mem.h"
39 typedef float FFTDouble;
43 #define FFT_NAME(x) x ## _fixed
45 typedef int16_t FFTSample;
46 typedef int FFTDouble;
48 typedef struct FFTComplex {
52 typedef struct FFTContext FFTContext;
54 #endif /* CONFIG_FFT_FLOAT */
56 typedef struct FFTDComplex {
67 int mdct_size; /* size of MDCT (i.e. number of input data * 2) */
68 int mdct_bits; /* n = 2^nbits */
69 /* pre/post rotation tables */
73 * Do the permutation needed BEFORE calling fft_calc().
75 void (*fft_permute)(struct FFTContext *s, FFTComplex *z);
77 * Do a complex FFT with the parameters defined in ff_fft_init(). The
78 * input data must be permuted before. No 1.0/sqrt(n) normalization is done.
80 void (*fft_calc)(struct FFTContext *s, FFTComplex *z);
81 void (*imdct_calc)(struct FFTContext *s, FFTSample *output, const FFTSample *input);
82 void (*imdct_half)(struct FFTContext *s, FFTSample *output, const FFTSample *input);
83 void (*mdct_calc)(struct FFTContext *s, FFTSample *output, const FFTSample *input);
84 void (*mdct_calcw)(struct FFTContext *s, FFTDouble *output, const FFTSample *input);
86 #define FF_FFT_PERM_DEFAULT 0
87 #define FF_FFT_PERM_SWAP_LSBS 1
88 #define FF_FFT_PERM_AVX 2
90 #define FF_MDCT_PERM_NONE 0
91 #define FF_MDCT_PERM_INTERLEAVE 1
94 #if CONFIG_HARDCODED_TABLES
95 #define COSTABLE_CONST const
97 #define COSTABLE_CONST
100 #define COSTABLE(size) \
101 COSTABLE_CONST DECLARE_ALIGNED(32, FFTSample, FFT_NAME(ff_cos_##size))[size/2]
106 extern COSTABLE(128);
107 extern COSTABLE(256);
108 extern COSTABLE(512);
109 extern COSTABLE(1024);
110 extern COSTABLE(2048);
111 extern COSTABLE(4096);
112 extern COSTABLE(8192);
113 extern COSTABLE(16384);
114 extern COSTABLE(32768);
115 extern COSTABLE(65536);
116 extern COSTABLE_CONST FFTSample* const FFT_NAME(ff_cos_tabs)[17];
118 #define ff_init_ff_cos_tabs FFT_NAME(ff_init_ff_cos_tabs)
121 * Initialize the cosine table in ff_cos_tabs[index]
122 * @param index index in ff_cos_tabs array of the table to initialize
124 void ff_init_ff_cos_tabs(int index);
126 #define ff_fft_init FFT_NAME(ff_fft_init)
127 #define ff_fft_end FFT_NAME(ff_fft_end)
130 * Set up a complex FFT.
131 * @param nbits log2 of the length of the input array
132 * @param inverse if 0 perform the forward transform, if 1 perform the inverse
134 int ff_fft_init(FFTContext *s, int nbits, int inverse);
137 void ff_fft_init_altivec(FFTContext *s);
138 void ff_fft_init_mmx(FFTContext *s);
139 void ff_fft_init_arm(FFTContext *s);
141 void ff_fft_fixed_init_arm(FFTContext *s);
144 void ff_fft_end(FFTContext *s);
146 #define ff_mdct_init FFT_NAME(ff_mdct_init)
147 #define ff_mdct_end FFT_NAME(ff_mdct_end)
149 int ff_mdct_init(FFTContext *s, int nbits, int inverse, double scale);
150 void ff_mdct_end(FFTContext *s);
152 #endif /* AVCODEC_FFT_H */