Referenced Items are not available for this document.
FFT is a widely used algorithm, of which parallelization is a very important topic. There were a lot of works for this field and many parallel algorithms were published in several decades. In this paper, an algorithm named Computation Oriented Parallel FFT (COPF) is proposed. COPF which dates from the classic parallel radix-2 FFT focuses on the butterfly structure in FFT and adopts a proper strategy in parallel phrase on distributed system. In the serial phrase, COPF takes FFTW3 to accelerate the serial process and extends the application.
Published in:
Parallel Architectures, Algorithms and Programming (PAAP), 2010 Third International Symposium on
Date of Conference: 18-20 Dec. 2010
- Page(s):
- 369 - 373
- Print ISBN:
- 978-1-4244-9482-8
- INSPEC Accession Number:
- 11835347
- Conference Location :
- Dalian
- Digital Object Identifier :
- 10.1109/PAAP.2010.35
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
