Research Article  Open Access
Lukasz Kondrad, Imed Bouazizi, Moncef Gabbouj, "LDPC FEC Code Extension for Unequal Error Protection in DVBT2 System: Design and Evaluation", International Journal of Digital Multimedia Broadcasting, vol. 2012, Article ID 834924, 11 pages, 2012. https://doi.org/10.1155/2012/834924
LDPC FEC Code Extension for Unequal Error Protection in DVBT2 System: Design and Evaluation
Abstract
The Digital Video Broadcasting organisation has recently introduced the second generation of terrestrial broadcast transmission standards, DVBT2. The newly introduced tools ensure significant gain in performance of DVBT2 compared to the first generation variant of the standard. One of these tools is the new physical layer concatenated forward error correction code. The inner among the concatenated codes is the LowDensity Parity Check code. The paper proposes a method to extend this code so varying coding strength inside one physical layer pipe of DVBT2 is enabled in a backward compatible way. As consequence, unequal error protection transmission scheme at a physical layer of DVBT2 can be efficiently deployed. The paper provides a stepbystep description of the design procedure of the extension. Moreover, the modification to the processing chain and the framing structure of DVBT2, that ensures backward compatibility to the legacy system, is provided. The proposed method is evaluated under AWGN channel and TU6 channel. Experiments performed on four different video sequences show significant improvements in quality of experience when the proposed extension is used to achieve UEP transmission.
1. Introduction
Unequal error protection (UEP) is a wellknown technique in multimedia communication used to selectively enhance robustness of transmitted data. The main idea behind UEP is to assign the amount of the protection data based on the relative importance of the protected data to the overall presentation. Scalable media streams [1, 2] inherently contain data with different levels of importance. Thus, they present an ideal use case for UEP transmission schemes. For example, a base layer data of a H.264/SVC video stream is typically FEC coded at a higher protection level compared to an enhancement layer (EL) data of the same stream. This is due to the fact that an errorfree enhancement layer data is of no use to an H.264/SVC decoder, if the corresponding base layer (BL) data was corrupted during transmission.
By using a UEP transmission scheme jointly with scalable multimedia encoders, graceful quality degradation can be achieved. Thus, a system that supports UEP transmission schemes allow for flexible quality of service configuration. A user with good reception conditions is able to consume a full quality service, while a user with bad reception conditions is still able to consume the service but at a lower quality (lower frame rate, smaller resolution, or lower fidelity). In a system that does not support UEP transmission schemes only one level of service quality is possible. As consequence, a strict tradeoff between bandwidth utilization and robustness of a transmitted date has to be made.
Graceful degradation, which can be provided by employing a UEP transmission scheme, is a desired solution in broadcast transmission systems. This was recognised by DVB [3], an international consortium which develops standards for broadcast transmission. The system support for a UEP transmission scheme is one of the commercial requirements for the second generation of the DVB standard for handheld devices [4]. Moreover, DVB adopted H.264/SVC as one of the video codecs used for broadcast services [5]. However, none of the existing DVB standards natively supports UEP transmission of scalable media.
DVBT2 [6] could benefit from a method that would allow a UEP transmission scheme. The DVBT2 system was designed to provide servicespecific robustness, which could be used to implement a UEP transmission scheme for scalable media transmission. However, constraints imposed by the DVBT2 standard make a straightforward use of the servicespecific robustness for a UEP transmission scheme limited. This is mainly due to the fact that DVBT2 receivers are forced to decode only a single data physical layer pipe (PLP) at any point in time. Thus, different layers of a scalable media cannot be transmitted over separate PLPs. Furthermore, FEC code rate manipulation in one PLP cannot be done with sufficient flexibility, hence a UEP transmission scheme cannot be applied.
A UEP transmission scheme could be applied on the upper layers by deploying one of the FEC techniques described in [7]. For example, a UEP transmission scheme on layers above the physical layer was proved to be beneficial when applied to DVBH transmission system [8, 9]. However, due to the nature of the physical layer FEC code defined in DVBT2, the upper layer FEC would require operation on large data portions in order to be effective. This would lead to higher system latency and would have a significant impact on a channel zapping delay. Furthermore, introducing additional redundancy at the upper layers may not be efficient from a bandwidth utilization point of view.
This paper describes the design of LDPC code extension that is applicable to the native DVBT2 LDPC codes. The proposed extension overcomes the limitation of the DVBT2 system and allows flexible service componentspecific robustness at the physical layer of DVBT2 in a backwards compatible way. By using the proposed extension, varying coding strength inside one PLP of the DVBT2 system is possible. As a result, the UEP transmission scheme can be implemented and integrated in the DVBT2 system in an effective and costefficient manner. This paper extends the work introduced in [10] by providing a detailed design, additional extensions, and an extensive performance evaluation. In addition, a feasible use case for the extension, that is, a UEP transmission scheme, is presented and benefits of such use case when compared to standard DVBT2 transmission scheme are thoroughly evaluated.
The remainder of the paper is organised as follows. In the next section an insight into LDPC codes is given. Section 3 describes the framing structure and LDPC codes specified by the DVBT2 system. The design of the proposed extension and its impact on the processing chain of the DVBT2 standard are discussed in Section 4. Simulation results demonstrating the performance of the proposed method over AWGN and TU6 channels are presented in Section 5. In Section 6 the use of the extension to provide UEP in DVBT2 transmission system is presented. Finally, Section 7 concludes the paper.
2. LowDensity Parity Check Code
The Low Density Parity Check (LDPC) code family [11, 12] is among the better performing error correction coding technologies among modern channel coding schemes. For the last decade, more sophisticated classes of LDPC codes have been developed by members of the research community, each offering advances in one area or another. It was shown that LDPC codes can compete with turbo codes of the same length [13, 14].
An LDPC code is a linear block code characterised by a sparse by parity check matrix . A matrix is said to be sparse if fewer than half of the elements are nonzero. Such a parity check matrix corresponds to a code with a design rate , assuming all rows of the matrix are independent.
Using an LDPC code, a block of information bits can be encoded in a code word of size , where . For the encoding procedure, typically a generator matrix is determined based on a parity matrix , where . The generator matrix does not necessarily have to be a sparse matrix, which can increase the complexity of the encoding procedure. However, some of the LDPC code families allow encoding based on a parity check matrix , and hence reduce the complexity of the encoding process [15]. One of such codes is the extended irregular repeataccumulate (eIRA) family of LDPC codes [16]. eIRA codes are discussed in more details in Section 3.
An iterative messagepassing decoding algorithm based on the concept of belief propagation [17] is generally utilized to decode an LDPC code. The details of such a decoding algorithm can be found in [18]. If the Tanner graph [19] does not have any cycles, such message passing algorithms compute exact probabilities [17]. Otherwise, the decoding algorithm computes only approximate solutions, yet provides an effective decoding capability [20].
LDPC codes can be divided into two groups, regular and irregular LDPC codes. A code is called regular if all degrees of the variable nodes are equal and also all degrees of the check nodes are equal. In an irregular code each variable node and each check node can have different degrees assigned. In this paper, we will work with irregular LDPC codes. For the theoretical analysis such codes can be represented by the pair of degree distribution polynomials (, ) and the length of the code . where is the fraction of edges in the Tanner graph connected to degree variable nodes, is the fraction of edges connected to degree check nodes, and . and denote the maximum degree for variable nodes and check nodes, respectively. The degree distribution pair can be used to predict a decoding threshold for the LDPC code.
3. DVBT2
This section provides a brief introduction to the DVBT2 system and is divided into two parts. Section 3.1 provides an overview of a DVBT2 processing chain. Section 3.2 gives a deeper insight into the LDPC codes specified by the DVBT2 standard.
3.1. Background
The DVBT2 physical layer data channel is divided into logical entities called the physical layer pipe (PLP). Each PLP carries one logical data stream. An example of such a logical data stream would be an audiovisual multimedia stream along with the associated signalling information. The PLP architecture is designed to be flexible. Arbitrary adjustments to robustness and capacity of each PLP can be easily done. Each PLP’s processing chain consists of four modules: Input Processing, Bit Interleaved Coding and Modulation (BICM), Frame Builder, and Modulator. The task of input processing module is to map the input data into Base Band (BB) frames. A BB frame comprises BB header, data field carrying the input data, optional inband signalling, and padding, if necessary. Each BB frame is bits long and the size of BB frame does not change over time in a given PLP. BB frames are then passed to the BICM module. Among other things, the BICM module is handling FEC encoding, where a serial concatenation of two binary linear FEC codes is used: a BoseChaudhuriHocquenghem (BCH) code [21] as the outer code and a LDPC code as the inner code. By appending the FEC parity bits at the end of the BB frame an FEC frame is created (Figure 1). The FEC frame is characterised by a fixed size (16200 bits or 64800 bits) irrespective of the used FEC code rate. The desired code rate is achieved by setting appropriate size of the BB frame, that is, value. After the FEC frame is created, a frame builder module maps it to a physical layer frame. The physical layer frame is then interleaved and mapped to OFDM symbols. The last module, the Modulator, is responsible for modulation and transmission.
3.2. FEC Codes
The DVBT2 system was designed to operate in the presence of high levels of noise and interference. It can be said that choosing the proper FEC code was one of the key components to achieve good performance by the terrestrial system. The DVB group opted for the use of a wellestablished and verified LDPC code supported by an additional BCH code. The BCH code was deployed to eliminate long error floors typical for LDPC codes at low error rates.
The LDPC codes deployed in the DVBT2 system belong to the eIRA codes subclass [16] and are characterised by lowcomplexity encoding and shorter errorrate floors compared to other irregular LDPC codes. The parity check matrix of a eIRA code is constrained to be in the form: where is an by sparse matrix and is an by staircase lower triangular matrix.
The form of the matrix was designed to avoid degree two cycles in the Tanner graph representation. Additionally, the characteristic of the matrix allows efficient encoding. A generator matrix of an eIRA code can be expressed as where matrix corresponds to a differential encoder whose transfer function is . In the transfer function denotes exclusive or operation and stands for a 1 bit register. Based on this, the FEC encoding in DVBT2 can be performed in two steps. First, the output of the BCH encoder is multiplied by a sparse matrix producing an intermediate result. Secondly, the intermediate result is differentially encoded by a matrix generating the parity bits, which are combined with the output of the BCH encoder into a systematic code word.
To make the encoding of LDPC codes in DVBT2 more efficient, matrix was designed to be in a quasicyclic form. Such a representation allows implementation of an encoder with shift register circuits [22], as well as reducing the memory storage requirements. Matrix is divided into groups. In each group all columns have the same degree distribution . The positions of ones in columns are given for the first column in each group. For the remaining 359 columns the position of ones in each group is calculated in reference to the first column of the group using (Algorithm 1) where is the position of th one in the th column from the group and is a code rate dependent constant specified by the DVBT2 standard.

