遗传算法在层次化验证平台中的应用

在当前SOC验证领域中,如何提高验证平台的可靠性和效率是一个迫切需要解决的问题。传统的向量产生方法存在着效率低、覆盖率不高等缺陷。本文介绍了一种基于遗传算法的随机向量产生器。它结合覆盖率驱动技术,能够自动搜索适合于待测模块的测试激励。与传统的向量生成方法相比,基于遗传算法的产生器极大地提高了验证效率,并且减轻了验证工程师的工作,缩短了芯片上市的时间。     

Computerprogramm zur interaktiven Auswertung von 15N-tracerkinetischen Stoffwechselexperimenten

The theoretical concept of the computer program is based on the compartment theory for the 3-pool model using single pulse administration of the tracer. The code estimates the model parameters by means of the non-linear method of least squares fit under steady state conditions. Furthermore the parameters of the protein metabolism are calculated. The program works interactively and allows reading and modifying the experimental ¹⁵N tracer data via terminal and controlling the program.     

圭亚那乔治敦某五星级酒店暖通设计

详细介绍圭亚那乔治敦某五星级酒店空调系统在负荷计算、设备选型、空调系统自控、防排烟设计、LEED认证等设计情况。     

Performance of degree distribution based HARQ scheme for LDPC-coded OFDM system

This article studies the degree distribution property of low density parity check (LDPC) codes by Gaussian approximation (GA) and presents an efficient hybrid automatic repeat quest (HARQ) scheme for LDPC-coded orthogonal frequency division multiplexing (OFDM) system. In the scheme, the important bits with large degrees have high retransmission priorities and are mapped to the sub-carriers with better channel quality indicator (CQI) levels in the OFDM system. The new scheme provides more protection to the bits with large degrees and thus contributes more to the decoding process by offering more transmission power. In this way the system performance would be improved. The statistics and simulation results also prove the new scheme.     

Minihypers and Linear Codes Meeting the Griesmer Bound: Improvements to Results of Hamada, Helleseth and Maekawa

This article improves results of Hamada, Helleseth and Maekawa on minihypers in projective spaces and linear codes meeting the Griesmer bound.In [10,12],it was shown that any -minihyper, with , where , is the disjoint union of points, lines,..., -dimensional subspaces. For q large, we improve on this result by increasing the upper bound on non-square, to non-square, square, , and (4) for square, p prime, p<3, to . In the case q non-square, the conclusion is the same as written above; the minihyper is the disjoint union of subspaces. When q is square however, the minihyper is either the disjoint union of subspaces, or the disjoint union of subspaces and one subgeometry . For the coding-theoretical problem, our results classify the corresponding codes meeting the Griesmer bound.     

Lower Bounds on the State Complexity of Geometric Goppa Codes

We reinterpret the state space dimension equations for geometric Goppa codes. An easy consequence is that if deg then the state complexity of is equal to the Wolf bound. For deg , we use Clifford's theorem to give a simple lower bound on the state complexity of . We then derive two further lower bounds on the state space dimensions of in terms of the gonality sequence of . (The gonality sequence is known for many of the function fields of interest for defining geometric Goppa codes.) One of the gonality bounds uses previous results on the generalised weight hierarchy of and one follows in a straightforward way from first principles; often they are equal. For Hermitian codes both gonality bounds are equal to the DLP lower bound on state space dimensions. We conclude by using these results to calculate the DLP lower bound on state complexity for Hermitian codes.     

Existence of Perfect 4-Deletion-Correcting Codes with Length Six

By a T ^*(2, k, v)-code we mean a perfect4-deletion-correcting code of length 6 over an alphabet of size v, which is capable of correcting anycombination of up to 4 deletions and/or insertions of letters that occur in transmission of codewords. Thethird author (DCC Vol. 23, No. 1) presented a combinatorial construction for such codes and prove thata T ^*(2, 6, v)-code exists for all positive integers v 3 (mod 5), with 12 possible exceptions of v. In this paper, the notion of a directedgroup divisible quasidesign is introduced and used to show that a T ^*(2, 6,v)-code exists for all positive integers v 3 (mod 5), except possiblyfor v {173, 178, 203, 208}. The 12 missing cases for T ^*(2,6, v)-codes with v 3 (mod 5) are also provided, thereby the existenceproblem for T ^*(2, 6, v)-codes is almost complete.     

The structure of linear codes of constant weight

In this paper we determine completely the structure of linear codes over of constant weight. Namely, we determine exactly which modules underlie linear codes of constant weight, and we describe the coordinate functionals involved. The weight functions considered are: Hamming weight, Lee weight, two forms of Euclidean weight, and pre-homogeneous weights. We prove a general uniqueness theorem for virtual linear codes of constant weight. Existence is settled on a case by case basis.

     

Space‐time ring‐TCM codes with CPM based on the decomposed model for transmission over Rayleigh fading channels

Space–time (ST) coding is a proved technique for achieving high data rates in 3G mobile systems that combines coding, modulation and multiple transmitters and receivers. A novel algorithm is proposed for ST ring trellis‐coded modulation (ST‐RTCM) systems with continuous‐phase modulation (CPM) when the channel coefficients are known to the receiver. This algorithm is based on the CPM decomposed model, which exploits the memory properties of this modulation method, resulting in a straightforward implementation of joint ST coding and CPM, which is particularly suitable for ring codes. This new scheme is used to investigate the performance of the delay diversity code with CPM over slow Rayleigh fading channels, in particular with MSK which is one of the most widely used modulation methods of continuous phase. Furthermore, a feedback version of delay diversity allowed by the decomposition is tested in 1REC and 1RC systems. This feedback configuration is seen to provide good results for low signal‐to‐noise ratios. Simulations results are also provided for multilevel ST‐RTCM codes that achieve a higher throughput than MSK‐coded systems. Additionally the serial concatenation of an outer Reed–Solomon code with an ST‐RTCM code is shown, this combination further reduces the error probability and achieves even more reliable communications. Copyright © 2005 John Wiley & Sons, Ltd.     

A New Signature Scheme with Shared Verification

1Introduction Withthedevelopmentofcomputerandnetworkcom municationtechnology,andwiththedifferenceofuser s demands,digitalsignaturetechniquesarebeingexpand edgreatly,fromthesinglesignature,singleverification modetothemulti user sone.Forexample,adocument sy…