Results 1 
6 of
6
A Methodology for Guided BehavioralLevel Optimization
 PROC. 35TH ACM DESIGN AUTOMATION CONF. (DAC
, 1998
"... Optimization at the early stages of design are crucial. However, due to an overwhelming number of design and optimization options, design exploration is often conducted in a qualitative, adhoc manner. This paper presents a methodology and interactive environment for guiding the exploration process. ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
(Show Context)
Optimization at the early stages of design are crucial. However, due to an overwhelming number of design and optimization options, design exploration is often conducted in a qualitative, adhoc manner. This paper presents a methodology and interactive environment for guiding the exploration process. A prototype targeting behaviorallevel optimization for datapathintensive ASIC implementations has been developed. The key to the approach is encapsulated knowledge about the various optimizations and a set of techniques to automatically extract the "essence" of a design description. At each stage in the exploration process, the system suggests and ranks potential optimizations, both in terms of immediate and longerterm impact. It also provides evaluations of the design and of the likely affects each optimization will have on metrics like power and performance. In the new approach, the designer is responsible for making the actual optimization selections. However, using the provided guidance, designers can make decisions in a more informed manner, and therefore can explore the design solution space more effectively. The effectiveness of the approach is demonstrated on a number of designs.
Lowcomplexity constant coefficient matrix multiplication using a minimum spanning tree approach
, 2004
"... In this paper a novel approach for realizing constant coefficient matrix multiplication using few additions and subtractions is proposed. This method is applicable in, e.g., FIR filter banks, transforms, and polyphase form FIR filters for sample rate changes. Examples show that the proposed method y ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
(Show Context)
In this paper a novel approach for realizing constant coefficient matrix multiplication using few additions and subtractions is proposed. This method is applicable in, e.g., FIR filter banks, transforms, and polyphase form FIR filters for sample rate changes. Examples show that the proposed method yields good results compared to realizing the matrix multiplication by utilizing multiple coefficient multiplication techniques for the rows or columns separately.
Reducing Reconfiguration Overhead for Reconfigurable Multimode Filters Through PolynomialTime Optimization and Joint Filter Design”, CECS technical report
"... FIR filters are vastly used in multimode systems where the behavior of the system changes based on user inputs or changes in the operational environment. FIR filters used for each mode of operation have different sets of parameters (coefficient sets). Partially reconfigurable FPGA platforms are sho ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
FIR filters are vastly used in multimode systems where the behavior of the system changes based on user inputs or changes in the operational environment. FIR filters used for each mode of operation have different sets of parameters (coefficient sets). Partially reconfigurable FPGA platforms are shown to be viable choices to implement multimode filters. In our previous work [1] we proposed a clusteringbased technique to design a multimode filter with minimal area and manageable reconfiguration delay. In this work we theoretically extend the previous work to propose an optimal polynomial time algorithm to optimize the structure of the filter. Using the optimal solution we can decrease the area by 17.2 % compared to clustering approach. The results of our experiments show that our proposed heuristics give solutions within 1 % of the optimal solution. ii
unknown title
"... Arithmetic is one of the old topics in computing. It dates back to the many early civilizations that used the abacus to perform arithmetic operations. The seventeenth ..."
Abstract
 Add to MetaCart
Arithmetic is one of the old topics in computing. It dates back to the many early civilizations that used the abacus to perform arithmetic operations. The seventeenth
Algebraic Methods for Optimizing Constant Multiplications in Linear Systems
"... Abstract. Constant multiplications can be efficiently implemented in hardware by converting them into a sequence of nested additions and shift operations. They can be optimized further by finding common subexpressions among these operations. In this work, we present algebraic methods for eliminating ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. Constant multiplications can be efficiently implemented in hardware by converting them into a sequence of nested additions and shift operations. They can be optimized further by finding common subexpressions among these operations. In this work, we present algebraic methods for eliminating common subexpressions. Algebraic techniques are established in multilevel logic synthesis for the minimization of the number of literals and hence gates to implement Boolean logic. In this work we use the concepts of two of these methods, namely rectangle covering and fast extract (FX) and adapt them to the problem of optimizing linear arithmetic expressions. The main advantage of using such methods is that we can optimize systems consisting of multiple variables, which is not possible using the conventional optimization techniques. Our optimizations are aimed at reducing the area and power consumption of the hardware, and experimental results show up to 30.3% improvement in the number of operations over conventional techniques. Synthesis and simulation results show up to 30 % area reduction and up to 27 % power reduction. We also modified our algorithm to perform delay aware optimization, where we perform common subexpression elimination such that the delay is not exceeded beyond a particular value.