Introduction to digital communication = 数字通信导论 / 2nd ed.

preface

1 introduction to digital data transmission

1.1 introduction

1.2 components of a digital communication system

1.2.1 general considerations

1.2.2 subsystems in a typical communication system

1.2.3 capacity of a communications link

1.3 communications channel modeling

1.3.1 introduction

1.3.2 specific examples of communication channels

1.3.2.1 propagation channels

1.3.2.2 land line

1.3.2.3 compact disc (cd) channels

1.3.3 approaches to communication channel modeling

1.3.3.1 discrete channel approach

1.3.3.2 waveform description

of communication channels

1.3.4 interference and distortion in communication

channels

1.3.5 external channel propagation considerations

.1.4 communication link power calculations

1.4.1 decibels in communication system

performance calculations

1.4.2 calculation of power levels in communication

systems; link budgets

1.5 driving forces in communications

1.6 computer use in communication system analysis and design

1.7 preview of the book

references

problems

2 signals, systems, modulation, and noise: overview

2.1 review of signal and linear system theory

2.1.1 introduction

2.1.2 classification of signals

2.1.3 fundamental properties of systems

2.1.4 complex exponentials as eigenfunctions

for a fixed, linear system; frequency

response function

2.1.5 orthogonal function series

2.1.6 complex exponential fourier series

2.1.7 the fourier transform

2.1.8 signal spectra

2.1.9 energy relationships

2.1.10 system analysis

2.2 basic analog modulation techniques

2.2.1 double-sideband modulation

2.2.2 the hilbert transform; single-sideband modulation

2.2.3 angle modulation

2.3 complex envelope representation of bandpass signals

and systems

2.3.1 bandpass signals

2.3.2 bandpass systems

2.4 signal distortion and filtering

2.4.1 distortionless transmission and ideal filters

2.4.2 group and phase delay

2.4.3 nonlinear systems and nonlinear distortion

2.5 practical filter types and characteristics

2.5.1 general terminology

2.5.2 butterworth filters (maximally flat)

2.5.3 chebyshev filters (equal ripple)

2.5.4 bessel (maximally flat delay) filters

2.6 sampling theory

2.6.1 the lowpass sampling theorem

2.6.2 nonideal effects in sampling

2.6.3 sampling of bandpass signals

2.6.4 oversampling and downsamplingto ease

filter requirements

2.6.5 pulse code modulation

2.6.6 differential pulse code modulation

2.7 random processes

2.7.1 mathematical description of random processes

2.7.2 input-output relationships for fixed linear systems

with random inputs; power spectral density

2.7.2.1 partial descriptions

2.7.2.2 output statistics of linear systems

2.7.2.3 the central and noncentral chi-square

distributions

2.7.3 examples of random processes

2.7.4 narrowband noise representation

2.7.5 distributions of envelopes of narrowband

gaussian processes

2.8 computer generation of random variables

2,8.1 introduction

2.8.2 generation of random variables having

a specific distribution

2.8.3 spectrum of a simulated white noise process

2.8.4 generation of pseudo-noise sequences

2.9 summary

references

problems

3 basic digital communication systems

3.1 introduction

3.2 the binary digital communications problem

3.2.1 binary signal detection in awgn

3.2.2 the matched filter

3.2.3 application of the matched filter to binary

data detection

3.2.3.1 general formula for pe

3.2.3.2 antipodal baseband signaling

3.2.3.3 baseband orthogonal signaling

3.2.3.4 baseband on-off signaling

3.2.4 correlator realization of matched filter receivers

3.3 signaling through bandlimited channels

3.3.1 system model

3.3.2 designing for zero isi: nyquist's pulse-shaping

criterion

3.3.3 optimum transmit and receive filters

3.3.4 shaped transmit signal spectra

3.3.5 duobinary signaling

3.4 equalization in digital data transmission

3.4.1 introduction

3.4.2 zero-forcing equalizers

3.4.3 minimum mean-square error equalization

3.4.4 adaptive weight adjustment

3.4.5 other equalizer

3.4.8 equalizer performance

3.5 a digital communication system simulation, example

3.6 noise effects in pulse code modulation

3.7 summary

references

problems

4 signal-space methods in digital data transmission

4.1 introduction

4.2 optimum receiver principals in terms of vector spaces

4.2.1 maximum a posteriori detectors

