From 8f05c995fd5dac7be01f24382687a944e1105d76 Mon Sep 17 00:00:00 2001 From: Alex Converse Date: Thu, 22 Jan 2009 19:46:23 +0000 Subject: Clean up FFT related comments. Originally committed as revision 16721 to svn://svn.ffmpeg.org/ffmpeg/trunk --- libavcodec/fft.c | 12 ------------ 1 file changed, 12 deletions(-) (limited to 'libavcodec/fft.c') diff --git a/libavcodec/fft.c b/libavcodec/fft.c index 77a4efae40..03301d81b2 100644 --- a/libavcodec/fft.c +++ b/libavcodec/fft.c @@ -58,10 +58,6 @@ static int split_radix_permutation(int i, int n, int inverse) else return split_radix_permutation(i, m, inverse)*4 - 1; } -/** - * The size of the FFT is 2^nbits. If inverse is TRUE, inverse FFT is - * done - */ int ff_fft_init(FFTContext *s, int nbits, int inverse) { int i, j, m, n; @@ -185,9 +181,6 @@ int ff_fft_init(FFTContext *s, int nbits, int inverse) return -1; } -/** - * Do the permutation needed BEFORE calling ff_fft_calc() - */ void ff_fft_permute_c(FFTContext *s, FFTComplex *z) { int j, k, np; @@ -374,11 +367,6 @@ static void (*fft_dispatch[])(FFTComplex*) = { fft2048, fft4096, fft8192, fft16384, fft32768, fft65536, }; -/** - * Do a complex FFT with the parameters defined in ff_fft_init(). The - * input data must be permuted before with s->revtab table. No - * 1.0/sqrt(n) normalization is done. - */ void ff_fft_calc_c(FFTContext *s, FFTComplex *z) { fft_dispatch[s->nbits-2](z); -- cgit v1.2.3