| Preface | p. xi |
| Basics of Lattice Theory | p. 1 |
| Definition of a Lattice | p. 1 |
| Examples of Lattices | p. 2 |
| Sublattices. Lattice Partitions, and Cosets | p. 7 |
| Binary Lattices and Coset Representatives | p. 11 |
| Fundamental Regions and Volumes, and Voronoi Regions | p. 15 |
| Formula for the Fundamental Volume | p. 17 |
| Linear Transformations and the Fundamental Volume | p. 18 |
| Fundamental Volume of a Sublattice | p. 18 |
| Point Spacing, Weight Distributions, and Theta Series | p. 19 |
| Fundamental Coding Gain | p. 22 |
| Performance Measures for Multidimensional Constellations | p. 25 |
| Introduction | p. 25 |
| Constellation Figure of Merit and Symbol Error Probabilities | p. 27 |
| Normalized Bit Rate and Average Power | p. 28 |
| Definition of CFM and Examples | p. 28 |
| One-Dimensional PAM Constellation | p. 29 |
| M x M Square Grid | p. 31 |
| N-Cube Grid | p. 33 |
| An Approximation to the Symbol Error Probability for Large Square QAM Constellations at High SNR | p. 34 |
| The Continuous Approximation | p. 35 |
| Constituent 2D Constellations and Constellation Expansion Ratio | p. 36 |
| Peak-to-Average Power Ratio | p. 37 |
| PAR for the M x M Square Grid and N-Cube Grid | p. 37 |
| PAR for a Circle | p. 38 |
| PAR for the N-Sphere | p. 40 |
| Representing CFM(C) in Terms of Coding Gain and Shaping Gain | p. 41 |
| Why [gamma subscript c]([Lambda]) is Called the Fundamental Coding Gain | p. 43 |
| Shaping Gain Properties and Examples | p. 44 |
| Ultimate Shaping Gain and 2D Distribution | p. 47 |
| Coding and Shaping Factors of the Constellation Expansion Ratio | p. 49 |
| Factors of the Peak-to-Average Power Ratio | p. 53 |
| Optimum Tradeoffs of Shaping Gain with CER[subscript S] and PAR | p. 55 |
| Principles of Convolutional and Trellis Codes | p. 61 |
| The Huffman D-Transform | p. 61 |
| Two-Sided Transform of a Delayed Sequence | p. 62 |
| One-Sided Transform of a Delayed Sequence | p. 63 |
| D-Transform of a Convolution | p. 64 |
| Transfer Functions and Realizations | p. 64 |
| Type 1 Direct Form Realization | p. 65 |
| Type 2 Direct Form Realization | p. 66 |
| Description of a Convolutional Code by its Generator Matrix | p. 67 |
| Systematic Form of a Convolutional Code | p. 69 |
| The Parity Check Matrix and Syndromes | p. 71 |
| Inverse Check Matrix or Inverse Syndrome Former | p. 73 |
| The Code Trellis | p. 75 |
| Weight Distributions and Error Correction Properties | p. 76 |
| Trellis Coded Modulation (TCM) | p. 79 |
| Brief Review of the Viterbi Decoding Algorithm | p. 85 |
| The Fundamental Coding Gain of a Trellis Code | p. 89 |
| Trellis Shaping | p. 91 |
| Trellis Shaping Based on Lattice Partitions | p. 92 |
| The Trellis Shaping Encoder | p. 92 |
| The Receiver | p. 97 |
| Selection of a Specific Constellation | p. 97 |
| Trellis Shaping on Regions | p. 106 |
| Essential Properties of Trellis Shaping Based on Lattice Partitions | p. 107 |
| The Trellis Shaping Encoder for Shaping on Regions | p. 109 |
| The Receiver for Shaping on Regions | p. 112 |
| Peak-to-Average Ratio Considerations | p. 112 |
| CER[subscript S] and PAR[subscript 2] Constraints with the 4-State Ungerboeck Shaping Code | p. 112 |
| Nonlinear Precoding Methods to Remove Intersymbol Interference | p. 117 |
| Tomlinson/Harashima Precoding | p. 118 |
| LTF/Motorola/GDC Precoding | p. 122 |
| Precoding and Noise Whitening | p. 128 |
| The First-Order Linear Predictor | p. 131 |
| Trellis Precoding | p. 133 |
| Trellis Precoding Based on Shaping on Regions | p. 133 |
| The Transmitter | p. 134 |
| The Receiver | p. 139 |
| An Example of a Trellis Precoding System | p. 139 |
| Trellis Precoding Based on Lattice Partitions and Linear Codes | p. 143 |
| Experimental Performance Results | p. 144 |
| Mapping Data to Channel Symbol Frames by a Modulus Encoder | p. 147 |
| The AT&T Fractional Bit Rate Modulus Converter | p. 148 |
| The V.90 Modulus Encoder | p. 152 |
| Constellation Shaping by Shell Mapping | p. 157 |
| General System Description | p. 158 |
| Ring Weights and the Number of Frames of Each Weight | p. 161 |
| Lexicographical Ordering of Ring Frames | p. 162 |
| The Decoding Algorithm | p. 166 |
| The Encoding Algorithm | p. 171 |
| Justification for the Motorola Weight Function | p. 178 |
| Shell Mapping Program | p. 180 |
| The Four Dimensional Constellation Used by Itu-T V.34 Modems | p. 187 |
| The 2D Constellation and its Partitioning | p. 187 |
| Generating the 2D Constellation by 90 Degree Rotations of 4Z[superscript 2] + (1,1) | p. 187 |
| Partitioning the 2D Constellation into 8 Subsets | p. 189 |
| A Method for Determining the Binary Subset Label from the Coordinates of a 2D Point | p. 192 |
| Framing | p. 193 |
| The 4D Constellation | p. 195 |
| Mapping Frames and Initial 4D Point Selection | p. 195 |
| Mapping the Initial 4D Point Into the Final 4D Point | p. 197 |
| 90[degree] Rotational Invariance of the 4D Constellation | p. 198 |
| Partitioning of the 4D Constellation | p. 200 |
| Slicing 4D Points to Partition Chain Binary Variables | p. 203 |
| The Combined Precoding and Trellis Coding Scheme for V.34 | p. 205 |
| The Nonlinear Precoder | p. 205 |
| The Precoder Input and Output | p. 207 |
| The Prediction Filter Output | p. 207 |
| The Modulo Box | p. 207 |
| Why the Precoder is the Inverse of H(z) | p. 208 |
| The Trellis Encoders | p. 209 |
| Viterbi Decoding of 4D Trellis Codes | p. 212 |
| More Details on the Wei 16-State Code | p. 213 |
| Generator and Check Matrices | p. 213 |
| Invariance to 90 Degree Rotations | p. 214 |
| The Fundamental Coding Gain | p. 215 |
| The Original Wei 16-State Convolutional Encoder | p. 215 |
| Using the Modulo Encoder to Make y(n) a Trellis Sequence | p. 216 |
| Superframe Synchronization | p. 219 |
| Compensating for Superframe Bit Inversions | p. 222 |
| Receiver Operation | p. 223 |
| Fast Equalizer Adjustment by Using a Periodic Training Sequence | p. 227 |
| The V.34 Periodic Training Sequence | p. 227 |
| The Periodic Autocorrelation Function and CAZAC Sequences | p. 227 |
| Constructing a CAZAC Sequence of Length M K[superscript 2] from one of Length M | p. 229 |
| The V.34 CAZAC Sequence | p. 233 |
| The Optimal Fractionally Spaced Equalizer | p. 233 |
| Derivation of the Optimum Linear Equalizer | p. 237 |
| MSE for the Optimum Linear Equalizer | p. 243 |
| Finding the Initial Equalizer Taps by Using the FFT | p. 244 |
| The Complex Cross-Coupled and Real Phase-Splitting Equalizers | p. 246 |
| Computing Equalizer Coefficients by Using the FFT | p. 249 |
| References | p. 255 |
| Index | p. 261 |
| Table of Contents provided by Ingram. All Rights Reserved. |