复习提纲3期末考试考试形式：考试形式：闭卷、英文试卷、英文答题试题类型：试题类型：判断题 填空题 综合题成绩构成成绩构成：平时成绩10%、期末考试90%平时成绩平时成绩：出勤、作业课程网站：课程网站：http:/zlgc.seu.edu.cn/jpkc/2009jpkc复习提纲Chapter 8 Multiuser Radio Communications3.Radio link analysisnlink (power) budget analysis - the totaling of all the gains and losses incurred in operating a communication linknTwo particular values of Eb/N0:o1. Required Eb/N0o2. Received Eb/N0nlink margin(8.2)复习提纲Chapter 8 Multiuser Radio Communications3.Radio link analysisneffective aperture (8.11)nThe path loss(8.15)nFree-space lossnRatio of received carrier power-to-noise spectral density (8.31)复习提纲Chapter 8 Multiuser Radio Communications4.Wireless communications (mobility and the multipath phenomenon)nreverse link (uplink): mobile base stationforward link (downlink): base station mobilenoffers mobility (communicate with anyone, anywhere)ntetherless (total freedom of location is permitted)nthe presence of multipath (no longer the idealized AWGN channel model)nDoppler-shift 复习提纲Chapter 8 Multiuser Radio Communications4.Wireless communications (mobility and the multipath phenomenon)co-channel interferencemultipath fading delay spreadspecialize techniques used, such as:diversityadaptive array antennasRAKE receiversignal-dependent phenomena复习提纲Chapter 8 Multiuser Radio Communications5.Adaptive antennasndelay spread coherent bandwidth BcDoppler spread coherence timenmultipath, delay spread (ISI) and co-channel interference (CCI)cancel the CCI array signal processor (spatial)cancel the ISI linear equalizer (temporal)nspace-time processor, which combines temporal and spatial processing复习提纲Chapter 9 Fundamental Limits in Information Theory1.Entropy - basic measure of informationa)a)Amount of informationb) bits(9.4)Propertiesb)Entropy - mean of I(sk) bits/symbol(9.9)Boundary(9.10)复习提纲Chapter 9 Fundamental Limits in Information Theory2.Source coding and data compaction (1)nAverage code-word length (9.18)nSource-Coding Theorem, Shannons first theoremGiven a discrete memoryless source of entropy , the average code-word length for any distortionless source encoding scheme is bounded as(9.20)nData compaction, lossless compression of data复习提纲Chapter 9 Fundamental Limits in Information Theory2.Source coding and data compaction (2)a)Prefix Coding b)Huffman Coding c)Huffman tree d)as high as possible or as low as possible?c)Lempel-Ziv Coding复习提纲Chapter 9 Fundamental Limits in Information Theory3.Mutual information - channel capacity (1)a)conditional entropyb)(9.41)b)Mutual information复习提纲Chapter 9 Fundamental Limits in Information Theory3.Mutual information - channel capacity (2)(9.59)Subject toandfor all j复习提纲Chapter 9 Fundamental Limits in Information Theory4.Channel Coding Theorem, Shannons second theorem(i) If Exists a coding scheme. C/Tc - critical rate(ii) If Not.(9.61)(9.62)average information rate channel capacity per unit time For BSC, if code rate r channel capacity C , codes do exist such that the average probability of error is as small as we want it.复习提纲Chapter 9 Fundamental Limits in Information Theory5.Information Capacity Theorem, Shannons third theoremndifferential entropy of a continuous random variable X(9.66)n The information capacity of a continuous channel is given byThere is a maximum to the rate at which any communication system can operate reliably (i.e., free of errors) when the system is constrained in power.复习提纲Chapter 9 Fundamental Limits in Information Theory6.Rate-distortion theory - source coding (1)nSource coding with a fidelity criterionnRate Distortion Function The smallest coding rate possible for which the average distortion not to exceed D.(9.131)subject to the constraint(9.132)复习提纲Chapter 9 Fundamental Limits in Information Theory6.Rate-distortion theory - source coding (2)nSignal compression (i.e., solving the problem of source coding with a fidelity criterion)ndata compression (if lossless) data compaction (such as Huffman coding, Lempel-Ziv coding) data encryption复习提纲Chapter 10 Error-Control Coding1.Linear block codes (Cyclic codes)a)generator matrix (polynomial)b)parity-check matrix (polynomial)c)Syndromed)minimum distance dmine)Encoder for cyclic codes复习提纲Chapter 10 Error-Control Coding2.Convolutional codesa)Generator polynomialb)Graphical formsnCode TreenTrellis nState Diagramc)The Viterbi algorithmd)Catastrophic code复习提纲Chapter 10 Error-Control Coding3. Compound codesa)Turbob) Low-density parity-check codes c) Irregular codes4. TCM Combine coding and modulation to attain a more effective utilization of the available bandwidth and power. .预祝同学们考出满意的成绩！结束语结束语谢谢大家聆听！谢谢大家聆听！27