Trellis and Turbo Coding
A Wiley-IEEE Press Publication |
Contents
1 Introduction | 1 |
2 Communication Theory Basics | 25 |
3 TrellisCoded Modulation | 51 |
4 Convolutional Codes | 95 |
5 Link to Block Codes | 125 |
6 Performance Bounds | 155 |
7 Decoding Strategies | 183 |
Other editions - View all
Common terms and phrases
achieved additive algorithm application approximation assume AWGN basic becomes binary block codes bound BPSK branch calculated called capacity channel Chapter codeword Commun complex component computational consider constellation construction convolutional codes correct corresponding decoding discussed efficiency encoder equal equivalent error example fact factor free distance function gain given graph Hamming IEEE Trans illustrated inner input interleaver iterative label lattice length limit linear mapping matrix maximum messages metric minimal modulation multiplicity noise Note obtain operation outer output parallel parity parity-check partition path performance polynomial possible probability random received Select sequence serial concatenated shown in Figure shows signal set squaring Step symbols systematic term Theorem Theory transmitted trellis codes turbo codes values variable node vector weight