Layered multimedia broadcast using rateless codes with progressive recovery over cooperative MIMO
 Zhao Chen^{1, 3},
 Liuguo Yin^{2, 3},
 Mai Xu^{1}Email author and
 Jianhua Lu^{1}
https://doi.org/10.1186/168714992012327
© Chen et al.; licensee Springer. 2012
Received: 2 April 2012
Accepted: 27 September 2012
Published: 30 October 2012
Abstract
This article proposes a novel scheme, based on unequal error protected rateless codes, for broadcasting layered multimedia over cooperative multipleinput multipleoutput (MIMO). By taking advantage of both cooperation and broadcasting, we first present a twophase cooperative MIMO broadcast scheme, which exploits distributed diversity in pointtomultipoint communication scenarios. Then, to enhance layered multimedia transmission with progressive recovery, the progressive rateless codes (PRC) is proposed to recover the layered data according to their importance at the expected received ratio of all output packets. Thus, receivers with different packet loss rate can achieve an adaptive recovery of the layered multimedia progressively. Furthermore, based on PRC, a distortionbased layered multimedia broadcast problem is formulated, which optimizes source bitrate of the layered multimedia and coding rates of PRC to improve the quality of experience (QoE) of the multimedia delivery over all receivers. The performance analysis including both analytical results and simulation experiments of MotionJPEG 2000 broadcast to receivers verifies the superiority of the cooperative broadcast and efficiency of the QoEdriven optimization algorithm.
Keywords
Introduction
Broadcast, as the nature of the wireless medium, offers the promise of overcoming the bandwidth and energy limitation by using one channel to transmit source data to all destinations simultaneously within transmission range [1]. In many communication scenarios, broadcast is often desired and required. Besides, multipleinput multipleoutput (MIMO) techniques can be utilized to provide highrate highquality communication services in broadcasting.
Diversity, as an efficient way to mitigating the fading arising from multipath propagation, has successfully been extended to relay channels by using distributed relay terminals, referred to as _{ D }cooperative diversity[2]. In contrast with such conventional systems which have only one single destination node and a relatively small number of potential relay nodes, cooperative broadcast (CB)[3] has been proposed for multiple destinations to receive one message in the network, where destinations can be switched between receiving and relay modes. In the receiving mode, each destination node tries to accumulate signal energy from other nodes and decodes the symbol by sufficient signaltonoise ratio (SNR), and then it switches to the relay mode and retransmit the same symbol. Recently, CB has been shown to provide spatial diversity and achieve better bit error rate (BER) performance [3–5]. In [6], the energy efficiency of cooperative transmissions in a broadcast network is analyzed.
In a broadcast network, multimedia contents play a key role and mainly include the forms of text, audio, image, and video. For example, multimedia broadcast multicast service (MBMS) [7] has been proposed as a standard of 3GPP for providing multimedia service to users via broadcast in 3G UMTS cellular networks. As the stateoftheart multimedia source compression standard, scalable video coding (SVC) extension of the H.264/AVC Standard [8] and Joint Photographic Experts Group 2000 (JPEG 2000) [9] are both pervasive in broadcast network since they are capable of providing efficient video and image information content to the users. One of the most attractions of these standards is that it is able to produce progressive recovery of videos or images by fidelity or resolution, referred to as layered multimedia.
In a multimedia broadcast network, layered multimedia transmissions can be achieved once taking advantage of the progressive layers of JPEG 2000 or SVC. However, considering the different importance between layers of the layered multimedia, unequal error protection (UEP) strategies may be applied to protect the layered multimedia from packet losses, in order to maximize the quality of experience (QoE) in the network. UEP property can be realized by various means, one practical technique is to give different redundant information to layers by forward error correction (FEC) codes. Rateless code [10], also known as fountain codes, is one of such FEC codes with capacityachieving performance. In a rateless code, the original source packets can accurately be recovered from any subset of the encoding packets with the size equal to or only slightly larger than the number of source packets, which means that the redundant packets are maximally utilized. In fact, many studies have been done in the field of applying rateless codes with UEP property for scalable image/video streaming [11–14].
The rest of this article is organized as follows. In “Background” section, we introduce some basic concepts of CB and rateless codes. “Rateless codes with progressive recovery” section presents a detailed description and performance analysis of the proposed PRC for layered multimedia transmission. A QoEdriven multimedia broadcast scheme is introduced in “QoEdriven layered multimedia broadcast” section. “Simulation results” section shows the experimental results of the QoEdriven scheme in both CB and traditional broadcast (TB). Finally, we conclude the article in “Conclusions” section.
Background
Cooperative broadcast
In general, due to the medium of wireless communication, the transmitted signals are heard not only by their intended receivers, but also by other neighboring nodes. In conventional pointtopoint communications, this may be harmful for other unintended receivers. But it will be beneficial in broadcast scenarios when one message is needed to be transmitted to multiple destinations. In TB schemes, the source node will provide a besteffort transmission service under energy constraint. Each message is broadcasted only once. Some destination nodes with lower receiving SNR will be unable to receive the message, which leads to a higher packet loss probability. If the receiving SNR is below a critical value, the destination node cannot even collect one whole packet. Such node is called to be out of the coverage of the source node. To broaden the coverage of the source node and improve the SNR of bad receivers, it is better to utilize multihop to relay the message to distributed receivers, where cooperative diversity can be exploited [3, 4].
We consider a CB scheme over quasistatic flatfading channels as shown in Figure 1. There are one source node and M destination receiving nodes distributed in the scheme. All nodes are equipped with multiple antennas. We denote N_{ S } as the number of antennas of the source node, N_{ m } as the number of antennas of destination node m, where 1≤m≤M. Following [4], assume a twophase decodeandforward (DF) CB protocol. The two phases are both synchronized in alternate time slots, which are referred to as source broadcast (SB) and relay broadcast (RB), respectively. In the first time slot (SB phase), the source node broadcasts one message to all destinations. Suppose that there are M_{1} destinations that have successfully decoded the message. Next in the second time slot (RB phase), the source node keeps quiet and the M_{1}decoded destination nodes switch to relay mode and start to broadcast the decoded message, while the other M−M_{1}destination nodes continue receiving, trying to collect the signal energy from all relay nodes. Then it turns to SB phase again in the next time slot.
In RB phase, the relay nodes can form a virtual antenna array. At this point, pilotedassisted channel estimation is feasible at each of the remaining undecoded destinations. Practically, before relaying there should be some knowledge exchange to between the relay nodes. Assuming that all nodes are subject to a halfduplex constraint, so channel state information (CSI) are only available for receiving nodes but not for transmitters. Since CSI is not available at the transmitters, equal power is allocated to every transmit antenna across the virtual antenna array.
For each destination node in the broadcast scheme, the channel quality varies with different pathloss and channel fading. Moreover, the channel quality of some destinations is severely degraded due to deep fading. Those nodes are nearly out of the coverage of the source node. Taking advantage of the virtual multiantenna array, we can avoid deep fading and notably improve the reliability of the broadcast by exploiting the diversity gain. If we consider to select a group of transmit antennas from all antennas in the decoded nodes to form the virtual array, the maximum diversity gain can be achieved. However, for simplicity we take all the decoded destinations to be relay node without selection as in our model.
For the purpose of preparing for the postprocessing in application layer in the next sections, we measure the channel quality of each destination node in the way of packet loss ratio (PLR). The PLR can be derived from SNR with the connection of BER, which is beyond the scope of this article. With the diversity gain of virtual array, the PLR of destination nodes are all increased, especially for those whose PLRs are critically low. Thus, the coverage of the source node is considerably expanded. Note that though CB can improve the reliability of broadcasting efficiently, the system throughput is halved due to the relay phase. So, a selection strategy is required to obtain better performance between cooperation and noncooperation, which will be discussed in “Simulation results” section.
Rateless codes
Luby transform (LT) codes [15] or Raptor codes [16], as two stateoftheart techniques of rateless codes, have been proved to be efficient FEC solutions for erasure channels.^{b}These codes are universal for different scenarios on packet transmission level regardless of channel packet loss patterns. So, rateless codes are becoming increasingly popular in broadcast network. For example, Raptor codes, with nearly linear encoding/decoding complexity, have been accepted for the application layer FEC scheme in current communication standards, such as 3GPP MBMS [7] and DVBH [17].
 1.
