Mercurial > libavcodec.hg

comparison fft.h @ 12024:fdafbcef52f5 libavcodec

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Fix grammar errors in documentation
author mru
date Wed, 30 Jun 2010 15:38:06 +0000
parents 052b9c58ccc4
children 3f3d08bb5cf8
comparison
equal deleted inserted replaced
12023:c7455450364d 12024:fdafbcef52f5
82 extern COSTABLE(32768); 82 extern COSTABLE(32768);
83 extern COSTABLE(65536); 83 extern COSTABLE(65536);
84 extern COSTABLE_CONST FFTSample* const ff_cos_tabs[17]; 84 extern COSTABLE_CONST FFTSample* const ff_cos_tabs[17];
85 85
86 /** 86 /**
87 * Initializes the cosine table in ff_cos_tabs[index] 87 * Initialize the cosine table in ff_cos_tabs[index]
88 * \param index index in ff_cos_tabs array of the table to initialize 88 * \param index index in ff_cos_tabs array of the table to initialize
89 */ 89 */
90 void ff_init_ff_cos_tabs(int index); 90 void ff_init_ff_cos_tabs(int index);
91 91
92 extern SINTABLE(16); 92 extern SINTABLE(16);
102 extern SINTABLE(16384); 102 extern SINTABLE(16384);
103 extern SINTABLE(32768); 103 extern SINTABLE(32768);
104 extern SINTABLE(65536); 104 extern SINTABLE(65536);
105 105
106 /** 106 /**
107 * Sets up a complex FFT. 107 * Set up a complex FFT.
108 * @param nbits log2 of the length of the input array 108 * @param nbits log2 of the length of the input array
109 * @param inverse if 0 perform the forward transform, if 1 perform the inverse 109 * @param inverse if 0 perform the forward transform, if 1 perform the inverse
110 */ 110 */
111 int ff_fft_init(FFTContext *s, int nbits, int inverse); 111 int ff_fft_init(FFTContext *s, int nbits, int inverse);
112 void ff_fft_permute_c(FFTContext *s, FFTComplex *z); 112 void ff_fft_permute_c(FFTContext *s, FFTComplex *z);
203 FFTContext fft; 203 FFTContext fft;
204 void (*rdft_calc)(struct RDFTContext *s, FFTSample *z); 204 void (*rdft_calc)(struct RDFTContext *s, FFTSample *z);
205 }; 205 };
206 206
207 /** 207 /**
208 * Sets up a real FFT. 208 * Set up a real FFT.
209 * @param nbits log2 of the length of the input array 209 * @param nbits log2 of the length of the input array
210 * @param trans the type of transform 210 * @param trans the type of transform
211 */ 211 */
212 int ff_rdft_init(RDFTContext *s, int nbits, enum RDFTransformType trans); 212 int ff_rdft_init(RDFTContext *s, int nbits, enum RDFTransformType trans);
213 void ff_rdft_end(RDFTContext *s); 213 void ff_rdft_end(RDFTContext *s);
229 FFTSample *csc2; 229 FFTSample *csc2;
230 void (*dct_calc)(struct DCTContext *s, FFTSample *data); 230 void (*dct_calc)(struct DCTContext *s, FFTSample *data);
231 }; 231 };
232 232
233 /** 233 /**
234 * Sets up DCT. 234 * Set up DCT.
235 * @param nbits size of the input array: 235 * @param nbits size of the input array:
236 * (1 << nbits) for DCT-II, DCT-III and DST-I 236 * (1 << nbits) for DCT-II, DCT-III and DST-I
237 * (1 << nbits) + 1 for DCT-I 237 * (1 << nbits) + 1 for DCT-I
238 * 238 *
239 * @note the first element of the input of DST-I is ignored 239 * @note the first element of the input of DST-I is ignored