论文信息 - Comments on "Sign/Logarithm Arithmetic for FFT Implementation'' - 字舞流文

Comments on "Sign/Logarithm Arithmetic for FFT Implementation''

This note points out several errors in the paper [1] by E. E. Swartzlander, Jr. et al. Corrected results are presented including detailed reasons and derivations.

Hongyuan Wang | Samuel C. Lee

[1] T. Kurokawa,et al. Error analysis of recursive digital filters implemented with logarithmic number systems , 1980 .

[2] W. Kenneth Jenkins,et al. The use of residue number systems in the design of finite impulse response digital filters , 1977 .

[3] M. Soderstrand. A high-speed low-cost recursive digital filter using residue number arithmetic , 1977, Proceedings of the IEEE.

[4] Shu Lin,et al. Error control coding : fundamentals and applications , 1983 .

[5] C. Burrus,et al. Number theoretic transforms to implement fast digital convolution , 1975, Proceedings of the IEEE.

[6] Joseph F. Traub,et al. On Euclid's Algorithm and the Theory of Subresultants , 1971, JACM.

[7] Earl E. Swartzlander,et al. Sign/Logarithm Arithmetic for FFT Implementation , 1983, IEEE Transactions on Computers.

[8] Trieu-Kien Truong,et al. The use of finite fields to compute convolutions , 1975, IEEE Trans. Inf. Theory.

[9] M. Etzel,et al. The design of specialized residue classes for efficient recursive digital filter realization , 1982 .

[10] A. Oppenheim,et al. Effects of finite register length in digital filtering and the fast Fourier transform , 1972 .