Fast Fourier Transform Algorithms for Parallel Computers
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 m
- PDF / 3,348,492 Bytes
- 120 Pages / 453.544 x 683.151 pts Page_size
- 59 Downloads / 250 Views
Daisuke Takahashi
Fast Fourier Transform Algorithms for Parallel Computers
High-Performance Computing Series Volume 2
Series Editor Satoshi Matsuoka, RIKEN Center for Computational Science, Kobe, Hyogo, Japan
The series publishes authored monographs, textbooks, and edited state-of-the-art collections covering the whole spectrum of technologies for supercomputers and high-performance computing, and computational science and engineering enabled by high-performance computing series (HPC). Areas of interest include, but are not limited to, relevant topics on HPC: • • • • • • • • • • •
Advanced algorithms for HPC Large-scale applications involving massive-scale HPC Innovative HPC processor and machine architectures High-performance / low-latency system interconnects HPC in the Cloud Data science / Big Data / visualization driven by HPC Convergence of machine learning / artificial intelligence with HPC Performance modeling, measurement, and tools for HPC Programing languages, compilers, and runtime systems for HPC Operating system and other system software for HPC HPC systems operations and management
More information about this series at http://www.springer.com/series/16381
Daisuke Takahashi
Fast Fourier Transform Algorithms for Parallel Computers
123
Daisuke Takahashi University of Tsukuba Tsukuba, Japan
ISSN 2662-3420 ISSN 2662-3439 (electronic) High-Performance Computing Series ISBN 978-981-13-9964-0 ISBN 978-981-13-9965-7 (eBook) https://doi.org/10.1007/978-981-13-9965-7 © Springer Nature Singapore Pte Ltd. 2019 This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. The publisher, the authors and the editors are safe to assume that the advice and information in this book are believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors give a warranty, expressed or implied, with respect to the material contained herein or for any errors or omissions that may have been made. The publisher remains neutral with regard to jurisdictional claims in published maps and institutional affiliations. This Springer imprint is published by the registered company Springer Nature Singapore Pte Ltd. The registered company address is: 152 Beach Road, #21-01/04 Gateway East, Singapore 189721, Singapore
Preface
The fast Fourier transform (FFT) is an efficient implementation of the discrete Fourie
Data Loading...
