Skip to main content
SpringerLink
Log in

Faster DTMF Decoding

  • Conference paper
Telecommunications and Networking - ICT 2004 (ICT 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3124))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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 

  5. Reed, I.S., Shih, M.-T., Truong, T.K., Hendon, E., Tufts, D.W.: A VLSI Architecture for Simplified Arithmetic Fourier Transform Algorithm. IEEE Transactions on Signal Processing 40, 1122–1133 (1992)

    Article  MATH  Google Scholar 

  6. Blahut, R.E.: Fast Algorithms for Digital Signal Processing. Addison-Wesley, Reading (1985)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Eletrônica e Sistemas, UFPE, C.P. 7800, 50711-970, Recife-PE, Brasil

    J. B. Lima, R. M. Campello de Souza, H. M. de Oliveira & M. M. Campello de Souza

Authors
  1. J. B. Lima
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. M. Campello de Souza
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. H. M. de Oliveira
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. M. M. Campello de Souza
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departamento de Computacao, Universida de Federal do Ceará, Campus do Pici - Bloco 910, 60455-760, Fortaleza, Ceará, Brazil

    José Neuman de Souza

  2. Cisco Systems, Inc., 10 West Tasman Drive, Bldg O/2, CA 95134, San Jose, USA

    Petre Dini

  3. IUT, University of Haute Alsace, 34, rue du Grillenbreit, 68008, Colmar, France

    Pascal Lorenz

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lima, J.B., de Souza, R.M.C., de Oliveira, H.M., de Souza, M.M.C. (2004). Faster DTMF Decoding. In: de Souza, J.N., Dini, P., Lorenz, P. (eds) Telecommunications and Networking - ICT 2004. ICT 2004. Lecture Notes in Computer Science, vol 3124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27824-5_69

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27824-5_69

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22571-3

  • Online ISBN: 978-3-540-27824-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation