FFmpeg
fft.h
Go to the documentation of this file.
1 /*
2  * Copyright (c) 2000, 2001, 2002 Fabrice Bellard
3  * Copyright (c) 2002-2004 Michael Niedermayer <michaelni@gmx.at>
4  *
5  * This file is part of FFmpeg.
6  *
7  * FFmpeg 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.
11  *
12  * FFmpeg 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.
16  *
17  * You should have received a copy of the GNU Lesser General Public
18  * License along with FFmpeg; if not, write to the Free Software
19  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
20  */
21 
22 #ifndef AVCODEC_FFT_H
23 #define AVCODEC_FFT_H
24 
25 #ifndef FFT_FLOAT
26 #define FFT_FLOAT 1
27 #endif
28 
29 #include <stdint.h>
30 #include "config.h"
31 
32 #include "libavutil/mem_internal.h"
33 
34 #if FFT_FLOAT
35 
36 #include "avfft.h"
37 
38 #define FFT_NAME(x) x
39 
40 typedef float FFTDouble;
41 
42 #else
43 
44 #define Q31(x) (int)((x)*2147483648.0 + 0.5)
45 #define FFT_NAME(x) x ## _fixed_32
46 
47 typedef int32_t FFTSample;
48 
49 typedef struct FFTComplex {
50  FFTSample re, im;
51 } FFTComplex;
52 
53 typedef int FFTDouble;
54 typedef struct FFTContext FFTContext;
55 
56 #endif /* FFT_FLOAT */
57 
58 typedef struct FFTDComplex {
60 } FFTDComplex;
61 
62 /* FFT computation */
63 
68 };
69 
73 };
74 
75 struct FFTContext {
76  int nbits;
77  int inverse;
78  uint16_t *revtab;
80  int mdct_size; /* size of MDCT (i.e. number of input data * 2) */
81  int mdct_bits; /* n = 2^nbits */
82  /* pre/post rotation tables */
85  /**
86  * Do the permutation needed BEFORE calling fft_calc().
87  */
88  void (*fft_permute)(struct FFTContext *s, FFTComplex *z);
89  /**
90  * Do a complex FFT with the parameters defined in ff_fft_init(). The
91  * input data must be permuted before. No 1.0/sqrt(n) normalization is done.
92  */
93  void (*fft_calc)(struct FFTContext *s, FFTComplex *z);
94  void (*imdct_calc)(struct FFTContext *s, FFTSample *output, const FFTSample *input);
95  void (*imdct_half)(struct FFTContext *s, FFTSample *output, const FFTSample *input);
96  void (*mdct_calc)(struct FFTContext *s, FFTSample *output, const FFTSample *input);
99  uint32_t *revtab32;
100 };
101 
102 #if CONFIG_HARDCODED_TABLES
103 #define COSTABLE_CONST const
104 #define ff_init_ff_cos_tabs(index)
105 #else
106 #define COSTABLE_CONST
107 #define ff_init_ff_cos_tabs FFT_NAME(ff_init_ff_cos_tabs)
108 
109 /**
110  * Initialize the cosine table in ff_cos_tabs[index]
111  * @param index index in ff_cos_tabs array of the table to initialize
112  */
113 void ff_init_ff_cos_tabs(int index);
114 #endif
115 
116 #define COSTABLE(size) \
117  COSTABLE_CONST DECLARE_ALIGNED(32, FFTSample, FFT_NAME(ff_cos_##size))[size/2]
118 
119 extern COSTABLE(16);
120 extern COSTABLE(32);
121 extern COSTABLE(64);
122 extern COSTABLE(128);
123 extern COSTABLE(256);
124 extern COSTABLE(512);
125 extern COSTABLE(1024);
126 extern COSTABLE(2048);
127 extern COSTABLE(4096);
128 extern COSTABLE(8192);
129 extern COSTABLE(16384);
130 extern COSTABLE(32768);
131 extern COSTABLE(65536);
132 extern COSTABLE(131072);
133 extern COSTABLE_CONST FFTSample* const FFT_NAME(ff_cos_tabs)[18];
134 
135 #define ff_fft_init FFT_NAME(ff_fft_init)
136 #define ff_fft_end FFT_NAME(ff_fft_end)
137 
138 /**
139  * Set up a complex FFT.
140  * @param nbits log2 of the length of the input array
141  * @param inverse if 0 perform the forward transform, if 1 perform the inverse
142  */
143 int ff_fft_init(FFTContext *s, int nbits, int inverse);
144 
150 
151 void ff_fft_end(FFTContext *s);
152 
153 #define ff_mdct_init FFT_NAME(ff_mdct_init)
154 #define ff_mdct_end FFT_NAME(ff_mdct_end)
155 
156 int ff_mdct_init(FFTContext *s, int nbits, int inverse, double scale);
157 void ff_mdct_end(FFTContext *s);
158 
159 #endif /* AVCODEC_FFT_H */
FFTContext::revtab
uint16_t * revtab
Definition: fft.h:78
ff_fft_init
#define ff_fft_init
Definition: fft.h:135
ff_fft_init_ppc
void ff_fft_init_ppc(FFTContext *s)
Definition: fft_init.c:152
ff_init_ff_cos_tabs
#define ff_init_ff_cos_tabs
Definition: fft.h:107
FFTContext::tcos
FFTSample * tcos
Definition: fft.h:83
mem_internal.h
output
filter_frame For filters that do not use the this method is called when a frame is pushed to the filter s input It can be called at any time except in a reentrant way If the input frame is enough to produce output
Definition: filter_design.txt:225
FFTContext::mdct_calc
void(* mdct_calc)(struct FFTContext *s, FFTSample *output, const FFTSample *input)
Definition: fft.h:96
index
fg index
Definition: ffmpeg_filter.c:168
FFTDComplex
Definition: fft.h:58
ff_mdct_init
#define ff_mdct_init
Definition: fft.h:153
FFTContext::inverse
int inverse
Definition: fft.h:77
FF_FFT_PERM_SWAP_LSBS
@ FF_FFT_PERM_SWAP_LSBS
Definition: fft.h:66
FF_FFT_PERM_DEFAULT
@ FF_FFT_PERM_DEFAULT
Definition: fft.h:65
FFTContext::tmp_buf
FFTComplex * tmp_buf
Definition: fft.h:79
FFT_NAME
#define FFT_NAME(x)
Definition: fft.h:38
FFTContext::revtab32
uint32_t * revtab32
Definition: fft.h:99
s
#define s(width, name)
Definition: cbs_vp9.c:257
ff_fft_init_x86
void ff_fft_init_x86(FFTContext *s)
Definition: fft_init.c:27
FFTContext::fft_permutation
enum fft_permutation_type fft_permutation
Definition: fft.h:97
mdct_permutation_type
mdct_permutation_type
Definition: fft.h:70
ff_fft_end
#define ff_fft_end
Definition: fft.h:136
FFTContext::mdct_permutation
enum mdct_permutation_type mdct_permutation
Definition: fft.h:98
COSTABLE_CONST
#define COSTABLE_CONST
Definition: fft.h:106
FFTDComplex::re
FFTDouble re
Definition: fft.h:59
FFTSample
float FFTSample
Definition: avfft.h:35
avfft.h
FFTComplex
void FFTComplex
Definition: tx_priv.h:43
FFTContext::imdct_half
void(* imdct_half)(struct FFTContext *s, FFTSample *output, const FFTSample *input)
Definition: fft.h:95
FFTContext::imdct_calc
void(* imdct_calc)(struct FFTContext *s, FFTSample *output, const FFTSample *input)
Definition: fft.h:94
FFTContext::nbits
int nbits
Definition: fft.h:76
COSTABLE
#define COSTABLE(size)
Definition: fft.h:116
ff_mdct_end
#define ff_mdct_end
Definition: fft.h:154
FFTContext::fft_permute
void(* fft_permute)(struct FFTContext *s, FFTComplex *z)
Do the permutation needed BEFORE calling fft_calc().
Definition: fft.h:88
FFTComplex::im
FFTSample im
Definition: avfft.h:38
ff_fft_init_mips
void ff_fft_init_mips(FFTContext *s)
FFT transform.
Definition: fft_mips.c:502
FFTComplex::re
FFTSample re
Definition: avfft.h:38
FFTDouble
float FFTDouble
Definition: fft.h:40
FFTContext::fft_calc
void(* fft_calc)(struct FFTContext *s, FFTComplex *z)
Do a complex FFT with the parameters defined in ff_fft_init().
Definition: fft.h:93
input
and forward the test the status of outputs and forward it to the corresponding return FFERROR_NOT_READY If the filters stores internally one or a few frame for some input
Definition: filter_design.txt:172
FFTContext::mdct_size
int mdct_size
Definition: fft.h:80
FFTContext
Definition: fft.h:75
FF_MDCT_PERM_INTERLEAVE
@ FF_MDCT_PERM_INTERLEAVE
Definition: fft.h:72
ff_fft_init_arm
void ff_fft_init_arm(FFTContext *s)
Definition: fft_init_arm.c:38
fft_permutation_type
fft_permutation_type
Definition: fft.h:64
FFTContext::tsin
FFTSample * tsin
Definition: fft.h:84
inverse
static int inverse(AudioFWTDNContext *s, double **in, int *in_length, double *out, int out_length, int ch, uint64_t sn)
Definition: af_afwtdn.c:779
ff_fft_init_aarch64
void ff_fft_init_aarch64(FFTContext *s)
Definition: fft_init_aarch64.c:36
FF_MDCT_PERM_NONE
@ FF_MDCT_PERM_NONE
Definition: fft.h:71
FFTContext::mdct_bits
int mdct_bits
Definition: fft.h:81
int32_t
int32_t
Definition: audioconvert.c:56
FFTDComplex::im
FFTDouble im
Definition: fft.h:59
FF_FFT_PERM_AVX
@ FF_FFT_PERM_AVX
Definition: fft.h:67
FFTComplex
Definition: avfft.h:37