一种基于跳数和时延的MPLS自适应流量工程算法

提出了一种基于跳数和时延的MPLS自适应流量工程算法，该算法根据LSP的跳数和时延来进行流量分配，从而减少由传统路由算法而引起的网络拥塞，优化网络资源的利用。仿真结果表明，该算法简单易行，性能良好。     

基于单程建路的高效快速双向标签交换路径生成算法

双向标签交换路径(LSP)是多协议标签传输应用(MPLS-TP)网络技术的重要组成部分,但现有的双向LSP生成算法因双程建路而在控制开销和用时方面导致冗余。为此,该文提出一种基于单程建路的高效双向LSP生成算法(EAEBL),在保障建路效果的前提下,通过控制消息的一次单程正向传递完成双向LSP的生成,从而减少建立双向LSP的控制开销和用时而且能够加快启动数据分组的传递。理论分析验证了EAEBL算法的有效性,仿真结果显示:与现有的4种双向LSP生成算法相比,EAEBL算法的建路控制开销和用时分别减少了14.7%和50%以上,数据分组在源LSR的等待时间则被减至趋近于0。     

基于压缩感知的线谱对参数降维量化算法

为实现高质量的极低速语音编码,提出一种基于压缩感知理论的线谱对(LSP)参数降维量化算法。编码端利用压缩感知理论对超帧LSP高维矢量进行降维处理,将原始LSP参数投影到低维空间,得到低维测量值,然后采用分裂矢量量化算法对测量值进行量化;解码端以量化后的测量值为已知条件,利用正交匹配追踪算法重构出原始LSP高维矢量。实验结果表明,本算法相对低速语音编码中的矩阵量化方案,平均谱失真降低了0.23dB,相对基于DCT变换的降维量化方案,平均谱失真降低了0.13dB。这种先降维再量化的思想可以大幅减少编码所需的比特数及码本存储复杂度,有效降低语音编码速率,并且合成语音可懂度、自然度较高,音质虽有所失真,但基本上感觉不到明显的听觉质量下降。      

一种自适应线谱对滤波器的终点误差LMS算法及其学习特性

本文提出了一种计算线谱对（LSP）系数的新算法．该算法以最小均方（LMS）误差型算法为基础，梯度计算使用系统终点误差。对接收到的语音观测样本在一个时序的基础进行迭代更新计算，直接产生LSP系数，形成一个LMS算法的自适应LSP滤波器。实验结果表明，该算法与其它自适应滤器的LMS算法比较，具有更高的收敛率和较低的失调。     

结合牛顿-拉夫森函数计算语音线谱对参数的高效算法

提出了计算语音信号线谱对（LSP）参数的高效算法NRSPF。首先利用牛顿法-拉夫森函数及斯蒂芬森加速求高阶非线性方程的一个实根,再使用多项式综合除法降阶,最后采用费拉里算法求其余的根,即得LSP参数。通过TI-DSP平台的实例研究表明,NRSPF算法与APF算法相比,迭代次数减少、收敛速度加快,计算量小,并且在精度提高10倍、100倍和1000倍情况下,APF算法可能出现被零除错误和死循环,而NRSPF算法不仅避免了该错误,而且迭代次数增加很少,收敛速度仍然很快,得到更精确的结果。本文提出的算法高效、可靠、实时性强,可应用于超低码率语音实时通信系统、语音编解码器等。      

IP over WDM网中的综合选路算法

研究了IP over WDM网中,当节点不具备波长变换能力并且配备有限光收发器对时,如何利用综合选路(IR)算法为到达业务请求建立标签交换路径(LSP)。提出一种新颖的辅助图模型(AGM)表示网络的当前状态,基于AGM提出一种动态IR算法-最小光收发器对法(MTA)。MTA总是选择占用光收发器对最少的通路来建立LSP,仿真结果表明：与已有算法相比,MTA可以降低全网的阻塞率,从而提高业务通过率,并且有利于减少业务连接所经光／电变换的次数。     

基于准KLT域的线谱对参数压缩感知量化研究

