Mano M Morris Digital design PrenticeHall 19841991 M

ספרי עזר – Mano, M. Morris, Digital design, Prentice-Hall, 1984/1991 ( )האוניברסיטה הפתוחה – M. Morris Mano, Charles R. Kime, Logic and computer design fundamentals, 1997/2000 – Gideon Langholz, Abraham Kandel and Joe L. Mott , Foundations of digital logic design, 1998 – Zvi Kohavi, Switching And Finite Automata Theory, 1979

בסיס 60 2*60+27=147

Intel Strata. Flash • כל תא זכרון שומר שתי סיביות • Intel Technology Journal Q 4'97

ASCII קוד

UTF 8 0 1 2 3 4 5 6 7 ց ւ փ ք օ ֆ և D 6 8_ ր 0580 0581 0582 0583 0584 0585 0586 0587 D 6 9_ D 6 A_ D 6 B_ 8 9 A B C D E F ։ ֊ 0588 0589 058 A 058 B 058 C 058 D 058 E 058 F 0590 0591 0592 0593 0594 0595 0596 0597 0598 0599 059 A 059 B 059 C 059 D 059 E 059 F 05 A 0 05 A 1 05 A 2 05 A 3 05 A 4 05 A 5 05 A 6 05 A 7 05 A 8 05 A 9 05 AA 05 AB 05 AC 05 AD 05 AE 05 AF ־ 05 B 0 D 7 8_ ׀ 05 C 0 05 B 1 05 B 2 05 B 3 05 B 4 05 B 5 05 B 6 05 B 7 05 B 8 05 B 9 05 BA 05 BB 05 BC 05 BD 05 BE 05 BF 05 C 4 05 C 5 05 C 6 05 C 7 05 C 8 05 C 9 05 CA 05 CB 05 CC 05 CD 05 CE 05 CF ׃ 05 C 1 05 C 2 05 C 3 ן מ ם ל כ ך י ט ח ז ו ה ד ג ב D 7 9_ א 05 D 0 05 D 1 05 D 2 05 D 3 05 D 4 05 D 5 05 D 6 05 D 7 05 D 8 05 D 9 05 DA 05 DB 05 DC 05 DD 05 DE 05 DF ת ש ר ק צ ץ פ ף ע D 7 A_ נ 05 E 0 ס 05 E 1 05 E 2 05 E 3 05 E 4 05 E 5 05 E 6 05 E 7 05 E 8 05 E 9 05 EA 05 EB 05 EC 05 ED 05 EE 05 EF D 7 B_ װ 05 F 0 ױ 05 F 1 ײ 05 F 2 ׳ 05 F 3 ״ 05 F 4 05 F 5 05 F 6 05 F 7 05 F 8 05 F 9 05 FA 05 FB 05 FC 05 FD 05 FE 05 FF UTF 8 0 5 6 7 8 9 A B C D E F 1 2 3 4

[7, 4] קוד המינג בינארי • Let our codeword be (x 1 x 2 … x 7) ε F 27 • x 3, x 5, x 6, x 7 are chosen according to the message (perhaps the message itself is (x 3 x 5 x 6 x 7 )). • x 4 : = x 5 + x 6 + x 7 (mod 2) • x 2 : = x 3 + x 6 + x 7 • x 1 : = x 3 + x 5 + x 7

גלוי שגיאה בקוד המינג • Let a = x 4 + x 5 + x 6 + x 7 (=1 iff one of these bits is in error) • Let b = x 2 + x 3 + x 6 + x 7 • Let c = x 1 + x 3 + x 5 + x 7 • If there is an error (assuming at most one) then abc will be binary representation of the subscript of the offending bit.

שמוש בקוד • Suppose (y 1 y 2 … y 7) is received • If abc ≠ 000, then we assume the bit abc is in error and switch it. • If abc=000, we assume there were no errors (so if there are three or more errors we may recover the wrong codeword).