Select an encoding degree d with distribution Ω(x).
 2.
Choose d input symbols randomly and uniformly in k source symbols as neighbors of the encoding symbol.
 3.
Perform bitwise XOR operation on the d chosen symbols to generate the encoding symbol.
After the above procedure, the encoding symbol is transmitted to the receiver. If d=1, the encoding symbol is just a duplication of the unique input symbol. This procedure will be executed repeatedly and a potentially infinite encoding symbol stream can be generated until enough encoding symbols are collected at the receiver to recover all source symbols.
 1.
Initial step: search for receiving symbols with degree one and release them to recover their unique neighbor input symbols to a buffer, called the ripple.
 2.Process every input symbol in the ripple as follows until the ripple becomes empty.
 (a)
Remove the input symbol from receiving symbols as a neighbor.
 (b)
Release such receiving symbols subsequently with exactly one remaining neighbor and recover their neighbors to the ripple.
 (a)
BP process fails if at least one source symbol remaining unrecovered in the end. The key point of successful decoding is the perfect design of the degree distribution. Fortunately, it was proved in [15] that such distribution exists and all source symbols can be recovered by any (1 + ε)k encoding symbols. ε is the decoding overhead, it has achieved capacityapproaching behavior with very low overhead when $k\to \infty ,\epsilon \to 0$.
ML decoding, also known as full rank decoding, is executed by solving a set of linear equations in ${\mathbb{F}}_{2}^{k}$, since each encoding symbol is a linear combination of source symbols. It will be successful if the set of equations is full rank. Compared with BP process in [18], ML decoding has lower decoding overhead but higher decoding complexity.
Raptor codes [16], as an extension of LT codes, have been proposed with linear time encoding and decoding using a precoder of lowdensity paritycheck codes. Our UEP approach with progressive recovery will follow Raptor codes with a modified encoding structure, which will be described in the following section.
Rateless codes with progressive recovery
Related work
With applying rateless codes with UEP, various layered delivery techniques have been studied, which can be divided into three groups.
Rahnavard et al. [14], first of all, presented a distributionbased approach. They introduced UEP at the LT encoding stage and designed a nonuniformly degree distribution such that lower layer symbols can be selected with higher probability. With achieving unequal recovery of different layers, the altered distribution weakens the code performance and results in a larger overhead.
Another group of UEP designs are precodingbased approaches [19, 20]. Without making modifications to the original rateless code structure, firstly layer packets are precoded with different code rates proportionally according to their importance, where lower layer packets are assigned to lower precoding rate. Then precoded packets are passed to a rateless encoder. Since the intermediate performance of rateless code is poor, the recovery of lower layers suffers.
Design and implementation
In this section, we propose the PRC to enhance original rateless codes with UEP capability. In our approach, to guarantee the optimized recovery performance, we alter the encoding structure with maintaining the parameters of rateless code, e.g., degree distribution. Meanwhile, with the efficient recovery of rateless codes, the dependency between layers has been satisfied to come to a progressive recovery of the layered multimedia.
We consider a layered multimedia data stream to be transmitted over an erasure channel. Assume that an Llayer video stream is partitioned into several source blocks with the size of K symbols, where the importance of symbols decreasing from Layer 1 to Layer L. Let k_{ i } be the number of source symbols of Layer i, so that $K=\sum _{i=1}^{L}{k}_{i}$. Let S be the symbol length in bytes, thus each layer has k_{ i }·S bytes and the total length of the block will be $K\xb7S=\sum _{i=1}^{L}{k}_{i}\xb7S$ bytes. Note that $\frac{{k}_{i}}{K}$ is a constant for Layer i in a certain layered stream as the block size K changes.
Given total broadcasting bandwidth, the overall coding rate $\gamma =\frac{K}{N}$ is fixed for all possible K, where N is the number of output symbols for each source block, i.e., output block size, to protect the layered data stream from packet losses. Thus, the total length of redundant symbols is (N−K)·S bytes. Based on these conditions, our PRC approach will generate encoding symbols in a parallel way.
At the decoder, assume that R output symbols are received, of course R≤N due to packet losses. The received symbols are first unpacked to separate reshaped symbols of each layer, which are then passed to L different rateless decoders, respectively. Lastly the message blocks are recovered layerbylayer at the decoders. The decoding method adopted in our approach is ML decoding.
Recovery performance analysis
which shows that the coding rate of reshaped Layer i is also r_{ i }. In SPFEC, let ${\eta}_{i}=\frac{{n}_{i}}{N}$ be the output ratio of Layer i, which will be a constant once r_{ i }is determined.
which indicates that for Layer i, it can be recovered from at most $N{k}_{i}^{\ast}$ symbol losses with probability 1. Therefore, to recover layered data stream progressively from Layer 1 to Layer L, we can make ${k}_{1}^{\ast}\le {k}_{2}^{\ast}\le \cdots \le {k}_{L}^{\ast}$. From Equation (1), we know that it can be also represented by r_{1}≤r_{2}≤⋯≤r_{ L }. So we can protect Layer i by assigning suitable r_{ i }, expecting to recover it after receiving r_{ i }ratio of output symbols.
Following the results in [21], we only investigate SPFEC without considering dependency for simplicity. The analysis of LAFEC will be similar to that and when N grows large, there will be no difference between the two approaches.
In SPFEC, let ${\mathrm{Pr}}_{i}^{\prime}\left(R\right)$ be the recovery probability of Layer i. With the ideal recovery assumption of rateless codes, it can be recovered by at least k_{ i }out of n_{ i }output symbols from Layer i.

