Burst Erasure Correction Codes With Low Decoding Delay

Martinian, E.; Sundberg, C.-E.W.

doi:10.1109/tit.2004.834844

Cited by 139 publications

(183 citation statements)

References 26 publications

Supporting

Mentioning

178

Contrasting

Unclassified

Order By: Relevance

“…Unlike the erasure codes in the previous section, Maximally Short codes (MS) introduced in [4] and further generalized in [6, Section IV-B] enable sequential recovery in the presence of burst-erasures. These codes are constructed for the special case when there is no mismatch between the source and channel frame rates i.e., M = 1.…”

Section: B Streaming Codes (Sco) For M =mentioning

confidence: 99%

“…We consider M = 20 and a delay of T = 5 macro packets and burst length B is varied from 40 to 110. The capacity is shown by the blue-curve marked with squares whereas the red curve marked with circles denotes the rate achieved by a suitable modification of the SCo code [4], [6] which is discussed in Section IV-B. We note that the curves intersect whenever B is an integer multiple of M , indicating the optimality of the SCo codes for these special values i.e., at B = {40, 60, 80, 100}.…”

Section: Conversementioning

confidence: 99%

See 1 more Smart Citation

Delay-optimal streaming codes under source-channel rate mismatch

Patil

Badr

Khisti

et al. 2013

2013 Asilomar Conference on Signals, Systems and Computers

View full text Add to dashboard Cite

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 bursterasure 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.

show abstract

Section: B Streaming Codes (Sco) For M =mentioning

confidence: 99%

Section: Conversementioning

confidence: 99%

Delay-optimal streaming codes under source-channel rate mismatch

Patil

Badr

Khisti

et al. 2013

2013 Asilomar Conference on Signals, Systems and Computers

View full text Add to dashboard Cite

show abstract

“…Martinian et al [16], [17] constructed streaming codes that minimize the delay required to correct burst errors of given length.…”

Section: A Background and Related Workmentioning

confidence: 99%

Erasure correction for nested receivers

Tekin

Vyetrenko

et al. 2011

2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton)

View full text Add to dashboard Cite

We consider packet erasure or error correction coding for a nested receiver structure, where each receiver receives a subset of the packets received by the next receiver. This type of structure arises, for instance, with temporal demands, where each receiver corresponds to a deadline by which certain information must be decoded. By making a connection with our previous work on nonmulticast network error correction, we find the capacity region for any given number of erasures or errors whose locations are a priori unknown, along with a capacityachieving intra-session coding scheme.

show abstract

“…Other works address the application of LDPC to bursty channels, focusing on alternative more complex decoding algorithms, like those in [25,26], or encoding algorithms, like the one in [27], as a mean to recover from error bursts.…”

Section: Introductionmentioning

confidence: 99%

A protection scheme for multimedia packet streams in bursty packet loss networks based on small block low-density parity-check codes

Casu

Cabrera

Jaureguizar

et al. 2015

J Wireless Com Network

View full text Add to dashboard Cite

This paper proposes an enhanced forward error correction (FEC) scheme based on small block low-density parity-check (LDPC) codes to protect real-time packetized multimedia streams in bursty channels. The use of LDPC codes is typically addressed for channels where losses are uniformly distributed (memoryless channels) and for large information blocks. This work suggests the use of this type of FEC codes at the application layer, in bursty channels (e.g., Internet protocol (IP)-based networks) and for real-time scenarios that require low transmission latency. To fulfil these constraints, the appropriate configuration parameters of an LDPC scheme have been determined using small blocks of information and adapting the FEC code to be capable of recovering packet losses in bursty environments. This purpose is achieved in two steps. The first step is performed by an algorithm that estimates the recovery capability of a given LDPC code in a burst packet loss network. The second step is the optimization of the code: an algorithm optimizes the parity matrix structure in terms of recovery capability against the specific behavior of the channel with memory. Experimental results have been obtained in a simulated transmission channel to show that the optimized LDPC matrices generate a more robust protection scheme against bursty packet losses for small information blocks.

show abstract

Burst Erasure Correction Codes With Low Decoding Delay

Cited by 139 publications

References 26 publications

Delay-optimal streaming codes under source-channel rate mismatch

Delay-optimal streaming codes under source-channel rate mismatch

Erasure correction for nested receivers

A protection scheme for multimedia packet streams in bursty packet loss networks based on small block low-density parity-check codes

Contact Info

Product

Resources

About