目录
1Signals and Spectra
1.1Digital Communication Signal
Processing
1.1.1Why Digital
1.1.2Typical Block Diagram and Transformations
1.1.3Basic Digital Communication
Nomenclature
1.1.4Digital Versus Analog Performance
Criteria
1.2Classification of Signals
1.2.1Deterministic and Random
Signals
1.2.2Periodic and Nonperiodic Signals
1.2.3Analog and Discrete Signals
1.2.4Energy and Power Signals
1.2.5The Unit Impulse Function
1.3Spectral Density
1.3.1Energy Spectral Density
1.3.2Power Spectral Density
1.4Autocorrelation
1.4.1Autocorrelation of an Energy
Signal
1.4.2Autocorrelation of a Periodic(Power) Signal
1.5Random Signals
1.5.1Random Variables
1.5.2Random Processes
1.5.3Time Averaging and Ergodicity
1.5.4Power Spectral Density and Autocorrelation of a Random Process
1.5.5Noise in Communication
Systems
1.6Signal Transmission Through Linear
Systems
1.6.1Impulse Response
1.6.2Frequency Transfer Function
1.6.3Distortionless Transmission
1.6.4Signals, Circuits,and Spectra
1.7Bandwidth of Digital Data
1.7.1Baseband Versus Bandpass
1.7.2The Bandwidth Dilemma
1.8Conclusion
References
Problems
Questions
2Formatting and Baseband Modulation
2.1Baseband Systems
2.2Formatting Textual Data(Character
Coding)
2.3Messages, Characters,and Symbols
2.3.1Example of Messages,Characters,
and Symbols
2.4Formatting Analog Information
2.4.1The Sampling Theorem
2.4.2Aliasing
2.4.3Why Oversample
2.4.4Signal Interface for a Digital
System
2.5Sources of Corruption
2.5.1Sampling and Quantizing Effects
2.5.2Channel Effects
2.5.3SignaltoNoise Ratio for Quantized
Pulses
2.6Pulse Code Modulation
2.7Uniform and Nonuniform
Quantization
2.7.1Statistics of Speech Amplitudes
2.7.2Nonuniform Quantization
2.7.3Companding Characteristics
2.8Baseband Transmission
2.8.1Waveform Representation of
Binary Digits
2.8.2PCM Waveform Types
2.8.3Spectral Attributes of PCM
Waveforms
2.8.4Bits per PCM Word and Bits
per Symbol
2.8.5Mary PulseModulation
Waveforms
2.9Correlative Coding
2.9.1Duobinary Signaling
2.9.2Duobinary Decoding
2.9.3Precoding
2.9.4Duobinary Equivalent Transfer
Function
2.9.5Comparison of Binary and Duobinary Signaling
2.9.6Polybinary Signaling
2.10Conclusion
References
Problems
Questions
3Baseband Demodulation/Detection
3.1Signals and Noise
3.1.1ErrorPerformance Degradation in Communication Systems
3.1.2Demodulation and Detection
3.1.3A Vectorial View of Signals and
Noise
3.1.4The Basic SNR Parameter for Digital Communication Systems
3.1.5Why Eb/N0 is a Natural Figure
of Merit
3.2Detection of Binary Signals in Gaussian
Noise
3.2.1Maximum Likelihood Receiver
Structure
3.2.2The Matched Filter
3.2.3Correlation Realization of the
Matched Filter
3.2.4Optimizing Error Performance
3.2.5Error Probability Performance of
Binary Signaling
3.3Intersymbol Interference
3.3.1Pulse Shaping to Reduce ISI
3.3.2Two Types of ErrorPerformance Degradation
3.3.3Demodulation/Detection of Shaped
Pulses
3.4Equalization
3.4.1Channel Characterization
3.4.2Eye Pattern
3.4.3Equalizer Filter Types
3.4.4Preset and Adaptive
Equalization
3.4.5Filter Update Rate
3.5Conclusion
References
Problems
Questions
4Bandpass Modulation and Demodulation/Detection
4.1Why Modulate
4.2Digital Bandpass Modulation
Techniques
4.2.1Phasor Representation of a
Sinusoid
4.2.2PhaseShift Keying
4.2.3FrequencyShift Keying
4.2.4Amplitude Shift Keying
4.2.5AmplitudePhase Keying
4.2.6Waveform Amplitude Coefficient
4.3Detection of Signals in Gaussian
Noise
4.3.1Decision Regions
4.3.2Correlation Receiver
4.4Coherent Detection
4.4.1Coherent Detection of PSK
4.4.2Sampled Matched Filter
4.4.3Coherent Detection of Multiple
PhaseShift Keying
4.4.4Coherent Detection of FSK
4.5Noncoherent Detection
4.5.1Detection of Differential PSK
4.5.2Binary Differential PSK
Example
4.5.3Noncoherent Detection of FSK
4.5.4Required Tone Spacing for Noncoherent Orthogonal FSK Signaling
4.6Complex Envelope
4.6.1Quadrature Implementation of a
Modulator
4.6.2D8PSK Modulator Example
4.6.3D8PSK Demodulator Example
4.7Error Performance for Binary
Systems
4.7.1Probability of Bit Error for
Coherently Detected BPSK
4.7.2Probability of Bit Error for Coherently
Detected,Differentially Encoded
Binary PSK
4.7.3Probability of Bit Error for Coherently
Detected Binary Orthogonal FSK
4.7.4Probability of Bit Error for Noncoherently Detected Binary Orthogonal FSK
4.7.5Probability of Bit Error for
Binary DPSK
4.7.6Comparison of BitError Performance
for Various Modulation Types
4.8Mary Signaling and Performance
4.8.1Ideal Probability of BitError
Performance
4.8.2Mary Signaling
4.8.3Vectorial View of MPSK
Signaling
4.8.4BPSK and QPSK Have the Same
BitError Probability
4.8.5Vectorial View of MFSK
Signaling
4.9Symbol Error Performance for Mary
Systems(M>2)
4.9.1Probability of Symbol Error for
MPSK
4.9.2Probability of Symbol Error for
MFSK
4.9.3BitError Probability Versus Symbol Error Probability for Orthogonal
Signals
4.9.4BitError Probability Versus Symbol Error Probability for MultiplePhase Signaling
4.9.5Effects of Intersymbol
Interference
4.10Conclusion
References
Problems
Questions
5Communications Link Analysis
5.1What the System Link Budget Tells the System Engineer
5.2The Channel
5.2.1The Concept of Free Space
5.2.2ErrorPerformance Degradation
5.2.3Sources of Signal Loss and
Noise
5.3Received Signal Power and Noise
Power
5.3.1The Range Equation
5.3.2Received Signal Power as a
Function of Frequency
5.3.3Path Loss is Frequency Dependent
5.3.4Thermal Noise Power
5.4Link Budget Analysis
5.4.1Two Eb/N0 Values of Interest
5.4.2Link Budgets are Typically
Calculated in Decibels
5.4.3How Much Link Margin is
Enough
5.4.4Link Availability
5.5Noise Figure,Noise Temperature,and System Temperature
5.5.1Noise Figure
5.5.2Noise Temperature
5.5.3Line Loss
5.5.4Composite Noise Figure and
Composite Noise Temperature
5.5.5System Effective Temperature
5.5.6Sky Noise Temperature
5.6Sample Link Analysis
5.6.1Link Budget Details
5.6.2Receiver Figure of Merit
5.6.3Received Isotropic Power
5.7Satellite Repeaters
5.7.1Nonregenerative Repeaters
5.7.2Nonlinear Repeater Amplifiers
5.8System TradeOffs
5.9Conclusion
References
Problems
Questions
6Channel Coding: Part 1: Waveform Codes and Block Codes
6.1Waveform Coding and Structured
Sequences
6.1.1Antipodal and Orthogonal
Signals
6.1.2Mary Signaling
6.1.3Waveform Coding
6.1.4WaveformCoding System
Example
6.2Types of Error Control
6.2.1Terminal Connectivity
6.2.2Automatic Repeat Request
6.3Structured Sequences
6.3.1Channel Models
6.3.2Code Rate and Redundancy
6.3.3ParityCheck Codes
6.3.4Why Use ErrorCorrection Coding
6.4Linear Block Codes
6.4.1Vector Spaces
6.4.2Vector Subspaces
6.4.3A(6,3) Linear Block Code
Example
6.4.4Generator Matrix
6.4.5Systematic Linear Block Codes
6.4.6ParityCheck Matrix
6.4.7Syndrome Testing
6.4.8Error Correction
6.4.9Decoder Implementation
6.5ErrorDetecting and ErrorCorrecting Capability
6.5.1Weight and Distance of Binary
Vectors
6.5.2Minimum Distance of a Linear
Code
6.5.3Error Detection and Correction
6.5.4Visualization of a 6Tuple Space
6.5.5Erasure Correction
6.6Usefulness of the Standard Array
6.6.1Estimating Code Capability
6.6.2An (n,k) Example
6.6.3Designing the (8,2) Code
6.6.4Error Detection Versus Error
Correction TradeOffs
6.6.5The Standard Array Provides
Insight
6.7Cyclic Codes
6.7.1Algebraic Structure of Cyclic Codes
6.7.2Binary Cyclic Code Properties
6.7.3Encoding in Systematic Form
6.7.4Circuit for Dividing Polynomials
6.7.5Systematic Encoding with an (n-k)
Stage Shift Register
6.7.6Error Detection with an (n-k)
Stage Shift Register
6.8WellKnown Block Codes
6.8.1Hamming Codes
6.8.2Extended Golay Code
6.8.3BCH Codes
6.9Conclusion
References
Problems
Questions
7Channel Coding: Part 2: Convolutional
Codes and ReedSolomon Codes
7.1Convolutional Encoding
7.2Convolutional Encoder Representation
7.2.1Connection Representation
7.2.2State Representation and the
State Diagram
7.2.3The Tree Diagram
7.2.4The Trellis Diagram
7.3Formulation of the Convolutional
Decoding Problem
7.3.1Maximum Likelihood Decoding
7.3.2Channel Models: Hard Versus
Soft Decisions
7.3.3The Viterbi Convolutional
Decoding Algorithm
7.3.4An Example of Viterbi
Convolutional Decoding
7.3.5Decoder Implementation
7.3.6Path Memory and
Synchronization
7.4Properties of Convolutional Codes
7.4.1Distance Properties of
Convolutional Codes
7.4.2Systematic and Nonsystematic Convolutional Codes
7.4.3Catastrophic Error Propagation in Convolutional Codes
7.4.4Performance Bounds for
Convolutional Codes
7.4.5Coding Gain
7.4.6BestKnown Convolutional Codes
7.4.7Convolutional Code Rate
TradeOff
7.4.8SoftDecision Viterbi Decoding
7.5Other Convolutional Decoding
Algorithms
7.5.1Sequential Decoding
7.5.2Comparisons and Limitations of
Viterbi and Sequential Decoding
7.5.3Feedback Decoding
7.6ReedSolomon Codes
7.6.1ReedSolomon Error Probability
7.6.2Why RS Codes Perform Well
Against Burst Noise
7.6.3RS Performance as a Function of
Size,Redundancy,and Code Rate
7.6.4Finite Fields
7.6.5ReedSolomon Encoding
7.6.6ReedSolomon Decoding
7.7Interleaving and Concatenated Codes
7.7.1Block Interleaving
7.7.2Convolutional Interleaving
7.7.3Concatenated Codes
7.8Coding and Interleaving Applied to the Compact Disc Digital Audio System
7.8.1CIRC Encoding
7.8.2CIRC Decoding
7.8.3Interpolation and Muting
7.9Conclusion
References
Problems
Questions
8Channel Coding: Part 3:Turbo Codes and
LowDensity Parity Check(LDPC) Codes
8.1Turbo Codes
8.1.1Turbo Code Concepts
8.1.2LogLikelihood Algebra
8.1.3Product Code Example
8.1.4Encoding with Recursive
Systematic Codes
8.1.5A Feedback Decoder
8.1.6The MAP Algorithm
8.1.7MAP Decoding Example
8.2LowDensity Parity Check(LDPC)
Codes
8.2.1Background and Overview
8.2.2The ParityCheck Matrix
8.2.3Finding the BestPerforming
Codes
8.2.4Decoding: An Overview
8.2.5Mathematical Foundations
8.2.6Decoding in the Probability Domain
8.2.7Decoding in the Logarithmic Domain
8.2.8ReducedComplexity Decoders
8.2.9LDPC Performance
8.2.10Conclusion
References
Problems
Questions
9Modulation and Coding TradeOffs
9.1Goals of the Communication System
Designer
9.2ErrorProbability Plane
9.3Nyquist Minimum Bandwidth
9.4ShannonHartley Capacity Theorem
9.4.1Shannon Limit
9.4.2Entropy
9.4.3Equivocation and Effective
Transmission Rate
9.5BandwidthEfficiency Plane
9.5.1Bandwidth Efficiency of MPSK and MFSK Modulation
9.5.2Analogies Between the BandwidthEfficiency and ErrorProbability
Planes
9.6Modulation and Coding TradeOffs
9.7Defining, Designing,and Evaluating
Digital Communication Systems
9.7.1Mary Signaling
9.7.2BandwidthLimited Systems
9.7.3PowerLimited Systems
9.7.4Requirements for MPSK and MFSK Signaling
9.7.5BandwidthLimited Uncoded System Example
9.7.6PowerLimited Uncoded System
Example
9.7.7BandwidthLimited and Power
Limited Coded System Example
9.8BandwidthEfficient Modulation
9.8.1QPSK and Offset QPSK Signaling
9.8.2MinimumShift Keying
9.8.3Quadrature Amplitude Modulation
9.9TrellisCoded Modulation
9.9.1The Idea Behind TrellisCoded
Modulation
9.9.2TCM Encoding
9.9.3TCM Decoding
9.9.4Other Trellis Codes
9.9.5TrellisCoded Modulation
Example
9.9.6Multidimensional TrellisCoded
Modulation
9.10Conclusion
References
Problems
Questions
10Synchronization
10.1Receiver Synchronization
10.1.1Why We Must Synchronize
10.1.2Alignment at the Waveform
Level and Bit Stream Level
10.1.3CarrierWave Modulation
10.1.4Carrier Synchronization
10.1.5Symbol Synchronization
10.1.6Eye Diagrams and Constellations
10.2Synchronous Demodulation
10.2.1Minimizing Energy in the
Difference Signal
10.2.2Finding the Peak of the Correlation Function
10.2.3The Basic Analog PhaseLocked
Loop(PLL)
10.2.4PhaseLocking Remote Oscillators
10.2.5Estimating Phase Slope(Frequency)
10.3Loop Filters,Control Circuits,and
Acquisition
10.3.1How Many Loop Filters are
There in a System
10.3.2The Key Loop Filters
10.3.3Why We Want R Times Rdot
10.3.4The Phase Error SCurve
10.4PhaseLocked Loop Timing Recovery
10.4.1Recovering Carrier Timing from a Modulated Waveform
10.4.2Classical Timing Recovery
Architectures
10.4.3TimingError Detection: Insight
from the Correlation Function
10.4.4MaximumLikelihood TimingError Detection
10.4.5Polyphase Matched Filter and
Derivative Matched Filter
10.4.6Approximate ML Timing Recovery
PLL for a 32Path PLL
10.5Frequency Recovery Using a
FrequencyLocked Loop(FLL)
10.5.1BandEdge Filters
10.5.2BandEdge Filter NonDataAided Timing Synchronization
10.6Effects of Phase and Frequency
Offsets
10.6.1Phase Offset and No Spinning:
Effect on Constellation
10.6.2Slow Spinning Effect on
Constellation
10.6.3Fast Spinning Effect on
Constellation
10.7Conclusion
References
Problems
Questions
11Multiplexing and Multiple Access
11.1Allocation of the Communications
Resource
11.1.1FrequencyDivision Multiplexing/Multiple Access
11.1.2TimeDivision Multiplexing/
Multiple Access
11.1.3Communications Resource
Channelization
11.1.4Performance Comparison of
FDMA and TDMA
11.1.5CodeDivision Multiple Access
11.1.6SpaceDivision and Polarization
Division Multiple Access
11.2MultipleAccess Communications
System and Architecture
11.2.1MultipleAccess Information Flow
11.2.2DemandAssignment Multiple
Access
11.3Access Algorithms
11.3.1ALOHA
11.3.2Slotted ALOHA
11.3.3Reservation ALOHA
11.3.4Performance Comparison of
SALOHA and RALOHA
11.3.5Polling Techniques
11.4MultipleAccess Techniques Employed
with INTELSAT
11.4.1Preassigned FDM/FM/FDMA or
MCPC Operation
11.4.2MCPC Modes of Accessing an INTELSAT Satellite
11.4.3SPADE Operation
11.4.4TDMA in INTELSAT
11.4.5SatelliteSwitched TDMA in
INTELSAT
11.5MultipleAccess Techniques for
Local Area Networks
11.5.1CarrierSense MultipleAccess
Networks
11.5.2TokenRing Networks
11.5.3Performance Comparison of CSMA/CD
and TokenRing Networks
11.6Conclusion
References
Problems
Questions
12SpreadSpectrum Techniques
12.1SpreadSpectrum Overview
12.1.1The Beneficial Attributes of
SpreadSpectrum Systems
12.1.2A Catalog of Spreading Techniques
12.1.3Model for DirectSequence Spread
Spectrum Interference Rejection
12.1.4Historical Background
12.2Pseudonoise Sequences
12.2.1Randomness Properties
12.2.2Shift Register Sequences
12.2.3PN Autocorrelation Function
12.3DirectSequence SpreadSpectrum
Systems
12.3.1Example of Direct Sequencing
12.3.2Processing Gain and Performance
12.4FrequencyHopping Systems
12.4.1FrequencyHopping Example
12.4.2Robustness
12.4.3Frequency Hopping with Diversity
12.4.4Fast Hopping Versus Slow Hopping
12.4.5FFH/MFSK Demodulator
12.4.6Processing Gain
12.5Synchronization
12.5.1Acquisition
12.5.2Tracking
12.6Jamming Considerations
12.6.1The Jamming Game
12.6.2Broadband Noise Jamming
12.6.3PartialBand Noise Jamming
12.6.4MultipleTone Jamming
12.6.5Pulse Jamming
12.6.6RepeatBack Jamming
12.6.7BLADES System
12.7Commercial Applications
12.7.1CodeDivision Multiple Access
12.7.2Multipath Channels
12.7.3The FCC Part 15 Rules for
SpreadSpectrum Systems
12.7.4Direct Sequence Versus Frequency Hopping
12.8Cellular Systems
12.8.1DirectSequence CDMA
12.8.2Analog FM Versus TDMA
Versus CDMA
12.8.3InterferenceLimited Versus
DimensionLimited Systems
12.8.4IS95 CDMA Digital Cellular
System
12.9Conclusion
References
Problems
Questions
13Source Coding
13.1Sources
13.1.1Discrete Sources
13.1.2Waveform Sources
13.2Amplitude Quantizing
13.2.1Quantizing Noise
13.2.2Uniform Quantizing
13.2.3Saturation
13.2.4Dithering
13.2.5Nonuniform Quantizing
13.3Pulse Code Modulation
13.3.1Differential Pulse Code Modulation
13.3.2OneTap Prediction
13.3.3NTap Prediction
13.3.4Delta Modulation
13.3.5ΣΔ Modulation
13.3.6ΣΔ AtoD Converter(ADC)
13.3.7ΣΔ DtoA Converter(DAC)
13.4Adaptive Prediction
13.4.1Forward Adaptation
13.4.2Synthesis/Analysis Coding
13.5Block Coding
13.5.1Vector Quantizing
13.6Transform Coding
13.6.1Quantization for Transform
Coding
13.6.2Subband Coding
13.7Source Coding for Digital Data
13.7.1Properties of Codes
13.7.2Huffman Code
13.7.3RunLength Codes
13.8Examples of Source Coding
13.8.1Audio Compression
13.8.2Image Compression
13.9Conclusion
References
Problems
Questions
14Fading Channels
14.1The Challenge of Communicating over Fading Channels
14.2Characterizing MobileRadio
Propagation
14.2.1LargeScale Fading
14.2.2SmallScale Fading
14.3Signal Time Spreading
14.3.1Signal Time Spreading Viewed in
the TimeDelay Domain
14.3.2Signal Time Spreading Viewed in
the Frequency Domain
14.3.3Examples of Flat Fading and FrequencySelective Fading
14.4Time Variance of the Channel
Caused by Motion
14.4.1Time Variance Viewed in the
Time Domain
14.4.2Time Variance Viewed in the
DopplerShift Domain
14.4.3Performance over a Slow and
FlatFading Rayleigh Channel
14.5Mitigating the Degradation Effects
of Fading
14.5.1Mitigation to Combat FrequencySelective Distortion
14.5.2Mitigation to Combat FastFading Distortion
14.5.3Mitigation to Combat Loss in
SNR
14.5.4Diversity Techniques
14.5.5Modulation Types for Fading
Channels
14.5.6The Role of an Interleaver
14.6Summary of the Key Parameters Characterizing Fading Channels
14.6.1FastFading Distortion: Case 1
14.6.2FrequencySelective Fading
Distortion: Case 2
14.6.3FastFading and FrequencySelective Fading Distortion: Case 3
14.7Applications: Mitigating the Effects of FrequencySelective Fading
14.7.1The Viterbi Equalizer as Applied
to GSM
14.7.2The Rake Receiver Applied to DirectSequence SpreadSpectrum(DS/SS) Systems
14.8Conclusion
References
Problems
Questions
15The ABCs of OFDM(Orthogonal FrequencyDivision Multiplexing)
15.1What is OFDM
15.2Why OFDM
15.3Getting Started with OFDM
15.4Our Wish List(Preference for Flat
Fading and Slow Fading)
15.4.1OFDMs Most Important Contribution
to Communications over Multipath
Channels
15.5Conventional MultiChannel FDM
Versus MultiChannel OFDM
15.6The History of the Cyclic Prefix(CP)
15.6.1Examining the Lengthened
Symbol in OFDM
15.6.2The Length of the CP
15.7OFDM System Block Diagram
15.8Zooming in on the IDFT
15.9An Example of OFDM Waveform
Synthesis
15.10Summarizing OFDM Waveform
Synthesis
15.11Data Constellation Points Distributed
over the Subcarrier Indexes
15.11.1Signal Processing in the OFDM
Receiver
15.11.2OFDM SymbolTime Duration
15.11.3Why DC is Not Used as a
Subcarrier in Real Systems
15.12Hermitian Symmetry
15.13How Many Subcarriers are Needed
15.14The Importance of the Cyclic
Prefix(CP) in OFDM
15.14.1Properties of Continuous and
Discrete Fourier Transforms
15.14.2Reconstructing the OFDM
Subcarriers
15.14.3A Property of the Discrete Fourier Transform(DFT)
15.14.4Using Circular Convolution for Reconstructing an OFDM Subcarrier
15.14.5The Trick That Makes Linear Convolution Appear Circular
15.15An Early OFDM Application: WiFi Standard 802.11a
15.15.1Why the Transform Size N Needs
to Be Larger Than the Number of Subcarriers
15.16Cyclic Prefix(CP) and Tone
Spacing
15.17LongTerm Evolution(LTE) Use
of OFDM
15.17.1LTE Resources: Grid,Block,and Element
15.17.2OFDM Frame in LTE
15.18Drawbacks of OFDM
15.18.1Sensitivity to Doppler
15.18.2PeaktoAverage Power Ratio
(PAPR) and SCOFDM
15.18.3Motivation for Reducing
PAPR
15.19SingleCarrier OFDM(SCOFDM) for
Improved PAPR Over Standard OFDM
15.19.1SCOFDM Signals Have Short Mainlobe Durations
15.19.2Is There an Easier Way to
Implement SCOFDM
15.20Conclusion
References
Problems
Questions
16The Magic of MIMO(Multiple Input/
Multiple Output)
16.1What is MIMO
16.1.1MIMO Historical Perspective
16.1.2Vectors and Phasors
16.1.3MIMO Channel Model
16.2Various Benefits of Multiple
Antennas
16.2.1Array Gain
16.2.2Diversity Gain
16.2.3SIMO Receive Diversity
Example
16.2.4MISO Transmit Diversity
Example
16.2.5TwoTime Interval MISO
Diversity Example
16.2.6Coding Gain
16.2.7Visualization of Array Gain,Diversity
Gain,and Coding Gain
16.3Spatial Multiplexing
16.3.1Basic Idea of MIMOSpatial Multiplexing(MIMOSM)
16.3.2Analogy Between MIMOSM
and CDMA
16.3.3When Only the Receiver Has Channel
State Information(CSI)
16.3.4Impact of the Channel Model
16.3.5MIMO and OFDM Form a Natural Coupling
16.4Capacity Performance
16.4.1Deterministic Channel
Modeling
16.4.2Random Channel Models
16.5Transmitter ChannelState
Information(CSI)
16.5.1Optimum Power Distribution
16.6SpaceTime Coding
16.6.1Block Codes in MIMO Systems
16.6.2Trellis Codes in MIMO Systems
16.7MIMO TradeOffs
16.7.1Fundamental TradeOff
16.7.2TradeOff Yielding Greater
Robustness for PAM and QAM
16.7.3TradeOff Yielding Greater
Capacity for PAM and QAM
16.7.4Tools for Trading Off Multiplexing Gain and Diversity Gain
16.8MultiUser MIMO(MUMIMO)
16.8.1What is MUMIMO
16.8.2SUMIMO and MUMIMO
Notation
16.8.3A Real Shift in MIMO
Thinking
16.8.4MUMIMO Capacity
16.8.5SumRate Capacity Comparison for Various Precoding Strategies
16.8.6MUMIMO Versus SUMIMO Performance
16.9Conclusion
References
Problems
Questions
The Following Elements Will be Online Only
17Encryption and Decryption
Appendix AA Review of Fourier Techniques
Appendix BFundamentals of Statistical Decision Theory
Appendix CResponse of a Correlator to White Noise
Appendix DOftenUsed Identities
Appendix EsDomain, zDomain,and Digital Filtering
Appendix FOFDM Symbol Formation with an NPoint Inverse Discrete Fourier Transform (IDFT)
Appendix GList of Symbols
These online elements can be found at informit.com/ title/9780134588568.
1信号与频谱1
1.1数字通信信号
处理2
1.1.1为什么要数字化2
1.1.2典型框图与
变换3
1.1.3数字通信基本
术语6
1.1.4数字通信与模拟通信的
性能准则8
1.2信号分类8
1.2.1确定信号与随机
信号8
1.2.2周期信号与非周期信号8
1.2.3模拟信号与离散信号8
1.2.4能量信号与功率信号9
1.2.5单位冲激函数10
1.3谱密度10
1.3.1能量谱密度10
1.3.2功率谱密度11
1.4自相关函数12
1.4.1能量信号的自相关
函数12
1.4.2周期(功率)信号的自
相关函数12
1.5随机信号13
1.5.1随机变量13
1.5.2随机过程14
1.5.3时间平均与遍历性16
1.5.4随机过程的功率谱密度
和自相关函数17
1.5.5通信系统中的
噪声20
1.6信号通过线性
系统22
1.6.1冲激响应22
1.6.2频域传递函数23
1.6.3无失真传输24
1.6.4信号、电路和频谱28
1.7带宽30
1.7.1基带与带通30
1.7.2关于带宽31
1.8小结33
参考文献34
习题34
思考题36
2格式化和基带调制37
2.1基带系统38
2.2文本数据的格式化(字符
编码)39
2.3消息、字符与符号39
2.3.1消息、字符与符号
示例40
2.4模拟信息的格式化41
2.4.1采样定理41
2.4.2混叠46
2.4.3为什么要过采样48
2.4.4数字系统的信号
接口50
2.5信号受损的因素51
2.5.1采样与量化的影响51
2.5.2信道的影响52
2.5.3量化脉冲的
信噪比52
2.6脉冲编码调制53
2.7均匀与非均匀
量化54
2.7.1语音幅度的统计特性54
2.7.2非均匀量化55
2.7.3压扩特性56
2.8基带传输57
2.8.1二进制数字的波形
表示57
2.8.2PCM波形类型58
2.8.3PCM波形的频谱
特性60
2.8.4每PCM码字的比特数与
每符号的比特数60
2.8.5M进制脉冲调制
波形61
2.9相关编码63
2.9.1双二进制信号63
2.9.2双二进制信号译码64
2.9.3预编码65
2.9.4双二进制的等效传递
函数66
2.9.5二进制信号与双二进制
信号比较66
2.9.6多二进制信号67
2.10小结68
参考文献68
习题68
思考题70
3基带解调与检测71
3.1信号与噪声72
3.1.1通信系统中差错性能
的恶化72
3.1.2解调与检测73
3.1.3信号与噪声的矢量
表示76
3.1.4数字通信系统中的信噪比
参数81
3.1.5为什么Eb/N0是自然的
性能指标81
3.2高斯噪声中的二进制信号
检测82
3.2.1最大似然接收机
结构82
3.2.2匹配滤波器84
3.2.3匹配滤波器的相关
实现85
3.2.4优化差错性能87
3.2.5二进制信号的差错概率
性能90
3.3符号间干扰94
3.3.1用脉冲成形减少ISI96
3.3.2两种差错性能
恶化98
3.3.3成形脉冲的解调
检测101
3.4均衡104
3.4.1信道特性104
3.4.2眼图105
3.4.3均衡滤波器的类型105
3.4.4预置式均衡与自适应
均衡110
3.4.5滤波器的更新速率112
3.5小结112
参考文献112
习题113
思考题115
4带通调制和解调与
检测116
4.1为什么要调制117
4.2数字带通调制
技术117
4.2.1正弦波的相量
表示118
4.2.2移相键控119
4.2.3移频键控120
4.2.4幅移键控121
4.2.5幅相键控121
4.2.6波形的幅度系数121
4.3高斯噪声中的信号
检测122
4.3.1判决域122
4.3.2相关接收机123
4.4相干检测126
4.4.1PSK相干检测126
4.4.2匹配滤波器采样127
4.4.3多进制相移键控
相干检测131
4.4.4FSK相干检测133
4.5非相干检测135
4.5.1差分PSK检测135
4.5.2二进制差分PSK
示例136
4.5.3FSK非相干检测137
4.5.4非相干正交FSK信号
所需的频差139
4.6复包络142
4.6.1调制器的正交
实现142
4.6.2D8PSK调制示例144
4.6.3D8PSK解调示例145
4.7二进制系统的差错
性能146
4.7.1BPSK相干检测的
误比特率146
4.7.2差分二进制PSK相干
检测的误比特率147
4.7.3二进制正交FSK相干
检测的误比特率148
4.7.4二进制正交FSK非相干
检测的误比特率149
4.7.5二进制DPSK的误比
特率151
4.7.6不同调制的误比特率
性能比较152
4.8M进制信号及其性能153
4.8.1理想误比特率
性能153
4.8.2M进制信号153
4.8.3MPSK信号的矢量
表示155
4.8.4BPSK和QPSK的
误比特率相同156
4.8.5MFSK信号的矢量
表示157
4.9M进制系统的误符号
性能(M>2)160
4.9.1MPSK的误
符号率160
4.9.2MFSK的误
符号率161
4.9.3正交信号的误比特率
与误符号率162
4.9.4多相信号的误比特率
与误符号率164
4.9.5符号间干扰的
影响165
4.10小结165
参考文献165
习题166
思考题168
5通信链路分析170
5.1系统链路预算对工程师
的意义171
5.2信道171
5.2.1自由空间的概念172
5.2.2差错性能恶化172
5.2.3信号损耗与噪声
的来源172
5.3接收信号功率与噪声
功率176
5.3.1距离方程176
5.3.2接收信号功率是频率的
函数179
5.3.3路径损耗与频率有关180
5.3.4热噪声功率181
5.4链路预算分析182
5.4.1两个关键Eb/N0值184
5.4.2链路预算通常按分贝
计算185
5.4.3需要多少链路
裕量185
5.4.4链路可用性187
5.5噪声系数、噪声温度和
系统温度190
5.5.1噪声系数190
5.5.2噪声温度191
5.5.3线路损耗192
5.5.4复合噪声系数与复合
噪声温度194
5.5.5系统有效温度195
5.5.6天空噪声温度198
5.6链路分析示例200
5.6.1链路预算细节201
5.6.2接收机品质因数203
5.6.3全向接收功率203
5.7卫星中继203
5.7.1非再生中继204
5.7.2非线性中继放大器208
5.8系统权衡208
5.9小结209
参考文献209
习题210
思考题213
6信道编码Ⅰ: 波形编码和
分组码214
6.1波形编码与结构
化序列215
6.1.1对极信号与正交
信号215
6.1.2M进制信号216
6.1.3波形编码216
6.1.4波形编码系统
示例219
6.2差错控制类型221
6.2.1终端连接方式221
6.2.2自动重传请求221
6.3结构化序列223
6.3.1信道模型223
6.3.2码率与冗余度224
6.3.3奇偶校验码225
6.3.4为什么要用纠错码227
6.4线性分组码230
6.4.1矢量空间231
6.4.2矢量子空间231
6.4.3(6,3)线性分组码
示例232
6.4.4生成矩阵232
6.4.5系统线性分组码233
6.4.6校验矩阵235
6.4.7伴随式检验235
6.4.8纠错236
6.4.9译码器实现239
6.5检错能力与纠错
能力240
6.5.1二进制矢量的重量
和距离240
6.5.2线性码的最小
距离241
6.5.3检错与纠错241
6.5.46元组空间图示244
6.5.5纠删245
6.6标准阵列的用途246
6.6.1码的能力估计246
6.6.2(n,k)码示例247
6.6.3设计(8,2)码248
6.6.4检错与纠错的
权衡248
6.6.5标准阵列的
机理250
6.7循环码251
6.7.1循环码的代数结构251
6.7.2二进制循环码的特性252
6.7.3系统码编码253
6.7.4多项式除法电路254
6.7.5用(n-k)级移位寄存器进行
系统编码256
6.7.6用(n-k)级移位寄存器
检错257
6.8常用分组码258
6.8.1汉明码258
6.8.2扩展格雷码260
6.8.3BCH码261
6.9小结264
参考文献265
习题265
思考题269
7信道编码Ⅱ: 卷积码和里德
所罗门码270
7.1卷积编码271
7.2卷积编码器的表示273
7.2.1连接表示273
7.2.2状态表示及
状态图276
7.2.3树图278
7.2.4格图278
7.3卷积码的译码
问题281
7.3.1最大似然译码281
7.3.2信道模型: 硬判决与
软判决282
7.3.3维特比卷积译码
算法285
7.3.4维特比译码
示例286
7.3.5译码器的实现289
7.3.6路径存储与
同步290
7.4卷积码的特性291
7.4.1卷积码的距离
特性291
7.4.2系统卷积码与非系统
卷积码294
7.4.3卷积码中的灾难性差错
传播294
7.4.4卷积码的
性能界295
7.4.5编码增益296
7.4.6常用卷积码298
7.4.7卷积码的码率权衡
因素299
7.4.8软判决维特比译码299
7.5其他卷积码译码
算法301
7.5.1序贯译码301
7.5.2维特比译码和序贯译码的
比较及局限性303
7.5.3反馈译码305
7.6里德所罗门码306
7.6.1里德所罗门码的差错率307
7.6.2为什么里德所罗门码抗突发
噪声性能突出308
7.6.3RS码的性能是码长、冗余度
和码率的函数310
7.6.4有限域312
7.6.5里德所罗门码的编码316
7.6.6里德所罗门码的译码319
7.7交织与级联码324
7.7.1分组交织325
7.7.2卷积交织327
7.7.3级联码328
7.8编码和交织在光盘数字音频系统中
的应用329
7.8.1CIRC编码330
7.8.2CIRC译码332
7.8.3插值与静音333
7.9小结334
参考文献334
习题336
思考题339
8信道编码Ⅲ: Turbo码和低密度校验
(LDPC)码340
8.1Turbo码341
8.1.1Turbo码的概念341
8.1.2对数似然代数344
8.1.3乘积码示例344
8.1.4递归系统码的
编码349
8.1.5反馈译码器353
8.1.6MAP算法356
8.1.7MAP译码示例361
8.2低密度校验
(LDPC)码364
8.2.1背景与概述364
8.2.2校验矩阵364
8.2.3寻找性能最佳
的编码366
8.2.4译码概述368
8.2.5数学基础371
8.2.6概率域译码374
8.2.7对数域译码380
8.2.8低复杂度译码器383
8.2.9LDPC码的性能384
8.2.10小结386
参考文献389
习题391
思考题395
9调制与编码的权衡396
9.1通信系统设计的
目标397
9.2差错概率平面397
9.3奈奎斯特最小带宽398
9.4香农哈特莱容量定理400
9.4.1香农极限401
9.4.2熵402
9.4.3疑义度与有效
传输率403
9.5带宽效率平面405
9.5.1MPSK与MFSK调制的
频谱效率406
9.5.2带宽效率平面与差错率
平面的类比407
9.6调制与编码的权衡407
9.7数字通信系统的定义、设计与
评估409
9.7.1M进制信号设计409
9.7.2带宽受限系统410
9.7.3功率受限系统411
9.7.4MPSK及MFSK传输
要求412
9.7.5带宽受限的无编码系统
示例412
9.7.6功率受限的无编码系统
示例414
9.7.7带宽与功率同时受限的编码
系统示例415
9.8高频谱效率调制421
9.8.1QPSK与OQPSK422
9.8.2最小移频键控424
9.8.3正交幅度调制427
9.9格码调制429
9.9.1格码调制的
思想430
9.9.2TCM编码431
9.9.3TCM译码434
9.9.4其他格码436
9.9.5格码调制
示例438
9.9.6多维格码
调制440
9.10小结441
参考文献441
习题442
思考题445
10同步446
10.1接收同步447
10.1.1同步的必要性447
10.1.2波形级与比特流级
的对齐447
10.1.3载波调制447
10.1.4载波同步447
10.1.5符号同步450
10.1.6眼图与星座图451
10.2同步解调452
10.2.1最小化信号之差
的能量453
10.2.2找出相关函数
的峰值453
10.2.3基本模拟锁相环
(PLL)455
10.2.4锁相于远端振荡器455
10.2.5相位斜率(频率)估计456
10.3环路滤波器、控制电路及
捕获457
10.3.1系统中有多少环路滤
波器457
10.3.2关键环路滤波器457
10.3.3为什么需要R×R·
457
10.3.4相位误差S曲线458
10.4锁相环定时恢复459
10.4.1从已调波形中恢复载
波定时459
10.4.2经典定时恢复
架构460
10.4.3定时误差检测: 基于
相关函数的机理462
10.4.4最大似然定时误差
检测463
10.4.5多相匹配滤波器与微分
匹配滤波器464
10.4.632路锁相环的近似ML
定时恢复468
10.5锁频环(FLL)恢复
频率471
10.5.1带边滤波器472
10.5.2非数据辅助的带边滤波器
定时同步476
10.6相位与频率偏移
的影响479
10.6.1星座图相位偏移
无旋转480
10.6.2星座图慢
旋转481
10.6.3星座图快
旋转483
10.7小结485
参考文献486
习题487
思考题490
11复用与多址491
11.1通信资源
分配492
11.1.1频分复用与频分
多址493
11.1.2时分复用与时分
多址497
11.1.3通信资源信
道化499
11.1.4FDMA与TDMA的性能
比较499
11.1.5码分多址502
11.1.6空分与极化
多址503
11.2多址通信系统与
架构504
11.2.1多址信息流505
11.2.2按需分配
多址505
11.3接入算法506
11.3.1ALOHA506
11.3.2时隙ALOHA508
11.3.3预约ALOHA509
11.3.4SALOHA和RALOHA
性能对比510
11.3.5轮询技术511
11.4INTELSAT采用的
多址技术512
11.4.1预分配FDM/FM/FDMA或
MCPC操作513
11.4.2INTELSAT卫星中的
MCPC多址接入模式514
11.4.3SPADE操作515
11.4.4INTELSAT中的TDMA518
11.4.5INTELSAT卫星交换
TDMA523
11.5局域网中的多址
技术525
11.5.1载波侦听多址
接入网络525
11.5.2令牌环网络527
11.5.3CSMA/CD与令牌环网络
性能对比528
11.6小结529
参考文献529
习题530
思考题532
12扩频技术533
12.1扩频概述534
12.1.1扩频系统的
优点534
12.1.2扩频技术的分类537
12.1.3直接序列扩频干扰抑制
模型537
12.1.4历史背景538
12.2伪噪声序列539
12.2.1随机特性539
12.2.2移位寄存器序列540
12.2.3PN序列的自相关函数541
12.3直接序列扩频
系统541
12.3.1直接序列扩频示例543
12.3.2处理增益与性能544
12.4跳频系统546
12.4.1跳频示例547
12.4.2鲁棒性548
12.4.3分集跳频549
12.4.4快跳频与慢跳频549
12.4.5FFH/MFSK解调551
12.4.6处理增益551
12.5同步551
12.5.1捕获552
12.5.2跟踪555
12.6干扰问题557
12.6.1干扰游戏557
12.6.2宽带噪声干扰561
12.6.3部分频带噪声干扰562
12.6.4多音干扰564
12.6.5脉冲干扰564
12.6.6转发式干扰565
12.6.7BLADES系统567
12.7商业应用568
12.7.1码分多址568
12.7.2多径信道569
12.7.3FCC第15部分关于扩频
系统的规范570
12.7.4直接序列扩频与跳频扩频
比较571
12.8蜂窝系统572
12.8.1直接序列CDMA572
12.8.2模拟FM、TDMA及CDMA
比较575
12.8.3干扰受限系统与维度受限
系统比较576
12.8.4IS95 CDMA数字蜂窝
系统578
12.9小结586
参考文献586
习题588
思考题591
13信源编码592
13.1信源593
13.1.1离散信源593
13.1.2波形信源596
13.2幅度量化597
13.2.1量化噪声599
13.2.2均匀量化601
13.2.3饱和604
13.2.4抖动606
13.2.5非均匀量化608
13.3脉冲编码调制611
13.3.1差分脉冲编码调制611
13.3.2单抽头预测613
13.3.3N抽头预测614
13.3.4增量调制615
13.3.5ΣΔ调制616
13.3.6ΣΔ模数转换(ADC)620
13.3.7ΣΔ数模转换(DAC)621
13.4自适应预测622
13.4.1前向自适应622
13.4.2综合/分析编码623
13.5分组编码624
13.5.1矢量量化624
13.6变换编码626
13.6.1变换编码的
量化627
13.6.2子带编码627
13.7数字数据的信源编码628
13.7.1编码特性629
13.7.2哈夫曼编码631
13.7.3游程编码633
13.8信源编码示例637
13.8.1音频压缩637
13.8.2图像压缩641
13.9小结647
参考文献647
习题648
思考题650
14衰落信道651
14.1衰落信道对通信
的挑战652
14.2移动无线传播
特性653
14.2.1大尺度衰落656
14.2.2小尺度衰落657
14.3信号的时间扩展660
14.3.1时间扩展在时延域
的体现660
14.3.2时间扩展在频域
的体现662
14.3.3平衰落与频率选择性衰落
示例664
14.4运动引起的信道
时变666
14.4.1时变性在时域
的体现666
14.4.2时变性在多普勒频移
域的体现668
14.4.3慢平瑞利衰落下
的性能673
14.5降低衰落
的影响675
14.5.1抗频率选择性
失真676
14.5.2抗快衰落
失真678
14.5.3克服低信噪比
损失678
14.5.4分集技术680
14.5.5适合衰落信道的
调制类型681
14.5.6交织器的作用682
14.6标准衰落信道的
主要参数685
14.6.1案例1: 快衰落失真685
14.6.2案例2: 频率选择性衰落
失真686
14.6.3案例3: 快衰落与频率
选择性衰落失真686
14.7应用: 减小频率选择性
衰落的影响688
14.7.1GSM中的维特比
均衡688
14.7.2直接序列扩频(DS/SS)系统
中的Rake接收机690
14.8小结692
参考文献692
习题694
思考题698
15正交频分复用(OFDM)
基础699
15.1什么是OFDM700
15.2为什么是OFDM700
15.3OFDM入门701
15.4我们希望平衰落慢
衰落702
15.4.1OFDM对多径信道通信
最重要的贡献702
15.5传统多载波FDM与多载波
OFDM的对比703
15.6循环前缀(CP)的历史704
15.6.1解析OFDM的符号
延长704
15.6.2CP的长度705
15.7OFDM系统框图706
15.8聚焦IDFT707
15.9OFDM波形合成
示例707
15.10OFDM波形合成
总结708
15.11分布在子载波索引上的数据
星座点709
15.11.1OFDM接收机中的信号
处理710
15.11.2OFDM符号持续时间710
15.11.3为什么实际系统中不使用
直流子载波711
15.12埃米尔特对称711
15.13需要多少子载波712
15.14循环前缀(CP)在OFDM中
的重要性713
15.14.1连续和离散傅里叶变换
的性质713
15.14.2OFDM子载波
重建714
15.14.3离散傅里叶变换(DFT)
的一个性质715
15.14.4利用循环卷积重建OFDM
子载波716
15.14.5使线性卷积呈现循环卷积
的技巧718
15.15早期OFDM应用: WiFi.802.11a标准718
15.15.1为什么变换点数N要大于
子载波数720
15.16循环前缀(CP)与子载波
间隔721
15.17OFDM在长期演进(LTE)中的
应用722
15.17.1LTE资源: 资源格、资源块、
资源单元722
15.17.2LTE中的OFDM帧722
15.18OFDM的缺点726
15.18.1对多普勒的敏感性726
15.18.2峰均功率比(PAPR)与
SCOFDM726
15.18.3降低PAPR的动因726
15.19单载波OFDM(SCOFDM)
的PAPR优于标准OFDM727
15.19.1SCOFDM信号的主瓣
持续时间短729
15.19.2是否有实现SCOFDM
的简单方法729
15.20小结730
参考文献730
习题730
思考题732
16多输入多输出(MIMO)
的魔力733
16.1什么是MIMO734
16.1.1MIMO发展历程734
16.1.2矢量与相量734
16.1.3MIMO信道模型735
16.2多天线技术的
多重优势737
16.2.1阵列增益737
16.2.2分集增益738
16.2.3SIMO接收分集
示例740
16.2.4MISO发送分集
示例740
16.2.5双时隙MISO分集
示例741
16.2.6编码增益741
16.2.7阵列增益、分集增益及编码
增益的图示742
16.3空间复用743
16.3.1MIMO空间复用(MIMO
SM)的基本思想743
16.3.2MIMOSM与CDMA
的类比744
16.3.3仅接收端已知信道状态
信息(CSI)时744
16.3.4信道模型的影响745
16.3.5MIMO与OFDM天然
适配746
16.4容量性能747
16.4.1确定信道
建模748
16.4.2随机信道模型749
16.5发端信道状态
信息(CSI)751
16.5.1最优功率分配752
16.6空时编码754
16.6.1MIMO系统中的分组码755
16.6.2MIMO系统中的格码757
16.7MIMO中的权衡757
16.7.1基本权衡758
16.7.2偏向提高PAM和QAM
的鲁棒性759
16.7.3偏向提高PAM和QAM
的容量759
16.7.4权衡复用增益与分集增益
的方法760
16.8多用户MIMO(MUMIMO)763
16.8.1什么是MUMIMO763
16.8.2SUMIMO与MUMIMO中
的记号764
16.8.3MIMO思维的
转变765
16.8.4MUMIMO容量768
16.8.5不同预编码策略和
率容量的比较779
16.8.6MUMIMO与SUMIMO
的性能对比779
16.9小结780
参考文献780
习题782
思考题783
以下内容仅在线提供
17加密与解密
附录A傅里叶方法回顾
附录B统计判决理论基础
附录C相关器对白噪声的响应
附录D常用公式
附录Es域、z域及数字滤波
附录F基于N点离散傅里叶逆变换(IDFT)
的OFDM符号产生
附录G符号列表
请访问informit.com/title/9780134588568获取在线内容。
