Design a combinational circuit with four input lines

Assignment Help Computer Engineering

Reference no: EM13698120

You need to design a combinational circuit to find the 9's complement

Question: Design a combinational circuit with four input lines that represent a decimal digit in BCD and four output lines that generate the 9's complement of the input digit.

Provide a fifth output that detects an error in the input BCD number. This output should be equal to logic 1 when the four inputs have one of the unused combinations of the BCD code.

Try to reduce the amount of IC's used.

I cannot seem to get this to work for some reason could somebody provide me the answer of this question?

Reference no: EM13698120

Questions Cloud

Twos complement arithmetic : Show 6910 and -11210 in 8-bit binary two's complement arithmetic and then add the numbers.

What would be the representation 010 in 16-bit binary : What would be the representation 010 in 16-bit binary one's complement -

Write a program that will find the smallest number : How to do the subsequent program WITHOUT USING Arrays - Write a program that will find the smallest, largest, and average values in a collection of N numbers. Get the value N before scanning each value in the collection of N numbers.

What does the term polymorphism mean : What does the term polymorphism mean and Use case models use two patterns - "Common Sub Behavior" and "Interrupts as Extensions." Explain these two patterns in your own terms and give an example for each pattern.

Design a combinational circuit with four input lines : Design a combinational circuit with four input lines that represent a decimal digit in BCD and four output lines that generate the 9's complement of the input digit.

Describe the tcp three-way handshake : Describe the TCP three-way handshake - What is the handshake used for? Which two of the six TCP flags were set in the packets used to cause the TCP session to be closed or terminated?

Calculate the celsius equivalent of a fahrenheit temperature : Prepare a program to calculate the Celsius equivalent of a Fahrenheit temperature

Prepare the pseudo code for given algorithm : They alternate: dark, light, dark, light, and so on. You want to get all the dark disks to the right-hand end, and all the light disks to the left-hand end.

Show that if the statement is true : Show that if the statement P(n) is true for infinitely many positive integers, and the implication P(n+1) ---> P(n) is true for all n>=1, then P(n) is true for all positive integers.

User Account

All Pages