Results 1 
6 of
6
A VHDLAMS Compiler and Architecture Generator for Behavioral Synthesis of Analog Systems
 PROCEEDINGS OF DATE’99
, 1999
"... This paper presents a complete method for automatically translating VHDLAMS behavioralspecifications of analog systems into op amp level netlists of library components. We discuss the three fundamental aspects, that pertain to any behavioral synthesis environment: the specification language, the ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
(Show Context)
This paper presents a complete method for automatically translating VHDLAMS behavioralspecifications of analog systems into op amp level netlists of library components. We discuss the three fundamental aspects, that pertain to any behavioral synthesis environment: the specification language, the rules for compiling language constructs into a technologyindependent, intermediate representation, and the synthesis (mapping) of representations to netlists (topologies) of library components, so that performance constraints are satisfied. We motivate the effectiveness of the method by presenting our synthesis results for 5 examples.
The Definition of a VHDLAMS Subset for Behavioral Synthesis of Analog Systems
 In Proc. of IEEE/VIUF BMAS
, 1998
"... This paper defines a VHDLAMS subset for behavioral synthesis of analog systems. The subset includes language constructs for describing most of the functional aspects pertaining to analog systems. Besides, these constructs can be implemented with electronic circuits. Functional aspects, which can be ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
(Show Context)
This paper defines a VHDLAMS subset for behavioral synthesis of analog systems. The subset includes language constructs for describing most of the functional aspects pertaining to analog systems. Besides, these constructs can be implemented with electronic circuits. Functional aspects, which can be expressed with the subset, relate to two interacting parts. The analog part continuously processes analog signals, while the control part generates control signals for configuring the flow of signals in the analog part. However, some language constructs have to be constrained or augmented, so that they become effective for synthesis. To motivate that constructs in the subset can be synthesized, we present, by means of an example, how VHDLAMS programs are compiled into an intermediate format. The intermediate format can be either directly mapped to components from a component library, or used for further synthesisrelated optimization steps. Finally, we discuss a complete experiment for spe...
a a
"... Abstract ⎯ In this paper, we present a novel cubicpolynomial evaluation algorithm. It is suitable for VLSI implementation and the computational cost is reduced to about 66 % of the previously reported method. I. CBICPOLYNOMIAL EVALUATION ALGORITHM Cubicpolynomial evaluation is a commonly used met ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract ⎯ In this paper, we present a novel cubicpolynomial evaluation algorithm. It is suitable for VLSI implementation and the computational cost is reduced to about 66 % of the previously reported method. I. CBICPOLYNOMIAL EVALUATION ALGORITHM Cubicpolynomial evaluation is a commonly used method in measurement and instrumentation [1], [2]. Among the applications involving cubicpolynomial evaluation, there exist a lot of cases that the measurement is an iterative process, dualintegration analogtodigital conversion for example. Direct evaluation after the measurement is of low efficiency, since the processing module is idle during the measurement. High computational efficiency can be achieved through iterative method. An iterative cubicpolynomial algorithm was proposed by P.Mathias and L.Patnaik [3]. Their algorithm is based on the idea of systolic array and requires 3 operations at each step. In this paper, we propose an algorithm that employs only 2 operations at each step. So higher computational efficiency is achieved. A general form of cubicpolynomial is: 3 z ( x)
a a
"... Abstract ⎯ In this paper, we present a novel cubicpolynomial evaluation algorithm. It is suitable for VLSI implementation and the computational cost is reduced to about 66 % of the previously reported method. I. CBICPOLYNOMIAL EVALUATION ALGORITHM Cubicpolynomial evaluation is a commonly used met ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract ⎯ In this paper, we present a novel cubicpolynomial evaluation algorithm. It is suitable for VLSI implementation and the computational cost is reduced to about 66 % of the previously reported method. I. CBICPOLYNOMIAL EVALUATION ALGORITHM Cubicpolynomial evaluation is a commonly used method in measurement and instrumentation [1], [2]. Among the applications involving cubicpolynomial evaluation, there exist a lot of cases that the measurement is an iterative process, dualintegration analogtodigital conversion for example. Direct evaluation after the measurement is of low efficiency, since the processing module is idle during the measurement. High computational efficiency can be achieved through iterative method. An iterative cubicpolynomial algorithm was proposed by P.Mathias and L.Patnaik [3]. Their algorithm is based on the idea of systolic array and requires 3 operations at each step. In this paper, we propose an algorithm that employs only 2 operations at each step. So higher computational efficiency is achieved. A general form of cubicpolynomial is: 3 z ( x)
An Algorithm for VLSI Implementation of Highly Efficient CubicPolynomial Evaluation
"... Abstract ⎯ In this paper, we present a novel cubicpolynomial evaluation algorithm. It is suitable for VLSI implementation and the computational cost is reduced to about 66 % of the previously reported method. I. CBICPOLYNOMIAL EVALUATION ALGORITHM Cubicpolynomial evaluation is a commonly used met ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract ⎯ In this paper, we present a novel cubicpolynomial evaluation algorithm. It is suitable for VLSI implementation and the computational cost is reduced to about 66 % of the previously reported method. I. CBICPOLYNOMIAL EVALUATION ALGORITHM Cubicpolynomial evaluation is a commonly used method in measurement and instrumentation [1], [2]. Among the applications involving cubicpolynomial evaluation, there exist a lot of cases that the measurement is an iterative process, dualintegration analogtodigital conversion for example. Direct evaluation after the measurement is of low efficiency, since the processing module is idle during the measurement. High computational efficiency can be achieved through iterative method. An iterative cubicpolynomial algorithm was proposed by P.Mathias and L.Patnaik [3]. Their algorithm is based on the idea of systolic array and requires 3 operations at each step. In this paper, we propose an algorithm that employs only 2 operations at each step. So higher computational efficiency is achieved. A general form of cubicpolynomial is: z