信息理论对数字通信系统发展的指导.pptVIP

* * Random Codes Analysis what is the probability that a random K–by–K binary matrix is invertible? 0.289, for any K larger than 10. How about K-by-(K+E)? Prob{failure} ≤ 2-E Complexity, O(K3) * * LT-Codes s1 s2 s3 Encoding: Let s1, s2, …, sK be bits to be send To generate one coded bit tn Random choose the degree dn ~ ρ(d) Choose at random dn bits from s Let tn be the binary sum of the dn bits tn * * LT-codes: Decoding Information bits ? variable nodes Coded bits ? check nodes Find check nodes with degree 1 Solve these systems and find these information bits Substitute these solutions into other equations, and cancel them; Now some of check nodes becomes nodes with degree 1; repeat MacKay 05 AWGN信道 Y[t] = X[t] + Z[t]; X[t] 功率 P; Z[t] 高斯噪声，功率N * * * 信道容量限（1948） Golay[24,12]（1949, 7.5dB） BCH[255,123]（1959/60, 5.7dB） CC(2,1,7)VA (1967, 4.4dB） RS+CC (CCSDS1987, 2.5dB） Turbo （1993, 0.7dB） LDPC （2001, 0.2dB） 1dB=1百万美元 (Handbook of Coding Theory, 1998, p2125) BPSK限 编码方法 编码的意义 * * 信道编码的例子 线性分组码 BCH码、RS码 Berlekamp-Massey 卷积码 Turbo码 革命性意义：Turbo码前后 All codes are good, except those we can think of . LDPC码的复兴 Turbo编码 * * * * Turbo译码 * * Turbo的意义 The first IEEE Communication Theory Workshop in St. Petersburg, Florida, in April 1971, became famous as the “coding is dead” workshop. No written record of this workshop seems to have survived. However, Bob Lucky wrote a column about it many years later in IEEE Spectrum. Lucky recalls the following: A small group of us in the communications field will always remember a workshop held in Florida about 20 years ago . . . One of my friends [Ned Weldon] gave a talk that has lived in infamy as the “coding is dead” talk. His thesis was that he and the other coding theorists formed a small, inbred group that had been isolated from reality for too long. He illustrated this talk with a single slide showing a pen of rats that psychologists had penned in a confined space for an extensive period of time. I cannot tell you what thos