ref: 49baf6534697aea87abd1565646c9c02c522e0a1
dir: /tests/mdct-test.c/
#ifdef HAVE_CONFIG_H #include "config.h" #endif #include <stdio.h> #include "mdct.h" #define CELT_C #include "../libcelt/stack_alloc.h" #include "../libcelt/kiss_fft.c" #include "../libcelt/mdct.c" #ifndef M_PI #define M_PI 3.141592653 #endif #ifdef FIXED_DEBUG long long celt_mips=0; #endif int ret = 0; void check(kiss_fft_scalar * in,kiss_fft_scalar * out,int nfft,int isinverse) { int bin,k; double errpow=0,sigpow=0; double snr; for (bin=0;bin<nfft/2;++bin) { double ansr = 0; double difr; for (k=0;k<nfft;++k) { double phase = 2*M_PI*(k+.5+.25*nfft)*(bin+.5)/nfft; double re = cos(phase); re /= nfft/4; ansr += in[k] * re; } /*printf ("%f %f\n", ansr, out[bin]);*/ difr = ansr - out[bin]; errpow += difr*difr; sigpow += ansr*ansr; } snr = 10*log10(sigpow/errpow); printf("nfft=%d inverse=%d,snr = %f\n",nfft,isinverse,snr ); if (snr<60) { printf( "** poor snr: %f **\n", snr); ret = 1; } } void check_inv(kiss_fft_scalar * in,kiss_fft_scalar * out,int nfft,int isinverse) { int bin,k; double errpow=0,sigpow=0; double snr; for (bin=0;bin<nfft;++bin) { double ansr = 0; double difr; for (k=0;k<nfft/2;++k) { double phase = 2*M_PI*(bin+.5+.25*nfft)*(k+.5)/nfft; double re = cos(phase); //re *= 2; ansr += in[k] * re; } /*printf ("%f %f\n", ansr, out[bin]);*/ difr = ansr - out[bin]; errpow += difr*difr; sigpow += ansr*ansr; } snr = 10*log10(sigpow/errpow); printf("nfft=%d inverse=%d,snr = %f\n",nfft,isinverse,snr ); if (snr<60) { printf( "** poor snr: %f **\n", snr); ret = 1; } } void test1d(int nfft,int isinverse) { mdct_lookup cfg; size_t buflen = sizeof(kiss_fft_scalar)*nfft; kiss_fft_scalar * in = (kiss_fft_scalar*)malloc(buflen); kiss_fft_scalar * out= (kiss_fft_scalar*)malloc(buflen); celt_word16_t * window= (celt_word16_t*)malloc(sizeof(celt_word16_t)*nfft/2); int k; mdct_init(&cfg, nfft); for (k=0;k<nfft;++k) { in[k] = (rand() % 32768) - 16384; } for (k=0;k<nfft/2;++k) { window[k] = Q15ONE; } #ifdef DOUBLE_PRECISION for (k=0;k<nfft;++k) { in[k] *= 32768; } #endif if (isinverse) { for (k=0;k<nfft;++k) { in[k] /= nfft; } } /*for (k=0;k<nfft;++k) printf("%d %d ", in[k].r, in[k].i);printf("\n");*/ if (isinverse) { for (k=0;k<nfft;++k) out[k] = 0; mdct_backward(&cfg,in,out, window, nfft/2); check_inv(in,out,nfft,isinverse); } else { mdct_forward(&cfg,in,out,window, nfft/2); check(in,out,nfft,isinverse); } /*for (k=0;k<nfft;++k) printf("%d %d ", out[k].r, out[k].i);printf("\n");*/ free(in); free(out); mdct_clear(&cfg); } int main(int argc,char ** argv) { ALLOC_STACK; if (argc>1) { int k; for (k=1;k<argc;++k) { test1d(atoi(argv[k]),0); test1d(atoi(argv[k]),1); } }else{ test1d(32,0); test1d(32,1); test1d(256,0); test1d(256,1); test1d(512,0); test1d(512,1); #ifndef RADIX_TWO_ONLY test1d(40,0); test1d(40,1); test1d(56,0); test1d(56,1); test1d(120,0); test1d(120,1); test1d(240,0); test1d(240,1); test1d(480,0); test1d(480,1); #endif } return ret; }