Algorithms for communications systems and their applications. (2020)
- Record Type:
- Book
- Title:
- Algorithms for communications systems and their applications. (2020)
- Main Title:
- Algorithms for communications systems and their applications.
- Authors:
- Benvenuto, Nevio
Cherubini, Giovanni, 1957-
Tomasin, Stefano - Contents:
- Preface 3 Acknowledgments 3 1 Elements of signal theory 7 1.1 Continuous-time linear systems 7 1.2 Discrete-time linear systems 10 Discrete Fourier transform 13 The DFT operator 14 Circular and linear convolution via DFT 15 Convolution by the overlap-save method 17 IIR and FIR filters 19 1.3 Signal bandwidth 22 The sampling theorem 24 Heaviside conditions for the absence of signal distortion 26 1.4 Passband signals and systems 26 Complex representation 26 Relation between a signal and its complex representation 28 Baseband equivalent of a transformation 36 Envelope and instantaneous phase and frequency 37 1.5 Second-order analysis of random processes 38 1.5.1 Correlation 39 Properties of the autocorrelation function 40 1.5.2 Power spectral density 40 Spectral lines in the PSD 40 Cross power spectral density 42 Properties of the PSD 42 PSD through filtering 43 1.5.3 PSD of discrete-time random processes 43 Spectral lines in the PSD 44 PSD through filtering 45 Minimum-phase spectral factorization 46 1.5.4 PSD of passband processes 47 PSD of in-phase and quadrature components 47 Cyclostationary processes 50 1.6 The autocorrelation matrix 56 Properties 56 Eigenvalues 56 Other properties 57 Eigenvalue analysis for Hermitian matrices 58 1.7 Examples of random processes 60 1.8 Matched filter 66 White noise case 68 1.9 Ergodic random processes 69 1.9.1 Mean value estimators 71 Rectangular window 74 Exponential filter 74 General window 75 1.9.2 Correlation estimators 75 UnbiasedPreface 3 Acknowledgments 3 1 Elements of signal theory 7 1.1 Continuous-time linear systems 7 1.2 Discrete-time linear systems 10 Discrete Fourier transform 13 The DFT operator 14 Circular and linear convolution via DFT 15 Convolution by the overlap-save method 17 IIR and FIR filters 19 1.3 Signal bandwidth 22 The sampling theorem 24 Heaviside conditions for the absence of signal distortion 26 1.4 Passband signals and systems 26 Complex representation 26 Relation between a signal and its complex representation 28 Baseband equivalent of a transformation 36 Envelope and instantaneous phase and frequency 37 1.5 Second-order analysis of random processes 38 1.5.1 Correlation 39 Properties of the autocorrelation function 40 1.5.2 Power spectral density 40 Spectral lines in the PSD 40 Cross power spectral density 42 Properties of the PSD 42 PSD through filtering 43 1.5.3 PSD of discrete-time random processes 43 Spectral lines in the PSD 44 PSD through filtering 45 Minimum-phase spectral factorization 46 1.5.4 PSD of passband processes 47 PSD of in-phase and quadrature components 47 Cyclostationary processes 50 1.6 The autocorrelation matrix 56 Properties 56 Eigenvalues 56 Other properties 57 Eigenvalue analysis for Hermitian matrices 58 1.7 Examples of random processes 60 1.8 Matched filter 66 White noise case 68 1.9 Ergodic random processes 69 1.9.1 Mean value estimators 71 Rectangular window 74 Exponential filter 74 General window 75 1.9.2 Correlation estimators 75 Unbiased estimate 76 Biased estimate 76 1.9.3 Power spectral density estimators 77 Periodogram or instantaneous spectrum 77 Welch periodogram 78 Blackman and Tukey correlogram 79 Windowing and window closing 79 1.10 Parametric models of random processes 82 ARMA 82 MA 84 AR 84 Spectral factorization of AR models 87 Whitening filter 87 Relation between ARMA, MA, and AR models 87 1.10.1 Autocorrelation of AR processes 89 1.10.2 Spectral estimation of an AR process 91 Some useful relations 92 AR model of sinusoidal processes 94 1.11 Guide to the bibliography 95 Bibliography 95 Appendixes 97 1.A Multirate systems 98 1.A.1 Fundamentals 98 1.A.2 Decimation 100 1.A.3 Interpolation 102 1.A.4 Decimator filter 104 1.A.5 Interpolator filter 105 1.A.6 Rate conversion 108 1.A.7 Time interpolation 109 Linear interpolation 110 Quadratic interpolation 112 1.A.8 The noble identities 112 1.A.9 The polyphase representation 113 Efficient implementations 114 1.B Generation of a complex Gaussian noise 121 1.C Pseudo-noise sequences 122 Maximal-length 122 CAZAC 124 Gold 125 2 The Wiener filter 129 2.1 The Wiener filter 129 Matrix formulation 130 Optimum filter design 132 The principle of orthogonality 134 Expression of the minimum mean-square error 135 Characterization of the cost function surface 136 The Wiener filter in the z-domain 137 2.2 Linear prediction 140 Forward linear predictor 141 Optimum predictor coefficients 141 Forward prediction error filter 142 Relation between linear prediction and AR models 143 First and second order solutions 144 2.3 The least squares method 145 Data windowing 146 Matrix formulation 146 Correlation matrix 147 Determination of the optimum filter coefficients 147 2.3.1 The principle of orthogonality 148 Minimum cost function 149 The normal equation using the data matrix 149 Geometric interpretation: the projection operator 150 2.3.2 Solutions to the LS problem 151 Singular value decomposition 152 Minimum norm solution 154 2.4 The estimation problem 155 Estimation of a random variable 155 MMSE estimation 155 Extension to multiple observations 157 Linear MMSE estimation of a random variable 158 Linear MMSE estimation of a random vector 158 2.4.1 The Cramér-Rao lower bound 160 Extension to vector parameter 162 2.5 Examples of application 164 2.5.1 Identification of a linear discrete-time system 164 2.5.2 Identification of a continuous-time system 166 2.5.3 Cancellation of an interfering signal 169 2.5.4 Cancellation of a sinusoidal interferer with known frequency 170 2.5.5 Echo cancellation in digital subscriber loops 171 2.5.6 Cancellation of a periodic interferer 172 Bibliography 173 Appendixes 174 2.A The Levinson-Durbin algorithm 175 Lattice filters 176 The Delsarte-Genin algorithm 177 3 Adaptive transversal filters 179 3.1 The MSE design criterion 180 3.1.1 The steepest descent or gradient algorithm 181 Stability 181 Conditions for convergence 183 Adaptation gain 184 Transient behaviour of the MSE 185 3.1.2 The least mean square algorithm 186 Implementation 187 Computational complexity 188 Conditions for convergence 188 3.1.3 Convergence analysis of the LMS algorithm 190 Convergence of the mean 191 Convergence in the mean-square sense: real scalar case 192 Convergence in the mean-square sense: general case 193 Fundamental results 196 Observations 197 Final remarks 199 3.1.4 Other versions of the LMS algorithm 199 Leaky LMS 199 Sign algorithm 200 Normalized LMS 200 Variable adaptation gain 201 3.1.5 Example of application: the predictor 202 3.2 The recursive least squares algorithm 208 Normal equation 209 Derivation 210 Initialization 212 Recursive form of the minimum cost function 212 Convergence 214 Computational complexity 214 Example of application: the predictor 215 3.3 Fast recursive algorithms 215 3.3.1 Comparison of the various algorithms 216 3.4 Examples of application 216 3.4.1 Identification of a linear discrete-time system 217 Finite alphabet case 219 3.4.2 Cancellation of a sinusoidal interferer with known frequency 220 Bibliography 221 4 Transmission channels 223 4.1 Radio channel 223 4.1.1 Propagation and used frequencies in radio transmission 224 Basic propagation mechanisms 224 Frequency ranges 224 4.1.2 Analog front-end architectures 226 Radiation masks 226 Conventional superheterodyne receiver 227 Alternative architectures 227 Direct conversion receiver 228 Single conversion to low-IF 229 Double conversion and wideband IF 229 4.1.3 General channel model 230 High power amplifier 230 Transmission medium 233 Additive noise 234 Phase noise 234 4.1.4 Narrowband radio channel model 235 Equivalent circuit at the receiver 237 Multipath 238 Path loss as a function of distance 240 4.1.5 Fading effects in propagation models 243 Macroscopic fading or sh … (more)
- Edition:
- Second edition
- Publisher Details:
- Hoboken : John Wiley & Sons, Inc
- Publication Date:
- 2020
- Extent:
- 1 online resource
- Subjects:
- 621.382015118
Algorithms
Telecommunication -- Mathematics - Languages:
- English
- ISBNs:
- 9781119567981
- Related ISBNs:
- 9781119567974
- Notes:
- Note: Description based on CIP data; resource not viewed.
- Access Rights:
- Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
- Access Usage:
- Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library HMNTS - ELD.DS.589629
- Ingest File:
- 04_053.xml