用尽可能少的比特数实现线谱对(LSP)参数透明量化一直是语音编码领域的研究热点。该文基于压缩感知理论,研究了LSP参数在准KLT域的稀疏性,并设计了LSP参数先压缩感知再矢量量化的方案。编码端,利用压缩感知理论,在准KLT域将原始LSP参数投影到低维空间,得到低维测量值,而后采用分裂矢量量化算法对测量值进行量化;解码端,以量化后的测量值为已知条件,利用正交匹配追踪算法重构出原始LSP高维矢量,重构值作为最终量化值。实验结果表明,算法在适当的码本存储量和搜索复杂度下,达到透明量化效果所需的比特数最优时仅需5 bit/帧。     

利用局域子空间投影提高子空间类DOA 估计算法的谱分辨力

本文提出一种新的用于子空间类DOA估计算法的阵列协方差矩阵噪声子空间投影矢量的选取方法——局域子空间投影(LSP).该投影矢量选取方法有利于压低真实信源方位附近,非信源方位对应的谱曲线高度,从而提高子空间类高分辨DOA估计算法的分辨力.LSP算法的估计偏差和信噪比分辨门限明显低于MUSIC算法,而估计方差几乎与MUSIC相同.计算机仿真结果证明了文中对LSP算法性能理论分析的正确性和LSP算法的有效性.     

流量工程中静态路由算法的研究

该文提出了一种应用于流量工程环境中的静态路由算法。考虑当前的网络资源情况,分优先级别在网络中计算并配置标记交换路径(Label Switched Path,LSP),当某一优先级有多条 LSP需要并行配置时,利用遗传算法搜索最优或较优的配置方案,使得网络的链路带宽使用率低于管理员定义的某个限定值,达到合理分布资源的目的。此外,提出了一种改进的 Dijkstra 算法计算 LSP的最短路径。     

改进动态帧时隙ALOHA算法

ALOHA型算法是一种防碰撞算法,适用于标签数目较少的情况。当标签数目逐渐增大时,通常需要指数倍增长的时隙数才能识别出这些标签。文中提出了一种改进的动态帧时隙ALOHA算法,它首先估计未被识别的标签数,然后调整相应帧长,从而获得最佳系统效率。仿真结果显示,当标签数为500时,文中所提出算法较传统算法的系统时延减少为原来的1／2。     

IP/MPLS over WDM网中的动态选路和波长分配算法

该文研究了IP/MPLS over WDM网中,利用综合路由法为到达的业务流建立标签交换路径(LSP)时,如何选择是在WDM层为它新建一条光路,还是利用现有的逻辑IP链路来满足其要求,提出一种带宽碎片消除的策略,该策略在决定是否利用逻辑IP链路来建立LSP时,总是尽量减少造成带宽碎片,从而可以有效提高全网的资源利用率,仿真结果表明带宽碎片消除策略可以进一步改善综合路由算法的性能。     

A NEW ALGORITHM FOR ADAPTIVE LATTICE FILTERAND ITS APPLICATION IN THE SPEECH LINEARPREDICTIVE SYNTHESIS

In this paper, an adaptive line spectral pair filter is derived from an adaptive lattice filter. A least-mean-square(LMS) type adaptive algorithm used to calculate directly the line spectral pair(LSP) coefficients on a stage-by-stage basis is presented. Experimental results show that the algorithm has higher convergence rate and lower misadjustment as compared with the other algorithms. The LSP coefficients calculated by the algorithm have been used to carry out speech linear predictive synthesis, resulting in better results than PARCOR coefficients.     

基于改进BP神经网络的数字识别

针对BP(Back Propagation)神经网络易陷入局部极小、收敛速度慢的缺点,提出了一种新的BP神经网络改进算法.与标准BP算法比较,该系统通过结合附加动量法和自适应学习速率形成新的BP改进算法.附加动量法虽然可以使BP算法避免陷入局部极小,但是对初始值的选取比较敏感,而且选取合适的学习速率比较困难.而自适应学...     

