1,721,284 research outputs found
Unveiling turbo codes: some results on parallel concatenatedcodes
We propose an analytical method to upper bound the bit error probability of parallel concatenated block and convolutional codes
Performance evaluation of parallel concatenated codes
A parallel concatenated coding scheme consists of two simple systematic constituent encoders linked by an interleaver. The input bits to the first encoder are scrambled by the interleaver before entering the second encoder. The codeword of the parallel concatenated code consists of the input bits followed by the parity check bits of both encoders. The authors propose a method to evaluate the bit error probability of a parallel concatenated coding scheme in a way which is independent from the interleaver used. The two cases of parallel concatenated block codes and parallel concatenated convolutional codes are considered
Multilevel polarization shift keying: optimum receiver structure and performance evaluation
A new decoding algorithm for trellis codes over groups
A new decoding algorithm for geometrically uniform TCM schemes is proposed, based on the group properties of code sequences and trellis states, Its complexity is almost independent from the number of states of the trellis, and, for a given code, a trade-off between complexity and performance of the algorithm can be chose
Performance analysis of multiple subcarrier encoding of packet headers in quasi-all optical WDM networks
Performance evaluation of subcarrier encoding of packet headers in quasi-all-optical broadband WDM networks
Serial concatenation of interleaved codes: analytical performance bounds
Parallel concatenated coding schemes employing convolutional codes as constituent codes linked by an interleaver have been proposed in the literature as "turbo codes". They yield very good performance in connection with simple suboptimum decoding algorithms. In this paper, we propose an alternative scheme consisting of the serial concatenation of block or convolutional codes and evaluate its average performance in terms of analytical bounds on the bit error probability. Comparisons with parallel concatenated coding schemes show in some cases sensible advantages
- …