For R<k_{ i }, ${\mathrm{Pr}}_{i}^{\prime}\left(R\right)=0$.

For k_{ i }≤R<N−(n_{ i }−k_{ i }),${\mathrm{Pr}}_{i}^{\prime}\left(R\right)=\sum _{x={k}_{i}}^{min\{R,{n}_{i}\}}\frac{\left(\genfrac{}{}{0.0pt}{}{{n}_{i}}{x}\right)\left(\genfrac{}{}{0.0pt}{}{N{n}_{i}}{Rx}\right)}{\left(\genfrac{}{}{0.0pt}{}{N}{R}\right)}=\sum _{x={k}_{i}}^{min\{R,{n}_{i}\}}\frac{\left(\genfrac{}{}{0.0pt}{}{R}{x}\right)\left(\genfrac{}{}{0.0pt}{}{NR}{{n}_{i}x}\right)}{\left(\genfrac{}{}{0.0pt}{}{N}{{n}_{i}}\right)}$(3)

For R≥N−(n_{ i }−k_{ i }), ${\mathrm{Pr}}_{i}^{\prime}\left(R\right)=1$.
To find the relationship between the two approaches, we will show some properties of ${\mathrm{Pr}}_{i}^{\prime}\left(R\right)$ as the following lemmas.
Lemma 1
${\mathrm{Pr}}_{i}^{\prime}\left(R\right)$ is an nondecreasing function of the number of received symbols R.
Proof
which shows that ${\mathrm{Pr}}_{i}^{\prime}\left(R\right)$ is increasing strictly when k_{ i }≤R<N−(n_{ i }−k_{ i }). □
Lemma 1 shows the recovery probability of each Layer i increases with the number of the received symbols, which is in accordance with our intuition. Furthermore, given a fixed received ratio of output symbols, we have Lemma 2 when the output block size N increases with a fixed overall coding rate γ.
Lemma 2
If r is any constant and r>r_{ i }, ${\mathrm{Pr}}_{i}^{\prime}(N\xb7r)$ is an increasing function of the number of output symbols N.
Proof
 1.
