123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448 |
- /* Copyright (C) 2005-2006 Jean-Marc Valin
- File: fftwrap.c
- Wrapper for various FFTs
- Redistribution and use in source and binary forms, with or without
- modification, are permitted provided that the following conditions
- are met:
- - Redistributions of source code must retain the above copyright
- notice, this list of conditions and the following disclaimer.
- - 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.
- - Neither the name of the Xiph.org Foundation nor the names of its
- contributors may be used to endorse or promote products derived from
- this software without specific prior written permission.
- 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 FOUNDATION 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.
- */
- #ifdef HAVE_CONFIG_H
- #include "config.h"
- #endif
- #include "arch.h"
- #include "os_support.h"
- #define MAX_FFT_SIZE 2048
- #ifdef FIXED_POINT
- static int maximize_range(spx_word16_t *in, spx_word16_t *out, spx_word16_t bound, int len)
- {
- int i, shift;
- spx_word16_t max_val = 0;
- for (i=0;i<len;i++)
- {
- if (in[i]>max_val)
- max_val = in[i];
- if (-in[i]>max_val)
- max_val = -in[i];
- }
- shift=0;
- while (max_val <= (bound>>1) && max_val != 0)
- {
- max_val <<= 1;
- shift++;
- }
- for (i=0;i<len;i++)
- {
- out[i] = SHL16(in[i], shift);
- }
- return shift;
- }
- static void renorm_range(spx_word16_t *in, spx_word16_t *out, int shift, int len)
- {
- int i;
- for (i=0;i<len;i++)
- {
- out[i] = PSHR16(in[i], shift);
- }
- }
- #endif
- #ifdef USE_SMALLFT
- #include "smallft.h"
- #include <math.h>
- void *spx_fft_init(int size)
- {
- struct drft_lookup *table;
- table = speex_alloc(sizeof(struct drft_lookup));
- spx_drft_init((struct drft_lookup *)table, size);
- return (void*)table;
- }
- void spx_fft_destroy(void *table)
- {
- spx_drft_clear(table);
- speex_free(table);
- }
- void spx_fft(void *table, float *in, float *out)
- {
- if (in==out)
- {
- int i;
- float scale = 1./((struct drft_lookup *)table)->n;
- speex_warning("FFT should not be done in-place");
- for (i=0;i<((struct drft_lookup *)table)->n;i++)
- out[i] = scale*in[i];
- } else {
- int i;
- float scale = 1./((struct drft_lookup *)table)->n;
- for (i=0;i<((struct drft_lookup *)table)->n;i++)
- out[i] = scale*in[i];
- }
- spx_drft_forward((struct drft_lookup *)table, out);
- }
- void spx_ifft(void *table, float *in, float *out)
- {
- if (in==out)
- {
- speex_warning("FFT should not be done in-place");
- } else {
- int i;
- for (i=0;i<((struct drft_lookup *)table)->n;i++)
- out[i] = in[i];
- }
- spx_drft_backward((struct drft_lookup *)table, out);
- }
- #elif defined(USE_INTEL_MKL)
- #include <mkl.h>
- struct mkl_config {
- DFTI_DESCRIPTOR_HANDLE desc;
- int N;
- };
- void *spx_fft_init(int size)
- {
- struct mkl_config *table = (struct mkl_config *) speex_alloc(sizeof(struct mkl_config));
- table->N = size;
- DftiCreateDescriptor(&table->desc, DFTI_SINGLE, DFTI_REAL, 1, size);
- DftiSetValue(table->desc, DFTI_PACKED_FORMAT, DFTI_PACK_FORMAT);
- DftiSetValue(table->desc, DFTI_PLACEMENT, DFTI_NOT_INPLACE);
- DftiSetValue(table->desc, DFTI_FORWARD_SCALE, 1.0f / size);
- DftiCommitDescriptor(table->desc);
- return table;
- }
- void spx_fft_destroy(void *table)
- {
- struct mkl_config *t = (struct mkl_config *) table;
- DftiFreeDescriptor(t->desc);
- speex_free(table);
- }
- void spx_fft(void *table, spx_word16_t *in, spx_word16_t *out)
- {
- struct mkl_config *t = (struct mkl_config *) table;
- DftiComputeForward(t->desc, in, out);
- }
- void spx_ifft(void *table, spx_word16_t *in, spx_word16_t *out)
- {
- struct mkl_config *t = (struct mkl_config *) table;
- DftiComputeBackward(t->desc, in, out);
- }
- #elif defined(USE_INTEL_IPP)
- #include <ipps.h>
- struct ipp_fft_config
- {
- IppsDFTSpec_R_32f *dftSpec;
- Ipp8u *buffer;
- };
- void *spx_fft_init(int size)
- {
- int bufferSize = 0;
- int hint;
- struct ipp_fft_config *table;
- table = (struct ipp_fft_config *)speex_alloc(sizeof(struct ipp_fft_config));
- /* there appears to be no performance difference between ippAlgHintFast and
- ippAlgHintAccurate when using the with the floating point version
- of the fft. */
- hint = ippAlgHintAccurate;
- ippsDFTInitAlloc_R_32f(&table->dftSpec, size, IPP_FFT_DIV_FWD_BY_N, hint);
- ippsDFTGetBufSize_R_32f(table->dftSpec, &bufferSize);
- table->buffer = ippsMalloc_8u(bufferSize);
- return table;
- }
- void spx_fft_destroy(void *table)
- {
- struct ipp_fft_config *t = (struct ipp_fft_config *)table;
- ippsFree(t->buffer);
- ippsDFTFree_R_32f(t->dftSpec);
- speex_free(t);
- }
- void spx_fft(void *table, spx_word16_t *in, spx_word16_t *out)
- {
- struct ipp_fft_config *t = (struct ipp_fft_config *)table;
- ippsDFTFwd_RToPack_32f(in, out, t->dftSpec, t->buffer);
- }
- void spx_ifft(void *table, spx_word16_t *in, spx_word16_t *out)
- {
- struct ipp_fft_config *t = (struct ipp_fft_config *)table;
- ippsDFTInv_PackToR_32f(in, out, t->dftSpec, t->buffer);
- }
- #elif defined(USE_GPL_FFTW3)
- #include <fftw3.h>
- struct fftw_config {
- float *in;
- float *out;
- fftwf_plan fft;
- fftwf_plan ifft;
- int N;
- };
- void *spx_fft_init(int size)
- {
- struct fftw_config *table = (struct fftw_config *) speex_alloc(sizeof(struct fftw_config));
- table->in = fftwf_malloc(sizeof(float) * (size+2));
- table->out = fftwf_malloc(sizeof(float) * (size+2));
- table->fft = fftwf_plan_dft_r2c_1d(size, table->in, (fftwf_complex *) table->out, FFTW_PATIENT);
- table->ifft = fftwf_plan_dft_c2r_1d(size, (fftwf_complex *) table->in, table->out, FFTW_PATIENT);
- table->N = size;
- return table;
- }
- void spx_fft_destroy(void *table)
- {
- struct fftw_config *t = (struct fftw_config *) table;
- fftwf_destroy_plan(t->fft);
- fftwf_destroy_plan(t->ifft);
- fftwf_free(t->in);
- fftwf_free(t->out);
- speex_free(table);
- }
- void spx_fft(void *table, spx_word16_t *in, spx_word16_t *out)
- {
- int i;
- struct fftw_config *t = (struct fftw_config *) table;
- const int N = t->N;
- float *iptr = t->in;
- float *optr = t->out;
- const float m = 1.0 / N;
- for(i=0;i<N;++i)
- iptr[i]=in[i] * m;
- fftwf_execute(t->fft);
- out[0] = optr[0];
- for(i=1;i<N;++i)
- out[i] = optr[i+1];
- }
- void spx_ifft(void *table, spx_word16_t *in, spx_word16_t *out)
- {
- int i;
- struct fftw_config *t = (struct fftw_config *) table;
- const int N = t->N;
- float *iptr = t->in;
- float *optr = t->out;
- iptr[0] = in[0];
- iptr[1] = 0.0f;
- for(i=1;i<N;++i)
- iptr[i+1] = in[i];
- iptr[N+1] = 0.0f;
- fftwf_execute(t->ifft);
- for(i=0;i<N;++i)
- out[i] = optr[i];
- }
- #elif defined(USE_KISS_FFT)
- #include "kiss_fftr.h"
- #include "kiss_fft.h"
- struct kiss_config {
- kiss_fftr_cfg forward;
- kiss_fftr_cfg backward;
- int N;
- };
- void *spx_fft_init(int size)
- {
- struct kiss_config *table;
- table = (struct kiss_config*)speex_alloc(sizeof(struct kiss_config));
- table->forward = kiss_fftr_alloc(size,0,NULL,NULL);
- table->backward = kiss_fftr_alloc(size,1,NULL,NULL);
- table->N = size;
- return table;
- }
- void spx_fft_destroy(void *table)
- {
- struct kiss_config *t = (struct kiss_config *)table;
- kiss_fftr_free(t->forward);
- kiss_fftr_free(t->backward);
- speex_free(table);
- }
- #ifdef FIXED_POINT
- void spx_fft(void *table, spx_word16_t *in, spx_word16_t *out)
- {
- int shift;
- struct kiss_config *t = (struct kiss_config *)table;
- shift = maximize_range(in, in, 32000, t->N);
- kiss_fftr2(t->forward, in, out);
- renorm_range(in, in, shift, t->N);
- renorm_range(out, out, shift, t->N);
- }
- #else
- void spx_fft(void *table, spx_word16_t *in, spx_word16_t *out)
- {
- int i;
- float scale;
- struct kiss_config *t = (struct kiss_config *)table;
- scale = 1./t->N;
- kiss_fftr2(t->forward, in, out);
- for (i=0;i<t->N;i++)
- out[i] *= scale;
- }
- #endif
- void spx_ifft(void *table, spx_word16_t *in, spx_word16_t *out)
- {
- struct kiss_config *t = (struct kiss_config *)table;
- kiss_fftri2(t->backward, in, out);
- }
- #else
- #error No other FFT implemented
- #endif
- #ifdef FIXED_POINT
- /*#include "smallft.h"*/
- void spx_fft_float(void *table, float *in, float *out)
- {
- int i;
- #ifdef USE_SMALLFT
- int N = ((struct drft_lookup *)table)->n;
- #elif defined(USE_KISS_FFT)
- int N = ((struct kiss_config *)table)->N;
- #else
- #endif
- #ifdef VAR_ARRAYS
- spx_word16_t _in[N];
- spx_word16_t _out[N];
- #else
- spx_word16_t _in[MAX_FFT_SIZE];
- spx_word16_t _out[MAX_FFT_SIZE];
- #endif
- for (i=0;i<N;i++)
- _in[i] = (int)floor(.5+in[i]);
- spx_fft(table, _in, _out);
- for (i=0;i<N;i++)
- out[i] = _out[i];
- #if 0
- if (!fixed_point)
- {
- float scale;
- struct drft_lookup t;
- spx_drft_init(&t, ((struct kiss_config *)table)->N);
- scale = 1./((struct kiss_config *)table)->N;
- for (i=0;i<((struct kiss_config *)table)->N;i++)
- out[i] = scale*in[i];
- spx_drft_forward(&t, out);
- spx_drft_clear(&t);
- }
- #endif
- }
- void spx_ifft_float(void *table, float *in, float *out)
- {
- int i;
- #ifdef USE_SMALLFT
- int N = ((struct drft_lookup *)table)->n;
- #elif defined(USE_KISS_FFT)
- int N = ((struct kiss_config *)table)->N;
- #else
- #endif
- #ifdef VAR_ARRAYS
- spx_word16_t _in[N];
- spx_word16_t _out[N];
- #else
- spx_word16_t _in[MAX_FFT_SIZE];
- spx_word16_t _out[MAX_FFT_SIZE];
- #endif
- for (i=0;i<N;i++)
- _in[i] = (int)floor(.5+in[i]);
- spx_ifft(table, _in, _out);
- for (i=0;i<N;i++)
- out[i] = _out[i];
- #if 0
- if (!fixed_point)
- {
- int i;
- struct drft_lookup t;
- spx_drft_init(&t, ((struct kiss_config *)table)->N);
- for (i=0;i<((struct kiss_config *)table)->N;i++)
- out[i] = in[i];
- spx_drft_backward(&t, out);
- spx_drft_clear(&t);
- }
- #endif
- }
- #else
- void spx_fft_float(void *table, float *in, float *out)
- {
- spx_fft(table, in, out);
- }
- void spx_ifft_float(void *table, float *in, float *out)
- {
- spx_ifft(table, in, out);
- }
- #endif
|