From 1b176cf6cd75c8031a140961655cdd3c16589a68 Mon Sep 17 00:00:00 2001 From: Clyne Sullivan Date: Sun, 9 Jan 2022 12:28:19 -0500 Subject: small changes; sig gen square(), triangle(), pulse() --- templates/3_fir.cpp | 47 ----------------------------------------------- 1 file changed, 47 deletions(-) delete mode 100644 templates/3_fir.cpp (limited to 'templates/3_fir.cpp') diff --git a/templates/3_fir.cpp b/templates/3_fir.cpp deleted file mode 100644 index 3a68500..0000000 --- a/templates/3_fir.cpp +++ /dev/null @@ -1,47 +0,0 @@ -/** - * 3_fir.cpp - * Written by Clyne Sullivan. - * - * The below code was written for applying FIR filters. While this is still essentially an overlap- - * save convolution, other optimizations have been made to allow for larger filters to be applied - * within the available execution time. Samples are also normalized so that they center around zero. - */ - -Sample *process_data(Samples samples) -{ - static Sample buffer[samples.size()]; - - // Define the filter: - constexpr unsigned int filter_size = 3; - static float filter[filter_size] = { - // Put filter values here (note: precision will be truncated for 'float' size). - 0.3333, 0.3333, 0.3333 - }; - - // Do an overlap-save convolution - static Sample prev[filter_size]; - - for (int n = 0; n < samples.size(); n++) { - // Using a float variable for accumulation allows for better code optimization - float v = 0; - - for (int k = 0; k < filter_size; k++) { - int i = n - (filter_size - 1) + k; - - auto s = i >= 0 ? samples[i] : prev[filter_size - 1 + i]; - // Sample values are 0 to 4095. Below, the original sample is normalized to a -1.0 to - // 1.0 range for calculation. - v += (s / 2048.f - 1) * filter[k]; - } - - // Return value to sample range of 0-4095. - buffer[n] = (v + 1) * 2048.f; - } - - // Save samples for next convolution - for (int i = 0; i < filter_size; i++) - prev[i] = samples[samples.size() - filter_size + i]; - - return buffer; -} - -- cgit v1.2.3