可变速率声码器的性能研究

主要介绍了Q4401可变速率声码器的工作原理和各种功能，PCM接口和CPU接口、初始化过程及命令格式等，并设计了一种典型的应用实例。实验证明该声码器将语音信号压缩至4-9.6kbit/s范围时，可达到普通电话的通话效果。     

低速率语音编解码声码器的实现

基于编码速率600bps的SELP语音算法，提出一种新的语音编解码芯片,电路设计时满足算法复杂度高、运算量大的需求，从而使声码器在极低的速率下更高效地工作，获得更好的语音重建质量．同时，声码器在设计时采用了可重构的思想，对于其他定点语音算法，只需要将算法程序注入到程序存储区就能实现多种算法在同一款芯片的重构。     

2.4kbps混合激励LPC声码器算法及其实现

2.4kbps LPC声码器在窄带数字保密通信、卫星VSAT及ISDN中均有广泛的应用前景。传统的LPC声码器可以合成较高可懂度和一定自然度的话音,但其质量尚不令人满意。其主要原因是采用了过于简化的二元激励模型。本文从提高LPC声码器的质量出发,研究了采用混合激励的LPC声码器算法——M—LPC算法。与传统LPC的算法相比,M—LPC算法在激励源、基音检测及合成等方面都作了改进。计算机模拟结果表明,M—LPC算法可合成高质量的话音。本算法已采用TMS 320C25实时实现。主观试听结果表明,2.4kbps M-LPC声码器的质量令人满意。     

高质量多速率声码器研制成功

声码器是实现语音信号数字化存储和传输的关键部件,降低编码速率和提高话音质量是声码器研究的目标。目前,16kbit/s以上速率的声码器质量已达到长话质量,当前声码器的研究重点是8kbit/s以下高质量、低速率、短时延的多速率声码器,以满足多种应用场合的需要。一种采用CS-ACELP、ACELP、CELP、MELP、IMBE等多种先进的语音编码技术,集1.2、2.4、4.8、5.3、6.3、8kbit/s等速率于一体,符合G.729/G.729A/G.729B、G.723.1、美国FIPS等语音编码标准的多速率、多功能、高质量声码器最近由解放军理工大学通信工程学院研制成功。该声码器…     

多带激励语音压缩算法的仿真实现

作者从语音信号的多带激励模型出发，对ＭＢＥ语音压缩算法的原理作了详细的指出了它相对于传统ＬＰＣ等算法的优越性，并在计算机上进行仿真实验，给出了实验结果。作者最后就合成语音的质量，算法复杂度等方面，对ＭＢＥ声码器和部分常用标准语音压缩编码方案作了比较，也指出了今后所要研究的方向。     

一种低码率声码器系统的设计及实现

在简单介绍Ｇ．７２３．１编解码算法及语音编解码协处理器ＣＴ８０２０后,给出了一种低码率声码器系统的硬件和软件设计及实现方法,着重讨论了该应用系统设计中有关语音数据同步传输等问题的主要处理方法。     

2.4 kb/s MELP算法设计

提出了一种新的工作于低极码率下的混合激励线性预测（ＭＥＬＰ）声码器。该声码器结合了线性预测编码（ＬＰＣ）和多带激励编码算法的优点,对算法和量化方案重新进行了设计和改造,其主要特征包括改进的基音检测算法、混合的周期脉冲和随机噪声激励,有效的线性谱频率（ＬＰＦ）参数量化以及激励谱形状表示,非正式主观测试表明,由采用本算法的一个２．４ｋｂ／ｓ编码器所重建的语音质量略优于美国联邦标准４．８ｋｂ／ｓ码激励性     

基于算子的ASIP声码器设计与实现

在数字语音通信的声码器设计中,针对体系结构优化、指令集生成等问题,提出了一种基于算子的ASIP声码器设计方式,对其设计关键技术进行了讨论,并通过一个基于SELP算法的声码器设计实例与仿真结果加以验证,该声码器在20 MHz主频下完成0.6 kbps的SELP算法的平均功耗为200 mW,完成编解码的运算复杂度为12.5 MIPS.     

基于MELPe模型的600 BPS声码器算法设计