LDPC decoding in DVBT2 is based on a standard iterative exchange of information among variable nodes and check nodes, as described in Section 2.
4. The Proposed Code Extension Method
The DVBT2 system provides limited possibilities to manipulate code rates in the FEC encoding subsystem. This paper proposes a method which allows servicecomponentspecific robustness at the physical layer of DVBT2 in a backwards compatible way and the same overcomes the limitation. The design of the LDPC code extension is split into two steps. First, in Section 4.1, the question of how to introduce additional parity using a framing structure of the DVBT2 system is answered. In Section 4.2 the design procedure of the extension FEC code matrix is given.
4.1. Concept
Pruning is one of the methods used for constructing variablerate LDPC codes. The method changes code rate by eliminating variable nodes in the bipartite Tanner graph, which in turn modifies the check degree of connected check nodes. We employ the idea to change the code rates of the native DVBT2 LDPC codes.
We propose the following modification to the processing chain and the framing structure of the DVBT2 system. The supplementary LDPC encoder, which calculates the additional repair bits, is placed between the Input Processing module and the BICM module in the PLP processing chain. The supplementary LDPC encoder calculates parity bits over the first bits of a BB frame created by the Input Processing module. An extension parity check matrix is used to calculate those parity bits. The parity check matrix is designed in the way that is always smaller than or equal to size of a BB frame equal to . The Input Preprocessor module, aware that the extension is used, decreases the size of Data Field in each BB frame that at least padding bits are present in each BB frame. As consequence, the repair bits generated by the LDPC extension encoder can be placed over the last padding bits of the BB frame. Such processed BB frame is then passed to the BICM module. The BICM module operates according to the DVBT2 standard. The structure of the modified FEC frame is presented in Figure 2. A receiver that supports the proposed extension uses the extension parity bits and the native DVBT2 LDPC parity bits together. The receiver creates a combined parity check matrix as presented on Figure 3. 3 is composed with , which is the parity check matrix used by the supplementary LDPC encoder, matrix, which is a zero matrix, and , which is the parity check matrix of the native DVBT2 LDPC code. A legacy receiver treats the repair bits of the FEC frame as padding bits of BB frame and operates according to the DVBT2 standard. Due to this the backward compatibility to the legacy DVBT2 system is ensured.
4.2. Design
In this subsection a stepbystep description of the design of H_{ext} matrix is presented. The proposed method may not provide optimal results. In the matrix, the parity check matrix and the zero matrix are given. Therefore, the goal is to find the degree distribution for the parity matrix that results in favourable error correction performance for the extended DVBT2 LDPC code. Additionally, the parity matrix should meet the following two requirements.
First, the parity matrix should be divisible into number of groups having the exact amount of columns, where all columns in the group have the same degree. This ensures that the matrix will be in a quasicyclic form which results in low complexity encoding.
It is a known issue [16] that during the decoding process of an LDPC code, the loglikelihood ratio [18] of low degree variable nodes converges slower than that of the variable nodes with higher degrees. On the other hand, high degree check nodes are not desired in LDPC codes, since the more variables are involved in a check node, the more probable the check is to fail [13]. Therefore, to balance between those two tradeoffs, low degree variable nodes are assigned to the rows of a parity matrix corresponding to redundant parity bits. As a result, assigning a degree equal to one to the last columns of the parity matrix becomes the second constraint.
Taking into account the abovementioned constraints, Algorithm 2 in conjunction with a numerical optimization algorithm, for example, Differential Evolution [23], can be used to determine the favourable degree distributions of the matrix.

