数字通信基础（英文版）

图书标准信息

• 作者 [美]麦德豪 著
• 出版社 人民邮电出版社
• 出版时间 2010-04
• 版次 1
• ISBN 9787115223005
• 定价 69.00元
• 装帧 平装
• 开本 16开
• 纸张 胶版纸
• 页数 499页
• 字数 600千字
• 正文语种 英语
• 丛书 图灵原版电子与电气工程系列

【内容简介】

《数字通信基础（英文版）》阐述了现代数字通信系统设计的基本知识，主要内容有：信号和噪声的复基带表述，调制和调解，分散信道通信，用信息理论计算性能基准点，现代解码方法基础知识，无线通信简介。书中实例丰富，每章还配有练习题，帮助读者深刻理解重要通信原理。
《数字通信基础（英文版）》是通信专业高年级本科生和研究生教材，也可供工程技术人员参考。

【作者简介】

UpamanyuMadhow博士，IEEE会士，无线通信和通信网领域知名学者。曾任职于贝尔通信实验室，现任加州大学圣巴巴拉分校电气与计算机工程系教授，致力于无线通信新技术的产业化。他拥有8项美国专利，并著有多篇颇有影响力的论文，被为业内人士广泛引用。

【目录】

1Introduction1
1.1Componentsofadigitalcommunicationsystem2
1.2Textoutline5
1.3Furtherreading6

2Modulation7
2.1Preliminaries8
2.2Complexbasebandrepresentation18
2.3Spectraldescriptionofrandomprocesses31
2.3.1Complexenvelopeforpassbandrandomprocesses40
2.4Modulationdegreesoffreedom41
2.5Linearmodulation43
2.5.1Examplesoflinearmodulation44
2.5.2Spectraloccupancyoflinearlymodulatedsignals46
2.5.3TheNyquistcriterion：relatingbandwidthtosymbolrate49
2.5.4Linearmodulationasabuildingblock54
2.6Orthogonalandbiorthogonalmodulation55
2.7Differentialmodulation57
2.8Furtherreading60
2.9Problems60
2.9.1Signalsandsystems60
2.9.2Complexbasebandrepresentation62
2.9.3Randomprocesses64
2.9.4Modulation66

3Demodulation74
3.1Gaussianbasics75
3.2Hypothesistestingbasics88
3.3Signalspaceconcepts94
3.4OptimalreceptioninAWGN102
3.4.1GeometryoftheMLdecisionrule106
3.4.2Softdecisions107
3.5PerformanceanalysisofMLreception109
3.5.1Performancewithbinarysignaling110
3.5.2PerformancewithM-arysignaling114
3.6Bit-leveldemodulation127
3.6.1Bit-levelsoftdecisions131
3.7Elementsoflinkbudgetanalysis133
3.8Furtherreading136
3.9Problems136
3.9.1Gaussianbasics136
3.9.2Hypothesistestingbasics138
3.9.3ReceiverdesignandperformanceanalysisfortheAWGNchannel140
3.9.4Linkbudgetanalysis149
3.9.5Somemathematicalderivations150

4Synchronizationandnoncoherentcommunication153
4.1Receiverdesignrequirements155
4.2Parameterestimationbasics159
4.2.1LikelihoodfunctionofasignalinAWGN162
4.3Parameterestimationforsynchronization165
4.4Noncoherentcommunication170
4.4.1Compositehypothesistesting171
4.4.2Optimalnoncoherentdemodulation172
4.4.3Differentialmodulationanddemodulation173
4.5Performanceofnoncoherentcommunication175
4.5.1PropercomplexGaussianity176
4.5.2Performanceofbinarynoncoherentcommunication181
4.5.3PerformanceofM-arynoncoherentorthogonalsignaling185
4.5.4PerformanceofDPSK187
4.5.5Blocknoncoherentdemodulation188
4.6Furtherreading189
4.7Problems190

