avfft.h
Go to the documentation of this file.
1 /*
2  * This file is part of FFmpeg.
3  *
4  * FFmpeg is free software; you can redistribute it and/or
5  * modify it under the terms of the GNU Lesser General Public
6  * License as published by the Free Software Foundation; either
7  * version 2.1 of the License, or (at your option) any later version.
8  *
9  * FFmpeg is distributed in the hope that it will be useful,
10  * but WITHOUT ANY WARRANTY; without even the implied warranty of
11  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12  * Lesser General Public License for more details.
13  *
14  * You should have received a copy of the GNU Lesser General Public
15  * License along with FFmpeg; if not, write to the Free Software
16  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
17  */
18 
19 #ifndef AVCODEC_AVFFT_H
20 #define AVCODEC_AVFFT_H
21 
22 /**
23  * @file
24  * @ingroup lavc_fft
25  * FFT functions
26  */
27 
28 /**
29  * @defgroup lavc_fft FFT functions
30  * @ingroup lavc_misc
31  *
32  * @{
33  */
34 
35 typedef float FFTSample;
36 
37 typedef struct FFTComplex {
39 } FFTComplex;
40 
41 typedef struct FFTContext FFTContext;
42 
43 /**
44  * Set up a complex FFT.
45  * @param nbits log2 of the length of the input array
46  * @param inverse if 0 perform the forward transform, if 1 perform the inverse
47  */
49 
50 /**
51  * Do the permutation needed BEFORE calling ff_fft_calc().
52  */
54 
55 /**
56  * Do a complex FFT with the parameters defined in av_fft_init(). The
57  * input data must be permuted before. No 1.0/sqrt(n) normalization is done.
58  */
60 
61 void av_fft_end(FFTContext *s);
62 
63 FFTContext *av_mdct_init(int nbits, int inverse, double scale);
67 void av_mdct_end(FFTContext *s);
68 
69 /* Real Discrete Fourier Transform */
70 
76 };
77 
78 typedef struct RDFTContext RDFTContext;
79 
80 /**
81  * Set up a real FFT.
82  * @param nbits log2 of the length of the input array
83  * @param trans the type of transform
84  */
88 
89 /* Discrete Cosine Transform */
90 
91 typedef struct DCTContext DCTContext;
92 
94  DCT_II = 0,
98 };
99 
100 /**
101  * Set up DCT.
102  * @param nbits size of the input array:
103  * (1 << nbits) for DCT-II, DCT-III and DST-I
104  * (1 << nbits) + 1 for DCT-I
105  *
106  * @note the first element of the input of DST-I is ignored
107  */
110 void av_dct_end (DCTContext *s);
111 
112 /**
113  * @}
114  */
115 
116 #endif /* AVCODEC_AVFFT_H */
const char * s
Definition: avisynth_c.h:668
int nbits
Definition: rdft.h:52
Definition: avfft.h:75
void av_fft_end(FFTContext *s)
Definition: avfft.c:47
void av_mdct_end(FFTContext *s)
Definition: avfft.h:95
FFTContext * av_mdct_init(int nbits, int inverse, double scale)
DCTContext * av_dct_init(int nbits, enum DCTTransformType type)
Set up DCT.
FFTSample re
Definition: avfft.h:38
void av_fft_permute(FFTContext *s, FFTComplex *z)
Do the permutation needed BEFORE calling ff_fft_calc().
Definition: avfft.c:37
int nbits
Definition: dct.h:32
RDFTransformType
Definition: avfft.h:71
void av_imdct_half(FFTContext *s, FFTSample *output, const FFTSample *input)
DCTTransformType
Definition: avfft.h:93
Spectrum Plot time data
these buffered frames must be flushed immediately if a new input produces new the filter must not call request_frame to get more It must just process the frame or queue it The task of requesting more frames is left to the filter s request_frame method or the application If a filter has several the filter must be ready for frames arriving randomly on any input any filter with several inputs will most likely require some kind of queuing mechanism It is perfectly acceptable to have a limited queue and to drop frames when the inputs are too unbalanced request_frame This method is called when a frame is wanted on an output For an input
Definition: avfft.h:73
FFTContext * av_fft_init(int nbits, int inverse)
Set up a complex FFT.
Definition: avfft.c:27
float FFTSample
Definition: avfft.h:35
void av_rdft_calc(RDFTContext *s, FFTSample *data)
Definition: fft.h:62
Definition: avfft.h:97
int nbits
Definition: fft.h:63
Definition: dct.h:31
Definition: avfft.h:72
void av_rdft_end(RDFTContext *s)
RDFTContext * av_rdft_init(int nbits, enum RDFTransformType trans)
Set up a real FFT.
Definition: avfft.h:74
void av_imdct_calc(FFTContext *s, FFTSample *output, const FFTSample *input)
struct FFTComplex FFTComplex
void av_dct_end(DCTContext *s)
#define type
FFTSample im
Definition: avfft.h:38
these buffered frames must be flushed immediately if a new input produces new output(Example:frame rate-doubling filter:filter_frame must(1) flush the second copy of the previous frame, if it is still there,(2) push the first copy of the incoming frame,(3) keep the second copy for later.) If the input frame is not enough to produce output
Same thing on a dB scale
Definition: avfft.h:94
void av_dct_calc(DCTContext *s, FFTSample *data)
void av_mdct_calc(FFTContext *s, FFTSample *output, const FFTSample *input)
static uint32_t inverse(uint32_t v)
find multiplicative inverse modulo 2 ^ 32
Definition: asfcrypt.c:35
Definition: avfft.h:96
void av_fft_calc(FFTContext *s, FFTComplex *z)
Do a complex FFT with the parameters defined in av_fft_init().
Definition: avfft.c:42