Background We studied C code for implementing a linear and a circular buffer in the FIR. filter k*n - This problem is going to explore the limits of calculations in real-time environ- ments. Let's assume that we have Processor AUDIO available for an audio processor application. This processor has many characteristics, among these you might finde some useful: 50Mhz clock It is a DSP, and so an integer MAC takes one CPU cycle A floating point MAC (half format) requires 25 CPU cycles A RAM access requires 10 CPU cycles A register access requires 1 CPU cycle, and AUDIO has 40 general registers available An A/D access requires 3 CPU cycles while a D/A access only requires 2 CPU cycles a 2 operand integer operation requires 1 CPU cycle 1. How many clock cycles do you have available to compute and present the output sample? 2. Suppose that our FIR filter is implemented with a linear buffer. (a) What is the largest length FIR filter M that you can process using i. fixed poin 11. floating point 3. Repeat question 2 when a circular buffer is used. Background We studied C code for implementing a linear and a circular buffer in the FIR. filter k*n - This problem is going to explore the limits of calculations in real-time environ- ments. Let's assume that we have Processor AUDIO available for an audio processor application. This processor has many characteristics, among these you might finde some useful: 50Mhz clock It is a DSP, and so an integer MAC takes one CPU cycle A floating point MAC (half format) requires 25 CPU cycles A RAM access requires 10 CPU cycles A register access requires 1 CPU cycle, and AUDIO has 40 general registers available An A/D access requires 3 CPU cycles while a D/A access only requires 2 CPU cycles a 2 operand integer operation requires 1 CPU cycle 1. How many clock cycles do you have available to compute and present the output sample? 2. Suppose that our FIR filter is implemented with a linear buffer. (a) What is the largest length FIR filter M that you can process using i. fixed poin 11. floating point 3. Repeat question 2 when a circular buffer is used