To calculate the degree distribution of the combined parity matrix (4) can be used In these equations is the number of all edges in a Tanner graph representation of the matrix . and represent the number of all edges outgoing from variable nodes and check nodes with degree , respectively. To test the theoretical decoding threshold of the combined parity matrix , the density evolution technique was employed [24]. An alternative method, which is not discussed in this paper, to find a favorable matrix structure is to use the extrinsic information transfer (EXIT) chart technique [25, 26].
After finding the favourable degree distribution of , the next step is to create the parity matrix . Due to the fact that and are known, and we know how many ones are in each group of , we can calculate the degree distribution of . In order to create based on its degree distribution we use protograph expansion technique [27]. A protograph is a small graph which by copy and permute technique is utilised to create a larger graph. If a target matrix is to have dimension by then the protograph dimension shall be and , where is the periodicity of the target matrix. When the protograph is copied times, edges of individual replicas need to be permuted among replicas. However, the permutation of the edges has to follow some constraints so the derived matrix would preserve the decoding threshold properties of the protograph and would have a quasicyclic structure. For example, if a variable node is connected to a check node in the protograph, the variable node in a replica can only connect to one of the replicas of the check node . The periodicity of is the same as in , that means is equal to 360 in our case. Based on the degree distribution of we create the protograph by using a progressive edgegrowth technique [28]. Next, by copy and permute technique combined with Algorithm 1, a protograph is expanded to . Additionally, to improve decoding performance of the code, permutation selection is carried out in such a way that at least length 4 cycles in the combined parity matrix are not present [13].
5. Evaluation of the Proposed Extended Codes
In order to evaluate the LDPC code extension method proposed in Section 4, three extensions to the native DVBT2 codes have been designed. The native DVBT2 LDPC codes with code rates , , and were extended to produce code rates , , and , respectively. Through the paper, these three extended DVBT2 LDPC codes are referred to as , , and . The parameters of the extension matrix for the extended DVBT2 LDPC codes are presented in Table 1. Additionally, Table 2 presents the positions of ones in the first column of a group, which in conjunction with Algorithm 1 from Section 3 allows to build the matrices used during the evaluation process. The value of that is required by the algorithm is given in Table 1.


