## [Qucs-devel] Logic gate simplifier

 [Qucs-devel] Logic gate simplifier From: Gopala Krishna - 2008-03-02 09:38:23 ```Hello ppl, I participated in a coding competition yesterday which involved reducing a boolean expression using basic laws. Though we couldn;t finish it for the competition within time, me and my friends have decided to complete it. Unfortunately we weren't allowed to use Quine Mclusky method in competiton. We are planning to use it as a part of learning experience. I was thinking if we can somehow apply it as logic gate simplifier in qucs ? Would that be possible ? -- Cheers, Gopala Krishna A ```

 [Qucs-devel] Logic gate simplifier From: Gopala Krishna - 2008-03-02 09:38:23 ```Hello ppl, I participated in a coding competition yesterday which involved reducing a boolean expression using basic laws. Though we couldn;t finish it for the competition within time, me and my friends have decided to complete it. Unfortunately we weren't allowed to use Quine Mclusky method in competiton. We are planning to use it as a part of learning experience. I was thinking if we can somehow apply it as logic gate simplifier in qucs ? Would that be possible ? -- Cheers, Gopala Krishna A ```
 Re: [Qucs-devel] Logic gate simplifier From: Bastien ROUCARIES - 2008-03-02 10:52:07 ```Le dimanche 2 mars 2008, Gopala Krishna a écrit : > Hello ppl, > I participated in a coding competition yesterday which involved > reducing a boolean expression using basic laws. Though we couldn;t > finish it for the competition within time, me and my friends have > decided to complete it. Unfortunately we weren't allowed to use Quine > Mclusky method in competiton. We are planning to use it as a part of > learning experience. > > I was thinking if we can somehow apply it as logic gate simplifier in > qucs ? Would that be possible ? The problem is NP hard, therefore you should be aware that it is not linearly time bounded. You could use other method like expresso. I do not know if it will be useful in qucs, because if the function is too complex, you usually use verilog or vhdl. See if icarus verilog team is interested by your program. Regards Bastien -- "ROUCARIES Bastien" roucaries.bastien@... ------------------------------------------------------------------------------- DO NOT WRITE TO roucaries.bastien+blackhole@... OR BE BLACKLISTED ```
 Re: [Qucs-devel] Logic gate simplifier From: Bastien ROUCARIES - 2008-03-02 11:25:09 ```Le dimanche 2 mars 2008, Gopala Krishna a écrit : > Hello ppl, > I participated in a coding competition yesterday which involved > reducing a boolean expression using basic laws. Though we couldn;t > finish it for the competition within time, me and my friends have > decided to complete it. Unfortunately we weren't allowed to use Quine > Mclusky method in competiton. We are planning to use it as a part of > learning experience. > > I was thinking if we can somehow apply it as logic gate simplifier in > qucs ? Would that be possible ? I should also add, when you do real synthesis, you do not always simplify in the essential prime implicants sense. For instance if you do some synthesis on FPGA the basic block is D flip flop, 8 bit adder, shift register etc... And therefore for instance essential prime implicants of a 8 bit adder is more complex than a 8 bit adder block :-) Regards -- "ROUCARIES Bastien" roucaries.bastien+qucs@... ------------------------------------------------------------------------------- DO NOT WRITE TO roucaries.bastien+blackhole@... OR BE BLACKLISTED ```
 Re: [Qucs-devel] Logic gate simplifier From: Gopala Krishna - 2008-03-02 14:03:10 ```On Sun, Mar 2, 2008 at 3:56 PM, mike brinson wrote: > Hello Gopala > > The answer to your question is, of course , yes. The > Quine Mclusky method of simplification is independent > of Qucs. Perhaps the best approach would be to write > a stand alone program for the Qucs tools section. > This could be used for minimisation and output a gate > schematic of the minimised design, or VHDL/Verilog > code. > > Best wishes Thanks :-) Right now, for our knowledge level we can get an expression simplifier based on strings. Once done, i think i can take your help and get it into qucs. Bastein says > The problem is NP hard, therefore you should be aware that it is not linearly > time bounded. Yeah, even i read the same about QM method. My friend still feels we should stick on to rules of competition of not using QM method. We will analyse and see how this works out. > You could use other method like expresso. What is expresso ? @everyone: BTW how do we access IEEE papers ? I found one or two related to the problem but couldn't see it as i don't have an account. Are these journals non free ? -- Cheers, Gopala Krishna A ```
 Re: [Qucs-devel] Logic gate simplifier From: Bastien ROUCARIES - 2008-03-02 14:30:48 ```Le dimanche 2 mars 2008, Gopala Krishna a écrit : > On Sun, Mar 2, 2008 at 3:56 PM, mike brinson wrote: > > Hello Gopala > > > > The answer to your question is, of course , yes. The > > Quine Mclusky method of simplification is independent > > of Qucs. Perhaps the best approach would be to write > > a stand alone program for the Qucs tools section. > > This could be used for minimisation and output a gate > > schematic of the minimised design, or VHDL/Verilog > > code. > > > > Best wishes > > Thanks :-) > Right now, for our knowledge level we can get an expression simplifier > based on strings. > Once done, i think i can take your help and get it into qucs. Create a console based program and used it in qucs. I will be better. use & for and | for or and ~ for not will be sufficient. > Bastein says > > > The problem is NP hard, therefore you should be aware that it is not > > linearly time bounded. > > Yeah, even i read the same about QM method. My friend still feels we > should stick on to rules of competition of not using QM method. > We will analyse and see how this works out. > > > You could use other method like expresso. > > What is expresso ? Expresso is an heurtistic method: http://en.wikipedia.org/wiki/Espresso_heuristic_logic_minimizer > @everyone: BTW how do we access IEEE papers ? > I found one or two related to the problem but couldn't see it as i > don't have an account. Are these journals non free ? Yes they are not free. -- "ROUCARIES Bastien" roucaries.bastien@... ------------------------------------------------------------------------------- DO NOT WRITE TO roucaries.bastien+blackhole@... OR BE BLACKLISTED ```
 Re: [Qucs-devel] Logic gate simplifier From: Lisandro Damián Nicanor Pérez Meyer - 2008-03-02 17:25:09 ```El Domingo 02 Marzo 2008, Gopala Krishna escribió: [snip] > @everyone: BTW how do we access IEEE papers ? > I found one or two related to the problem but couldn't see it as i > don't have an account. Are these journals non free ? Some universities have their IPs logged into the IEEE's Library server, and you can access almost all content from there. -- Si vives cada día de tu vida como si fuera el último, algún día realmente tendrás razón. Steve Jobs Lisandro Damián Nicanor Pérez Meyer http://perezmeyer.com.ar/ #bblug irc.freenode.net ```