- 117
- 267 671
Down to the Wires
Canada
เข้าร่วมเมื่อ 21 ส.ค. 2017
How computing hardware works. All the way down to the wires. Assembly language. Flip-flops and gates. ALU, CPU, and all the acronyms. Caches, pipelines, memory hierarchies.
MIPS quick reference sheet: www.dropbox.com/s/jw8nmpguiaw0ufo/MIPS%20sheet%201.6.pdf?dl=0
MIPS datapath design: www.dropbox.com/s/qs4eq88cf4e5w4z/mips%20datapath.pdf?dl=0
MIPS quick reference sheet: www.dropbox.com/s/jw8nmpguiaw0ufo/MIPS%20sheet%201.6.pdf?dl=0
MIPS datapath design: www.dropbox.com/s/qs4eq88cf4e5w4z/mips%20datapath.pdf?dl=0
Classical logic with Quantum gates
The toffoli gate is universal, in that it can perform any classical logic. In this video I show briefly how to implement classical logic functions with only Toffoli gates. We introduce toffoli, show it's classical interpretation, show how to produce AND and NOT classical functions, how to build a simple logical function, and then we show OR. We remind the viewer that any input superposition values that are altered should be restored.
มุมมอง: 1 122
วีดีโอ
Intro to Current Events playlist
มุมมอง 14211 หลายเดือนก่อน
This playlist will be a place for conversations about issues of technology in general, from AI to social media, and the impact of technology on society. I am often asked to provide expert commentary to media organizations, and this is a way to expand the conversation to other audiences.
9 ARM autoindexing
มุมมอง 136ปีที่แล้ว
This video series starts at the very beginning and shows each step in the design of modern computing hardware. From bits to gates to registers to CPU. A followup video series will show how the CPU is expanded with modern techniques like cache, pipelining and multiprocessing.
8 ARM Load Store
มุมมอง 130ปีที่แล้ว
This video series starts at the very beginning and shows each step in the design of modern computing hardware. From bits to gates to registers to CPU. A followup video series will show how the CPU is expanded with modern techniques like cache, pipelining and multiprocessing.
7 ARM Multiply
มุมมอง 58ปีที่แล้ว
This video series starts at the very beginning and shows each step in the design of modern computing hardware. From bits to gates to registers to CPU. A followup video series will show how the CPU is expanded with modern techniques like cache, pipelining and multiprocessing.
6 ARM Shifting
มุมมอง 75ปีที่แล้ว
This video series starts at the very beginning and shows each step in the design of modern computing hardware. From bits to gates to registers to CPU. A followup video series will show how the CPU is expanded with modern techniques like cache, pipelining and multiprocessing.
5 ARM Immediate Encoding Examples
มุมมอง 951ปีที่แล้ว
This video series starts at the very beginning and shows each step in the design of modern computing hardware. From bits to gates to registers to CPU. A followup video series will show how the CPU is expanded with modern techniques like cache, pipelining and multiprocessing.
4 ARM Operand 2 for Data
มุมมอง 159ปีที่แล้ว
This video series starts at the very beginning and shows each step in the design of modern computing hardware. From bits to gates to registers to CPU. A followup video series will show how the CPU is expanded with modern techniques like cache, pipelining and multiprocessing.
3 ARM Data Instructions
มุมมอง 171ปีที่แล้ว
This video series starts at the very beginning and shows each step in the design of modern computing hardware. From bits to gates to registers to CPU. A followup video series will show how the CPU is expanded with modern techniques like cache, pipelining and multiprocessing.
2 ARM Programmer Model
มุมมอง 169ปีที่แล้ว
This video series starts at the very beginning and shows each step in the design of modern computing hardware. From bits to gates to registers to CPU. A followup video series will show how the CPU is expanded with modern techniques like cache, pipelining and multiprocessing.
1 ARMv7 Intro
มุมมอง 404ปีที่แล้ว
This video series starts at the very beginning and shows each step in the design of modern computing hardware. From bits to gates to registers to CPU. A followup video series will show how the CPU is expanded with modern techniques like cache, pipelining and multiprocessing.
FP8 Doing Math with Floating Point Numbers
มุมมอง 846ปีที่แล้ว
This video series starts at the very beginning and shows each step in the design of modern computing hardware. From bits to gates to registers to CPU. A followup video series will show how the CPU is expanded with modern techniques like cache, pipelining and multiprocessing.
FP7 Denormalized, Denormal, or Subnormal Numbers
มุมมอง 1.1Kปีที่แล้ว
This video series starts at the very beginning and shows each step in the design of modern computing hardware. From bits to gates to registers to CPU. A followup video series will show how the CPU is expanded with modern techniques like cache, pipelining and multiprocessing.
FP6 Special numbers
มุมมอง 180ปีที่แล้ว
This video series starts at the very beginning and shows each step in the design of modern computing hardware. From bits to gates to registers to CPU. A followup video series will show how the CPU is expanded with modern techniques like cache, pipelining and multiprocessing.
FP4 Ranges and Exclusions of Floating Point Numbers
มุมมอง 710ปีที่แล้ว
FP4 Ranges and Exclusions of Floating Point Numbers
FP3 An 8-bit Toy Encoding of Floating Point Numbers
มุมมอง 892ปีที่แล้ว
FP3 An 8-bit Toy Encoding of Floating Point Numbers
Faster binary addition: the carry lookahead adder
มุมมอง 837ปีที่แล้ว
Faster binary addition: the carry lookahead adder
Architecture 2: introduction to the next series
มุมมอง 155ปีที่แล้ว
Architecture 2: introduction to the next series
MD4: Signed Multiplication and Booth's Algorithm
มุมมอง 3692 ปีที่แล้ว
MD4: Signed Multiplication and Booth's Algorithm
Simplification 6: NAND implementation example
มุมมอง 6K3 ปีที่แล้ว
Simplification 6: NAND implementation example
These state diagrams made me go crazy, until I've watched this tutorial. Thank you so much!!!
thank you for this video! do you still have the reference sheet?
can you expound more on how line 4 was distributed in product of maxterms
THANK YOU! <3
Thank you so much! The whole playlist helped me a ton - never delete them; these videos are the best! God bless!
Thankyou so much
sir you are goated
I learned more with these 4 videos than in the past few weeks. Thanks a lot!
I wish I had a professor like you in my college
very helpful, thank you so much
uh
Another question…a qubit can represent more than one bit, is it due to its spin direction and angle ? For example, a qubit can spin up or down, therefore the spin up can represent 1 and spin down can represent 0, and thus one qubit can represent one bit. In addition to up/down spin, it can also spin at an angle, for example, 90 degrees, 180 degrees or 270 degrees. So, from this degree distinction, a qubit can represent more bits. Thus, more angles more bit representation. My question is, how do you detect and measure the direction and angle of a qubit ?
For example, when you implement an AND gate, there are two physical transistors tied together with two bit inputs and one output. So with qubits, how do you physically AND two qubits and detect the one output ?
Best explaination ever
Sir, you are a great teacher! Thanks so much ❤❤❤❤
This is the best, most concise explanation of this I've ever seen. Thank you.
that was very helpful. thanks
Thank you
thank you very much so easy to understand
Holy wow”, this explanation is so clear! 💫
ABI BEN SENIN DASAGINI YIYEYIM
You look like Ryan Gosling
what's a "literal"
very well explained, thank you
Thank you. Took long enough to find someone who could actually explain this in an easy matter
Thanks!
What is the difference between a bubble and an inverter if they both do the same?
A bubble is just a shorthand notation for logical inversion, either on an input or an output of a gate. its quicker and easier than drawing a complete inverter. The transistor implementation of a NAND gate is smaller and faster than an AND gate and a NOT gate, but for the logic problems it's the same.
Have to admit I was confused by the title - I was looking for a discussion of the 4-bit floating point representation commonly used in ML applications these days, and referred to as FP4 (as opposed to FP8, FP16, or FP32, talking about the bit representation length), and it seems that this video only discusses FP8. Then I realized that it might be the course or module number for this video. Whoops!
Great video! Just found your channel today! Will there be more "Current Event" Videos soon?
That’s the plan! Are there specific topics you’d like to see covered?
shoutout to u sir
Saviour!
I have been struggling with full adder for almost a year cause i was new to logical circuits and your explanation is amazing thank you.
Is there any difference in changing POM to SOM with duality and demorgan's law? Suppose i have POM of (a,b) = M0.M1. Is the SOM m0+m1 (using demorgans) or m2+m3 (using duality)?
amazing explanation
W rizz bro you're saving my life rn
great video, thank you
Amazing explanation. Thank you!
shouldn't the final answer be 1111_0111_1111? instead of what he give as 3:20, he actually bracket up 9 numbers instead of 8.
How 0.1x2 rais power -3 equal to 1.0x2 rais power -2?
Why need swap significands? How substraction is performed? How significands are aligned? They need 2 bits to the left (one for carry of integer parts of 1+1 if both exponents are equal and another one for sign if signs of significands are different). What is doing first rounding or normalization?
Quick note: at 09:24, the result of this is actually A'B'. it needs one more inverter on the result to make (A'B')'
thats what I get for making "just a quick response video" to stuff that happens in class 🙃
@@DowntotheWires its okay prof, this was very helpful thanks alot!!!
thx very helpful
thank u so muvhhhh !!! such a legend
You explained very clear. Thank you sir. I use your videos series to understand more what I learned in my class (from a computer science student).
You helped me to solve a confusion which I have had for long.. thanks sir ❤
You are the best help. Thanks for sharing. Great job!
Thank you sir for a very informative video. It helps me understand more what I studied in my class.
thank you bro
This is literally the only resource that I've found that *actually* explains what minterms and maxterms are in an easily understandable way, as well as clearly showing their relevance. I (somehow) managed to get through a dissertation on formal methods without it truly clicking in the way it just has. You're an excellent teacher, thanks for putting this up!
Awesome. Looking forward to it.