迫零对Turbo码的性能影响

从距离谱的角度对迫零在Turbo码中的作用进行了理论分析。通过仿真，研究了迫零对Turbo码性能的影响。仿真结果表明，Turbo码编码器迫零处理有助于改善Turbo码的性能。     

土坝及土堤干密度检测控制技术

使用进口或国产核子密度仪测定土坝及土堤压实干密度具有操作简便、快速之优点。通过对不同的土质进行了现场核子密度仪与环刀法测定干密度的对比试验后 ,证明核子密度仪在测定土的干密度时 ,用环刀法测定并进行校核是必要和重要的     

The formal-CAFE methodology and model checking patterns in the specification of e-commerce systems

Electronic commerce is an important application that has evolved significantly recently. However, electronic commerce systems are complex and difficult to be correctly designed. Guaranteeing the correctness of an e-commerce system is not an easy task due to the great amount of scenarios where errors occur, many of them very subtle. In this work we presents a methodology that uses formal-method techniques, specifically symbolic model checking, to design electronic commerce applications and to automatically verify them. Also, a model checking pattern hierarchy has been developed—it specifies patterns to construct and verify the formal model of e-commerce systems. We consider this research the first step to the development of a framework, which will integrate the methodology, an e-commerce specification language based on business rules, and a model checker. Adriano Pereira received the B.S. and M.S. degrees in computer science in 2000 and 2002, respectively, and he is currently pursuing the Ph.D. degree in computer science from the Federal University of Minas Gerais, Belo Horizonte, Brazil. His current interests are on performance analysis and modeling of e-business and distributed systems, and formal methods. Mark Song received the B.S., M.S. and Ph.D. degrees in computer science from the Federal University of Minas Gerais, Belo Horizonte, Brazil. His current interests are on distributed systems and formal methods – especially BMC (Bounded Model Checking). Gustavo Franco received the B.S. and M.S. degrees in computer science in 2001 and 2004, respectively, from the Federal University of Minas Gerais, Belo Horizonte, Brazil. His research was on modeling the user behavior of e-business and distributed systems, and formal methods. Actually his current interests are on software engeneering and project management of IT projects.     

Spreading Codes Generator for Wireless CDMA Networks

The prime characteristic of spread spectrum modulated signals is that their bandwidth is greater than the information rate. In this way a redundancy is introduced that allows the severe levels of inteference inherent in the transmission of digital information over radio and satellite links to be overcome. Current spread spectrum applications are primarily in military communications; nevertheless, there is growing interest in this technique for third generation mobile radio networks (UMTS, FPLTS, etc.) with open discussion regarding the practicality of using a multiple access system based on spread spectrum techniques (CDMA). However, in order to support as many users in the same bandwidth as other multiple access techniques such as TDMA or FDMA, it is important how to generate large families of sequences that present low cross-correlation. The aim of this paper is to describe a spreading codes generator that can produce a large number of PN sequences with good properties of auto- and cross-correlation. Moreover, the codes generated shows high unpredictability and good statistical behaviour. This also allows the implementation of some features that are common on military networks such as message privacy (increasingly important in commercial networks) without additional cost. The structure presented shows itself to be advantageous for high speed generation of codes at a low cost, low power consumption (allowing longer life for batteries), small size and simplicity of implementation, essential ingredients for commercial equipment. Another attractive feature is its structural parallelism, useful in VLSI implementations. All of these features render it potentially suitable for the implementation of channel bandwidth sharing systems in future wireless personal communications networks.     

广义准正则格形码距离谱的计算

本文讨论了格形码距离谱的计算问题，定义了度量空间意义下的广义准正则格形码，对具有Ｉｍａｉ与Ｈｉｒａｋａｗａ［２］和Ｕｎｇｅｒｂｏｅｃｋ［３］定义的典型的时不变网格结构的广义准正则格形码，证明了其距离谱可用全零信息序列对应的码字进行计算。在理论上推广了Ｍ．Ｒｏｕａｎｃｅ与Ｄ．Ｊ．Ｃｏｓｔｅｌｏ的结果，解决了非平方欧几里德度量意义下一类ＴＣＭ信号序列的距离谱计算问题     

直接序列扩展频谱中伪码优选研究

本文从最优化理论和工程实际出发，全面分析和完善了直接序列扩展频谱中伪码的数学模型，在此基础上，建立了一种较准确的伪码优选数学模型，并探讨了合适的搜索算法。     

Two new decoding algorithms for Reed-Solomon codes

The subject of decoding Reed-Solomon codes is considered. By reformulating the Berlekamp and Welch key equation and introducing new versions of this key equation, two new decoding algorithms for Reed-Solomon codes will be presented. The two new decoding algorithms are significant for three reasons. Firstly the new equations and algorithms represent a novel approach to the extensively researched problem of decoding Reed-Solomon codes. Secondly the algorithms have algorithmic and implementation complexity comparable to existing decoding algorithms, and as such present a viable solution for decoding Reed-Solomon codes. Thirdly the new ideas presented suggest a direction for future research. The first algorithm uses the extended Euclidean algorithm and is very efficient for a systolic VLSI implementation. The second decoding algorithm presented is similar in nature to the original decoding algorithm of Peterson except that the syndromes do not need to be computed and the remainders are used directly. It has a regular structure and will be efficient for implementation only for correcting a small number of errors. A systolic design for computing the Lagrange interpolation of a polynomial, which is needed for the first decoding algorithm, is also presented.This research was supported by a grant from the Canadian Institute for Telecommunications Research under the NCE program of the Government of Canada     

The minimum squared euclidean distance of multi-h phase codes

The minimum squared Euclidean distance(MSED) of binary multi-h phase codes is presented. The signal segregation degree(SSD) has been put forward to determine MSED of multi-h phase codes. In order to maximize MSED, SSD should be as large as possible. The necessary and sufficient conditions of maximizing SSD are derived. Finally, SSD and the exact formulae for MSED of binary 2-h phase codes are also presented.     

Skeleton chain coding for Chinese characters

The compression of Chinese characters is very important for Chinese office automation and desktop publishing. In this paper, various methods are used to compress 13,051 Chinese characters losslessly by coding their skeleton points. The skeleton points are composed of isolated points and curves. To trace every point in a curve once and consecutively is a NP problem. Therefore, we use contour path following and revisiting algorithms to trace skeleton curves with chain codes. The remaining isolated skeleton points are encoded by an Elias code. Our coding method has a better compression rate than that of conventional skeleton coding.     

数值方法确定地基承载力特征值的探讨

介绍了目前地基承载力的确定方法，研究了数值计算的可行性，并对其数值计算地基承载力的可靠性进行验证，指出应进一步完善确定地基承载力的方法，更好地解决群桩基础承载力的确定问题。