Using symbolic algebra in algorithmic level DSP synthesis

Authors:
Armita Peymandoust;Giovanni De Micheli
Affiliations:
Stanford University, Computer Systems Laboratory, Stanford, CA;Stanford University, Computer Systems Laboratory, Stanford, CA
Venue:
Proceedings of the 38th annual Design Automation Conference
Year:
2001

Citing 7
Cited 8

Algorithms for computer algebra

Algorithms for computer algebra
Polynomial methods for component matching and verification

Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
Polynomial methods for allocating complex components

DATE '99 Proceedings of the conference on Design, automation and test in Europe
Computer Approximations

Computer Approximations
Synthesis and Optimization of Digital Circuits

Synthesis and Optimization of Digital Circuits
FRIDGE: An Interactive Code Generation Environment for HW/SW CoDesign

ICASSP '97 Proceedings of the 1997 IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP '97) -Volume 1 - Volume 1
Some properties of Gröbner-bases for polynomial ideals

ACM SIGSAM Bulletin

The future of logic synthesis and verification

Logic Synthesis and Verification
Symbolic algebra and timing driven data-flow synthesis

Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Factoring and eliminating common subexpressions in polynomial expressions

Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design
Mathematical framework for representing discrete functions as word-level polynomials

HLDVT '03 Proceedings of the Eighth IEEE International Workshop on High-Level Design Validation and Test Workshop
Towards the automatic exploration of arithmetic-circuit architectures

Proceedings of the 43rd annual Design Automation Conference
Brief paper: A symbolic matrix decomposition algorithm for reduced order linear fractional transformation modelling

Automatica (Journal of IFAC)
Algebraic Methods for Optimizing Constant Multiplications in Linear Systems

Journal of VLSI Signal Processing Systems
Formal verification of high-level data-flow synthesis designs using relational modeling and symbolic computation

Integration, the VLSI Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

Current multimedia applications require the design of data-path intensive circuits. Unfortunately, current design tools and methods support design abstraction at a level that is inferior to the expectation of designers. Namely, most arithmetic-level optimizations are not supported and they are left to the designers' ingenuity. In this paper, we show how symbolic algebra can be used to construct an arithmetic-level decomposition algorithm. We also introduce our tool, SymSyn, that performs arithmetic library mapping and optimization of data-flow descriptions into data paths using arithmetic components.