Two classes of nonlinear feedforward logic (NLFFL) pseudonoise (PN) code generators based on the use of AND and majority logic (ML) gates are compared. Crosscorrelation and code-division multiple-access (CDMA) properties of properly designed NLFFL sequences are found to be comparable with the properties of well-known linear PN codes. It is determined that code design employing ML gates with an ...

Rapid Single Flux Quantum (RSFQ) logic is a promising technology to supersede Complementary metal-oxidesemiconductor (CMOS) in some specialized areas due providing ultra-fast and energy-efficient circuits. To realize large-scale integration design, electronic design automation (EDA) tools for RSFQ are required the divergences type, timing constraints, circuit structure compared with CMOS logic....

In this paper we suggest measures for making the synthesis process more likely to succeed. As a first measure the synthesis task must be made intelligible by making the starting point, the way of reasoning, and criterion for conclusion of the synthesis clear. Secondly, the interactive synthesis process can be supported by a planning ingredient in the system as a way for the system and the user ...

A methodology to optimize handshake circuits is presented. The approach selects clusters of the initial handshake network for which signals representing internal channels within a cluster are hidden. To guarantee asynchronous implementability on the resulting cluster, state encoding is applied using modern structural techniques. The theory of Petri nets is used to identify clusters for which th...

In a recent paper, a method was proposed to accelerate the majority logic decoding of difference set low density parity check codes. This is useful as majority logic decoding can be implemented serially with simple hardware but requires a large decoding time. In this brief, we study the application of a similar technique to a class of Euclidean geometry low density parity check (EGLDPC) codes t...

A dynamic texture (DT) refers to a sequence of images that exhibit temporal regularities and has many applications in computer vision and graphics. Given an exemplar of dynamic texture, it is a dynamic but challenging task to generate new samples with high quality that are perceptually similar to the input exemplar, which is known to be example-based dynamic texture synthesis (EDTS). Numerous a...

A system for the synthesis of singing on the basis of an articulatory speech synthesizer is presented. To enable the synthesis of singing, the speech synthesizer was extended in many respects. Most importantly, a rule-based transformation of a musical score into a gestural score for articulatory gestures was developed. Furthermore, a pitch-dependent articulation of vowels was implemented. The r...

In this paper, we extend the set of library components which are usually considered in architectural synthesis by components with built-in chaining. For such components, the result of some internally computed arithmetic function is made available as an argument to some other function through a local connection. These components can be used to implement chaining in a datapath in a single compone...

In a general bargaining model with a fixed proposer, we show that the agenda setter’s equilibrium payoff is never lower than her payoff in the static model. There is a cutoff level of voter patience such that below the cutoff, the static equilibrium (possibly along with others) obtains; and above the cutoff, all equilibria are in mixed proposal strategies, and the agenda setter does strictly be...

It is shown that the counting function of n Boolean variables can be implemented with the formulae of size O(n3.06) over the basis of all 2-input Boolean functions and of size O(n4.54) over the standard basis. The same bounds follow for the complexity of any threshold symmetric function of n variables and particularly for the majority function. Any bit of the product of binary numbers of length...