[EE]:: Online minimization of boolean functions

[RussellMc]

Mildly edited email from a friend.
Ken says:

I came across this website while looking for a tool to help with minimising
arbitrary 2-level (AND-OR) boolean logic equations:

Direct or link access below may work for you. Otherwise see 3rd option

1. http://tma.main.jp/logic/index_en.html

2. *Online minimization of boolean functions
<http://tma.main.jp/logic/index_en.html>*

3.
​​
http://tma dot main dot jp /logic/index_en.html

​
Apologies for the odd-ball URL - I had to obfuscate it as otherwise an
overly
officious spam detector objected and bounced my e-mail (saying the domain
main.jp was on their spam list).

_____________________________________
​


It seems to work well with the 4-input examples I have thrown at it,
although
ultimately it's not of much use for my current problem because I really need
something that I can call from a Pascal program in order to automate an
optimal
search that would otherwise be impracticable if done manually.

I have found a Pascal implementation of the classic Quine-McCluskey
algorithm
(which is effectively an exhaustive search and which once upon I time I
sort of
understood) - but it's written in Italian ! Still that's maybe no harder
for
me to understand than the many other implementations written in C that seem
to
exist :-)

Regards,

Ken

[Brooke Clarke]

Hi Russell:

I spent a semester class on exactly this topic taught by a professor who used his book, in 8.5 x11 format about 3 inches
thick.  It was written sort of as a flow diagram.  The hint was he was using this class as alpha testing a computer
program.  It's a key reason I got a job in microwave electronics rather than computers for the summer.  An interesting
aspect was switching the polarity of the logic at different levels can lead to some savings.
--
Have Fun,

Brooke Clarke
http://www.PRC68.com
http://www.end2partygovernment.com/2012Issues.html

-------- Original Message --------

[EE]:: Online minimization of boolean functions

[David C Brown]

My two pennorth based on forty years designing logic:

Up to five inputs it is pretty trivial to use a Karnaugh map for
minimization.
Beyond that I was always inclined to use ROM or PAL rather than discrete
logic.
Too aggressive minimisation can lead to maintenance difficulties.when
nobody can understand the logic.

__________________________________________
David C Brown
43 Bings Road
Whaley Bridge
High Peak Phone: [phone]
Derbyshire eMail: ***@gmail.com
SK23 7ND web: www.bings-knowle.co.uk/dcb
<http://www.jb.man.ac.uk/~dcb>



*Sent from my etch-a-sketch*

Post by RussellMc
Mildly edited email from a friend.
I came across this website while looking for a tool to help with minimising
Direct or link access below may work for you. Otherwise see 3rd option
1. http://tma.main.jp/logic/index_en.html
2. *Online minimization of boolean functions
<http://tma.main.jp/logic/index_en.html>*
3.
​​
http://tma dot main dot jp /logic/index_en.html
​
Apologies for the odd-ball URL - I had to obfuscate it as otherwise an
overly
officious spam detector objected and bounced my e-mail (saying the domain
main.jp was on their spam list).
_____________________________________
​
It seems to work well with the 4-input examples I have thrown at it,
although
ultimately it's not of much use for my current problem because I really need
something that I can call from a Pascal program in order to automate an
optimal
search that would otherwise be impracticable if done manually.
I have found a Pascal implementation of the classic Quine-McCluskey
algorithm
(which is effectively an exhaustive search and which once upon I time I
sort of
understood) - but it's written in Italian ! Still that's maybe no harder
for
me to understand than the many other implementations written in C that seem
to
exist :-)
Regards,
Ken
--
http://www.piclist.com/techref/piclist PIC/SX FAQ & list archive
View/change your membership options at
http://mailman.mit.edu/mailman/listinfo/piclist

[Harold Hallikainen]

Speaking of Karnaugh mapping, the original paper on it is at
http://bh.hallikainen.org//wiki/uploads/karnaugh.pdf .

Harold

Post by David C Brown
Up to five inputs it is pretty trivial to use a Karnaugh map for
minimization.
Beyond that I was always inclined to use ROM or PAL rather than discrete
logic.
Too aggressive minimisation can lead to maintenance difficulties.when
nobody can understand the logic.
__________________________________________
David C Brown
43 Bings Road
Whaley Bridge
High Peak Phone: [phone]
SK23 7ND web: www.bings-knowle.co.uk/dcb
<http://www.jb.man.ac.uk/~dcb>
*Sent from my etch-a-sketch*

