Analysis and Design of Tuned Turbo Codes

@article{Koller2012AnalysisAD,
  title={Analysis and Design of Tuned Turbo Codes},
  author={Christian Koller and Alexandre Graell i Amat and J{\"o}rg Kliewer and Francesca Vatta and Kamil Sh. Zigangirov and Daniel J. Costello},
  journal={IEEE Transactions on Information Theory},
  year={2012},
  volume={58},
  pages={4796-4813}
}
It has been widely observed that there exists a fundamental tradeoff between the minimum (Hamming) distance properties and the iterative decoding convergence behavior of turbo- like codes. While capacity-achieving code ensembles typically are asymptotically bad in the sense that their minimum distance does not grow linearly with block length, and they therefore exhibit an error floor at moderate-to-high signal-to-noise ratios, asymptotically good codes usually converge further away from channel… Expand
On the error statistics of turbo decoding for hybrid concatenated codes design
  • F. Babich, F. Vatta
  • Computer Science
  • 2017 25th International Conference on Software, Telecommunications and Computer Networks (SoftCOM)
  • 2017
TLDR
A model for the generation of error patterns at the output of a turbo decoder is proposed that can be used to generate the error sequence with little effort and provides a basis for designing hybrid concatenated codes (HCC) employing the turbo code as inner code. Expand
Short Turbo Codes over High Order Fields
TLDR
Two classes of turbo codes constructed on high-order finite fields are introduced and provide remarkable coding gains over binary LDPC and turbo codes in the moderate-short block length regime. Expand
Performance Study of a Class of Irregular LDPC Codes Based on Their Weight Distribution Analysis
TLDR
This paper investigates the performance of irregular low-density parity-check (LDPC) codes on memoryless BI-AWGN channels, with sum-product decoding, using coefficients of its degree distributions to determine the growth rate of the minimum distance of an LDPC code. Expand
Spatially Coupled Turbo-Like Codes
TLDR
This paper proposes two extensions of braided convolutional codes (BCCs), and a class of turbo-like codes which have an inherent spatially coupled structure, to higher coupling memories, and gives a proof of threshold saturation for SC-TC ensembles with identical component encoders. Expand
Low complexity rate compatible puncturing patterns design for LDPC codes
TLDR
The design of rate-compatible puncturing patterns for LDPCs is addressed, using a previously defined formal analysis of a class of punctured LDPC codes through their equivalent parity check matrices to address the need for capacity-achieving channel coding techniques. Expand
Minimum Pseudoweight Analysis of 3-Dimensional Turbo Codes
TLDR
An extensive numerical study of small-to-medium block length 3D-TCs shows that typically (i.e., in most cases), when the minimum distance dmin and/or the stopping distance hmin is high, the minimum pseudoweight is strictly smaller than both dMin and hmin and that the minimum Pseudocodeword grows with the block length, at least for small- to- medium block lengths. Expand
ESTIMATION AND DESIGN OF MC-DS-CDMA FOR HYBRID CONCATENATED CODING IN HIGH SPEED VEHICULAR COMMUNICATION
TLDR
The design of Multi Carrier Direct Sequence Code Division Multiple Access (MC-DS-CDMA) structure which generalizes serial and parallel concatenation code is investigated and an improved concatenated code model is used for uplink mobile communication. Expand
Concatenated and interleaving codes for MC DS CDMA using Cadence virtuoso
Multi carrier DS CDMA technique is the next generation mobile communication system for future advances. Error correcting codes and concatenated codes are used for correcting the errors in dataExpand
An Effective Error Correction Scheme for Arithmetic Coding
We propose an effective error correction technique for arithmetic coding with forbidden symbol. By predicting the occurrence of the subsequent forbidden symbols, the forbidden region is actuallyExpand
Recent Results on the Implementation of a Burst Error and Burst Erasure Channel Emulator Using an FPGA Architecture
TLDR
This paper proposes and presents a direct hardware emulation of a Cyclone II FPGA architecture to simulate a burst error channel behaviour, in which errors are clustered together, and a burst erasure channel behaviour; and the results presented in the paper are valid for any FPGAs architecture that may be considered for this scope. Expand
...
1
2
...

References

SHOWING 1-10 OF 51 REFERENCES
Tuned turbo codes
As implied by previous studies, there exists a fundamental trade-off between the minimum distance and the iterative decoding convergence behavior of a turbo code. While capacity achieving codeExpand
Performance Analysis of 3-D Turbo Codes
TLDR
This work considers the minimum distance properties and convergence thresholds of 3-D turbo codes (3D-TCs), recently introduced by Berrou, and gives iterative decoding thresholds, computed from an extrinsic information transfer chart analysis, and presents simulation results on the additive white Gaussian noise channel to compare the error rate performance to that of conventional turbo codes. Expand
Hybrid concatenated codes with asymptotically good distance growth
Turbo Codes and multiple parallel concatenated codes (MPCCs) yield performance very close to the Shannon limit. However, they are not asymptotically good, in the sense of having the minimum distanceExpand
Coding theorems for turbo code ensembles
TLDR
It is proved that ensembles of parallel and serial turbo codes are "good" in the following sense: for any binary-input memoryless channel whose Bhattacharyya noise parameter is less than /spl gamma//sub 0/, the average maximum-likelihood (ML) decoder block error probability approaches zero. Expand
On the Performance of Low Complexity Multiple Turbo Codes
  • C. He
  • Computer Science
  • 2001
TLDR
A trellis-based analytical approach to determine the transfer characteristic of 2-state codes is presented and it is found that this method matches with that of mutual information based extrinsic information transfer (EXIT) characteristics derived from Monte Carlo simulations. Expand
Spectra and minimum distances of repeat multiple accumulate codes
In this paper we consider ensembles of codes, denoted RAm, obtained by a serial concatenation of a repetition code and m accumulate codes through uniform random inter-leavers. We analyze theirExpand
Coding Theorems for Repeat Multiple Accumulate Codes
TLDR
It is proved that the ensemble of codes formed by a serial concatenation of a repetition code with multiple accumulators connected through random interleavers asymptotically achieves linear distance growth close to the Gilbert-Varshamov bound. Expand
On the capacity of finite state channels and the analysis of convolutional accumulate-m codes
TLDR
This dissertation considers the noise thresholds of Convolutional Accumulate- m (CA-m) codes, the capacity of finite state channels (FSCs), and the information rates achievable via joint iterative decoding of irregular low-density parity-check (LDPC) codes over channels with memory. Expand
Spectra and Minimum Distances of Repeat Multiple–Accumulate Codes
TLDR
It is concluded that if m ges 2 the RAm are asymptotically good and that epsivm is the typical normalized minimum distance when the interleaver length goes to infinity, it is possible to conclude that the typical distance of the ensembles RAm converges to the Gilbert-Varshamov bound. Expand
Convergence behavior of iteratively decoded parallel concatenated codes
  • S. Brink
  • Computer Science
  • IEEE Trans. Commun.
  • 2001
TLDR
A code search based on the EXIT chart technique has been performed yielding new recursive systematic convolutional constituent codes exhibiting turbo cliffs at lower signal-to-noise ratios than attainable by previously known constituent codes. Expand
...
1
2
3
4
5
...