A cost effective, low maintenance generator brake is proposed using recent developments in thick film, metal oxide resistors. The brake has very low resistance, and virtually no inductance, allowing its use &ring a fault to slow a generator’s acceleration. Simulation results using the 39 Bus New England system show that placing brakes at each machine dramatically increases the global stability ...

This paper presents a datapath generator for multiple-FPGA applications. This datapath generator is able to generate complex datapath designs described in HDLs. Our datapath generator uses a novel synthesis and partitioning approach which bridges the gap between RTL/logic synthesis and physical partitioning to fully exploit design structural hierarchy for multipleFPGA implementations. Experimen...

This paper constructs the probability model of the general multi-valued shrinking generator, which takes two-valued key stream shrinking generator and generalized shrinking generator as special cases. It discusses the probability properties of their output sequences, and gets the formulae of the coincidence of the output sequences with the original input sequences in particular. It also analyze...

We propose two stream ciphers based on a non-secure pseudorandom number generator (called the mother generator). The mother generator is here chosen to be the Mersenne Twister (MT), a widely used 32-bit integer generator having 19937 bits of internal state and period 219937 − 1. One proposal is CryptMT, which computes the accumulative product of the output of MT, and use the most significant 8 ...

In this paper we propose a new 32-bit RC4 like keystream generator. The proposed generator produces 32 bits in each iteration and can be implemented in software with reasonable memory requirements. Our experiments show that this generator is 3.2 times faster than original 8-bit RC4. It has a huge internal state and offers higher resistance against state recovery attacks than the original 8-bit ...

The combination generator, first proposed by Wichmann and Hill (1982), is constructed by taking the fractional part of the sum of several random number generators. It is probably one of the most popular random number generators used. Its empirical performance is superior to the classical Lehmer congruential generator. However, its theoretical justification is somewhat primitive. In this paper, ...

Quasi-cyclic (QC) codes form an important generalization of cyclic codes. It is well know that QC codes of length sl with index s over the finite field F are F[y]-submodules of the ring F[x, y]/< x − 1, y − 1 >. The aim of the present paper, is to study QC codes of length sl with index s over the finite field F and find generator polynomials and generator matrix for these codes. To achieve this...

A general functional connective generator is proposed for the Hamacher family in this short study. The connective generator generates a variety of different families in which the original Hamacher family can be observed as a special case. Although the original additive connective generator that was proposed by Dombi is also capable of generating Hamacher norms, we show that there is yet another...

This paper presents the dynamic analysis of load following performances of split-shaft microturbine generator (MTG) and Diesel Generator systems considering P-I type load following and P-I type speed controllers under stand-alone mode of operation. In this paper microturbine system coupled with a synchronous generator (SG) is considered. The dynamic performances of split-shaft MTG and Diesel Ge...

In this paper, we mainly consider quasi-cyclic (QC) codes over finite chain rings. We study module structures and trace representations of QC codes, which lead to some lower bounds on the minimum Hamming distance of QC codes. Moreover, we investigate the structural properties of 1-generator QC codes. Under some conditions, we discuss the enumeration of 1-generator QC codes and describe how to o...