**Q4 - HLSM from C code****a) Given the following C code, design a HLSM.**- **Inputs**: 32-bit int A, 1-bit go- **Outputs**: 1-bit done, 32-bit int Z- **Storage**: r_A, r_Z```cmain() { while (!go); done = 0; Z = 0; if (A < 0) { A = abs(A); } while (A > 0) { A = A / 2; Z += A; } done = 1;}```**Explanation:**This C code snippet is used to design a High-Level State Machine (HLSM). It includes the necessary inputs and outputs for the machine and outlines the storage requirements.- A 32-bit integer `A` is the input, together with a 1-bit `go` signal.- The output is a 1-bit `done` signal and a 32-bit integer `Z`.- Storage variables `r_A` and `r_Z` are utilized internally. **Code Flow:**1. The main function starts with a busy-wait loop (`while (!go);`) that pauses execution until the `go` signal is true.2. The `done` flag is initially set to 0, signifying the process is not complete.3. `Z` is initialized to 0.4. If `A` is less than 0, it takes the absolute value of `A`.5. A while loop runs as long as `A` is greater than 0. Within this loop: - `A` is divided by 2. - The current value of `A` is added to `Z`.6. Once the process is complete, `done` is set to 1.

Answered: Image /qna-images/answer/e55dcf2a-1045-4bed-9ee1-fb146bbc455a.jpg

Answered: a) Given the following C code, design a…

a) Given the following C code, design a HLSM. Inputs = 32-bit int A, 1-bit go Outputs Storage = r_A, r_Z %3D = 1-bit done, 32-bit int Z main () { while (!go); done = 0; Z = 0; if (A < 0) {

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Similar questions

AVR assembly coding
Please make sure the assembly file can work in SPIM
1. Please help me answer this engineering question
NAND2TETRIS HARDWARE SIMULATOR HiLoMux - This has one 8-bit input bus, in, and one 4-bit output bus, out. Alsopresent is a sel input, which is used to select what appears on out. Ifsel is false, then out should contain the lower 4-bits of in (i.e. in[0],in[1], in[2], in[3]). If sel is true, then out should contain theupper 4-bits of in (i.e. in[4] mapped to out[0], in[5], mapped toout[1], etc.). In other words, the HiLoMux can be used to select anibble from a byte please use the skeleton program below CHIP HiLoMux{ IN in[8], sel; OUT out[4]; PARTS: }
translate the following MIPS code to C. Assume that the variables i, j, and k areassigned to the registers $s0, $s1, and $s2, respectively. Assume that the baseaddress of the array A is in registers $s6.Loop: blt $s0, $s1, Exitbge $s1, $s2, Exitaddi $s1, $s1, 5j LoopExit:addi $t0, $zero, 4ble $s0, $t0, Donesll $t1, $s0, 2add $t2, $s6, $t1sw $zero, 0($t2)Done:
a) The figure below shows a ROM which is used to implement the functions fı,f2,f3 and f4. АВС 2 1 0 3-to-8 decoder 0 1 23 4 5 6 7 fi f2 f3 f4 Deduce the truth table of functions f1,f2,f3 and f4 ABC |f1 f2 f3 f4 1 0 1 0 1 1 1 1 1 1 1 |11|1 b) Program the PAL shown in figure to implement the following logic functions Fl=ĀD+BC+BCD F2=ABCD+AC+BCD F1 F2
2- Write a program in assembly language for the 8085 microprocessor to receive 10 bytes of data via the SID and store it at the memory address (3000h) using a baud rate of 1200. And two high pulses must be sent before each byte (start bits) and one low pulse after each byte (end bits). You can use this flowchart, but you should notice that this flowchart deals with one byte, and you are required to deal with 10 bytes No CDD CHHICE 10 Yes SIDATA Read SID Start Bit? Wait for Half-Bit Time Set up Bit Counter Wait Bit Time Read SID Save Bit Decrement Bit Counter All Bits Received? Add Bit to Previous Bits Go Back to Get Next Bit Return
d) FF + 01
Use the following data declarations: .data byte Val word Val sbyte 1, 2, 3, FCh word 1000h, 2000h, 3000h, 4000h dwordVal dword 34567890h, 90785634h, 0Ah, 33445566h Show the value of the final destination operand after each of the following code fragments has executed: (If any instruction/s is invalid, indicate "INV" as the answer and briefly explain why) a. mov bh,byteVal+2 b. mov edx,1 C. add dx,[wordVal+4] mov ecx,5 xchg ecx,[dwordVal+12] d. mov ah, byte Val+3 sub ah,[ byte Val+0] sub ah,[ byte Val +2] e. mov eax, dword ptr dwordVal+7 f. movsx cx,byteVal+3 answer bh= answer edx= answer ecx= answer ah= answer eax= answer (show your answer in binary) CX=
These two VHDL concurrent statements provide different results: 1. D <= A+C; E <= B+D; 2. E <= B+D; D <= A+C; True False
Consider the following C-statement(s). Assume that the variables f, g, h, i, and jare assigned into the registers $s0, $s1, $s2, $s3, and $s4 respectively. Convert into MIPS code. Then convert to Machine Code. f = (i+h) * (j-g)
Q2. [Structural Verilog] Design a 2-bit subtractor unit. Inputs are A and B, and output is S, 2-bits each. As a sub-module you can call the Full Adder module (E Assume this is given to you as library) which takes in 3 inputs (X, Y and Z) and produces 2 outputs (F, C). Write structural HDL