$\frac{R}{N}\to r$ is a constant.
 2.
$\frac{{n}_{i}}{N}\to {\eta}_{i}$ is a constant.
where Φ(x) is the cumulative distribution function of standard normal. With the monotonicity property of Φ(x), it is straightforward to show that ${\mathrm{Pr}}_{i}^{\prime}\left(\mathrm{Nr}\right)$ increases with N if r>r_{ i }. □
Lemma 2 shows that the recovery probability of each Layer i will increase with N when a certain ratio of symbols are received, as long as the ratio is more than r_{ i }. If the PLR is no more than 1−r_{ i }, we can improve the performance by assigning a lager block size K.
Lemma 3
Proof
First, we will show that ${\mathrm{\text{Pr}}}_{i}^{\prime}(N\xb7r)\to 1$. This is quite easy to be shown from Equation (7), since Φ(x)→1 when x goes to infinity.
Recall Equation (1), $R>N{r}_{i}={k}_{i}^{\ast}$ when r>r_{ i }. So we have Pr_{ i }(N·r)=1, which concludes the assertion. □
Lemma 3 shows that the asymptotic recovering probability of SPFEC is equal to PRC, which means PRC seems to be optimal for SPFEC. We also notice that the SRR of SPFEC approaches to that of PRC when N grows. In other words, for moderate output block size N, PRC will theoretically outperforms SPFEC with lower overhead.
Figure 5 shows the PLR performance of Layer 1 of all the three approaches with the received ratio near 50%. It is clear that the PRC outperforms both SPFEC and LAFEC with reducing more than 5%(N=1000) to 7%(N=500) received packets below the PLR of 10^{−4}. When the output block size N increases, the PLR at the same received ratio decreases and the gap between PRC and the other two approaches becomes closer, which meet our conclusions in Lemmas 2 and 3. In addition, it also indicates the advantage of PRC in PLR performance for Layer 2 in Figure 6.
QoEdriven layered multimedia broadcast
In this section, we consider to apply UEP to delivering the layered multimedia stream based on PRC, aiming at recovering the stream adaptively at receivers according to their channel conditions. Moreover, by optimizing source bitrate of the layered stream and coding rates of PRC, we have proposed a broadcast scheme that is QoEdriven to maximize the average quality of received multimedia over all receivers.
System model
where B_{ T }(r)≤B need to be satisfied.
where p_{ i }(e_{ d },r) is the independent recovering probability of the i th layer, and it can be obtained from Equation (2) (PRC) or Equation (3) (SPFEC). In Figure 7, the first L_{ D }consecutive layers are recovered at the receiver node.
where PSNR_{ i } stands for the PSNR of the first i layers and PSNR_{0}=0. It is worth noting that PSNR_{ i }relies on the original video sequence and the scalable encoder, which can be computed before PRC.
When a user becomes a receiving node, it measures the channel quality and feeds back the PLR to the source node. Once given the layered multimedia to be transmitted, the conditions including PSNR_{ i } and w_{ i }for i from 1 to L are determined. Then the source node can derive optimized parameters of L_{ S } and r with applying the proposed PRC to the layered stream.
Optimization of QoEdriven PRC
If the PLR of receiving nodes follows an uniformly distribution, i.e., G(r_{ i },r_{i + 1})=D·(r_{ i }−r_{i + 1}), the problem will be solved via classical discrete Lagrangian multiplier method. Unfortunately, in fact the receiving nodes are randomly distributed in the broadcast system, so we will concentrate on a general algorithm to solve the problem.
Since the coding rate of rateless codes can flexibly be adjusted in (0,1], we choose r_{ i }from the set of potential coding rates by the received ratio $\mathcal{R}=\{1{e}_{1},1{e}_{2},\dots ,1{e}_{D}\}$. As the number of layers is limited by layered source encoder and transmission bandwidth, we can try some available value of selected source layers L_{ S }to have the optimal choice. Once given L_{ S }, we have the heuristic algorithm as follows to determine the appropriate r.

