一种用局部非线性预测模式实现的语音编码算法

该文提出了一种基于局部非线性模式的语音信号预测模型(LNLP),并将其应用于语音编码中。在同样的算法条件下,LNLP提高了预测增益,改善了合成语音质量,而其算法复杂度与常规算法相比并无显著增加。     

Intelligent Handoff for Mobile Wireless Internet

This paper presents an intelligent mobility management scheme for Mobile Wireless InterNet – MWIN. MWIN is a wireless service networks wherein its core network consisting of Internet routers and its access network can be built from any Internet-capable radio network. Two major standards are currently available for MWIN, i.e., the mobile IP and wireless LAN. Mobile IP solves address mobility problem with the Internet protocol while wireless LAN provides a wireless Internet access in the local area. However, both schemes solve problems independently at different layers, thereby some additional problems occur, e.g., delayed handoff, packet loss, and inefficient routing. This paper identifies these new problems and performs analyses and some real measurements on the handoff within MWIN. Then, a new handoff architecture that extends the features of both mobile IP and wireless LAN handoff mechanism was proposed. This new architecture consists of mobile IP extensions and a modified wireless LAN handoff algorithm. The effect of this enhancement provides a linkage between different layers for preventing packet loss and reducing handoff latency. Finally, some optimization issues regarding network planning and routing are addressed.     

A unified algebraic transformation approach for parallel recursiveand adaptive filtering and SVD algorithms

In this paper, a unified algebraic transformation approach is presented for designing parallel recursive and adaptive digital filters and singular value decomposition (SVD) algorithms. The approach is based on the explorations of some algebraic properties of the target algorithms' representations. Several typical modern digital signal processing examples are presented to illustrate the applications of the technique. They include the cascaded orthogonal recursive digital filter, the Givens rotation-based adaptive inverse QR algorithm for channel equalization, and the QR decomposition-based SVD algorithms. All three examples exhibit similar throughput constraints. There exist long feedback loops in the algorithms' signal flow graph representation, and the critical path is proportional to the size of the problem. Applying the proposed algebraic transformation techniques, parallel architectures are obtained for all three examples. For cascade orthogonal recursive filter, retiming transformation and orthogonal matrix decompositions (or pseudo-commutativity) are applied to obtain parallel filter architectures with critical path of five Givens rotations. For adaptive inverse QR algorithm, the commutativity and associativity of the matrix multiplications are applied to obtain parallel architectures with critical path of either four Givens rotations or three Givens rotations plus two multiply-add operations, whichever turns out to be larger. For SVD algorithms, retiming and associativity of the matrix multiplications are applied to derive parallel architectures with critical path of eight Givens rotations. The critical paths of all parallel architectures are independent of the problem size as compared with being proportional to the problem size in the original sequential algorithms. Parallelism is achieved at the expense of slight increase (or the same for the SVD case) in the algorithms' computational complexity     

Method of high-level technology mapping based on knowledge(rule)

This paper studies the linkage problem between the result of high-level synthesis and back-end technology, presents a method of high-level technology mapping based on knowledge, and studies deeply all of its important links such as knowledge representation, knowledge utility and knowledge acquisition. It includes: (1) present a kind of expanded production about knowledge of circuit structure; (2) present a VHDL-based method to acquire knowledge of technology mapping; (3) provide solution control strategy and algorithm of knowledge utility; (4) present a half-automatic maintenance method, which can find redundance and contradiction of knowledge base; (5) present a practical method to embed the algorithm into knowledge system to decrease complexity of knowledge base. A system has been developed and linked with three kinds of technologies, so verified the work of this paper.     

A skeletonization algorithm based on euclidean distance maps and morphological operators

In this letter a new skeletonization algorithm is proposed. It combines techniques of fast construction of Euclidean Distance Maps(EDMs), ridge extraction, Hit-or-Miss Transformation (HMT) of structuring elements and the set operators. It first produces the EDM image with no more than 4 passes through an image of any kinds, and then the ridge image is extracted by applying a turn-on scheme and performing a rain-fall elimination to accelerate the processing. The one-pixel wide skeleton is finally acquired by carrying out the HMTs of two structure elements and the SUBTRACT and OR operations. Experimental results obtained by practical applications are also presented.     

利用集成光学调制器实现ICF固体激光驱动器中激光脉冲任意整形 Ⅱ.集成光学调制器

本文利用集成光学和光纤技术制作了集成光学调制器,驱动调制器的电压仅为４伏,配之以高稳定的、ＬＤ泵浦的单纵模振荡源和任意整形电脉冲源,大大提高了ＩＣＦ固体激光驱动器前级整形系统对激光脉冲整形的稳定性和灵活性．     

一种用于逐次逼近ADC的高能效高线性度开关电容时序

提出了一种用于逐次逼近模数转换器的高能效高线性度开关电容时序。相较于典型的基于V_CM的开关原理,该开关时序可减少37%的开关能量,并具有更高的线性度。该开关时序已应用于1V,10位300kS/s的SAR ADC,并在0.18μm标准CMOS工艺下成功流片。测试结果表明,在1V电源电压下,此SAR ADC的SNDR为55.48dB,SFDR为66.98dB,功耗为2.13μW,品质因数到达14.66fJ/c-s。DNL和INL分别为0.52/-0.47 LSB和0.72/-0.79 LSB,并且与静态非线性模型一致,最大INL出现在 V_FS/4处和3V_FS/4处。     

日盲单光子紫外探测器的发展

对于诸如高超音速飞行器的早期探测和预警、以及在日盲紫外波段的应用等非常微弱信号的探测来说,可以光子计数的单光子探测器特别令人感兴趣.雪崩光电二极管( APD)具有高速度、高灵敏度和光学增益大等优点.AlGaN合金易于通过改变摩尔组分来选择截止波长.对于在日盲波段实现单光子灵敏度而言,AlGaN APD是最有希望的半导体器件技术.通过对近年来的国内外相关文献资料的归纳分析,介绍了日盲AlGaN探测器的概念,比较了高超音速飞行器的红外与日盲紫外辐射特征,介绍了基于盖革模式与线性模式APD的日盲紫外单光子探测器的发展动态.     

一种新型基于环上带误差学习问题的认证密钥交换方案

利用格上判定带误差学习问题(Ring-DLWE)困难假设,该文基于Peikert的调和技术构造认证密钥交换方案。在标准模型下,该方案是CK模型中可证明安全的,并达到弱前向安全性(wPFS)。与现有的基于LWE的密钥交换方案相比,该方案使用平衡的密钥提取函数,因而保护共享会话密钥,同时因其基于格中困难问题,所以能抵抗量子攻击。     

基于中国剩余定理的门限RSA签名方案的改进

针对基于中国剩余定理的门限RSA签名方案无法签署某些消息,以及部分签名合成阶段运算量大的问题,论文提出一种基于虚拟群成员的改进方法,使得改进后的方案能够签署所有消息,同时能够极大地减少部分签名合成阶段的运算量,当门限值为10时,可以将部分签名合成阶段的运算量减少为原来的1/6。对改进方案进行了详细的安全性和实用性分析。结果表明,改进方案在适应性选择消息攻击下是不可伪造的,且其运算效率较其他门限RSA签名方案更高。