• Login
    View Item 
    •   DSpace Home
    • Học liệu mở OER
    • Education
    • View Item
    •   DSpace Home
    • Học liệu mở OER
    • Education
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Fast Fourier Transforms

    Thumbnail
    View/Open
    88_fastfouriertransforms.pdf (1.427Mb)
    Date
    2012
    Author
    Burrus, C. Sidney
    Metadata
    Show full item record
    Abstract
    1 Preface: Fast Fourier Transforms. 2 Introduction: Fast Fourier Transforms. 3 Multidimensional Index Mapping. 4 Polynomial Description of Signals. 5 The DFT as Convolution or Filtering. 6 Factoring the Signal Processing Operators. 7 Winograd's Short DFT Algorithms. 8 DFT and FFT: An Algebraic View. 9 The Cooley-Tukey Fast Fourier Transform Algorithm. 10 The Prime Factor and Winograd Fourier Transform Algorithms. 11 Implementing FFTs in Practice. 12 Algorithms for Data with Restrictions. 13 Convolution Algorithms. 14 Comments: Fast Fourier Transforms. 15 Conclusions: Fast Fourier Transforms. 16 Appendix 1: FFT Flowgraphs. 17 Appendix 2: Operation Counts for General Length FFT. 18 Appendix 3: FFT Computer Programs. 19 Appendix 4: Programs for Short FFTs. Bibliography.
    URI
    https://lib.hpu.edu.vn/handle/123456789/21646
    Collections
    • Education [806]

    DSpace software copyright © 2002-2016  DuraSpace
    Contact Us | Send Feedback
    Theme by 
    Atmire NV
     

     

    Browse

    All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsBy Submit DateThis CollectionBy Issue DateAuthorsTitlesSubjectsBy Submit Date

    My Account

    LoginRegister

    DSpace software copyright © 2002-2016  DuraSpace
    Contact Us | Send Feedback
    Theme by 
    Atmire NV