Name
Abstract | ||
|---|---|---|
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 in frequently 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 n/sup th/ 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. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1109/FTCS.1999.781051 | Madison, WI, USA |
Keywords | Field | DocType |
nth symbol,channel error,complete source,parity value,fault tolerance,normal input symbol sequence,channel coding,modified source,coding system,parity symbol,arithmetic source,source encoding,arithmetic source coding combined,convolutional code,source code,redundancy,decoding,fault tolerant,fault detection,convolutional codes,error detection,arithmetic,source coding,probability of detection | Convolutional code,Source code,Computer science,Communication channel,Arithmetic,Error detection and correction,Shannon–Fano coding,Decoding methods,Arithmetic coding,Variable-length code | Conference |
ISSN | ISBN | Citations |
0731-3071 | 0-7695-0213-X | 2 |
PageRank | References | Authors |
0.40 | 10 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| G. Robert Redinbo | 1 | 54 | 15.28 |
| Ranjit Manomohan | 2 | 2 | 0.40 |