Computer Systems: A Programmer's Perspective (3rd Edition)
3rd Edition
ISBN: 9780134092669
Author: Bryant, Randal E. Bryant, David R. O'Hallaron, David R., Randal E.; O'Hallaron, Bryant/O'hallaron
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 4.3, Problem 4.19PP
Program Plan Intro
Processing stages:
- The processing of an instruction has number of operations.
- The operations are organized into particular sequence of stages.
- It attempts to follow a uniform sequence for all instructions.
- The description of stages are shown below:
- Fetch:
- It uses program counter “PC” as memory address to read instruction bytes from memory.
- The 4-bit portions “icode” and “ifun” of specifier byte is extracted from instruction.
- It fetches “valC” that denotes an 8-byte constant.
- It computes “valP” that denotes value of “PC” plus length of fetched instruction.
- Decode:
- The register file is been read with two operands.
- It gives values “valA” and “valB” for operands.
- It reads registers with instruction fields “rA” and “rB”.
- Execute:
- In this stage the ALU either performs required operation or increments and decrements stack pointer.
- The resulting value is termed as “valE”.
- The condition codes are evaluated and destination register is updated based on condition.
- It determines whether branch should be taken or not in a jump instruction.
- Memory:
- The data is been written to memory or read from memory in this stage.
- The value that is read is determined as “valM”.
- Write back:
- The results are been written to register file.
- It can write up to 2 results.
- PC update:
- The program counter “PC” denotes memory address to read bytes of instruction from memory.
- It is used for setting next instruction’s address.
- Fetch:
Combinational circuits and HCL expressions:
- The computational blocks are been constructed by accumulating several logic gates into network.
- The restrictions are been shown below:
- Each of input for logic gate should be associated to any one shown below:
- One of system inputs, that is identified as primary inputs.
- Output connection for some element in memory.
- Output of some logic gate.
- Outputs obtained from more than two logic gates could not be linked together.
- The wire would be driven to different voltages.
- It can cause malfunction in circuit.
- The network should not contain cycles.
- The loops in circuit can cause ambiguity in function
computed by network.
- The loops in circuit can cause ambiguity in function
- Each of input for logic gate should be associated to any one shown below:
- The “HCL” denotes a hardware control language that is used for describing control logic of different processor designs.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
Q.1.(a) (i) Use Karnaugh map to minimize the following SOP expression and also implement the
simplified expression.
04
Y = A'BC + A’B'C' + ABC' + AB'C'
Problem
1.10: Simplify
F(A, B,C, D) = ACD+
A'B + D'
Problem_#9] Perform the addition in 2's complement form.
(a) 33 and 15
(b) 56 and -27
(c) -46 and 25
(d) -110 and-84
|
Chapter 4 Solutions
Computer Systems: A Programmer's Perspective (3rd Edition)
Ch. 4.1 - Prob. 4.1PPCh. 4.1 - Prob. 4.2PPCh. 4.1 - Prob. 4.3PPCh. 4.1 - Prob. 4.4PPCh. 4.1 - Prob. 4.5PPCh. 4.1 - Prob. 4.6PPCh. 4.1 - Prob. 4.7PPCh. 4.1 - Prob. 4.8PPCh. 4.2 - Practice Problem 4.9 (solution page 484) Write an...Ch. 4.2 - Prob. 4.10PP
Ch. 4.2 - Prob. 4.11PPCh. 4.2 - Prob. 4.12PPCh. 4.3 - Prob. 4.13PPCh. 4.3 - Prob. 4.14PPCh. 4.3 - Prob. 4.15PPCh. 4.3 - Prob. 4.16PPCh. 4.3 - Prob. 4.17PPCh. 4.3 - Prob. 4.18PPCh. 4.3 - Prob. 4.19PPCh. 4.3 - Prob. 4.20PPCh. 4.3 - Prob. 4.21PPCh. 4.3 - Prob. 4.22PPCh. 4.3 - Prob. 4.23PPCh. 4.3 - Prob. 4.24PPCh. 4.3 - Prob. 4.25PPCh. 4.3 - Prob. 4.26PPCh. 4.3 - Prob. 4.27PPCh. 4.4 - Prob. 4.28PPCh. 4.4 - Prob. 4.29PPCh. 4.5 - Prob. 4.30PPCh. 4.5 - Prob. 4.31PPCh. 4.5 - Prob. 4.32PPCh. 4.5 - Prob. 4.33PPCh. 4.5 - Prob. 4.34PPCh. 4.5 - Prob. 4.35PPCh. 4.5 - Prob. 4.36PPCh. 4.5 - Prob. 4.37PPCh. 4.5 - Prob. 4.38PPCh. 4.5 - Prob. 4.39PPCh. 4.5 - Prob. 4.40PPCh. 4.5 - Prob. 4.41PPCh. 4.5 - Prob. 4.42PPCh. 4.5 - Prob. 4.43PPCh. 4.5 - Prob. 4.44PPCh. 4 - Prob. 4.45HWCh. 4 - Prob. 4.46HWCh. 4 - Prob. 4.47HWCh. 4 - Prob. 4.48HWCh. 4 - Modify the code you wrote for Problem 4.47 to...Ch. 4 - In Section 3.6.8, we saw that a common way to...Ch. 4 - Prob. 4.51HWCh. 4 - The file seq-full.hcl contains the HCL description...Ch. 4 - Prob. 4.53HWCh. 4 - The file pie=full. hcl contains a copy of the PIPE...Ch. 4 - Prob. 4.55HWCh. 4 - Prob. 4.56HWCh. 4 - Prob. 4.57HWCh. 4 - Our pipelined design is a bit unrealistic in that...Ch. 4 - Prob. 4.59HW
Knowledge Booster
Similar questions
- (x-) hkt 2 1 m y = e 1+ 4m q 1 + 4m²q+ Write a Python code to plot a graph of y against x for the given range oft values from 0 to 150. Let h = 6.2, m = 5.2, q = 8.6, k = 3.9. Each plot for different t values should be on the same page.arrow_forwardNovember 17, 2022 (15 pts) 3. C D- A combinational logic function F (A,B,C,D) is implemented by a 2-to-4 line active high decoder (C is MSB), a 4X1 multiplexer (A is MSB) and logic gates as shown below. Find the function F realized by this circuit, and express it in minimal sum-of-products form. Decoder CDDo CDD₁ cDD₂ CDD3 MUX OAB 1AB 2AB 3AB TI A B F (CD) (CD) CDV/C+0 Darrow_forward(d) All linear group block codes have an important property called "closure". Briefly describe this and demonstrate its operation with the following (5,2) code: Code Codeword a 00000 b 00111 C 11100 d. 11011arrow_forward
- 23&cmid%3D11597 es This course The code given below is a VHDL implementation of: library IEEE; use IEEE.STD_LOGIC_1164.ALL; entity design is Port ( A,B : in STD LOGIC; YO,Y1,Y2,Y3 : out STD LOGIC); end design; architecture behavior of design is begin YO <= ((NOT A)and (NOT B)); Yl <= ((NOT A) and B); Y2 <= (A and (NOT B)); Y3 <= (A and B); end behavior; Select one: O a. 4 to 2 encoder O b. None of the options O C.4 to 1 MUX O d. 2 to 4 decoderarrow_forwardProblem_#04] Use a Karnaugh map to find the simplified SOP expression for: (a) ABC + ABC + ABC (b) АC(В + C) (c) A(BC + BC) + A(BC + BC) (d) АВС + AВС + АВС + АВСarrow_forwardSample 1.1) Use Karnaugh Map to simplify following expression. 1- xyzt + x yzt + x y zt + xyzt + xy zt + xyzt + xyzt + xyzt 1.2) Hence, represent a logic circuit for the simplified expression.arrow_forward
- [Part.4] Manually draw the implementation of the function Q = X+ Y as logic circuit using 2x4 Decoder below (with depicting the internal structures). Indicate the input and output values on each connection,arrow_forwardQ6 [3-46] Write the AHDL code that will implement the following logic circuit. (a) Use a single Boolean equation. X RD МЕМ ROM-A W ROM-B Y RAM Varrow_forwardPROBLEM 21 - 0517: Write a subroutine which computes the roots of the quadratic equation a,x2 + a,x + a, = 0 according to the quadratic formula: X12 = (-az/2a,) + V[(a,/2a,)2 – (a,/a,)) (= [{a, + v(a?, - 4a,a,)} / 2a,]) (START SUBROUTINE QUAD COMPUTE, DISCRIMINANT (DISC) DISCarrow_forward3. More Boolean a) 10111100 OR 11100011= b) 11110010 AND 00110011= c) Implement xy+x'y'+y'z with NAND and inverter gates. d) Write a truth table for (b+cd)(c+bd) and express the function as a sum of minterms and a product of maxterms. e) Convert to the other canonical form F(A,B,C,D)= II(3,5,8,11). f) Convert x'+x(x+y')(y+z') into sum of products and product of sums.arrow_forward(c) Define a-conversion and show how it is used by reducing (Ary.ry)(Ary.cy) to normal form.arrow_forwardPart 1) Write VHDL code to implement the following Boolean function. х%3 (А + B). (В + С).В| o Provide a screen capture showing the entity and architecture of your VHDL code. Do not crop your screen capture, it should show your full PC screen. Perform functional simulation of your code in such a way as to show the correct operation of the circuit for different situations. o Provide a screen capture showing your functional simulation. Do not crop your screen capture, it should show your full PC screen. Complete the truth table using the FPGA development board. A 1 1 1 1 1. 1. 1. 1 1 1arrow_forwardarrow_back_iosSEE MORE QUESTIONSarrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education