Permutation Shuffling Circuit Using Random Code Bit Updates
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing shuffling algorithms require excessive computational resources, time, and hardware area, making them inefficient for applications requiring random order changes.
Innovation Solution
A permutation shuffling device and circuit that utilizes a random code memory circuit and a shuffling circuit to generate output index codes efficiently by performing bit update stages based on random codes, minimizing computation and hardware area.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional shuffling algorithms (Fisher-Yates, Knuth) are used, then shuffling operation can be performed, but computational complexity and time consumption are excessive
Solution Approach 1:
The patent segments the shuffling operation into multiple bit update stages, where each stage processes one bit position of the index code. This divides the complex shuffling task into simpler, parallelizable stages that can be executed efficiently in hardware, reducing overall computation time and improving shuffling operation speed.
2Productivity
If traditional shuffling algorithms are implemented in hardware, then shuffling function is achieved, but hardware area required is excessively large
Solution Approach 1:
The hardware is segmented into modular components including a random code memory circuit storing multiple random codes, and a shuffling circuit with multiple index bit fields that can be updated sequentially. This modular segmentation allows the hardware to achieve full shuffling capability while minimizing the area required compared to implementing traditional algorithms directly in hardware.
3Reliability
If more computational resources are allocated to shuffling, then shuffling accuracy and randomness are improved, but device complexity increases
Solution Approach 1:
The patent prepares multiple random codes in advance and stores them in the random code memory circuit before the shuffling operation begins. This preliminary action ensures high-quality randomness is available when needed, improving shuffling reliability without requiring complex computational resources during the actual shuffling execution, thus reducing device complexity.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
Some example embodiments provide a permutation shuffling device including a random code memory circuit configured to store first to nth random codes, and a first shuffling circuit configured to receive from outside a first input index code including first to nth input index bits, and to generate a first output index code by updating the first to nth input index bits based on the first to nth random codes, respectively.