Detection Algorithms for Wireless Communications : With Applications to Wired and Storage Systems

Gianluigi Ferrari, Giulio Colavolpe, Riccardo Raheli

  • 出版商: Wiley
  • 出版日期: 2004-10-08
  • 售價: $1,650
  • 貴賓價: 9.8$1,617
  • 語言: 英文
  • 頁數: 426
  • 裝訂: Hardcover
  • ISBN: 0470858281
  • ISBN-13: 9780470858288
  • 相關分類: Algorithms-data-structuresWireless-networks
  • 下單後立即進貨 (約5~7天)

買這商品的人也買了...

相關主題

商品描述

Description:

Wireless communications will play a major role in future communication systems. In fact, the need of wireless access to the Internet will become increasingly important, and novel network communication paradigms, such as ad-hoc wireless networks or integrated mobile/satellite systems, will be developed in the near future. Detection algorithms will play an important role in the design of efficient wireless communication systems as it will be mandatory to adhere to specific constraints in terms of power consumption and detection speed.

  • Provides a unified approach to statistical detection for stochastic channels, with particular emphasis on wireless communications
  • Shows how algorithms for trellis-based sequence detection can be systematically extended to trellis-based and graph-based symbol detection algorithms and vice-versa
  • Contains numerous examples of applications with an extended set of numerical results relative to the algorithms’ performance
  • Describes per-survivor processing, a key concept used to implement adaptive detection techniques
  • Presents a detailed description of graph-based detection
  • Features problems at the end of each chapter

* Includes a companion website featuring a solutions manual, electronic versions of the figures and a sample chapter *

By featuring detection algorithms which can be applied to wireless communications, as well as wired and storage systems such as those relative to transmissions over inter-symbol interference channels, this book will have far reaching appeal. Researchers and practitioners working in wireless and storage system design, both in academia and in industry, will all find it extremely useful.

Table of Contents:

Preface.

Acknowledgements.

List of Figures.

List of Tables.

1. Wireless Communication Systems.

1.1 Introduction.

1.2 Overview of Wireless Communication Systems.

1.3 Wireless Channel Models.

1.4 Demodulation, Detection, and Parameter Estimation.

1.5 Information Theoretic Limits.

1.6 Coding and Modulation.

1.7 Approaching Shannon Limits: Turbo Codes and Low Density Parity Check Codes.

1.8 Space-Time Coding.

1.9 Summary.

1.10 Problems.

2. A General Approach to Statistical Detection for Channels with Memory.

2.1 Introduction.

2.2 Statistical Detection Theory.

2.3 Transmission Systems with Memory.

2.4 Overview of Detection Algorithms for Stochastic Channels.

2.5 Summary.

2.6 Problems.

3. Sequence Detection: Algorithms and Applications.

3.1 Introduction.

3.2 MAP Sequence Detection Principle.

3.3 Viterbi Algorithm.

3.4 Soft-output Viterbi Algorithm.

3.5 Finite-Memory Sequence Detection.

3.6 Estimation-Detection Decomposition.

3.7 Data-Aided Parameter Estimation.

3.8 Joint Detection and Estimation.

3.9 Per-Survivor Processing.

3.9.1 Phase-Uncertain Channel.

3.10 Complexity Reduction Techniques for VA-based Detection Algorithms.

3.11 Applications to Wireless Communications.

3.12 Summary.

3.13 Problems.

4. Symbol Detection: Algorithms and Applications.

4.1 Introduction.

4.2 MAP Symbol Detection Principle.

4.3 Forward-Backward Algorithm.

4.4 Iterative Decoding and Detection.

4.5 Extrinsic Information in Iterative Decoding: a Unified View.

4.6 Finite-Memory Symbol Detection.

4.7 An Alternative Approach to Finite-Memory Symbol Detection.

4.8 State Reduction Techniques for Forward-Backward Algorithms.

4.9 Applications to Wireless Communications.

4.10 Summary.

4.11 Problems.

5. Graph-Based Detection: Algorithms and Applications.

5.1 Introduction.

5.2 Factor Graphs and the Sum-Product Algorithm.

5.3 Finite-Memory Graph-Based Detection.

5.4 Complexity Reduction for Graph-Based Detection Algorithms.

5.5 Strictly Finite Memory: Inter-Symbol Interference Channels.

5.6 Applications to Wireless Communications

5.7 An Alternative Approach to Graph-Based Detection in the Presence of Strong Phase Noise.

5.8 Summary.

5.9 Problems.

Appendix: Discretization by Sampling.

A.1 Introduction.

A.2 Continuous-Time Signal Model.

A.3 Discrete-Time Signal Model.

References.

List of Acronyms.

Index.

商品描述(中文翻譯)

描述:
無線通訊將在未來的通訊系統中扮演重要角色。事實上,對於無線接入互聯網的需求將變得越來越重要,並且在不久的將來將開發出新的網絡通訊範式,例如自組網無線網絡或集成的移動/衛星系統。檢測算法將在設計高效無線通訊系統中發揮重要作用,因為必須遵守特定的功耗和檢測速度限制。

提供了一種統一的統計檢測方法,專注於無線通訊。
展示了如何將基於格子的序列檢測算法系統地擴展到基於格子和基於圖形的符號檢測算法,反之亦然。
包含了大量應用示例,並提供了與算法性能相關的擴展數值結果。
描述了關鍵概念“存活者處理”,該概念用於實現自適應檢測技術。
詳細描述了基於圖形的檢測。
每章末尾都有問題。

* 包括配套網站,提供解答手冊、圖片的電子版本和一個示例章節 *

通過介紹可應用於無線通訊以及有線和存儲系統的檢測算法,例如相對於符號間干擾通道的傳輸,本書具有廣泛的吸引力。在學術界和工業界從事無線和存儲系統設計的研究人員和從業人員都會發現它非常有用。

目錄:
前言。
致謝。
圖表清單。
表格清單。
1. 無線通信系統。
1.1 簡介。
1.2 無線通信系統概述。
1.3 無線信道模型。
1.4 解調、檢測和參數估計。
1.5 信息理論極限。
1.6 編碼和調製。
1.7 接近香農極限:渦輪碼和低密度奇偶校驗碼。
1.8 空時編碼。
1.9 摘要。
1.10 問題。
2. 具有記憶通道的統計檢測的一般方法。