In the cascade form of realization, how many bits are typically sufficient to represent the FIR filter coefficients in order to avoid the severe effects of coefficient quantization?

Consider an 8-point DFT implemented via a radix-2 decimation-in-frequency (DIF) FFT algorithm. If we only count the non-trivial complex multiplications required across the stages (excluding multiplications by 1), what is the total number of complex multiplications?

Consider the following statements regarding Finite Impulse Response (FIR) filters: 1. They are non-recursive. 2. They use feedback. 3. They are recursive. 4. They do not utilize feedback. Which of the statements given above are correct?