Username & Password

Traditional login

Username
Password
Or

Microsoft Account

Recommended

Sign in instantly using your Microsoft account.

Logo

Create Account

Microsoft Account

Recommended

Or

Auth Server

Alternative method

Connect to our authentication server:
Once connected, run this command with your desired password:
Replace <your_password> with your actual password

8 bit barrel shifter version A

Jul 31, 2024 Public
By:
Minecraft
Width
Depth
Height
Version
Redstone
Logic
Your browser does not support the HTML5 canvas tag.

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

Ketari_
Ketari_
2x2x7 per bit, 8 bits binary RAM (combinational)

2x2x7 per bit, 8 bits binary RAM (combinational)

Small binary cobinational RAM that does not use observers/pistons/1.21 items or anything of sort. MCHPRS compatible. Size: 2x2x7 blocks per bit (stackeable + can be flipped to merge outputs of different modules)In theory possible to get to 6 blocks long due to large amount of air space where the toches are but... probably not too doable tbh Write/Read are on the same glass tower, but still work separately and don't affect one another. Reading and writing to the same byte at the same time is not possible, only one at a time.&nbsp;

redstone logic computational +2 more
Aug 23, 2024
View 2x2x7 per bit, 8 bits binary RAM (combinational)
Wueffi
Wueffi
Broken Circle drawer by Inno [InnocentOne933] (draws squares)

Broken Circle drawer by Inno [InnocentOne933] (draws squares)

64x64 !!

redstone computational
Sep 08, 2024
View Broken Circle drawer by Inno [InnocentOne933] (draws squares)
cmoa
cmoa
Test item filter

Test item filter

Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. Ut enim ad minim veniam, quis nostrud exercitation ullamco laboris nisi ut aliquip ex ea commodo consequat. Duis aute irure dolor in reprehenderit in voluptate velit esse cillum dolore eu fugiat nulla pariatur. Excepteur sint occaecat cupidatat non proident, sunt in culpa qui officia deserunt mollit anim id est laborum.

Jul 25, 2024
View Test item filter
Nano_
Nano_
Hex Ladner fisher adder

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.

redstone logic computational +2 more
Jul 31, 2024
View Hex Ladner fisher adder

Details

ID:
RMylt_
Created:
11 months ago
Format:

Share

Download Options
Choose how you'd like to download or use this schematic.
In-game command
Direct link