Home
last modified time | relevance | path

Searched refs:dft_length (Results 1 – 3 of 3) sorted by relevance

/OK3568_Linux_fs/buildroot/dl/sox/git/src/
H A Ddft_filter.c31 f->dft_length = lsx_set_dft_length(f->num_taps); in lsx_set_dft_filter()
32 f->coefs = lsx_calloc(f->dft_length, sizeof(*f->coefs)); in lsx_set_dft_filter()
34 … f->coefs[(i + f->dft_length - f->num_taps + 1) & (f->dft_length - 1)] = h[i] / f->dft_length * 2; in lsx_set_dft_filter()
35 lsx_safe_rdft(f->dft_length, 1, f->coefs); in lsx_set_dft_filter()
57 while (num_in >= f->dft_length) { in filter()
59 fifo_read(&p->input_fifo, f->dft_length - overlap, NULL); in filter()
60 num_in -= f->dft_length - overlap; in filter()
62 output = fifo_reserve(&p->output_fifo, f->dft_length); in filter()
64 memcpy(output, input, f->dft_length * sizeof(*output)); in filter()
66 lsx_safe_rdft(f->dft_length, 1, output); in filter()
[all …]
H A Drate.c152 while (p->remL + p->L * num_in >= f->dft_length) { in dft_stage_fn()
153 div_t divd = div(f->dft_length - overlap - p->remL + p->L - 1, p->L); in dft_stage_fn()
158 output = fifo_reserve(output_fifo, f->dft_length); in dft_stage_fn()
160 int portion = f->dft_length / p->L; in dft_stage_fn()
169 for (portion <<= 1; i < f->dft_length; i += portion, portion <<= 1) { in dft_stage_fn()
175 memcpy(output, input, f->dft_length * sizeof(*output)); in dft_stage_fn()
177 memset(output, 0, f->dft_length * sizeof(*output)); in dft_stage_fn()
178 for (j = 0, i = p->remL; i < f->dft_length; ++j, i += p->L) in dft_stage_fn()
182 lsx_safe_rdft(f->dft_length, 1, output); in dft_stage_fn()
187 for (i = 2; i < f->dft_length; i += 2) { in dft_stage_fn()
[all …]
H A Ddft_filter.h6 int dft_length, num_taps, post_peak; member