Fault tolerance in computing, compressing, and transmitting FFT data

DOI10.1109/26.974256MaRDI QIDQ4553171zbMATH OpenOpenAlexFDO

Authors G. Robert Redinbo, Ranjit Manomohan

Publication date 1 December 2002

Published in IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/26.974256

zbMATH Keywords

arithmetic codingfault detectionFFT protectionlossy compressionprotected source codingremote sensingrun-length codingsymbol convolutional codes

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Source coding (94A29) Arithmetic codes (94B40) Fault detection; testing in circuits and networks (94C12)

Recommendations

• Algorithm-based fault tolerance for FFT networks
• An algorithm for distributed computation of FFTs
• System level reliability in convolution computations
• scientific article; zbMATH DE number 1790540
• Algorithm-based fault location and recovery for matrix computations on multiprocessor systems

This page was built for publication: Fault tolerance in computing, compressing, and transmitting FFT data

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