Questions tagged [digital-circuits]

Digital circuits use logic gates as the basic building block. A logic gate performs a logical operation on binary inputs and produces a single binary output. The Primary Logical operations are AND (conjunction), OR (disjunction) and NOT (negation).

Filter by
Sorted by
Tagged with
1 vote
3 answers
72 views

n (mod k) circuit

I wondered if, for a fixed integer k ≥ 3, the divisibility by k is in P/poly. How can I construct a boolean circuit for each n ∈ N, that takes as input an n-bit integer x and outputs whether 3|x? The ...
letsgetraw's user avatar
0 votes
0 answers
29 views

Ideal less-than-or-equal circuit for multiple inputs?

I'm interested in what the best way is to design a circuit that takes multiple values as input, and then outputs which value is the lowest. If multiple values are the lowest, it outputs "true&...
BipedalJoe's user avatar
0 votes
0 answers
15 views

Logical circuit for priority resolution in interrupt controllers (with configurable priority, not fixed)

I'm interested in what the typical solution is for priority resolution in interrupt controllers. I assume a hardware logic circuit is used, and not software. For interrupt controllers with fixed ...
BipedalJoe's user avatar
0 votes
0 answers
15 views

The definitions of terms in $P=CV^2f$

My textbook gives the equation for the power dissipation $$ P=CV^2 f $$ but after reading it a couple times, I can't get very clear on exactly what each of these is measuring. It describes $P$ as the ...
Addem's user avatar
  • 313
0 votes
0 answers
15 views

SOP Boolean expression of state variable and output of a Moore FSM

Disclaimer: I'm studying for an exam, but I don't have to hand in anything. I have the state transition diagram of the FSM and its states encoding: I want to find the sum-of-products (SOP) Boolean ...
Angelo's user avatar
  • 1
1 vote
3 answers
83 views

How do you write a logic function to determine if one 2s complement binary number is less than another?

Working on logic design in class, and I'm trying to figure out how to write a specific logic function [and by write, I mean something along the lines of (x NOR y) OR (a NOR b), for example] It asks to ...
mrak-p's user avatar
  • 11
1 vote
0 answers
28 views

Did Jon von Neumann know about Claude Shannon's work when he wrote the "First Draft of a Report on the EDVAC?"

In the "First Draft" JvN described an adder circuit to do binary addition, which was a much faster way of doing computer addition than using decimal lookup tables as the ENIAC had done. JvN'...
jimboweb's user avatar
  • 111
0 votes
0 answers
13 views

How do I implement x2 and ÷2 in Digital, and what does this exactly mean in terms of circuits? This question is for the arithmetic unit

So the first picture is an example arithmetic unit I have to implement using Digital. The second picture is all the work I have done, however I am stuck on the meaning and implementation of x2 and ÷2. ...
randomUser786's user avatar
0 votes
1 answer
31 views

K-Maps (Digital Logic, Computer System Architecture)

While i was going thru my course in Computer System Architecture (book taken Morris Mano) , I saw a question on KMaps can be solved in either of the ways but couldn't get which one to use when :- I’m ...
rudr's user avatar
  • 3
1 vote
2 answers
154 views

Combinational logic check if bits is prime

I wonder if there's Digital Logic Circuit (using combinatorial logic gates) that check if number is prime or not. For example given input fixed 8-bit that will produce 1-bit output. 00000101 will ...
Muhammad Ikhwan Perwira's user avatar
0 votes
0 answers
50 views

Need to define output functions from logic circuit

i was given a this circuit as exam question So we need to define functions g and f. I defined them as $g(x,y,z) = x \oplus y \oplus z$ and $f(x,y,z) = (x \oplus y) \cdot z$. By definition known that ...
David Sergeev's user avatar
1 vote
2 answers
130 views

How are instructions from software sent to digital circuit in cpu?

I am studying computer architecture in my university and there is something that's troubling me. I get the bigger picture of how instructions are executed in the fetch - execute cycle and the complete ...
Ali Ahmed's user avatar
2 votes
1 answer
62 views

A query regarding Definition of Circuit Family and Languages

This is a query regarding the definition of Circuit Family and Language (in the same Context). The textbook definitions of each are: Language: A function whose inputs and outputs are a finite bit of ...
J.Doe's user avatar
  • 743
0 votes
0 answers
689 views

Alu architecture of a Hack Computer

I'm currently studying the ALU architecture (of a Hack computer) and how it works. As part of my assignments, I have been asked the following question: If we want the ALU to compute the function y-1, ...
Hynisel's user avatar
1 vote
1 answer
41 views

How many functions require precisely $n^2$ gates?

I'm trying to determine an asymptotic bound on the cardinality of the following set of functions. It is the functions with $n$-bit inputs, $\{0,1\}$ output, and requires precisely $n^2$ NAND gates. I'...
Addem's user avatar
  • 313
0 votes
1 answer
63 views

Make the forward counter go down