Step 1: Initialize coding rates r_{0}to recover all L layers consecutively at node D with the highest PLR, i.e., for all 1≤_{1}i≤L_{ S }, r_{ i }=1−e_{ D }. Compute the average PSNR under r_{0}as ${\overline{\mathrm{PSNR}}}_{0}$. Set j=1.

Step 2: Calculate the transmission bandwidth B_{ T }in Equation (9). If B_{ T }>B, set i=L_{ S }. Otherwise r=r_{j−1}and the algorithm is terminated.

Step 3: Let d be the index of coding rate in $\mathcal{R}$ which equals r_{ i }, such that r_{ i }=1−e_{ d }. If i=L_{ S }or if i<L_{ S }and r_{ i }<r_{i + 1}, substitute r_{ i }=1−e_{d−1}in r_{j−1}and denote it as ${\mathbf{r}}_{i}^{\ast}$. Compute the average PSNR under ${\mathbf{r}}_{i}^{\ast}$ as ${\overline{\mathrm{PSNR}}}_{i}^{\ast}$ and record the degradation of the average PSNR as ${\Delta}_{i}={\overline{\mathrm{PSNR}}}_{j1}{\overline{\mathrm{PSNR}}}_{i}^{\ast}$.

Step 4: If i=1 or if i<L_{ s }and r_{ i }≥r_{i + 1}, go to step 5. Otherwise set i=i−1 and go to step 3.

Step 5: Let ${i}_{j}=\underset{i}{arg}min{\Delta}_{i}$. Update ${\mathbf{r}}_{j}={\mathbf{r}}_{{i}_{j}}^{\ast}$ and ${\overline{\mathrm{PSNR}}}_{j}={\overline{\mathrm{PSNR}}}_{{i}_{j}}^{\ast}$. Set j=j + 1 and go to step 2.
In step 5 of the algorithm, each time we update the coding rate r with the minimum degradation of the average PSNR. It will not stop until the transmission bandwidth B is satisfied. The computation complexity is at most O(L·D^{ L }). When the number of receiving nodes D grows to infinity, the computation time for optimization is not acceptable, for the distribution of the receiving nodes is irregular. Nevertheless, we can decrease the complexity by clustering. In each cluster, the PLRs of the receiving nodes within an interval of I_{0}are rounded up to the highest one in the cluster. Thus, the number of clusters is Q=1/I_{0}, and the complexity of solving the problem is at most O(L·Q^{ L }). We can choose suitable I_{0}to constrain the processing requirement, noticing that it will lead to a little sacrifice of the average PSNR.
Simulation results
The PLRs of destination nodes in TB and CB
e _{1}  e _{2}  e _{3}  e _{4}  

TB  0.01  0.01  0.4  1 
CB  0.007  0.008  0.1  0.3 
The scalable resolutions and bit rates of MotionJPEG 2000 encoding for Mobcal sequence
1 Layer  2 Layers  3 Layers  4 Layers  5 Layers  

