Das Digital Communication

Principles and System Modelling
1. Auflage 2010
ISBN: 978-3-642-12743-4
Verlag: Springer
Format: PDF
Kopierschutz: 1 - PDF Watermark

E-Book, Englisch, 246 Seiten

Reihe: Signals and Communication Technology

'Digital Communications' presents the theory and application of the philosophy of Digital Communication systems in a unique but lucid form. The book inserts equal importance to the theory and application aspect of the subject whereby the authors selected a wide class of problems.The Salient features of the book are:1. The foundation of Fourier series, Transform and wavelets are introduces in a unique way but in lucid language.2. The application area is rich and resemblance to the present trend of research, as we are attached with those areas professionally.3. Elegant exercise section is designed in such a way that, the readers can get the flavor of the subject and get attracted towards the future scopes of the subject.4. Unparallel tabular, flow chart based and pictorial methodology description will be there for sustained impression of the proposed design/algorithms in mind.

Autoren/Hrsg.

Das, Apurba

Inhaltsverzeichnis

1;Preface;6
1.1;Salient Features;7
2;Acknowledgements;9
3;Contents;10
4;Chapter1 Preview and Introduction;15
4.1;1.1 Process of Communication;15
4.2;1.2 General Definition of Signal;17
4.3;1.3 Time-Value Definition of SignalsAnalog and Digital;20
4.3.1;1.3.1 Continuous Time Continuous Valued Signal;21
4.3.2;1.3.2 Discrete Time Continuous Valued Signal;21
4.3.3;1.3.3 Discrete Time Discrete Valued Signal;21
4.4;1.4 Analog and Digital Communication Systems;22
4.5;1.5 Elements of Digital Communication System;24
4.6;1.6 MATLAB Programs;25
4.6.1;1.6.1 Time and Frequency Domain Representation of Signals;25
4.6.2;1.6.2 CTSV, DTCV, DTDV Signals;26
4.7;References;27
5;Chapter2 Waveform Encoding;28
5.1;2.1 Introduction;28
5.2;2.2 Pulse Code Modulation (PCM);28
5.2.1;2.2.1 Process of Sampling;29
5.2.1.1;2.2.1.1 Sampling Theorem;31
5.2.1.2;Case I;32
5.2.1.3;Case II;33
5.2.1.4;Case III;33
5.2.1.5;2.2.1.2 Aliasing;34
5.2.2;2.2.2 Process of Quantization;35
5.2.3;2.2.3 PCM Transmitter and Receiver;37
5.2.3.1;2.2.3.1 PCM Transmitter;37
5.2.3.2;2.2.3.2 PCM Receiver;39
5.2.4;2.2.4 Quantization Error;40
5.2.5;2.2.5 Signal to Noise Ratio (SNR) for Quantized Pulses;42
5.2.6;2.2.6 Non-uniform Quantization: Companding;43
5.2.6.1;2.2.6.1 -Law;45
5.2.6.2;2.2.6.2 A-Law;47
5.3;2.3 Differential Pulse Code Modulation (DPCM);48
5.3.1;2.3.1 Cumulative Error in PCM;48
5.3.2;2.3.2 Prevention of Cumulative Error by Applying Feedback;49
5.3.3;2.3.3 How We Can Predict the Future?;51
5.3.4;2.3.4 Analysis of DPCM;53
5.4;2.4 Delta Modulation;54
5.4.1;2.4.1 Drawbacks of Delta Modulation;56
5.4.1.1;2.4.1.1 Slope Overloading;56
5.4.1.2;2.4.1.2 Granular Noise;57
5.5;2.5 Adaptive Delta Modulation;57
5.5.1;2.5.1 Song Algorithm;57
5.5.2;2.5.2 Space-Shuttle Algorithm;59
5.6;2.6 Sigma-Delta Modulation (SDM);60
5.6.1;2.6.1 Noise Performance;61
5.7;2.7 Linear Predictive Coder (LPC);62
5.7.1;2.7.1 Concept;62
5.7.2;2.7.2 Genetic Algorithm Based Approach;63
5.8;2.8 MATLAB Programs;66
5.8.1;2.8.1 Aliasing;66
5.9;References;67
6;Chapter3 Digital Baseband Signal Receivers;68
6.1;3.1 Introduction;68
6.2;3.2 Integrate and Dump Type Filter;69
6.2.1;3.2.1 Noise Power and Variance;72
6.2.2;3.2.2 Figure of Merit;74
6.2.3;3.2.3 Probability of Error;74
6.3;3.3 The Optimum Filter;76
6.4;3.4 The Matched Filter;80
6.4.1;3.4.1 Impulse Response;80
6.4.2;3.4.2 Probability of Error;80
6.4.3;3.4.3 Properties of Matched Filter;83
6.5;3.5 The Correlator;85
6.6;3.6 Simulink Communication Block Set Example;87
6.6.1;Integrate and Dump;87
6.6.2;Library;87
6.6.3;Description;87
6.6.4;Dialog Box;87
6.6.5;Examples;88
6.7;References;88
7;Chapter4 Digital Baseband Signal Transmitter;89
7.1;4.1 Introduction;89
7.2;4.2 Elements of Digital Baseband Communication System;89
7.2.1;4.2.1 Formatting;90
7.2.2;4.2.2 Regenerative Repeater;90
7.3;4.3 Properties and Choice of Digital Formats;92
7.4;4.4 Line Coding;93
7.5;4.5 Power Spectrum Density of Different Digital Formats;95
7.5.1;4.5.1 Unipolar-NRZ;98
7.5.2;4.5.2 Unipolar-RZ;99
7.5.3;4.5.3 Polar-NRZ;100
7.5.4;4.5.4 Polar-RZ;101
7.5.5;4.5.5 Bipolar-NRZ;102
7.5.6;4.5.6 Split-Phase (Manchester);103
7.6;References;105
8;Chapter5 Equalization;106
8.1;5.1 Inter-Symbol Interference (ISI);106
8.2;5.2 Nyquist Criterion for Distortion Less Transmission (Zero ISI);108
8.2.1;5.2.1 Criteria in Frequency Domain;109
8.2.2;5.2.2 Concept of Ideal Nyquist Channel;111
8.2.3;5.2.3 Limitations of Ideal Solution: Raised Cosine Spectrum;112
8.3;5.3 Eye Pattern;114
8.3.1;5.3.1 Information Obtained from Eye Pattern;115
8.4;5.4 System Design for Known Channel;115
8.5;5.5 Linear Equalizer;117
8.5.1;5.5.1 Linear Transversal Filter;117
8.6;5.6 Adaptive Equalizer;119
8.7;References;121
9;Chapter6 Digital Modulation Techniques;122
9.1;6.1 Introduction;122
9.2;6.2 Amplitude Shift Keying (ASK);123
9.2.1;6.2.1 Mathematical Model;124
9.2.1.1;6.2.1.1 On-0Off Keying ( OOK);125
9.2.2;6.2.2 ASK Modulator;126
9.2.3;6.2.3 Binary ASK Demodulator;128
9.3;6.3 Frequency Shift Keying (FSK);129
9.3.1;6.3.1 Mathematical Model;129
9.3.2;6.3.2 BFSK Modulator;130
9.3.3;6.3.3 FSK Demodulator;132
9.4;6.4 Binary Phase Shift Keying (BPSK);133
9.4.1;6.4.1 Mathematical Model;134
9.4.2;6.4.2 BPSK Modulator;135
9.4.3;6.4.3 BPSK Demodulator;136
9.5;6.5 Differential Phase Shift Keying (DPSK);136
9.5.1;6.5.1 DPSK Modulator;136
9.5.2;6.5.2 DPSK Demodulator;138
9.6;6.6 Quadrature Phase Shift Keying (QPSK);138
9.6.1;6.6.1 Mathematical Model;138
9.6.2;6.6.2 QPSK Modulator;142
9.6.3;6.6.3 QPSK Demodulator;142
9.6.4;6.6.4 Offset QPSK (OQPSK);143
9.7;6.7 Minimum Shift Keying (MSK);145
9.8;6.8 Probability of Error for Different Modulation Schemes;147
9.8.1;6.8.1 Probability of Error in ASK;147
9.8.2;6.8.2 Probability of Error in FSK;148
9.8.3;6.8.3 Probability of Error in PSK;149
9.9;6.9 MATLAB Programs;150
9.9.1;6.9.1 QPSK Waveform;150
9.9.2;6.9.2 MSK Waveform;151
9.10;References;152
10;Chapter7 Spread Spectrum Modulation;153
10.1;7.1 Introduction;153
10.2;7.2 Processing Gain;154
10.3;7.3 Pseudo-Noise (PN) Sequence;155
10.3.1;7.3.1 Concept: A Hypothetical Experiment;155
10.3.2;7.3.2 Generation of PN Sequence;156
10.3.3;7.3.3 Properties of PN Sequence;157
10.4;7.4 Direct Sequence Spread Spectrum (DSSS);159
10.4.1;7.4.1 Concept;159
10.4.2;7.4.2 DSSS with Coherent BPSK;161
10.4.3;7.4.3 Probability of Error Calculation;162
10.5;7.5 Frequency-Hopped Spread Spectrum;165
10.5.1;7.5.1 Concept;165
10.5.2;7.5.2 FHSS with FSK;167
10.5.3;7.5.3 Rate of Hopping: Fast and Slow;169
10.6;7.6 Application of Spread Spectrum;169
10.6.1;7.6.1 GPS (Global Positioning System);169
10.7;7.7 CDMA (Code Division Multiple Access);173
10.7.1;7.7.1 Orthogonal Chip Sequence;173
10.7.2;7.7.2 Gold Sequence;175
10.7.3;7.7.3 Principle of Operation;176
10.7.3.1;7.7.3.1 MUX;176
10.7.3.2;7.7.3.2 DMUX;176
10.8;References;176
11;Chapter8 Information Theory;178
11.1;8.1 Introduction;178
11.2;8.2 Entropy;180
11.3;8.3 Rate of Information;182
11.4;8.4 Information Sources;182
11.5;8.5 Discrete Memoryless Channel (DMC);185
11.5.1;8.5.1 Channel Representation;185
11.5.2;8.5.2 The Channel Matrix;185
11.6;8.6 Special Channels;186
11.6.1;8.6.1 Lossless Channel;186
11.6.2;8.6.2 Deterministic Channel;187
11.6.3;8.6.3 Noise-Less Channel;188
11.6.4;8.6.4 Binary Symmetric Channel (BSC);188
11.6.4.1;8.6.4.1 Saturated or Stable Probability of Error for Cascaded BSC Channel;189
11.6.4.2;8.6.4.2 Probability Model of Erroneous Detection in Cascaded BSC;189
11.7;8.7 Mutual Information;191
11.8;8.8 Channel Capacity;192
11.8.1;8.8.1 Gaussian Channel: Shanon-Hartley Theorem;192
11.9;8.9 Entropy Coding;194
11.9.1;8.9.1 Shanon-Fano Coding;195
11.9.2;8.9.2 Huffman Coding;196
11.10;8.10 MATLAB Code;197
11.10.1;8.10.1 Convergence of Pe in Cascaded BSC;197
11.11;References;198
12;Chapter9 Error Control Coding;199
12.1;9.1 Introduction;199
12.2;9.2 Scope of Coding;200
12.3;Forward Error Correction;200
12.4;9.3 Linear Block Code;201
12.4.1;9.3.1 Coding Technique Using Generator Matrix;201
12.4.2;9.3.2 Syndrome Decoding;203
12.5;9.4 Convolutional Code;204
12.5.1;9.4.1 Encoder;204
12.5.1.1;9.4.1.1 Operation;205
12.5.1.2;9.4.1.2 Code Rate;207
12.5.2;9.4.2 State Diagram;207
12.5.3;9.4.3 Code Tree;208
12.5.4;9.4.4 Trellis Diagram;208
12.5.5;9.4.5 Decoding of Convolutional Code by Viterbi;210
12.5.5.1;9.4.5.1 Metric;210
12.5.5.2;9.4.5.2 Surviving Path;210
12.5.5.3;9.4.5.3 Principle of Decoding;210
12.6;9.5 Cyclic Code;212
12.6.1;9.5.1 Concept and Properties;212
12.6.2;9.5.2 Encoder and Decoder;214
12.6.3;9.5.3 Meggitt Decoder;215
12.7;9.6 BCH Code;215
12.7.1;9.6.1 Simplified BCH Codes;216
12.7.2;9.6.2 General BCH Codes;218
12.7.3;9.6.3 Properties;218
12.8;References;219
13;AppendixAElementary Probability Theory;220
13.1;A.1 Concept of Probability;220
13.1.1;A.1.1 Random Experiments and Sample Space;220
13.1.2;A.1.2 Events;221
13.1.3;A.1.3 Probability-Understanding Approaches;221
13.2;A.2 Random Variable;221
13.3;A.3 Mean, Variance, Skew-ness and Kurtosis;222
13.4;A.4 Cumulative Distribution Function (CDF);224
13.5;A.5 Probability Density Function (PDF);226
13.5.1;A.5.1 Uniform PDF;226
13.5.2;A.5.2 Frequently Used Probability Distribution;227
13.5.2.1;A.5.2.1. Bernoulli Distribution;227
13.5.2.2;A.5.2.2 Gaussian Distribution;228
13.5.2.3;A.5.2.3. Poisson Distribution;228
13.5.2.4;A.5.2.4 Rayleigh Distribution;228
13.6;References;231
14;Appendix BConvolution and Correlation – Some CaseStudies;232
14.1;B.1 Convolution;232
14.1.1;B.1.1 Basic Properties of Convolution;234
14.1.1.1;B.1.1.1 Commutative Law;234
14.1.1.2;B.1.1.2 Associative Law;235
14.1.1.3;B.1.1.3 Distributive Law;235
14.1.1.4;B.1.1.4 Transformed Domain Simplicity;236
14.1.2;B.1.2 Case 1: Periodicity of Sampled Spectra;237
14.1.3;B.1.3 Case 2: Transmission of Normally Distributed Information;238
14.1.4;B.1.4 Case 3: Long Multiplication Using Convolution;239
14.2;B.2 Correlation;239
14.2.1;B.2.1 Case Study: Pattern (Shape Feature) Matching Between Two Objects Using Cross-Correlation;241
14.3;References;243
15;AppendixC Frequently Used MATLAB Functions;244
15.1;plot();244
15.1.1;Description;244
15.2;imshow();244
15.2.1;Description;245
15.3;drawnow();245
15.3.1;Description;246
15.3.2;Remarks;246
15.3.3;Examples;246
15.4;stairs();246
15.5;int2str();246
15.5.1;Description;247
15.5.2;Examples;247
15.6;conv();247
15.7;ginput();248
15.7.1;Interactive Plotting;248
15.8;spline();248
15.8.1;Description;249
15.8.2;Exceptions;250
15.8.3;Example;250
15.9;Reference;251
16;Index;252