Skip to main content

Part of the book series: NATO Advanced Study Institutes Series ((ASIC,volume 33-2))

Abstract

This paper will be divided into two parts. The first is intended as a companion to a tutorial session on those basic properties of the DFT which lead to Fast Fourier Transform algorithms. The second part will range more widely, in particular considering ways in which certain less well-known properties of the DFT could be turned to practical use. The two parts are independent.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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. J.W. Gooley and J.W. Tukey, An algorithm for the machine calculation of comples Fourier series, Maths. Computation, 19, 297–301, (1965).

    Article  Google Scholar 

  2. I.E.E.E. Trans. Audio Electroacoust. Vol. AU-15, June 1967.

    Google Scholar 

  3. I.E.E.E. Trans. Audio Electroacoust. Vol. AU-15, June 1969.

    Google Scholar 

  4. I.J. Good, The relationship between two Fast Fourier Transforms, I.E.E.E. Transactions on Computers C-20, 310–317, 1971.

    Article  Google Scholar 

  5. G.H. Hardy and E.M. Wright, An Introduction to the theory of numbers, Oxford: Clarendon Press, (1938).

    Google Scholar 

  6. I.J. Good, Analogues of Poisson’s summation formula, American Mathematical Monthly, 69, 259–266, 1962,

    Article  MathSciNet  MATH  Google Scholar 

  7. I.J. Good, A new finite series for Legendre polynomials, Proc. Camb. Phil. Soc. 51, 385–388, 1955.

    Article  MathSciNet  MATH  Google Scholar 

  8. M. Abramowitz, et al, Handbook of Mathematical Functions, Dover Publications Inc., New York, 1965.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1977 Springer Science+Business Media Dordrecht

About this paper

Cite this paper

Conolly, B.W. (1977). Properties of the Discrete Fourier Transform (DFT). In: Tacconi, G. (eds) Aspects of Signal Processing With Emphasis on Underwater Acoustics, Part 2. NATO Advanced Study Institutes Series, vol 33-2. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-3036-3_11

Download citation

  • DOI: https://doi.org/10.1007/978-94-011-3036-3_11

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-010-5350-1

  • Online ISBN: 978-94-011-3036-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics