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.
KeywordsComputational Complexity Fourier Series Discrete Fourier Transform Inversion Formula VLSI Architecture
Unable to display preview. Download preview PDF.
- 1.Bruns, H.: Grundlinien des Wissenschaftlichenen Rechnens. Leipzig (1903)Google Scholar
- 2.Wintner, A.: An Arithmetical Approach to Ordinary Fourier Series. Baltimore, privately monograph (1947)Google Scholar
- 3.Tufts, D.W., Sadasiv, G.: The Arithmetic Fourier Transform. IEEE ASSP Mag., 13–17 (1988)Google Scholar
- 4.Reed, I.S., Tufts, D.W., Yu, X., Truong, T., Shih, M.-T., Yin, X.: Fourier Analysis and Signal Processing by Use of the Möbius Inversion Formula. IEEE Transactions on Acoustics, Speech and Signal Processing 38, 459–470 (1990)Google Scholar