欢迎光临澳大利亚新华书店网 [登录 | 免费注册]

    • 现代编码理论(英文版香农信息科学经典)
      • 作者:(美)汤姆·理查森//(奥)鲁迪格·厄本克|责编:陈亮
      • 出版社:世图出版公司
      • ISBN:9787519285104
      • 出版日期:2022/06/01
      • 页数:572
    • 售价:55.6
  • 内容大纲

        本书是一本关于迭代编码技术的前沿著作,书中着重于基础理论,并提出了分析和设计实际迭代编码系统的技术。书中还有专门关于因子图(Factor Graph)的一章,将一些信息论,编码和通信理论的重要主题予以统一处理。本书内容清晰易懂,内容深入浅出,既保持理论的完整性、系统性,又概念清楚、易读好懂,同时注重编码理论与应用的新发展。为经典和现代编码技术提供了一站式资源,本书适合作为高等院校低年级研究生或高年级本科生编码理论课程的教材或参考书,也可供相关技术人员参考。
  • 作者介绍

  • 目录

    PREFACE
    1  INTRODUCTION
      §1.1  Why You Should Read This Book
      §1.2  Communications Problem
      §1.3  Coding: Trial and Error
      §1.4  Codes and Ensembles
      §1.5  MAP and ML Decoding and APP Processing
      §1.6  Channel Coding Theorem
      §1.7  Linear Codes and Complexity
      §1.8  Rate, Probability, Complexity, and Length
      §1.9  Tour of Iterative Decoding
      §1.10  Notation, Conventions, and Useful Facts
      Notes
      Problems
      References
    2  FACTOR GRAPHS . page
      §2.1  Distributive Law
      §2.2  Graphical Representation ofFactorizations
      §2.3  Recursive Determination of Marginals
      §2.4  Marginalization via Message Passing
      §2.5  Decoding via Message Passing
      §2.6  Limitations of Cycle-Free Codes
      §2.7  Message Passing on Codes with Cycles
      Notes
      Problems
      References
    3  BINARY ERASURE CHANNEL
      §3.1  ChannelModel
      §3.2  Transmission via Linear Codes
      §3.3  Tanner Graphs
      §3.4  Low-DensityParity-Check Codes
      §3.5  Message-PassingDecoder
      §3.6  Two Basic Simplifications
      §3.7  Computation Graph and Tree Ensemble
      §3.8  Tree Channel and Convergence to Tree Channel
      §3.9  Density Evolution
      §3.10  Monotonicity
      §3.11  Xhreshold
      §3.12  Fixed Point Characterization of Threshold
      §3.13  Stability
      §3.14  EXIT Charts
      §3.15  Capacity-Achieving Degree Distributions
      §3.16  Gallager's Lower Bound on Density
      §3.17  Optimally Sparse Degree Distribution Pairs
      §3.18  Degree Distributions with Given Maximum Degree
      §3.19  Peeling Decoder and Order of Limits
      §3.20  EXIT Function and MAP Performance
      §3.21  Maxwell Decoder
      §3.22  Exact Finite-Length Analysis
      §3.23  Finite-Length Scaling

      §3.24  Weight Distribution and Error Floor
      Notes
      Problems
      References
    4  BINARY MEMORYLESS SYMMETRIC CHANNELS
      §4.1  Basic Definitions and Examples
      §4.2  Message-PassingDecoder
      §4.3  Two Basic Simplifications
      §4.4  Tree Channel and Convergence to Tree Channel
      §4.5  Density Evolution
      §4.6  Monotonicity
      §4.7  Threshold
      §4.8  Fixed Point Characterization of Threshold
      §4.9  Stability
      §4.1  o EXIT Charts
      §4.11  Gallager's Lower Bound on Density
      §4.12  GEXIT Function and MAP Performance
      §4.13  Finite-Length Scaling
      §4.14  Error Floor under MAP Decoding
      Notes
      Problems
      References
    5  GENERAL CHANNELS
      §5.1  Fading Channel
      §5.2  Z Channel
      §5.3  Channels with Memory
      §5.4  Coding for High Spectral Efficiency
      §5.5  Multiple-Access Channel
      Notes
      Problems
      References
    6  TURBO CODES
      §6.1  Convolutional Codes
      §6.2  Structure and Encoding
      §6.3  Decoding
      §6.4  Basic Simplifications
      §6.5  Density Evolution
      §6.6  Stability Condition
      §6.7  EXIT Charts
      §6.8  GEXlT Function and MAP Performance
      §6.9  Weight Distribution and Error Floor
      §6.1  o Variations on the Theme
      Notes
      Problems
      References
    7  GENERAL ENSEMBLES
      §7.1  Multi-Edge-Type LDPC Code Ensembles
      §7.2  Multi-Edge-Type LDPC Codes: Analysis
      §7.3  Structured Codes
      §7.4  Non-BinaryCodes

      §7.5  Low-Density Generator Codes and Rateless Codes
      Notes
      Problems
      References
    8  EXPANDER CODES AND FLIPPING ALGORITHM
      §8.1  Building Codes from Expanders
      §8.2  Flipping Algorithm
      §8.3  Bound on Expansion of a Graph
      §8.4  Expansion of a Random Graph
      Notes
      Problems
      References
    A ENCODING Low-DENSITY PARITY-CHECK CODES
      §A.1  Encoding Generic LDPC Codes
      §A.2  Greedy Upper Triangulation
      §A.3  Linear Encoding Complexity
      §A.4  Analysis of Asymptotic Gap
      Notes
      Problems
      References
    EFFICIENT IMPLEMENTATION OF DENSITY EVOLUTION
      §B.1  Quantization
      §B.2  Variable-Node Update via Fourier Transform
      §B.3  Check-Node Update via Table Method
      §B.4  Check-Node Update via Fourier Method
      Notes
      Problems
      References
    C CONCENTRATION INEQUALITIES
      §C.1  First and Second Moment Method
      §C.2  Bernstein's Inequality
      §C.3  Martingales
      §C.4  Wormald's Differential Equation Approach
      §C.5  Convergence to Poisson Distribution
      Notes
      Problems
      References
    D FORMAL POWER SUMS
      §D.1  Definition
      §D.2  Basic Properties
      §D.3  Summation of Subsequences
      §D.4  Coefficient Growth of Powers of Polynomials
      §D.5  Unimodality
      Notes
      Problems
      References
    E  CONVEXITY, DEGRADATION, AND STABILITY
    AUTHORS
    INDEX

同类热销排行榜

推荐书目

  • 孩子你慢慢来/人生三书 华人世界率性犀利的一枝笔,龙应台独家授权《孩子你慢慢来》20周年经典新版。她的《...

  • 时间简史(插图版) 相对论、黑洞、弯曲空间……这些词给我们的感觉是艰深、晦涩、难以理解而且与我们的...

  • 本质(精) 改革开放40年,恰如一部四部曲的年代大戏。技术突变、产品迭代、产业升级、资本对接...

更多>>>