Learn More
A serially concatenated code with an interleaver consists of the cascade of an outer code, an interleaver permuting the outer codewords' bits, and an inner code whose input words are the permuted outer codewords. The construction can be generalized to h cascaded codes separated by h − 1 interleavers. We obtain upper bounds to the average maximum-likelihood(More)
A simple bound on the probability of decoding error for block codes is derived in closed form. This bound is based on the bounding techniques developed by Gallager. We obtained an upper bound both on the word-error probability and the bit-error probability of block codes. The bound is simple, since it does not require any integration or optimization in its(More)
— Concatcnateci coding schemes consist of the combination of two or more simple co flslil[4ctlt rflcoder.v and intcrlcavcrs. The parallel concatenation known as " tLlrbo code " has been shown to yiclcl remarkable cociing gains close to theoretical limits, yet admitting a relatively simple iterative clccocling tcchniqLlc. The recently proposed serial(More)
—In this paper, we propose an innovative channel coding scheme called accumulate-repeat-accumulate (ARA) codes. This class of codes can be viewed as serial turbo-like codes or as a subclass of low-density parity check (LDPC) codes, and they have a projected graph or protograph representation; this allows for high-speed iterative decoding implementation(More)
Turbo codes are the most exciting and potentially important development in coding theory in many years. They were introduced in 1993 by Berrou, Glavieux and Thitimajshima [1], and claimed to achieve near Shannon-limit error correction performance with relatively simple component codes and large interleavers. A required E b /N o of 0.7 dB was reported for(More)