Folds over inductive datatypes are well understood and widely used. In their plain form, they are quite restricted; but many disparate generalisations have been proposed that enjoy similar calculational benefits. There have also been attempts to unify the various generalisations: two prominent such unifications are the ‘recursion schemes from comonads’ of Uustalu, Vene and Pardo, and our own ‘a...

In a companion paper [6] we presented theoretical analysis of an analog network for fixed-point computation. This paper applies these results to several applications from numerical analysis and combinatorial optimization, in particular: 1) solving systems of linear equations; 2) nonlinear programming; 3) dynamic programing; and 4) network flow computations. Schematic circuits are proposed for r...

This article is an introduction to the FRIDGE design environment which supports the design and DSP implementation of fixedpoint digital signal processing systems. We present the tool-supported transformation of signal processing algorithms coded in floating-point ANSI C to a fixed-point representation in SystemC. We introduce the novel approach to control and data flow analysis, which is necess...

We introduce an optimization model of the support vector regression with the group lasso regularization and develop a class of efficient two-step fixed-point proximity algorithms to solve it numerically. To overcome the difficulty brought by the non-differentiability of the group lasso regularization term and the loss function in the proposed model, we characterize its solutions as fixed-points...

Test-program generators play a key role in hardware functional verification of large scale processors. However, in the DSP domain, the usage of full-blown test-program generators is much less popular, mainly due to the limited resources (time and money) available when developing such systems. This paper describes a work-model for the fast, low cost construction of a test-program generator for D...

We introduce a notion of category with feedback-withdelay, closely related to the notion of traced monoidal category, and show that the Circ construction of [15] is the free category with feedback on a symmetric monoidal category. Combining with the Int construction of Joyal et al. [12] we obtain a description of the free compact closed category on a symmetric monoidal category. We thus obtain ...

Online addition and multiplication of streaming data is of prime importance in real time processing of digital signals.The choice of data representation varies from fixedpoint for improved precision and reduced complexity to floatingpoint for increased dynamic range. The bit level granularity of FPGAs permits the choice of standard and nonstandard number representations for hardware accelerator...

High-level synthesis is a novel method to generate a RTlevel hardware description automatically from a high-level language such as C, and is used at recent digital circuit design. Floating-point to fixedpoint conversion with bit-length optimization is one of the key issues for the area and speed optimization in high-level synthesis. However, the conversion task is a rather tedious work for desi...

The problem of reducing the fragility of digital controllers and filters implemented using finite-precision, floating-point arithmetic is considered. Floating-point arithmetic parameter uncertainty is multiplicative, unlike parameter uncertainty resulting from fixedpoint arithmetic. Based on first-order eigenvalue sensitivity analysis, an upper bound on the eigenvalue perturbations is derived. ...