Post by RussellMc
Mildly edited email from a friend.
I came across this website while looking for a tool to help with minimising
Direct or link access below may work for you. Otherwise see 3rd option
1. http://tma.main.jp/logic/index_en.html
2. *Online minimization of boolean functions
<http://tma.main.jp/logic/index_en.html>*
3.
​​
http://tma dot main dot jp /logic/index_en.html
​
Apologies for the odd-ball URL - I had to obfuscate it as otherwise an
overly
officious spam detector objected and bounced my e-mail (saying the domain
main.jp was on their spam list).
_____________________________________
​
It seems to work well with the 4-input examples I have thrown at it,
although
ultimately it's not of much use for my current problem because I really need
something that I can call from a Pascal program in order to automate an
optimal
search that would otherwise be impracticable if done manually.
I have found a Pascal implementation of the classic Quine-McCluskey
algorithm
(which is effectively an exhaustive search and which once upon I time I
sort of
understood) - but it's written in Italian ! Still that's maybe no harder
for
me to understand than the many other implementations written in C that seem
to
exist :-)
Regards,
Ken
--
http://www.piclist.com/techref/piclist PIC/SX FAQ & list archive
View/change your membership options at
http://mailman.mit.edu/mailman/listinfo/piclist

--
http://www.piclist.com/techref/piclist PIC/SX FAQ & list archive
View/change your membership options at
http://mailman.mit.edu/mailman/listinfo/piclist

[David C Brown]

Very Interesting. I shall file that alongside Hamming's original paper :-)

__________________________________________
David C Brown
43 Bings Road
Whaley Bridge
High Peak Phone: [phone]
Derbyshire eMail: ***@gmail.com
SK23 7ND web: www.bings-knowle.co.uk/dcb
<http://www.jb.man.ac.uk/~dcb>



*Sent from my etch-a-sketch*

Post by Harold Hallikainen
Speaking of Karnaugh mapping, the original paper on it is at
http://bh.hallikainen.org//wiki/uploads/karnaugh.pdf .
Harold

Post by David C Brown
Up to five inputs it is pretty trivial to use a Karnaugh map for
minimization.
Beyond that I was always inclined to use ROM or PAL rather than discrete
logic.
Too aggressive minimisation can lead to maintenance difficulties.when
nobody can understand the logic.
__________________________________________
David C Brown
43 Bings Road
Whaley Bridge
High Peak Phone: [phone]
SK23 7ND web: www.bings-knowle.co.uk/dcb
<http://www.jb.man.ac.uk/~dcb>
*Sent from my etch-a-sketch*

Post by RussellMc
Mildly edited email from a friend.
I came across this website while looking for a tool to help with minimising
Direct or link access below may work for you. Otherwise see 3rd option
1. http://tma.main.jp/logic/index_en.html
2. *Online minimization of boolean functions
<http://tma.main.jp/logic/index_en.html>*
3.
​​
http://tma dot main dot jp /logic/index_en.html
​
Apologies for the odd-ball URL - I had to obfuscate it as otherwise an
overly
officious spam detector objected and bounced my e-mail (saying the domain
main.jp was on their spam list).
_____________________________________
​
It seems to work well with the 4-input examples I have thrown at it,
although
ultimately it's not of much use for my current problem because I really need
something that I can call from a Pascal program in order to automate an
optimal
search that would otherwise be impracticable if done manually.
I have found a Pascal implementation of the classic Quine-McCluskey
algorithm
(which is effectively an exhaustive search and which once upon I time I
sort of
understood) - but it's written in Italian ! Still that's maybe no harder
for
me to understand than the many other implementations written in C that seem
to
exist :-)
Regards,
Ken
--
http://www.piclist.com/techref/piclist PIC/SX FAQ & list archive
View/change your membership options at
http://mailman.mit.edu/mailman/listinfo/piclist

--
http://www.piclist.com/techref/piclist PIC/SX FAQ & list archive
View/change your membership options at
http://mailman.mit.edu/mailman/listinfo/piclist

--
FCC Rules Updated Daily at http://www.hallikainen.com
Not sent from an iPhone.
--
http://www.piclist.com/techref/piclist PIC/SX FAQ & list archive
View/change your membership options at
http://mailman.mit.edu/mailman/listinfo/piclist