avfft.h
Go to the documentation of this file.
1 /*
2  * This file is part of Libav.
3  *
4  * Libav 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  * Libav 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 Libav; 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 typedef float FFTSample;
23 
24 typedef struct FFTComplex {
26 } FFTComplex;
27 
28 typedef struct FFTContext FFTContext;
29 
36 
41 
46 void av_fft_calc(FFTContext *s, FFTComplex *z);
47 
48 void av_fft_end(FFTContext *s);
49 
50 FFTContext *av_mdct_init(int nbits, int inverse, double scale);
51 void av_imdct_calc(FFTContext *s, FFTSample *output, const FFTSample *input);
52 void av_imdct_half(FFTContext *s, FFTSample *output, const FFTSample *input);
53 void av_mdct_calc(FFTContext *s, FFTSample *output, const FFTSample *input);
54 void av_mdct_end(FFTContext *s);
55 
56 /* Real Discrete Fourier Transform */
57 
63 };
64 
65 typedef struct RDFTContext RDFTContext;
66 
74 void av_rdft_end(RDFTContext *s);
75 
76 /* Discrete Cosine Transform */
77 
78 typedef struct DCTContext DCTContext;
79 
81  DCT_II = 0,
85 };
86 
97 void av_dct_end (DCTContext *s);
98 
99 #endif /* AVCODEC_AVFFT_H */
int nbits
Definition: rdft.h:52
void av_mdct_calc(FFTContext *s, FFTSample *output, const FFTSample *input)
void av_rdft_end(RDFTContext *s)
Definition: avfft.h:59
Definition: avfft.h:60
FFTSample re
Definition: avfft.h:25
Definition: avfft.h:84
Definition: avfft.h:82
int nbits
Definition: dct.h:30
const char data[16]
Definition: mxf.c:60
void av_dct_calc(DCTContext *s, FFTSample *data)
Definition: avfft.h:83
void av_imdct_half(FFTContext *s, FFTSample *output, const FFTSample *input)
void av_fft_end(FFTContext *s)
Definition: avfft.c:47
void av_mdct_end(FFTContext *s)
Definition: fft.h:62
DCTTransformType
Definition: avfft.h:80
int nbits
Definition: fft.h:63
void av_fft_permute(FFTContext *s, FFTComplex *z)
Do the permutation needed BEFORE calling ff_fft_calc().
Definition: avfft.c:37
Definition: dct.h:29
FFTContext * av_mdct_init(int nbits, int inverse, double scale)
Definition: avfft.h:61
Definition: avfft.h:62
FFTContext * av_fft_init(int nbits, int inverse)
Set up a complex FFT.
Definition: avfft.c:27
RDFTContext * av_rdft_init(int nbits, enum RDFTransformType trans)
Set up a real FFT.
void av_imdct_calc(FFTContext *s, FFTSample *output, const FFTSample *input)
static const uint16_t scale[4]
DCTContext * av_dct_init(int nbits, enum DCTTransformType type)
Set up DCT.
struct FFTComplex FFTComplex
void av_fft_calc(FFTContext *s, FFTComplex *z)
Do a complex FFT with the parameters defined in av_fft_init().
Definition: avfft.c:42
FFTSample im
Definition: avfft.h:25
static uint32_t inverse(uint32_t v)
find multiplicative inverse modulo 2 ^ 32
Definition: asfcrypt.c:35
Definition: avfft.h:81
RDFTransformType
Definition: avfft.h:58
void av_dct_end(DCTContext *s)
void av_rdft_calc(RDFTContext *s, FFTSample *data)
float FFTSample
Definition: avfft.h:22