濠电姷鏁告慨鐑藉极閸涘﹥鍙忛柣鎴f閺嬩線鏌熼梻瀵割槮缁惧墽绮换娑㈠箣閻戝棛鍔┑鐐村灦閻燂箓宕曢悢鍏肩厪濠电偛鐏濋崝姘舵煟鎼搭喖寮慨濠冩そ瀹曟鎳栭埞鍨沪闂備礁鎼幊蹇曞垝瀹€鍕仼闁绘垼妫勯拑鐔兼煏婢舵稓鐣遍柍褜鍓涢弫濠氬蓟閵娿儮鏀介柛鈩冧緱閳ь剚顨婇弻锛勨偓锝庡亞閵嗘帞绱掓潏銊ユ诞闁糕斁鍋撳銈嗗笒鐎氼剛澹曢崗鍏煎弿婵☆垰鐏濇禍褰掓煕閻愬灚鏆柡宀嬬秮閹晠鎮滃Ο绯曞亾閸愵喗鍋i柍褜鍓熼弫鍐焵椤掆偓瀹撳嫰姊洪崨濠勨槈閺嬵亜霉濠婂嫮鐭掗柡灞诲姂瀵潙螖閳ь剚绂嶆ィ鍐╁€垫繛鍫濈仢閺嬫稑顭胯闁帮綁鐛幋锕€顫呴柣姗嗗亝閺傗偓闂佽鍑界紞鍡樼鐠烘í缂氬┑鐘叉处閳锋垹绱撴担鍏夋(妞ゅ繐瀚烽崵鏇㈡偣閾忚纾柟鐑橆殔缁犳盯鏌eΔ鈧悧鍐箯濞差亝鈷掗柛灞炬皑婢ф稓绱掔€n偄娴鐐寸墵楠炲洭顢橀悩娈垮晭闁诲海鎳撴竟濠囧窗閺嶎厾宓侀柡宥庡幗閻撶喖鏌ㄥ┑鍡樺櫣婵¤尙绮妵鍕敃閿濆洨鐣奸梺鍦嚀鐎氫即骞栬ぐ鎺撳仭闁哄娉曢鍥⒒閸屾艾鈧娆㈠璺虹劦妞ゆ帒鍊告禒婊堟煠濞茶鐏¢柡鍛板煐鐎佃偐鈧稒岣块崢鐐繆閵堝繒鐣虫繛澶嬫礈閼洪亶宕稿Δ浣哄帾闂佹悶鍎崝灞炬叏瀹ュ棭娈介柣鎰綑濞搭喗顨ラ悙宸剶闁诡喗绮撳畷鍗烆潨閸℃﹫绱欓梻鍌氬€搁崐鎼佸磹妞嬪海鐭嗗〒姘e亾妤犵偞鐗犻、鏇氱秴闁搞儺鍓﹂弫宥夋煟閹邦厽缍戦柍褜鍓濋崺鏍崲濠靛顥堟繛鎴炶壘椤e搫顪冮妶鍐ㄥ姕鐎光偓閹间礁钃熸繛鎴旀噰閳ь剨绠撻獮瀣攽閸モ晙绨┑鐘殿暯閸撴繆銇愰崘顔藉亱闁规崘顕ч拑鐔兼煥閻斿搫孝缂佲偓閸愵喗鐓冮柛婵嗗閳ь剚鎮傚鍐参旈崨顔规嫼婵炴潙鍚嬮悷褏绮旈鈧湁婵犲﹤楠告晶鐗堜繆閸欏濮嶆鐐村笒铻栭柍褜鍓氶崕顐︽煟閻斿摜鐭婇梺甯到椤曪綁骞庨挊澶屽幐闂佸憡鍔︽禍鐐烘晬濠婂牊鐓涘璺猴功婢ф垿鏌涢弬璺ㄐч挊鐔兼煕椤愮姴鍔滈柣鎾寸☉闇夐柨婵嗙墱濞兼劗鈧娲栭惌鍌炲蓟閳╁啯濯撮悷娆忓绾炬娊姊烘潪鎵妽闁圭懓娲顐﹀箻缂佹ɑ娅㈤梺璺ㄥ櫐閹凤拷 [闂傚倸鍊搁崐鎼佸磹閹间礁纾圭€瑰嫭鍣磋ぐ鎺戠倞妞ゆ帊绀侀崜顓烆渻閵堝棗濮х紒鐘冲灴閻涱噣濮€閵堝棛鍘撻柡澶屽仦婢瑰棝宕濆鍡愪簻闁哄倸鐏濋顐ょ磼鏉堛劍宕岀€规洘甯掗~婵嬵敄閽樺澹曢梺鍛婄缚閸庢娊鎯屽▎鎾寸厱闁哄洢鍔岄悘鐘电磼閻欌偓閸ㄥ爼寮婚妸鈺傚亞闁稿本绋戦锟� | 闂傚倸鍊搁崐鎼佸磹閹间礁纾归柣鎴eГ閸ゅ嫰鏌ら崫銉︽毄濞寸姵姘ㄧ槐鎾诲磼濞嗘帒鍘$紓渚囧櫘閸ㄨ泛鐣峰┑鍠棃宕橀妸銉т喊闂備礁鎼崯顐︽偋婵犲洤纾瑰┑鐘崇閻撱垺淇婇娆掝劅婵″弶鎮傞弻锝嗘償椤旂厧绫嶅┑顔硷龚濞咃絿鍒掑▎鎾崇閹兼番鍨虹€氭娊姊绘担铏广€婇柡鍛洴瀹曨垶寮堕幋顓炴闂佸綊妫跨粈渚€宕橀埀顒€顪冮妶鍡樺暗闁哥姵鎹囧畷銏ゎ敂閸涱垳鐦堥梺姹囧灲濞佳勭濠婂牊鐓熼煫鍥ㄦ⒒缁犵偟鈧娲樼换鍌烇綖濠靛鍤嬮柣銏ゆ涧楠炴劙姊绘担鍛靛綊寮甸鍕┾偓鍐川椤旂虎娲搁梺璺ㄥ櫐閹凤拷]

    • 现代编码理论(英文版香农信息科学经典)
      • 作者:(美)汤姆·理查森//(奥)鲁迪格·厄本克|责编:陈亮
      • 出版社:世图出版公司
      • 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年,恰如一部四部曲的年代大戏。技术突变、产品迭代、产业升级、资本对接...

更多>>>