Skip to main content

Improved Algorithm of Overlap-Save Method for Calculating Linear Convolution of a Long Sequence

  • Conference paper
  • 1004 Accesses

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 216))

Abstract

A algorithm of digital signal processing (DSP) based on real time processing is introduced in this article. In this algorithm, a long sequence is divided into several shorter ones and the linear convolution is calculated with cyclic convolution. The processing of digital filter performs real-time and fast after effective improvement of cyclic convolution.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Leng, J.-h.: Digital Signal Processing. National Defence Industrial Press (2002)

    Google Scholar 

  2. Hu, G.-s.: Digital Signal Processing. Tsinghua University Press, Beijing (2001)

    Google Scholar 

  3. Gao, X.-q., Ding, Y.-m.: Digital Signal Processing. XIDIAN University Press (2008)

    Google Scholar 

  4. Liu, H.-l., Wu, J.: Digital Signal Processing. XIDIAN University Press (2003)

    Google Scholar 

  5. Peled, A., Liu, B.: Digital Signal Processing Theory, Design and Implementation. John Wiley &Sons, Inc., New York (1976)

    Google Scholar 

  6. Proakis, J.G., Mannolakis, D.G.: Intrduction To Digital Signal Processing. MeGraw-Hill Book Company, New York (1988)

    Google Scholar 

  7. Chen, C.-T.: Digital Signal Processing—Spectral Computation and Filter Design. Publishing house of electronics industry, BeiJjng (2002)

    Google Scholar 

  8. Hu, G.-s.: Digital Signal Processing—Theory, arithmetic and implementation. Tsinghua University Press, Beijing (2001)

    Google Scholar 

  9. Zhu, J.-h., Zhou, J.-j., Wu, J.: Radar target recognition based on the extended feature of linear convolution coefficients. Systems Engineering and Electronics 32(1), 45–48 (2010)

    Google Scholar 

  10. Tian, X.-h., Liu, W.-j., Pei, X.-m.: An Algorithm for Calculating the Linear Discrete Convolution With FFT. Techniques of Automation and Applications 28(2), 56–58 (2009)

    Google Scholar 

  11. Lü, X.-h., Wu, B.: Fast Implementation of Long Sequence Wavelet Transform. Journal of Data Acquisition & Processing 21(1), 86–89 (2006)

    Google Scholar 

  12. Wen, Y.-d., Yang, X.-m.: Data sampling and processing system based on TMS320C2F206 and USB technology. Journal of Hefei University of Technology (Natural Science) 25(4), 521–523 (2002)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wan, Gf., Chen, Sw. (2011). Improved Algorithm of Overlap-Save Method for Calculating Linear Convolution of a Long Sequence. In: Lin, S., Huang, X. (eds) Advances in Computer Science, Environment, Ecoinformatics, and Education. CSEE 2011. Communications in Computer and Information Science, vol 216. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23345-6_60

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23345-6_60

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23344-9

  • Online ISBN: 978-3-642-23345-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics