OVSF码保留分配算法研究

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

浅析OVSF码多码分配算法

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

针对业务变化的TD-SCDMA信道码分配算法探讨

在三代移动通信TD—SCDMA系统信道的分配是载波、时隙、信道码（扩频码）的分配。本文针对用户使用的业务不断变化的TD—SCDMA系统提出一种新的信道码分配算法，对算法的流程进行详细的描述，并且通过仿真证明新算法在呼叫阻塞率方面强与原有信道码分配算法，对于工程的应用有重要的价值。     

基对称扩展信道极化算法及其在OFDM水声通信系统中的应用

针对水声通信系统中低密度校验 (Low Density Parity Check, LDPC) 码存在的译码复杂度高和译码错误平层问题,设计了基于极化码编码的水声通信系统,并针对水声信道的极化问题提出了新的基对称扩展极化权重 (Polarization Weight, PW)信道极化法。该算法通过PW高阶基计算各个子信道的极化权重,实现了独立于信道状态的信道极化,解决了传统Polar码编码稳健性差和依赖信道状态的问题。理论研究和仿真结果表明,与传统信道极化方法相比,改进的PW方法具有更稳定的信道极化结果。将该方法应用于正交频分复用 (Orthogonal Frequency Division Multiplexing, OFDM) 水声通信系统中,与现有的LDPC编码方法相比,基于改进的PW极化码具有更低的通信误码率和译码复杂度,且不存在译码错误平层。      

WCDMA系统OVSF码的高效FPGA实现

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

一种新的OVSF码快速生成分配算法研究

本文利用复制方法提出一种新的OVSF码复制生成算法,并在此基础上,研究了非可重排和可重排两种情况下的OVSF码快速分配问题.利用复制生成的OVSF码字具有明显的异前置性特点,从而可以提高码字分配效率和减小硬件实现复杂度和降低呼叫阻塞率.     

未知相位信道下 Turbo码编码DPSK信号的联合迭代解调解码

本文提出了未知相位信道下Turbo码编码DPSK信号的联合迭代解调解码算法 .推导了未知相位信道的最大后验概率 (MAP)算法 ,推导表明该MAP算法同样可用前向、后向递推方程来有效实现 .其次 ,采用等效信道的方法将未知相位信道的Turbo码解码问题化为AWGN信道下Turbo码的解码问题 .最后 ,引进了联合迭代解调解码算法 ,可用于Turbo码的解调解码 .模拟表明本文算法可有效用于未知相位信道Turbo码的解码     

高斯信道中直扩信号的扩频码检测方法

本文讨论了在加性高斯信道中DS信号扩频码的识别问题，提出了一种约束条件下最大输出能量(XOE)准则的PN码检测方法，分析了基于随机梯度算法的收敛性及算法的性能。算法的数值仿真结果表明该方法可以很好地检测出高斯信道中直扩信号的扩频码。     

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

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

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

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

A Fast Code-Assignment Strategy for a WCDMA Rotated-OVSF Tree with Code-Locality Capability

In this paper, a new channelization code tree structure, namely an ROVSF (rotated-orthogonal variable spreading factor) code tree, is defined and investigated. Most existing code assignment schemes are investigated on the OVSF (orthogonal variable spreading factor) code tree in WCDMA systems. The main work of this investigation is to exploit and justify the new properties of the ROVSF code tree. We show that the ROVSF code tree offers the same code capability to that of the conventional OVSF code tree, but our ROVSF code tree additionally has the code-locality capability. With the code-locality capability, a fast code-assignment strategy is developed on the ROVSF code tree. Compared to existing code assignment schemes on OVSF code trees, a fast code assignment scheme is developed with lower search costs and a low blocking rate, due to its code-locality capability. Finally, the simulation results illustrate that our proposed scheme on the ROVSF code tree actually has lower search costs and a better blocking rate.This work was supported by the National Science Council of the R.O.C. under grant nos. NSC91-2213-E-194-041 and NSC91-2213-E-194-042.     

Top Down Code Search to Locate An Optimum Code and Reduction in Code Blocking for CDMA Networks

In this paper, a top down code search scheme is proposed that identify an optimum OVSF code for assignment at the base station of CDMA wireless networks. An optimum vacant code is the one whose usage produces least code blocking compared to other eligible codes. This scheme provides least code blocking compared to existing schemes without reassignments. In addition, the codes searched during locating the optimum code are significantly less than other existing schemes. The call establishment delay which is a significant factor for real time applications is directly proportional to the number of searches and should be low. The design is explained for single code, and extended to multi code assignment to improve code blocking. The multi code assignment is done using four ways. The first and second multi code schemes uses minimum and maximum rakes for a fixed rate system. The third scheme called scattered multi code scheme divide the incoming call into rate fractions equal to number of rakes available in the system, and each rate fraction is handled in a similar way in which the new call is handled in single code scheme. The rate fractions may be scattered or grouped in the code tree. The fourth multi code scheme, namely grouped multi code scheme allocates codes to all the fractions as close as possible. This maximizes future higher rate vacant codes availability by leaving a complete sub tree vacant when call using multi code ends.     

Combined code reuse scheme with two‐dimensional OVSF codes assignment algorithm for uplink multi‐user/multi‐rate block spread multi‐cellular CDMA

The two‐dimensional (2D) block spread code division multiple access (CDMA) can avoid the uplink multiple‐access interference with low‐complexity single‐user detection in a slow fading channel and, therefore, is very attractive. In the 2D spreading, orthogonal variable spreading factor (OVSF) is used for spreading; an important problem is how to efficiently assign the limited resource of OVSF codes to users with different data rates, while meeting the requirement of quality of service in a multi‐cell environment. In this paper, it is shown that the code reuse can improve the code reuse efficiency and the proposed code reuse scheme combined with code assignment algorithm can allow flexible multi‐rate uplink transmission. The computer simulation confirms that the proposed code assignment algorithm improves the code reuse efficiency while achieving lower blocking probability than traditional CDMA. Copyright © 2012 John Wiley & Sons, Ltd.     

一种最大化系统用户速率下限的MIMO-MAC有限反馈干扰对齐算法

针对2小区MIMO-MAC中传统有限反馈干扰对齐码字选择方案的不足,本文提出了一种最大化用户速率下界的直接码字选择方案,并结合比特分配算法来减少和速率的损失,同时采用最大信干扰算法译码.不同于传统的基于最小弦距离或对齐度准则来选择码字,本文从最大化用户速率下界的角度来选择的码字;进一步地,在格拉斯曼空间中生成与期望预编码接近的码字集合,在该集合中只需简单的搜索便可找到优化的码字组合,同时实现了低复杂度和次优的全局搜索.仿真实验表明,相对于现有的典型算法,本文算法在提升系统和速率的同时,也提高了系统用户速率的下界.     

极低码率Turbo码及其应用研究

针对极低信噪比条件下的传输,研究了极低码率Turbo码的编译码器结构,仿真分析了其性能。提出了极低码率Turbo码在高带宽容量、复杂信道环境,例如：短波通信、流星余迹通信等系统中的使用方法。比较了极低码率Turbo码与高码率Turbo码加扩频的性能。研究表明,极低码率Turbo码较传统高码率Turbo码有更好的性能,能将自适应调制编码技术向低信噪比环境扩展。     

基于信道编码及空时编码级联的两用户协同分集

传统协同分集通过使网络中各单天线用户共享彼此天线,形成虚拟多天线阵列来实现空间分集,使得体积和功耗受限的网络终端也能获得分集增益,然而这并没有将信道编码和空时编码结合起来以使系统得到编码增益。为了能够获得编码增益来进一步改善系统性能,本文提出了一种基于信道编码和分布式空时分组码级联方式下的两用户协同分集方案,并且在准静态的瑞利衰落信道下对系统误码性能进行了理论推导和系统仿真,给出了误比特率的上限解析表达式。在协同用户间信道存在噪声的情况下,我们分别对CRC-DSTBC和CC-DSTBC级联下的发射方案进行了性能分析和系统仿真。仿真结果表明:即使协同用户间的信道存在噪声,本文所提出的协同分集方案与传统协同分集相比,不但获得了分集增益,同时也得到了编码增益,系统误比特率大大降低,从而显著提高了系统性能,并且这也和理论分析相吻合。     

OVSF code channel assignment with dynamic code set and buffering adjustment for UMTS

The Universal Mobile Telecommunications System (UMTS) provides users variable data rate services, which adopts wide-band code-division multiple-access (WCDMA) as the radio access technology. In WCDMA, orthogonal variable spreading factor (OVSF) codes are assigned to different users to preserve the orthogonality between users' physical channels. The data rate supported by an OVSF code depends on its spreading factor (SF). An OVSF code with smaller SF can support higher data rate services than that with larger SFs. Randomly assigning the OVSF code with a large SF to a user may preclude a larger number of OVSF codes with small SFs, which may cause lots of high data rate call requests to be blocked. Therefore the OVSF code assignment affects the performance of the UMTS network significantly. In this paper, we propose two OVSF code assignment schemes CADPB1 and CADPB2 for UMTS. Both schemes are simple and with low system overhead. The simulation experiments are conducted to evaluate the performances for our schemes. Our study indicates that our proposed schemes outperform previously proposed schemes in terms of the weighted blocking probability and fairness index. Our schemes improve the call acceptance rate by slightly introducing call waiting time.     

一种新的两用户协作分集方案及其性能研究

该文提出了一种基于信道编码和分布式空时分组码级联下的两用户协作分集方案,并且在准静态的瑞利衰落信道下对此方案的系统容量,中断概率以及误比特率进行了理论推导和系统仿真,分别给出了解析表达式和数值结果。通过将信道编码和空时码引入到协作分集中,系统容量得到显著改善,同时中断概率也明显降低。在协作用户间信道存在噪声的情况下,对卷积码与分布式空时分组码级联下的发射方案进行了性能分析和仿真。仿真结果表明:即使协作用户间的信道存在噪声,该文所提方案在各方面都优于传统协作分集,系统容量明显增大,中断概率及误比特率大大降低。     

Evaluation of congestion control protocols for ABR traffic over ATM networks

Congestion control is very important for effective and stable operation of ATM (Asynchronous Transfer Mode) networks. Owing to the bursty and unpredictable characteristic of data network traffic, its congestion control is particularly a challenge for network researchers and designers. The ATM Forum has recently adopted rate‐based congestion control for ABR (Available Bit‐Rate) traffic which is the service class defined for data network applications. However, there is a number of congestion control schemes prevalent. ATM Forum has decided not to specify switch behaviour for ABR traffic; this has further introduced additional ambiguity. Consequently, an evaluation and comparison of the existing protocols would provide valuable guidance for network designers and engineers; it would also give insight for researchers to explore the essence of different congestion control schemes. In the first part of this paper, we investigate the effectiveness of ABR congestion control in the presence of bursty source traffic and the relationship between the burst time scale and the ABR control time scale. Two ABR congestion control schemes, the ABR Explicit Forward Congestion Indication (EFCI) and ABR Congestion Indication (CI) schemes, are compared with Unspecified Bit Rate (UBR) transport which makes no effort to control congestion. Traffic sources of various burst lengths of 100, 1000, 10000, and an equal mix of 100 and 10000 ATM cells are used in simulations. It is found that ABR congestion control schemes effectively control low frequency, medium to long‐term traffic load transients. This is further supported by the result of integrating TCP over ATM congestion control schemes included in the paper. ABR control schemes do not control high frequency, short‐term load transients well, but ABR control is not necessary in such cases since short‐term transients do not require a large amount of buffering. In the second part of this paper, we evaluate and compare six rate‐based congestion control protocols including Scheme I: EFCI, Scheme II: EFCI with separate RM queues, Scheme III: CI, Scheme IV: CI with separate RM queues, Scheme V: the CAPC2 ER (Explicit Rate), and Scheme VI: the EFCI with utilization‐based congestion indication. Each scheme is simulated and compared in the LAN, WAN, and GFC (General Fairness Configuration) environments specified by the ATM Forum. Effects of varying VC (Virtual Circuits) number and changing endsystem–switch distance has been investigated. Their fairness is also compared using the GFC configuration. We have found that ER control scheme performs significantly better than the other five binary control schemes by its faster response to congestion, smoother regulation of bit‐rates, lower queueing delay, shorter buffer queue length, and fairness. Among the other five schemes, the CI scheme performs better than the EFCI scheme. Providing separate RM queues has significantly improved the EFCI scheme in the WAN environment, but has little effect on the CI scheme. Link utilization‐based congestion detection has suffered from either low utilization or an excess cell loss which is unacceptable in most data applications. Copyright © 2000 John Wiley & Sons, Ltd.