复制理论在编码与序列设计中的应用研究

本文对复制理论在编码与扩频序列设计中的应用等问题进行了深入的研究.第二部分简要介绍了信号的复制理论.在第三部分提出了一种新的OVSF码的设计算法,从而在理论上解释了OVSF码的生成过程,即OVSF码可以通过复制信息的变化,利用复制方法得到.在第四部分里,我们利用m序列所具有的移位可加性,提出了一个在不知道本原多项式情况下生成GF(2)上全部n级m序列的算法,丰富了扩频序列设计方法.     

3G中动态OVSF码的分配算法

本文在介绍了OVSF码生成算法及属性的基础上,详细讨论了目前国际上较成熟的几种动态OVSF码分配算法,并对各算法的产生背景及特性进行了比较分析。     

WCDMA系统OVSF码的高效FPGA实现

OVSF码是广泛用于第三代移动通信的信道化码。本文简要介绍了OVSF码的生成原理,提出了一种适用于WCDMA系统的OVSF码产生算法并用FPGA实现之。该方法实现简单,占用极小的系统资源,具有较强的实用价值。     

浅析OVSF码多码分配算法

介绍了现有的两种OVSF多码分配算法,并通过计算机仿真考察了它们在吞吐量、和阻塞率等指标上的性能。仿真结果表明,快速算法和传输所专利算法在吞吐量和阻塞率上的表现一样,但是快速算法更加快速、简单。因此快速算法可广泛应用于以OVSF码作为信道化码的各种DS-CDMA系统中。     

WCDMA系统的信道码分配策略

第三代移动通信系统WCDMA支持多业务、多QoS的传输,能更好地利用信道码的分配策略。3GPPWCD-MA标准采用的正交可变长扩频码(OVSF)支持变速率业务,举例说明了一种可行的信道码动态分配方案。     

OVSF码保留分配算法研究

提出1种为每类呼叫预留资源的信道化码分配算法。将新算法与已有的单一分区法、混合分区法1、混合分区法2等保留算法进行比较,计算机仿真表明,分区借码法在公平性和码阻塞率方面最好,是公平和吞吐量最好的保留算法。该算法简单、有效和公平,可应用于以OVSF码作为信道化码的各种DS-CDMA系统。     

码资源分配对WCDMA配置模型的影响

本文对WCDMA的码资源分配问题进行了研究,计算了NodeB配置模型最少的OVSF码字消耗,并与OVSF码树进行对比分析。由于码资源的限制,部分模型不能实现所要求业务的并发,从而说明了配置模型的码资源不是静态分配而是动态调整,这对工程实施具有一定指导意义。     

TD-SCDMA前向信道OVSF码管理方案

本文通过对OVSF码的产生方法及特性的分析,提出了适用于TD-SCDMA系统前向信道OVSF码的一种动态管理算法.该算法实现简单,能够最大限度地提高系统容量,具有较强的实用价值.     

OVSF码在WCDMA中的应用

随着移动通信技术的发展,多媒体信息的传输是必然的趋势。WCDMA是第三代移动通信IMT 2000中的主流技术,他支持多媒体从低速率到高速率的多种业务。每种业务有不同的地址码,为了防止各种数据业务的干扰,地址码必须具有正交的特性。由于速率不同,而扩频后的带宽是固定的,为了满足信道的传输,就采用了不同长度的正交码(OVSF)。介绍了OVSF码在WCDMA中的使用,并讨论了OVSF码在WCDMA下行链路分配的几种算法,容量门限法更接近实际情形,能有效降低码阻塞率,保证实时传输。     

低重分配概率的OVSF码重分配算法

在采用正交可变长扩频因子(OVSF)码作为信道化码的直接序列扩频码分多址系统中,提出用重分配概率作为重分配算法的一个新的评价指标,重分配概率越小,系统的计算复杂度越低。进而提出一种低重分配概率的、基于空码容量的重分配算法,在解决本次码阻塞的同时,兼顾对未来高数据速率的呼叫的支持能力,减少未来码阻塞发生。仿真证实,重分配概率比已有2种重分配算法都小。     

