Abstract

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.

Highlights

  • Multimedia communications are moving toward Internet protocol (IP) networks, since they are more efficient than circuit-switching channels

  • The paper is organized as follows: in Section 2, we describe the main characteristics of low-density parity-check (LDPC) codes

  • 3.1 Protection scheme In a typical video transmission model based on IP/user datagram protocol (UDP)/real-time transport protocol (RTP) protocols, the encoded video stream is encapsulated in RTP media packets that, in turn, are encapsulated in UDP

Read more

Summary

Introduction

Multimedia communications are moving toward IP networks, since they are more efficient than circuit-switching channels. FEC-based schemes introduce additional band occupation, due to the transmission of redundant recovery data, they seem more suitable than ARQ techniques when it comes to time-sensitive multi-client communications In this sense, the FECFRAME Working Group has elaborated the RFC 6363 [9] in order to provide a FEC-based protection scheme to RTP multimedia transmissions. We propose to create an H matrix using classical pseudo-random algorithms, easy to find in the literature, and afterwards modify H in order to make it more robust against bursts of lost packets This is done by means of a novel characterization of its recovery capability in bursty channels. The authors propose different metrics to estimate the recovery capabilities of the parity matrix These works consider a larger number of information packets than that of our approach.

LDPC codes
Small block LDPC codes in low-latency memory channels
Simulations and results
Complexity analysis
Findings
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call