DocumentCode
2802776
Title
Fault-tolerant FFT data compression
Author
Redinbo, G. Robert ; Manomohan, Ranjit
Author_Institution
Dept. of Electr. & Comput. Eng., California Univ., Davis, CA, USA
fYear
2000
fDate
2000
Firstpage
110
Lastpage
119
Abstract
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
Keywords
decoding; encoding; error detection; fast Fourier transforms; fault tolerant computing; data characteristics; data processing level; end-to-end error detection; fast Fourier transform; fault tolerance; fault-tolerant FFT data compression; lossless arithmetic coding; lossy compression algorithms; nonzero coefficients; remote sensing; transform coefficients; Arithmetic; Compression algorithms; Data compression; Data processing; Fault tolerance; Fault tolerant systems; Fourier transforms; Propagation losses; Protection; Remote sensing;
fLanguage
English
Publisher
ieee
Conference_Titel
Dependable Computing, 2000. Proceedings. 2000 Pacific Rim International Symposium on
Conference_Location
Los Angeles, CA
Print_ISBN
0-7695-0975-4
Type
conf
DOI
10.1109/PRDC.2000.897293
Filename
897293
Link To Document