Scheduling algorithms for shared fiber-delay-line optical packet Switches-part I: the single-stage case

In all-optical packet switching, packets may arrive at an optical switch in an uncoordinated fashion. When contention occurs, fiber delay lines (FDLs) are needed to delay (buffer) the packets that have lost the contention to some future time slots for the desired output ports. There have been several optical-buffered switch architectures and FDL assignment algorithms proposed in the literature. However, most of them either have high implementation complexity or fail to schedule in advance departure time for the delayed packets. This paper studies the packet scheduling algorithms for the single-stage shared-FDL optical packet switch. Three new FDL assignment algorithms are proposed, namely sequential FDL assignment (SEFA), multicell FDL assignment (MUFA), and parallel iterative FDL assignment (PIFA) algorithms for the switch. The proposed algorithms can make FDLs and output-port reservation so as to schedule departure time for packets. Owing to FDL and/or output-port conflicts, the packets that fail to be scheduled are discarded before entering the switch so that they do not occupy any FDL resources. It is shown by simulation that with these algorithms, the optical-buffered switch can achieve a loss rate of /spl sim/10/sup -7/ even at the load of 0.9. These algorithms are extended to the three-stage Clos-Network optical packet switches in the companion paper.     

Network-assisted resource management for wireless data networks

We propose a framework for network-assisted radio resource management in wireless data networks. This type of radio resource management techniques offer implementation and capacity benefits compared to conventional, interference-measurement based, dynamic channel assignment (DCA) algorithms. The basic idea is to use interbase signaling to shift most of the burden of the resource allocation from the air interface to the backbone infrastructure. By exchanging channel assignment as well as other relevant information in real time through the backbone network, each base can calculate the impact of a resource assignment on the system. As a result, rapid interference measurements, which are typically needed to implement DCA schemes, are replaced by a limited amount of path loss measurements and the computation of interference conditions by the base stations. This significantly reduces the measurement and over-the-air signaling requirements, and can also provide an opportunity for a better optimization of the system performance. We focus on two specific algorithms: network-assisted least-interference-based dynamic packet assignment (NA-LI-DPA) and network-assisted dynamic packet assignment with throughput optimization (NA-DPA). NA-LI-DPA closely resembles a least-interference-based dynamic channel assignment algorithm, and NA-DPA attempts to further improve the overall system throughput. The algorithms, as defined, are appropriate for a best-effort data service, where the primary goal is to provide a higher throughput. However, it will be clear from the discussion that it is also feasible to alter the algorithms to optimize performance metrics other than throughput, e.g., to ensure a certain quality of service. We show through simulation that, for a system like enhanced general packet radio service (EGPRS) system, NA-DPA can provide a throughput that is 50% higher than random packet assignment, and 25% higher than that obtained by conventional DCA algorithms     

基于损伤感知的动态RWA算法性能比较研究

从光网络向透明架构的演进和面向业务的发展趋势出发,介绍了损伤感知的RWA问题的相关研究,通过给经典RWA算法增加对损伤效果的考虑,提出了具有损伤感知能力的动态RWA算法(IBest,IFF,IPack)并进行了仿真验证,结果表明在有损伤的环境下具有损伤感知能力的动态RWA算法既能保持经典算法的优势又在阻塞率上具有优于经典算法的性能。     

Scheduling algorithms for shared fiber-delay-line optical packet Switches-part II: the three-stage clos-network case

