Corpus ID: 1045655

Coding theorems for 'turbo-like' codes

@inproceedings{Divsalar1998CodingTF,
  title={Coding theorems for 'turbo-like' codes},
  author={Dariush Divsalar},
  year={1998}
}
In this paper we discuss AWGN coding theorems for ensembles of coding systems which are built from fixed convolutional codes interconnected with random interleavers. [...] Key Result We believe this represents the first rigorous proof of a coding theorem for turbo-like codes.Expand
General coding theorems for turbo-like codes
  • Hui Jin, R. McEliece
  • Mathematics
  • 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)
  • 2000
In this paper we prove that for general memoryless binary input channels, most ensembles of parallel and serial turbo codes, with fixed component codes, are "good" in the sense that with maximumExpand
Coding Theorems for Generalized Repeat Accumulate Codes Background ❍ Turbo Codes ( Berrou et al . ) ❒ Analysis uses the Uniform Random Interleaver
In this paper, we present a coding theorem for the ensemble of Generalized Repeat Accumulate (GRA) codes. These codes are the serial concatenation of a terminated convolutional code andm interleavedExpand
Coding Theorems for Convolutional Accumulate-m Codes 3.1 Introduction
  • 2003
It is well-known that long random codes achieve reliable communication at noise levels up to the Shannon limit, but they provide no structure for efficient decoding. The introduction and analysis ofExpand
Chapter 2 The Serial Concatenation of Rate-1 Codes Through Uniform Interleavers 2
  • 2003
Since the introduction of turbo codes by Berrou, Glavieux, and Thitimajshima [3], iterative decoding has made it practical to consider a myriad of different concatenated codes, and the use ofExpand
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
RA Codes Achieve AWGN Channel Capacity
TLDR
It is proved that on the AWGN channel, RA codes have the potential for achieving channel capacity, and as the rate of the RA code approaches zero, the average required bit Eb/N0 for arbitrarily small error probability with maximum-likelihood decoding approaches log 2, which is the Shannon limit. Expand
The Minimum Distance of Turbo-Like Codes
TLDR
It is proven that depth-three serially concatenated codes obtained by concatenating a repetition code with two accumulator codes through random permutations can be asymptotically good. Expand
Product accumulate codes: a class of codes with near-capacity performance and low decoding complexity
TLDR
This work proposes PA codes as a class of prospective codes with good performance, low decoding complexity, regular structure, and flexible rate adaptivity for all rates above 1/2, and shows that these codes provide performance similar to turbo codes but with significantly less decoding complexity and with a lower error floor. Expand
Turbo-like codes for the block-fading channel
  • A. G. Fàbregas, G. Caire
  • Computer Science
  • International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.
  • 2004
TLDR
It is shown that standard block codes obtained by trellis-termination of convolutional codes have a gap from outage that increases with the block length: this is a different and more subtle manifestation of the so-called "interleaving gain" of turbo-like codes. Expand
The serial concatenation of rate-1 codes through uniform random interleavers
TLDR
This paper constructs "good" binary linear block codes at any rate r<1 by serially concatenating an arbitrary outer code of rate r with a large number of rate-1 inner codes through uniform random interleavers and proves that long codes from this ensemble will achieve the Gilbert-Varshamov (1952) bound with high probability. Expand
...
1
2
3
4
5
...

References

SHOWING 1-9 OF 9 REFERENCES
On the Design of Turbo Codes
In this article, we design new turbo codes that can achieve near-Shannon-limit performance. The design criterion for random interleavers is based on maximizing the effective free distance of theExpand
On the Design of Concatenated Coding Systems With Interleavers
TLDR
A method for computing a conjectured interleaving gain exponent and for optimizing the effective free distance of d2, a class of concatenated coding communications systems built from convolutional codes and interleavers. Expand
Unveiling turbo codes: some results on parallel concatenated coding schemes
TLDR
A method to evaluate an upper bound to the bit error probability of a parallel concatenated coding scheme averaged over all interleavers of a given length is proposed and used to shed some light on some crucial questions which have been floating around in the communications community since the proposal of turbo codes. Expand
Design of parallel concatenated convolutional codes
TLDR
The separate contributions that the interleaver length and constituent codes give to the overall performance of the parallel concatenated code are characterized, and some guidelines for the optimal design of the constituent convolutional codes are presented. Expand
Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1
A new class of convolutional codes called turbo-codes, whose performances in terms of bit error rate (BER) are close to the Shannon limit, is discussed. The turbo-code encoder is built using aExpand
Improved union bound on linear codes for the input-binary AWGN channel, with applications to turbo codes
  • A. M. Viterbi, A. Viterbi
  • Mathematics
  • Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)
  • 1998
While improved bounds have been central to proofs of the coding theorem and the tightness of the random coding bound for rates near capacity, most results for specific codes, both block andExpand
Serial concatenation of interleaved codes: performance analysis, design and iterative decoding
TLDR
Upper bounds to the average maximum-likelihood bit error probability of serially concatenated coding schemes are derived and a highly-performing iterative decoding algorithm is proposed. Expand
Error-Correcting Codes, 2nd. ed
  • 1972