4.2.2 vector representation of signals

4.2.2.1 k-dimensional signal space

representation of the received waveform

4.2.2.2 scalar product

4.2.2.3 gram-schmidt procedure

4.2.2.4 schwarz's inequality

4.2.2.5 parseval's theorem

4.2.3 map detectors in terms of signal spaces

4.2.4 performance calculations for map receivers

4.3 performance analysis of coherent digital signaling schemes

4.3.1 coherent binary systems

4.3.2 coherent mary orthogonal signal schemes

4.3.3 m-ary phase-shift keying

4.3.4 quadrature-amplitude modulation

4.4 signaling schemes not requiring coherent references

at the receiver

4.4.1 noncoherent frequency-shift keying (nfsk)

4.4.2 differential phase-shift keying (dpsk)

4.5 comparison of digital modulation systems

4.5.1 bit error probabilities from symbol

error probabilities

4.5.2 bandwidth efficiencies of mary digital

communication systems

4.6 comparison of m-ary digital modulation schemes

on power and bandwidth-equivalent bases

4.6.1 coherent digital modulation schemes

4.6.2 noncoherent digital modulation schemes

4.7 some commonly used modulation schemes

4.7.1 quadrature-multiplexed signaling schemes

4.7.1.1 quadrature multiplexing

4.7.1.2 quadrature and offset-quadrature

phase-shift keying

4.7.3.1 minimum-shift keying

4.7.1.4 performance of digital quadrature

modulation systems

4.7.2 gausslan msk

4.7.3 /4-differential qpsk

4.7.4 power spectra for quadrature modulation schemes

4.8 design examples and system tradeoffs

4.9 multi-h continuous phase modulation

4.9.1 description of the multi-h cpm signal format

4.9.2 calculation of power spectra for multi-h cpm signals

4.9.3 synchronization considerations for multi-h

cpm signals

4.10 orthogonal frequency division multiplexing

4.10.1 introduction

4.10.2 the idea behind ofdm

4.10.3 mathematical description of dft-implemented

ofdm

4.10.4 effect of fading on ofdm detection

4.10.5 parameter choices and implementation issues

in ofdm

4.10.5.1 ofdm symbol rate for combating

delay spread

4.10.5.2 realizing diversity in ofdm

4,10.5.3 implementation issues

4.10.6 simulation of ofdm waveforms

4.11 summary

references

problems

5 channel degradations in digital communications

5.1 introduction

5.2 synchronization in communication systems

5.2.1 carrier synchronization

5.2.2 symbol synchronization

5.2.3 frame synchronization

5.3 the effects of slow signal fading in communication systems

5.3.1 performance of binary modulation schemes

in rayleigh fading channels

5.3.1.1 introduction

5.3.1.2 bit error probability performance

in slow rayleigh fading

5.3.1.3 the use of path diversity to improve

performance in fading

5.3.1.4 dpsk performance in moderately

5.3.2 performance of m-ary modulation schemes

in slow fading

5.3.2.1 introduction

5.3.2.2 m-ary psk and dpsk performance

in slow rayleigh fading

5.3.2.3 m-ary psk and dpsk performance

in slow ricean fading

5.3.2.4 m-ary qam performance in slow

rayleigh fading

5.3.2.5 m-ary noncoherent fsk performance

in slow ricean fading

5.3.3 m-ary psk and dpsk performance in slow fading

with diversity

5.3.3.1 rayleigh fading

5.3.3.2 ricean fading

5.4 diagnostic tools for communication system design

5.4.1 introduction

5.4.2 eye diagrams

5.4.3 envelope functions for digital modulation methods

5.4.4 phasor plots for digital modulation systems

5.5 summary

references

problems

6 fundamentals of information theory and block coding

6.1 introduction

6.2 basic concepts of information theory

6.2.1 source coding

6.2.2 lempei-ziv procedures

6.2.3 channel coding and capacity

6.2.3.1 general considerations

6.2.3.2 shannon's capacity formula

6.2.3.3 capacityof discrete memoryless channels

6.2.3.4 computational cutoff rate

6.3 fundamentals of block coding

6.3.1 basic concepts

6.3.3.1 definition of a block code

6.3.3.2 hamming distance and hamming weight

6.3.3.3 error vectors

6.3.3.4 optimum decoding rule

6.3.3.5 decoding regions and error probability