In all-optical packet switching, packets may arrive at an optical switch in an uncoordinated fashion. To prevent packet loss in the switch, fiber delay lines (FDLs) are used as optical buffers to store optical packets. However, assigning FDLs to the arrival packets to achieve high throughput, low delay, and low loss rate is not a trivial task. In the authors' companion paper, several efficient scheduling algorithms were proposed for single-stage shared-FDL optical packet switches (OPSs). To further enhance the switch's scalability, this work was extended to a multistage case. In this paper, two scheduling algorithms are proposed: 1) sequential FDL assignment and 2) multicell FDL assignment algorithms for a three-stage optical Clos-Network switch (OCNS). The paper shows by simulation that a three-stage OCNS with these FDL assignment algorithms can achieve satisfactory performance.     

Adaptive routing considering the number of available wavelengths in WDM networks

In most existing studies of wavelength-division multiplexing networks, the problems of routing and wavelength assignment are generally treated separately, since it is NP-complete to produce the optimal solutions for the two problems at the same time. The four presented adaptive routing algorithms, however, consider the availability of wavelengths during the routing process. Our algorithms favor paths with the near-maximum number of available wavelengths between two nodes, resulting in improved load balancing. Simulations show that our algorithms reduce call blocking by nearly half when compared with the least-loaded and the k-fixed routing algorithms in some small networks using the first-fit wavelength assignment policy. In addition, simulation and analysis show that the path length of our algorithms is almost the same as those of the other algorithms.     

空战目标威胁排序与目标分配算法

现代空战需要先进的火控计算,目标威胁排序和分配算法是其重要的组成部分。计算了飞机的作战效能,在作战效能的基础上得到目标威胁矩阵。根据目标威胁矩阵,以最大程度地保存自己为目标,建立了目标分配的算法。以一个算例,利用建立的算法模型对某常见的飞机进行了计算,给出了结果,最后讨论了该算法的意义和不足,指出了下一步的工作。     

一种短波跳频网的固定信道分配算法

本文基于顺序包和最大包分配算法，从需求向量为出发点，提出了一种将顺序包与最大包两种算法相结合的固定信道分配方案。研究结果表明，在分配所需要的信道数和对信道连续性的要求方面，该算法与其它算法相比具有优良的效果，并且还可用信道不连续的情形。     

Channel assignment in cellular radio networks

The authors investigate algorithms based on simulated annealing to solve the channel assignment problem for cellular radio networks. The blocking probability of a network is chosen as the optimization criterion. In order to check the quality of the solutions obtained by simulated annealing, they examine some special types of networks which allow an effective calculation of optimal solutions by tailored algorithms. Their investigations show that simulated annealing is a very powerful tool for solving channel assignment problems     

Routing and wavelength assignment of scheduled lightpath demands

We present algorithms that compute the routing and wavelength assignment (RWA) for scheduled lightpath demands in a wavelength-switching mesh network without wavelength conversion functionality. Scheduled lightpath demands are connection demands for which the setup and teardown times are known in advance. We formulate separately the routing problem and the wavelength assignment problem as spatio-temporal combinatorial optimization problems. For the former, we propose a branch and bound algorithm for exact resolution and an alternative tabu search algorithm for approximate resolution. A generalized graph coloring approach is used to solve the wavelength assignment problem. We compared the proposed algorithms to an RWA algorithm that sequentially computes the route and wavelength assignment for the scheduled lightpath demands.     

Asymptotic bounds on the performance of a class of dynamic channelassignment algorithms

Dynamic channel assignment, adapting both to traffic variations as well as to changing mobile locations, is investigated. Several ad hoc schemes of this type have been described in the literature and found to yield interesting performance improvements. However, very little is known about the performance of the optimum assignment schemes. Both upper and lower bounds for the performance of optimum algorithms within the class of reuse-type dynamic channel assignment (DCA) for a simple propagation model are established. The authors focus on the asymptotic performance, i.e., the performance in systems with large traffic loads. As a performance measure, the probability of assignment failure (intracell handoff failure) is used. Results show that the capacity one may expect to achieve with these algorithms in the asymptotic case is just above twice the capacity of a fixed channel allocation scheme