Sciweavers

Share
IPPS
1997
IEEE

A Comparison of Parallel Approaches for Algebraic Factorization in Logic Synthesis

9 years 8 months ago
A Comparison of Parallel Approaches for Algebraic Factorization in Logic Synthesis
Algebraic factorization is an extremely important part of any logic synthesis system but is computationally expensive. Hence it is important to look at parallel processing to speed up the procedure. This paper presents three different parallel algorithms for algebraic factorization. The first algorithm uses circuit replication and uses a divide and conquer strategy. A second algorithm uses totally independent factorization on different circuit partitions with no interactions among the partitions. A third algorithm represents a compromise between the two approaches. It uses a novel L-shaped partitioning strategy which provides some interaction among the rectangles obtained in various partitions.
Sumit Roy, Prithviraj Banerjee
Added 06 Aug 2010
Updated 06 Aug 2010
Type Conference
Year 1997
Where IPPS
Authors Sumit Roy, Prithviraj Banerjee
Comments (0)
books