The extended codes were implemented in a DVBT2 physical layer simulator. The proper functioning of the DVBT2 simulator was verified by comparing its performance results to the results presented in the DVBT2 Implementation Guidelines [29]. Using the simulator, a set of simulations was performed to evaluate the extended DVBT2 LDPC codes. In all simulations, maximum duration T2 frames (250 ms) comprising short FEC frames (16200 bits long) were used. The modulation parameters were set to 16 QAM, 8k FFT size, and 1/4 guard interval. P1 notboosted pilot pattern was used, and constellation rotation was not applied. The simulations were conducted on two transmission channel models: an additive white Gaussian noise (AWGN) channel model and a TU6 80 Hz channel model [30], which accurately represents a moving receiver. The results considered were obtained from a transmission of 1800 FEC blocks. Error calculations were performed by averaging the residual error rates after FEC frame decoding process.
Figures 4, 5, and 6 present the obtained results. In each of these figures, the results for both the native (to be extended) DVBT2 LDPC codes as well as the extended DVBT2 LDPC codes, are plotted. Based on the obtained results, it can be observed that the proposed LDPC extension improves performance of the native DVBT2 LDPC codes. Therefore, due to the extensions the limitation of DVBT2 can be overcome and means to implement a UEP transmission scheme at the physical layer of DVBT2 in backward compatible way are provided.
(a) AWGN
(b) TU6
(a) AWGN
(b) TU6
(a) AWGN
(b) TU6
In a UEP transmission scheme, data, based on its importance, is divided into two or more protection levels. Next, each protection level has assigned different robustness, for example, by using different FEC code rates. In a EEP transmission scheme a single protection level is assigned to all transmitted data regardless of its importance. The comparison between the UEP transmission scheme and the EEP transmission scheme, under the constraint of an equal level of available bandwidth and thus using the same amount of protection data ensures fairness for the evaluation of the proposed extension. The twoprotectionlevel UEP scheme from Section 6 was used to calculate the resulting average code rate of the UEP transmission scheme. For example, bit rates of BL and EL for four sequences from Section 6 are presented in Table 3. As a result, for the calculation a BL to EL ratio was assumed to be 3/7. Three scenarios of UEP for the three extensions were analysed. In Scenario 1, the EL is protected by the native DVBT2 LDPC code with the code rate and the BL is protected by the extended DVBT2 code . The resulting average code rate, which would correspond to code rate of EEP transmission, is approximately . In Scenario 2, the EL is protected by the native DVBT2 LDPC code with the code rate and the BL is protected by the extended DVBT2 code . The resulting average code rate, which would correspond to code rate of EEP transmission, is approximately . In Scenario 3, the EL is protected by the native DVBT2 LDPC code with the code rate and the BL is protected by the extended DVBT2 code . The resulting average code rate, which would correspond to code rate of EEP transmission, is approximately . The performance of the native DVBT2 LDPC code at the calculated average code rates is also plotted in Figures 4, 5, and 6. Scalable codecs such as H.264/SVC produce bitstreams which is partitioned into layers that form a hierarchy. Thus, in order for a particular layer to be useful to the decoder, all layers it depends on also need to be available. In other words, if a scalable encoder produces one base layer and one enhancement layer in order for an enhancement layer to be useful in decoding, the base layer needs to be available to the decoder. Therefore, it is important to compare the results of UEP and EEP transmission schemes for base layer protection perspective. The significant performance gap between the native DVBT2 LDPC code at the calculated average code rate, which corresponds to the BL and EL protection in the EEP transmission scheme, and that of the extended DVBT2 LDPC code, which corresponds to the BL protection in the UEP transmission scheme, can be clearly observed. The improvement for the BL protection when the extension is used to deploy the UEP transmission scheme are summarized in Table 4 and amount up to more than 3 dB in Scenario 2. The gain can be reflected in practical quality improvements for the user which is showed in Section 6.