6.3.3.6 coding gain

6.3.3.7 summary

6.3.2 linear codes

6.3.2.1 modulo-2 vector arithmetic

6.3.2.2 binary linear vector spaces

6.3.2.3 linear block codes

6.3.2.4 systematic linear block codes

6.3.2.5 distance properties of linear block codes

6.3.2.6 decoding using the standard array

6.3.2.7 error probabilities for linear codes

6.3.3 cyclic codes

6.3.3.1 definition of cyclic codes

6.3.3.2 polynomial arithmetic

6.3.3.3 properties of cyclic codes

6.3.3.4 encoding of cyclic codes

6.3.3.5 decoding of cyclic codes

6.3.4 hamming codes

6.3.4.1 definition of hamming codes

6.3.4.2 encoding of hamming codes

6.3.4.3 decoding of hamming codes

6.3.4.4 performance of hamming cods

6.3.5 bch codes

6.3.5.1 definition and encoding for bch codes

6.3.5.2 decoding of bch codes

6.3.5.3 performance of bch codes

6.3.6 reed-solomon codes

6.3.6.1 definition of reed-solomon codes

6.3.6.2 decoding the reed-solomon codes

6.3.6.3 performance of the reed-solomon codes

6.3.7 the golay code

6.3.7.1 definition of the golay code

6.3.7.2 decoding the golay code

6.3.7.3 performance of the golay code

6.4 coding performance in slow fading channels

6.5 summary

references

problems

fundamentals of convolutional coding

7.1 introduction

7.2 basic concepts

7.2.1 definition of convolutional codes

7.2.2 decoding convolutional codes

7.2.3 potential coding gains for soft decisions

7.2.4 distance properties of convolutional codes

7.3 the viterbi algorithm

7.3.1 hard decision decoding

7.3.2 soft decision decoding

7.3.3 decoding error probability

7.3.4 bit error probability

7.4 good convolutional codes and their performance

7.5 other topics

7.5.1 sequential decoding

7.5.2 theshold decoding

7.5.3 concatenated reed-solomon/convolutional coding

7.5.4 punctured convolutional codes

7.5.5 trellis-coded modulation

7.5.6 turbo codes

7.5.7 applications

7.6 summary

references

problems

8 fundamentals of repeat request systems

8.1 introduction

8.2 general considerations

8.3 three arq strategies

8.3.1 stop-and-wait arq

8.3.1.1 general description

8.3.1.2 throughput calculation

8.3.2 go-back-n arq

8.3.2.1 general description

8.3.2.2 throughput calculation

8.3.3 selective repeat arq

8.3.3.1 general description

8.3,3.2 throughput calculation

8.4 codes for error detection

8.4.1 general considerations

8.4.2 hamming codes

8.4.3 bch codes

8.4.4 golay codes

8.5 summary

references

problems

9 spread-spectrum systems

9.1 introduction

9.2 two communication problems

9.2.1 pulse-noise jamming

9.2.2 low probability of detection

9.3 types of spread-spectrum systems

9.3.1 bpsk direct-sequence spread spectrum

9.3.2 qpsk direct-sequence spread spectrum

9.3.3 noncoherent slow-frequency-hop spread spectrum

9.3.4 noncoherent fast-frequency-hop spread

spectrum

9.3.5 hybrid direct-sequence/frequency-hop

spread spectrum

9.4 complex-envelope representation of spread-spectrum

systems

9.5 generation and properties of pseudorandom sequences

9.5.1 definitions and mathematical background

9.5.2 m-sequence generator configurations

9.5.3 properties of m-sequences

9.5.4 power spectrum of m-sequences

9.5.5 tables of polynomials yielding m-sequences

9.5.6 security of m-sequences

9.5.7 gold codes

9.5.8 kasami sequences (small set)

9.5.9 quaternary (four-phase) sequences

9.5.10 walsh codes

9.6 synchronization of spread-spectrum systems

9.7 performance of spread-spectrum systems

in jamming environments

9.7.1 introduction

9.7.2 types of jammers

9.7.3 combating smart jammers

9.7.4 error probabilities for barrage noise jammers

9.7.5 error probabilities for optimized partial band

or pulsed jammers

9.8 performance in multiple user environments

9.9 multiuser detection

9.10 examples of spread-spectrum systems

