Cover image for Advanced Wireless Communications and Internet : Future Evolving Technologies.
Advanced Wireless Communications and Internet : Future Evolving Technologies.
Title:
Advanced Wireless Communications and Internet : Future Evolving Technologies.
Author:
Glisic, Savo G.
ISBN:
9781119991625
Personal Author:
Edition:
3rd ed.
Physical Description:
1 online resource (951 pages)
Contents:
ADVANCED WIRELESS COMMUNICATIONS & INTERNET -- Contents -- Preface to the Third Edition -- 1 Fundamentals -- 1.1 4G and the Book Layout -- 1.2 General Structure of 4G Signals -- 1.2.1 Advanced Time Division Multiple Access - ATDMA -- 1.2.2 Code Division Multiple Access - CDMA -- 1.2.3 Orthogonal Frequency Division Multiplexing - OFDM -- 1.2.4 Multicarrier CDMA (MC CDMA) -- 1.2.5 Ultra Wide Band (UWB) Signal -- 1.3 Next Generation Internet -- 1.4 Cloud Computing and Network Virtualization -- 1.5 Economics of Utility Computing -- 1.6 Drawbacks of Cloud Computing -- 1.7 Wireless Grids and Clouds -- References -- 2 Adaptive Coding -- 2.1 Adaptive and Reconfigurable Block Coding -- 2.2 Adaptive and Reconfigurable Convolutional Codes -- 2.2.1 Punctured Convolutional Codes/Code Reconfigurability -- 2.2.2 Maximum Likelihood Decoding/Viterbi Algorithm -- 2.2.3 Systematic Recursive Convolutional Codes -- 2.3 Concatenated Codes with Interleavers -- 2.3.1 The Iterative Decoding Algorithm -- 2.4 Adaptive Coding, Practice and Prospects -- 2.5 Distributed Source Coding -- 2.5.1 Continuous Valued Source -- 2.5.2 Scalar Quantization and Trellis-Based Coset Construction -- 2.5.3 Trellis-Based Quantization and Memoryless Coset Construction -- 2.5.4 Performance Examples -- Appendix 2.1 Maximum a Posteriori Detection -- References -- 3 Adaptive and Reconfigurable Modulation -- 3.1 Coded Modulation -- 3.1.1 Euclidean Distance -- 3.1.2 Examples of TCM Schemes -- 3.1.3 Set Partitioning -- 3.1.4 Representation of TCM -- 3.1.5 TCM with Multidimensional Constellation -- 3.2 Adaptive Coded Modulation for Fading Channels -- 3.2.1 Maintaining a Fixed Distance -- 3.2.2 Information Rate -- References -- 4 Space-Time Coding -- 4.1 Diversity Gain -- 4.1.1 Two-Branch Transmit Diversity Scheme With One Receiver -- 4.1.2 Two Transmitters and M Receivers -- 4.2 Space-Time Coding.

4.2.1 The System Model -- 4.2.2 The Case of Independent Fade Coefficients -- 4.2.3 Rayleigh Fading -- 4.2.4 Design Criteria for Rayleigh Space-Time Codes -- 4.2.5 Code Construction -- 4.2.6 Reconfiguration Efficiency of Space-Time Coding -- 4.2.7 Delay Diversity -- 4.3 Space-Time Block Codes from Orthogonal Designs -- 4.3.1 The Channel Model and the Diversity Criterion -- 4.3.2 Real Orthogonal Designs -- 4.3.3 Space-Time Encoder -- 4.3.4 The Diversity Order -- 4.3.5 The Decoding Algorithm -- 4.3.6 Linear Processing Orthogonal Designs -- 4.3.7 Generalized Real Orthogonal Designs -- 4.3.8 Encoding -- 4.3.9 The Alamouti Scheme -- 4.3.10 Complex Orthogonal Designs -- 4.3.11 Generalized Complex Orthogonal Designs -- 4.3.12 Special Codes -- 4.3.13 Performance Results -- 4.4 Channel Estimation Imperfections -- 4.4.1 Channel Estimator -- 4.5 Quasi-Orthogonal Space-Time Block Codes -- 4.5.1 Decoding -- 4.5.2 Decision Metric -- 4.6 Space-Time Convolutional Codes -- 4.7 Algebraic Space-Time Codes -- 4.7.1 Full Spatial Diversity -- 4.7.2 QPSK Modulation -- 4.8 Differential Space-Time Modulation -- 4.8.1 The Encoding Algorithm -- 4.8.2 Differential Decoding -- 4.9 Multiple Transmit Antenna Differential Detection from Generalized Orthogonal Designs -- 4.9.1 Differential Encoding -- 4.9.2 Received Signal -- 4.9.3 Orthogonality -- 4.9.4 Encoding -- 4.9.5 Differential Decoding -- 4.9.6 Received Signal -- 4.9.7 Demodulation -- 4.9.8 Multiple Receive Antennas -- 4.9.9 The Number of Transmit Antennas Lower than the Number of Symbols -- 4.9.10 Final Result -- 4.9.11 Real Constellation Set -- 4.10 Layered Space-Time Coding -- 4.10.1 Receiver Complexity -- 4.10.2 Group Interference Suppression -- 4.10.3 Suppression Method -- 4.10.4 The Null Space -- 4.10.5 Receiver -- 4.10.6 Decision Metric -- 4.10.7 Multilayered Space-Time Coded Modulation -- 4.10.8 Diversity Gain.

