LCDF4_Chap_01.pptVIP

* * * Answer 1: Converting 46 as integral part: Answer 2: Converting 0.6875 as fractional part: 46/2 = 23 rem = 0 0.6875 * 2 = 1.3750 int = 1 23/2 = 11 rem = 1 0.3750 * 2 = 0.7500 int = 0 11/2 = 5 remainder = 1 0.7500 * 2 = 1.5000 int = 1 5/2 = 2 remainder = 1 0.5000 * 2 = 1.0000 int = 1 2/2 = 1 remainder = 0 0.0000 1/2 = 0 remainder = 1 Reading off in the forward direction: 0.10112 Reading off in the reverse direction: 1011102 Answer 3: Combining Integral and Fractional Parts: 101110. 10112 * * * Divide integral part equation on slide 21 by r. Note that the powers of r decline by 1 in the quotient and that a fraction a0/r results, giving a0 as the remainder. The next time, fraction a1/r results giving a1 as the remainder. In general, the remainder will be ai for the ith step. At the nth step, an/r will result with the quotient = 0. Similarly, for multiply, a–1 will emerge as the integral part first since r x r –1 = 1. * * Answer 1: 6 3 5 . 1 7 7 8 110|011|101 . 001|111|111 2 Regroup: 1|1001|1101 . 0011|1111|1(000)2 Convert: 1 9 D . 3 F 816 Answer 2: Marking off in groups of three (four) bits corresponds to dividing or multiplying by 23 = 8 (24 = 16) in the binary system. * * * * M = 10 Therefore n = 4 since: 24 =16 is ? 10 23 = 8 and the ceiling function for log2 10 is 4. * * * Answer 1: 6 Answer 2: 1010, 1011, 1100, 1101, 1110, 1111 * Answer: Both of these codes have the property that the codes for 0 and 9, 1 and 8, etc. can be obtained from each other by replacing the 0’s with the 1’s and vice-versa in the code words. Such a code is sometimes called a complement code. * * * 1 1 1 0 0001 1000 1001 011