Information relationships and measures: an analysis apparatus for efficient information system synthesis

Jóźwiak, L.

doi:10.1109/eurmic.1997.617209

Cited by 23 publications

(15 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The first four steps are guided by analysis of the information relationships, LUT or gate characteristics, area, timing and power related information, and optimization constraints and objectives. They were explained in our previous publications [4] [5]. The last step is straightforward.…”

Section: Construct a New Function H By Expressing F In Newmentioning

confidence: 99%

“…To satisfy the needs of an adequate circuit synthesis for the modern nano CMOS technologies, we proposed a new information-driven circuit synthesis approach and developed two theories that support this approach: -the theory of general decomposition of discrete relation networks [3], and -the theory of information relationships and measures [4]. Using them, we developed a family of circuit synthesis methods and tools that implement the informationdriven approach.…”

Section: Information-driven Circuit Synthesismentioning

confidence: 99%

“…Information relationships between variables or set systems representing various information streams can be analyzed by considering relationships between their corresponding information sets. In particular, the relationship and relationship measure expressing information similarity are defined in [4] as follows:…”

Section: Information-driven Circuit Synthesismentioning

confidence: 99%

See 2 more Smart Citations

High-Quality Circuit Synthesis for Modern Technologies

Jóźwiak

Chojnacki

Ślusarczyk

2008

9th International Symposium on Quality Electronic Design (Isqed 2008)

View full text Add to dashboard Cite

show abstract

Section: Construct a New Function H By Expressing F In Newmentioning

confidence: 99%

Section: Information-driven Circuit Synthesismentioning

confidence: 99%

See 1 more Smart Citation

High-Quality Circuit Synthesis for Modern Technologies

Jóźwiak

Chojnacki

Ślusarczyk

2008

9th International Symposium on Quality Electronic Design (Isqed 2008)

View full text Add to dashboard Cite

show abstract

“…Our information-driven circuit synthesis is based two theories: -the theory of general decomposition of discrete relation networks [2] [3], and -the theory of information relationships and measures [4]. The information-driven circuit synthesis approach relies on the analysis of the information flow structure and relationships in the function to be implemented, as well as, in the circuit under construction, and usage of the results of this analysis to control the circuit construction.…”

Section: Information-driven Circuit Synthesismentioning

confidence: 99%

Technology Library Modelling for Information-driven Circuit Synthesis

Jóźwiak

Bieganski

2008

2008 11th EUROMICRO Conference on Digital System Design Architectures, Methods and Tools

View full text Add to dashboard Cite

DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal. If the publication is distributed under the terms of Article 25fa of the Dutch Copyright Act, indicated by the "Taverne" license above, please follow below link for the End User Agreement:

show abstract

“…• BDD-based method [7] • r-admissibility method [1] • Ashenhurst Search heuristics (ASH) [8] • Information relationship based method [16] • Pair weighted method [9] • Use of symmetry [12] • Shen and Kellar method [6] • A* search method [10] The next section defines the partition calculus operation. Section 3 the application of r-admissibility to solve the variable partitioning problem.…”

Section: Introductionmentioning

confidence: 99%

Comparison of heuristic algorithms for variable partitioning in circuit implementation

Muthukumar

Selvaraj

16th International Conference on VLSI Design, 2003. Proceedings.

View full text Add to dashboard Cite

Functional decomposition is a process of splitting a complex circuit into smaller sub-circuits. This paper deals with the problem of determining the set of best free and bound variables (variable partitioning problem) for disjoint (disjoint serial) decomposition, such that the decomposed circuits are smaller in size and its truth table representation have maximal don't cares. A novel pruned breadth first search (PBFS/IPBFS) approach is proposed to determine the set of good variable partitions with minimal time andcomputational complexity. The heuristics proposed minimize the size of the sub-functions. The proposed approach has been successfully implemented and test with MCNC and Espresso benchmarks.

show abstract

Information relationships and measures: an analysis apparatus for efficient information system synthesis

Cited by 23 publications

References 18 publications

High-Quality Circuit Synthesis for Modern Technologies

High-Quality Circuit Synthesis for Modern Technologies

Technology Library Modelling for Information-driven Circuit Synthesis

Comparison of heuristic algorithms for variable partitioning in circuit implementation

Contact Info

Product

Resources

About