Open Nav

TD-SCDMA动态信道分配技术研究(英文)

以下是资料介绍,如需要完整的请充值下载.
1.无需注册登录,支付后按照提示操作即可获取该资料.
2.资料以网页介绍的为准,下载后不会有水印.仅供学习参考之用.
   帮助中心
资料介绍:

TD-SCDMA动态信道分配技术研究(英文)(任务书,开题报告,论文8000字)
The Dynamic Channel Allocation inTD-SCDMASystem
摘要
在TD-SCDMA系统中,有一个问题,非急救语音服务掉线概率不理想时,我们使用动态分配算法。为了解决这个问题,我们提出了一种新的算法,它被称为保护信道预留队列移动边界动态信道分配。该算法在预留信道的情况下,对非紧急语音服务服务的调用,以保持阻塞概率为服务,引入无患者客户,并结合数据包进行借阅。仿真结果表明,与移动边界算法相比,该算法降低了非紧急话音业务的丢包率,维护了多种业务的阻塞概率,减少了数据包丢失的概率数据业务。
当这项研究开始,TD-SCDMA(时分同步码分多址)仍在研发阶段,但现在,这项技术已被广泛使用。然而,在我国的TD-SCDMA试验期间,从2006年开始,一些干扰问题已经在网络规划和初始化阶段特别受到关注。干扰一直是一个问题,在任何网络和本论文的工作目标都是在有干扰的情况下提高网络覆盖和容量。本文基于TD-SCDMA网络的工作原理及干扰的形成原因,对传统N频技术的网络提出了改进。本文引入的同心圆蜂窝的概念,并加入一个中继网络,使其他用户可以利用蜂窝的边缘。这种整体的方法不仅优化了抗干扰的能力,并且在不增加更多节点基站的前提下增加了网络覆盖。 [资料来源:http://doc163.com]
关键词:TD-SCDMA;可移动边界动态信道分配;不耐烦顾客;信道保留

Abstract
In the TD-SCDMA system, there is a problem that non-emergency voice services probability of dropped call is not ideal when we use the dynamic allocation algorithm. To solve this problem, we propose a new algorithm, which is called protect channel reservation queue movable boundary dynamic channel allocation. This algorithm set aside channels for dropped calls of non-emergency voice services service, in order to keep blocking probability for service, the introduction of no patient customers, combined with the data packet to borrow algorithms. Simulation results show that, comparing to the movable boundary algorithm, the proposed algorithm reduce the drop probability for non-emergency voice services, and maintain a variety of service blocking probability, reducing the packet loss probability data services.
When this research was started, TD-SCDMA (Time Division Synchronous Code Division Multiple Access) was still in the research/development phase, but now, it is used widely. However, during the pre-commercial TD-SCDM trail in China, which started from year 2006, some interference problems have been noticed especially in the network planning and initialization phases. Interference is always an issue in any network and the goal of the work reported in this thesis is to improve network coverage and capacity in the presence of interference. Based on an analysis of TD-SCDMA issues and how network interference arises, this thesis proposes two enhancements to the network in addition to the standard N-frequency technique. These are the introduction of the concentric circle cell concept and the addition of a relay network that makes use of other users at the cell boundary. This overall approach not only optimizes the resilience to interference but increases the network coverage without adding more NodeBaseStation. [版权所有:http://DOC163.com]
Keywords: TD-SCDMA; movable boundary dynamic channel allocation; impatient customers; channel reservation
 

[资料来源:http://www.doc163.com]

TD-SCDMA动态信道分配技术研究(英文)
TD-SCDMA动态信道分配技术研究(英文)


Abstract    II
摘要    III
Chapter 1 Introduction
1.1 Introduction of TD-SCDMA    1
1.2 3G Mobile Networks    3
Chapter 2Radio Access Technique in TD-SCDMA
2.1 The Frame Structure of TD-SCDMA    7
2.2 Combined TDMA/TDD and CDMA operation    8
2.3 Joint Detection in TD-S CDMA    9
2.4 Smart Antennas    10
2.5 Dynamic Channel Allocation    11 [来源:http://www.doc163.com]
2.6 Terminal Synchronisation    12
2.7 N-Frequency in TD-SCDMA    13
2.8 Concentric Circles Cell    14
2.9 Multi-carrier HSDPA in TD-SCDMA    15
2.10 Relay Networks    16
2.11 Summary    18
Chapter 3 A Dynamic Channel Allocationin TD-SCDMA System
3.1 Queue Movable Boundary Dynamic Channel Allocation Algorithms    19
3.2 The Design Ideas of Channel Reservation Movable Boundary Algorithm    20
3.3 Performance Analysis    22
3.3.1 New User Access    22
3.3.2 Loop Detection    23
3.4 Simulation Results and Analysis    23
3.4 Conclusion    29
Abbreviations    30
References    33

[资料来源:http://Doc163.com]

  • 关于资料
    提供的资料属本站所有,真实可靠,确保下载的内容与网页资料介绍一致.
  • 如何下载
    提供下载链接或发送至您的邮箱,资料可重复发送,若未收到请联系客服.
  • 疑难帮助
    下载后提供一定的帮助,收到资料后若有疑难问题,可联系客服提供帮助.
  • 关于服务
    确保下载的资料和介绍一致,如核实与资料介绍不符,可申请售后.
  • 资料仅供参考和学习交流之用,请勿做其他非法用途,转载必究,如有侵犯您的权利或有损您的利益,请联系本站,经查实我们会立即进行修正! 版权所有,严禁转载
    doc163.com Copyright © 2012-2025 苏ICP备2021029856号-4