By Topic

An efficient method to compute Arithmetic Transforms for datapath by module compositions

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

4 Author(s)
Pang Yu ; College of Photo-Electronic, Chongqing University of Posts and Telecommunications, 400065, China ; Liu Yunhui ; Tan Hanyue ; Wu Wei

This paper considers the construction of Arithmetic Transform (AT) and its extensions, which is a technique to express word-level representations of combinational and sequential blocks for datapath circuits. The goal is for hardware verification and component matching. Module composition is helpful to process a block-level netlist representing a complex circuit and to obtain its transform efficiently. To facilitate the composition, several subroutines are proposed, and integrated them into an efficient topology algorithm.

Published in:

Electric Information and Control Engineering (ICEICE), 2011 International Conference on

Date of Conference:

15-17 April 2011