4.10.9 Adaptive Reconfigurable Transmit Power Allocation -- 4.11 Concatenated Space-Time Block Coding -- 4.11.1 System Model -- 4.11.2 Product Sum Distance -- 4.11.3 Error Rate Bound -- 4.11.4 The Case of Low SNR -- 4.11.5 Code Design -- 4.12 Estimation of MIMO Channel -- 4.12.1 System Model -- 4.12.2 Training -- 4.12.3 Performance Measure -- 4.12.4 Definitions -- 4.12.5 Channel Estimation Error -- 4.12.6 Error Statistic -- 4.12.7 Results -- 4.13 Space-Time Codes for Frequency Selective Channels -- 4.13.1 Diversity Gain Properties -- 4.13.2 Coding Gain Properties -- 4.13.3 Space-Time Trellis Code Design -- 4.14 Optimization of a MIMO System -- 4.14.1 The Channel Model -- 4.14.2 Gain Optimization By Singular Value Decomposition (SVD) -- 4.14.3 The General (M, N) Case -- 4.14.4 Gain Optimization By Iteration For a Reciprocal Channel -- 4.14.5 Spectral Efficiency of Parallel Channels -- 4.14.6 Capacity of the (M, N) Array -- 4.15 MIMO Systems with Constellation Rotation -- 4.15.1 System Model -- 4.15.2 Performance in a Rayleigh Fading Channel -- 4.16 Diagonal Algebraic Space-Time Block Codes -- 4.16.1 System Model -- 4.16.2 The DAST Coding Algorithm -- 4.16.3 The DAST Decoding Algorithm -- Appendix 4.1 QR Factorization -- Appendix 4.2 Lattice Code Decoder for Space-Time Codes -- Appendix 4.3 MIMO Channel Capacity -- References -- 5 Multiuser Communication -- 5.1 Pseudorandom Sequences -- 5.1.1 Binary Shift Register Sequences -- 5.1.2 Properties of Binary Maximal Length Sequences -- 5.1.3 Crosscorrelation Spectra -- 5.1.4 Maximal Connected Sets of m-sequences -- 5.1.5 Gold Sequences -- 5.1.6 Gold-Like and Dual-BCH Sequences -- 5.1.7 Kasami Sequences -- 5.1.8 JPL Sequences -- 5.1.9 Kronecker Sequences -- 5.1.10 Walsh Functions -- 5.1.11 Optimum PN Sequences -- 5.1.12 Golay Code -- 5.2 Multiuser CDMA Receivers -- 5.2.1 Synchronous CDMA Channels.

5.2.2 The Decorrelating Detector -- 5.2.3 The Optimum Linear Multiuser Detector -- 5.2.4 Multistage Detection in Asynchronous CDMA [43] -- 5.2.5 Non-Coherent Detector -- 5.2.6 Non-Coherent Detection in Asynchronous Multiuser Channels [45] -- 5.2.7 Multiuser Detection in Frequency Non-Selective Rayleigh Fading Channels -- 5.2.8 Multiuser Detection in Frequency Selective Rayleigh Fading Channels -- 5.3 Minimum Mean Square Error (MMSE) Linear Multiuser Detection -- 5.3.1 System Model in Multipath Fading Channels -- 5.3.2 MMSE Detector Structures -- 5.3.3 Spatial Processing -- 5.4 Single User LMMSE Receivers for Frequency Selective Fading Channels -- 5.4.1 Adaptive Precombining LMMSE Receivers -- 5.4.2 Blind Least Squares Receivers -- 5.4.3 Least Squares (LS) Receiver -- 5.4.4 Method Based on the Matrix Inversion Lemma -- 5.5 Signal Subspace-Based Channel Estimation for CDMA Systems -- 5.5.1 Estimating the Signal Subspace -- 5.5.2 Channel Estimation -- 5.6 Iterative Receivers for Layered Space-Time Coding -- 5.6.1 LST Architectures -- 5.6.2 LST Receivers -- 5.6.3 QR Decomposition/SIC Detector -- 5.6.4 MMSE/SIC Detector -- 5.6.5 Iterative LST Receivers -- Appendix 5.1 Linear and Matrix Algebra -- References -- 6 Channel Estimation and Equalization -- 6.1 Equalization in the Digital Data Transmission System -- 6.1.1 Zero-Forcing Equalizers -- 6.2 LMS Equalizer -- 6.2.1 Signal Model -- 6.2.2 Adaptive Weight Adjustment -- 6.2.3 Automatic Systems -- 6.2.4 Iterative Algorithm -- 6.2.5 The LMS Algorithm -- 6.2.6 Decision Feedback Equalizer (DFE) -- 6.2.7 Blind Equalizers -- 6.3 Detection for a Statistically Known, Time Varying Channel -- 6.3.1 Signal Model -- 6.3.2 Channel Model -- 6.3.3 Statistical Description of the Received Sequence -- 6.3.4 The ML Sequence (Block) Estimator for a Statistically Known Channel.

