Reliable fixed-point implementation of linear data-flows
Texte intégral
Figure
Documents relatifs
In the remainder of this paper, we will implicitly assume that all link diagrams are connected, and that a diagram is alternating within each twist region... Thurston [29,
While the fixed-point algorithm in Table I does not always succeed in finding the global minimum of the non-convex problem (16), it is guaranteed to find the solution of (17).
Abstract—This article presents a word-length optimization problem under accuracy constraints for the hardware implementation of linear signal processing systems with
- An O (mn log n) algorithm is proposée to détermine a point of a network with m arcs and n vertices which minimizes the variance of the weighted distances to all vertices.. Keywords
For each node in these graphs there is exactly one path of infinité length because each node has out-degree one. The next step is to describe the infinité strings associated with
Boolean algebras endowed with additional operations have been widely studied (see [8] and [15]). In this context modal algebras and di- agonalizable algebras are of
The results proven in this paper provide a first a priori analysis of the greedy algorithm for the selection of the elements used in the reduced basis for the approximation of
The term procurement strategy means a set of planned amounts of procurement for the entire product line, including the selected prices and discounts from all potential suppliers;