Results 1 
5 of
5
Behavioral optimization using the manipulation of timing constraints
, 1995
"... Abstract — We introduce a transformation, named rephasing, that manipulates the timing parameters in controldataflow graphs (CDFG’s) during the highlevel synthesis of datapathintensive applications. Timing parameters in such CDFG’s include the sample period, the latencies between input–output pa ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Abstract — We introduce a transformation, named rephasing, that manipulates the timing parameters in controldataflow graphs (CDFG’s) during the highlevel synthesis of datapathintensive applications. Timing parameters in such CDFG’s include the sample period, the latencies between input–output pairs, the relative times at which corresponding samples become available on different inputs, and the relative times at which the corresponding samples become available at the delay nodes. While some of the timing parameters may be constrained by performance requirements, or by the interface to the external world, others remain free to be chosen during the process of highlevel synthesis. Traditionally highlevel synthesis systems for datapathintensive applications either have assumed that all the relative times, called phases, when corresponding samples are available at input and delay nodes are zero (i.e., all input and delay node samples enter at the initial cycle of the schedule) or have automatically assigned values to these phases as part of the datapath allocation/scheduling step in the case of newer schedulers that use techniques like overlapped scheduling to generate complex time shapes. Rephasing, however, manipulates the values of these phases as an algorithm transformation before the scheduling/allocation stage. The advantage of this approach is that phase values can be chosen to transform and optimize the algorithm for explicit metrics such as area, throughput, latency, and power. Moreover, the rephasing transformation can be combined with other transformations such as algebraic transformations. We have developed techniques for using rephasing to optimize a variety of design metrics, and our results show significant improvements in several design metrics. We have also investigated the relationship and interaction of rephasing with other highlevel synthesis tasks. Index Terms—Behavioral synthesis, transformations. I.
Maximally and Arbitrarily Fast Implementation of Linear and Feedback Linear Computations
, 2000
"... By establishing a relationship between the basic properties of linear computations and eight optimizing transformations (distributivity, associativity, commutativity, inverse and zero element law, common subexpression replication and elimination, constant propagation), a computeraided design platfo ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
By establishing a relationship between the basic properties of linear computations and eight optimizing transformations (distributivity, associativity, commutativity, inverse and zero element law, common subexpression replication and elimination, constant propagation), a computeraided design platform is developed to optimally speedup an arbitrary instance from this large class of computations with respect to those transformations. Furthermore, arbitrarily fast implementation of an arbitrary linear computation is obtained by adding loop unrolling to the transformations set. During this process, a novel Horner pipelining scheme is used so that the areatime (AT) product is maintained constant, regardless of achieved speedup. We also present a generalization of the new approach so that an important subclass of nonlinear computations, named feedback linear computations, is efficiently, maximally, and arbitrarily spedup.
Rephasing: A transformation technique for the manipulation of timing constraints
 Design Autorrmtion Conference
, 1995
"... Abstract We introduce a transformation, named rephasing, that manipulates the timing parameters in controldataflow graphs. Traditionally highlevel synthesis systems for DSP have either assumed that all the relative times, called phases, when corresponding samples are available at input and delay ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract We introduce a transformation, named rephasing, that manipulates the timing parameters in controldataflow graphs. Traditionally highlevel synthesis systems for DSP have either assumed that all the relative times, called phases, when corresponding samples are available at input and delay nodes are zero or have automatically assigned values to as part of the scheduling step when software pipelining is simultaneously applied. Rephasing, however, manipulates the values of these phases as a transformation before the scheduling. The advantage of this approach is that phases can be chosen to optimize the algorithm for metrics such as area and power. Moreover, rephasing can be combined with other transformations. We have developed techniques for using rephasing to optimize several design metrics. The experimental results show significant improvements. 1.
DivideandConquer Techniques for Global Throughput Optimization
 Proc. IEEE VLSI Signal Processing Workshop
, 1996
"... This paper proposes a divideandconquer approach for global throughput optimization which not only leverages upon existing techniques, but enables their more effective and coordinated use. The "divide" approach consists of logical partitioning of the computation into subparts falling into one of a ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
This paper proposes a divideandconquer approach for global throughput optimization which not only leverages upon existing techniques, but enables their more effective and coordinated use. The "divide" approach consists of logical partitioning of the computation into subparts falling into one of a set of preclassified computation types. The subparts are then "conquered" through coordinated application of existing optimization techniques. We have characterized a set of techniques in terms of their expected effect on throughput, and can thus select the most promising techniques for each unique situation. The technique is not limited to a specific class of computations and gives higher, or at worst equal, improvement than previously reported techniques on all examples. 1.0 Introduction Throughput optimization techniques remain important for meeting the sampling rate requirements of modern DSP and communication applications. Though clock rates for ASICs and general purpose computing devi...
Detecting local events using global sensing
 IEEE Sensors
, 2011
"... Abstract—In order to create low power, low latency and reliable sensing systems, we propose a sensing strategy that identifies local events by the means of global measurements. We claim that capturing events globally, although seems against intuition, can save energy by enabling the organization of ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract—In order to create low power, low latency and reliable sensing systems, we propose a sensing strategy that identifies local events by the means of global measurements. We claim that capturing events globally, although seems against intuition, can save energy by enabling the organization of effective searching queries. To enable this capability, sensor readings can be combined using electronic switches and therefore enable event detections in groups of sensors with single measurements. We demonstrate this sensing mechanism on a prototype keyboard system made from ETextile pressure sensors. I.