Fixed-point error analysis of rectangular transform
暂无分享,去创建一个
The fixed-point error analysis of long length RT's is presented assuming sign-magnitude or 1's complement arithmetic. The errors introduced by the input-addltion, multiplication and the output-addition stages are separately considered in each dimension and are suitably combined to give the average output noise variance. The various error components signifying the characteristics error parameters of a module are obtained for each short length RT. Filters of different transform lengths are chosen for illustration. The theoretical noise variance obtained in each case is found to have excellent agreement with the corresponding simulated results. The noise performance of RT and FFT filters is also compared. It is seen that the input noise has worsened by a factor of 3.8 bits in passing through an RT filter compared to 6.15 bits as in case of FFT filter.
[1] A. Oppenheim,et al. Effects of finite register length in digital filtering and the fast Fourier transform , 1972 .
[2] V. Umapathi Reddy,et al. Convolution algorithms for small-word-length digital-filtering applications , 1979 .
[3] V. Reddy,et al. Complex rectangular transforms for digital convolution , 1980 .
[4] H. Nussbaumer. Fast Fourier transform and convolution algorithms , 1981 .
[5] J. Cooley,et al. New algorithms for digital convolution , 1977 .