mirror of
https://github.com/mborgerding/kissfft.git
synced 2025-05-27 13:10:26 -04:00
fast convolution filtering works at least for complex numbers.
This commit is contained in:
Mark Borgerding
parent
212ec326e0
commit
0243552944
@ -15,6 +15,7 @@ SELFTEST=st_$(DATATYPE)
|
||||
TESTREAL=tr_$(DATATYPE)
|
||||
TESTKFC=tkfc_$(DATATYPE)
|
||||
FFTUTIL=kf_$(DATATYPE)
|
||||
FASTFILT=ff_$(DATATYPE)
|
||||
|
||||
ifeq "$(DATATYPE)" "short"
|
||||
TYPEFLAGS=-DFIXED_POINT -Dkiss_fft_scalar=short
|
||||
@ -32,13 +33,17 @@ else
|
||||
endif
|
||||
|
||||
|
||||
all: $(BENCHKISS) $(SELFTEST) $(BENCHFFTW) $(TESTREAL) $(FFTUTIL) $(TESTKFC)
|
||||
all: $(BENCHKISS) $(SELFTEST) $(BENCHFFTW) $(TESTREAL) $(FFTUTIL) \
|
||||
$(TESTKFC) $(FASTFILT)
|
||||
|
||||
CFLAGS=-Wall -O3 -pedantic -march=pentiumpro -ffast-math -fomit-frame-pointer
|
||||
#-DUSE_SKIP
|
||||
# If the above flags do not work, try the following
|
||||
#CFLAGS=-Wall -O3
|
||||
|
||||
$(FASTFILT): ../kiss_fft.c kiss_fastfir.c kiss_fftr.c
|
||||
$(CC) -o $@ $(CFLAGS) -I.. $(TYPEFLAGS) -lm $+ -DFAST_FILT_UTIL
|
||||
|
||||
$(FFTUTIL): ../kiss_fft.c fftutil.c kiss_fftnd.c kiss_fftr.c
|
||||
$(CC) -o $@ $(CFLAGS) -I.. $(TYPEFLAGS) -lm $+
|
||||
|
||||
|
||||
@ -44,9 +44,9 @@ def fastfilter(sig,h,nfft=None):
|
||||
return concatenate( res )
|
||||
|
||||
def main():
|
||||
siglen = 1e5
|
||||
hlen = 500
|
||||
nfft = 1024*4
|
||||
siglen = 1e4
|
||||
hlen = 50
|
||||
nfft = 128
|
||||
print 'nfft=%d'%nfft
|
||||
# make a signal
|
||||
sig = make_random( siglen )
|
||||
@ -57,14 +57,28 @@ def main():
|
||||
# perform MAC filtering
|
||||
yslow = slowfilter(sig,h)
|
||||
#print '<YSLOW>',yslow,'</YSLOW>'
|
||||
yfast = fastfilter(sig,h,nfft)
|
||||
#yfast = fastfilter(sig,h,nfft)
|
||||
yfast = utilfastfilter(sig,h,nfft)
|
||||
#print yfast
|
||||
print 'len(yslow)=%d'%len(yslow)
|
||||
print 'len(yfast)=%d'%len(yfast)
|
||||
diff = yslow-yfast
|
||||
snr = 10*log10( vdot(yslow,yslow) / vdot(diff,diff) )
|
||||
snr = 10*log10( abs( vdot(yslow,yslow) / vdot(diff,diff) ) )
|
||||
print 'snr=%s' % snr
|
||||
if snr < 10.0:
|
||||
print yslow[:5]
|
||||
print yfast[:5]
|
||||
|
||||
def utilfastfilter(sig,h,nfft):
|
||||
import compfft
|
||||
import os
|
||||
open( 'sig.dat','w').write( compfft.dopack(sig,'f',1) )
|
||||
open( 'h.dat','w').write( compfft.dopack(h,'f',1) )
|
||||
cmd = './ff_float -n %d -i sig.dat -h h.dat -o out.dat' % nfft
|
||||
print cmd
|
||||
ec = os.system(cmd)
|
||||
print 'exited->',ec
|
||||
return compfft.dounpack(open('out.dat').read(),'f',1)
|
||||
|
||||
if __name__ == "__main__":
|
||||
main()
|
||||
|
||||
@ -15,6 +15,7 @@ SELFTEST=st_$(DATATYPE)
|
||||
TESTREAL=tr_$(DATATYPE)
|
||||
TESTKFC=tkfc_$(DATATYPE)
|
||||
FFTUTIL=kf_$(DATATYPE)
|
||||
FASTFILT=ff_$(DATATYPE)
|
||||
|
||||
ifeq "$(DATATYPE)" "short"
|
||||
TYPEFLAGS=-DFIXED_POINT -Dkiss_fft_scalar=short
|
||||
@ -32,13 +33,17 @@ else
|
||||
endif
|
||||
|
||||
|
||||
all: $(BENCHKISS) $(SELFTEST) $(BENCHFFTW) $(TESTREAL) $(FFTUTIL) $(TESTKFC)
|
||||
all: $(BENCHKISS) $(SELFTEST) $(BENCHFFTW) $(TESTREAL) $(FFTUTIL) \
|
||||
$(TESTKFC) $(FASTFILT)
|
||||
|
||||
CFLAGS=-Wall -O3 -pedantic -march=pentiumpro -ffast-math -fomit-frame-pointer
|
||||
#-DUSE_SKIP
|
||||
# If the above flags do not work, try the following
|
||||
#CFLAGS=-Wall -O3
|
||||
|
||||
$(FASTFILT): ../kiss_fft.c kiss_fastfir.c kiss_fftr.c
|
||||
$(CC) -o $@ $(CFLAGS) -I.. $(TYPEFLAGS) -lm $+ -DFAST_FILT_UTIL
|
||||
|
||||
$(FFTUTIL): ../kiss_fft.c fftutil.c kiss_fftnd.c kiss_fftr.c
|
||||
$(CC) -o $@ $(CFLAGS) -I.. $(TYPEFLAGS) -lm $+
|
||||
|
||||
|
||||
295
tools/kiss_fastfir.c
Normal file
295
tools/kiss_fastfir.c
Normal file
@ -0,0 +1,295 @@
|
||||
/*
|
||||
Copyright (c) 2003, Mark Borgerding
|
||||
|
||||
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.
|
||||
*/
|
||||
|
||||
#include "_kiss_fft_guts.h"
|
||||
|
||||
void * kiss_fastfir_alloc(const kiss_fft_cpx * imp_resp,size_t n_imp_resp,
|
||||
int nfft,void * mem,size_t*lenmem);
|
||||
|
||||
size_t kiss_fastfir(const void * cfg,
|
||||
const kiss_fft_cpx *in, size_t nin,
|
||||
kiss_fft_cpx *out, size_t nout);
|
||||
|
||||
typedef struct {
|
||||
int minus5; /*magic */
|
||||
int nfft;
|
||||
size_t n_scrap;
|
||||
void * fftcfg;
|
||||
void * ifftcfg;
|
||||
kiss_fft_cpx * fir_freq_resp;
|
||||
size_t bufin_idx;
|
||||
kiss_fft_cpx * bufin;
|
||||
size_t bufout_idx;
|
||||
kiss_fft_cpx * bufout;
|
||||
kiss_fft_cpx * tmpbuf;
|
||||
}kiss_fastfir_state;
|
||||
|
||||
|
||||
void * kiss_fastfir_alloc(const kiss_fft_cpx * imp_resp,size_t n_imp_resp,
|
||||
int nfft,void * mem,size_t*lenmem)
|
||||
{
|
||||
kiss_fastfir_state *st = NULL;
|
||||
size_t len_fftcfg,len_ifftcfg;
|
||||
size_t memneeded = sizeof(kiss_fastfir_state);
|
||||
char * ptr;
|
||||
size_t i;
|
||||
float scale;
|
||||
|
||||
if (nfft<=0) {
|
||||
/* determine fft size as next power of two at least 2x
|
||||
the impulse response length*/
|
||||
int i=n_imp_resp-1;
|
||||
nfft=2;
|
||||
do{
|
||||
nfft<<=1;
|
||||
}while (i>>=1);
|
||||
}
|
||||
/*fftcfg*/
|
||||
kiss_fft_alloc (nfft, 0, NULL, &len_fftcfg);
|
||||
memneeded += len_fftcfg;
|
||||
/*ifftcfg*/
|
||||
kiss_fft_alloc (nfft, 1, NULL, &len_ifftcfg);
|
||||
memneeded += len_ifftcfg;
|
||||
|
||||
/* fir_freq_resp */
|
||||
memneeded += sizeof(kiss_fft_cpx) * nfft;
|
||||
/* bufin */
|
||||
memneeded += sizeof(kiss_fft_cpx) * nfft;
|
||||
/* bufout */
|
||||
memneeded += sizeof(kiss_fft_cpx) * nfft;
|
||||
/* tmpbuf */
|
||||
memneeded += sizeof(kiss_fft_cpx) * nfft;
|
||||
|
||||
if (lenmem == NULL) {
|
||||
st = (kiss_fastfir_state *) malloc (memneeded);
|
||||
} else {
|
||||
if (*lenmem >= memneeded)
|
||||
st = (kiss_fastfir_state *) mem;
|
||||
*lenmem = memneeded;
|
||||
}
|
||||
if (!st)
|
||||
return NULL;
|
||||
|
||||
st->minus5 = -5;
|
||||
st->nfft = nfft;
|
||||
st->n_scrap = n_imp_resp-1;
|
||||
st->bufin_idx = 0;
|
||||
st->bufout_idx = nfft;
|
||||
ptr=(char*)(st+1);
|
||||
|
||||
st->fftcfg = (void*)ptr;
|
||||
ptr += len_fftcfg;
|
||||
|
||||
st->ifftcfg = (void*)ptr;
|
||||
ptr += len_ifftcfg;
|
||||
|
||||
st->fir_freq_resp = (kiss_fft_cpx*)ptr;
|
||||
ptr += sizeof(kiss_fft_cpx) * nfft;
|
||||
|
||||
st->bufin = (kiss_fft_cpx*)ptr;
|
||||
ptr += sizeof(kiss_fft_cpx) * nfft;
|
||||
|
||||
st->bufout = (kiss_fft_cpx*)ptr;
|
||||
ptr += sizeof(kiss_fft_cpx) * nfft;
|
||||
|
||||
st->tmpbuf = (kiss_fft_cpx*)ptr;
|
||||
ptr += sizeof(kiss_fft_cpx) * nfft;
|
||||
|
||||
kiss_fft_alloc (nfft,0,st->fftcfg , &len_fftcfg);
|
||||
kiss_fft_alloc (nfft,1,st->ifftcfg , &len_ifftcfg);
|
||||
|
||||
memset(st->fir_freq_resp,0,sizeof(kiss_fft_cpx)*nfft);
|
||||
memcpy(st->fir_freq_resp,imp_resp,sizeof(kiss_fft_cpx)*n_imp_resp);
|
||||
kiss_fft(st->fftcfg,st->fir_freq_resp,st->fir_freq_resp);
|
||||
|
||||
scale = 1.0 / st->nfft;
|
||||
|
||||
for (i=0;i < st->nfft;++i) {
|
||||
st->fir_freq_resp[i].r *= scale;
|
||||
st->fir_freq_resp[i].i *= scale;
|
||||
}
|
||||
|
||||
return st;
|
||||
}
|
||||
|
||||
static
|
||||
size_t write_output(kiss_fastfir_state *st,
|
||||
kiss_fft_cpx *out,size_t * pnout,size_t zpadded)
|
||||
{
|
||||
size_t nout = *pnout;
|
||||
size_t n2flush = st->nfft - st->bufout_idx;
|
||||
if (zpadded)
|
||||
n2flush -= zpadded;
|
||||
if ( nout < n2flush )
|
||||
n2flush=nout;
|
||||
memcpy(out,st->bufout + st->bufout_idx, sizeof(kiss_fft_cpx)*n2flush );
|
||||
st->bufout_idx += n2flush;
|
||||
*pnout = nout - n2flush;
|
||||
return n2flush;
|
||||
}
|
||||
|
||||
static void do_fastconv(kiss_fastfir_state *st)
|
||||
{
|
||||
int i;
|
||||
if ( st->bufout_idx < st->nfft ) {
|
||||
fprintf(stderr,"kiss_fastfir warning: "
|
||||
" output buffer size must be >= input buffer size,"
|
||||
" %d samples lost\n",st->nfft - st->bufout_idx );
|
||||
}
|
||||
//FFT st->bufin to st->bufout
|
||||
kiss_fft(st->fftcfg,st->bufin,st->bufout);
|
||||
|
||||
// shift tail to front of input buffer
|
||||
memcpy( st->bufin,
|
||||
st->bufin + st->nfft - st->n_scrap,
|
||||
sizeof(kiss_fft_cpx)*st->n_scrap);
|
||||
//set input idx to the next input spot
|
||||
st->bufin_idx = st->n_scrap;
|
||||
|
||||
// multiply the frequency response of the input signal by
|
||||
// that of the fir filter
|
||||
for (i=0;i<st->nfft;++i)
|
||||
C_MUL(st->tmpbuf[i],st->bufout[i],st->fir_freq_resp[i]);
|
||||
|
||||
// perform the inverse fft
|
||||
kiss_fft(st->ifftcfg,st->tmpbuf,st->bufout);
|
||||
|
||||
// need to skip over junk caused by circular convolution
|
||||
st->bufout_idx = st->n_scrap;
|
||||
}
|
||||
|
||||
size_t kiss_fastfir(const void * cfg,
|
||||
const kiss_fft_cpx *in, size_t nin,
|
||||
kiss_fft_cpx *out, size_t nout_avail)
|
||||
{
|
||||
size_t nout_orig=nout_avail;
|
||||
kiss_fastfir_state *st = ( kiss_fastfir_state *)cfg;
|
||||
|
||||
out += write_output(st,out,&nout_avail,0);
|
||||
|
||||
if ( nin <= 0 ) {
|
||||
size_t zero_pad = st->nfft - st->bufin_idx;
|
||||
memset( st->bufin + st->bufin_idx, 0, zero_pad*sizeof(kiss_fft_cpx) );
|
||||
st->bufin_idx = st->nfft;
|
||||
do_fastconv(st);
|
||||
fprintf(stderr,"padded with %d zeros\n",zero_pad);
|
||||
return write_output(st,out,&nout_avail,zero_pad);
|
||||
}
|
||||
|
||||
while (nin--) {
|
||||
// copy the input sample to bufin
|
||||
st->bufin[st->bufin_idx++] = *in++;
|
||||
|
||||
// when the input buffer is full, perform fast convolution
|
||||
if ( st->bufin_idx == st->nfft ) {
|
||||
do_fastconv(st);
|
||||
// write the output buffer
|
||||
out += write_output(st,out,&nout_avail,0);
|
||||
}
|
||||
}
|
||||
return nout_orig - nout_avail;
|
||||
}
|
||||
|
||||
#ifdef FAST_FILT_UTIL
|
||||
|
||||
#define BUFLEN 1024
|
||||
|
||||
void do_filter(
|
||||
FILE * fin,
|
||||
FILE * fout,
|
||||
const kiss_fft_cpx * imp_resp,
|
||||
size_t n_imp_resp,
|
||||
size_t nfft)
|
||||
{
|
||||
void * cfg = kiss_fastfir_alloc(imp_resp,n_imp_resp,nfft,0,0);
|
||||
kiss_fft_cpx inbuf[BUFLEN],outbuf[BUFLEN];
|
||||
size_t ninbuf,noutbuf;
|
||||
do{
|
||||
ninbuf = fread(inbuf,sizeof(kiss_fft_cpx),BUFLEN,fin );
|
||||
// when ninbuf <= 0, that signals a flush
|
||||
noutbuf = kiss_fastfir(cfg,inbuf,ninbuf,outbuf,BUFLEN);
|
||||
if ( fwrite(outbuf,sizeof(kiss_fft_cpx),noutbuf,fout) != noutbuf ) {
|
||||
fprintf(stderr,"short write\n");
|
||||
exit(1);
|
||||
}
|
||||
}while(ninbuf>0);
|
||||
fclose(fout);
|
||||
free(cfg);
|
||||
}
|
||||
|
||||
#include <unistd.h>
|
||||
int main(int argc,char**argv)
|
||||
{
|
||||
kiss_fft_cpx * h;
|
||||
size_t nh,nfft=0;
|
||||
FILE *fin=stdin;
|
||||
FILE *fout=stdout;
|
||||
FILE *filtfile=NULL;
|
||||
while (1) {
|
||||
int c=getopt(argc,argv,"n:h:i:o:");
|
||||
if (c==-1) break;
|
||||
switch (c) {
|
||||
case 'n':
|
||||
nfft=atoi(optarg);
|
||||
break;
|
||||
case 'i':
|
||||
fin = fopen(optarg,"rb");
|
||||
if (fin==NULL) {
|
||||
perror(optarg);
|
||||
exit(1);
|
||||
}
|
||||
break;
|
||||
case 'o':
|
||||
fout = fopen(optarg,"wb");
|
||||
if (fout==NULL) {
|
||||
perror(optarg);
|
||||
exit(1);
|
||||
}
|
||||
break;
|
||||
case 'h':
|
||||
filtfile = fopen(optarg,"rb");
|
||||
if (filtfile==NULL) {
|
||||
perror(optarg);
|
||||
exit(1);
|
||||
}
|
||||
break;
|
||||
case '?':
|
||||
fprintf(stderr,"usage options:\n"
|
||||
"\t-i filename: input file\n"
|
||||
"\t-o filename: output(filtered) file\n"
|
||||
"\t-h filename: impulse response\n");
|
||||
exit (1);
|
||||
default:fprintf(stderr,"bad %c\n",c);break;
|
||||
}
|
||||
}
|
||||
if (filtfile==NULL) {
|
||||
fprintf(stderr,"You must supply the FIR coeffs via -h\n");
|
||||
exit(1);
|
||||
}
|
||||
fseek(filtfile,0,SEEK_END);
|
||||
nh = ftell(filtfile) / sizeof(kiss_fft_cpx);
|
||||
fprintf(stderr,"%d samples in FIR filter\n",nh);
|
||||
h = (kiss_fft_cpx*)malloc(sizeof(kiss_fft_cpx)*nh);
|
||||
fseek(filtfile,0,SEEK_SET);
|
||||
fread(h,sizeof(kiss_fft_cpx),nh,filtfile);
|
||||
fclose(filtfile);
|
||||
|
||||
do_filter( fin, fout, h,nh,nfft);
|
||||
|
||||
if (fout!=stdout) fclose(fout);
|
||||
if (fin!=stdin) fclose(fin);
|
||||
|
||||
return 0;
|
||||
}
|
||||
#endif
|
||||
Loading…
Reference in New Issue
Block a user