登录
首页 » Others » Principles of Mobile Communication Third Edition

Principles of Mobile Communication Third Edition

于 2020-12-09 发布
0 152
下载积分: 1 下载次数: 2

代码说明:

Gordon L. Stüber著,为英文原文第三版。其第二版已经翻译成中文,即为移动通信原理(第二版),由电子工业出版社出版,但翻译水平很差。Gordon L. StuberPrinciples of mobileCommunicationThird edition② SpringerGordon L. StuberGeorgia Institute of TechnologyAtlanta gaUSAstuber @ece gatech. eduISBN978-1-4614-0363-0e-ISBN978-1-46140364-7DOI10.1007/978-1-46140364-7Springer New York Dordrecht Heidelberg londonLibrary of Congress Control Number: 2011934683C Springer Science+Business Media, LLC 2002, 2011All rights reserved. This work may not be translated or copied in whole or in part without the writtenpermission of the publisher(Springer Science+ Business Media, LLC, 233 Spring Street, New York,NY 10013, USA), except for brief excerpts in connection with reviews or scholarly analysis. Use inconnection with any form of information storage and retrieval, electronic adaptation, computer softwareor by similar or dissimilar methodology now known or hereafter developed is forbiddenThe use in this publication of trade names, trademarks, service marks, and similar terms, even if they arenot identified as such, is not to be taken as an expression of opinion as to whether or not they are subjectto proprietary rightsPrinted on acid-free paperSpringerispartofSpringerScience+businessMedia(www.springer.com)To Alana, our son nickolasmy father lothar Stuiberand my late mother Beatrice stiiberPrefacePrinciples of Mobile Communication, third edition, is a major revision of thesecond edition. Like its earlier editions, this book provides a mathematicallyrigorous overview of physical layer wireless communications. The basic pedagogicmethodology is to include fully detailed derivations from first principles. The text isintended to provide enough principle material to guide the novice student, whilit the same time having plenty of detailed material to satisfy graduate studentsinclined to pursue research in the area. The book is intended to stress the principlesof wireless communications that are applicable to a wide array of wireless standardsIt is intended to serve as a textbook and reference for graduate students, and a usefulreference for practicing engineersOrganization of the bookChapter 1 begins with an overview that is intended to introduce a broad array ofissues relating to wireless communications. Included is a brief description of theevolution of various wireless standards, the basic concepts of cellular frequencyreuse, the land mobile radio propagation environment, link budgets, and coverageand capacity of cellular radio systemsChapter 2 provides an extensive treatment of radio propagation, since goodunderstanding of the physical wireless channel is essential for the developmentand deployment of wireless systems. The chapter begins with a treatment ofthe narrow-band faded envelope for conventional fixed-to-mobile channels foundin cellular radio systems, mobile-to-mobile channels found in mobile ad henetworks, and multiple-input multiple-output (MIMO) channels where multipleantennas are used at both the transmitter and receiver to achieve high capacity afterconsidering the narrow-band channel, we consider the statistical treatment of wide-band channels. The emulation of wireless channels is essential for the developmentand testing of wireless systems, and the chapter provides a detailed discussion ofchannel simulation techniques. Finally, the chapter concludes with a discussion ofshadowing and path loss models for land mobile radio environmentsPreraceChapter 3 provides a detailed treatment of co-channel interference which is therimary impairment in spectrally efficient cellular frequency reuse systems. Veryoften the receivers in such systems are affected by multiple co-channel interferersand the probability distribution of the total interfering power is considered. Thchapter also considers the link outage performance due to co-channel interferencein a variety of wireless environmentsChapter 4 covers the various types of modulation schemes that are used in mobilecommunication systems along with their spectral characteristics. The chapter beginswith the mathematical representation of bandpass modulated signals, along withNyquist pulse shaping. Later, a large variety of modulation schemes used in wirelesssystems are considered, including both single-carrier and multi-carrier modulation,and both linear and nonlinear modulation techniques This is followed by a treatmentof the power density spectrum of modulated signals. Although quite mathematicalin nature, power spectrum is an important topic, since wireless systems are requiredto operate within a specified out-of-band emission maskChapter 5 discusses the error probability performance of various digital modulation schemes on narrow-band fat fading channels. The performance is evaluatedwith a variety of receiver structures, including coherent detectors, differentialcoherent detectors and noncoherent detectorsChapter 6 includes a treatment of multi-antenna techniques for combatingenvelope fading. The chapter includes a discussion of various diversity combiningtechniques for coherent, differentially coherent, and noncoherent receiver detectionof signals on fading channels with additive white gaussian noise. also consideredis optimal combining which is effective when the primary additive impairment isco-channel interference rather than noise. Finally, the chapter considers the use ofmultiple antennas at the transmitter in the context of classical beam-forming andtransmit diversityChapter 7 provides an extensive treatment of digital signaling on intersymbolinterference(ISI) channels that are typical of broadband land mobile radio systemsThe chapter begins with the characterization of Isi channels and goes on todiscuss techniques for combating ISI based on symbol-by-symbol equalization andsequence estimation. Later, error probability for maximum likelihood sequenceestimation is considered. The chapter concludes with a discussion of co-channeldemodulation for the purpose of mitigating co-channel interference on Isi channelsChapter 8 covers error control coding techniques for wireless systems. Thechapter begins with a discussion of basic block coding including space-time blockcodes Convolutional coding is considered next along with the Viterbi and BCJRalgorithms for decoding convolutional codes, followed by trellis coded modulationThe chapter then provides a detailed discussion on the design and performanceanalysis of convolutional and trellis codes for awgn channels, and interleaved fatfading channels, and fading isi channels. Later, space-time trellis codes are treatedand the chapter concludes with Turbo codinChapter 9 is devoted to spread spectrum techniques The chapter begins with anintroduction to direct sequence and frequency hop spread spectrum. This is followedy a detailed treatment of spreading sequences. Also included is a discussionPrefaceof the effects of tone interference on direct sequence spread spectrum, and theRAKE receiver performance on wide-band channels. The chapter wraps up witha discussion of cdma multiuser detectionChapter 10 is devoted to multi-carrier techniques. It considers the performanceof ofdm on frequency-selective channels and considers the effect of residualISI and problem of residual ISI cancellation. Later, the chapter examines singlecarrier frequency-domain equalization(SC-FDE)techniques. This is followed by atreatment of orthogonal frequency division multiple access (OFDMA)on both theforward and reverse links. The chapter concludes with a discussion of single-carrierfrequency division multiple acceSs (SC-FDMA)Chapter 11 considers frequency planning techniques for cellular systems. Thechapter begins with a discussion of cell sectoring, cell splitting, and reuse partition-ing. Later, the chapter considers radio planning for OFDMa cellular systems. Thisis followed by hierarchical overlay/underlay architectures based on cluster planningFinally, the chapter wraps up with macrodiversity TDMA cellular architecturesChapter 12 considers CDMa considers CDMA cellular systems, consideringtopics such as capacity and power control This is followed by a discussion ofhierarchical macrodiversity CDMa architectures and their performanceChapter 13 is devoted to cellular radio resource management. The chapter beginswith an introduction to basic hard and soft handoff. Later, the chapter considers theimportant problem of link quality evaluation, including signal strength averaging,velocity estimation, and velocity adaptive hard handoff algorithms later, a detailedanalysis of hard and soft handoff is provided. Finally, the chapter wraps up withmethods for estimating received carrier-to-interference plus noise ratio(CINR)The Appendix includes a brief and focused tutorial discussion of probabilityand random processes. A good understanding of the material in the Appendix isessential, since the concepts are widely used throughout the textUSing This Book for InstructionThe book has been developed from a graduate-level course on physical wirelesscommunications that I have taught at Georgia Tech since 1993. Normally, I prefera graduate-level course in digital communications as a prerequisite for this courseHowever, such a prerequisite may be waived to the extent that there is extensivebackground material in each chapter. A course may cover the introductory materialin each chapter and skip the more specialized material. In my own classes, I alwaystry to judge the mathematical level of the students early and adapt accordinglyThe book obviously contains far too much material to be taught in a onesemester course. However, i believe that it can serve as a suitable text in mostsituations through the appropriate instructor selection of background sections. Myown preference for a one semester course is to include the following material inorder: Chap. 1, Chap 2(skipping the more advanced material), and the first twosections of Chap 3. In moving to modulation waveforms in Chap. 4, an instructormay have to treat/assume basic signal-space representation. However, most students

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论


0 个回复

  • 语言实验指导书(实验1 DEBUG基本命令使用 实验2 汇语言序的调试与运行 实验3 顺序结构序设计 实验4 分支序设计 实验5 循环序设计 实验6 子序设计 实验7 中断服务序设计)
    第1部分 实验预备知识1.1 汇编语言程序的上机操作过程1.2 常用DEBUG命令的功能第2部分 汇编语言实验实验1 DEBUG基本命令使用……………………………………………..8实验2 汇编语言程序的调试与运行……………………………………….9实验3 顺序结构程序设计………………………………………………….10实验4 分支程序设计………………………………………………………11实验5 循环程序设计………………………………………………………12实验6 子程序设计…………………………………………………………15实验7 中断服务程序设计………………………………………
    2020-06-26下载
    积分:1
  • 基于LabVIEW虚拟双通道示波器的设计与实现
    介绍一种虚拟双通道示波器的设计与实现过程。 该仪器是基于图形化编程语言 LabVIEW8.6 开发的,具有数据采集、波形显示、数据存储、回放测量、输出打印、网上传送等功能。 试验结果表明,该仪器工作性能稳定,测量精度高,功能可以不断扩展,而且人机友好界面清晰,适合不同层次的人员使用。
    2020-12-03下载
    积分:1
  • LMS,自适应陷波器,自适应RLS自适应算法等5种算法的MATLAB
    利用matlab求线性调频信号的特征,lms算法求滤波后的各种特征参数
    2020-06-26下载
    积分:1
  • PMSM无速度传感器DTC控制
    PMSM无速度传感器DTC控制
    2020-11-30下载
    积分:1
  • 上海大学数据结构试卷及答案
    很好的考试复习资料,内容很多,讲解很细致,而且涉及的也是重点数据结构试卷(一)参考答案选择题2.C3.DC 5. A6,C7.C8,B9.810.B填空题1.(F+!2.0(n),0(n1,4. s->rext=p-7nexl: y>neext=sn, 2e6.m=2了,CBA8.4,1610.n-1、应用题1.链式存储结构略,前序 ABDEL,中序 DBEAC,后序 DEBCA,2.哈夫曼树略,WPL=783.(i8,5,16,19,21,23),(5,16,21,19,18,23)h1012345674.线性探测:链地址法:h2->1人8∧1025322768h4->25->326865.深度:125364,广度:123456,最小生成树T的边集为E={(1,4),(1,3)(3,5,(,如,(.6)}四、算法设计题1.设计判断单链表中结点是否关于中心对称算法typedef struct (int s[100]; int top, y sqstack;int lklistsymmetry(iklist *head)sqstack stack; stack top=-1; Iklist"p;forip=head;pl=O; p=p->next)(stack. op++;stack s[stack top=p->data; 3for(p=head;pl=0;p=p->next)iE (p->data==stack s(stackLop!)stack top=stack top- 1; else return(0);return(1);2.没计链式存储结构上建立一楳二又树的算法。typedef char datatype,typedef struct node (datatype data; struct node *lchild, *rchild; bitreevoid createbitree( bilree*&bt)char ch; scanf("%c, &eif(ch==")(bt=0; return; Jbt=(bitree*)malloc(sizeof(bitree)); bt->data=chreatebitree(bt->lchild); createbitree(bt->rchild);3.设计判断一棵二叉树是否是二义排序树的算法。int minnum=-32768, flag=1typedef struct nodefint key; struct node"Child, *rchild; bitree;yoid inorder ( bitree *bt)if (bt =0)[inorder(bt->child ); if(minnum>bt->key)flag=0; minnum=bt->key, inorder (bt->rchild); h数据结构试卷(二选择题(24分)1.卜面关于线性表的叙述错误的是(D)(A)线性表采用顺序存储必须:用一片连续的存储空间(B)线性表采用链式存儐不必山用一片迕续的存储空闫(C)线性表用链式存便丁插入和删除操作的实现D)线性表釆用顺序存储便亍插入和删除操作的实现设哈大曼树中的叶子结点总数为m,若用二叉链表作为存储结构,则该哈夫曼树中总共有(A界个空指针域,9有叶万为的纸且2(A)2m-1(B)2mC)2m+1妤没顺序循环队列Q0:M1]的头指针和尾指针分别为P和R,头指针F总是指向队头元素的前一位置尾指针R总是指向队尾元的当前位置,则该循环队列中的元素个数为()(A)R-T(B)F-R(C)(R-F+M)%M()(F-R+M)%M√4!设某棵二叉树的中序遍历序列为ABCD,前序遍历序列为CABD,则后序遍历该二叉树得到序列为A(A)BADC(B)BCDA(C CDAB(D) CBDA5.设某完全无向图有n个顶点,则该完全无向图中有(A条边(A)n(n-1)/2(B)n(n-1)(C)n26.设某棵二叉树中有2000个结点,则该二叉树的最小高度为(O)。(C)11D)12设采图中有m个顶点,则该有向图对应的剑趣中有()个表头结点(B)n(D)2n-18.设一组初始记录关键字序列(5,2,6,3,8),以笫一个记录关键字5为基准进行一趟快速排序的结果为(C)。(A)2,3,5;8,6(B)3,2,5,8,6(C)3,2,5:6,8①D)2,3,6,5,8、填空题(24分)1.为了能有效地应用HASH查找技术,必须解决的两个问题是和下面程序段的功能实现数据x进栈,要求在下划线处填上正确的语句typedef struct (int s[ 100]; int top: f sqsiack;void push (sqstack &stack, int x)if( stackop==m-1) printf(“ overflow”)lies9tk二x;“a少+:3.中序遍历二叉排序树所得到的序列是有度序列(填有序或无序铁邀神厅的最间复弟度为1),平均时间复杀度为地D(3设某倮二叉树中度数为0的结点数为N,度数为1的结点数为N,则该二叉树中度数为2的结点数若采用二叉链表作为该二叉树的存储结构,则该二叉树中共有山+41个空指针域6.设某无向各中顶点数和边数分别为n和e,所有顶点的度数之和为d,则e=7.设一缃初始记录关键字序列为(55,63,44,38,75,80,31,56),则利用筛选法建立的初始堆为8.改某无向图G的邻接表为2->1>3又v--1->4->2·从点W开始的深度优先遍历序圳为1,24:切度优先遍历序列为省三、应用题(36分)].设一组初始记录关键字序为(45,80,48,40,22,78),则分别给出第4趟简单选择排序和第4趟直接插入排序后的结果2.设指针变p指向双向链表中结点A,指针变量q指向被插入结点B,要求给出在结点A的后面插入结点B的操作序列(设双向链表中结京的两个指针域分别为11ink和 rlink)a设一组有序的记录关键字序圳为(13,18,24,35,47,50,62,83,90),查找方法用二分查找要求计算出查找关键字62时的比较次数并计算出查找成功时的平均查找长度4设一棵树T中边的集合为联A,B),(A,C,(A,D),(B,E),(C,F,(C,G)},要求用孩子兄弟表示法(二叉链表)表示出该树的存储结构并将该树转化成对应的二叉树5.设有无向图G(如右图所示),要求给出用普里姆算法构造最小生成树所走6过的边的集合。6.设有—组初始记录关键字为(45,80,48,4,2,178,要求构造一楔二(56叉排序树并给出构造过程。四、算法设计题(16分)1.设有一组初始记录关键字序列(K,K2,…,K),要求设计一个算法能够在0(n)的时间复杂度内将线性表划分成两部分,其中左半部分的每个关键字均小于K,右半部分的每个关键字均大于等于K2.设有两个集合A和集合B,要求设计生成集合C=A∩B的算法,其中集合A、B和C用链式存储结构表示数据结构试卷(二)参考答案选择题ltd 2. B5,A7,B8.C二、填空题构造一个好的HASH凼数,确定解决冲突的方法2. stack top+t, stack s[stack top ]=3.有序4.0(n2),0( logan)5.N-1,2N+N6.d/27.(31,38,54,56,75,80,55,638.(1,3,4,2),(14)应用题1.(22,40,45,48,80,78),(40,45,48,80,22,78)2. q>llink=p: g->rlink=p->rlink; p->rlink->link=q; p->rlink=q·3.2,ASL=91*1+2*2+3*4+4*2)=25/94.树的链式存储绪构略,二叉树略E={(1,3),(1,2),(3,5),(5,6),(6,4)}6.略四、算法设计题1.设有组初始记录关键字序列(K1,K2,…,Kn),要求设计一个算法能够在0(n)的时间复杂度内将线性表划分成两部分,其中左半部分的每个关键字均小于K1,右半部分的每个关键字均大于等于KYoid quickpass(int r[, int s, int t)int i=s,j=t, x=r[s]While(inext: p->data=g->data: p->next=g->next: free(q)B)gp->next: g->data=p->data: p->next=g >next free(g):(C)q=p->next: p->next=q->next: free(q)(D)q=p->next: p->data=q->data: free q)4.设有n个待排序的记录关键字,则在堆排序中需要(小个辅助记录单元(A)1(B)n(c)nlogen5.设一组初始关键字记录关键字为(20,15,14,18,21,36,40,10),则以20为基准记录的一趟快速排序结束后的结果为(A)10,15,14,18,20,36,40,21(B)10,15,14,18,20,40,36,2I(C)10,15,14,20,18,40,36,21(D)15,10,14,18,20,36,40,21y/设二叉排序树中有n个结点,则在二叉排序树的平均平均查找长度为)(A)0(1)(B)0(10g2n)((D)O(n2)7.设无向图G中有n个顶点e条边,则其对应的邻接表中的表头结点和表结点的个数分别为(D(B)e,nC)2D)n,28.设某强连通图中有n个顶点,则该强连通图中至少有(C)条边(A)n(n-1)(B)n+1D)n(+19.设有5000个待排序的记录关键字,如果需要用最快的方法选出其中最小的10个记录关键字,则用下列)方法可以达到此目的(A)快速排序(B)堆排序(C)归并排序D)插入排序0下列四种排序中()的空间复杂度最大。(A)插入排序(B)冒泡排序(C)堆排序(D)归并排序二、填空殖(48分,其中最后两小题各6分)数据的物理结构主要包括座不构利和环结堆两种情况设一棵完全:叉树中有500个结点,则该二叉树的深度为4:若用二叉链表作为该完全二叉树的存情结构,则共有55个空指针域3.设输入序列为1、2、3,则经过栈的作用后可以得到种不同的输出序列。4.设有向图G用邻接矩阵An]「m作为存储结构,则该邻接矩阵中第i行上所有元素之和等于顶点i的友,第1列上所有元素之和等于顶点i的入区毕设哈夫曼树中共有n小结点,则该哈夫曼树中有日个度数为1的结点6.没有向图G中有n个顶点e条有向边,所有的顶人度散之和为d则形和d的关系为=e遍历二义排序树中的结点可以得到一个递增的关键字序列(填先序、中序或后序)8.改奁找表中有100个元素,如果川二分法查找方法查找数据元素X,则最多需要比较次就可以断定数据元素K是否在查找表中9.·不论是顺序存储结构的栈还烂链式存储结构的栈:其入饯和出栈榤作的间复柒度均为的10.设有a个结点的完全一义树,如果按照从自上到下、从左到右从1开始顺序编号,则第i个结点的义结点编号为“,右孩子结点的编号为2计11.设一组初始记录关键字为(72,73,71,23,94,16,5),则以记录关键字72为基准的·趟快速排序结果为!2.设有向图G中有向边的集合F=(,,,,key==k)Y七; else if(t->key>k)tt>lchd;lse七飞→YC三、算法设计题(22分设计在单链表中删除值相同的多余结点的算法2.设计-个求结点x在二叉树中的双亲结点算法。数据结构试卷(三)参考答案、选择题B4.A5.A6.B7.D8.C9.B10. D第3小题分析:首先用指针变量q指向结点A的后继结点B,然后将结点B的值复制到结点A中,最后删除结点B第9小题分析;9快速排序、归并排序和插入排序必须等到整个排序结束后才能够求出最小的10个数,而堆排序只需要在初始堆的基础上再进行10次筛选即可,每次筛选的时间复杂度为0(1ogn)。土、填空题1.顺序存储结构、链式存储结构2.9,5013.54.出度,入度6.7.中序8.79.0(1)10.豆/2,2i+111.(5,16,71,23,72,94,73)12.(1,4,3,2)13. j+l, hashtable[i]. key==k14. return(t),t=t-rchild第8小題分析:二分査找的过程可以用一棵二叉树来描述,该二叉树称为二叉判定树。在有序表上进行分查找时的查找长度不超过二叉判定树的高度1+log2n三、算法设计题设计在单链表中删除值相同的多余结点的算法。typedef int datatype;typedef struct node datatype data; struct node *next; lklistvoid delredundant (lklist *&head)Iklist *p,响q,*s;for(p=head; pl=0; p=p->next)tor(q=p>nex s=4;q!=0;if (q->data==p->data)[s->next=q->next; free(q); q=s->next; 1else (s=q, q=q->next; y。2.设计个求结点x在二义树中的双亲结点算法。typedef struct node (datatype data; struct node *Child, *rchild; bitree;bitree*q[20]; int r=0, f=0, flag=0void preorder (bitree * bt, char x)
    2021-05-07下载
    积分:1
  • FDTD学习资料
    关于FDTD算法的讲解和实例,可供大家进行学习使用。
    2020-12-04下载
    积分:1
  • STM32+ch375读取U盘源代码
    STM32+ch375读取U盘源代码,读取U盘的源程序,并且加入了znFAT文件系统。
    2020-12-11下载
    积分:1
  • 全国电子设计大赛电源类学习规划
    全国电子设计大赛电源类学习规划,详细编写了电源类入门和深入学习的知道方向
    2020-12-10下载
    积分:1
  • VISSIM二次开发案例与框架(VBA,C++,MATLAB,Python,Java)
    利用VBA,C++,MATLAB,Python,Java进行VISSIM二次开发。
    2020-11-28下载
    积分:1
  • 完整的热敏打印机控制项目
    完整的热敏打印机控制项目:PCB,BOM,CODE...
    2021-05-06下载
    积分:1
  • 696518资源总数
  • 104852会员总数
  • 8今日下载