Timeline for How to make a full adder using 1/4 DEMUXs and 1 NOR gate?
Current License: CC BY-SA 4.0
15 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jan 30, 2019 at 18:30 | comment | added | jonk | @JoeDough Okay. And I admit I had a hard time reading your words with clarity. | |
Jan 30, 2019 at 18:25 | comment | added | JoeDough | @jonk it wasn't easy to me for some reason.Basically I tried to find the solution using solutions that worked on other problems (as if I was a machine learning algorithm -.-). | |
Jan 30, 2019 at 18:16 | comment | added | jonk | @JoeDough Oh. That's easy, isn't it? (I thought this was a hard problem, from reading.) | |
Jan 30, 2019 at 16:21 | vote | accept | JoeDough | ||
Jan 30, 2019 at 16:19 | comment | added | JoeDough | @jonk a 1 bit full adder (two 1 bit numbers + 3rd bit) using as many demuxes as needed and just one NOR gate. | |
Jan 30, 2019 at 16:18 | comment | added | JoeDough | @analogsystemsrf it can be used for anything as long as it is used only once. | |
Jan 30, 2019 at 3:48 | comment | added | jonk | Are you trying to make a 1-bit full adder out of any number of demuxes plus just one NOR? Or are you trying to make an N-bit adder out of any number of demuxes plus just one NOR for the entire N-bit adder? I'm not sure I'm clear on the question. (Everyone else seems to know. But I'm not sure.) | |
Jan 30, 2019 at 3:21 | comment | added | analogsystemsrf | Is the NOR gate to provide the combination of the Carry bits? | |
Jan 29, 2019 at 20:42 | answer | added | Eugene Sh. | timeline score: 1 | |
Jan 29, 2019 at 20:22 | comment | added | Eugene Sh. | @JoeDough I agree. I don't have a solution from the top of my mind as well. If you ask me if it is a good exercise that is teaching any useful engineering skill - I would say no. | |
Jan 29, 2019 at 20:15 | comment | added | JoeDough | @EugeneSh.I did, I've spent over 1 hour and still have no clue if this is even possible with given constraints.Considering how there's (almost) infinite amount of things that can be done and only one of them is correct, this is pretty difficult. | |
Jan 29, 2019 at 20:03 | comment | added | Eugene Sh. | I don't think there is a general procedure here. Start with each FA function distinctly and see how you can implement with the given constraints. | |
Jan 29, 2019 at 20:03 | comment | added | Justin | There isn't a general procedure. This is a puzzle-type problem, not the kind of thing that you'll actually encounter in real design. Still fun if you like puzzles :) | |
Jan 29, 2019 at 20:00 | review | First posts | |||
Jan 29, 2019 at 20:04 | |||||
Jan 29, 2019 at 19:59 | history | asked | JoeDough | CC BY-SA 4.0 |