Suppose, I have a 4-bit binary Incrementor that uses XOR gates to increment the inputted number by the value of 1 (b0001, to be precise). Suppose, we connect it to 4 D-Flip-Flops (DFF) to create a ...
InfiniteLoop's user avatar
1 vote
1 answer
162 views

What is combinational circuit?

I'm reading the Digital Design and Computer Architecture by David Harris, Sarah Harris. The authors give the following definition of combinational logic: A combinational circuit’s outputs depend only ...
Ilya Loskutov's user avatar
1 vote
1 answer
136 views

How do I compute the power consumption of a DRAM refresh?

Given a DRAM-based memory system with a total capacity of $x$ bytes, $y$ DRAM rows and a refresh time of $t$ milliseconds, how do I compute the power consumption for one DRAM refresh? I couldn't find ...
CNNTT's user avatar
  • 19
1 vote
0 answers
74 views

What is the intuitive logic behind the working of the Variable Entered K-Map (VEM)?

In this site here they have just said how to minimize a function using VEM. But no intuitive logic behind the same has been stated, making it too mechanical. And I am very bad at memorizing things, so ...
Abhishek Ghosh's user avatar
0 votes
2 answers
89 views

is duality principle in boolean algebra is true for every expression

Let say A = 1 and B = 1 and then A+B = 1 now by using duality(replacing or gate by and gate and 1 by 0) we can say that, A.B = 0 but this is not 0, because 1.1 = 1, so please anyone clear my ...
KAMRAN HASSAN's user avatar
0 votes
0 answers
378 views

Karnaugh Map: does maximal overlap always produce simplest boolean expression?

Suppose I have a 4x4 Karnaugh map with a few cells that are don't cares, and there are two ways of producing 3 groups of 4 cells. One of these ways overlaps groupings more that the other. Is one way ...
java's user avatar
  • 11
2 votes
1 answer
167 views

Proof of universality in the circuit model

I'm starting to study Turing machines, the Church-Turing conjecture and the circuit model. In particular, I'm interested in the proofs of universality that one can find in this context. So far, I have ...
RMPsp's user avatar
  • 23
0 votes
0 answers
825 views

Building an ALU on nandgame's website

I'm working on nandgame's website found here. I'm working on the ALU and here is an image of my implementation: My Implementation: And I compared it to this website's solution: Solution However when ...
Francis Cugler's user avatar
-1 votes
1 answer
2k views

How to calculate the output frequency of this counter?

The present state Q2,Q1,Q0 of the counter before applying the clock pulse was (101). If the input Clock frequency to the circuit is 100KHz, then the output frequency of the circuit will be ? My ...
Sanjay Verma's user avatar
1 vote
1 answer
63 views

What can this circuit be useful for?

I have calculated the boolean functions for $r$ and $f$: $f = \overline{s_1} \cdot s_0 + s_1 \cdot \overline{s_0}$. $r = \overline{s_0 \cdot s_1 \cdot s_2 \cdot s_3}$. Do you have an idea what an ...
Monika's user avatar
  • 183
2 votes
0 answers
84 views

How does the structure of a Luk-Vuillemin multiplier differ from a Wallace or Dadda multiplier?

I've read that Luk-Vuillemin multipliers are similar to Wallace multipliers but partition their inputs in a different way. How exactly does this partitioning work, how does it change the structure of ...
Eric's user avatar
  • 73
0 votes
1 answer
69 views

Full adder carry expression

I'm learning about logic circuits and I've come across full adder. In the book they derived its two carry out expressions - Cout = x&&y || x&&z || y&&z and Cout = x&&...
Abhirup Bakshi's user avatar
0 votes
1 answer
29 views

Is this truth table possbile

I am trying to figure out if this truth table is possible. I've tried inverting the numbers, adding them, subtracting them, but I still cant find anything that works. I am starting to think that this ...
user114756's user avatar
1 vote
0 answers
133 views

How do you compute and compare the delays between a (4:2) compressor and (3,2) counter carry save tree?

My question: How is Table 6.8 shown below computed for different operands? For example, for 3 operands how did they compute: Number of levels using (3,2) = 1 Number of levels using (4;2) = 1 ...
user1068636's user avatar
0 votes
0 answers
32 views

Which gates are “pre computation” universal?

In the following, by “functions” I will mean 2 input 1 output Boolean logic functions (for conciseness). A function is called “universal” if by using it (sometimes multiple times, chained together), ...
Phylliida's user avatar
  • 240
1 vote
1 answer
522 views

Minimizing a multiple output circuit with K-maps - and without

I'm currently working on learning to minimize a circuit which has multiple outputs using K-maps. My universities script seems rather unhelpful to me which left me in a spot where I have a very rough ...
Vladis Becker's user avatar
0 votes
2 answers
3k views

Minimum number of bits to represent negative number

Minimum number of bits required to represent $(+32)_{base10}$ and $(-32)_{base10}$ in signed two's compliment form? My attempt: 32 = 0100000 ( 1st zero - sign bit as positive) So to represent +32 we ...
Nascimento de Cos's user avatar
-1 votes
2 answers
61 views

