MC@NLO [2, 3] is a generator for calculating next-to-leading order matrix elements, combined with a Monte Carlo event generator. When constructing an MC@NLO one needs to match the NLO matrix element with the parton shower of the generator. If wrongfully done, some of the configurations produced by the real gluon emissions in the matrix element may also be produced by the first branching in the ...

In this letter, we propose an appealing class of nonbinary quasi-cyclic low-density parity-check (QC-LDPC) cycle codes. The parity-check matrix is carefully designed such that the corresponding generator matrix has some nice properties: 1) systematic, 2) quasi-cyclic, and 3) sparse, which allows a parallel encoding with low complexity. Simulation results show that the performance of the propose...

This article presents a comprehensive and efficient modelbased technique on how algorithms can be developed, synthesized, modeled, preverified and implemented on embedded processors platforms which consist of a personal computer and a field programmable gate array (FPGA). To illustrate the proposed technique a new adaptive matrix inversion algorithm is proposed and used. The algorithm is first ...

This paper studies two stochastic bulk arrival and bulk service queueing Models (A) and (B) with k varying environments. The system has infinite storing capacity and the arrival and service sizes are finite valued random variables. Matrix partitioning method is used to study the models. In Model (A) the maximum of the arrival sizes in all environments is greater than the maximum of the service ...

In this paper we investigate the existence, equivalence and some other features of error correcting codes over . KeywordsLinear code, generator matrix, equivalent code.

In this correspondence, the bit-error probability Pb for maximum-likelihood decoding of binary linear block codes is investigated. The contribution Pb(j) of each information bit j to Pb is considered and an upper bound on Pb(j) is derived. For randomly generated codes, it is shown that the conventional approximation at high SNR Pb (dH=N) Ps, where Ps represents the block error probability, hold...

In this paper we identify conditions under which a true generator does or does not exist for an empirically observed Markov transition matrix. We show how to search for valid generators and choose the “correct” one that is the most compatible with bond rating behaviors. We also show how to obtain an approximate generator when a true generator does not exist. We give illustrations using credit r...

This paper provides a detailed analysis that shows how to stabilize the generalized Schur algorithm, which is a fast procedure for the Cholesky factorization of positive-definite struc-tured matrices R that satisfy displacement equations of the form R-FRF T GJGT, where J is a 2 x 2 signature matrix, F is a stable lower-triangular matrix, and G is a generator matrix. In particular, two new schem...