Fault-tolerant algorithm for Fast Fourier Transform on hypercubes
type: Item
instance of: scholarly article
title: Fault-tolerant algorithm for Fast Fourier Transform on hypercubes
zbMATH Open document ID: 0998.68221
DOI: 10.1016/S0020-0190(00)00170-8
author: R. Smith
published in: Information Processing Letters
publication date: 2002-07-14T00:00:00Z
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 1767303
zbMATH Keywords: fast Fourier transform
zbMATH Keywords: fault tolerance
zbMATH Keywords: free dimensions
zbMATH Keywords: faulty hypercube
zbMATH Keywords: parallel algorithm
MaRDI profile type: Publication
cites work: Q4154030
cites work: Gray codes, fast Fourier transforms and hypercubes
cites work: Fault diameter of interconnection networks
cites work: Q4002466
cites work: Q4893462
cites work: Multiprocessor FFTs
full work available at URL: s0020-0190(00)00170-8
OpenAlex ID: W2090019519
Recommended article: Q4030615
Recommended article: Q4235228
Recommended article: Q4723256
Recommended article: Fast Fourier Transform Algorithms for Parallel Computers
Recommended article: A comparison of optimal FFTs on torus and hypercube multicomputers
Recommended article: Recursive fault-tolerance of Fibonacci cube in hypercubes
Recommended article: Q5168256
Recommended article: A low-cost fault-tolerant structure for the hypercube
Recommended article: A fault-tolerant communication scheme for hypercube computers
description: scientific article; zbMATH DE number 1767303