New logic optimization algoritm

In summary, there is a new idea for a logic optimization algorithm that can handle multi-level representations and theoretically find the best circuit for 8 to 12 input bits. The question is whether this algorithm has useful applications and if it is worth developing. However, in today's logic optimization, other factors such as fanout, gate size, and power consumption are also important. The recent trend is towards physical synthesis, taking physical locations into account. Despite this, it is still worth pursuing the development of a good algorithm as it could potentially be competitive with established companies like Synopsys.
  • #1
Peter0000
1
0
hi

I have an idea for new logic optimization algoritm, like "Quine–McCluskey algorithm" and the "Espresso heuristic logic minimizer", but it can handle multi-level representations and it can find the (theoretical) best circuit. It should work for 8 to 12 input bits. I was wondering if such an algoritm has useful applications and if it is worth the effort to make it. Can someone give his or her thoughts on it?
 
Engineering news on Phys.org
  • #2
Nowadays, logic optimization is more than finding the theoretically best logical circuit. You need to consider the fanout, gate size, delay for each cells, power consumption, end-to-end overall delay...
But having a good algorithm is a must and if you have one, you have a great chance although I think 8 to 12 bit limit is too small(Imagine, one verilog module usually has hundreds of ports)
And the recent trend is more for physical synthesis..i.e. taking the physical locations into account upon the synthesis and optimization. Synopsys, Magma, and probably Cadence all are doing it..

I'd say keep working. If your tool is good enough, not necessary the best in the industry, someone may want to use it if the cost performance is right.
You might be able to beat Synopsys some day if you refine your idea,, who knows.
 
Last edited:

FAQ: New logic optimization algoritm

What is a logic optimization algorithm?

A logic optimization algorithm is a method used in computer science to simplify and reduce the complexity of logical expressions. It is commonly used in digital circuit design and programming to improve efficiency and reduce the number of logic gates needed.

How does a logic optimization algorithm work?

Logic optimization algorithms work by analyzing the logical expression and identifying redundant or unnecessary components. It then applies various techniques, such as Boolean algebra, to simplify the expression while preserving its functionality.

What are the benefits of using a logic optimization algorithm?

The main benefit of using a logic optimization algorithm is improved efficiency and reduced complexity. This can result in faster processing times, reduced memory usage, and lower power consumption. Additionally, it can help identify errors or inconsistencies in the logic, leading to more reliable systems.

Are there different types of logic optimization algorithms?

Yes, there are various types of logic optimization algorithms, such as Quine-McCluskey method, Karnaugh map, and Espresso algorithm. Each algorithm uses different techniques and approaches to optimize logical expressions, and their effectiveness may vary depending on the type of expression.

How is a logic optimization algorithm different from a search algorithm?

A logic optimization algorithm is specifically designed to simplify logical expressions, while a search algorithm is a more general problem-solving method. Additionally, a logic optimization algorithm works on a specific set of rules and constraints, whereas a search algorithm can be applied to various types of problems.

Back
Top