All About Circuits Forum  

Go Back   All About Circuits Forum > Electronics Forums > Homework Help

Notices

Homework Help Stuck on a textbook question or coursework? Cramming for a test and need help understanding something? Post your questions and attempts here and let others help.

Reply   Post New Thread
 
Thread Tools Display Modes
  #1  
Old 11-18-2008, 12:47 PM
vvkannan vvkannan is offline
Senior Member
 
Join Date: Aug 2008
Location: India
Posts: 137
Default Boolean function implementation

I have some doubts regarding boolean function implementation using multiplexers.
If i have to implement a product of sum function like this
example:F(A,B,C,D)=pi M(0,3,5,7,8,9)+d(2,6)
and i convert this POS into SOP expression.should i have to remove all the dont cares?
Taking the above example should i write :sum m( 1,,4,10..15) or should i include the dont cares?
Cant we implement a boolean function directly from a POS expression?
Thank you
Reply With Quote
  #2  
Old 11-18-2008, 04:52 PM
Ratch Ratch is offline
Banned
 
Join Date: Mar 2007
Posts: 1,068
Default

vvkannan,

Quote:
I have some doubts regarding boolean function implementation using multiplexers
I will try to eradicate those doubts. By the way, Boolean is capitalized because it is derived from a person's name. So is the personal pronoun "I" capitalized. And contractions use an apostrophe.

Quote:
If i have to implement a product of sum function like this
example:F(A,B,C,D)=pi M(0,3,5,7,8,9)+d(2,6)
and i convert this POS into SOP expression.should i have to remove all the dont cares?
Taking the above example should i write :sum m( 1,,4,10..15) or should i include the dont cares?
You include the don't cares because their terms can be present or missing in either the SOP or POS form of the equation.

Quote:
Cant we implement a boolean function directly from a POS expression?
Certainly, just use a AND gate instead of an OR gate.

Ratch
Reply With Quote
  #3  
Old 11-19-2008, 12:04 PM
vvkannan vvkannan is offline
Senior Member
 
Join Date: Aug 2008
Location: India
Posts: 137
Default

Thank you for correcting me.




So don't cares can either be included or not and it would not make any difference .
Thank you
Reply With Quote
  #4  
Old 11-19-2008, 02:55 PM
Ratch Ratch is offline
Banned
 
Join Date: Mar 2007
Posts: 1,068
Default

vvkannan,

Quote:
So don't cares can either be included or not and it would not make any difference .
Oh, oh, I think you misunderstood me. I said that the terms that the don't cares represent could either be present or missing. Let me clarify. You use the don't cares if you need them to simplify a expression and discard them if you don't. It does make a difference if you don't use them if they can simplify a expression. In your example, PI M(0,3,5,7,8,9)+d(2,6), the complement is either SIGMA m(1,2,4,6,10-15) or SIGMA m(1,2,4,10-15) . The only difference between the two SIGMA expressions is the presence or absence of SIGMA m(2,6) . That is the definition of don't cares, so you can write the complement of PI M(0,3,5,7,8,9)+d(2,6) as SIGMA m(1,2,4,10-15)+d(2,6) . Another way to understand it better is to make a truth table and mark the don't cares with a "X". Then you can see that the don't care terms can be used for either the original expression or its complement.

Ratch
Reply With Quote
  #5  
Old 11-20-2008, 03:18 PM
vvkannan vvkannan is offline
Senior Member
 
Join Date: Aug 2008
Location: India
Posts: 137
Default

Thank you very much .Now you really have eradicated my doubts.
Reply With Quote
Reply   Post New Thread

Tags
, ,


Related Site Pages
Section Title
Worksheet Sum-of-Products and Product-of-Sums expressions
Worksheet Boolean algebra
Worksheet Karnaugh mapping
Video Lecture Completing Truth Tables - Digital
Textbook Finite State Machines : Sequential Circuits Counters
Textbook Decoder : Combinational Logic Functions
Textbook (sum) and (product) notation : Karnaugh Mapping
Textbook Minterm vs maxterm solution : Karnaugh Mapping
Textbook Converting truth tables into Boolean expressions : Boolean Algebra
Textbook Boolean arithmetic : Boolean Algebra


Similar Threads
Thread Thread Starter Forum Replies Last Post
Numbers for Boolean functions Bit-per-Beat Math 9 09-12-2008 11:21 PM
Boolean Algebra (Simplification?) kazafz Math 7 08-14-2008 01:53 PM
Boolean function multiplexer philmetz Homework Help 1 06-05-2008 11:25 AM
Boolean tricky problems !! HMHQ8 Math 3 01-31-2008 07:13 AM
GUI project in mat lab m75allen Programmer's Corner 6 05-30-2007 11:51 AM

Thread Tools
Display Modes

Posting Rules
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts

BB code is On
Smilies are On
[IMG] code is On
HTML code is Off

Forum Jump


All times are GMT. The time now is 05:45 AM.


User-posted content, unless source quoted, is licensed under a Creative Commons Public Domain License.
Powered by vBulletin
Copyright ©2000 - 2014, vBulletin Solutions, Inc.