loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Seventh Pacific Rim International Symposium on Dependable Computing (PRDC'00)
Fault-tolerant FFT data compression
Los Angeles, California
December 18-December 20
ISBN: 0-7695-0975-4
G.R. Redinbo, Dept. of Electr. & Comput. Eng., California Univ., Davis, CA, USA
R. Manomohan, Dept. of Electr. & Comput. Eng., California Univ., Davis, CA, USA
Transform coefficients carry important data characteristics but can also be compressed significantly in many remote sensing applications. Failures in the several computing facilities that execute lossy compression algorithms and support the transmission of Fourier transform data can corrupt the values beyond recovery at the final destination. Various methods for including fault tolerance at the data processing level are exemplified by describing a protected system that computes the FFT, truncates small coefficients and compresses the remaining nonzero coefficients using lossless arithmetic coding. Algorithmic checks within the FFT and arithmetic encoding and decoding operations are augmented with additional features between and across several subsystems involved in compressing and transmitting the FFT data. End-to-end error detection is achieved in this manner.
Index Terms:
error detection; decoding; encoding; fault tolerant computing; fast Fourier transforms; fault-tolerant FFT data compression; transform coefficients; data characteristics; remote sensing; lossy compression algorithms; fast Fourier transform; fault tolerance; data processing level; nonzero coefficients; lossless arithmetic coding; end-to-end error detection
Citation:
G.R. Redinbo, R. Manomohan, "Fault-tolerant FFT data compression," prdc, pp.110, Seventh Pacific Rim International Symposium on Dependable Computing (PRDC'00), 2000
Usage of this product signifies your acceptance of the Terms of Use.