This thesis studies a generalisation of the modal μ-calculus, a modal fixedpoint logic that is an important specification language in formal verification. We define a quantitative generalisation of this logic, meaning that formulae do not just evaluate to true or false anymore but instead to arbitrary real values. First, this logic is evaluated on a quantitative extension of transition systems ...

In a distributed algorithm, multiple processes, or agents, work toward a common goal. More often than not, the actions of some agents are dependent on the previous execution (if not also on the outcome) of the actions of other agents. The resulting interdependencies between the timings of the actions of the various agents give rise to the study of methods for timely coordination of these action...

In recent years there has been much work in improving lattice actions (see e.g. M. Lüscher’s and P. Hasenfratz’ talks at this conference). The idea behind all these attempts is to modify the lattice action with the addition of irrelevant operators in order to reduce lattice artifacts: the aim is to have scaling and finite-size-scaling at small values of the correlation length. Two different app...

Recently, statistical models for the effects of roundoff noise in fixedpoint and floating-point realizations of digital filters have been proposed and verified, and a comparison between these realizations presented. In this paper a structure for implementing digital filters using block-floating-point arithmetic is proposed and a statistical analysis of the effects of roundoff noise is carried o...

When developing production software for fixed-point Engine Control Units (ECUs), it is important to consider the transition from floating-point to fixed-point algorithms. Systems engineers frequently design algorithms in floating-point math, usually double precision. This represents the ideal algorithm behavior without much concern for its final realization in production software and hardware. ...

In this thesis, smoothness of sampled real-world signals is exploited through the application of polynomial predictive filters. The principal reason for employing the polynomial signal model is principally twofold: firstly, assuming that the sampling rate is adequate, all realworld signals exhibit piecewise polynomial-like behavior, and secondly, polynomial-based signal processing is computatio...

CLASS Class Behavioral Intent Define the interface for a hierarchy of classes while deferring the implementation to subclasses. Abstract Class lets subclasses redefine the implementation of an interface while preserving the polymorphism of those classes. Also Known As Liskov Substitution Principle [LW93], Design by Contract [Meyer91], Base Class [Auer95] , Template Class [Woolf97] Motivation Co...

My talk will be a survey of recent results about the quest for a logic capturing polynomial time. In a fundamental study of database query languages, Chandra and Harel [4] first raised the question of whether there exists a logic that captures polynomial time. Actually, Chandra and Harel phrased the question in a somewhat disguised form; the version that we use today goes back to Gurevich [15]....

In this paper we have here in the processor FFT and FFT butterfly structure, reading, writing and execution addresses. Fast Fourier Transform (FFT) coprocessor having a noticeable impact on the performance of communication systems, has been a hot topic of research for many years. FFT function over the complex numbers in a row, also known as butterfly units have to add and multiply. , FFT archit...

In this paper we present a new approach to the semantics of data types, in which the types themselves are incorporated as elements of the domain of data objects. The approach allows types to have subtypes, allows genuinely polymorphic functions, and gives a precise semantics for recursive type definitions (including definitions with parameters). In addition, the approach yields simple and strai...