Download presentation
Presentation is loading. Please wait.
Published byAdela Nancy Jordan Modified over 9 years ago
2
Abstract To present a novel logic synthesis method to reduce the area of XOR-based logic functions. Idea: To exploit linear dependency between logic sub- functions to create an implementation based on an XOR relationship with a lower area overhead.
3
Over View Introduction Background Decomposition and Synthesis Variable Partitioning Basic/ Selector Optimization Multi-Output Synthesis Experiment Results Related Work Conclusion and Future Work
4
Introduction The XOR-based logic functions are an important type of functions, heavily used in arithmetic, error correcting and telecommunication circuits. Focus on XOR-based logic functions and show that they exhibit a property that can be exploited for area reduction in this work.
5
XOR Decomposition (early work) Spectral decomposition Linear decomposition Davio expansion + help of BDDs (Reed-Muller logic equation) Look for x-dominators in a BDD that indicate a presennce of an XOR gate Tabular methods based on AC decomposition
6
FLDS Look at a linear relationship between logic functions Define functional linearity to be a decomposition of the form: f ( X ) = Σ i g i ( Y ) h i ( X-Y ) where X and Y are sets of variables (Y is the subset of X), while the summation represents an XOR gate.
7
FLDS Look at a linear relationship between logic functions Define functional linearity to be a decomposition of the form: f ( X ) = Σ i g i ( Y ) h i ( X-Y ) where X and Y are sets of variables (Y is the subset of X), while the summation represents an XOR gate.
8
FLDS Look at a linear relationship between logic functions Define functional linearity to be a decomposition of the form: f ( X ) = Σ i g i ( Y ) h i ( X-Y ) where X and Y are sets of variables (Y is the subset of X), while the summation represents an XOR gate.
9
FLDS Look at a linear relationship between logic functions Define functional linearity to be a decomposition of the form: f ( X ) = Σ i g i ( Y ) h i ( X-Y ) where X and Y are sets of variables (Y is the subset of X), while the summation represents an XOR gate.
10
Background Galois Field of characteristic 2 (GF(2)) Linear independence Vectors spaces Gaussion Elimination
11
Field
12
Galois Field of characteristic 2 (GF(2))
13
Linear independence
14
Gaussion Elimination
15
Decomposition and Synthesis
20
Variable Partitioning
21
Basic/ Selector Optimization
22
Multi-Output Synthesis
23
Experiment Results
24
Related Work
25
Conclusion and Future Work
Similar presentations
© 2024 SlidePlayer.com. Inc.
All rights reserved.