Faster DTMF Decoding

In this paper, a new method for the decoding of DTMF signals is proposed. The approach, which applies the Arithmetic Fourier Transform, is more efficient, in terms of computational complexity, than existing techniques. Theoretical aspects and features that determine the accuracy and the complexity of the proposed method are discussed.

[1]  Allan O. Steinhardt,et al.  Fast algorithms for digital signal processing , 1986, Proceedings of the IEEE.

[2]  G. Sadasiv.  The arithmetic Fourier transform , 1988, IEEE ASSP Magazine.

[3]  A. W. M. van den Enden,et al.  Discrete Time Signal Processing , 1989 .

[4]  Xiaoli Yu,et al.  Fourier analysis and signal processing by use of the Mobius inversion formula , 1990, IEEE Trans. Acoust. Speech Signal Process..

[5]  Donald W. Tufts,et al.  A VLSI architecture for simplified arithmetic Fourier transform algorithm , 1990, [1990] Proceedings of the International Conference on Application Specific Array Processors.