8 bit barrel shifter version A
Description
3 ticks, excluding input/output bus
left shift, right shift, arithmetic right shift, rotate.
blue: data input, inverted, 15ss required
purple: shift amount input, normal, 15ss required.
keep in mind that doing a right shift by X is the same as doing a left shift by -X. please input the 2s complement if you want right shifts.
yellow: output, normal, low output
red:
- disable left shift, use when only doing right shift
- disable right shift, use when only doing left shift
- disable barrelshifter
- disable sign extend, for use with arithmetic right shift
Related Schematics
5b vertical decoder
Generated by https://github.com/ZpippoZ/minecraft-vertical-decoder-generator
Singular RCA Adder
A singular RCA adder of one of many designs. Includes inputs A and B, CIN, and COUT. CIN is the side input, COUT is the two-colored 4-long wire, and A and B are the levers at the back. RCA adder designs are great for redstone beginners - they are simple to explain, build, and use. However, there is a drawback: RCA has a delay for each adder you add. Each adder has to wait for the last to finish. That is where 'Ripple Carry Adder' gets it's name. It ripples. This means that not every calculation will take the same amount of time, and thus RCA is not recommended for applications with sensitive timings. If you do plan to use it in something with a clock, like a CPU, probably ensure that the clock is slow, as to give the RCA time. And for pipelined CPUs? Forget it.
WPU3, programmed to run Collatz
My 0.5Hz 8b CPU running the Collatz Conjecture (3n+1)
Hex Ladner fisher adder
32-Digit Hexadecimal Vertical Ladner-Fischer Adder in Minecraft Overview This Minecraft implementation is a 32-digit hexadecimal Ladner-Fischer Adder (LFA), a type of Parallel Prefix Adder (PPA) that balances the speed of carry-lookahead adders with the simplicity of ripple-carry adders. It's designed for high-performance addition operations within the constraints of Minecraft's redstone system. Key Features Vertical design utilizing Minecraft's signal propagation Processes 128 binary bits (32 hexadecimal digits) in parallel Torchless implementation for Minecraft efficiency Synchronized operation at 5Hz regardless of input Pure Ladner-Fischer architecture optimized for Minecraft Understanding the Ladner-Fischer Structure The LFA consists of four main stages, labeled S1 through S4: S1 (Stage 1): This is the preprocessing stage. Each S1 block takes two input bits and computes initial propagate (P) and generate (G) signals. S2 (Stage 2): Combines results from pairs of S1 blocks, calculating group P and G signals for 4-bit groups. S3 (Stage 3): Further combines results from S2, handling 8-bit groups. S4 (Stage 4): The final stage, which calculates the carry for the entire 16-bit section. How to interpret the structure: Signals flow from top (inputs) to bottom (outputs). Each stage combines information from the previous stage, allowing parallel computation of carries. Lower-order bits are resolved earlier, while higher-order bits utilize more stages. Performance The implementation leverages the logarithmic depth of LFA (O(log n)): Consistent 5Hz operation for all inputs, regardless of complexity Significantly outperforms Ripple Carry Adders (RCA) for large numbers This graph illustrates the time complexity of different adder types: RCA (Ripple Carry Adder): Shows linear growth O(n/2), becoming increasingly slower as bit count increases. PPA (Parallel Prefix Adder, including LFA): Demonstrates logarithmic growth O(log n), more efficient for larger bit counts. CCA (Carry Cancel Adder): Shown for comparison, exhibits stepwise linear growth, very efficient for smaller bit counts. The vertical dashed line at 32 bits (8 hex digits) shows where this implementation operates, demonstrating its efficiency compared to RCA and its practical performance in the Minecraft environment. Visual Representation These diagrams illustrate the Ladner-Fischer structure: Pink boxes at the top represent inputs (0-15 for a 16-bit section) Gray boxes (S1, S2, S3, S4) show the four computation stages Bottom gray boxes represent outputs, aligned with their corresponding inputs The structure demonstrates how carry information propagates efficiently through the adder, allowing for fast, parallel computation even with large numbers.
Download Options
/schematio download
RMylt_
Schematic Details
- Created: Jul 31, 2024
- Visibility: Public
- Type: N/A
- ID: RMylt_
-
WPU3, programmed to run Collatz
Wueffi • ID: EERCWG
-
32bit CCA by Sloimay & derov
Sloimay • ID: uH_ksG
-
Bin2Bcd by Xoliks, Flyingdean & Unnecessarymb
Sloimay • ID: NHO9SP
-
Cerebrum-0.4 -- CPU
PICOlo_1109 • ID: qFaOah
-
Imacianos classic II - box
dfgch • ID: ZHmlOX