This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Twenty-Ninth Annual International Symposium on Fault-Tolerant Computing
Fault Tolerance, Channel Coding and Arithmetic Source Coding Combined
Madison, Wisconsin
June 15-June 18
ISBN: 0-7695-0213-X
G. Robert Redinbo, University of California at Davis
Ranjit Manomohan, University of California at Davis
A complete source and channel coding system is protected from both channel errors and errors emanating from internal hardware failures by introducing redundancy in the source encoding and decoding procedures as well as infrequently inserting parity symbols generated by a burst-detecting convolutional code. The combined protected system can detect errors in any significant subsystems whether from transmission errors or hardware faults. The arithmetic source coding procedures are augmented with a few checking operations which detect failure effects at each iteration of the algorithm. The normal input symbol sequence has a parity symbol inserted sparsely; every nth symbol is determined by a high-rate burst-detecting convolutional code. These parity values provide end to end error detection for channel and hardware-based errors. The favorable probability of detection performance is evaluated, and the low overhead costs as measured by increased compression length of the modified source coding procedure are determined.
Index Terms:
Fault-tolerant data compression, burst-detecting convolutional codes, algorithm-based fault tolerance, hardware failures, combined source channel coding, arithmetic coding
Citation:
G. Robert Redinbo, Ranjit Manomohan, "Fault Tolerance, Channel Coding and Arithmetic Source Coding Combined," ftcs, pp.200, Twenty-Ninth Annual International Symposium on Fault-Tolerant Computing, 1999
Usage of this product signifies your acceptance of the Terms of Use.