Fractal Tree Vector Data Return Unit With Forwarder Modules
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing fractal tree structures in network-on-chip systems face challenges in reliably and efficiently transmitting vector data from leaf nodes to the central node without data corruption or conflict, as component data often becomes out of order during transmission.
Innovation Solution
A device and method for a vector data returning processing unit in a fractal tree, featuring a central node, leaf nodes, and forwarder modules with a local cache and data processing capabilities, where each leaf node has a setting bit to shift or return data, and a Handshake Protocol ensures reliable communication, with adders for splicing or adding data to maintain order and prevent overflow.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If component data is transmitted from leaf nodes to the root node in a fractal tree structure, then data aggregation is achieved, but data order is lost and transmission reliability deteriorates
Solution Approach 1:
The patent applies preliminary action by equipping each leaf node with a setting bit that determines in advance whether data needs to be shifted. This pre-established configuration allows the system to maintain data order during transmission without requiring complex post-transmission sorting mechanisms, thus preserving reliability while achieving aggregation.
Solution Approach 2:
The forwarder modules act as intermediaries between leaf nodes and the root node. These modules contain local caches and data processing components that temporarily hold and process vector data during transmission, ensuring data integrity and order is maintained throughout the multi-level fractal tree structure.
2Reliability
If complex mechanisms are established to maintain data order, then data transmission reliability improves, but device complexity increases
Solution Approach 1:
The patent segments the fractal tree into N groups of leaf nodes, with each group having the same number of nodes and self-similarity. This segmentation allows independent processing of data groups, simplifying the overall mechanism while maintaining reliability through modular forwarder modules at each level.
Solution Approach 2:
Each leaf node is equipped with specific local characteristics including a setting bit and unique identifier. This local quality differentiation allows simple individual node operations that collectively maintain global data order without requiring complex centralized control mechanisms.
3Measurement precision
If vector data is shifted in leaf nodes, then data positioning accuracy improves, but processing time increases
Solution Approach 1:
The patent changes the parameter of data positioning by using setting bits to control shifts of preset bandwidth bits to corresponding positions. This parameter-based approach allows efficient bit-level manipulation that achieves precise data positioning without requiring extensive processing time, as the shift amount is predetermined.
Data Source
AI summary
An example device comprises a central node for receiving vector data returned by leaf nodes, a plurality of leaf nodes for calculating and shifting the vector data, and forwarder modules comprising a local cache structure and a data processing component, wherein the plurality of leaf nodes are divided into N groups, each group having the same number of leaf nodes; the central node is individually in communication connection with each group of leaf nodes by means of the forwarder modules; a communication structure constituted by each group of leaf nodes has self-similarity; the plurality of leaf nodes are in communication connection with the central node in a complete M-way tree approach by means of the forwarder modules of multiple levels; each of the leaf nodes comprises a setting bit.