5Channelequalization199
5.1Thechannelmodel200
5.2Receiverfrontend201
5.3Eyediagrams203
5.4Maximumlikelihoodsequenceestimation204
5.4.1AlternativeMLSEformulation212
5.5Geometricmodelforsuboptimalequalizerdesign213
5.6Linearequalization216
5.6.1Adaptiveimplementations223
5.6.2Performanceanalysis226
5.7Decisionfeedbackequalization228
5.7.1Performanceanalysis230
5.8PerformanceanalysisofMLSE231
5.8.1Unionbound232
5.8.2Transferfunctionbound237
5.9Numericalcomparisonofequalizationtechniques240
5.10Furtherreading242
5.11Problems243
5.11.1MLSE243

6Information-theoreticlimitsandtheircomputation252
6.1CapacityofAWGNchannel：modelingandgeometry253
6.1.1Fromcontinuoustodiscretetime256
6.1.2Capacityofthediscrete-timeAWGNchannel257
6.1.3Fromdiscretetocontinuoustime259
6.1.4Summarizingthediscrete-timeAWGNmodel261
6.2Shannontheorybasics263
6.2.1Entropy，mutualinformation，anddivergence265
6.2.2Thechannelcodingtheorem270
6.3Somecapacitycomputations272
6.3.1Capacityforstandardconstellations272
6.3.2ParallelGaussianchannelsandwaterfilling277
6.4Optimizingtheinputdistribution280
6.4.1Convexoptimization281
6.4.2Characterizingoptimalinputdistributions282
6.4.3Computingoptimalinputdistributions284
6.5Furtherreading287
6.6Problems287

7Channelcoding293
7.1Binaryconvolutionalcodes294
7.1.1Nonrecursivenonsystematicencoding295
7.1.2Recursivesystematicencoding297
7.1.3Maximumlikelihooddecoding298
7.1.4PerformanceanalysisofMLdecoding303
7.1.5Performanceanalysisforquantizedobservations309
7.2Turbocodesanditerativedecoding311
7.2.1TheBCJRalgorithm：soft-in，soft-outdecoding311
7.2.2LogarithmicBCJRalgorithm320
7.2.3Turboconstructionsfromconvolutionalcodes325
7.2.4TheBERperformanceofturbocodes328
7.2.5Extrinsicinformationtransfercharts329
7.2.6Turboweightenumeration336
7.3Lowdensityparitycheckcodes342
7.3.1Someterminologyfromcodingtheory343
7.3.2RegularLDPCcodes345
7.3.3IrregularLDPCcodes347
7.3.4Messagepassinganddensityevolution349
7.3.5Beliefpropagation352
7.3.6Gaussianapproximation354
7.4Bandwidth-efficientcodedmodulation357
7.4.1Bitinterleavedcodedmodulation358
7.4.2Trelliscodedmodulation360
7.5Algebraiccodes364
7.6Furtherreading367
7.7Problems369

8Wirelesscommunication379
8.1Channelmodeling380
8.2Fadinganddiversity387
8.2.1TheproblemwithRayleighfading387
8.2.2Diversitythroughcodingandinterleaving390
8.2.3Receivediversity393
8.3Orthogonalfrequencydivisionmultiplexing397
8.4Directsequencespreadspectrum406
8.4.1Therakereceiver409
8.4.2Choiceofspreadingsequences413
8.4.3PerformanceofconventionalreceptioninCDMAsystems415
8.4.4MultiuserdetectionforDS-CDMAsystems417
8.5Frequencyhopspreadspectrum426
8.6Continuousphasemodulation428
8.6.1GaussianMSK432
8.6.2ReceiverdesignandLaurentsexpansion433
8.7Space–timecommunication439
8.7.1Space–timechannelmodeling440
8.7.2Information-theoreticlimits443
8.7.3Spatialmultiplexing447
8.7.4Space–timecoding448
8.7.5Transmitbeamforming451
8.8Furtherreading451
8.9Problems453

AppendixAProbability，randomvariables，andrandomprocesses474
A.1Basicprobability474
A.2Randomvariables475
A.3Randomprocesses478
A.3.1WidesensestationaryrandomprocessesthroughLTIsystems478
A.3.2Discrete-timerandomprocesses479
A.4Furtherreading481
AppendixBTheChernoffbound482
AppendixCJensensinequality485
References488
Index495