Figures 5 and 6, additionally, plot simulation results for the native DVBT2 LDPC codes that provide the same amount of repair data as the extended DVBT2 LDPC codes. For example, the native DVBT2 code is equivalent to the extended code . It should be noted that the DVBT2 standard does not specify code rate . It can be observed that the results achieved by the extended DVBT2 LDPC codes slightly underperform compared to the respective native DVBT2 LDPC codes. For convenience, performance of the native and the extended codes, for residual BER , are presented in Table 5. The extended codes performance is weakened due to constraints which are imposed by the backwardcompatibility requirement. The matrix must contain the original code rate matrix . Therefore, the purpose of the extended codes is not to replace native DVBT2 codes but to enable varying FEC protection for data transmitted over one PLP in a backwardcompatible way. In other words the extended codes should be used only when a UEP transmission scheme is considered. If a EEP transmission scheme is deployed then the native codes should be utilized.

6. Use Case for the Proposed Extended Codes
The main use case for the proposed extension is to allow UEP transmission over DVBT2 system in a backwardcompatible mode. Figure 7 depicts partial high level block diagram of PLP processing chain, when the proposed extension is used to enable UEP transmission scheme. The Input Preprocessor module splits incoming data to high level protection and low level protection streams. Low level protection stream is processed by input processor in accordance with the standard, and BB frames bits long are formed. For the high level protection stream, the input processor creates BB frames also bits long. The value depends on the code rate chosen for the given PLP. However, in case of high level BB frames input processor ensure that cumulative size of BB header, data, and inband signalling does not exceed bits. The remaining space of the high level BB frame is filled with padding. The high level BB frames are next passed to the extension FEC encoder. The encoder calculate parity bits from the first bits of the high level BB frame. Next, the parity bits are placed over padding bits and form integral part of the high level BB frame. Such formed low and high level BB frames are multiplexed together and passed to BICM module. The BICM module operates according to the DVBT2 standard. Both types of BB frames are encoded using the same native DVBT2 FEC code. To ensure that receiver is able to differentiate between FEC frames, with the low level of protection and with the high level of protection, additional L1 signalling would be required. Legacy receiver processes high level and low level BB frames in the same way. For a receiver with the support of the extension low level BB frames are also processed in the standard way. However, for the decoding of the high level BB frames the combined matrix , Figure 3, is used.
We showed in Section 5 that the proposed extensions strengthen the performance of the native DVBT2 LDPC codes. We also mentioned that the main use case for the proposed LDPC extensions is to enable varying FEC protection for a data transmitted over one PLP in a backwardcompatible way. In other words, the aim is to enable UEP of a service at physical layer of DVBT2. Therefore, we present now the gain, in practical quality improvements from the user perspective, which can be achieved by employing UEP compared to EEP. For this purpose, we used four different video sequences, City, Crew, Harbour, and Soccer (the video sequences are publicly available). Each sequence was encoded and decoded using the H.264/SVC reference software [29]. The base layer (BL) has CIF () resolution and a frame rate of 15 fps. The enhancement layer (EL) has 4CIF () resolution and a frame rate of 30 fps. The resulting bit rates of encoded sequences are presented in Table 3. The PSNR values for the BL and EL are displayed in Table 6. In the UEP scheme, EL of H.264/SVC video streams were assigned to low protection level, that is, the native DVBT2 LDPC code with code rate , and the BL of those H.264/SVC video streams were assigned to high level protection, that is, the extended DVBT2 LDPC code with cde rate . This is equivalent to Scenario 2 from Section 5. In the EEP scheme, which uses the same amount of bandwidth as the foregoing UEP scheme, BL and EL of those H.264/SVC video streams were assigned to the same protection level, that is, the native DVBT2 LDPC cdeo with code rate .

