??? 01/30/05 17:13 Read: times |
#86131 - Minimisation Responding to: ???'s previous message |
The logic synthesis tool perform a variable amount of logic minimisation and the amount performed depends on the goals that you set the synthesiser,you can set it to produce the smallest implementation,or the fastest,or the safest for statemachines getting stuck in unknown states etc and so on.There is no known way of telling if some logic function has the minimum number of logic terms or is the fastest or any other metric other than simply trying lots of different solutions and seeing which meets the design goals,and actualy fitting logic into a FPGA or CPLD is what is called a NP complete problem so again its a matter of trial and error until you hit some goal. |
Topic | Author | Date |
CPLD/ABEL question/invitation | 01/01/70 00:00 | |
CPLD questions | 01/01/70 00:00 | |
ABEL questions | 01/01/70 00:00 | |
vell... | 01/01/70 00:00 | |
Minimisation | 01/01/70 00:00 | |
NP complete | 01/01/70 00:00 | |
Answer to the third question | 01/01/70 00:00 | |
CPLD headstart (ppt) | 01/01/70 00:00 | |
New questions | 01/01/70 00:00 | |
new answers | 01/01/70 00:00 | |
JTAG pull-up | 01/01/70 00:00 | |
re: JTAG pull-up | 01/01/70 00:00 | |
NP completness | 01/01/70 00:00 | |
basic error | 01/01/70 00:00 | |
Eric | 01/01/70 00:00 | |
How to Build a Jtag Cable | 01/01/70 00:00 | |
pegboard | 01/01/70 00:00 | |
jtag cable![]() | 01/01/70 00:00 |