Name
Abstract | ||
|---|---|---|
We study low-delay error correction codes for streaming-recovery over a class of packet-erasure channels. In our setup, the encoder observes one source frame every M time slots, but is required to transmit a channel packet in each time slot. The decoder is required to reconstruct each source frame within a playback delay of T source frames. The collection of M transmitted channel packets between successive source frames is called a (channel) macro-packet. For a certain class of burst-erasure channels, we characterize the associated capacity and develop explicit codes that attain the capacity. We recover as a special case, the capacity when M = 1, studied in earlier works. Our proposed code constructions involve splitting each source frame into two groups of sub-symbols, applying unequal error protection and carefully allocating source and parity-check sub-symbols within each macro-packet. Our constructions are a non-trivial extension of the previously proposed codes for M = 1. Simulation results indicate significant gains over baseline error correction codes for the Gilbert model for burst erasures. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/ACSSC.2013.6810676 | 2013 ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS |
Keywords | Field | DocType |
mobile communication,vectors,decoding,encoding | Forward error correction,Concatenated error correction code,Computer science,Low-density parity-check code,Fountain code,Block code,Turbo code,Algorithm,Electronic engineering,Real-time computing,Error detection and correction,Tornado code | Conference |
ISSN | Citations | PageRank |
1058-6393 | 3 | 0.50 |
References | Authors | |
10 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pratik Patil | 1 | 52 | 5.05 |
| Ahmed Badr | 2 | 73 | 6.43 |
| Ashish Khisti | 3 | 3264 | 203.65 |
| Wai-tian Tan | 4 | 672 | 78.92 |