M_CSPF: A Scalable CSPF Routing Scheme with Multiple QoS Constraints for MPLS Traffic Engineering

In the context of multi‐protocol label switching (MPLS) traffic engineering, this paper proposes a scalable constraint‐based shortest path first (CSPF) routing algorithm with multiple QoS metrics. This algorithm, called the multiple constraint‐based shortest path first (M_CSPF) algorithm, provides an optimal route for setting up a label switched path (LSP) that meets bandwidth and end‐to‐end delay constraints. In order to maximize the LSP accommodation probability, we propose a link weight computation algorithm to assign the link weight while taking into account the future traffic load and link interference and adopting the concept of a critical link from the minimum interference routing algorithm. In addition, we propose a bounded order assignment algorithm (BOAA) that assigns the appropriate order to the node and link, taking into account the delay constraint and hop count. In particular, BOAA is designed to achieve fast LSP route computation by pruning any portion of the network topology that exceeds the end‐to‐end delay constraint in the process of traversing the network topology. To clarify the M_CSPF and the existing CSPF routing algorithms, this paper evaluates them from the perspectives of network resource utilization efficiency, end‐to‐end quality, LSP rejection probability, and LSP route computation performance under various network topologies and conditions.     

基于双分类器的自适应单双手手势识别

针对传统卷积神经网络(CNN)中仅有对单手手势语义进行识别的算法和深度学习手势识别算法中CNN的收敛性差和识别精度低的问题,提出了一种基于两个分类器的自适应单双手手势识别算法以对单手和双手进行识别。该算法的核心是联合两个分类器进行单双手手势识别。首先,采用手数分类器对手势进行分割分组预测,将手势识别转化成部分手势图像识别;其次,采用自适应增强卷积神经网络(AE-CNN)进行手势识别,利用自适应模块分析出现识别误差的原因和反馈模式;最后,在迭代次数和识别结果的基础上进行参数更新。实验结果表明,手数分类器进行手势预测分组的正确概率为98.82%,AE-CNN的收敛性优于CNN和CNN+Dropout,对单手手势的识别率高达97.87%,对基于LSP数据集自建的9类单手手势和10类双手手势的整体模型识别率为97.10%,对复杂背景和不同光照强度下手势的平均识别率为94.00%,并且具有一定的鲁棒性。     

A Bandwidth Guaranteed Integrated Routing Algorithm in IP over WDM Optical Networks

In this paper, we have developed an integrated online algorithm for dynamic routing of bandwidth guaranteed label switched paths (LSPs) in IP-over-WDM optical networks. Traditionally, routing at an upper layer (e.g., IP layer) is independent of wavelength routing at the optical layer. Wavelength routing at the optical layer sets up a quasi-static logical topology which is then used at the IP layer for IP routing. The coarse-grain wavelength channels and the pre-determined virtual topologies with respect to some a priori assumed traffic distribution are barriers to efficient resource use and inflexible to changing traffic. We take into account the combined knowledge of resource and topology information at both IP and optical layers. With this added knowledge, an integrated routing approach may extract better network efficiencies, be more robust to changing traffic patterns at the IP layer than schemes that either use dynamic routing information at the IP layer or use a static wavelength topology only. LSP set-up requests are represented in terms of a pair of ingress and egress routers as well as its bandwidth requirement, and arrive one-by-one. There is no a priori knowledge regarding the arrivals and characteristics of future LSP set-up requests. Our proposed algorithm considers not only the importance of critical links, but also their relative importance to routing potential future LSP set-up requests by characterizing their normalized bandwidth contribution to routing future LSP requests with bandwidth requirements. Moreover, link residual bandwidth information that captures the link's capability of routing future LSPs is also incorporated into route calculation. Extensive simulation was conducted to study the performance of our proposed algorithm and to compare it with some existing ones, such as the integrated minimum hop routing algorithm and the maximum open capacity routing algorithm. Simulation results show that our proposed algorithm performs better than both routing algorithms in terms of the number of LSP set-up requests rejected and the total available bandwidth between router pairs.