ref: dd88a3bf36323b1917aad54943766529bcfbe9d0
dir: /modules/paulstretch.c/
/* * PaulStretch * * An implementation of the PaulStretch algorithm by Paul Nasca Octavian. * This code is based off the Python Numpy/Scipy implementation of * PaulStretch, found here: https://github.com/paulnasca/paulstretch_python * * This implementation has been placed in the public domain. */ #include <stdlib.h> #include <string.h> #include <math.h> #include "soundpipe.h" #include "kiss_fftr.h" #ifndef M_PI #define M_PI 3.14159265358979323846 #endif static void compute_block(sp_data *sp, sp_paulstretch *p) { uint32_t istart_pos = floor(p->start_pos); uint32_t pos; uint32_t i; uint32_t windowsize = p->windowsize; uint32_t half_windowsize = p->half_windowsize; SPFLOAT *buf = p->buf; SPFLOAT *hinv_buf = p->hinv_buf; SPFLOAT *old_windowed_buf= p->old_windowed_buf; SPFLOAT *tbl = p->ft->tbl; SPFLOAT *window = p->window; SPFLOAT *output= p->output; for (i = 0; i < windowsize; i++) { /* Loop through buffer */ pos = (istart_pos + i); if (p->wrap) { pos %= p->ft->size; } if (pos < p->ft->size) { buf[i] = tbl[pos] * window[i]; } else { buf[i] = 0; } } kiss_fftr(p->fft, buf, p->tmp1); for (i = 0; i < windowsize / 2; i++) { SPFLOAT mag = sqrt(p->tmp1[i].r*p->tmp1[i].r + p->tmp1[i].i*p->tmp1[i].i); SPFLOAT ph = ((SPFLOAT)sp_rand(sp) / SP_RANDMAX) * 2 * M_PI; p->tmp1[i].r = mag * cos(ph); p->tmp1[i].i = mag * sin(ph); } kiss_fftri(p->ifft, p->tmp1, buf); for (i = 0; i < windowsize; i++) { buf[i] *= window[i]; if (i < half_windowsize) { output[i] = (SPFLOAT)(buf[i] + old_windowed_buf[half_windowsize + i]) / windowsize; output[i] *= hinv_buf[i]; } old_windowed_buf[i] = buf[i]; } p->start_pos += p->displace_pos; } int sp_paulstretch_create(sp_paulstretch **p) { *p = malloc(sizeof(sp_paulstretch)); return SP_OK; } int sp_paulstretch_destroy(sp_paulstretch **p) { sp_paulstretch *pp = *p; sp_auxdata_free(&pp->m_window); sp_auxdata_free(&pp->m_old_windowed_buf); sp_auxdata_free(&pp->m_hinv_buf); sp_auxdata_free(&pp->m_buf); sp_auxdata_free(&pp->m_output); kiss_fftr_free(pp->fft); kiss_fftr_free(pp->ifft); KISS_FFT_FREE(pp->tmp1); free(*p); return SP_OK; } int sp_paulstretch_init(sp_data *sp, sp_paulstretch *p, sp_ftbl *ft, SPFLOAT windowsize, SPFLOAT stretch) { uint32_t i; SPFLOAT hinv_sqrt2; kiss_fft_cpx *tmp1; p->ft = ft; p->windowsize = (uint32_t)(sp->sr * windowsize); p->stretch = stretch; if (p->windowsize < 16) p->windowsize = 16; p->half_windowsize = p->windowsize / 2; p->displace_pos = (p->windowsize * 0.5) / p->stretch; sp_auxdata_alloc(&p->m_window, sizeof(SPFLOAT) * p->windowsize); p->window = p->m_window.ptr; sp_auxdata_alloc(&p->m_old_windowed_buf, sizeof(SPFLOAT) * p->windowsize); p->old_windowed_buf = p->m_old_windowed_buf.ptr; sp_auxdata_alloc(&p->m_hinv_buf, sizeof(SPFLOAT) * p->half_windowsize); p->hinv_buf = p->m_hinv_buf.ptr; sp_auxdata_alloc(&p->m_buf, sizeof(SPFLOAT) * p->windowsize); p->buf = p->m_buf.ptr; sp_auxdata_alloc(&p->m_output, sizeof(SPFLOAT) * p->half_windowsize); p->output = p->m_output.ptr; /* Create Hann window */ for (i = 0; i < p->windowsize; i++) { p->window[i] = 0.5 - cos(i * 2.0 * M_PI / (p->windowsize - 1)) * 0.5; } /* creatve inverse hann window */ hinv_sqrt2 = (1 + sqrt(0.5)) * 0.5; for (i = 0; i < p->half_windowsize; i++) { p->hinv_buf[i] = hinv_sqrt2 - (1.0 - hinv_sqrt2) * cos(i * 2.0 * M_PI / p->half_windowsize); } p->start_pos = 0.0; p->counter = 0; /* set up kissfft */ p->fft = kiss_fftr_alloc(p->windowsize, 0, NULL, NULL); p->ifft = kiss_fftr_alloc(p->windowsize, 1, NULL, NULL); tmp1 = malloc(sizeof(kiss_fft_cpx) * p->windowsize); memset(tmp1, 0, sizeof(SPFLOAT) * p->windowsize); p->tmp1 = tmp1; /* turn on wrap mode by default */ p->wrap = 1; return SP_OK; } int sp_paulstretch_compute(sp_data *sp, sp_paulstretch *p, SPFLOAT *in, SPFLOAT *out) { if (p->counter == 0) compute_block(sp, p); *out = p->output[p->counter]; p->counter = (p->counter + 1) % p->half_windowsize; return SP_OK; }