By Topic

High-level data conversion synthesis by symbolic methods

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
N. C. Horta ; Dept. of Electr. Eng., Faculdade de Ciencias e Technologia, Monte da Caparica, Portugal ; J. E. Franca

A new symbolic method for high-level synthesis of data conversion systems is described. This consists of translating the formal HDL description of a data conversion algorithm into a graph representation containing both analog and digital data, and then carrying out highly efficient symbolic manipulations to generate the circuit topology. A set of symbolic graph simplifying rules, for graph compaction into a canonical form, together with functional block pattern recognition techniques offer a considerable reduction of the search space and thus allow the overall synthesis process to be completed within very short computation times. The effectiveness of the proposed method is illustrated for the synthesis of data conversion systems implementing the well known successive approximation, flash, two-step flash and pipeline algorithms. Besides, it is also shown how the proposed method can be employed for the exploration of a wider range of data conversion topologies implementing innovative conversion algorithms

Published in:

Circuits and Systems, 1996. ISCAS '96., Connecting the World., 1996 IEEE International Symposium on  (Volume:4 )

Date of Conference:

12-15 May 1996