CSCI 1120 Lecture Notes - Lecture 38: Memory Address, Truth Table, Instruction Register

• School: Dalhousie University
• Department: Computer Science
• Course: CSCI 1120
• Professor: Christian Blouin

Document Summary

1 of 2n possible outputs from a decoder, given n-bit code. Word line and the bit line interact through a transistor. If there is a 1, the current flows. If there is a 0, no current will flow. If word line is set to 1, current will flow through transistor and you can read if there is a 1 or a 0 on the bit line. The smallest addressable chunk of memory is a byte. You have one word line shared between 8 bits, which is one byte. 8 transistors, and a bit line for each. 32-bit architecture will fetch 4 bytes place them in a row and use a 32-lane highway of wires communicating one bit as part of a larger signal. We also need to have a sub-circuit which decided whether we are fetching or storing, because it is the same wire. Either copies the information into the mdr or pushes information into ram.