rpitx/csdr
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

made that spectrum even better

Browse source
This commit is contained in:
ha7ilm 2017-02-18 16:36:36 +01:00
parent 1fab87af1d
commit 5f772ec3e3
3 changed files with 4 additions and 4 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
csdr.c
View file

@ -1345,7 +1345,7 @@ int main(int argc, char *argv[])
//for(int=0;i<taps_length; i++) fprintf(stderr,"%g ",taps[i]);
fprintf(stderr,"fractional_decimator_ff: not using taps\n");
fractional_decimator_ff_t d = fractional_decimator_ff_init(rate, 6, NULL, 0);
fractional_decimator_ff_t d = fractional_decimator_ff_init(rate, 16, NULL, 0);
for(;;)
{
FEOF_CHECK;

4
grc_tests/test_fractional_decimator.grc
View file

@ -650,7 +650,7 @@
</param>
<param>
<key>y_divs</key>
<value>10</value>
<value>16</value>
</param>
<param>
<key>y_per_div</key>
@ -753,7 +753,7 @@
</param>
<param>
<key>y_divs</key>
<value>10</value>
<value>16</value>
</param>
<param>
<key>y_per_div</key>

2
libcsdr.c
View file

@ -734,7 +734,7 @@ void fractional_decimator_ff(float* input, float* output, int input_size, fracti
int index_high;
#define FD_INDEX_LOW (index_high-1)
//we optimize to calculate ceilf(where) only once every iteration, so we do it here:
for(;(index_high=ceilf(d->where))+d->xilast+1+d->taps_length<input_size;d->where+=d->rate) //@fractional_decimator_ff
for(;(index_high=ceilf(d->where))+d->num_poly_points+d->taps_length<input_size;d->where+=d->rate) //@fractional_decimator_ff
{
int sxifirst = FD_INDEX_LOW + d->xifirst;
int sxilast = FD_INDEX_LOW + d->xilast;