6.4 LMS-Adaptive MLSE Equalization on Multipath Fading Channels -- 6.4.1 System and Channel Models -- 6.4.2 Adaptive Channel Estimator and LMS Estimator Model -- 6.4.3 The Channel Prediction Algorithm -- 6.5 Adaptive Channel Identification and Data Demodulation -- 6.5.1 System Model -- 6.5.2 Joint Channel and Data Estimation -- 6.5.3 Data Estimation and Tracking for a Fading Channel -- 6.5.4 The Static Channel Environment -- 6.5.5 The Time Varying Channel Environment -- 6.6 Turbo Equalization -- 6.6.1 Signal Format -- 6.6.2 Equivalent Discrete Time Channel Model -- 6.6.3 Equivalent System State Representations -- 6.6.4 Turbo Equalization -- 6.6.5 Viterbi Algorithm -- 6.6.6 Iterative Implementation of Turbo Equalization -- 6.6.7 Performance -- 6.7 Kalman Filter Based Joint Channel Estimation and Data Detection Over Fading Channels -- 6.7.1 Channel Model -- 6.7.2 The Received Signal -- 6.7.3 Channel Estimation Alternatives -- 6.7.4 Implementing the Estimator -- 6.7.5 The Kalman Filter -- 6.7.6 Implementation Issues -- 6.8 Equalization Using Higher Order Signal Statistics -- 6.8.1 Problem Statement -- 6.8.2 Signal Model -- 6.8.3 Derivation of Algorithms for DFE -- 6.8.4 The Equalizer Coefficients -- 6.8.5 Stochastic Gradient DFE Adaptive Algorithms -- 6.8.6 Convergence Analysis -- 6.8.7 Kurtosis-Based Algorithm -- 6.8.8 Performance Results -- References -- 7 Orthogonal Frequency Division Multiplexing - OFDM and Multicarrier CDMA -- 7.1 Timing and Frequency Offset in OFDM -- 7.1.1 Robust Frequency and Timing Synchronization for OFDM -- 7.2 Fading Channel Estimation for OFDM Systems -- 7.2.1 Statistics of Mobile Radio Channels -- 7.2.2 Diversity Receiver -- 7.2.3 MMSE Channel Estimation -- 7.2.4 FIR Channel Estimator -- 7.2.5 System Performance -- 7.2.6 Reference Generation -- 7.3 64 DAPSK and 64 QAM Modulated OFDM Signals.

7.4 Space-Time Coding with OFDM Signals.
Abstract:
The new edition of Advanced Wireless Communications: 4G Cognitive and Cooperative Broadband Technology, 2nd Edition, including the latest developments In the evolution of wireless communications, the dominant challenges are in the areas of networking and their integration with the Future Internet. Even the classical concept of cellular networks is changing and new technologies are evolving to replace it. To reflect these new trends,Advanced Wireless Communications & INTERNET builds upon the previous volumes, enhancing the existing chapters, and including a number of new topics. Systematically guiding readers from the fundamentals through to advanced areas, each chapter begins with an introductory explanation of the basic problems and solutions followed with an analytical treatment in greater detail. The most important aspects of new emerging technologies in wireless communications are comprehensively covered including: next generation Internet; cloud computing and network virtualization; economics of utility computing and wireless grids and clouds. This gives readers an essential understanding of the overall environment in which future wireless networks will be operating. Furthermore, a number of methodologies for maintaining the network connectivity, by using tools ranging from genetic algorithms to stochastic geometry and random graphs theory, and a discussion on percolation and connectivity, are also offered. The book includes a chapter on network formation games, covering the general models, knowledge based network formation games, and coalition games in wireless ad hoc networks. Illustrates points throughout using real-life case studies drawn from the author's extensive international experience in the field of telecommunications Fully updated to include the latest developments, key topics covered include: Advanced routing and network

coding; Network stability control; Relay-assisted Wireless Networks; Multicommodity flow optimization problems, flow optimization in heterogeneous networks, and dynamic resource allocation in computing clouds Methodically guides readers through each topic from basic to advanced areas Focuses on system elements that provide adaptability and re-configurability, and discusses how these features can improve wireless communications system performance.
Local Note:
Electronic reproduction. Ann Arbor, Michigan : ProQuest Ebook Central, 2017. Available via World Wide Web. Access may be limited to ProQuest Ebook Central affiliated libraries.
Electronic Access:
Click to View
Holds: Copies: