Multicast key distribution schemes based on Stinson-Van Trung designs

The efficiency characteristics of multicast key distribution schemes based on (v, b, r, λ)-designs are investigated. The stability and connectivity of such designs are estimated. These estimates generalize and enhance the well-known estimates for the efficiency characteristics of multicast key distribution schemes based on incomplete block designs. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 100–111, May–June 2007.     

The Horace Method for Error-Correcting Codes

Here we apply the so-called Horace method for zero-dimensional schemes to error-correcting codes on complete intersections. In particular, we obtain sharper estimates on the minimum distance.     

Spread Spectrum PN Code Acquisition Using Hybrid Correlator Architectures

A hybrid correlator architecture is described which combines the serial structure of an active correlator with the parallel structure of a matched filter correlator. The mean PN code acquisition time performance of this hybrid serial-parallel correlator structure is analysed. Results are shown which compare the acquisition performance of the serial, parallel, and serial-parallel structures. The results are for a PN code length of 64 code chips and assumes a Gaussian channel with the receiver detection threshold set to obtain a constant false alarm rate. An enhancement to the serial-parallel acquisition algorithm is also described which can increase the acquisition time performance by about 15% for typical operating conditions. Overall the results demonstrate that the hybrid correlator can provide rapid code acquisition with a limited receiver complexity.     

Diagnostic Data Compression Techniques for Embedded Memories with Built-In Self-Test

A system-on-chip (SOC) usually consists of many memory cores with different sizes and functionality, and they typically represent a significant portion of the SOC and therefore dominate its yield. Diagnostics for yield enhancement of the memory cores thus is a very important issue. In this paper we present two data compression techniques that can be used to speed up the transmission of diagnostic data from the embedded RAM built-in self-test (BIST) circuit that has diagnostic support to the external tester. The proposed syndrome-accumulation approach compresses the faulty-cell address and March syndrome to about 28% of the original size on average under the March-17N diagnostic test algorithm. The key component of the compressor is a novel syndrome-accumulation circuit, which can be realized by a content-addressable memory. Experimental results show that the area overhead is about 0.9% for a 1Mb SRAM with 164 faults. A tree-based compression technique for word-oriented memories is also presented. By using a simplified Huffman coding scheme and partitioning each 256-bit Hamming syndrome into fixed-size symbols, the average compression ratio (size of original data to that of compressed data) is about 10, assuming 16-bit symbols. Also, the additional hardware to implement the tree-based compressor is very small. The proposed compression techniques effectively reduce the memory diagnosis time as well as the tester storage requirement.     

循环加荷条件下饱和砂土液化细观数值模拟

利用离散单元法中的二维颗粒流方法(particle flow code in 2-dimension,PFC2D),通过对双轴数值试样施加循环等幅应变且控制加荷过程中试样体积(面积)不变的方法,模拟了循环加荷条件下饱和砂土的液化特性。在得到试样液化宏观力学响应的同时,分析了液化过程中内部平均接触数的变化规律。进一步研究了应变幅值、围压对数值试样液化特性的影响,并与室内试验规律进行了对比。结果表明,数值模拟能够定性地反映饱和砂土振动液化的一般规律,数值模拟得到的应变幅值、围压对试样抗液化强度的影响规律符合实际砂土室内试验规律。     

电力地理信息系统外业数据采集编码方案的探讨

本文介绍了配电电力地理信息系统外业数据采集编码的方法；其中包括线路编码、点编码、线路分界点编码、变电所的编码、开关的编码方法等。     

BINELOCA 程序与广东岭澳核电站大破口失水事故分析

ＢＩＮＥＬＯＣＡ程序是在吸收国外先进大破口失水事故分析计算机程序的基础上，针对我国现有大破口失水事故分析程序的不足和工程应用方面的问题，采用了一些成熟的、新型的和当今国际公认的瞬态热工水力数学物理模型以及水和蒸汽性质参数计算公式改编而成的大破口失水事故分析程序。通过对广东岭澳核电站大破口失水事故的计算表明，ＢＩＮＥＬＯＣＡ程序计算的结果与法国计算的结果是一致的。     

在线误码监测方法及其性能

本文论述了在数字通信中进行在线误码监测的必要性，介绍了几种在线误码监测方法，并对其监测性能进行了理论分析。     

BCH码在井下漏泄移动数字传输系统中的应用研究

文章首次提出了（１５，５，７）ＢＣＨ码以ＦＥＣ方式用于井下漏泄移动数字传输系统的差错控制技术；分析了其用于井下漏泄移动数字传输系统中的性能指标，给出了用单片机软件实现（１５，５，７）ＢＣＨ码编译码算法的程序框图。     

A singular loop transformation framework based on non-singular matrices

In this paper, we discuss a loop transformation framework that is based on integer non-singular matrices. The transformations included in this framework are called Λ-transformations and include permutation, skewing and reversal, as well as a transformation calledloop scaling. This framework is more general than existing ones; however, it is also more difficult to generate code in our framework. This paper shows how integer lattice theory can be used to generate efficient code. An added advantage of our framework over existing ones is that there is a simple completion algorithm which, given a partial transformation matrix, produces a full transformation matrix that satisfies all dependences. This completion procedure has applications in parallelization and in the generation of code for NUMA machines. This work was supported by the Cornell Theory Center, NSF Presidential Young Investigator award #CCR-8958543. by NSF Grant #CCR-9008526, and by a grant from the Hewlett-Packard Company.