361 lines
10 KiB
C
361 lines
10 KiB
C
//NOTE DO NOT EDIT THIS FILE WITHOUT ALSO EDITING DFT12SMALL!!!
|
|
//WARNING: DFT8Turbo, DFT12Small is currently the only one that's actually working.
|
|
//THIS FILE DOES NOT CURRENTLY WORK.
|
|
|
|
#include <stdint.h>
|
|
#include <stdlib.h>
|
|
#include "DFT8Turbo.h"
|
|
#include <math.h>
|
|
|
|
#include <stdio.h>
|
|
|
|
#define MAX_FREQS (12)
|
|
#define OCTAVES (4)
|
|
/* Backporting notes:
|
|
* Change loop to only check if the output table says it's complete.
|
|
* Pre-multiply octaves in optable.
|
|
*/
|
|
|
|
/*
|
|
General procedure - use this code, with uint16_t or uint32_t buffers, and make sure none of the alarms go off.
|
|
All of the paths still require no more than an 8-bit multiply.
|
|
You should test with extreme cases, like square wave sweeps in, etc.
|
|
*/
|
|
|
|
//No larger than 8-bit signed values for integration or sincos
|
|
#define FRONTEND_AMPLITUDE (2)
|
|
#define INITIAL_DECIMATE (5) //Yurgh... only 3 bits of ADC data. That's 8 unique levels :(
|
|
#define INTEGRATOR_DECIMATE (8)
|
|
#define FINAL_DECIMATE (1)
|
|
|
|
|
|
#define OPTABLETYPE uint16_t //Make uint8_t if on attiny.
|
|
|
|
//4x the hits (sin/cos and we need to do it once for each edge)
|
|
//8x for selecting a higher octave.
|
|
#define FREQREBASE 8.0
|
|
#define TARGFREQ 10000.0
|
|
|
|
//These live in RAM.
|
|
int8_t running_integral; //Realistically treat as 12-bits on ramjet8
|
|
int8_t integral_at[MAX_FREQS*OCTAVES]; //For ramjet8, make 12-bits
|
|
int8_t cossindata[MAX_FREQS*OCTAVES*2]; //Contains COS and SIN data. (32-bit for now, will be 16-bit, potentially even 8.)
|
|
uint8_t which_octave_for_op[MAX_FREQS]; //counts up, tells you which ocative you are operating on. PUT IN RAM.
|
|
uint8_t actiontableplace;
|
|
|
|
#define NR_OF_OPS (4<<OCTAVES) /*64*/
|
|
//Format is:
|
|
// 255 = DO NOT OPERATE
|
|
// bits 0..4 = which octave
|
|
// bit 5 = even or odd (sin or cos) [UNUSED]
|
|
// bit 6 = reset
|
|
// bit 7 = add or subtract.
|
|
// bits 8..15 = octave base offset.
|
|
OPTABLETYPE optable[NR_OF_OPS]; //PUT IN FLASH
|
|
|
|
#define ACTIONTABLESIZE 256
|
|
uint16_t actiontable[ACTIONTABLESIZE]; //PUT IN FLASH // If there are more than 8 freqbins, this must be a uint16_t, otherwise if more than 16, 32.
|
|
//Format is
|
|
|
|
OPTABLETYPE mulmux[MAX_FREQS]; //PUT IN FLASH
|
|
|
|
static int Setup( float * frequencies, int bins )
|
|
{
|
|
int i;
|
|
printf( "BINS: %d\n", bins );
|
|
|
|
float highestf = frequencies[MAX_FREQS-1];
|
|
for( i = 0; i < MAX_FREQS; i++ )
|
|
{
|
|
mulmux[i] = (uint8_t)( highestf / frequencies[i] * 255 + 0.5 );
|
|
printf( "MM: %d %f / %f\n", mulmux[i], frequencies[i], highestf );
|
|
}
|
|
|
|
for( i = bins-MAX_FREQS; i < bins; i++ )
|
|
{
|
|
int topbin = i - (bins-MAX_FREQS);
|
|
float f = frequencies[i]/FREQREBASE;
|
|
float hits_per_table = (float)ACTIONTABLESIZE/f;
|
|
int dhrpertable = (int)(hits_per_table+.5);//TRICKY: You might think you need to have even number of hits (sin/cos), but you don't! It can flip sin/cos each time through the table!
|
|
float err = (TARGFREQ/((float)ACTIONTABLESIZE/dhrpertable) - (float)TARGFREQ/f)/((float)TARGFREQ/f);
|
|
//Perform an op every X samples. How well does this map into units of 1024?
|
|
printf( "%d %f -> hits per %d: %f %d (%.2f%% error)\n", topbin, f, ACTIONTABLESIZE, (float)ACTIONTABLESIZE/f, dhrpertable, err * 100.0 );
|
|
if( dhrpertable >= ACTIONTABLESIZE )
|
|
{
|
|
fprintf( stderr, "Error: Too many hits.\n" );
|
|
exit(0);
|
|
}
|
|
|
|
float advance_per_step = dhrpertable/(float)ACTIONTABLESIZE;
|
|
float fvadv = 0.5;
|
|
int j;
|
|
int countset = 0;
|
|
|
|
//Tricky: We need to start fadv off at such a place that there won't be a hicchup when going back around to 0.
|
|
// I believe this is done by setting fvadv to 0.5 initially. Unsure.
|
|
|
|
for( j = 0; j < ACTIONTABLESIZE; j++ )
|
|
{
|
|
if( fvadv >= 0.5 )
|
|
{
|
|
actiontable[j] |= 1<<(MAX_FREQS-1-topbin); //XXX-DEPARTURE (reversing the table symbols)
|
|
fvadv -= 1.0;
|
|
countset++;
|
|
}
|
|
fvadv += advance_per_step;
|
|
}
|
|
printf( " countset: %d\n", countset );
|
|
}
|
|
//exit(1);
|
|
|
|
|
|
int phaseinop[OCTAVES] = { 0 };
|
|
int already_hit_octaveplace[OCTAVES*2] = { 0 };
|
|
for( i = 0; i < NR_OF_OPS; i++ )
|
|
{
|
|
int longestzeroes = 0;
|
|
int val = i & ((1<<OCTAVES)-1);
|
|
for( longestzeroes = 0; longestzeroes < 255 && ( ((val >> longestzeroes) & 1) == 0 ); longestzeroes++ );
|
|
//longestzeroes goes: 255, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, ...
|
|
//This isn't great, because we need to also know whether we are attacking the SIN side or the COS side, and if it's + or -.
|
|
//We can actually decide that out.
|
|
|
|
if( longestzeroes == 255 )
|
|
{
|
|
//This is a nop. Emit a nop.
|
|
optable[i] = 65535;
|
|
}
|
|
else
|
|
{
|
|
longestzeroes = OCTAVES-1-longestzeroes; //Actually do octave 0 least often.
|
|
int iop = phaseinop[longestzeroes]++;
|
|
int toop = longestzeroes;
|
|
int toopmon = (longestzeroes<<1) | (iop & 1);
|
|
|
|
//if it's the first time an octave happened this set, flag it. This may be used later in the process.
|
|
if( !already_hit_octaveplace[toopmon] )
|
|
{
|
|
already_hit_octaveplace[toopmon] = 1;
|
|
toop |= 1<<5;
|
|
}
|
|
|
|
if( iop & 1 )
|
|
{
|
|
toop |= 1<<6;
|
|
}
|
|
|
|
//Handle add/subtract bit.
|
|
if( iop & 2 ) toop |= 1<<4;
|
|
|
|
optable[i] = toop | ((longestzeroes*MAX_FREQS*2+(iop & 1))<<8);
|
|
|
|
//printf( " %d %d %d\n", iop, val, longestzeroes );
|
|
}
|
|
//printf( "HBT: %d = %d\n", i, optable[i] );
|
|
}
|
|
//exit(1);
|
|
|
|
return 0;
|
|
}
|
|
|
|
|
|
static uint16_t action;
|
|
static uint8_t note;
|
|
static uint8_t * memptr;
|
|
static uint16_t * romptr;
|
|
static uint8_t op;
|
|
static uint8_t note_offset; //Offset of current note.
|
|
static uint8_t octave;
|
|
static uint8_t intindex;
|
|
static int8_t diff;
|
|
static uint8_t tmp;
|
|
|
|
void Padauk8BitRun( int8_t adcval )
|
|
{
|
|
int16_t adcv = adcval;
|
|
adcv *= FRONTEND_AMPLITUDE;
|
|
if( adcv > 127 ) adcv = 127;
|
|
if( adcv < -128 ) adcv = -128;
|
|
running_integral += adcv>>INITIAL_DECIMATE;
|
|
|
|
uint8_t acc;
|
|
uint8_t * accM;
|
|
uint8_t mul2;
|
|
|
|
action = actiontable[actiontableplace++];
|
|
|
|
//Counts are approximate counts for PMS133
|
|
|
|
for( note = MAX_FREQS;
|
|
note; //1CYC/PAIRED
|
|
note--, //1CYC/PAIRED (dzsn)
|
|
action>>=1 //2CYC (slc x2)
|
|
)
|
|
{
|
|
//Everything inside this loop is executed ~3/4 * MAX_FREQS per audio sample. so.. ~9x.
|
|
//If op @ 4MHz, we get 44 cycles in here. I don't think we can do it.
|
|
|
|
//If no operation is scheduled, continue.
|
|
if( !( action & 1 ) ) continue; //1CYC
|
|
|
|
accM = which_octave_for_op - 1; //1CYC
|
|
accM = accM + note; //1CYC
|
|
//accM now points to the memory address containing which step we're on.
|
|
//We can use that to figure out which octave we should operate with.
|
|
memptr = accM; //1CYC
|
|
acc = *memptr; //2CYC (idxm)
|
|
acc++; //1CYC
|
|
//acc now contains the actual place we are indexing off of.
|
|
//If it overflows, be sure to reset it.
|
|
if( acc == NR_OF_OPS+1 )
|
|
{
|
|
acc = 1;
|
|
continue;
|
|
}
|
|
//We then update the memory with the new data.
|
|
*memptr = acc; //2CYC (idxm)
|
|
|
|
//Now, we look up in optable what we're supposed to do.
|
|
accM = ((uint8_t*)optable) + acc*2; //1CYC -> ROM dad is stored in word pairs.
|
|
romptr = (uint16_t*)accM; //1CYC
|
|
acc = *romptr; //2CYC (ldtabl)
|
|
|
|
//If we are on the one operation we aren't supposed to operate within, we should cancel and loop around.
|
|
//XXX XXX XXX XXX XXX This is wrong. We should probably handle this logic above.
|
|
//XXX XXX XXX XXX XXX Logic handled above. XXX PICK UP HERE!!!
|
|
printf( "+ %d %d %d\n", note, acc, *memptr );
|
|
//if( acc == 255 ) //2CYC
|
|
//{
|
|
// //This way, when we loop back around, it will be at index 0, and everything should flow gracefully.
|
|
// *memptr = 255;
|
|
// continue;
|
|
//}
|
|
if( acc == 255 )
|
|
{
|
|
//We dun goofed.
|
|
fprintf( stderr, "Goofed.\n" );
|
|
exit( 0 );
|
|
}
|
|
|
|
//This actually reads the current octave specifier into "op"
|
|
//BIT7: add or subtract
|
|
//BIT6: reset
|
|
//BIT5: Even or odd?
|
|
//BITS 0..4 = Which octave.
|
|
op = acc; //1CYC
|
|
|
|
acc = (*romptr)>>8; //2CYC (ldtabh) -> Contains memory offset of which note to use.
|
|
note_offset = acc;
|
|
acc = acc + note; //1CYC
|
|
accM = (uint8_t*)integral_at-1 + acc; //1CYC
|
|
memptr = accM; //1CYC
|
|
acc = *memptr; //2CYC idxm
|
|
|
|
//acc now contains the running integral of the last time we were on this cell.
|
|
if( op & (1<<7) ) //ADD //2CYC
|
|
{
|
|
acc = acc - running_integral; //1CYC
|
|
}
|
|
else //SUBTRACT
|
|
{
|
|
tmp = acc; //1CYC
|
|
acc = running_integral; //1CYC
|
|
acc = acc - tmp; //1CYC
|
|
}
|
|
|
|
diff = acc; //1CYC
|
|
|
|
//Assume 2 extra cycles of overhead for if/else. //2 CYC
|
|
|
|
acc = running_integral; //1CYC
|
|
//Store the current running integral back into this note's running integral for next time.
|
|
*memptr = acc; //2CYC
|
|
|
|
// op = info about what op we're on. WARNING: Bitfield.
|
|
// diff = how much to add to current value.
|
|
// note_offset = index of current operative note position.
|
|
octave = op & 0x1f; //XXX TODO
|
|
|
|
printf( "%d %d %d %d\n", op, diff, note_offset, octave );
|
|
accM = (uint8_t*)(mulmux - 1); //1CYC
|
|
accM = accM + note*2; //1CYC
|
|
romptr = accM; //1CYC
|
|
acc = *romptr; //2CYC
|
|
mul2 = acc; //1CYC
|
|
|
|
if( diff < 0 ) //[2CYC] (t0sn on MSB)
|
|
{
|
|
diff *= -1; //[1CYC] (neg M)
|
|
diff >>= (OCTAVES-1-octave); // ???TRICKY??? Should this be a multiply?
|
|
|
|
//if( diff > 250 ) printf( "!!!!!!!**** %d ****!!!!!!!\n", diff );
|
|
|
|
diff = ((uint16_t)diff * (uint16_t)mul2)>>INTEGRATOR_DECIMATE; //[3CYC]
|
|
diff *= -1; //[1CYC]
|
|
}
|
|
else
|
|
{
|
|
diff >>= (OCTAVES-1-octave);
|
|
//if( diff > 250 ) printf( "!!!!!!!**** %d ****!!!!!!!\n", diff );
|
|
diff = ((uint16_t)diff * (uint16_t)mul2)>>INTEGRATOR_DECIMATE;
|
|
}
|
|
|
|
//@48 cycles :( :( :(
|
|
|
|
//printf( "%d\n", diff );
|
|
|
|
int8_t tmp =
|
|
cossindata[intindex] //[3CYC]
|
|
+ diff //[1CYC]
|
|
- (cossindata[intindex]>>4) //[2CYC]
|
|
;
|
|
|
|
if( tmp > 0 ) tmp--; //2CYC
|
|
if( tmp < 0 ) tmp++; //2CYC
|
|
cossindata[intindex] = tmp; //2CYC
|
|
//60ish cycles :( :( :(
|
|
}
|
|
}
|
|
|
|
|
|
void DoDFT8BitPadauk( float * outbins, float * frequencies, int bins, const float * databuffer, int place_in_data_buffer, int size_of_data_buffer, float q, float speedup )
|
|
{
|
|
static int is_setup;
|
|
if( !is_setup ) { is_setup = 1; Setup( frequencies, bins ); }
|
|
static int last_place;
|
|
int i;
|
|
|
|
for( i = last_place; i != place_in_data_buffer; i = (i+1)%size_of_data_buffer )
|
|
{
|
|
int16_t ifr1 = (int16_t)( ((databuffer[i]) ) * 4095 );
|
|
Padauk8BitRun( ifr1>>5 ); //5 = Actually only feed algorithm numbers from -128 to 127.
|
|
}
|
|
last_place = place_in_data_buffer;
|
|
|
|
static int idiv;
|
|
idiv++;
|
|
#if 1
|
|
for( i = 0; i < bins; i++ )
|
|
{
|
|
int iss = cossindata[i*2+0]>>FINAL_DECIMATE;
|
|
int isc = cossindata[i*2+1]>>FINAL_DECIMATE;
|
|
int mux = iss * iss + isc * isc;
|
|
|
|
if( mux <= 0 )
|
|
{
|
|
outbins[i] = 0;
|
|
}
|
|
else
|
|
{
|
|
outbins[i] = sqrt((float)mux)/50.0;
|
|
|
|
if( abs( cossindata[i*2+0] ) > 120 || abs( cossindata[i*2+1] ) > 120 )
|
|
printf( "CS OVF %d/%d/%d/%f\n", i, cossindata[i*2+0], cossindata[i*2+1],outbins[i] );
|
|
|
|
}
|
|
}
|
|
#endif
|
|
}
|
|
|
|
|