在增强型混和激励线性预测(MELPe)模型的基础上,提出了一种高音质的600 bps声码器算法。保持MELPe算法特征的同时,利用帧间参数冗余,进行多帧联合量化;运用基于预测的分级矢量量化(PMSVQ)算法对线谱频率(LSF)参数进行量化。在非正式的主观语音质量测试中,合成语音质量优于传统的LPC10e声码器,接近2 400 bpsMELP标准的合成语音。     

一种短波通信中基于DSP的低速率语音编码技术

介绍了一种应用在短波通信中的码率为1．5Kbps低速率语音编码算法，此算法基于MELP（mixed excitation linearp rediction）混合激励线性预测语音编码算法的声码器模型，并对算法进行改进，降低复杂度和速率，在DSP芯片的硬件系统中实时运行了该算法，最后给出了算法测试仿真结果。     

Characterization of Ordovician carbonate reservoirs, southeastern Saskatchewan, Canada

The discovery of the prolific Ordovician Red River reservoirs in 1995 in southeastern Saskatchewan was the catalyst for extensive exploration activity which resulted in the discovery of more than 15 new Red River pools. The best yields of Red River production to date have been from dolomite reservoirs. Understanding the processes of dolomitization is, therefore, crucial for the prediction of the connectivity, spatial distribution and heterogeneity of dolomite reservoirs.The Red River reservoirs in the Midale area consist of 3～4 thin dolomitized zones, with a total thickness of about 20 m, which occur at the top of the Yeoman Formation. Two types of replacement dolomite were recognized in the Red River reservoir: dolomitized burrow infills and dolomitized host matrix. The spatial distribution of dolomite suggests that burrowing organisms played an important role in facilitating the fluid flow in the backfilled sediments. This resulted in penecontemporaneous dolomitization of burrow infills by normal seawater. The dolomite in the host matrix is interpreted as having occurred at shallow burial by evaporitic seawater during precipitation of Lake Almar anhydrite that immediately overlies the Yeoman Formation. However, the low δ18O values of dolomited burrow infills (-5.9‰～ -7.8‰, PDB) and matrix dolomites (-6.6‰～ -8.1‰, avg. -7.4‰ PDB) compared to the estimated values for the late Ordovician marine dolomite could be attributed to modification and alteration of dolomite at higher temperatures during deeper burial, which could also be responsible for its 87Sr/86Sr ratios (0.7084～0.7088) that are higher than suggested for the late Ordovician seawaters (0.7078～0.7080). The trace amounts of saddle dolomite cement in the Red River carbonates are probably related to "cannibalization" of earlier replacement dolomite during the chemical compaction.     

A computer generator for randomly layered structures

AcomputergeneratorforrandomlylayeredstructuresYUJia shun1,2,HEZhen hua2(1.TheInstituteofGeologicalandNuclearSciences,NewZealand;2.StateKeyLaboratoryofOilandGasReservoirGeologyandExploitation,ChengduUniversityofTechnology,China)Abstract:Analgorithmisintrod…     

海南岛地体及其毗邻陆缘晚中生代—新生代古地磁研究和构造演化

本文叙述了对海南岛及其毗邻大陆边缘白垩纪到第四纪地层岩石进行古地磁研究的全部工作过程。通过分析岩石中剩余磁矢量的磁偏角及磁倾角的变化,提出海南岛白垩纪以来经历的构造演化模式如下:早期伴随顺时针旋转而向南迁移,后期伴随逆时针转动并向北运移。联系该地区及邻区的地质、地球物理资料,对海南岛上述的构造地体运动提出以下认识:北部湾内早期有一拉张作用,主要是该作用使湾内地壳显著伸长减薄,形成北部湾盆地。从而导致了海南岛的早期构造运动,而海南岛后期的构造运动则主要是受南海海底扩张的影响。海南地体运动规律的阐明对于了解北部湾油气盆地的形成演化有重要的理论和实际意义。     

Exciton Seebeck in Molecular Systems

Various applications relevant to the exciton dynamics,such as the organic solar cell,the large-area organic light-emitting diodes and the thermoelectricity,are operating under temperature gradient.The potential abnormal behavior of the exicton dynamics driven by the temperature difference may affect the efficiency and performance of the corresponding devices.In the above situations,the exciton dynamics under temperature difference is mixed with     

