31 results about "Butterfly network" patented technology

A memory bank has a plurality of memories. In an embodiment, a forward unit applies logical memory addresses to the memory bank in a forward twofold access order, a backward unit applies logical memory addresses to the memory bank in a backward twofold access order, and a half butterfly network (at least half, and barrel shifters in 8-tuple embodiments) is disposed between the memory bank and the forward unit and the backward unit. A set of control signals is generated which are applied to the half or more butterfly network (and to the barrel shifters where present) so as to access the memory bank with an n-tuple parallelism in a linear order in a first instance, and a quadratic polynomial order in a second instance, where n=2, 4, 8, 16, 32,... This access is for any n-tuple of the logical addresses, and is without memory access conflict. In this manner memory access may be controlled data decoding.

A butterfly network for channel coding permutation and de-permutation. The butterfly network may include a first side and a second side, wherein each of the first side and second side has at least one terminal and two or more columns of nodes located between the first and second sides, wherein a first column of the columns may interface the first side, a second column of the columns may interface the second side and each of the columns comprises at least one node, wherein each node of the columns may be connected to a first number of nodes in each of adjacent columns next to the columns, and said first number may be identical for all the nodes in the network, and wherein the nodes which may be selected as switches are concurrently controlled to perform switching operations.

A multilayer butterfly network is shown that is operable to transform and align a plurality of fields from an input to an output data stream. Many transformations are possible with such a network which may include separate control of each multiplexer. This invention supports a limited set of multiplexer control signals, which enables a similarly limited set of data transformations. This limited capability is offset by the reduced complexity of the multiplexor control circuits. This invention used precalculated inputs and simple combinatorial logic to generate control signals for the butterfly network. Controls are independent for each layer and therefore are dependent only on the input and output patterns. Controls for the layers can be calculated in parallel.

A method is shown that is operable to transform and align a plurality of fields from an input to an output data stream using a multilayer butterfly or inverse butterfly network. Many transformations are possible with such a network which may include separate control of each multiplexer. This invention supports a limited set of multiplexer control signals, which enables a similarly limited set of data transformations. This limited capability is offset by the reduced complexity of the multiplexor control circuits.

The invention relates to a quantum network encoding method based on quantum state not being lost, which belongs to the technical field of network communication. It is characterized in that two pairs of non-maximally entangled states are pre-shared between the senders of the butterfly network, and the perfect transmission of quantum states with a fidelity of 1 can be achieved by performing a series of local operations on the sender. Adding helper particles on the sender side allows quantum states to be known before they are transmitted across the quantum network. The so-called non-lost quantum state means that when the transmission fails, the quantum state to be transmitted by the sender will not collapse into other states, but the quantum state will be reproduced at the sender. That is to say, when the measurement result of the auxiliary particle is |0>, the realization of |ψ> a →|ψ> b ; When the measurement result of the auxiliary particle is |1>, realize |ψ> a →|ψ> a . The present invention is based on quantum multi-unicast quantum network coding, realizes perfect quantum state cross transmission in the butterfly network model, provides a solution to the problem of quantum 2-pair and k-pair network communication, and has certain practical value .

The invention relates to the technical field of intra-chip communication, in particular to an on-chip network architecture based on butterfly network coding and a method for obtaining the shortest path. Each node of the network architecture is distributed in a honeycomb shape, and each honeycomb is an equilateral triangle formed by connecting lines of three adjacent nodes. The Z-X-Y shortest path routing based on the butterfly network coding based on-chip network architecture and the cellular topology can find the shortest routing path under the condition of avoiding deadlock; compared with the traditional topology, such as mesh topology, the cellular topology in the architecture provided by the present invention has natural shortcuts, which can shorten the number of hops of key links; at the same time, the architecture provided by the present invention will use butterfly network coding, which can greatly eliminate network hot spots and solve network congestion Problem: The cellular architecture provided by the present invention transmits data packets by wireless, transmits control signals by wire, and separates data from control signals, so that high-speed and high-efficiency data transmission can be accomplished.

A memory bank contains a plurality of memories, a first Butterfly network is configured to apply memory addresses to the memory bank, and a second Butterfly network is configured to pass data to or from the memory bank. A control signal is generated for the first and second Butterfly networks in accordance with a multiple access rule to enable parallel access to the memory bank, without memory access conflict, for one of a linear order and an interleaved order. The method and apparatus is particularly advantageous for use in turbo decoding.

The invention provides a chaotic image encryption method based on bit replacement and dynamic DNA coding. The objective of the invention is to solve the problem that security of chaotic encryption is affected by degradation of chaotic dynamics characteristics of an image encryption method based on a chaotic system in the prior art. The chaotic image encryption method comprises steps of firstly using the Keccak algorithm to calculate a hash value of a DNA sequence; based on the hash value, generating an initial state value of the chaotic mapping; by use of a hyperchaotic Chen system, generating a chaotic mapping index to carry out pixel position overall scrambling on an image; combining the Butterfly network to carry out bit position scrambling on each pixel, thereby achieving position grade scrambling; carrying out dynamic DNA coding on the image and combining the given DNA sequence to carry out XOR operation, thereby achieving replacing of the pixels; and finally, through the ciphertext feedback, further enhancing the chaotic and diffusion features. According to the invention, the chaotic image encryption method has big key space and is highly sensitive to a key, and capable of effectively resisting attacking operation of statistical analysis and exhaustion analysis.

The invention discloses a bidirectional single-bit state preparation method based on Brown state and network coding. The present invention combines state preparation based on the Brown state with network coding for the first time, cross-transmits from the sender to the receiver through the butterfly network and the five-bit Brown state, and prepares any single-bit quantum state bidirectionally. Mainly The feature is: on the basis of the butterfly network coding protocol, the quantum network coding model is established through state preparation. The channel shared by the source node and the destination node is obtained by channel modulation through the CNOT operation with five-bit Brown states plus auxiliary particles. Realize the transmission of known information in the entire network model. Compared with the quantum teleportation scheme, the resource consumption is less, and the transmission efficiency reaches a higher level. It also innovatively realizes two-way preparation, and the communication capacity reaches four bits per round. . It has broad application prospects in the field of quantum communication network technology.

The present invention relates to the field of communication, in particular to the field of wireless multi-core parallel processing, and specifically refers to a wireless multi-core array hotspot elimination method and architecture based on butterfly network coding; a wireless multi-core array architecture using distributed butterfly network coding is proposed, through multiple The disjoint butterfly network coding improves the network throughput of the wireless multi-core array, reduces the number of hotspots in the multi-core array, and provides an efficient and parallel multi-core collaborative processing platform for complex systems. At the same time, the present invention proposes a minimization hotspot algorithm to optimize the design of the wireless multi-core array architecture, aiming at maximizing the number of codes in the butterfly network to obtain the maximum coding gain. Through verification, the architecture proposed by the present invention can achieve at least 4% increase in throughput with less overhead, and eliminate at least 43% of hot spots in the network.