LAB 7.

Slides:



Advertisements
Similar presentations
Even/odd parity (1) Computers can sometimes make errors when they transmit data. Even/odd parity: is basic method for detecting if an odd number of bits.
Advertisements

Hamming Code.
Error Correcting Memory
parity bit is 1: data should have an odd number of 1's
Computer Engineering II
Computer Organization and Architecture
Computer Organization and Architecture
+ CS 325: CS Hardware and Software Organization and Architecture Internal Memory.
ERROR CORRECTION.
CHAPTER 2 Digital Combinational Logic/Arithmetic Circuits.
Chapter 7 Memory and Programmable Logic
Memory and Programmable Logic
Practical Session 11 Codes. Hamming Distance General case: The distance between two code words is the amount of 1-bit changes required to reach from one.
COMPUTER ARCHITECTURE & OPERATIONS I Instructor: Hao Ji.
Forward Error CORRECTION A little magic. Hamming in perspective Typically errors are corrected with retransmission. Hamming lets the receiver determine.
Number Systems and Codes
Error Detection and Correction.  Corrupted files  Attachments that won’t open  Files that won’t download  Videos that won’t play Errors occur when.
MANINDER KAUR RAM and ROM Chips 24-Nov
EKT 221 Digital Electronics II
RNJ 10/02/091 3 Computing System Fundamentals 3.6 Errors Prevention and Detection.
Memory and Programmable Logic
Physics 413 Chapter 1 Computer Architecture What is a Digital Computer ? A computer is essentially a fast electronic calculating machine. What is a program.
Chapter Two Memory organisation Examples of operating system n Windows 95/98/2000, Windows NT n Unix, Linux, n VAX/VMS IBM MVS n Novell Netware and Windows.
EKT 221 : Digital 2 Memory Basics
Error Detection and Correction
Digital Components and Combinational Circuits Sachin Kharady.
Fuw-Yi Yang1 數位系統 Digital Systems Department of Computer Science and Information Engineering, Chaoyang University of Technology 朝陽科技大學資工系 Speaker: Fuw-Yi.
Main Memory -Victor Frandsen. Overview Types of Memory The CPU & Main Memory Types of RAM Properties of DRAM Types of DRAM & Enhanced DRAM Error Detection.
Chapter 5 Internal Memory. Semiconductor Memory Types.
Digital Electronics Chapter 7 Memory and Programmable Logic.
Memory Intro Computer Organization 1 Computer Science Dept Va Tech March 2006 ©2006 McQuain & Ribbens Built using D flip-flops: 4-Bit Register Clock input.
Riyadh Philanthropic Society For Science Prince Sultan College For Woman Dept. of Computer & Information Sciences CS 251 Introduction to Computer Organization.
Memory Cell Operation.
CYPRESS SEMICONDUCTOR. 2 Cypress Confidential QDR Class vs DDR III (DRAM) 8 8 DDR3 SDRAM QDR2+ SRAM Multiplexed Address Bus (Row &
Overview All data can be corrupted, for reliable communications we must be able to detect and correct errors implemented at the data link and transport.
VLSI AND INTELLIGENT SYTEMS LABORATORY 12 Bit Hamming Code Error Detector/Corrector December 2nd, 2003 Department of Electrical and Computer Engineering.
ERROR DETECTING AND CORRECTING CODES -BY R.W. HAMMING PRESENTED BY- BALAKRISHNA DHARMANA.
CS 111 – Sept. 13 Error detection Error correction Review/practice chapter 1 questions Commitment: –Please read sections 2.1 and 2.2.
1 Block Coding Messages are made up of k bits. Transmitted packets have n bits, n > k: k-data bits and r-redundant bits. n = k + r.
Error Detection and Correction – Hamming Code
Error-Detecting and Error-Correcting Codes
Digital Circuits Introduction Memory information storage a collection of cells store binary information RAM – Random-Access Memory read operation.
Computer Architecture Error Correcting Codes Ralph Grishman Oct (Text pp and B-65-67) NYU.
Lecture 13.
Gunjeet Kaur Dronacharya Group of Institutions. Outline I Random-Access Memory Memory Decoding Error Detection and Correction Read-Only Memory Programmable.
Chapter 7 Memory and Programmable Logic
CS2100 Computer Organisation
Memory and Programmable Logic
parity bit is 1: data should have an odd number of 1's
Vladimir Stojanovic & Nicholas Weaver
Error Correcting Code.
Representing characters
TAO1221 COMPUTER ARCHITECTURE AND ORGANIZATION LAB 3 & 4 Part 1
Even/odd parity (1) Computers can sometimes make errors when they transmit data. Even/odd parity: is basic method for detecting if an odd number of bits.
Coding Theory Dan Siewiorek June 2012.
Computer Architecture & Operations I

Lecture 14 - Dynamic Memory
Chapter 3 The Data Link Layer.
Digital Logic & Design Dr. Waseem Ikram Lecture 40.
Chapter 7 Memory and Programmable Logic
Information Redundancy Fault Tolerant Computing
CS 325: CS Hardware and Software Organization and Architecture
parity bit is 1: data should have an odd number of 1's
Error Detection and Correction
4-Bit Register Built using D flip-flops:
Presentation transcript:

LAB 7

The address lines select one particular word The address lines select one particular word. Each word in memory is assigned an identification number, called an address, starting from 0 up to 2k - 1, where k is the number of address lines. memories vary greatly in size and may range from 1,024 words, requiring an address of 10 bits, to 232 words, requiring 32 address bits. It is customary to refer to the number of words (or bytes) in memory with one of the letters K (kilo), M (mega), and G (giga). K is equal to 210, M is equal to 220, and G is equal to 230. Thus, 64K = 216, 2M = 221, and 4G = 232.

Exercise 7.1 The memory units that follow are specified by the number of words times the number of bits per word. How many address lines and input–output data lines are needed in each case? (b) 2G * 8 (c)  2G x 32 (d)256K*64

Exercise 7.1 (b)  4M x 16 4M = 4×220 = 222, so 4M x 16 takes 22 address lines and 16 data lines, for a total of 22 + 16 = 38 I/O lines. (c)  2G x 32 2G = 2×230 = 21 ×230 = 231, so 2G x 32 takes 31 address lines and 32 data lines, for a total of 63 I/O lines. (d)256Kx64=218 x64 A=18, D=64

Exercise 7.9 A DRAM chip uses two‐dimensional address multiplexing. It has 13 common address pins, with the row address having one bit more than the column address. What is the capacity of the memory? 13 + 12 = 25 address lines. Memory capacity = 225 words The DRAM chip has 12 rows and 13 columns, for a total of 25 address lines. 225 memory locations.

Exercise 7.9 13 + 12 = 25 address lines. Memory capacity = 225 words

Exercise 7.14 It is necessary to formulate the Hamming code for four data bits, D3, D5, D6, and D7, together with three parity bits, P1, P2, and P4. (a)* Evaluate the 7‐bit composite code word for the data word 0010. (b)  Evaluate three check bits, C4, C2, and C1, assuming no error. (c)  Assume an error in bit D5 during writing into memory. Show how the error in the bit is detected and corrected. (d)  Add parity bit P8 to include double‐error detection in the code. Assume that errors occurred in bits P2 and D5. Show how the double error is detected.

Exercise 7.14 1