Minimize circuit functions

$\begin{array}{rrrr | rr } 0& 0 & 0 & 0 & 1 &1 &1 &1 &1 & 1&0 \\ 0& 0 & 0 & 1 & 0 &1 &1 &0 &0 & 0&0 \\ 0& 0 & 1 &...
comrade's user avatar
  • 27
0 votes
2 answers
3k views

Addition of 3 bits using Full Adder when the initial carry bit is 0

How do I add 3 bits using full adder and basic gates, when the initial carry bit is 0?? I have tried using two full adders where two terminals of the first adder gets the first two inputs then the ...
ATM_shifat's user avatar
0 votes
1 answer
571 views

Hamming code distance and error detection

Suppose that data are transmitted in blocks of sizes 1000 bits. What is the maximum error rate under which error detection and retransmission mechanism (1 parity bit per block) is better than using ...
mahesh 2222's user avatar
2 votes
2 answers
617 views

Prime Implicants in Boolean Function

A Boolean function $F(X_1, X_2, X_3, X_4, X_5, X_6)$ of six variables is defined as $F = 1$, when three or more input variables are at logic 1. otherwise 0. How many essential prime implicants does F ...
Vineet's user avatar
  • 123
3 votes
1 answer
48 views

Efficient method for generating the smoothing function

The smoothing function of a boolean function with respect to one of its variables is the disjunction of its cofactors. For example given a Boolean function F(a,b,c) the cofactors with respect to a are ...
heavywater's user avatar
1 vote
0 answers
82 views

Minimum no. of flip flops for the given sequence

We want to design a synchronous counter that counts the sequence 0-1-0-2-0-3 and then repeats. The minimum number of flip-flops required to implement this counter is________ According to me, the ...
Abhilash Mishra's user avatar
0 votes
1 answer
437 views

Simplifying SOP: implementing OR with NAND

I am learning how to implement basic logic gates using NAND. I have learnt that you can use De Morgan's theorem as such: $a+b = \bar{\bar a} + \bar{\bar b} = \overline{(\bar a *\bar b)}$ In other ...
user99140's user avatar
0 votes
0 answers
31 views

Register output glitches and memory writes

When changing the write enable signal, of a memory element, from 1 to 0, what effect does the pipeline's register's output glitch have? Glitch that all of digital logic has, for the time of ...
Desperado's user avatar
  • 101
0 votes
1 answer
5k views

Number of literals in the given boolean expression

Count the number of literals in the following expression : F = AB' + BC' + CD' + DE' According to me, the answer should be 8. But my solution suggests that the answer should be 6. Can anyone help me ...
Abhilash Mishra's user avatar
2 votes
1 answer
130 views

What is the behavior of the given counter?

I found the following question - For the circuit shown in the figure, the delay of the bubbled NAND gate is 2ns and that of the counter is assumed to be zero If the clock (Clk) frequency is 1GHz, ...
Mr. Sigma.'s user avatar
  • 1,283
0 votes
0 answers
276 views

How to make counters for irregular integral pattern?

I can easily make counter for consecutive numbers. But for patterns, described in below question, I'm quite unsure about my approach. Question - We want to design a synchronous counter that ...
Mr. Sigma.'s user avatar
  • 1,283
4 votes
1 answer
1k views

Analog circuits for neural networks?

Neural networks in machine learning are inherently a continuous model of computation. Yet we use digital logic circuits with floating point numbers to "emulate" this continuity. I am wondering: is ...
user600670's user avatar
5 votes
1 answer
113 views

Trick/insight to I implement given boolean function with minimum numbers of given gate

I solved bunch of questions which give some function and then ask to implement it with minimum number of gates of specific type, each having specific number inputs. I was making mistakes in all those ...
RajS's user avatar
  • 1,637
0 votes
2 answers
734 views

SIMD Utilization

Can anyone help me understanding this exercise? We define the SIMD utilization of a program run on a GPU as the fraction of SIMD lanes that are kept busy with active threads during the run of a ...
scalpula's user avatar
0 votes
1 answer
2k views

Two dimensional 3 bit parity check

Can someone explain how do we find these parity bit errors?
Awais Korai's user avatar
0 votes
0 answers
34 views

Carry Look Ahead Adder for stabilize the sum

An four-bit carry-look-ahead adder for computing the sum of 2 numbers , where A and B are integers represented in 2's complement form. If the decimal value of A is 3, the decimal value of B that leads ...
Mark's user avatar
  • 11
-1 votes
1 answer
753 views

What is Control ROM and Decision ROM?

I have done some research but I cannot answer this question. Please Help.
Jamie's user avatar
  • 11
0 votes
2 answers
264 views

Logic Gates in circuits

We can make all the gates using nand or nor gates. My teacher told us that nand gates are cheap too, then why do we need other gates at all?
Aniswar S K's user avatar