eeva/jamulus
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity
9a9ca7c1c4
jamulus/libs/celt/cc6__kiss_fft.c

702 lines
21 KiB
C
Executable File
Raw Blame History

/*
Copyright (c) 2003-2004, Mark Borgerding
Lots of modifications by JMV
Copyright (c) 2005-2007, Jean-Marc Valin
Copyright (c) 2008, Jean-Marc Valin, CSIRO
All rights reserved.
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 author nor the names of any 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 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.
*/
#ifndef SKIP_CONFIG_H
# ifdef HAVE_CONFIG_H
# include "config.h"
# endif
#endif
#include "cc6__kiss_fft_guts.h"
#include "cc6_arch.h"
#include "cc6_os_support.h"
#include "cc6_mathops.h"
#include "cc6_stack_alloc.h"
/* The guts header contains all the multiplication and addition macros that are defined for
complex numbers. It also delares the kf_ internal functions.
*/
static void cc6_kf_bfly2(
cc6_kiss_fft_cpx * Fout,
const size_t fstride,
const cc6_kiss_fft_cfg st,
int m,
int N,
int mm
)
{
cc6_kiss_fft_cpx * Fout2;
cc6_kiss_twiddle_cpx * tw1;
int i,j;
cc6_kiss_fft_cpx * Fout_beg = Fout;
for (i=0;i<N;i++)
{
Fout = Fout_beg + i*mm;
Fout2 = Fout + m;
tw1 = st->twiddles;
for(j=0;j<m;j++)
{
cc6_kiss_fft_cpx t;
Fout->r = cc6_SHR(Fout->r, 1);Fout->i = cc6_SHR(Fout->i, 1);
Fout2->r = cc6_SHR(Fout2->r, 1);Fout2->i = cc6_SHR(Fout2->i, 1);
cc6_C_MUL (t, *Fout2 , *tw1);
tw1 += fstride;
cc6_C_SUB( *Fout2 , *Fout , t );
cc6_C_ADDTO( *Fout , t );
++Fout2;
++Fout;
}
}
}
static void cc6_ki_bfly2(
cc6_kiss_fft_cpx * Fout,
const size_t fstride,
const cc6_kiss_fft_cfg st,
int m,
int N,
int mm
)
{
cc6_kiss_fft_cpx * Fout2;
cc6_kiss_twiddle_cpx * tw1;
cc6_kiss_fft_cpx t;
int i,j;
cc6_kiss_fft_cpx * Fout_beg = Fout;
for (i=0;i<N;i++)
{
Fout = Fout_beg + i*mm;
Fout2 = Fout + m;
tw1 = st->twiddles;
for(j=0;j<m;j++)
{
cc6_C_MULC (t, *Fout2 , *tw1);
tw1 += fstride;
cc6_C_SUB( *Fout2 , *Fout , t );
cc6_C_ADDTO( *Fout , t );
++Fout2;
++Fout;
}
}
}
static void cc6_kf_bfly4(
cc6_kiss_fft_cpx * Fout,
const size_t fstride,
const cc6_kiss_fft_cfg st,
int m,
int N,
int mm
)
{
cc6_kiss_twiddle_cpx *tw1,*tw2,*tw3;
cc6_kiss_fft_cpx scratch[6];
const size_t m2=2*m;
const size_t m3=3*m;
int i, j;
cc6_kiss_fft_cpx * Fout_beg = Fout;
for (i=0;i<N;i++)
{
Fout = Fout_beg + i*mm;
tw3 = tw2 = tw1 = st->twiddles;
for (j=0;j<m;j++)
{
cc6_C_MUL4(scratch[0],Fout[m] , *tw1 );
cc6_C_MUL4(scratch[1],Fout[m2] , *tw2 );
cc6_C_MUL4(scratch[2],Fout[m3] , *tw3 );
Fout->r = cc6_PSHR(Fout->r, 2);
Fout->i = cc6_PSHR(Fout->i, 2);
cc6_C_SUB( scratch[5] , *Fout, scratch[1] );
cc6_C_ADDTO(*Fout, scratch[1]);
cc6_C_ADD( scratch[3] , scratch[0] , scratch[2] );
cc6_C_SUB( scratch[4] , scratch[0] , scratch[2] );
Fout[m2].r = cc6_PSHR(Fout[m2].r, 2);
Fout[m2].i = cc6_PSHR(Fout[m2].i, 2);
cc6_C_SUB( Fout[m2], *Fout, scratch[3] );
tw1 += fstride;
tw2 += fstride*2;
tw3 += fstride*3;
cc6_C_ADDTO( *Fout , scratch[3] );
Fout[m].r = scratch[5].r + scratch[4].i;
Fout[m].i = scratch[5].i - scratch[4].r;
Fout[m3].r = scratch[5].r - scratch[4].i;
Fout[m3].i = scratch[5].i + scratch[4].r;
++Fout;
}
}
}
static void cc6_ki_bfly4(
cc6_kiss_fft_cpx * Fout,
const size_t fstride,
const cc6_kiss_fft_cfg st,
int m,
int N,
int mm
)
{
cc6_kiss_twiddle_cpx *tw1,*tw2,*tw3;
cc6_kiss_fft_cpx scratch[6];
const size_t m2=2*m;
const size_t m3=3*m;
int i, j;
cc6_kiss_fft_cpx * Fout_beg = Fout;
for (i=0;i<N;i++)
{
Fout = Fout_beg + i*mm;
tw3 = tw2 = tw1 = st->twiddles;
for (j=0;j<m;j++)
{
cc6_C_MULC(scratch[0],Fout[m] , *tw1 );
cc6_C_MULC(scratch[1],Fout[m2] , *tw2 );
cc6_C_MULC(scratch[2],Fout[m3] , *tw3 );
cc6_C_SUB( scratch[5] , *Fout, scratch[1] );
cc6_C_ADDTO(*Fout, scratch[1]);
cc6_C_ADD( scratch[3] , scratch[0] , scratch[2] );
cc6_C_SUB( scratch[4] , scratch[0] , scratch[2] );
cc6_C_SUB( Fout[m2], *Fout, scratch[3] );
tw1 += fstride;
tw2 += fstride*2;
tw3 += fstride*3;
cc6_C_ADDTO( *Fout , scratch[3] );
Fout[m].r = scratch[5].r - scratch[4].i;
Fout[m].i = scratch[5].i + scratch[4].r;
Fout[m3].r = scratch[5].r + scratch[4].i;
Fout[m3].i = scratch[5].i - scratch[4].r;
++Fout;
}
}
}
#ifndef RADIX_TWO_ONLY
static void cc6_kf_bfly3(
cc6_kiss_fft_cpx * Fout,
const size_t fstride,
const cc6_kiss_fft_cfg st,
size_t m
)
{
size_t k=m;
const size_t m2 = 2*m;
cc6_kiss_twiddle_cpx *tw1,*tw2;
cc6_kiss_fft_cpx scratch[5];
cc6_kiss_twiddle_cpx epi3;
epi3 = st->twiddles[fstride*m];
tw1=tw2=st->twiddles;
do{
cc6_C_FIXDIV(*Fout,3); cc6_C_FIXDIV(Fout[m],3); cc6_C_FIXDIV(Fout[m2],3);
cc6_C_MUL(scratch[1],Fout[m] , *tw1);
cc6_C_MUL(scratch[2],Fout[m2] , *tw2);
cc6_C_ADD(scratch[3],scratch[1],scratch[2]);
cc6_C_SUB(scratch[0],scratch[1],scratch[2]);
tw1 += fstride;
tw2 += fstride*2;
Fout[m].r = Fout->r - cc6_HALF_OF(scratch[3].r);
Fout[m].i = Fout->i - cc6_HALF_OF(scratch[3].i);
cc6_C_MULBYSCALAR( scratch[0] , epi3.i );
cc6_C_ADDTO(*Fout,scratch[3]);
Fout[m2].r = Fout[m].r + scratch[0].i;
Fout[m2].i = Fout[m].i - scratch[0].r;
Fout[m].r -= scratch[0].i;
Fout[m].i += scratch[0].r;
++Fout;
}while(--k);
}
static void cc6_ki_bfly3(
cc6_kiss_fft_cpx * Fout,
const size_t fstride,
const cc6_kiss_fft_cfg st,
size_t m
)
{
size_t k=m;
const size_t m2 = 2*m;
cc6_kiss_twiddle_cpx *tw1,*tw2;
cc6_kiss_fft_cpx scratch[5];
cc6_kiss_twiddle_cpx epi3;
epi3 = st->twiddles[fstride*m];
tw1=tw2=st->twiddles;
do{
cc6_C_MULC(scratch[1],Fout[m] , *tw1);
cc6_C_MULC(scratch[2],Fout[m2] , *tw2);
cc6_C_ADD(scratch[3],scratch[1],scratch[2]);
cc6_C_SUB(scratch[0],scratch[1],scratch[2]);
tw1 += fstride;
tw2 += fstride*2;
Fout[m].r = Fout->r - cc6_HALF_OF(scratch[3].r);
Fout[m].i = Fout->i - cc6_HALF_OF(scratch[3].i);
cc6_C_MULBYSCALAR( scratch[0] , -epi3.i );
cc6_C_ADDTO(*Fout,scratch[3]);
Fout[m2].r = Fout[m].r + scratch[0].i;
Fout[m2].i = Fout[m].i - scratch[0].r;
Fout[m].r -= scratch[0].i;
Fout[m].i += scratch[0].r;
++Fout;
}while(--k);
}
static void cc6_kf_bfly5(
cc6_kiss_fft_cpx * Fout,
const size_t fstride,
const cc6_kiss_fft_cfg st,
int m
)
{
cc6_kiss_fft_cpx *Fout0,*Fout1,*Fout2,*Fout3,*Fout4;
int u;
cc6_kiss_fft_cpx scratch[13];
cc6_kiss_twiddle_cpx * twiddles = st->twiddles;
cc6_kiss_twiddle_cpx *tw;
cc6_kiss_twiddle_cpx ya,yb;
ya = twiddles[fstride*m];
yb = twiddles[fstride*2*m];
Fout0=Fout;
Fout1=Fout0+m;
Fout2=Fout0+2*m;
Fout3=Fout0+3*m;
Fout4=Fout0+4*m;
tw=st->twiddles;
for ( u=0; u<m; ++u ) {
cc6_C_FIXDIV( *Fout0,5); cc6_C_FIXDIV( *Fout1,5); cc6_C_FIXDIV( *Fout2,5); cc6_C_FIXDIV( *Fout3,5); cc6_C_FIXDIV( *Fout4,5);
scratch[0] = *Fout0;
cc6_C_MUL(scratch[1] ,*Fout1, tw[u*fstride]);
cc6_C_MUL(scratch[2] ,*Fout2, tw[2*u*fstride]);
cc6_C_MUL(scratch[3] ,*Fout3, tw[3*u*fstride]);
cc6_C_MUL(scratch[4] ,*Fout4, tw[4*u*fstride]);
cc6_C_ADD( scratch[7],scratch[1],scratch[4]);
cc6_C_SUB( scratch[10],scratch[1],scratch[4]);
cc6_C_ADD( scratch[8],scratch[2],scratch[3]);
cc6_C_SUB( scratch[9],scratch[2],scratch[3]);
Fout0->r += scratch[7].r + scratch[8].r;
Fout0->i += scratch[7].i + scratch[8].i;
scratch[5].r = scratch[0].r + cc6_S_MUL(scratch[7].r,ya.r) + cc6_S_MUL(scratch[8].r,yb.r);
scratch[5].i = scratch[0].i + cc6_S_MUL(scratch[7].i,ya.r) + cc6_S_MUL(scratch[8].i,yb.r);
scratch[6].r = cc6_S_MUL(scratch[10].i,ya.i) + cc6_S_MUL(scratch[9].i,yb.i);
scratch[6].i = -cc6_S_MUL(scratch[10].r,ya.i) - cc6_S_MUL(scratch[9].r,yb.i);
cc6_C_SUB(*Fout1,scratch[5],scratch[6]);
cc6_C_ADD(*Fout4,scratch[5],scratch[6]);
scratch[11].r = scratch[0].r + cc6_S_MUL(scratch[7].r,yb.r) + cc6_S_MUL(scratch[8].r,ya.r);
scratch[11].i = scratch[0].i + cc6_S_MUL(scratch[7].i,yb.r) + cc6_S_MUL(scratch[8].i,ya.r);
scratch[12].r = - cc6_S_MUL(scratch[10].i,yb.i) + cc6_S_MUL(scratch[9].i,ya.i);
scratch[12].i = cc6_S_MUL(scratch[10].r,yb.i) - cc6_S_MUL(scratch[9].r,ya.i);
cc6_C_ADD(*Fout2,scratch[11],scratch[12]);
cc6_C_SUB(*Fout3,scratch[11],scratch[12]);
++Fout0;++Fout1;++Fout2;++Fout3;++Fout4;
}
}
static void cc6_ki_bfly5(
cc6_kiss_fft_cpx * Fout,
const size_t fstride,
const cc6_kiss_fft_cfg st,
int m
)
{
cc6_kiss_fft_cpx *Fout0,*Fout1,*Fout2,*Fout3,*Fout4;
int u;
cc6_kiss_fft_cpx scratch[13];
cc6_kiss_twiddle_cpx * twiddles = st->twiddles;
cc6_kiss_twiddle_cpx *tw;
cc6_kiss_twiddle_cpx ya,yb;
ya = twiddles[fstride*m];
yb = twiddles[fstride*2*m];
Fout0=Fout;
Fout1=Fout0+m;
Fout2=Fout0+2*m;
Fout3=Fout0+3*m;
Fout4=Fout0+4*m;
tw=st->twiddles;
for ( u=0; u<m; ++u ) {
scratch[0] = *Fout0;
cc6_C_MULC(scratch[1] ,*Fout1, tw[u*fstride]);
cc6_C_MULC(scratch[2] ,*Fout2, tw[2*u*fstride]);
cc6_C_MULC(scratch[3] ,*Fout3, tw[3*u*fstride]);
cc6_C_MULC(scratch[4] ,*Fout4, tw[4*u*fstride]);
cc6_C_ADD( scratch[7],scratch[1],scratch[4]);
cc6_C_SUB( scratch[10],scratch[1],scratch[4]);
cc6_C_ADD( scratch[8],scratch[2],scratch[3]);
cc6_C_SUB( scratch[9],scratch[2],scratch[3]);
Fout0->r += scratch[7].r + scratch[8].r;
Fout0->i += scratch[7].i + scratch[8].i;
scratch[5].r = scratch[0].r + cc6_S_MUL(scratch[7].r,ya.r) + cc6_S_MUL(scratch[8].r,yb.r);
scratch[5].i = scratch[0].i + cc6_S_MUL(scratch[7].i,ya.r) + cc6_S_MUL(scratch[8].i,yb.r);
scratch[6].r = -cc6_S_MUL(scratch[10].i,ya.i) - cc6_S_MUL(scratch[9].i,yb.i);
scratch[6].i = cc6_S_MUL(scratch[10].r,ya.i) + cc6_S_MUL(scratch[9].r,yb.i);
cc6_C_SUB(*Fout1,scratch[5],scratch[6]);
cc6_C_ADD(*Fout4,scratch[5],scratch[6]);
scratch[11].r = scratch[0].r + cc6_S_MUL(scratch[7].r,yb.r) + cc6_S_MUL(scratch[8].r,ya.r);
scratch[11].i = scratch[0].i + cc6_S_MUL(scratch[7].i,yb.r) + cc6_S_MUL(scratch[8].i,ya.r);
scratch[12].r = cc6_S_MUL(scratch[10].i,yb.i) - cc6_S_MUL(scratch[9].i,ya.i);
scratch[12].i = -cc6_S_MUL(scratch[10].r,yb.i) + cc6_S_MUL(scratch[9].r,ya.i);
cc6_C_ADD(*Fout2,scratch[11],scratch[12]);
cc6_C_SUB(*Fout3,scratch[11],scratch[12]);
++Fout0;++Fout1;++Fout2;++Fout3;++Fout4;
}
}
/* perform the butterfly for one stage of a mixed radix FFT */
static void cc6_kf_bfly_generic(
cc6_kiss_fft_cpx * Fout,
const size_t fstride,
const cc6_kiss_fft_cfg st,
int m,
int p
)
{
int u,k,q1,q;
cc6_kiss_twiddle_cpx * twiddles = st->twiddles;
cc6_kiss_fft_cpx t;
cc6_VARDECL(cc6_kiss_fft_cpx, scratchbuf);
int Norig = st->nfft;
cc6_ALLOC(scratchbuf, p, cc6_kiss_fft_cpx);
for ( u=0; u<m; ++u ) {
k=u;
for ( q1=0 ; q1<p ; ++q1 ) {
scratchbuf[q1] = Fout[ k ];
cc6_C_FIXDIV(scratchbuf[q1],p);
k += m;
}
k=u;
for ( q1=0 ; q1<p ; ++q1 ) {
int twidx=0;
Fout[ k ] = scratchbuf[0];
for (q=1;q<p;++q ) {
twidx += fstride * k;
if (twidx>=Norig) twidx-=Norig;
cc6_C_MUL(t,scratchbuf[q] , twiddles[twidx] );
cc6_C_ADDTO( Fout[ k ] ,t);
}
k += m;
}
}
}
static void cc6_ki_bfly_generic(
cc6_kiss_fft_cpx * Fout,
const size_t fstride,
const cc6_kiss_fft_cfg st,
int m,
int p
)
{
int u,k,q1,q;
cc6_kiss_twiddle_cpx * twiddles = st->twiddles;
cc6_kiss_fft_cpx t;
cc6_VARDECL(cc6_kiss_fft_cpx, scratchbuf);
int Norig = st->nfft;
cc6_ALLOC(scratchbuf, p, cc6_kiss_fft_cpx);
for ( u=0; u<m; ++u ) {
k=u;
for ( q1=0 ; q1<p ; ++q1 ) {
scratchbuf[q1] = Fout[ k ];
k += m;
}
k=u;
for ( q1=0 ; q1<p ; ++q1 ) {
int twidx=0;
Fout[ k ] = scratchbuf[0];
for (q=1;q<p;++q ) {
twidx += fstride * k;
if (twidx>=Norig) twidx-=Norig;
cc6_C_MULC(t,scratchbuf[q] , twiddles[twidx] );
cc6_C_ADDTO( Fout[ k ] ,t);
}
k += m;
}
}
}
#endif
static
void cc6_compute_bitrev_table(
int Fout,
int *f,
const size_t fstride,
int in_stride,
int * factors,
const cc6_kiss_fft_cfg st
)
{
const int p=*factors++; /* the radix */
const int m=*factors++; /* stage's fft length/p */
/*printf ("fft %d %d %d %d %d %d\n", p*m, m, p, s2, fstride*in_stride, N);*/
if (m==1)
{
int j;
for (j=0;j<p;j++)
{
*f = Fout+j;
f += fstride*in_stride;
}
} else {
int j;
for (j=0;j<p;j++)
{
cc6_compute_bitrev_table( Fout , f, fstride*p, in_stride, factors,st);
f += fstride*in_stride;
Fout += m;
}
}
}
void cc6_kf_work(
cc6_kiss_fft_cpx * Fout,
const cc6_kiss_fft_cpx * f,
const size_t fstride,
int in_stride,
int * factors,
const cc6_kiss_fft_cfg st,
int N,
int s2,
int m2
)
{
#ifndef RADIX_TWO_ONLY
int i;
cc6_kiss_fft_cpx * Fout_beg=Fout;
#endif
const int p=*factors++; /* the radix */
const int m=*factors++; /* stage's fft length/p */
/*printf ("fft %d %d %d %d %d %d %d\n", p*m, m, p, s2, fstride*in_stride, N, m2);*/
if (m!=1)
cc6_kf_work( Fout , f, fstride*p, in_stride, factors,st, N*p, fstride*in_stride, m);
switch (p) {
case 2: cc6_kf_bfly2(Fout,fstride,st,m, N, m2); break;
case 4: cc6_kf_bfly4(Fout,fstride,st,m, N, m2); break;
#ifndef RADIX_TWO_ONLY
case 3: for (i=0;i<N;i++){Fout=Fout_beg+i*m2; cc6_kf_bfly3(Fout,fstride,st,m);} break;
case 5: for (i=0;i<N;i++){Fout=Fout_beg+i*m2; cc6_kf_bfly5(Fout,fstride,st,m);} break;
default: for (i=0;i<N;i++){Fout=Fout_beg+i*m2; cc6_kf_bfly_generic(Fout,fstride,st,m,p);} break;
#else
default: cc6_celt_fatal("cc6_kiss_fft: only powers of two enabled");
#endif
}
}
void cc6_ki_work(
cc6_kiss_fft_cpx * Fout,
const cc6_kiss_fft_cpx * f,
const size_t fstride,
int in_stride,
int * factors,
const cc6_kiss_fft_cfg st,
int N,
int s2,
int m2
)
{
#ifndef RADIX_TWO_ONLY
int i;
cc6_kiss_fft_cpx * Fout_beg=Fout;
#endif
const int p=*factors++; /* the radix */
const int m=*factors++; /* stage's fft length/p */
/*printf ("fft %d %d %d %d %d %d %d\n", p*m, m, p, s2, fstride*in_stride, N, m2);*/
if (m!=1)
cc6_ki_work( Fout , f, fstride*p, in_stride, factors,st, N*p, fstride*in_stride, m);
switch (p) {
case 2: cc6_ki_bfly2(Fout,fstride,st,m, N, m2); break;
case 4: cc6_ki_bfly4(Fout,fstride,st,m, N, m2); break;
#ifndef RADIX_TWO_ONLY
case 3: for (i=0;i<N;i++){Fout=Fout_beg+i*m2; cc6_ki_bfly3(Fout,fstride,st,m);} break;
case 5: for (i=0;i<N;i++){Fout=Fout_beg+i*m2; cc6_ki_bfly5(Fout,fstride,st,m);} break;
default: for (i=0;i<N;i++){Fout=Fout_beg+i*m2; cc6_ki_bfly_generic(Fout,fstride,st,m,p);} break;
#else
default: cc6_celt_fatal("cc6_kiss_fft: only powers of two enabled");
#endif
}
}
/* facbuf is populated by p1,m1,p2,m2, ...
where
p[i] * m[i] = m[i-1]
m0 = n */
static
void cc6_kf_factor(int n,int * facbuf)
{
int p=4;
/*factor out powers of 4, powers of 2, then any remaining primes */
do {
while (n % p) {
switch (p) {
case 4: p = 2; break;
case 2: p = 3; break;
default: p += 2; break;
}
if (p>32000 || (cc6_celt_int32_t)p*(cc6_celt_int32_t)p > n)
p = n; /* no more factors, skip to end */
}
n /= p;
*facbuf++ = p;
*facbuf++ = n;
} while (n > 1);
}
/*
*
* User-callable function to allocate all necessary storage space for the fft.
*
* The return value is a contiguous block of memory, allocated with malloc. As such,
* It can be freed with free(), rather than a kiss_fft-specific function.
* */
cc6_kiss_fft_cfg cc6_kiss_fft_alloc(int nfft,void * mem,size_t * lenmem )
{
cc6_kiss_fft_cfg st=NULL;
size_t memneeded = sizeof(struct cc6_kiss_fft_state)
+ sizeof(cc6_kiss_twiddle_cpx)*(nfft-1) + sizeof(int)*nfft; /* twiddle factors*/
if ( lenmem==NULL ) {
st = ( cc6_kiss_fft_cfg)cc6_KISS_FFT_MALLOC( memneeded );
}else{
if (mem != NULL && *lenmem >= memneeded)
st = (cc6_kiss_fft_cfg)mem;
*lenmem = memneeded;
}
if (st) {
int i;
st->nfft=nfft;
#ifndef FIXED_POINT
st->scale = 1./nfft;
#endif
#if defined(FIXED_POINT) && (!defined(DOUBLE_PRECISION) || defined(MIXED_PRECISION))
for (i=0;i<nfft;++i) {
cc6_celt_word32_t phase = -i;
kf_cexp2(st->twiddles+i, cc6_DIV32(cc6_SHL32(phase,17),nfft));
}
#else
for (i=0;i<nfft;++i) {
const double pi=3.14159265358979323846264338327;
double phase = ( -2*pi /nfft ) * i;
kf_cexp(st->twiddles+i, phase );
}
#endif
cc6_kf_factor(nfft,st->factors);
/* bitrev */
st->bitrev = (int*)((char*)st + memneeded - sizeof(int)*nfft);
cc6_compute_bitrev_table(0, st->bitrev, 1,1, st->factors,st);
}
return st;
}
void cc6_kiss_fft_stride(cc6_kiss_fft_cfg st,const cc6_kiss_fft_cpx *fin,cc6_kiss_fft_cpx *fout,int in_stride)
{
if (fin == fout)
{
cc6_celt_fatal("In-place FFT not supported");
} else {
/* Bit-reverse the input */
int i;
for (i=0;i<st->nfft;i++)
{
fout[st->bitrev[i]] = fin[i];
#ifndef FIXED_POINT
fout[st->bitrev[i]].r *= st->scale;
fout[st->bitrev[i]].i *= st->scale;
#endif
}
cc6_kf_work( fout, fin, 1,in_stride, st->factors,st, 1, in_stride, 1);
}
}
void cc6_kiss_fft(cc6_kiss_fft_cfg cfg,const cc6_kiss_fft_cpx *fin,cc6_kiss_fft_cpx *fout)
{
cc6_kiss_fft_stride(cfg,fin,fout,1);
}
void cc6_kiss_ifft_stride(cc6_kiss_fft_cfg st,const cc6_kiss_fft_cpx *fin,cc6_kiss_fft_cpx *fout,int in_stride)
{
if (fin == fout)
{
cc6_celt_fatal("In-place FFT not supported");
} else {
/* Bit-reverse the input */
int i;
for (i=0;i<st->nfft;i++)
fout[st->bitrev[i]] = fin[i];
cc6_ki_work( fout, fin, 1,in_stride, st->factors,st, 1, in_stride, 1);
}
}
void cc6_kiss_ifft(cc6_kiss_fft_cfg cfg,const cc6_kiss_fft_cpx *fin,cc6_kiss_fft_cpx *fout)
{
cc6_kiss_ifft_stride(cfg,fin,fout,1);
}
Reference in New Issue View Git Blame Copy Permalink