并行哈夫曼编码器的硬件设计与实现

文章设计了一种并行编码的哈夫曼硬件编码器，它采用了流水线和并行编码方法，使得在一个时钟周期内可以编码一个字节的数据，在编码时显著降低了工作频率。文章给出了关键部分的实现方案并分析了实验结果。     

几种数据压缩算法的比较

对几种数据压缩算法进行了总结,并针对实验数据表对其压缩率进行了比较。     

MPEG-4视频编码技术及其在多媒体通信中的应用

本文较为详细地介绍了MPEG－4视频编码的主要技术及其功能与特点，并基于此标准提出了一个基于Internet网络的多媒体通信系统的设计方案。     

变长线扫描选择性激光烧结快速成型工艺的质量和效率优势分析

本文分析变长线扫描选择性激光烧结快速成型工艺对点扫描工艺的质量和效率优势.对二者光学系统结构作分析对比,对焦斑和线束上的功率密度作计算对比.变长线扫描系统采用的扫描方式和聚焦元件使线束宽度小且恒定,线束功率密度与点扫描焦斑的相当.变长线扫描选择性激光烧结快速成型工艺的质量优势是明显的,效率比点扫描工艺提高一倍左右.     

用TMS320C6201实现H.263编译码系统

介绍了用TMS320C6201实现视频压缩编码标准H.263的编译码系统,并以编码系统为例,给出其硬件设计及软件的优化处理方法.     

MIMO系统中简单的扩展空时块编码分集技术研究

本文提出一种多输入多输出（MIMO）天线系统中简单的扩展空时块编码（SSTBC）分集技术，采用沃尔什码来区分各天线发送数据子流。采用这种方法，在系统带宽一定时，不降低发送信息速率，同时接收机简单。不同天线的发送信息经过了所有收一发天线对之间的空间子信道，获得了所有路径的部分空间分集增益，仿真结果表明，这种增益的获得不受限于接收分集阶数，并且随发射天线的增加以一定的线性关系增加。     

Learning to Predict Non-Deterministically Generated Strings

In this article we present an algorithm that learns to predict non-deterministically generated strings. The problem of learning to predict non-deterministically generated strings was raised by Dietterich and Michalski (1986). While their objective was to give heuristic techniques that could be used to rapidly and effectively learn to predict a somewhat limited class of strings, our objective is to give an algorithm which, though impractical, is capable of learning to predict a very general class. Our algorithm is meant to provide a general framework within which heuristic techniques can be effectively employed.     

论剪切质量的提高

通过对飞剪剪切长度，精度，剪刃间隙和压板机构等参数的优化，来提高钢板的剪切质量。     

固定化微生物脱除工业酸性废气中H_2S的研究

以H 2软性填料作为氧化亚铁硫杆菌的固定化载体 ,构成了固定床生物反应器。在一定操作条件下 ,考察了固定床生物反应器对Fe2 +的氧化速率 ,最大可达 7.6 7g/ (L·h)。并对固定床生物反应器运行中在载体表面形成的络合物进行了研究 ,X射线衍射证明此络合物为黄钾铁矾 [KFe3(SO4 ) 2 (OH) 6]。     

Linear predictive transform of monochrome images

Digital monochromatic images are encoded using a novel minimum mean square error (MSE) linear predictive transform (LPT) coding formulation. The new formulation is appealing for two important reasons. First, it leads to simple coder implementation with a satisfactory signal-to-noise ratio (SNR). Second, it provides a general theoretical framework from which minimum MSE predictive coding and minimum MSE transform coding arise as special cases. Some specific results of this paper that illustrate the previous ideas are: a simple and generally suboptimum two-dimensional LPT coder operating at 2 bit pixer⁻¹ has approximately one third the complexity of a 4 × 4 Hadamard coder while yielding a better SNR; an optimum 2D LPT coder operating at 2 bit pixer⁻¹ has approximately one sixth the complexity of a 4 × 4 Karhunen-Loeve transform (KLT) coder while yielding a better SNR.