At the receiver, the following error concealment algorithms were assumed. In both the EEP and in UEP cases, whenever both BL and EL are corrupted, that is, a picture cannot be decoded, the most recent correctly decoded picture is frozen. However, in the UEP case, when EL is corrupted but BL is still errorfree, then the BL picture is upscaled to the full EL resolution and it replaces the corresponding EL picture. Table 6 provides the average PSNR value when the whole BL is upscaled.
Next, the following scenario was assumed. For a certain period of time, SNR value of the received signal at the mobile receiver drops to a level in which the codes protecting EL in the UEP transmission scheme and both layers in the EEP transmission scheme are not able to provide an errorfree signal. This may happen due to mobility of a receiver. However, the code extended by the proposed method protecting BL in the UEP transmission scheme is strong enough to successfully decode the signal. Based on Table 4, it can be said that the signal strength drops to SNR value between 6.7 dB and 9.3 dB in AWGN channel and 9.5 dB and 12.8 dB in TU6 channel. Figure 8 depicts a video quality of the Soccer sequence for the UEP case and the EEP case, when such a drop in the received signal strength lasts 2 seconds. As it can be observed, the PSNR curve for the UEP case shows acceptable video quality during the degradation phase, whereas for the EEP case, the video quality is completely unacceptable during that period. Moreover, it should be noted that in the UEP case, the user receives continuous video with a lower quality and a lower frame rate while, in the EEP case, the user experiences a 2secondlong frame freeze. Table 7 presents the average PSNR values for each tested sequence for three error duration periods: 0.5, 1, and 2 seconds. The values presented in Table 7 clearly show a better video service is achieved when the proposed extension method is utilized to provide the UEP transmission scheme.

