Investigation of the performance degradation for different wordlength combinations in fixed-point recursive sinusoidal transform

Recursive sinusoidal 변환의 최적 fixed-point 연산구조에 관한 연구

This paper investigates the varying characteristics of the performance degradation resulting from the different combination of wordlength in fixed-point implementation of recursive sinusoidal transform. The performance degradation is analytically derived in the form of noise-to-signal power ratio. The best wordlength combination is shown to be the equal length distribution of the given number of bits between the transform coefficients and the data. The analysis results are also verified through the computer simulations.