Trellis And Turbo Coding完整版

laglbg

2004年，完整版，不用多说，经典的Turbo码书籍！
IEEE Press - Trellis And Turbo Coding.2004.pdf (2.72 MB, 下载次数: 778 )

2008-10-21 11:20 上传

点击文件名下载附件

li.hacker000

Preface xiii
1 Introduction 1
1.1 Modern Digital Communications 1
1.2 The Rise of Digital Communications 2
1.3 Communication Systems 3
1.4 Error Control Coding 5
1.5 Bandwidth, Power, and Complexity 10
1.6 A Brief History¡ªThe Drive Toward Capacity 18
Bibliography 20
2 Communication Theory Basics 25
2.1 The Probabilistic Viewpoint 25
2.2 Vector Communication Channels 26
2.3 Optimum Receivers 29
2.4 Matched Filters 31
2.5 Message Sequences 32
2.6 The Complex Equivalent Baseband Model 36
2.7 Spectral Behavior 40
2.8 Multiple Antenna Channels (MIMO Channels) 42
Appendix 2.A 47
Bibliography 49
3 Trellis-Coded Modulation 51
3.1 An Introductory Example 51
3.2 Group-Trellis Codes 55
3.3 The Mapping Function 57
3.4 Construction of Codes 60
3.5 Lattices 65
3.6 Lattice Formulation of Trellis Codes 71
3.7 Rotational Invariance 77
3.8 V.fast 83
3.9 Geometric Uniformity 85
3.10 Historical Notes 92
Bibliography 92
4 Convolutional Codes 95
4.1 Convolutional Codes as Binary Trellis Codes 95
4.2 Codes and Encoders 97
4.3 Fundamental Theorems from Basic Algebra 103
4.4 Systematic Encoders 113
4.5 Systematic Feedback and Recursive Systematic Encoder
Realizations 115
4.6 Maximum Free-Distance Convolutional Codes 117
Appendix 4.A 121
Bibliography 122
5 Link to Block Codes 125
5.1 Preliminaries 125
5.2 Block Code Primer 126
5.3 Trellis Description of Block Codes 127
5.4 Minimal Trellises 128
5.5 Minimum-Span Generator Matrices 133
5.6 Construction of the PC Trellis 136
5.7 Tail-Biting Trellises 138
5.8 The Squaring Construction and the Trellis of Lattices 141
5.9 The Construction of Reed¨CMuller Codes 147
5.10 A Decoding Example 149
Bibliography 152
6 Performance Bounds 155
6.1 Error Analysis 155
6.2 The Error Event Probability 155
6.3 Finite-State Machine Description of Error Events 160
6.4 The Transfer Function Bound 163
6.5 Reduction Theorems 166
6.6 Random Coding Bounds 170
Appendix 6.A 180
Appendix 6.B 180
Bibliography 181
7 Decoding Strategies 183
7.1 Background and Introduction 183
7.2 Tree Decoders 184
7.3 The Stack Algorithm 187
7.4 The Fano Algorithm 188
7.5 The M-Algorithm 190
7.6 Maximum Likelihood Decoding 200
7.7 A Posteriori Probability Symbol Decoding 203
7.8 Log-APP and Approximations 209
7.9 Random Coding Analysis of Sequential Decoding 213
7.10 Some Final Remarks 218
Appendix 7.A 219
Bibliography 223
8 Factor Graphs 227
8.1 Factor Graphs: Introduction and History 227
8.2 Graphical Function Representation 228
8.3 The Sum-Product Algorithm 231
8.4 Iterative Probability Propagation 232
8.5 The Factor Graph of Trellises 235
8.6 Exactness of the Sum-Product Algorithm for Trees 238
8.7 Binary Factor Graphs 242
Variable Node Messages 242
Parity-Check Node Messages 243
Log Likelihood Ratio (LLR) 243
LLR Variable Node Messages 243
LLR Check Node Messages 244
8.8 Normal Factor Graphs 245
Symbol Variable Replication 246
State Variable Replication 247
Bibliography 247
9 Low-Density Parity-Check Codes 251
9.1 Introduction 251
9.2 LDPC Codes and Graphs 252
9.3 Message Passing Decoding Algorithms 255
9.4 Density Evolution 259
9.5 Density Evolution for Binary Erasure Channels 260
9.6 Binary Symmetric Channels and the Gallager Algorithms 265
9.7 The AWGN Channel 269
9.8 LDPC Encoding 275
9.9 Encoding via Message-Passing 277
9.10 Repeat Accumulate Codes on Graphs 280
Bibliography 283
10 Parallel Concatenation (Turbo Codes) 285
10.1 Introduction 285
10.2 Parallel Concatenated Convolutional Codes 287
10.3 Distance Spectrum Analysis of Turbo Codes 290
10.4 The Free Distance of a Turbo Code 292
10.5 The Distance Spectrum of a Turbo Code 297
10.6 Weight Enumerator Analysis of Turbo Codes 300
10.7 Iterative Decoding of Turbo Codes 307
10.8 EXIT Analysis 310
10.9 Interleavers 317
10.10 Turbo Codes in Telecommunication Standards 320
10.10.1 The Space Data System Standard 320
10.10.2 3G Wireless Standards 322
10.10.3 Digital Video Broadcast Standards 323
10.11 Epilog 324
Bibliography 325
11 Serial Concatenation 329
11.1 Introduction 329
11.2 An Introductory Example 330
11.3 Weight Enumerator Analysis of SCCCs 331
11.3.1 Design Rule Examples 338
11.4 Iterative Decoding and Performance of SCCCs 341
11.4.1 Performance of SCCCs and PCCCs 343
11.5 EXIT Analysis of Serially Concatenated Codes 344
11.6 Conclusion 348
Bibliography 348
12 Turbo-Coded Modulation 351
12.1 Introduction 351
12.2 Turbo-Trellis-Coded Modulation (TTCM) 351
12.3 Serial Concatenation 355
12.4 EXIT Analysis 356
12.5 Differential-Coded Modulation 358
12.6 Concatenated Space-Time Coding 363
12.7 Product Codes and Block Turbo Decoding 368
12.8 Approximate APP Decoding 369
12.9 Product Codes with High-Order Modulations 372
12.10 The IEEE 802.16 Standard 374
Bibliography 375
Index 379

jumpyists

liuwei_0613

Schelgel原是Utah大学的教授，现在加拿大的Alberta的大学，是编码调制理论的专家，Alberta的无线通信技术在全球很有名。

sanmo

:victory:

dalewu

好帖
正要用呢

tonyang

多谢楼主，看看

eriks626

感谢了

pzcbupt

Trellis And Turbo Coding

wang69

thank you