Resolution  80×45  160×90  320×180  640×360  1280×720 
Bit rate (Mbps)  2.015  6.034  16.851  41.733  69.034 
PSNR  18.102  19.057  20.971  25.401  35.383 
As shown in Figure 10, it can be seen that Cooperative broadcast outperforms TB all the time, since cooperation reduce the PLRs of the worst node effectively. In particular, at some points the traditional one have nearly the same performance as the cooperative one, because all the destinations except for the worst node are served with the best quality video. As the broadcast bitrate increases, the average PSNR of the traditional one will not increase any more.
It is still worth noting that the proposed PRC is always better than the conventional equal error protection strategy we define as worst case. Using such strategy, the source node protects all the stream layers with the same coding rate equal to γ and all receiver nodes can recover the equal number of stream layers. Thus, the worst node with highest PLR should be considered, which determines the truncated layer L_{ S }due to the constrained bandwidth B. In the figure, the average PSNR gain of the PRC can be more than 6 dB. Thus, the PRC can improve the average QoE in the broadcast group substantially. Particularly at some intermediate points, i.e., broadcast bitrate exceeds the need of lower layers but not enough for the higher layers, the performance of the two strategies are the same.
In some other distribution of destination nodes, the CB may not be better than the traditional one, since the twophase protocol is too waste of transmission bandwidth. For example, if the PLRs of the destinations are all too high, there is little that cooperation can do to benefit them. So, the source node needs to decide to cooperate or not before broadcasting. Nevertheless, the proposed PRC will improve the average performance of the broadcast in any case.
Conclusions
This article has presented a layered multimedia broadcast scheme using rateless codes with progressive recovery over cooperative MIMO. In this broadcast scheme, first a twophase CB protocol is proposed to improve the reliability of the broadcast, which efficiently extends the coverage of the source nodes and decreases the packet loss rate of bad destination nodes. Second, we propose the PRC to enhance rateless codes with progressive recovery. By assigning unequal redundant packets to each layer with their importance, the PRC can recover layered multimedia at designated received ratio of output symbols, which outperforms the other unequal protected rateless codes such as SPFEC and LAFEC in [21] with much lower overhead. Third, based on the PRC and given PLRs of intended destinations in the system, a distortionbased layered multimedia broadcast optimization problem is formulated to improve the QoE of the broadcast system. By the optimized layered source bitrate and coding rates of PRC, the average transmission quality, i.e., PSNR of videos and images, has been maximized. Using resolution scalable MotionJPEG 2000 video sequence, the receivers with different PLRs can recover a progressive resolution video stream adaptively. Analytical and experimental results suggest the superiority of the Cooperative broadcast scheme and the efficiency of the QoEdriven optimization algorithm.
Endnotes
^{a}Note that video can also be transmitted in this broadcast network using MotionJPEG 2000, each frame of which can be seen as a JPEG 2000 image.^{b}FEC gives the receiver an ability to correct errors without data retransmission. Over an erasure channel, the receiver either receives the packet or drop it when error is detected.^{c}Note that during the encoding process of rateless codes, a symbol represents the smallest unit of data with the same size. One or more symbols can be contained in a packet.^{d}Note that since we implement ML decoding of rateless codes, the overhead can be very low as k grows [18]. For example, when k>500,ε<0. 01. So, it is reasonable to make the assumption.
Declarations
Acknowledgements
This study was supported in part by the National Natural Science Foundation of China (NSFC) under Grants No.61101072, No.61202139 and No.61021001, and in part by the Program for New Century Excellent Talents in University (NCET).
Authors’ Affiliations
References
 Wieselthier J, Nguyen G, Ephremides A: On the construction of energyefficient broadcast and multicast trees in wireless networks. Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), vol. 2 (Tel Aviv, 2000), pp. 585–594Google Scholar
 Laneman J, Tse D, Wornell G: Cooperative diversity in wireless networks: efficient protocols and outage behavior. IEEE Trans. Inf. Theory 2004, 50(12):30623080. 10.1109/TIT.2004.838089MathSciNetView ArticleMATHGoogle Scholar
 SirkeciMergen B, Scaglione A, Mergen G: Asymptotic analysis of multistage cooperative broadcast in wireless networks. IEEE Trans. Inf. Theory 2006, 52(6):25312550.MathSciNetView ArticleGoogle Scholar
 Khisti A, Erez U, Wornell G: Fundamental limits and scaling behavior of cooperative multicasting in wireless networks. IEEE Trans. Inf. Theory 2006, 52(6):27622770.MathSciNetView ArticleMATHGoogle Scholar
 Scaglione A, Hong Y: Opportunistic large arrays: cooperative transmission in wireless multihop ad hoc networks to reach far distances. IEEE Trans. Inf. Theory 2003, 51(8):20822092.MathSciNetGoogle Scholar
 Hong Y, Scaglione A: Energyefficient broadcasting with cooperative transmissions in wireless sensor networks. IEEE Trans. Inf. Theory 2006, 5(10):28442855.Google Scholar
 3GPP TS 26.346 V9.0.0: Technical Specification Group Services and System Aspects; Multimedia Broadcast/Multicast Service; Protocols and Codecs,. September 2009Google Scholar
 Schwarz H, Marpe D, Wiegand T: Overview of the scalable video coding extension of the H.264/AVC standard. IEEE Trans. Circuits Syst. Video Technol 2007, 17(9):11031120.View ArticleGoogle Scholar
 Rabbani M, Joshi R: An overview of the jpeg2000 still image compression standard. Signal Process.: Image Commun 2002, 17(1):348. 10.1016/S09235965(01)000248Google Scholar
 Byers J, Luby M, Mitzenmacher M: A digital fountain approach to asynchronous reliable multicast. IEEE J. Sel. Areas Commun 2002, 20(8):15281540. 10.1109/JSAC.2002.803996View ArticleGoogle Scholar
 Cataldi P, Grangetto M, Tillo T, Magli E, Olmo G: Slidingwindow raptor codes for efficient scalable wireless video broadcasting with unequal loss protection. IEEE Trans. Image Process 2010, 19(6):14911503.MathSciNetView ArticleGoogle Scholar
 Sejdinovic D, Vukobratovic D, Doufexi A, Senk V, Piechocki R: Expanding window fountain codes for unequal error protection. IEEE Trans. Commun 2009, 57(9):25102516.View ArticleGoogle Scholar
 Hellge C, Schierl T, Wiegand T: Multidimensional layered forward error correction using rateless codes. IEEE International Conference on Communications (ICC) (Beijing, 2008), pp. 480–484Google Scholar
 Rahnavard N, Vellambi B, Fekri F: Rateless codes with unequal error protection property. IEEE Trans. Inf. Theory 2007, 53(4):15211532.MathSciNetView ArticleMATHGoogle Scholar
 Luby M, LT codes,: Annual Symposium on Foundations of Computer Science, vol. 43. (Vancouver, 2002), pp. 271–282Google Scholar
 Shokrollahi A: Raptor codes. IEEE Trans. Inf. Theory 2006, 52(6):25512567.MathSciNetView ArticleMATHGoogle Scholar
 ETSI TS 102 472 V1.2.1: IP Datacast over DVBH:Content Delivery Protocols,. December 2006Google Scholar
 Bioglio V, Grangetto M, Gaeta R, Sereno M: On the fly gaussian elimination for lt codes. IEEE Commun. Lett 2009, 13(12):953955.View ArticleGoogle Scholar
 Kozat U, Ramprashad S: Unequal error protection rateless codes for scalable information delivery in mobile networks. IEEE International Conference on Computer Communications (INFOCOM) (Anchorage, AK, 2007), pp. 2316–2320Google Scholar
 Lu H, Cai J, Foh C: Joint unequal loss protection and lt coding for layercoded media delivery. IEEE Global Telecommunications Conference (GLOBECOM) (Miami, FL, 2010), pp. 1–5Google Scholar
 Hellge C, GómezBarquero D, Schierl T, Wiegand T: Layeraware forward error correction for mobile broadcast of layered media. IEEE Trans. Multimed 2011, 13(3):551562.View ArticleGoogle Scholar
Copyright
This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.