Bandwidth Efficient Coding / Edition 1

by John B. Anderson

Overview

This book addresses coding, a new solution to the major challenge of communicating more bits of information in the same radio spectrum.

• Explores concepts and new transmission methods that have arisen in the last 15 years
• Discusses the method of faster than Nyquist signaling
• Provides self-education resources by including design parameters and short MATLAB routines

Bandwidth Efficient Coding takes a fresh look at classical information theory and introduces a different point of view for research and development engineers and graduate students in communication engineering and wireless communication.

Product Details

ISBN-13:	9781119345336
Publisher:	Wiley
Publication date:	03/27/2017
Series:	IEEE Series on Digital & Mobile Communication
Pages:	208
Product dimensions:	6.30(w) x 9.30(h) x 0.90(d)

About the Author

JOHN B. ANDERSON is the Ericsson Chair in Digital Communication at Lund University in Sweden. He received his Ph.D. in electrical engineering from Cornell University in 1972. His research work is in coding and communication algorithms, bandwidth-efficient coding, and data compression. Dr. Anderson served as President and Vice President of the IEEE Information Theory Society, and in 1983 and 2006 was Co-Chair of the IEEE International Symposium on Information Theory. He served on the Publications Board of IEEE on three occasions, and was Editor-in-Chief of IEEE Press during 1994-96 and 2012-13. He won the Humboldt Research Prize in 1991. Dr. Anderson is the author of two other Wiley-IEEE Press titles: Understanding Information Transmission (2005) and Digital Transmission Engineering, Second Edition (2005).

Read an Excerpt

Click to read or download

Table of Contents

Preface ix

1 Introduction 1

1.1 Electrical Communication 2

1.2 Modulation 4

1.3 Time and Bandwidth 9

1.4 Coding Versus Modulation 13

1.5 A Tour of the Book 14

1.6 Conclusions 15

References 16

2 Communication Theory Foundation 17

2.1 Signal Space 18

2.2 Optimal Detection 24

2.2.1 Orthogonal Modulator Detection 24

2.2.2 Trellis Detection 29

2.3 Pulse Aliasing 35

2.4 Signal Phases and Channel Models 37

2.5 Error Events 43

2.5.1 Error Events and d_min 43

2.5.2 Error Fourier Spectra 48

2.6 Conclusions 50

Appendix 2A Calculating Minimum Distance 50

References 56

3 Gaussian Channel Capacity

3.1 Classical Channel Capacity 59

3.2 Capacity for an Error Rate and Spectrum 64

3.3 Linear Modulation Capacity 68

3.4 Conclusions 72

Appendix 3A Calculating Shannon Limits 73

References 77

4 Faster than Nyquist Signaling

4.1 Classical FTN 80

4.1.1 Origins of FTN 80

4.1.2 Definition of FTN Signaling 81

4.1.3 Discrete-Time Models 86

4.2 Reduced ISLBCJR Algorithms 87

4.2.1 Reduced Trellis Methods: The Tail Offset BCJR 89

4.2.2 Reduced-Search Methods: The M-BCJR 93

4.2.3 The ISI Characteristic 99

4.3 Good Convolutional Codes 101

4.3.1 Binary CC Slope Analysis 102

4.3.2 Good Binary Modulation Codes 105

4.3.3 Good Convolutionol Codes for 4-ary Modulation 107

4.4 Iterative Decoding Results 110

4.5 Conclusions 114

Appendix 4A Super Minimum-Phase FTN Models 115

Appendix 4B Good Convolutional Codes for FTN Signaling 116

References 124

5 Multicarrier FTN 127

5.1 Classical Multicarrier FTN 128

5.2 Distances 134

5.2.1 Finding Distances 134

5.2.2 Minimum Distances and the Mazo Limit 136

5.3 Alternative Methods and Implementations 138

5.4 Conclusions 143

References 143

6 Coded Modulation Performance 145

6.1 Set-Partition Coding 146

6.1.1 Set-Partition Basics 146

6.1.2 Shannon Limit and Coding Performance 150

6.2 Continuous Phase Modulation 153

6.2.1 CPM Basics 153

6.2.2 Bits per Hz-s and the Shannon Limit in CPM. 157

6.2.3 Error Performance of CPM 158

6.3 Conclusions for Coded Modulation; Highlights 161

References 161

7 Optimal Modulation Pulses 163

7.1 Slepian's Problem 164

7.1.1 PSWF Pulse Solution 165

7.1.2 Gauss and Gauss-Like Pulses 169

7.1.3 Occupancy of Linear Modulation with FTN 172

7.1.4 PSWF and Gauss Linear Modulation with FTN 175

7.2 Said's Optimum Distance Pulses 177

7.2.1 Linear Programming Solution 178

7.2.2 Optimal Modulation Tap Sets 180

7.2.3 Coded and Uncoded Error Performance 182

7.3 Conclusions 185

Appendix 7A Calculating the PSWF 185

Appendix 7B Optimum Distance Tap Sets 188

References 188

Index 190