03409nam 22004933 450 991083823170332120230814222100.01-947487-04-3(CKB)4100000003844519(MiAaPQ)EBC6954876(Au-PeEL)EBL6954876(MiAaPQ)EBC31086553(Au-PeEL)EBL31086553(EXLCZ)99410000000384451920220421d2018 uy 0engurcnu||||||||txtrdacontentcrdamediacrrdacarrierThe Sparse Fourier Transform Theory and Practice1st ed.San Rafael :Morgan & Claypool Publishers,2018.©2018.1 online resourceACM books ;191-947487-06-X 1-947487-05-1 Intro -- Contents -- Preface -- 1. Introduction -- PART I. THEORY OF THE SPARSE FOURIER TRANSFORM -- 2. Preliminaries -- 3. Simple and Practical Algorithm -- 4. Optimizing Runtime Complexity -- 5. Optimizing Sample Complexity -- 6. Numerical Evaluation -- PART II. APPLICATIONS OF THE SPARSE FOURIER TRANSFORM -- 7. GHz-Wide Spectrum Sensing and Decoding -- 8. Faster GPS Synchronization -- 9. Light Field Reconstruction -- 10. Fast In-Vivo MRS Acquisition with Artifact Suppression -- 11. Fast Mu1ti-Dimensional NMR Acquisition and Processing -- 12. Conclusion -- A. Proofs -- B. The Optimality of the Exactly k-Sparse Algorithm 4.1 -- C. Lower Bound of the Sparse Fourier Transform in the General Case -- D. Efficient Constructions of Window Functions -- E. Sample Lower Bound for the Bernoulli Distribution -- F. Analysis of the QuickSync System -- G. A 0.75 Million Point Sparse Fourier Transform Chip -- References -- Author Biography.The Fourier transform is one of the most fundamental tools for computing the frequency representation of signals. It plays a central role in signal processing, communications, audio and video compression, medical imaging, genomics, astronomy, as well as many other areas. Because of its widespread use, fast algorithms for computing the Fourier transform can benefit a large number of applications. The fastest algorithm for computing the Fourier transform is the Fast Fourier Transform (FFT), which runs in near-linear time making it an indispensable tool for many applications. However, today, the runtime of the FFT algorithm is no longer fast enough especially for big data problems where each dataset can be few terabytes. Hence, faster algorithms that run in sublinear time, i.e., do not even sample all the data points, have become necessary. This book addresses the above problem by developing the Sparse Fourier Transform algorithms and building practical systems that use these algorithms to solve key problems in six different applications: wireless networks, mobile systems, computer graphics, medical imaging, biochemistry, and digital circuits.ACM Bks.Fourier transformationsSparse matricesFourier transformations.Sparse matrices.515/.723Hassanieh Haitham1731442MiAaPQMiAaPQMiAaPQBOOK9910838231703321The Sparse Fourier Transform4144100UNINA01976nam0 2200421 i 450 VAN010290020220209091057.262N978-1-4939-0419-820151013d2014 |0itac50 baengUS|||| |||||Ergodic theory, open dynamics, and coherent structuresWael Bahsoun, Christopher Bose, Gary Froyland editorsNew YorkSpringer2014XVI, 227 p.ill.24 cm001VAN01025742001 Springer proceedings in mathematics & statistics210 Berlin [etc.]Springer70VAN0239813Ergodic theory, open dynamics, and coherent structures141072437-XXDynamical systems and ergodic theory [MSC 2020]VANC020363MF47A35Ergodic theory of linear operators [MSC 2020]VANC022241MF37C30Functional analytic techniques in dynamical systems; zeta functions, (Ruelle-Frobenius) transfer operators, etc. [MSC 2020]VANC031094MFCoherent structuresKW:KErgodic theoryKW:KInvariant ManifoldsKW:KOpen dynamical systemsKW:KTransfer operatorKW:KUSNew YorkVANL000011BahsounWaelVANV080311BoseChristopherVANV080312FroylandGaryVANV080313Springer <editore>VANV108073650ITSOL20240614RICAhttp://dx.doi.org/10.1007/978-1-4939-0419-8E-book – Accesso al full-text attraverso riconoscimento IP di Ateneo, proxy e/o ShibbolethBIBLIOTECA CENTRO DI SERVIZIO SBAVAN15NVAN0102900BIBLIOTECA CENTRO DI SERVIZIO SBA15CONS SBA EBOOK 4617 15EB 4617 20191106 Ergodic theory, open dynamics, and coherent structures1410724UNICAMPANIA