* Function: R8FirstPass * * Description: radix-8 trivial pass for decimation-in-time FFT * * Inputs: buffer of (bit-reversed) samples * number of R8 butterflies per group (i.e. nfft / 8) * * Outputs: processed samples in same buffer * * Return: none * * Notes: assumes 3 guard bits, gains 1 integer bit * guard bits out = guard bits in - 3
source not stored for this graph (policy: none)