(免费)通信原理课件 第09章(对映 Haykin第四版 共10章).pptVIP

Chapter 9Fundamental Limits in Information Theory Figure 9.1Graphs of the functions x ? 1 and log x versus x. Figure 9.2Entropy function H(p0). Figure 9.3Source encoding. Figure 9.4Decision tree for code II of Table 9.2. Figure 9.5(a) Example of the Huffman encoding algorithm. (b) Source code. Figure 9.6Illustrating the encoding process performed by the Lempel-Ziv algorithm on the binary sequence 000101110010100101. . . . Figure 9.7Discrete memoryless channel. Figure 9.8Transition probability diagram of binary symmetric channel. Figure 9.9Illustrating the relations among various channel entropies. Figure 9.10Variation of channel capacity of a binary symmetric channel with transition probability p. Figure 9.11Block diagram of digital communication system. Figure 9.12Illustrating significance of the channel coding theorem. Figure 9.13Model of discrete-time, memoryless Gaussian channel. Figure 9.14The sphere-packing problem. Figure 9.15(a) Square 64-QAM constellation. (b) The most tightly coupled alternative to that of part a. Figure 9.16Bandwidth-efficiency diagram. Figure 9.17(a) Comparison of M-ary PSK against the ideal system for Pe ? 10?5 and increasing M. (b) Comparison of M-ary FSK against the ideal system for Pe ? 10 ?5 and increasing M. Figure 9.18Binary antipodal signaling over an AWGN channel. (a) Minimum Eb/N0 versus the code rate r. (b) Minimum bit error rate (BER) versus Eb/N0 for varying code rate r. Figure 9.19(a) Model of band-limited, power-limited noisy channel. (b) Equivalent model of the channel. Figure 9.20Staircase approximation of an arbitrary magnitude response ?H(f) ? ; only positive-frequency portion of the response is shown. Figure 9.21Water-filling interpretation of information-capacity theorem for a colored noisy channel. Figure 9.22Summary of rate distortion theory. Figure 9.23Reverse water-filling picture for a set of parallel Gaussian processes. Figure P9.5 Figure P9.14 Figure P9.22 Figure P9.23 Figure P9.36 *