Fault-tolerant algorithm for Fast Fourier Transform on hypercubes

DOI10.1016/S0020-0190(00)00170-8MaRDI QIDQ1603429zbMATH OpenOpenAlexFDO

Authors R. Smith

Publication date 14 July 2002

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0190(00)00170-8

zbMATH Keywords

parallel algorithmfast Fourier transformfault tolerancefaulty hypercubefree dimensions

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 147703
• scientific article; zbMATH DE number 1267276
• scientific article; zbMATH DE number 3997125
• Fast Fourier transform algorithms for parallel computers
• A comparison of optimal FFTs on torus and hypercube multicomputers
• Recursive fault-tolerance of Fibonacci cube in hypercubes
• scientific article; zbMATH DE number 6313097
• A low-cost fault-tolerant structure for the hypercube
• A fault-tolerant communication scheme for hypercube computers

Cites work

• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• scientific article; zbMATH DE number 3584892 (Why is no real title available?)
• scientific article; zbMATH DE number 922888 (Why is no real title available?)
• Fault diameter of interconnection networks
• Gray codes, fast Fourier transforms and hypercubes
• Multiprocessor FFTs

Cited in

(2)

• Vector coding algorithms for multidimensional discrete Fourier transform
• scientific article; zbMATH DE number 147703 (Why is no real title available?)

This page was built for publication: Fault-tolerant algorithm for Fast Fourier Transform on hypercubes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1603429)