
Be the first to like this
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.
Published on
In this correspondence the analysis of overall
quantization loss for the Fast Fourier Transform (FFT)
algorithms is extended to the case where the twiddle factor
word length is different from the register word length. First,
a statistical noise model to predict the Quantization error
after the multiplication of two quantized signals, of different
precision, is presented. This model is then applied to FFT
algorithms. Simulation results, that corroborate the
theoretical analysis, are then presented.
Clipping is a handy way to collect and organize the most important slides from a presentation. You can keep your great finds in clipboards organized around topics.
Be the first to comment