COFACTOR PACKING ALGORITHM FOR LOOKUP-TABLE BASED FIELD-PROGRAMMABLE GATE ARRAYS

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 291
  • Download : 0
The authors present a new technology mapping algorithm for an LUT-based FPGA. Decomposition of a Boolean network is formulated as an algebraic cofactoring, and the technology mapping is performed by cofactor packing. Experimental results show that the proposed method decomposes infeasible nodes in a shorter CPU time with more than 10% reduced number of nodes compared with previous decomposition methods.
Publisher
IEE-INST ELEC ENG
Issue Date
1994-07
Language
English
Article Type
Article
Citation

ELECTRONICS LETTERS, v.30, no.15, pp.1207 - 1209

ISSN
0013-5194
URI
http://hdl.handle.net/10203/58717
Appears in Collection
RIMS Journal PapersEE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0