Achieving Unusual States of Matter Under High Pressure

The elongation method,originally proposed by Imamura was further developed for many years in our group.As a method towards O(N)with high efficiency and high accuracy for any dimensional systems.This treatment designed for one-dimensional(ID)polymers is now available for three-dimensional(3D)systems,but geometry optimization is now possible only for 1D-systems.As an approach toward post-Hartree-Fock,it was also extended to     

《Chinese Science Bulletin》SUBJECT INDEX TO VOLUME 59(2014)

正~~     

An on-line scaling method for improving scalability of a database cluster

The explosive growth of the Internet and database applications has driven database to be more scalable and available, and able to support on-line scaling without interrupting service. To support more client's queries without downtime and degrading the response time, more nodes have to be scaled up while the database is running. This paper presents the overview of scalable and available database that satisfies the above characteristics. And we propose a novel on-line scaling method. Our method improves the existing on-line scaling method for fast response time and higher throughputs. Our proposed method reduces unnecessary network use, i.e. , we decrease the number of data copy by reusing the backup data. Also, our on-line scaling operation can be processed parallel by selecting adequate nodes as new node. Our performance study shows that our method results in significant reduction in data copy time.     

An improved R-tree based on childnode''s probability

R-Tree is a good structure for spatial searching. But in this indexing structure,either the sequence of nodes in the same level or sequence of traveling these nodes when queries are made is random. Since the possibility that the object appears in different MBR which have the same parents node is different, if we make the subnode who has the most possibility be traveled first, the time cost will be decreased in most of the cases. In some case, the possibility of a point belong to a rectangle will shows direct proportion with the size of the rectangle. But this conclusion is based on an assumption that the objects are symmetrically distributing in the area and this assumption is not always coming into existence. Now we found a more direct parameter to scale the possibility and made a little change on the structure of R-tree, to increase the possibility of founding the satisfying answer in the front sub trees. We names this structure probability based arranged R-tree (PBAR-tree).     

An Index mechanism for multi-scale view in spatial databases

There are numerous geometric objects stored in the spatial databases. An importance function in a spatial database is that users can browse the geometric objects as a map efficiently. Thus the spatial database should display the geometric objects users concern about swiftly onto the display window. This process includes two operations:retrieve data from database and then draw them onto screen. Accordingly, to improve the efficiency, we should try to reduce time of both retrieving object and displaying them. The former can be achieved with the aid of spatial index such as R-tree, the latter require to simplify the objects. Simplification means that objects are shown with sufficient but not with unnecessary detail which depend on the scale of browse. So the major problem is how to retrieve data at different detail level efficiently. This paper introduces the implementation of a multi-scale index in the spatial database SISP (Spatial Information Shared Platform) which is generalized from R-tree. The difference between the generalization and the R-tree lies on two facets: One is that every node and geometric object in the generalization is assigned with a importance value which denote the importance of them, and every vertex in the objects are assigned with a importance value,too. The importance value can be use to decide which data should be retrieve from disk in a query. The other difference is that geometric objects in the generalization are divided into one or more sub-blocks, and vertexes are total ordered by their importance value. With the help of the generalized R-tree, one can easily retrieve data at different detail levels.Some experiments are performed on real-life data to evaluate the performance of solutions that separately use normal spatial index and multi-scale spatial index. The results show that the solution using multi-scale index in SISP is satisfying.     

Integrating GIS Web services based on mediating architecture

The geographic information service is enabled by the advancements in general Web service technology and the focused efforts of the OGC in defining XML-based Web GIS service. Based on these models, this paper addresses the issue of services chaining,the process of combining or pipelining results from several interoperable GIS Web Services to create a customized solution. This paper presents a mediated chaining architecture in which a specific service takes responsibility for performing the process that describes a service chain. We designed the Spatial Information Process Language (SIPL) for dynamic modeling and describing the service chain, also a prototype of the Spatial Information Process Execution Engine (SIPEE) is implemented for executing processes written in SIPL. Discussion of measures to improve the functionality and performance of such system will be included.