The 3-D Mesh network-on-Chip (NoC) is widely used as the communication backbone of the 3-D multiprocessor system-on-chips (MPSoCs) and chiplet-based 3-D integrated systems, which enable the efficient computation parad...
详细信息
The 3-D Mesh network-on-Chip (NoC) is widely used as the communication backbone of the 3-D multiprocessor system-on-chips (MPSoCs) and chiplet-based 3-D integrated systems, which enable the efficient computation paradigm in Internet of Things (IoT) scenarios. The functional test is a good choice for the 3-D Mesh NoCs to detect the defects introduced in manufacture process, because it reuses the at-speed on-chip network and consumes little hardware overhead. However, the test time of the functional test in 3-D Mesh NoCs grows dramatically with the NoC size. In order to reduce the test time on the premise of ensuring fault coverage, this work proposes a functional test method leveraging the exclusive OR (xor) network coding (NC) technique. In this work, thexor NC function is embedded in the routers by the extension modules with an additional area overhead less than 3%, and an efficient functional test process based on the embeddedxor NC function is proposed. The proposed functional test process covers all the straight and turning paths, and all the working modes of the routers are tested. The time complexity of the proposed method only increases linearly with the NoC size, which manifests that the proposed test method is applicable for the large-scale 3-D Mesh NoCs.
We consider broadcasting a block of data packets to multiple users via instantly decodable network coding (IDNC) under the semi-online feedback transmission mode. In this paper, we first introduce a new class of IDNC ...
详细信息
We consider broadcasting a block of data packets to multiple users via instantly decodable network coding (IDNC) under the semi-online feedback transmission mode. In this paper, we first introduce a new class of IDNC schemes called lightweight IDNC, tailored for wireless broadcast with stringent computational load at the receiver end. Unlike traditional IDNC that may encode a larger number of original packets together, lightweight IDNC limits each coded packet to a combination of at most two original packets. Explicit lower bounds of the total completion delay as well as the decoding delay are respectively obtained for arbitrary lightweight IDNC schemes. We further investigate the number of transmission rounds as another performance metric, and explicitly characterize its distribution and expectation. The characterizations apply to arbitrary partition-based IDNC schemes, including the lightweight IDNC schemes considered in this paper. A new efficient algorithm is also proposed to construct lightweight IDNC schemes which grants the original packets with lower coding opportunity a higher priority to be encoded. Numerical analyses demonstrate that the lightweight IDNC schemes constructed by the new algorithm not only achieve lower completion and decoding delays in comparison with the ones constructed by the existing algorithm but also adhere closely to theoretical lower bounds, demonstrating their efficiency and practical utility.
Linearized Reed-Solomon (LRS) codes are evaluation codes based on skew polynomials. They achieve the Singleton bound in the sum-rank metric and therefore are known as maximum sum-rank distance (MSRD) codes. In this wo...
详细信息
Linearized Reed-Solomon (LRS) codes are evaluation codes based on skew polynomials. They achieve the Singleton bound in the sum-rank metric and therefore are known as maximum sum-rank distance (MSRD) codes. In this work, we give necessary and sufficient conditions for the existence of MSRD codes with a support-constrained generator matrix. The conditions on the support constraints are identical to those for MDS codes and MRD codes. The required field size for an [n, k](q)(m) LRS codes with support-constrained generator matrix is q >= l+1 and m >= max(l is an element of[l]){k-1+log(q) k,n(l)} , where l is the number of blocks and n(l) is the size of the l-th block. The special cases of the result coincide with the known results for Reed-Solomon codes and Gabidulin codes. For the support constraints that do not satisfy the necessary conditions, we derive the maximum sum-rank distance of a code whose generator matrix fulfills the constraints. Such a code can be constructed from a subcode of an LRS code with a sufficiently large field size. Moreover, as an application in network coding, the conditions can be used as constraints in an integer programming problem to design distributed LRS codes for a distributed multi-source network.
In this letter, we derive the closed-form analytical expressions for the exact Bit Error Rate (BER) of Physical Layer network coding (PNC) systems considering M-ary Quadrature Amplitude Modulation (M-QAM) schemes in O...
详细信息
In this letter, we derive the closed-form analytical expressions for the exact Bit Error Rate (BER) of Physical Layer network coding (PNC) systems considering M-ary Quadrature Amplitude Modulation (M-QAM) schemes in Orthogonal Frequency Division Multiplexing (OFDM) systems. We validate our results with Monte Carlo simulations.
The throughput of multicast networks depends not only on the transmission rate, but also on the number of receivers simultaneously served by the transmit signal. In this letter, we develop a cross-layer approach based...
详细信息
The throughput of multicast networks depends not only on the transmission rate, but also on the number of receivers simultaneously served by the transmit signal. In this letter, we develop a cross-layer approach based on joint multicast beamforming and rate aware instantly decodable network coding (J-MB-RA-IDNC), where instantly decodable network coding (IDNC) is employed at the network layer to increase the number of receivers to be served simultaneously, multicast beamforming is used at the physical layer to direct the beam toward the targeted receivers of the selected rate aware IDNC (RA-IDNC) schedule to improve the transmission rate. Simulation results demonstrate the effectiveness of our proposed scheme.
Future flying ad-hoc networks (FANETs) need to address issues related to delay and channel interference while ensuring high data transmission accuracy. In this letter, we propose a proximal policy optimization (PPO)-b...
详细信息
Future flying ad-hoc networks (FANETs) need to address issues related to delay and channel interference while ensuring high data transmission accuracy. In this letter, we propose a proximal policy optimization (PPO)-based adaptive adjustment algorithm for sliding window-based network coding to mitigate channel contention and signal degradation caused by increased traffic load. We model the adaptive adjustment of the sliding window size as a Markov decision process, considering effective rate, node congestion, and total delay in the reward function. To further improve the algorithm's performance, we enhance PPO with long short-term memory (LSTM) networks to process time-series data. Experimental results demonstrate that our method reduces delay, improves packet delivery rate and throughput compared with traditional sliding window network coding algorithms.
Efficient transmission of molecular data among labs is crucial for advancing cancer research and fostering collaboration. However, traditional data-sharing methods often cause delays, impeding research progress. This ...
详细信息
This paper introduces a novel approach to enhance fault-tolerance in biomedical data transmission using network coding methods. In healthcare, even minor data loss or delays can have severe consequences, especially du...
详细信息
Use of millimeter waves (mmWave) and other high frequency bands are expected to be a crucial part of 6G networks. Performance analysis of mmWave communication scenarios and modeling of various protocols in those situa...
详细信息
These research objectives are to evaluate and compare distinct community coding algorithms that can be applied in wireless networks to maximize network efficiency, throughput, and facts switch velocity. Special proced...
详细信息
暂无评论