無線與移動通信中的信號處理新技術第2冊:單用戶與多用戶系統(英文版)

內容介紹

《無線與移動通信中的信號處理新技術》叢書,介紹了近年來無線與移動通信中使用的信號處理(SP)工具的最新的重要進展,以及世界範圍內該領域的領先者的貢獻。本書是兩本書中的第2冊。本叢書的內容涵蓋了範圍廣泛的技術和方法論,包括噪聲與干擾消除、數據機設計、移動網際網路業務、下一代音頻/視頻廣播、蜂窩行動電話和無線多媒體網路等。
本書(第2冊)重點闡述單用戶與多用戶通信系統。本書內容包括下列專題的最新成果:
·單個或多個感測器陣列的盲同步
·空一時收發分集合併系統
·時變信道的建模
·恆模約束的信號分離
·並行因子分析工具
·CDMA與多載波系統物理層中的多用戶干擾刪除及多徑影響減輕的新方法
·網路層的關鍵信號處理技術
本書介紹了在世界範圍內各種期刊中的研究成果,為通信工程師、研究人員、管理人員、通信系統設計人員和參與最新通信系統設計或構造的同行全面匯集了用於最佳化單用戶點對點鏈路的先進信號處理技術。

作品目錄

1TIME-VARYING FADING CHANNELS1
1.1Channel Model4
1.1.1Deterministic Models4
1.1.2Stochastic Models10
1.1.3Channel Singular Functions12
1.1.4Time-Frequency Analysis of LTV Channels' Eigenfunctions16
1.2Coding Strategies for Transmissions over LTV Channels20
1.2.1Perfect CSI Available at both Transmit and Receive Sides21
1.2.2Comparisons and Asymptotic Bounds24
1.2.3Adaptive OFDM30
1.2.4Coding with Partial CSI32
1.3Channel Estimation and Prediction35
1.3.1Cramer-Rao Bound for LTV Multipath Channels37
1.3.2Channel Prediction40
1.3.3Channel Parameter Estimation42
1.4Conclusion43
1.5Appendices45
1.5.1Eigenfunction Model45
1.5.2Time-frequency Representations48
1.5.3Cramer-Rao Bounds 49
Bibliography50
2SPACE-TIME DIVERSITY59
2.1Introduction59
2.1.1Diversity59
2.2The Set-Up60
2.3General Framework for Detection62
2.3.1 A Bound on the SNR63
2.4Space-Only Processing64
2.5Space-Time Processing65
2.5.1Trace Constraint65
2.5.2Eigenvalue Constraint65
2.5.3Comparison of the Schemes66
2.6Bit Error Rate67
2.6.1BER for a Non-fading Channel67
2.6.2BER for a Rayleigh Fading Channel68
2.6.3BER for other Modulation Schemes71
2.7Data Rate72
2.7.1Real Symbols72
2.7.2Complex Symbols79
2.8Discussion84
2.8.1Space-only vs. Space- Time Processing84
2.8.2Capacity vs. Diversity85
2.8.3The Rank One Channel85
2.8.4Soft Failure86
2.9Conclusions86
Bibliography86
3ALGEBRAIC CONSTANT MODULUS ALGORITHMS89
3.1Introduction89
3.2Preliminaries94
3.3Derivation of the ACMA99
3.4Analysis of the Noise-free Case103
3.5ACMA in Noise106
3.6Asymptotic Behavior108
3.7Weighted ACMA113
3.8Binary Source Separation115
3.9Simulations117
3.10Joint Diagonalization117
3.11Concluding Remarks125
Bibliography126
4PARAFAC TECHNIQUES FOR SIGNAL SEPQRATION131
4.1Introduction131
4.1.1Historical Remarks133
4.2Theory133
4.2.1Notation and Preliminaries133
4.2.2k-Rank136
4.2.3Identifiability137
4.3Algorithms for Fitting the PARAFAC Model140
4.3.1Eigenanalysis-Based: GRAM/ESPRIT141
4.3.2Alternating Least Squares142
4.3.3Separable LS, Gauss-Newton and Levenberg-Marquardt143
4.3.4Compression/COMFAC143
4.4Determining Three - Way Array Rank147
4.5Applications - Part I: Data Modeling151
4.5.1Extracting Trilinear Structure out of Bilinear-Vandermonde Data151
4.5.2CDMA152
4.5.3Multiple-Invariance Array Processing156
4.5.4Deterministic Blind Beamforming159
4.5.5Fluorescence Spectroscopy161
4.5.6Sensory Profiling162
4.6Applications -Part II: Examples164
4.6.1Numerical Example: COMFAC Performance and the CRB164
4.6.2OFDMA with Base Station Antenna Array Example 164
4.6.3Fluorescence Spectroscopy Example166
4.6.4Sensory Profiling Example167
4.7PARAFAC Extensions: PARAFCA2170
4.8Conclusions171
Bibliography172
5MULTIPATH MITIGATION IN CDMA SYSTEMS181
5.1Introduction181
5.2Signal Model183
5.2.1Vector Models186
5.2.2Analogies with Array Processing Models187
5.3Receiver Design188
5.3.1Matched Filter and RAKE Receivers188
5.3.2MMSE Receivers189
5.4Minimum Variance Receivers189
5.4.1The Multipath Case190
5.4.2Performance Analysis192
5.4.3Illustrative Examples197
5.4.4Time Recursive Implementations198
5.4.5Convergence203
5.4.6Numerical Examples205
5.5Multipath Mitigation in Long Code Systems207
5.5.1Parameter Estimation in Long Code Systems208
5.5.2Blind Channel Estimation210
5.5.3Idenfifiability Issues213
5.5.4Single-User Receivers213
5.5.5Numerical Examples214
5.6Conclusions216
Bibliography217
6BLOCK SPREADING FOR MULTIPATH-RESILIENT GENERALIZED MULTI-CARRIER CDMA223
6.1Block Spreading Model225
6.1.1Filterbank Block Precoding226
6.1.2Asynchronous Multirate Receiver Design229
6.1.3Quasi-Synchronous Model231
6.1.4AII-Digital Unitication of Multi-carrier CDMA232
6.2GMC-CDMA for MUI/ISI-free Multirate Transmissions237
6.2.1Single Rate GMC-CDMA: AMOUR237
6.2.2GMC-CDMA: Multirate Case247
6.2.3Receiver Design: Blind Equalization249
6.2.4Underloaded Systems251
6.3Performance and Comparisons251
6.4Conclusions and Discussion157
Appendix 6.A Dual Vandermonde-Lagrange Transceivers257
Appendix 6.B Modulo-Interpretation of GMC-CDMA259
6.B.1The Modulo Interpretation259
6.B.2Re-designing the Codes260
Bibliography261
7MULTISTAGE INTERFERENCE CANCELLATION ALGORITHMS FOR DS/CDMA SIGNALS267
7.1Introduction267
7.2Multiuser Signal Model268
7.3Overview of CDMA Receivers270
7.3.1Conventional Detector 270
7.3.2Optimum Detector272
7.3.3Linear Detectors273
7.3.4Decision-Feedback Detectors274
7.4Successive Interference Canceler (SIC)274
7.4.1SIC Computer Simulations: Synchronous Signals277
7.4.2SIC Computer Simulations: Asynchronous Signals280
7.5Exact BER Analysis281
7.5.1Synchronous Signal Model for Two Users282
7.5.2Exact BER of the SIC Receiver283
7.5.3Exact BER of the SIC with Amplitude Mismatch287
7.5.4Numerical Example: Exact Analysis288
7.6Approximate BER Analysis288
7.6.1Approximate BER of the SIC Receiver289
7.6.2Approximate BER of the SIC with Amplitude Mismatch291
7.6.3Numerical Example: Approximate Analysis292
7.7Adaptive SIC (ASIC)293
7.7.1ASIC Implementation293
7.7.2ASIC Computer Simulations295
7.8Parallel Interference Canceler (PIC)297
7.9BER Analysis for the PIC299
7.9.1BER for Stage 1: Exact Analysis299
7.9.2BER for Stage 2: Exact Analysis300
7.9.3BER from Stage j-1 to Stage j: Approximate Analysis303
7.9.4PIC Computer Simulations305
7.10State-Space Analysis308
7.10.1Convergence of the Error Probabilities308
7.10.2IC Receiver Design311
7.11Conclusion311
Bibliography313
8SIGNAL PROCESSING BASED COLLISION RESOLUTION315
8.1Packet Collision in Access Aloha Ad Hoc Networks317
8.1.1Random Access Ad Hoc Networks317
8.1.2Packet Collision318
8.2Packet Collision Model320
8.2.1Channel Model320
8.2.2Signal Structure322
8.2.3Assumptions and Properties323
8.3The Training-based Zero Forcing Receiver324
8.4The Semi-blind Least Squares Smoothing Receiver326
8.4.1The Elimination of ISI327
8.4.2The Reduction of MAI331
8.5Blind Receivers333
8.6Resolvability Analysis335
8.6.1Collision Resolvability335
8.6.2Resolvability of the Training-based ZF Receiver336
8.6.3Resolvability of the Semi-blind LSS Receivers338
8.6.4Resolvability Comparisons339
8.7Network Performance Analysis341
8.7.1Network Model341
8.7.2Node and Network Reception Matrices342
8.7.3The Markov-Chain Characterization of the Network344
8.7.4Throughput, Delay and Stability Analysis345
8.8Numerical Examples347
8.8.1Resolvability Comparison347
8.8.2Network Performance Comparison347
8.9Concluding Remarks351
Appendix351
Bibliography354
9NON-DATA-AIDED DIGITAL SYNCHRONIZATION357
9.1Introduction357
9.1.1Classical Approaches to NDA Synchronization358
9.1.2Chapter Summary360
9.2Signal Model360
9.3Classical Unconditional Maximum Likelihood (UML) Approach365
9.3.1NDA Symbol Timing Estimation367
9.4Conditional Maximum Likelihood (CML) Approach371
9.4.1Joint Parameter Estimation375
9.4.2CML-based NDA Synchronization376
9.4.3CML Timing and Frequency Synchronizers for Linear Modulations377
9.4.4CML Timing and Frequency Synchronizers for Binary CPM Signals382
9.5Minimum Conditioned Variance Compressed Likelihood Function (MCV-CML) Approach384
9.6Bounds and Performance Evaluation389
9.6.1The Modified Cramer-Rao Bound (MCRB)390
9.6.2The Unconditional CRB (UCRB)393
9.6.3The Conditional CRB (CCEB)395
9.7Conclusions398
Bibliography400
10EXPLOITING ANTENNA ARRAYS FOR SYNCHRONIZATION403
10.1Introduction403
10.2Data Model406
10.3Maximum Likelihood Estimator409
10.3.1Consistency411
10.3.2Cramer-Rao Bound412
10.3.3Computation of the Estimates413
10.4An Asymptotically Equivalent Estimator414
10.4.1Proof of the Asymptotic Equivalence414
10.4.2Calculation of the Weighting Matrix415
10.5Heuristic Derivations416
10.5.1Series Expansion of the Logarithm416
10.5.2Eigenvalue Weighting417
10.5.2First-Order Approximation417
10.6Calculating the Estimates with IQML and ESPRIT418
10.6.1IQML Algorithm419
10.6.2EAPRIT Algorithm420
10.7Simulation Results421
10.7.1Simulation Parameters421
10.7.2Effect of the Number of Samples422
10.7.3Effect of the Number of Sensors424
10.7.4Effect of the SIR425
10.7.5Closely Spaced Signals425
10.7.6Performance Using a Search426
10.8Conclusions428
Appendix 10.A429
Bibliography430

熱門詞條

聯絡我們