DZ221在WCDMA中基带成形滤波器的设计
收藏
资源目录
压缩包内文档预览：(预览前20页/共43页)
编号：511808
类型：共享资源
大小：664.24KB
格式：RAR
上传时间：2015-11-11
上传人：QQ28****1120
认证信息
个人认证
孙**（实名认证）
辽宁
IP属地：辽宁
6
积分
- 关 键 词：
-
毕业设计
- 资源描述：
-
DZ221在WCDMA中基带成形滤波器的设计,毕业设计
- 内容简介：
-
毕 业 设 计 任 务 书 课题名称 在 WCDMA 中基带形成滤波器的 实现 学院 (部 ) 信 息 工 程 学 院 专 业 电 子 信 息 工 程 班 级 24030401 学生姓名 李 玲 玲 学 号 2403040101 3 月 3 日至 6 月 8 日共 14 周 指导教师 (签字 ) 教学院长 (签字 ) 2008 年 1 月 8 日 nts一、 设计内容 课题主要是在 WCDMA（宽带码分多址技术）移动通信系统 中对基带成形滤波技术的特点及实现方法进行研究 ， 要求 掌握其主要特点、应用和结构等理论知识，并应用该技术设计基带成形滤波器；重点 要求研究 FIR 基带成形滤波器设计 ； 内容包括：使用 MATLAB 作为开发平台，使用所学的通信系统和数字信号处理技术，用基带成形滤波技术设计一个在 WCDMA 中基带成形滤波器，并做出 MATLAB 仿真波形图 。 二、设计原始资料 1.相关 WCDMA 移动通信原理和滤波器理论参考资料； 2.MATLAB 的相关背景资料； 3.MATLAB 的工具箱； 4.MATLAB 的函数库。 三、设计完成后提交的文件和图表 1. 计算说明书部分： （ 1）基于 MATLAB 设计基带成形滤波器的几种方法如窗函数法、等波纹切比雪夫逼近法等方法中所涉及的计算推导和幅相频特性仿真分析的 相关说明部分； （ 2）软件设计方案相关说明部分； （ 3）源程序相关说明部分； （ 4） MATLAB 的背景资料的相关说明部分 。 nts2、图纸部分： （ 1） WCDMA 移动通信系统和基带成形滤波器原理框图和结构图； （ 2） 设计所涉及的各种窗函数 频域特性图 ； （ 3） MATLAB 仿真波形图。 四、毕业设计进程安排 序号 设计各阶段名称 日期（教学周） 1 课题调研 3.3-3.16(第 1 2 周 ) 2 方案论证 3.17-3.30(第 3 4 周 ) 3 设计 3.31-4.13(第 5 6 周 ) 4 仿真与验证 4.14-5.4(第 7 9 周 ) 5 结题验收 5.5-5.18(第 10 11 周 ) 6 撰写报告 5.19-6.8(第 12 14 周 ) 五、主要参考资料 1 丁玉美 ,高西全 .数字信号处理 (第二版 )M.西安 :西安电子科技大学出社 ,2004. 2 丁玉美 ,高西全 ,彭学遇 .数字信号处理 M.西安 :西安电子科技大学出社 ,1994. 3 杨述斌 ,李永全 .数字信号处理实验教程 M.武汉 :华中科技大学出版社 ,2007. 4 高西全 ,丁玉美 .数字信号处理 (第二版 )学习指导 M.西安 :西安电子科技大学出版社 ,2004. 5 张平 ,王卫东 ,陶小峰 ,王莹 .WCDMA 移动通信系统 M.北京 :人民邮电出版社 ,2005. nts nts 在 WCDMA中基带成形滤波器的设计 共 13 页 第 1 页 装 订 线 附件（外文翻译） 英文部分 Part 1 Performance analysis of two throughput-based call admission control schemes for 3G WCDMA wireless networks supporting multiservices 1. Introduction 3G and beyond wideband code-division multiple access (WCDMA) wireless networks are expected to provide a diverse range of multimedia services to mobile users with different quality of service (QoS). The Universal Mobile Telecommunication System (UMTS), a WCDMA based system, is required to support a wide range of applications each with its own specific QoS requirements. Four distinct QoS classes are specified: namely, conversational, streaming, interactive and background 1. Each class has its own QoS specifications such as delay and bit error rate (BER). One of the main challenges in 3G and beyond wireless networks is to guarantee QoS requirements while tak-ing into account radio resource limitations. Call admission control is one method to manage radio resources while optimizing the overall network performance 13. There are two main strategies for radio resource allocations in 2G cellular wireless networks known as complete partitioning (CP) and complete sharing (CS) 46. In CP, the available channels or resources are partitioned such that for each call classes only a fixed partition of the resource is available. Therefore, the calls are accepted whenever there are available resources in their corresponding partition, otherwise they are blocked or queued. In CS all the available recourses are open for all calls. In CS, a new user is always o?ered access to the network provided that there are sufficient resources at the time of request, and all traffic classes share the total resources indiscriminately. The main contributions of this paper can be stated as follows. We consider a throughput-based CAC where the relative load estimate as in 1 can be used for call admission decision then we extend two uplink CAC algorithms for operation in 3G WCDMA networks. These adapted CAC schemes are the complete partitioning CAC (CP-CAC) and the queuing priority CAC (QP-CAC). In CP-CAC, each call class has its own queue and resource partition whereas in QP-CAC, each call class has its own queue and all classes share the available resources. Then we develop an analytical model for theQP-CACAC algorithm specified in this study which can be easily used for CP-CAC. More importantly, unlike other studies in 2,3 and 710 the nts 在 WCDMA中基带成形滤波器的设计 共 13 页 第 2 页 装 订 线 analytical model covers the case when each traffic class has different requirements in terms of bandwidth, buffer size, average channel holding time, average time out, and Eb/No requirements. We also develop a simulation tool to test and verify our results. The rest of this paper is organized as follows: Section 2 describes the system model. Section 3 explains the proposed schemes in details while Section 4 presents the performance analysis. Section 5 presents the obtained results, as well as the discussion. Finally, the paper is concluded in Section 6. 2. System model The system under consideration is a 3G and beyond WCDMA cellular network supporting heterogeneous traffic. We only consider a system with homogenous cells. Thus, an equal cell load, same traffic patterns, and symmetric directions of handoff calls are assumed for each cell. The capacity of 3G WCDMA cell is defined in terms of the cell load where the load factor, g, is the instantaneous resource utilization upper bounded by the maximum cell capacity, gmax. Instantaneous values for the cell load g range from 0 to 1. We assume two types of traffic: (1) real-time traffic (RT) (such as voice) which is delay sensitive and (2) non-real-time traffic (NRT) (such as WWW, FTP) which is non-delay sensitive. Each type has two call classes: (1) handoff calls and (2) new calls.Also, each traffic type has its own queue: Q1 and Q2, with finite capacities M, and N, respectively. The requests for both queues are served based on first-in-first-out (FIFO) manner when channels are free. A call class request is placed in its corresponding queue if it cannot be serviced upon its arrival and assigned a resource when available based on its calculated priority. Therefore, the priority is divided into two classes: (1) RT traffic (including new and handoff calls) and (2) NRT traffic (including new and handoff calls).Depending on how this loading limits is controlled and how priority of among queues are sets, we devise QoSaware CAC algorithms for WCDMA based networks where we have the following CAC schemes: (1) the queuing priority CAC (QP-CAC) and (2) the complete partitioning CAC (CP-CAC) with isolated load partition assigned for each class. These CAC schemes are depicted pictorially in Figs. 1 and 2, respectively. The operation of these CAC schemes is detailed in the next section. nts 在 WCDMA中基带成形滤波器的设计 共 13 页 第 3 页 装 订 线 3. Call admission control schemes The developed algorithms attempt to manage resource allocations amongst the different call classes, and to effciently utilize the resources while satisfying the QoS requirements. Similar to studies 3,712, only the uplink direction is considered in this study where it is assumed that whenever the uplink channel is assigned the downlink is established. In addition, the study assumes perfect power control operation where a mobile station (MS) and its home base station (BS) use only the minimum needed power in order to achieve the required performance. The admission control for WCDMA systems first estimates the total current cell loads and the new load increment and then employs them in the decision process of accepting or rejecting new connections. Considering the load on the uplink, the load factor increment kfor a new request k can be estimated as where is the processing gain for the kth MS, Ri is the bit rate associated with the kth MS,and W is the chip rate of the WCDMA system. ek is the bit-energy to noisedensity (Eb/No) figure corresponding to the desired link quality. f is the factor nts 在 WCDMA中基带成形滤波器的设计 共 13 页 第 4 页 装 订 线 accounting for interference from other cells and is defined as the ratio of inter-cell interference to the total interference in the referenced cell, whereas vi is the average traffic activity factor of kth MS. Using the load factor increment definition, the current total load, gc, for such an interference system is the sum of the load factor increments brought by all B active MSs. Therefore, In our systems we will have two different load increment factors for RT and NRT connections. By including these two factors, we will have two types of load increments in our system, namely: 1. for RT traffic 2. for NRT traffic In the next subsection, the QP-CAC and CP-CAC schemes are explained. 3.1 QP-CAC Schemes The QP-CAC schemes model is shown in Fig. 1. In QP-CAC, each call class has its own queue and all classes share the available resources. However when all resources are occupied, the prioritization is implemented using only the queuing techniques where the queued calls with higher priority (i.e., RT in our case) are served first based on FIFO policy.That is, the queued NRT request will be served only when the queue of RT requests is empty. Thus, this scheme guarantees the maximum system utilization and improve the performance of RT calls but severely degrades the performance of NRT calls. The scheme procedures are as follows: when a call request k arrives,it will be admitted by the system if the following criterion is satisfied: Otherwise, the arrived call is queued in its corresponding queue, i.e. depending on its class, if no sufficient resource is available upon its arrival and blocked if its queue is full.When all resources are occupied, then after releasing a resource the next call to be served is the one with highest priority non-empty queue, i.e. the lower class index (RT has the lower index 1). Any call class is deleted from its queue if it exceeds the queuing time limit. As a summarization,the call admission decision procedures of QP-CAC are illustrated in Table 1. nts 在 WCDMA中基带成形滤波器的设计 共 13 页 第 5 页 装 订 线 3.2 CP-CAC Scheme In CP-CAC, the total cell capacity is divided into two parts, one for RT and one for NRT traffic. From the analytical point of view the system behaves like two separate systems that can be analyzed separately. Each call class has its own queue and resource partition as shown in Fig. 2. The CP-CAC can guarantee the resource commitment, and therefore the QoS, to each traffic class, but may underutilize the resources. Because there is no sharing of resources across partition borders, the utilization is expected to be low. This scheme is explained as follows.The cell load is divided into two non overlapping load partitions, Lk (k= 1, 2) (i.e. one partition per traffic class),such that The capacity size or load partition, Lk , of each division is selected based on the traffic characteristics and the predefined QoS requirements of each service class 2. The total current usage load occupied by each connected calls of class k, O k, is defined as, where nk is the number of currently connected class k calls.InCP-CAC,The algorithm procedure is as follows.The arrived class k call is admitted if and only if the current carried load occupied by this class plus the load increment of this arrived call is less or equal than Lk ; i.e. when the following criteria is satisfied: when all loads of class k calls are occupied, then arrival of class k calls is queued in the corresponding buffer if there is space and served using the FIFO policy. Any call is deleted from its queue if it exceeds the queuing time limit. As a summarization, the call admission decision procedures of CP-CAC are illustrated in Table 2. nts 在 WCDMA中基带成形滤波器的设计 共 13 页 第 6 页 装 订 线 Part 2 What is WCDMA WCDMA (Wideband Code Division Multiple Access) is the radio access scheme used for third generation cellular systems that are being rolled out in various parts of the globe. The 3G systems to support wideband services like high-speed Internet access, video and high quality image transmission with the same quality as the fixed networks. In WCDMA systems the CDMA air interface is combined with GSM based networks. The WCDMA standard was evolved through the Third Generation Partnership Project (3GPP) which aims to ensure interoperability between different 3G networks. The standard that has emerged through this partnership project is based on ETSIs Universal Mobile Telecommunication System (UMTS) and is commonly known as UMTS Terrestrial Radio Access (UTRA). The access scheme for UTRA is Direct Sequence Code Division Multiple Access (DS-CDMA). The information is spread over a band of approximately 5 MHz. This wide bandwidth has given rise to the name Wideband CDMA or WCDMA. In WCDMA, there are two different modes of operation possible: TDD: In this duplex method, uplink and downlink transmissions are carried over the same frequency band by using synchronized time intervals. Thus time slots in a physical channel are divided into transmission and reception part. FDD: The uplink and downlink transmissions employ two separated frequency bands for this duplex method. A pair of frequency bands with specified separation is assigned for a connection. Since different regions have different frequency allocation schemes, the capability to operate in either FDD or TDD mode allows for efficient utilization of the available spectrum Key Features of WCDMA nts 在 WCDMA中基带成形滤波器的设计 共 13 页 第 7 页 装 订 线 The key operational features of the WCDMA radio interface are listed below: 1. Support of high data rate transmission: 384 Kbps with wide area coverage, 2 Mbps with local coverage. 2. High service flexibility: support of multiple parallel variable rate services on each connection. 3. Both Frequency Division Duplex (FDD) and Time Division Duplex (TDD). 4. Built in support for future capacity and coverage enhancing technologies like adaptive antennas, advanced receiver structures and transmitter diversity. 5. Support of inter frequency hand over and hand over to other systems, including hand over to GSM. 6. Efficient packet access. nts 在 WCDMA中基带成形滤波器的设计 共 13 页 第 8 页 装 订 线 中文部分 1 关于 3G 的 WCDMA 无线网络支持服务的两种基于生产能力的呼叫允许控制方案的技术性能分析 1.绪论 3G 和基于宽带码分多址 (WCDMA)的无线网络被认为是向需要不同质量服务的手机用户提供一种多媒体的变化范围 . 普遍使用基于 WCDMA 系统的移动通讯系统是必须要支持宽范围的每个都有其自己的独特 QoS 要求的应用 . 可以划为四个清楚的等级 :即会话、流动、交互和背景 1。每个等级都有其各自的 QoS 规范，如延迟和比特错 误率（ BER）。 3G 中一个主要的挑战和基于无线网络的是保证考虑无线电通讯源限制时的 QoS 要求。呼叫允许控制是一种最优化网络全部工作特性 13的经营无线电通讯源的方法。 对在 2G 蜂窝无线网络中无线电通讯源分配有两种主要的策略，它们被称为完整分割（ CP）和完整分享（ CS） 4-6。对于 CP，有用的通道或者办法是为每一个呼叫类别分开，只有一个固定的源的分开是有用的。因此，只要在他们相应的部分有可利用的资源，那么呼叫是被接受的，否则他们会被封锁或者等待。在 CS 中，所有可利用的资源对于呼叫是敞开的。在 CS 中，一 个新的使用者总能有权使用网络 ,这种网络在请求时有着充足的资源， 并且所有交通类不加区别地分享总资源 。本文的主要贡献陈述如下： 我们考虑相对装载估计的基于生产量的 CAC 1可以为电话入场决定使用我们然后扩大二对空通讯 CAC 运算法则以操作 在 3G WCDMA 的 网络。这些 适合的CAC 计划是完全分成的 CAC (CP-CAC)和排队的优先权 CAC (QP- CAC)。 在CP-CAC，每电话类使得它自己的队列和资源分开，而在 QP-CAC，每电话类使得它自己的队列和所有类分享可利用资源 . 然后我们为 QP-CACAC 开发了 一个分析模型特别地用于这次研究 ,这也可以被 CP-CAC 容易的使用。 更加重要地，不同于对 2,3和 7 10的研究 ,当每交通类对带宽，缓冲区大小，平均信道宽度，平均时间和 Eb/No要求有不同的要求时 , 分析模型包括案件。 我们也开发了测试和核实我们的结果的模拟工具。 本文其余部分内容如下： 第 2 部分描述系统模式。 第 3 部分在细节上解释被提出的方案 ,而第四部分列出技术性能分析 .第 5 部分提出获得的结果，并且讨论。 最后在第六部分进行总结。 nts 在 WCDMA中基带成形滤波器的设计 共 13 页 第 9 页 装 订 线 2. 系统模式 被研究的系统是一个 3G 的，且是基于 WCDMA 蜂窝网 络支持的异类的通信量。我们 只 考虑 相同的蜂窝 系统。 因此，为每个蜂窝假定相等的细胞装载，相同的通信图案和蜂窝传递的均衡方向。 3G WCDMA 蜂窝 容量被定义 为 g,根据 细胞装载负载因数 ，是在最大蜂窝容量中的资源利用的瞬时最大值 gmax。蜂窝负载 g 的瞬时值的范围是从 0 到 1。 我们假设两种通信量 ： (1)是延迟 敏锐 的实时 通信量 (RT) (例如声音 )和 (2)非实时的交通 (NRT) (例如 WWW， FTP)这些 是非延迟敏感 的 。每个类型 都有 二 个 电话类： (1)手动断路电话和(2)新的电话。 同样 ，每个交通类型有它自己的队列 ： Q1 和 Q2， 分别有有限 容量 M和 N。 要求 所有 队列服务根据先入先出的 (FIFO) 方式 ， 这是信道 是 免费 的。当可利用的根据 其适当 的优先权 时 ，如果它不可能是服务 于 它的到来和分配资源，电话类请求是在它对应的队列的 放置 。所以，优先权 被分为两类 ： (1) RT 交通 (包括新的 和 手动断路电话 )和 (2) NRT 交通 (包括新的 和 手动断路电话 )。 根据这负债极限怎样是受控和在队列之中优先权是 怎样 集合，我们 为基于网络的WCDMA构想 QoSaware CAC 算法 ，这里 我们有以下 CAC 计划： (1)排队的 优先 CAC (QP-CAC)和 (2)完全分成的 CAC (CP-CAC)与为分配的被隔绝的装载分开 的每个 类别 。这些 CAC 计划 表示如下图 Figs. 1 和 2。 这些 CAC 的操作 计划 在下个部分详述。 nts 在 WCDMA中基带成形滤波器的设计 共 13 页 第 10 页 装 订 线 3. 电话允许控制方案 当满足 QoS 的要求时，开发出的算法尝试处理资源在不同的电话类之中的分配和有效地运用资源。类似研究 3,7 12，仅对空通讯方向在被假设的这项研究中被考虑，这里我们假设无论何时上行线通道被认为是在下行线是已经确定的。另外，研究假设完善的力量操作控制，这里一个流动驻地 (MS)和它总基地 (BS)使用仅仅所需要的最小 的力量来达到要求的性能。首先 WCDMA 系统估计允许控制总当前蜂窝网装载和新的装载增加，然后在接受或拒绝新的连接的决定性过程中使用他们。就在的上行线的装载而论，一个新的请求的 k 负载因数增加k可作如下估计 这里 是 kth MS 的过程增益， Ri 是关系到 kth MS 的比特率，而 W 是WCDMA 系统的破碎率。 ek 是与期望连接性能相符的噪声指数的比特能量。 f 是用来解释来自其他蜂窝网的干扰的因素，它被定义为作为相邻蜂窝干涉对相关蜂窝总干涉的比率，而 vi 是 kth MS 平均通信量活动因素。 使用负荷因素增量的定义，目前的总负荷，气相色谱法，对于这样一个干扰系统，是 有所有 B的活动的 MS带来的 负荷因素递增。因此， 在我们的系统中，我们将有两种不同的荷载增量因素 ： RT 和 NRT 连接。由包括这两个因素，在 系统中，我们 将有两种类型的负荷递 增，即： 1. RT： 2.NRT： 在 下个分部， QP-CAC 和 CP-CAC 方案将被介绍 。 3.1 QP-CAC 计划 该 QP-CAC 计划计划的模型显示在图 1 。在 QP-CAC 计划，每 个 通话阶层都有自己的队 列 和各阶层分享现有的资源。然而，当所有资源都被占领，优先次序 的 实施只用排队技术 ，这里 基于 FIFO 策略将首先服务于具有较高优先的呼叫（ RT 即是这个情况）。这就是说，只有当 RT 要求的队列是空的， NRT 要求的队列将会被服务 。因此，这个计划 保证最大限度的系统利用率和性能的改善但严重恶化的
- 温馨提示:
1: 本站所有资源如无特殊说明，都需要本地电脑安装OFFICE2007和PDF阅读器。图纸软件为CAD,CAXA,PROE,UG,SolidWorks等.压缩文件请下载最新的WinRAR软件解压。
2: 本站的文档不包含任何第三方提供的附件图纸等，如果需要附件，请联系上传者。文件的所有权益归上传用户所有。
3.本站RAR压缩包中若带图纸，网页内容里面会有图纸预览，若没有图纸预览就没有图纸。
4. 未经权益所有人同意不得将文件中的内容挪作商业或盈利用途。
5. 人人文库网仅提供信息存储空间，仅对用户上传内容的表现方式做保护处理，对用户上传分享的文档内容本身不做任何修改或编辑，并不能对任何下载内容负责。
6. 下载文件中如有侵权或不适当内容，请与我们联系，我们立即纠正。
7. 本站不保证下载资源的准确性、安全性和完整性, 同时也不承担用户因使用这些下载资源对自己和他人造成任何形式的伤害或损失。
人人文库网所有资源均是用户自行上传分享，仅供网友学习交流，未经上传用户书面授权，请勿作他用。
川公网安备: 51019002004831号