7. Conclusions
In this paper, a method to extend the LDPC codes of the DVBT2 system was proposed. The method was introduced to overcome the limitations imposed by the DVBT2 standard and to enable varying FEC protection for data transmitted over a single PLP. Using the proposed extension, it becomes possible to adjust the protection level of the native DVBT2 LDPC codes BB frame by BB frame. Consequently, services transmitted using a single PLP are enabled to have different levels of error protection that may be used at the service component level. The paper also discussed the adaptation of the proposed LDPC extension method in the DVBT2 framing structure to ensure backwards compatibility to the legacy receivers. Moreover, a stepbystep description of the design procedure of the LDPC extension was provided. The procedure should make extension of any of the native DVBT2 LDPC codes relatively simple. The simulation results provide evidence of the benefits of deploying the proposed LDPC code extension in the DVBT2 environment. The results have shown that with the same bit budget, due to the use of the LDPC extension, the UEP transmission scheme can be implemented and playback continuity at the receiver side in adverse channel conditions can be significantly improved. Consequently, better user experience in DVBT2 transmission system can be ensured.
Abbreviations
AWGN:  Additive White Gaussian Noise 
BB:  Base Band 
BCH:  BoseChaudhuriHocquenghem 
BER:  Bit Error Rate 
BICM:  Bit Interleaved Coding and Modulation 
BL:  Base Layer 
CIF:  Common Intermediate Format 
DVB:  Digital Video Broadcasting 
DVBT2:  DVB 2nd Generation Terrestrial 
EEP:  Equal Error Protection 
eIRA:  extended Irregular RepeatAccumulate 
EL:  Enhancement Layer 
EXIT:  EXtrinsic Information Transfer 
FEC:  Forward Error Correction 
LDPC:  LowDensity Parity Check 
PLP:  Physical Layer Pipe 
PSNR:  Peak Signalto NoiseRatio 
SNR:  SignaltoNoise Ratio 
SVC:  Scalable Video Coding 
UEP:  Unequal Error Protection. 
Acknowledgments
This work was partially supported by Nokia and the Academy of Finland, Project no. 129657 (Finnish Centre of Excellence program 2006–2011).
References
 International Telecommunication Union, Frame Error Robust Narrowband and Wideband Embedded Variable BitRate Coding of Speech and Audio from 832 kbit/s, Telecommunication Standardization Sector of ITU, Geneva, Switzerland, 2008.
 International Telecommunication Union, Advance Video Coding for Generic Audiovisual Services, Telecommunication Standardization Sector of ITU, Geneva, Switzerland, 2007.
 Digital Video Broadcasting (DVB), http://dvb.org/.
 Digital Video Broadcasting (DVB), “Commercial Requirements for NGH,” DVB Document CMNGH0015, June 2009. View at: Google Scholar
 European Telecommunications Standards Institute (ETSI), “Specification for the use of Video and Audio Coding in DVB services delivered directly over IP protocols,” TS 102 005, March 2010. View at: Google Scholar
 European Telecommunications Standards Institute (ETSI), “Digital Video Broadcasting (DVB): frame structure channel coding and modulation for a second generation digital terrestrial television broadcasting system (DVBT2),” TS 102 005, March 2010. View at: Google Scholar
 Digital Video Broadcasting (DVB), “Upper Layer Forward Error Correction in DVB,” DVB Document A148, March 2010. View at: Google Scholar
 I. Bouazizi, L. Kondrad, M. Hannuksela, and M. Gabbouj, “Efficient FEC protection of scalable media streams in DVBH,” in Proceedings of the 58th Annual IEEE Broadcast Symposium, pp. 1–6, October 2008. View at: Google Scholar
 M. M. Hannuksela, V. K. M. Vadakital, and S. JumiskoPyykkö, “Comparison of error protection methods for audiovideo broadcast over DVBH,” EURASIP Journal on Advances in Signal Processing, vol. 2007, Article ID 71801, 12 pages, 2007. View at: Publisher Site  Google Scholar
 L. Kondrad, I. Bouazizi, and M. Gabbouj, “LDPC fec code extension for unequal error protection in 2ND generation DVB systems,” in Proceedings of the IEEE International Conference on Multimedia and Expo (ICME '10), pp. 504–509, July 2010. View at: Publisher Site  Google Scholar
 R. G. Gallager, “Low density paritycheck odes,” IRE Transactions on Information Theory, vol. 8, no. 1, pp. 21–28, 1962. View at: Google Scholar
 D. MacKay and R. Neal, “Good codes based on very sparse matrices,” in Cryptography and Coding, C. Boyd, Ed., vol. 1025 of Lecture Notes in Computer Science, pp. 100–111, Springer, Berlin, Germany, 1995. View at: Google Scholar
 T. J. Richardson, M. A. Shokrollahi, and R. L. Urbanke, “Design of capacityapproaching irregular lowdensity paritycheck codes,” IEEE Transactions on Information Theory, vol. 47, no. 2, pp. 619–637, 2001. View at: Publisher Site  Google Scholar
 M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman, “Improved lowdensity paritycheck codes using irregular graphs,” IEEE Transactions on Information Theory, vol. 47, no. 2, pp. 585–598, 2001. View at: Publisher Site  Google Scholar
 T. J. Richardson and R. L. Urbanke, “Efficient encoding of lowdensity paritycheck codes,” IEEE Transactions on Information Theory, vol. 47, no. 2, pp. 638–656, 2001. View at: Publisher Site  Google Scholar
 M. Yang, W. E. Ryan, and Y. Li, “Design of efficiently encodable moderatelength highrate irregular LDPC codes,” IEEE Transactions on Communications, vol. 52, no. 4, pp. 564–571, 2004. View at: Publisher Site  Google Scholar
 J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference, Morgan Kauffmann, San Francisco, Calif, USA, 1988.
 T. K. Moon, Error Correction Coding: Mathematical Methods and Algorithms, WileyInterscience, 2005.
 R. M. Tanner, “A recursive approach to low complexity codes,” IEEE Transactions on Information Theory, vol. 27, no. 5, pp. 533–547, 1981. View at: Google Scholar
 Y. Weiss, “Correctness of local probability propagation in graphical models with loops,” Neural Computation, vol. 12, no. 1, pp. 1–41, 2000. View at: Google Scholar
 R. C. Bose and D. K. RayChaudhuri, “On a class of error correcting binary group codes,” Information and Control, vol. 3, no. 1, pp. 68–79, 1960. View at: Google Scholar
 Z. Li, L. Chen, L. Zeng, S. Lin, and W. H. Fong, “Efficient encoding of quasicyclic lowdensity paritycheck codes,” IEEE Transactions on Communications, vol. 54, no. 1, pp. 71–81, 2006. View at: Publisher Site  Google Scholar
 R. Storn and K. Price, “Differential evolution a simple and efficient heuristic for global optimization over continuous spaces,” Journal of Global Optimization, vol. 11, no. 4, pp. 341–359, 1997. View at: Google Scholar
 T. J. Richardson and R. L. Urbanke, “The capacity of lowdensity paritycheck codes under messagepassing decoding,” IEEE Transactions on Information Theory, vol. 47, no. 2, pp. 599–618, 2001. View at: Publisher Site  Google Scholar
 S. T. Brink, “Convergence behavior of iteratively decoded parallel concatenated codes,” IEEE Transactions on Communications, vol. 49, no. 10, pp. 1727–1737, 2001. View at: Publisher Site  Google Scholar
 S. ten Brink and G. Kramer, “Design of repeataccumulate codes for iterative detection and decoding,” IEEE Transactions on Signal Processing, vol. 51, no. 11, pp. 2764–2772, 2003. View at: Publisher Site  Google Scholar
 J. Thorpe, “Lowdensity paritycheck (LDPC) codes constructed from protographs,” Tech. Rep. JPL INP, 2003. View at: Google Scholar
 X. Y. Hu, E. Eleftheriou, and D. M. Arnold, “Progressive edgegrowth tanner graphs,” in Proceedings of the IEEE Global Telecommunicatins Conference (GLOBECOM '01), vol. 2, pp. 995–1001, November 2001. View at: Google Scholar
 European Telecommunications Standards Institute (ETSI), “Digital Video Broadcasting (DVB): implementation guidelines for a second generation digital terrestrial television broadcasting system (DVBT2),” TS 102 831, February 2009. View at: Google Scholar
 “Digital Land Mobile Radio Communications—COST 207,” Tech. Rep., Commission of the European Communities, Luxemburg, 1989. View at: Google Scholar
Copyright
Copyright © 2012 Lukasz Kondrad et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.