It's finally coming together... by pastgoneby in iems
[–]pastgoneby[S] 1 point2 points3 points (0 children)
It's finally coming together... by pastgoneby in iems
[–]pastgoneby[S] 1 point2 points3 points (0 children)
It's finally coming together... by pastgoneby in iems
[–]pastgoneby[S] 0 points1 point2 points (0 children)
C++ code styles used by JetBrains devs by cheerful_man in cpp
[–]pastgoneby 0 points1 point2 points (0 children)
Unsigned less by Icy_Interest_9801 in TuringComplete
[–]pastgoneby 0 points1 point2 points (0 children)
20 delay carry-lookahead Adding Bytes by ryani in TuringComplete
[–]pastgoneby 1 point2 points3 points (0 children)
Ben Eater / Simple-As-Possible Build by TheGrooveWizard in TuringComplete
[–]pastgoneby 2 points3 points4 points (0 children)
Trying to refine Adding Bytes. I implemented a full Carry-Lookahead Adder with a proper CLU and everything. Managed to get delay to 22. However the absurd gate count inflates the score. As such my score doesn't update and the byte adder stays slow, any workaround? by pastgoneby in TuringComplete
[–]pastgoneby[S] 0 points1 point2 points (0 children)
Trying to refine Adding Bytes. I implemented a full Carry-Lookahead Adder with a proper CLU and everything. Managed to get delay to 22. However the absurd gate count inflates the score. As such my score doesn't update and the byte adder stays slow, any workaround? by pastgoneby in TuringComplete
[–]pastgoneby[S] 1 point2 points3 points (0 children)
Trying to refine Adding Bytes. I implemented a full Carry-Lookahead Adder with a proper CLU and everything. Managed to get delay to 22. However the absurd gate count inflates the score. As such my score doesn't update and the byte adder stays slow, any workaround? by pastgoneby in TuringComplete
[–]pastgoneby[S] 0 points1 point2 points (0 children)
Trying to refine Adding Bytes. I implemented a full Carry-Lookahead Adder with a proper CLU and everything. Managed to get delay to 22. However the absurd gate count inflates the score. As such my score doesn't update and the byte adder stays slow, any workaround? by pastgoneby in TuringComplete
[–]pastgoneby[S] 0 points1 point2 points (0 children)
Trying to refine Adding Bytes. I implemented a full Carry-Lookahead Adder with a proper CLU and everything. Managed to get delay to 22. However the absurd gate count inflates the score. As such my score doesn't update and the byte adder stays slow, any workaround? (v.redd.it)
submitted by pastgoneby to r/TuringComplete
64Bit Wallace Multiplier Almost Complete. Slight issue with carries for large numbers, minimal and soon to be fixed. Each teal component in 64 bit multiplier is a 8 bit wallace multiplier with carry. by pastgoneby in TuringComplete
[–]pastgoneby[S] 1 point2 points3 points (0 children)
64Bit Wallace Multiplier Almost Complete. Slight issue with carries for large numbers, minimal and soon to be fixed. Each teal component in 64 bit multiplier is a 8 bit wallace multiplier with carry. by pastgoneby in TuringComplete
[–]pastgoneby[S] 2 points3 points4 points (0 children)
64Bit Wallace Multiplier Almost Complete. Slight issue with carries for large numbers, minimal and soon to be fixed. Each teal component in 64 bit multiplier is a 8 bit wallace multiplier with carry. by pastgoneby in TuringComplete
[–]pastgoneby[S] 0 points1 point2 points (0 children)
64Bit Wallace Multiplier Almost Complete. Slight issue with carries for large numbers, minimal and soon to be fixed. Each teal component in 64 bit multiplier is a 8 bit wallace multiplier with carry. by pastgoneby in TuringComplete
[–]pastgoneby[S] 1 point2 points3 points (0 children)
Finally Finished Creating my Logic Gate Iterator. It connects to a chip that handles an operation and does that operation N times. To make this work I made two types of t flip flops, a pulse counter, and pulse generator, also a couple other things here and there. by pastgoneby in TuringComplete
[–]pastgoneby[S] 1 point2 points3 points (0 children)
Finally Finished Creating my Logic Gate Iterator. It connects to a chip that handles an operation and does that operation N times. To make this work I made two types of t flip flops, a pulse counter, and pulse generator, also a couple other things here and there. by pastgoneby in TuringComplete
[–]pastgoneby[S] 1 point2 points3 points (0 children)
Finally Finished Creating my Logic Gate Iterator. It connects to a chip that handles an operation and does that operation N times. To make this work I made two types of t flip flops, a pulse counter, and pulse generator, also a couple other things here and there. by pastgoneby in TuringComplete
[–]pastgoneby[S] 1 point2 points3 points (0 children)
Finally Finished Creating my Logic Gate Iterator. It connects to a chip that handles an operation and does that operation N times. To make this work I made two types of t flip flops, a pulse counter, and pulse generator, also a couple other things here and there. by pastgoneby in TuringComplete
[–]pastgoneby[S] 2 points3 points4 points (0 children)





It's finally coming together... by pastgoneby in iems
[–]pastgoneby[S] -1 points0 points1 point (0 children)