A survey of three-dimensional turbo codes and recent performance enhancements
© Ismail et al.; licensee Springer. 2013
Received: 18 November 2011
Accepted: 20 March 2013
Published: 26 April 2013
This paper presents a survey of two techniques intended for improving the performance of conventional turbo codes (TCs). The first part of this work is dedicated to explore a hybrid concatenation structure combining both parallel and serial concatenation based on a three-dimensional (3D) code. The 3D structure, recently introduced by Berrou et al., is able to ensure large asymptotic gains at very low error rates at the expense of an increase in complexity and a loss in the convergence threshold. In order to reduce the loss in the convergence threshold, the authors consider first a time-varying construction of the post-encoded parity. Then, they investigate the association of the 3D TC with high-order modulations according to the bit-interleaved coded modulation approach. The second part of this study deals with irregular TCs. In contrast to 3D TCs, although irregular TCs can achieve performance closer to capacity, their asymptotic performance is very poor. Therefore, the authors propose irregular turbo coding schemes with suitable interleavers in order to improve their distance properties. Finally, a modified encoding procedure, inspired from the 3D TC, makes it possible to obtain irregular TCs which perform better than the corresponding regular codes in both the waterfall and the error floor regions.
KeywordsTurbo code Iterative decoding Three-dimensional turbo code Convergence threshold EXIT chart Time-varying trellis Irregular turbo code Degree profile Dijkstra's algorithm Correlation graph
In 1971, the whole community of coding and information theory was in phase with the famous speech of Professor Robert McEliece: “Too many equations had been generated with too few consequences… Coding theorist professors had begotten more coding theory Ph.D.'s in their own image… no one else cared; it was time to see this perversion for what it was. Give up this fantasy and take up a useful occupation… Coding is dead.” This assertion was contradicted 20 years later by the invention of turbo codes (TCs) , which was a revival for the channel coding research community. Their near-capacity performance and their suitability for practical implementation explain the adoption of TCs in various communication standards as early as the late 1990s. However, TCs suffer from a flattening effect when the error rate reaches a limit and stops improving. In future system generations, low error rates will be required to open the way to real-time and demanding applications, such as TV broadcasting or videoconferencing. The minimum Hamming distance (MHD) of state-of-the-art TCs may not be sufficient to ensure large asymptotic gains at very low error rates. Therefore, they are no longer suitable for these kinds of applications, and more powerful coding schemes are required. At the same time, a reasonable level of complexity should be preserved.
In [2, 3], a three-dimensional (3D) TC was introduced, combining both parallel and serial concatenation. It is simply derived from the classical TC by concatenating a rate-1 post-encoder at its output, which encodes only a fraction λ of the parity bits from the upper and lower constituent encoders. The fraction 1-λ of parity bits which are not re-encoded is directly sent to the channel or punctured to achieve the desired code rate. The 3D TC improves performance in the error floor compared to the TC, at the expense of a loss in the convergence threshold and an increase in complexity.
In this paper, the authors investigate this hybrid concatenated coding scheme. Afterwards, their interests go towards irregular TCs . In our work, we focused on the improvement of the 3GPP2 code used in the third-generation (3G) cdma2000 mobile phone communication systems . Then, the two constituent encoders are eight-state recursive systematic convolutional (RSC) encoders with feedback polynomial 1 + D2 + D3 and parity generator polynomial 1 + D + D3.
MHD values for 3GPP2 TC and corresponding 3D code for different coding and block sizes
k = 570 bits
3D-TC, λ = 1/4
3D-TC, λ = 1/8
3D-TC, λ = 1/16
k = 762 bits
3D-TC, λ = 1/4
3D-TC, λ = 1/8
3D-TC, λ = 1/16
k = 1,530 bits
3D-TC, λ = 1/8
k = 6,138 bits
3D-TC, λ = 1/8
Different convergence thresholds of 3GGP2 3D TCs over the AWGN channel
λ = 0
Convergence thresholds of 3GGP2 3D TCs over Rayleigh fading channel and comparison with Gaussian channel
3D TC ()
Loss in convergence threshold
Rayleigh fading channel
3D TC ()
Loss in convergence threshold
This paper is organised as follows. In section 2, we present the 3D TC structure and its different parameters. Section 3 deals with performance improvement of 3D TCs. We introduce a method to optimize 3D TCs in order to increase the MHD even more. Furthermore, we discuss convergence issues in the same section and introduce time-varying three-dimensional TCs as an alternative to reduce the loss in the convergence threshold. We also analyse the association of the 3D TC with high-order modulations, taking into account the different protection levels of the constellation. Section 4 is dedicated to irregular TCs. First of all, the degree profile is selected by means of extrinsic information transfer (EXIT) diagrams. Then, the design of powerful permutations suited for such code structures is considered. Graph-based permutations using Dijkstra's algorithm and an estimation of the minimum distance improve the distance properties of these codes. To take advantage of the results using both 3D TCs and irregular TCs, the two techniques are combined and a new modified structure is proposed. The association of irregular TCs with the same post-encoder used for 3D TCs results in irregular turbo coding schemes which perform better than regular TCs at low and high signal-to-noise ratios (SNRs) at the same time. Finally, section 5 draws some conclusions.
2. Exploring three-dimensional turbo codes
2.1 Properties of three-dimensional turbo codes
The choice of the post-encoder influences also the performance in both the waterfall and error floor regions. It has to meet different requirements already detailed in [2, 3, 6]. In , we justified the choice of the post-encoder by means of EXIT analysis. A four-state binary convolutional encoder is used in practice. The RSC code with feedback polynomial 1 + D2 and parity generator polynomial 1 has been selected to be the post-encoder in different simulations of the 3D TC.
The 3D TC is characterized by two permutations denoted by π and π′, as shown in Figure 1. π is the internal permutation of the TC, and π′ is used to spread a fraction λ of the parity bits before feeding them to the post-encoder. Let i and j be the address in the natural order and in the permuted order, respectively. For the regular permutation, we assume π′ to be defined by the following congruence relation: i = π ' (j) = (P0j + i0) P, where i 0 is the starting index, and P 0 is an integer relatively prime with P. For each block length, these parameters have to be carefully chosen to guarantee a large spread. It was observed through the different simulations that the important property is the spread. In the sequel, π′ corresponds to the regular permutation achieving a spread of , where P is the size of the frame to be post-encoded. The 3D TC performs better with regular π′ than with a random interleaver in terms of MHD and convergence. Details are available in .
2.2 Performance of 3GPP2 three-dimensional turbo codes
We have investigated the distance gain and the effect on TC convergence threshold for different block sizes, coding rates and permeability rates. Similar to the case of double-binary codes in [2, 3], we have observed that the addition of the post-encoder improves the asymptotical behaviour of the 3GPP2 TC in many cases. Table 1 presents examples of MHD values obtained with this code for different block sizes and coding rates, using the all-zero iterative decoding algorithm . We can observe that the direct application of the third coding dimension to the existing code leads to an increase of its minimum distance, except in the case of high coding rates. The authors in  analyzed the asymptotic weight distribution of 3D TCs and showed that their typical minimum distance may, depending on certain parameters, asymptotically grow linearly with the block length. Table 1 shows that it is attractive to increase λ, since larger minimum distances are obtained. However, this will be paid in terms of loss in convergence threshold, as explained above. Also, the increase in complexity is not negligible. In [2, 3], the computational complexity increase was estimated to be less than 10% with respect to classical two-dimensional TC. This first estimation of the complexity increase was optimistic. In fact, 3D TC hardware implementation issues have been thoroughly investigated in . We proposed an appropriate hardware architecture of a 3D turbo decoder and the corresponding complexity analysis. When high throughputs are required for a given application, several processors can be placed in parallel, thus decreasing the relative additional complexity of the 3D coding scheme. For example, the computational complexity increase is 36% when only two processors are placed in parallel, for k = 1,530 bits, and . It is 25% with four processors. An increase of less than 10% in the memory requirements is also necessary for 3D TCs.
3. Improving three-dimensional turbo codes
Two different study directions have been investigated in order to improve 3D TCs. First, we have observed that, for the 3GPP2 TC, the error patterns with weight MHD often have very low multiplicities. Then, the first step involves eliminating these codewords by means of the adoption of a non-regular post-encoding pattern. This optimization method is detailed in , and different results show that modifying a few addresses in the pattern of post-encoding produces an improvement in the distance properties.
Second, the current post-encoder has been replaced by a time-varying (TV) trellis-based encoder in order to reduce the loss of the convergence threshold. The association of 3D TCs with high-order constellations has been investigated for the same purpose. The next subsections deal with the improvement of the convergence threshold of 3D TCs for transmissions over Rayleigh fading channels. More details are available in [6–8] where transmissions over Gaussian channels were considered.
3.1 Convergence threshold of three-dimensional turbo codes
The convergence thresholds of 3GPP2 3D TCs are estimated through an EXIT chart analysis  on the additive white Gaussian noise (AWGN) channel and on the Rayleigh fading channel as well. To generate the EXIT chart of a TC, we have to consider the transfer characteristics of the extrinsic information for each soft-input soft-output (SISO) decoder. In the case of 3D TC, the two SISO decoders exchange extrinsic information about the systematic part of the received codeword, like for classical turbo decoding. However, both of them exchange also extrinsic information about the post-encoded parity bits with the four-state SISO predecoder, and we have to take into account in the EXIT chart that the extrinsic information about these parity bits is changing from an iteration to the other. Consequently, the curves of mutual information exchange between the two decoders change every iteration. The convergence threshold of the code is the minimum SNR where the only intersection point between the two transfer characteristics curves is the point (1,1). Different convergence thresholds of 3GPP2 3D TCs, for several code rates and values of λ, are given in Table 2. For a fixed code rate R, the best convergence threshold is achieved by the classical TC (λ = 0). The loss in the convergence threshold increases with λ. In Table 3, we compare the loss in convergence due to the use of 3D TCs for transmissions over the Rayleigh fading channel and over the AWGN channel at coding rate and . Table 3 shows that the loss of convergence is more significant over the Rayleigh fading channel. This result represents a drawback of 3D TCs. In fact, for applications such as the terrestrial mobile radio communications where the simulations are carried out over fading channels, the loss of convergence can be significant. However, the 3D TCs proved to be suited to transmissions over Gaussian channels. Thus, they can be used in applications such as fixed satellite communications. In the following subsections, we propose two techniques to remedy these convergence issues.
3.2 Time-varying three-dimensional turbo codes
Among all the simulations carried out, it was observed that the time-varying parity construction reduces the loss of convergence by 10% to 50% of the value expressed in decibels. We have systematically checked that the asymptotic performance is not degraded. In fact, the choice of the post-encoder does not influence a lot the minimum distance of the 3D TC for a fixed code memory and for a given permeability rate λ. For the time-varying post-encoder, there is no reason to improve or degrade the asymptotic performance since we introduce few local modifications. However, the higher the local minimum distance of the post-encoder, the better the level of the extrinsic information which the predecoder supplies to the two SISO decoders. Therefore, the TV technique acts as a convergence accelerator of the 3D TC. In addition, we have observed that the EXIT of a time-varying 3D TC changes with the value of L. This tool can be used to choose an optimal value of L. The selected value can be the L that produces the lowest convergence threshold.
3.3 Three-dimensional turbo codes for high spectral efficiency transmissions
We have also investigated the association of the 3D TC with high-order modulations. This structure is used for applications where high data throughputs are required such as the transmission of high-definition television (HD TV). In the most recent transmission systems, high bit rates require using high-order modulations, such as 16-QAM for 3GPP2, 64-QAM for LTE and 256-QAM for DVB-NGH.
We consider a coded modulation scheme based on the so-called pragmatic or bit-interleaved coded modulation approach : a turbo encoder and a modulator that follows an interleaver and a Gray mapper. It is known that among the bits forming a Gray-labelled symbol in M-QAM or M-PSK modulations for M > 4, the average probability of error is not the same for all the bits . Therefore, three constellation mappings, all compliant with Gray labelling, were investigated. First, the mapping is uniformly distributed on the entire constellation. In a second configuration, the systematic bits are mapped to better protected places as a priority, and all the other bits are uniformly distributed. For the third mapping, the systematic bits are first mapped to better protected places as a priority. Then, if it is possible, the post-encoded parity bits are better protected by the considered modulation than the other non-re-encoded parity bits. This choice is made because the systematic bits as well as the post-encoded parity bits are used by both decoders during the decoding process. Thus, protecting them is expected to reduce the loss of convergence. At the receiver side, the demapper computes the log likelihood ratio (LLR) related to each bit of the information sequence. This symbol-to-bit LLR calculation is followed by a 3D turbo decoder using the MAP algorithm. The application of the proposed transmission scheme in two particular cases of the 3GPP2 3D code is presented below. In both cases, we consider a transmission over a Rayleigh fading channel that has been shown to be a challenging type of channel for 3D TCs.
3.3.1 Example 1: 3D TCs associated with a 16-QAM modulator
3.3.2 Example 2: 3D TCs associated with an 8-PSK modulator
The investigation of the previous three Gray mappings allows some rules of conception to be defined. In fact, a loss of convergence is still observed when the bits in a symbol are uniformly distributed on the entire constellation. However, when the second configuration or the last one is used, the loss in the convergence threshold disappears and a gain in the waterfall region is observed. When these both configurations can be implemented, the configuration 3 must be used as far as possible. Otherwise, it is necessary to implement at least the configuration 2, as in the example presented above for the 8-PSK. When the systematic bits are first protected as a priority and, if possible, the post-encoded bits, a significant gain is obtained. The technique is all the more interesting as the coding rates are higher for the same value of λ, even for transmissions over fading channels. In other words, the problem related to the loss in the convergence threshold of 3D TCs can be solved.
To conclude, we notice that the notion of irregularity plays a major role to build 3D TCs having good performance at low and high SNRs. In fact, the optimization method, first presented in , is based on the use of a non-regular pattern of post-encoding and allows increasing the minimum distance. Besides, the time-varying post-encoder with a little irregularity and also the association of the 3D TC with high-order modulations, where both the systematic bits and the post-encoded parity bits are more protected than the other parity bits, create a sort of irregularity in the Gray mapping. Both represent a success in reducing or even eliminating the problem of convergence loss. The next step of the study concerns the investigation of irregular TCs. The aim is to obtain an irregular TC which performs well in both the waterfall and the error floor regions.
4. Irregular turbo codes
4.1 Another representation of turbo codes
The performance of the self-concatenated regular TC is identical to the one we get using the standard turbo encoder when the interleaver length is sufficiently high. For short and medium block sizes, a few additional iterations are necessary to achieve the same performance. This is due to the decoding process because no extrinsic information is available at the first iteration. It is possible to implement a shuffled iterative decoding [21, 22] in order to achieve the same performance as for the classical turbo encoder and avoid adding iterations in practice. In shuffled decoding, the decoder updates the extrinsic information as soon as possible, without waiting for all the copies of a given data to be processed. In other words, the decoder does not wait until the next iteration to send extrinsic messages. However, as it does not represent a major problem, we have chosen to increase the number of iterations in our simulations by two additional iterations for the classical sequential decoding.
An irregular TC consists of the concatenation of a non-uniform repetition, an interleaver and a RSC code. In fact, the introduced irregularity makes it possible to improve the performance of a TC by inserting some bits inside the RSC trellis with a degree d > 2. These high-degree bits are commonly called pilot bits: they have reliable forward and backward metrics in the decoding process, and they propagate on both directions and influence the other bits with degree d = 2. However, making the code irregular leads to an increase in the rate of the constituent codes. Therefore, for usual coding rate values, only a small fraction of information bits is repeated d > 2 times. Thanks to their higher degree, the pilot bits include d extrinsics instead of two and are thus extremely well protected.
4.2 Selecting the degree profile
For irregular TCs, the information bits are divided into classes, each class j having a specific degree d j = j. The fraction of bits of degree d j in a class j is denoted by f j , where f j ∈ [0, 1]. A degree profile consists of all the degrees d j and their corresponding non-zero fractions f j . In the sequel, we represent a degree profile by the vector (f2, f3,…, fmax) or the vector (2, 3,…, max). The average information bit degree is . We keep the minimum degree equal to 2 in order to refer to the classical TC. The maximum degree is dmax.
The convergence threshold as well as the asymptotic performance of an irregular TC strongly depends on its degree profile. The best profile depends on the interleaver and the generator polynomials of the RSC code. For codes with very large block lengths, the optimization of the previous parameters can be done using the density evolution method developed by Richardson and Urbranke [23, 24]. Using this approach, irregular LDPC codes with performance at 0.0045 dB from the capacity were obtained . The Gaussian approximation can be used to speed up the search for good parameters. This sub-optimal method leads to quite accurate results and was defined in several different ways [26–29]. Although the density evolution method and the Gaussian approximation approach can be used to select a good degree profile for codes with large block sizes, Monte Carlo simulations of the bit error probability are carried on for finite length. The main drawback is that they are time-consuming, and only profiles with two non-zero fractions can be considered. In fact, the method consists in fixing a degree dIrreg and varying its fraction fIrreg. A fraction that achieves the best performance can be found. The next step involves changing the degree dIrreg, while the fraction fIrreg is fixed to the value already selected. We can then find optimal values for both dIrreg and fIrreg. However, this profile is not automatically the best one, since the optimization does not take into account all the possible combinations (dIrreg, fIrreg). Also, better performance may be attained when the profile is not restricted to two non-zero fractions. A simple method, based on the EXIT diagrams to select a good profile without resorting to extensive and long simulations, was introduced in . This method allows many degree profiles to be compared at the same time. Comparisons between different degree profiles in terms of convergence behaviour as well as asymptotic behaviour are made, and the selection of the best degree profiles can be progressively refined.
The application of this technique led to the choice of two degree values d = 2 and d = 8 with the following degree profile: . For reasons of simplicity, only two degrees have been considered, and d = 2 is fixed with reference to the classical TC. In the sequel, we adopt this profile as working assumption. In fact, compared to the regular TC, the irregular TC with degree profile (f2, f8) offers a significant gain in the waterfall region of 0.3 dB. However, this code has a poor performance in the floor. The following subsections focus on the improvement of performance at high SNRs.
4.3 Design of suitable permutations for irregular turbo codes
The first intuitive idea investigated was to design an interleaver where all the groups of eight bits are uniformly distributed. The objective is that they spread their reliable forward and backward metrics along the frame. On the other hand, the spread between the pilot groups should be large enough to avoid correlation between them. High correlation may dramatically degrade error correction performance and even ruin the possible gain due to a large minimum distance. An empirical value for the spread is to be at least equal to 2 × (ν + 1), where v is the memory length of the simulated code. The condition on the spread between the pilot groups imposes a constraint on the fraction f8 (fmax in general) of the pilot bits: , where dav is the average information bit degree and k is the total number of information bits. For usual block size values, the term is negligible, and the constraint above is a relation between fmax, dmax and v that can be expressed as follows: . For , dav = 3 and ν = 3, this condition can never be satisfied.
In the cases where this condition is not satisfied, we proposed an algorithm in order to jointly spread the groups of eight bits along the frame and maximize the MHD . This idea was inspired by a procedure described in  where the author focuses on the optimization of TC permutation design with the so-called almost regular permutation model. In , Kraidy et al. used a progressive edge growth-based interleaver for irregular TCs to lower the floor in the case of binary erasure channels. The algorithm we proposed is based on Dijkstra's algorithm  and on the estimation of the minimum distance for each permutation. To apply Dijkstra's algorithm in our specific context, we first represent the interleaver by a graph. At the beginning, the graph exists and it is empty. As we consider a tail-biting code, the graph has the form of a ring. The nodes, empty at first, are connected two by two in the ring. Thus, each node v i is connected to only a predecessor and a successor v j in the graph. The weight of each connection w i,j is equal to 1. The purpose of the algorithm is to put addresses in the nodes. Before interleaving, an appropriate repetition is applied to each bit among the k bits stemming from the source. The addresses that appear progressively in the graph are the interleaved addresses corresponding to the output of the interleaver. For each bit with repetition degree d, we choose a random interleaved address π(j) for the first copy. Then, we compute the distances from π(j) for any vertex in the actual graph by Dijkstra's algorithm. The interleaved address of the second copy is chosen at random such that the score for π(j) is greater than α times the best possible value. Then, a connection must appear in the graph between vπ(j) and vπ(j+1), represented by a crossbar of weight equal to 0: wπ(j),π(j+1) = 0.
The algorithm constructs the graph progressively. At the end, connections are added to the graph for every bit with degree d. These crossbars, of weight equal to 0, connect different interleaved data of the same information bit. Besides, the parameter 0 < α ≤ 1 is used to implement a random variation in the selection. The value α = 1 corresponds to the original Dijkstra's algorithm. We noticed that if we fix α = 1 in our algorithm, the obtained interleavers produce high values of girths but sometimes unacceptable values of minimum distances. The girth is the length of a shortest cycle contained in the graph. This criterion of selection was a priority for the author of . In fact, his first purpose was to maximize the correlation girth while keeping an acceptable minimum Hamming distance. However, the minimum Hamming distance is our most important criterion of selection in order to improve the distance properties of irregular TCs. If the pilot bits are highly correlated, they may dramatically degrade error performance and even ruin the possible gain due to a large minimum distance. In order to reduce the auto-correlation effect, the interleaver should spread the pilot bits by increasing the correlation girth. However, the minimum distance can suffer since a long cycle has more probability to contain parity bits of the same data bit. Thus, we do not look for maximizing this criterion but only increasing the correlation girth and searching for higher minimum distances. Therefore, different values were tested for the parameter a, and we finally set a to 0.85, giving a reasonable space of search. Every time an interleaver is found, we estimate the minimum Hamming distance of the irregular TC using the all-zero iterative decoding algorithm . Only interleavers that improve the asymptotic performance of irregular TCs are memorized.
The proposed algorithm allows suitable permutations to be designed that increase the minimum distance of irregular TCs. The pilot bits are now distributed along the frame in a way that they guarantee a good spread between the different groups, and the correlation effect between the pilot groups is reduced. This algorithm works very well for short block sizes . For medium sizes and large blocks, the algorithm leads to a systematic search for an optimized interleaver in a wide domain of parameter values, due to the random selection introduced by parameter a. When the block size is some thousand bits, the algorithm may take an unacceptable computational time to find good interleavers, and we cannot be sure of detecting all the possible cases.
4.4 Adding a post-encoder to irregular turbo codes
The proposed algorithm in section 4.3 is only practicable for short to medium blocks. It is possible to investigate the interleavers provided by the proposed algorithm and explore them in detail in order to find structured interleavers, having similar properties, which can be described in an analytical way. However, as previously explained, devising permutations for turbo codes is not an easy task. In order to ensure large asymptotic gain at very low error rates, even with non-optimized internal permutation, we propose an irregular TC inspired by our work about 3D TCs in order to improve the distance properties of these codes . A fraction 0 ≤ λ ≤ 1 of the parity bits are post-encoded by a rate-1 post-encoder. For the regular 3D TC, the increase in minimum distance is significant at the expense of a loss in convergence threshold and an increase in complexity. The same kind of behaviour is expected for irregular TCs.
In this paper, the authors have explored a hybrid structure combining both parallel and serial concatenation based on a three-dimensional code, simply derived from the classical TC by concatenating a rate-1 post-encoder at its output. Several techniques are proposed to improve 3D TCs. A first optimization method makes it possible to increase the MHD of the 3D TC even more by searching for irregular patterns of post-encoding. Then, the use of a time-varying post-encoder reduces the loss of convergence threshold for 3D TCs. When the 3D code is associated with high-order modulations, a specific Gray mapping allows the loss in convergence to be transformed into a gain at all SNRs. Thus, it is possible to build 3D TCs which have good performance in both regions.
In this paper, we also explore various aspects of irregular TCs. A method based on EXIT charts in order to select a good profile of degrees is presented. Afterwards, we discuss the design of powerful permutations suited for such code structures and propose an algorithm. Graph-based permutations built from a combination of Dijkstra's algorithm with an estimation of the minimum distance significantly improve the distance properties of irregular TCs. Finally, to take advantage of the results in the previous analysis of 3D TCs and in order to combine both studies, a new modified structure has been proposed: the association of irregular TCs with the same post-encoder used for 3D TCs results in irregular turbo coding schemes which perform better than regular TCs in both the waterfall and error floor regions.
- Berrou C, Glavieux A, Thitimajshima P: Near Shannon limit error-correcting coding and decoding: turbo-codes. In Proc. ICC'93. Geneva; 1993:1064-1070.Google Scholar
- Berrou C, Graell-i-Amat A, Ould-Cheikh-Mouhamedou Y, Douillard C, Saouter Y: Adding a rate-1 third dimension to turbo codes. In Proc. IEEE Inform. Theory Workshop. Lake Tahoe; 2007:156-161.Google Scholar
- Berrou C, Graell-i-Amat A, Ould-Cheikh-Mouhamedou Y, Saouter Y: Improving the distance properties of turbo codes using a third component code: 3D turbo codes. IEEE Trans Commun 2009, 57(9):2505-2509.View ArticleGoogle Scholar
- Boutros J, Caire G, Viterbo E, Sawaya H, Vialle S: Turbo code at 0.03 dB from capacity limit. In IEEE Int. Symp. Inf. Theory, Palais de Beaulieu. Lausanne, Switzerland; 30 June to 5 July 2002.Google Scholar
- Third Generation Partnership Project 2 (3GPP2): Physical layer standard for cdma2000 spread spectrum systems, Release F, December 2012, 3GPP2 C.S0002-F, Version 1.0. http://www.3gpp2.org/public_html/specs/C.S0002-F_v1.0_cdma2000_1x_PHY_20121210.pdf
- Kbaier Ben Ismail D, Douillard C, Kerouédan S: Improving 3-dimensional turbo codes using 3GPP2 interleavers. In ComNet'09: 1st Int. Conference on Communications and Networking. Hammamet; 2009.Google Scholar
- Kbaier Ben Ismail D, Douillard C, Kerouédan S: Reducing the convergence loss of 3-dimensional turbo codes. 6th Int. Symp. Turbo Codes and Related Topics, Brest 2010, 146-150.Google Scholar
- Kbaier Ben Ismail D, Douillard C, Kerouédan S: Analysis of 3-dimensional turbo codes. Ann Telecommun 2011, 65(7):257-268.Google Scholar
- Kbaier Ben Ismail D, Douillard C, Kerouédan S: Improving irregular turbo codes. Electron Lett 2011, 47(21):1184-1186. 10.1049/el.2011.2258View ArticleGoogle Scholar
- Kbaier Ben Ismail D, Douillard C, Kerouédan S: Design of suitable permutations for irregular turbo codes. Electron Lett 2011, 47(13):748-749. 10.1049/el.2011.0990View ArticleGoogle Scholar
- ten Brink S: Code doping for triggering iterative decoding convergence in Proc IEEE Int. Washington, DC, Jun: Symp. Inf. Theory; 2001:235.Google Scholar
- Boutillon E, Gnaeding D: Maximum spread of D-dimensional multiple turbo codes. IEEE Trans Commun 2005, 53(8):1237-1242. 10.1109/TCOMM.2005.852832View ArticleGoogle Scholar
- Garello R, Casado A: The all-zero iterative decoding algorithm for turbo code minimum distance computation. In Proc. ICC'2004. Paris; 2004:361-364.Google Scholar
- Amat GI, Rosnes E: Analysis of 3-dimensional turbo code ensembles. In IEEE Inform. Theory Workshop (ITW). Dublin; 30 August to 3 September 2010:46-50.Google Scholar
- Ten Brink S: Convergence behaviour of iteratively decoded parallel concatenated codes. IEEE Trans Commun 2001, 49(10):1727-1737. 10.1109/26.957394MATHView ArticleGoogle Scholar
- Costello D Jr: Free distance bounds for convolutional codes. IEEE Trans. Inform. Theory 1974, 20(3):356-365. 10.1109/TIT.1974.1055223MATHMathSciNetView ArticleGoogle Scholar
- Caire G, Taricco G, Biglieri E: Bit - interleaved coded modulation. IEEE Trans. Inform. Theory 1998, 44(3):927-946. 10.1109/18.669123MATHMathSciNetView ArticleGoogle Scholar
- Proakis JG, Salehi M: Digital modulation schemes in Digital Communications. Volume 3. 5th edition. Colombus: McGraw-Hill; 2008.Google Scholar
- Boutros J: Asymptotic behavior study of irregular turbo codes. In 7th International Workshop on DSP Tech. for Space Communications. Sésimbra; 2001.Google Scholar
- Divsalar D, Jin H, McEliece R: Coding theorems for "turbo-like" codes. In Proc. 36th Allerton Conference on Communications, Control, and Computing. Illinois: Allerton House, Monticello; 23–25 September 1998:201-210.Google Scholar
- Muller O, Baghdadi A, Jézéquel M: On the parallelism of convolutional turbo decoding and interleaving interference. In Proc. ICC'2006. San Francisco; 2006.Google Scholar
- Zhang J, Fossorier M: Shuffled iterative decoding. IEEE Trans Commun 2005, 53(2):209-213. 10.1109/TCOMM.2004.841982View ArticleGoogle Scholar
- Richardson T, Urbanke R: The capacity of low-density parity-check codes under message-passing decoding. IEEE Trans. Inform. Theory 2001, 47(2):599-618. 10.1109/18.910577MATHMathSciNetView ArticleGoogle Scholar
- Richardson T, Urbanke R: Efficient encoding of low-density parity-check codes. IEEE Trans. Inform. Theory 2001, 47(2):638-656. 10.1109/18.910579MATHMathSciNetView ArticleGoogle Scholar
- Chung S, Forney G Jr, Richardson T, Urbanke R: On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit. IEEE Commun Lett 2001, 5(2):58-60.View ArticleGoogle Scholar
- Chung S, Richardson T, Urbanke R: Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation. IEEE Trans. Inform. Theory 2001, 47(2):657-670. 10.1109/18.910580MATHMathSciNetView ArticleGoogle Scholar
- El Gamal H, Hammons AR Jr: Analyzing the turbo decoder using the Gaussian approximation. IEEE Trans. Inform. Theory 2001, 47(2):671-686. 10.1109/18.910581MATHMathSciNetView ArticleGoogle Scholar
- Sawaya H, Vialle S, Boutros J, Zémor G: Performance limits of compound codes with symbol-based iterative decoding. Electronic Notes in Discrete Mathematics 2001, 6: 433-443.View ArticleGoogle Scholar
- ten Brink S: Iterative decoding trajectories of parallel concatenated codes. In 3rd IEEE/ITG Conf Source and Channel Coding. Munich, Germany; 17–19 January 2000:75-80.Google Scholar
- Selection procedure of turbocode parameters by combinatorial optimization In 6th International Symposium on Turbo Codes and Iterative Information Processing (ISTC). Brest; Sept 2010:156-160.Google Scholar
- Kraidy GM, Savin V: Capacity-approaching irregular turbo codes for the binary erasure channel. IEEE Trans. Com. 2010, 58(9):2516-2524.View ArticleGoogle Scholar
- Dijkstra E: A note on two problems in connexion with graphs. Numer Math 1959, 1(1):269-271. 10.1007/BF01386390MATHMathSciNetView ArticleGoogle Scholar
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.