Question

Explain error detection and error correction Writ
0 0
Add a comment Improve this question Transcribed image text
Answer #1

Answer 14 .

Error Detection is a technique to detect any kind of error during the transmission of any information. There are two types of errors :

1. Singel Bit Error

2. Burst Error

To detect such errors we go with many error detection techniques , one of them is parity check. We add extra bit to our data so that reciever can detect the errors in the information.

Error Correction : This technique is used to correct the errors if found any in the sent item. The famous technique to correct the errors is hamming code.

16 ) AND operation :

0.0 = 0

0.1 = 0

1.0 = 0

1.1 = 1

-- OR operation

0.0 = 0

0.1 = 1

1.0 = 1

1.1 = 1

17) De- Morgans Law : Demorgan's law simply is :

( A U B ) ' = A' ∩ B'

( A ∩ B )' = ( A' U B ' )

example : U = { 1, 3, 5, 7, 9, 2, 6, 4, 8, 10 }

let A = {3, 2, 7, 5 ,8, 9 }

B = { 2, 5, 4, 8, 10}

A' = { 1, 4, 6, 10 }

B ' = { 1, 3, 6, 7, 9 }

A' U B' =   {1, 3, 4, 6, 7, 9, 10}

( A intersection B )' = {1, 3, 4, 6, 7, 9, 10}

Add a comment
Know the answer?
Add Answer to:
Explain error detection and error correction Write truth table for AND, OR, Exclusive OR gates Write...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • (1)Try to use NAND gates to achieve the truth table function of an XOR gate (2)...

    (1)Try to use NAND gates to achieve the truth table function of an XOR gate (2) Try to design a clicker for three people, it just needs two people to agree to pass.  A,B,C indicate the people, 0 means don't agree, 1 means agree. If it passes the result is 1. Please write the truth table, the SOP (sum of products) equation and draw the logic circuit for it. (3)Use a Karnaugh-map to simplify the following Boolean function: F= AB'C'+A'B'C'+AB'C+A'B'C+AB...

  • Build the truth table for half-adder and show one implementation using gates. Build a NOT gate...

    Build the truth table for half-adder and show one implementation using gates. Build a NOT gate from NOR gate. Build a NOT gate from NAND gate. Algebraic equation for XOR gate is A B bar + A bar B. Show that the algebraic equation for XNOR gate AB + A bar B bar. Draw a circuit for a 2-to-4 line decoder. 2-to-1 line multiplexer equation is given by Y = S bar I_0 + SI_1 Show an implementation of this...

  • 3. For the following circuit: B a. Give the truth table for F. b. Complete the...

    3. For the following circuit: B a. Give the truth table for F. b. Complete the following K-map and use it to give the minimized POS form for F(A,B,C). CIAB 00 01 11 10 C. Use boolean axioms and theorems on POS expression obtained in (b) to get the SOP form. The final SOP expression should have a maximum of two terms. d. Draw the logic circuit for the SOP form.

  • Q6. a) Write the output expression for the circuit shown in the figure. b) Develop truth...

    Q6. a) Write the output expression for the circuit shown in the figure. b) Develop truth table for the circuit. (1 Mark) (4 Marks) A B C 13 X D Fig.2 07 [5] a) Minimize the following logic function using K-Map. b) Implement the minimized expression using basic gates. (3 Marks) (2 Marks) F(A,B,C,D) = (0,2,5,7,8,10,13,15) Q8 a) Write the output expression of the logic circuit shown in the figure. b) Minimize the expression using Boolean laws and theorems. C)...

  • 3) Write the Boolean Expression for function Z as defined by the following Truth Table in...

    3) Write the Boolean Expression for function Z as defined by the following Truth Table in both canonical and simplified forms. Implement function Z using a NOT-AND-OR network. (Please, use straight lines for connections. Use shaded areas to neatly draw your gates.) Z 888 ABC 000 001 010 011 100 101 110 III Z (from Table) - Z (simplified) =

  • X 1. Determine the truth table for the above circuit. A B C 0 0 0...

    X 1. Determine the truth table for the above circuit. A B C 0 0 0 0 0 0 1 0 0 1 1 1 0 0 1 0 1 1 1 0 111 2. Determine the Karnaugh Map for the above circuit and do both an SOP minimization (the left KAI) and a POS minimization (the right KM). Write the minimized Boolean expressions below the corresponding Karnaugh Map BC ВС 00 01 11 10 00 01 11 10 0...

  • digital fundamentals thomas floyd Q8. A) Write the SOP (Minterm) Boolean expression for the truth table...

    digital fundamentals thomas floyd Q8. A) Write the SOP (Minterm) Boolean expression for the truth table in Fig 2 below and draw the logic circuit that will perform the logic in the truth table in. B) Finally implement the same logic circuit by universal gates. [2+2=4] Inputs Output Inputs Output с в А Y C B A Y 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 1 1 1 0 1 1...

  • (2) (5 pomis) TL A-011000103, B = 011011012. Clearly 3. Conversion between truth table, circuit diagram...

    (2) (5 pomis) TL A-011000103, B = 011011012. Clearly 3. Conversion between truth table, circuit diagram and Boolean function. (1) (6 points) For the circuit below, write the Boolean expression F(A, B, C). Then write down the truth table for F. (2) (4 points) Draw a circuit schematic diagram which implements the following Boolean function. (Don't simplify the expression.) F(X2, X1, Xo) = x;'(x2+xo)' + xo'X1X2 (3) (10 points) The output of a logic function F(A,B,C) is one only if...

  • Write out the truth table for the expression (A and B)xor (C or D). A NAND...

    Write out the truth table for the expression (A and B)xor (C or D). A NAND is the combination of two other basic logic gates. Name them. A NOR is the combination of two other basic logic gates. Name them. Explain how you can build an XOR gate from other basic logic gates. Explain how the logic gate for a 1-bit adder can be derived. How is a multi-bit adder built from a single-bit adder? How are 1's and 0's...

  • (a) Write a truth table. The input is 4-bit binary ABCD, A is MSB, D is...

    (a) Write a truth table. The input is 4-bit binary ABCD, A is MSB, D is LSB. The output is also represented by x. (b) Obtain an output expression in the form of a SOP. (c) Use Boolean Algebra to design a circuit consisting of only four inverters, four 3-input and gate, and one 4-input OR gate using the simplified and simplified expression obtained in (b). 4-6. The Excess-3 coding system is a four-bit digital coding system for encoding all...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT