Analysis of Mean-Square-Error (MSE) for fixed-point FFT units

Range and precision analysis are important steps in assigning suitable integer and fractional bit-widths to the fixed-point variables in a design such that no overflow occurs and a given error bound on maximum mismatch and (or) Mean-Square-Error (MSE) is satisfied. Although, range and maximum mismatch analysis of linear arithmetic circuits has been studied before [8], regarding analysis of MSE, the previous works [9,10,12] cannot analyze the error, when it is defined as the difference between the fixed-point circuit and the reference model, e.g., floating-point format. This paper presents an efficient analysis of MSE for linear arithmetic circuits narrowing on Fast Fourier Transform (FFT) units. Furthermore, an optimization algorithm is introduced to set the bit-widths in an FFT unit while satisfying a given maximum bound on MSE. Experimental results prove the robustness of our MSE analysis and the efficiency of the optimization algorithm compared to [12] for an 8K FFT unit.

[1]  Nicola Nicolici,et al.  Bit-Width Allocation for Hardware Accelerators for Scientific Computing Using SAT-Modulo Theory , 2010, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[2]  Robert W. Brodersen,et al.  Automated fixed-point data-type optimization tool for signal processing and communication systems , 2004, Proceedings. 41st Design Automation Conference, 2004..

[3]  Wayne Luk,et al.  The Multiple Wordlength Paradigm , 2001, The 9th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM'01).

[4]  Truong Q. Nguyen,et al.  On the Fixed-Point Accuracy Analysis of FFT Algorithms , 2008, IEEE Transactions on Signal Processing.

[5]  W. Luk,et al.  Truncation noise in fixed-point SFGs [digital filters] , 1999 .

[6]  Romuald Rocher,et al.  Analytical Fixed-Point Accuracy Evaluation in Linear Time-Invariant Systems , 2008, IEEE Transactions on Circuits and Systems I: Regular Papers.

[7]  O. Sarbishei,et al.  Analysis of precision for scaling the intermediate variables in fixed-point arithmetic circuits , 2010, 2010 IEEE/ACM International Conference on Computer-Aided Design (ICCAD).

[8]  Richard M. Jiang,et al.  An Area-Efficient FFT Architecture for OFDM Digital Video Broadcasting , 2007, IEEE Transactions on Consumer Electronics.

[9]  O. Sarbishei,et al.  Analysis of range and precision for fixed-point linear arithmetic circuits with feedbacks , 2010, 2010 IEEE International High Level Design Validation and Test Workshop (HLDVT).

[10]  Bing Yang,et al.  Multiplierless fast Fourier transform architecture , 2007 .

[11]  W. Luk,et al.  Truncation noise in fixed-point SFGs , 1999 .