9.10.1 space shuttle spectrum despreader

9.10.2 global positioning system

9,11 summary

references

problems

10 introduction to cellular radio communications

10.1 introduction

10.2 frequency reuse

10.3 channel models

10.3.1 path loss and shadow fading models

10.3.1.1 free space path loss

10.3.1.2 flat earth path loss

10.3.1.3 okumura/hata path attenuation model

10.3.1.4 log-normal shadow fading

10.3.2 multipath channel models

10.3.2.1 rayleigh fading (unresolvable-multipath)

models

10.3.2.2 ricean (unresolvable) fading

10.3.2.3 summary

10.3.2.4 resolvable multipath components

10.3.2.5 a mathematical model for the wssus

channel

10.4 mitigation techniques for the multipath fading channel

10.4.1 introduction

10.4.2 space diversity

10.4.3 frequency diversity

10.4.4 time diversity

10.4.5 multipath diversity and rake receivers

10.5 system design and performance prediction

10.5.1 introduction

10.5.2 performance figures of merit

10.5.3 frequency reuse

10.5.4 cells are never hexagons

10.5.5 interference averaging

10.6 advanced mobile phone service

10.6.1 introduction

10.6.2 call setup and control

10.6.3 modulation and signaling formats

10.7 global system for mobile communications

10.7.1 introduction

10.7.2 system overview

10.7.3 modulation and signaling formats

10.7.4 summary and additional comments

10.8 code division multiple access

10.8.1 introduction

10.8.2 forward link description

10.8.3 reverse link description

10.8.4 capacity of cdma

10.8.5 additional comments

10.9 recommended further reading

10.9.1 cellular concepts and systems

10.9.2 channel modeling and propagation

10.9.3 concluding remarks

references

problems

11 satellite communications

11.1 introduction

11.1.1 a brief history of satellite communications

11.1.2 basic concepts and terminology

11.1.3 orbital relationships

11.1.4 antenna coverage

11.2 allocation of a satellite transmission resource

11.2.1 fdma

11.2.2 tdma

11.2.3 cdma

11.3 link power budget analysis

11.3.1 bent-pipe relay

11.3.2 demod/remod (regenerative) digital transponder

11.3.3 adjacent channel interference

11.3.4 adjacent satellite interference

11.3.5 power division in limiting repeaters

11.4 examples of link power budget calculations

11.5 low- and medium-earth orbit voice messaging

satellite systems

11.6 summary

references

problems

a probability and random variables

a.1 probability theory

a.1.1 definitions

a.1.2 axioms

a.1.3 joint, marginal, and conditional probabilities

a.2 random variables, probability density functions,

and averages

a.2.1 random variables

a.2.2 probability distribution and density functions

a.2.3 averages of random variables

a.3 characteristic function and probability generating function

a.3.1 characteristic function

a.3.2 probability generating function

a.4 transformations of random variables

a.4.1 general results

a.4.2 linear transformations of gaussian

random variables

a.5 central limit theorem

references

problems

b characterization of internally generated noise

references

problems

c attenuation of radio-wave propagation by atmospheric

gases and rain

d generation of coherent references

d.1 introduction

d.2 description of phase noise and its properties

d.2.1 general considerations

d.2.2 phase and frequency noise power spectra

d.2.3 allan variance

d.2.4 effect of frequency multipliers and dividers

on phase-noise spectra

d.3 phase-lock loop models and characteristics of operation

d.3.1 synchronized mode: linear operation

d.3.2 effects of noise

d.3.3 phase-locked-loop tracking of oscillators

with phase noise

d.3,4 phase jitter plus noise effects

d.3.5 transient response

d.3.6 phase-locked-loop acquisition

d.3.7 effects of transport delay

d.4 frequency synthesis

d.4.1 digital synthesizers

d.4.2 direct synthesis

d,4.2.1 configurations

d.4.2.2 spurious frequency component generation

in direct synthesizers

d.4.3 phase-locked frequency synthesizers

d.4.3.1 configurations

d.4.3.2 output phase noise

d.4.3.3 spur generation in indirect synthesizers

references

problems

e gausslan probability function

reference

f mathematical tables

f.1 the sinc function

f.2 trigonometric identities

f.3 indefinite integrals

f.4 definite integrals

f.5 series expansions

f.6 fourier transform theorems

f.7 fourier transform pairs

index