Error detection in memory applications 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. For memory applications, this increases the memory access time. The method detects whether a word has errors in the first iter...

1. The Andre'ev (1987) bound: explicit function with size f = ˜ Ω(n 5 2) 2. The relationship between formula size and circuit depth, and how to accomplish " depth reduction " for a general circuit 3. Monotone formulas for monotone functions (example: monotone formula for the majority function MAJ)

Let X be a linearly ordered set of arbitrary size (finite or infinite). Natural functions on such a set one can define using the linear order include maximum, minimum and median functions. While it is clear what the clone generated by the maximum or the minimum looks like, this is not obvious for median functions. We show that every clone on X contains either no median function or all median fu...

In the context of spatial majority voting games, considerable experimental support exists for the core as a solution hypothesis when it is not empty (Berl et al., 1976; Fiorina and Plott, 1978; Isaacs and Plott, 1978). Specifically, these experiments show that if a simple majority voting game possesses a Core point-a point that cannot be defeated by a majority vote-subjects choose outcomes at o...

As feature sizes shrink to deep sub-micron, the performance of VLSI chips becomes dominated by the interconnect delay. In a traditional top-down design ow, logic synthesis algorithms optimize gate area or delay without accurate interconnect delay because of lack of physical design information. Thus, the e ectiveness of the optimization techniques is limited. We integrate logic synthesis and phy...

To evaluate synthesis algorithms, usually benchmark circuits are used. Since for these circuits no exact synthesis results are known, we propose the use of exact minimization to generate hard problem instances. By this we evaluate a standard synthesis tool on different classes of circuits.

This paper attempts to explore a new method to improve the teaching of computer programming for beginners at tertiary level. It begins with a change of approach to teaching and then to a mix of basic theory and practice. It then finds a core language, which simplified the scope of programme design and implementation. Dynamic visualisation technique was used as a supplementary tool in programme ...