Network on chip with network coding function, network topology of the network on chip, and route algorithm of the network topology

Abstract

The invention discloses a network on chip router with a network coding function, a network topology applied to the network on chip, and a route algorithm of the network topology. A coding sub-module codes received multiple packet data, the coded data is forwarded in a multicast mode from an intermediate route node, and a decoding sub-module, according to known information, decodes the received data to restore the received data to original data. A network coding module realizes compression of the packet data, so that information content carried by data transmitted through a network is increased, the problem of how to reach a network transmission capacity limit is solved, network scale expansion is facilitated, and the network coding function can reduce the network load and improve the network performance.

Description

technical field [0001] This application relates to the field of communication technology, in particular to an on-chip network with network coding function and its network topology and routing algorithm used in the field of scientific research. Background technique [0002] With the development of integrated circuit technology, the shortcomings of bus-structured system-on-chip are becoming more and more prominent. In order to overcome these shortcomings, network-on-chip (NoC) came into being. The network on chip adopts a reasonable topology structure and introduces routing and switching theory, so its parallel communication characteristics can meet the needs of future development. For example, in 2012, Intel's latest on-chip network processor Xeon Phi 5110P integrated 60 IP cores with 22nm process 3D transistors, operating frequency up to 1.053GHz, and achieved double-precision peak performance up to 1.011TFlops, becoming a high-performance computing platform. new foundation...

AI Technical Summary

Problems solved by technology

[0004] Many kinds of multicast packets may arrive at an intermediate router at the same time. Since ordinary routing nodes can only forward one kind of multicast packets at a time, other multicast packets need to wait in line, which reduces the throughput of the network, and cannot be achieved by the "maximum flow rate". The maximum transmission capacity determined by the minimum cut theorem

Images