‫Welcome to Booth algorithm demonstration on the basis to board for this demonstration we're using two
‫four digit seven segments plays on an external breadboard where each of the segments are tied together
‫through a 56 ohm resistor that is fed into the J J B C ma ports on the basis table and we also have
‫each in the digit so X on the 8 different digits of the 7 time displays are tied through and NTN transistor
‫transistor but the 470 ohm resistor connected to the base in each of these are tied into the J.C and
‫JD Pima ports are the bases to board.
‫We're also using two slide switches switch one and switch zero switch one is used to determine whether
‫we're adding or subtracting to our input one or two that we're going to be multiplying or switch 0 terminus
‫which which input we're going to be just being displayed so inputs 1 and 2 are displayed on the 7 segment
‫display located on the base keyboard.
‫So I toggle the switch it toggles between input 1 and 2.
‫They're both 0 right now.
‫So when I toggle switch 0 you don't see a difference.
‫And the push buttons we're use have different and different uses.
‫So button 0 1 and 2 are used to add or subtract depending upon what input switch one is.
‫If it's pulled low we're going to subtract that part high.
‫We're going to add.
‫And it's one 10 in 100 other MTs you either add or subtract and button three is that execute or start
‫command the Xuxa perform the multiplication.
‫It's a boost algorithm is designed to perform sine multiplication so we can multiply 2 negative numbers
‫one negative and positive or two positive numbers.
‫So let's get started with a little big example here.
‫Demonstration.
‫So to start out we are displaying we'll pull this high or displaying or input 1.
‫And since we have our switch down we're going to be subtracting so I press 1 we subtract and you know
‫if we have a negative number.
‫This is a negative one negative 2 3 4 5.
‫So input 1 is now a negative 5.
‫If I switch the pull of switch down or to splaying or input 2 which is still 0.
‫So of course will permit or switch 1 and we subtract once in our negative one and we'll pull high.
‫Now add in all the positive now.
‫So we'll make our input to a positive for if we look now before both of our inputs are we have negative
‫5 and positive 4.
‫So if we multiply negative 5 10 positive for the value of negative 20.
‫So when I hit the execute button it up for multiplication of negative five times 4 which gives us a
‫result of negative 20.
‫We can see in our result register and so we can do two negative numbers.
‫So instead of positive instead of positive 4 we'll start subtracting and make that negative.
‫So we'll make that negative too.
‫So now we have negative 2 primes negative 5 which is a value of tens of we hit our execute you now see
‫we have a positive 10 and we can do any different combinations so we can make these very large too will
‫make it negative to 15 and we'll make it negative 1 or 2.
‫So if you take negative one or two times negative to 15 that is equal to that or execute button that
‫is equal to 20 1930.
‫So you can take that combination.
‫We can make this 215 negative 15 positive by doing that.
‫We know that our result will be negative because we now have a negative time of positive or positive
‫as 185 times negative 1 0 to get our exit queue.
‫And that is a negative.
‫Eighteen thousand eight hundred seventy.
‫And so you can do eight different combination as low as negative nine hundred ninety nine and as high
‫as nine hundred ninety nine.
‫And that is the root algorithm demonstration running on the bases to board.