5 Copyright (c) 2003-2010, Mark Borgerding
9 Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
11 * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
12 * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
13 * Neither the author nor the names of any contributors may be used to endorse or promote products derived from this software without specific prior written permission.
15 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
18 #include "config-kdenlive.h"
35 -- a utility that will handle the caching of fft objects
36 -- real-only (no imaginary time component ) FFT
37 -- a multi-dimensional FFT
38 -- a command-line utility to perform ffts
39 -- a command-line utility to perform fast-convolution filtering
41 Then see kfc.h kiss_fftr.h kiss_fftnd.h fftutil.c kiss_fastfir.c
42 in the tools/ directory.
46 # include <xmmintrin.h>
47 # define kiss_fft_scalar __m128
48 #define KISS_FFT_MALLOC(nbytes) _mm_malloc(nbytes,16)
49 #define KISS_FFT_FREE _mm_free
51 #define KISS_FFT_MALLOC malloc
52 #define KISS_FFT_FREE free
57 #include <sys/types.h>
58 # if (FIXED_POINT == 32)
59 # define kiss_fft_scalar int32_t
61 # define kiss_fft_scalar int16_t
64 # ifndef kiss_fft_scalar
65 /* default is float */
66 # define kiss_fft_scalar float
75 typedef struct kiss_fft_state* kiss_fft_cfg;
80 * Initialize a FFT (or IFFT) algorithm's cfg/state buffer.
82 * typical usage: kiss_fft_cfg mycfg=kiss_fft_alloc(1024,0,NULL,NULL);
84 * The return value from fft_alloc is a cfg buffer used internally
85 * by the fft routine or NULL.
87 * If lenmem is NULL, then kiss_fft_alloc will allocate a cfg buffer using malloc.
88 * The returned value should be free()d when done to avoid memory leaks.
90 * The state can be placed in a user supplied buffer 'mem':
91 * If lenmem is not NULL and mem is not NULL and *lenmem is large enough,
92 * then the function places the cfg in mem and the size used in *lenmem
95 * If lenmem is not NULL and ( mem is NULL or *lenmem is not large enough),
96 * then the function returns NULL and places the minimum cfg
97 * buffer size in *lenmem.
100 kiss_fft_cfg kiss_fft_alloc(int nfft,int inverse_fft,void * mem,size_t * lenmem);
103 * kiss_fft(cfg,in_out_buf)
105 * Perform an FFT on a complex input buffer.
107 * fin should be f[0] , f[1] , ... ,f[nfft-1]
108 * fout will be F[0] , F[1] , ... ,F[nfft-1]
109 * Note that each element is complex and can be accessed like
112 void kiss_fft(kiss_fft_cfg cfg,const kiss_fft_cpx *fin,kiss_fft_cpx *fout);
115 A more generic version of the above function. It reads its input from every Nth sample.
117 void kiss_fft_stride(kiss_fft_cfg cfg,const kiss_fft_cpx *fin,kiss_fft_cpx *fout,int fin_stride);
119 /* If kiss_fft_alloc allocated a buffer, it is one contiguous
120 buffer and can be simply free()d when no longer needed*/
121 #define kiss_fft_free free
124 Cleans up some memory that gets managed internally. Not necessary to call, but it might clean up
125 your compiler output to call this before you exit.
127 void kiss_fft_cleanup(void);
131 * Returns the smallest integer k, such that k>=n and k has only "fast" factors (2,3,5)
133 int kiss_fft_next_fast_size(int n);
135 /* for real ffts, we need an even size */
136 #define kiss_fftr_next_fast_size_real(n) \
137 (kiss_fft_next_fast_size( ((n)+1)>>1)<<1)