Fast Fourier Transform Algorithms for Parallel Computers

Daisuke Takahashi

ISBN 10: 9811399646 / ISBN 13: 9789811399640

Published by Springer Nature Singapore, Springer Nature Singapore, 2019

About this Item

Druck auf Anfrage Neuware - Printed after ordering - Following an introduction to the basis of the fast Fourier transform (FFT), this book focuses on the implementation details on FFT for parallel computers. FFT is an efficient implementation of the discrete Fourier transform (DFT), and is widely used for many applications in engineering, science, and mathematics. Presenting many algorithms in pseudo-code and a complexity analysis, this book offers a valuable reference guide for graduate students, engineers, and scientists in the field who wish to apply FFT to large-scale problems.Parallel computation is becoming indispensable in solving the large-scale problems increasingly arising in a wide range of applications. The performance of parallel supercomputers is steadily improving, and it is expected that a massively parallel system with hundreds of thousands of compute nodes equipped with multi-core processors and accelerators will be available in the near future. Accordingly, the book also provides up-to-date computational techniquesrelevant to the FFT in state-of-the-art parallel computers.Following the introductory chapter, Chapter 2 introduces readers to the DFT and the basic idea of the FFT. Chapter 3 explains mixed-radix FFT algorithms, while Chapter 4 describes split-radix FFT algorithms. Chapter 5 explains multi-dimensional FFT algorithms, Chapter 6 presents high-performance FFT algorithms, and Chapter 7 addresses parallel FFT algorithms for shared-memory parallel computers. In closing, Chapter 8 describes parallel FFT algorithms for distributed-memory parallel computers.

Seller Inventory # 9789811399640

Bibliographic Details

• Title: Fast Fourier Transform Algorithms for Parallel Computers
• Publisher: Springer Nature Singapore, Springer Nature Singapore
• Publication Date: 2019
• Language: English
• ISBN 10: 9811399646
• ISBN 13: 9789811399640
• Binding: Buch
• Condition: Neu
• Dimensions: 241W x 160H x 13D millimeters 241 millimeters width by 160 millimeters height by 13 millimeters depth
• Weight: 360 grams

About this title

Synopsis

Following an introduction to the basis of the fast Fourier transform (FFT), this book focuses on the implementation details on FFT for parallel computers. FFT is an efficient implementation of the discrete Fourier transform (DFT), and is widely used for many applications in engineering, science, and mathematics. Presenting many algorithms in pseudo-code and a complexity analysis, this book offers a valuable reference guide for graduate students, engineers, and scientists in the field who wish to apply FFT to large-scale problems.

Parallel computation is becoming indispensable in solving the large-scale problems increasingly arising in a wide range of applications. The performance of parallel supercomputers is steadily improving, and it is expected that a massively parallel system with hundreds of thousands of compute nodes equipped with multi-core processors and accelerators will be available in the near future. Accordingly, the book also provides up-to-date computational techniquesrelevant to the FFT in state-of-the-art parallel computers.

 Following the introductory chapter, Chapter 2 introduces readers to the DFT and the basic idea of the FFT. Chapter 3 explains mixed-radix FFT algorithms, while Chapter 4 describes split-radix FFT algorithms. Chapter 5 explains multi-dimensional FFT algorithms, Chapter 6 presents high-performance FFT algorithms, and Chapter 7 addresses parallel FFT algorithms for shared-memory parallel computers. In closing, Chapter 8 describes parallel FFT algorithms for distributed-memory parallel computers.

About the Author

Daisuke Takahashi received his B.E. and M.E. degrees in Information and Computer Sciences from Toyohashi University of Technology in 1993 and 1995, respectively, and his Ph.D. in Information Science from the University of Tokyo in 1999. He was a research associate at the Computer Centre, University of Tokyo from 1997 to 2000, and at the Graduate School of Science and Engineering, Saitama University from 2000 to 2001. He joined the University of Tsukuba in 2001, where he is currently a Professor at the Center for Computational Sciences. His primary research interest is in high-performance computing. In 2011 he was a member of the team that won the ACM Gordon Bell Prize (Sustained Performance Prize). He is a member of the ACM, IEEE, SIAM, IPSJ and JSIAM.