205 research outputs found
Construction and Applications of CRT Sequences
Protocol sequences are used for channel access in the collision channel
without feedback. Each user accesses the channel according to a deterministic
zero-one pattern, called the protocol sequence. In order to minimize
fluctuation of throughput due to delay offsets, we want to construct protocol
sequences whose pairwise Hamming cross-correlation is as close to a constant as
possible. In this paper, we present a construction of protocol sequences which
is based on the bijective mapping between one-dimensional sequence and
two-dimensional array by the Chinese Remainder Theorem (CRT). In the
application to the collision channel without feedback, a worst-case lower bound
on system throughput is derived.Comment: 16 pages, 5 figures. Some typos in Section V are correcte
A General Upper Bound on the Size of Constant-Weight Conflict-Avoiding Codes
Conflict-avoiding codes are used in the multiple-access collision channel
without feedback. The number of codewords in a conflict-avoiding code is the
number of potential users that can be supported in the system. In this paper, a
new upper bound on the size of conflict-avoiding codes is proved. This upper
bound is general in the sense that it is applicable to all code lengths and all
Hamming weights. Several existing constructions for conflict-avoiding codes,
which are known to be optimal for Hamming weights equal to four and five, are
shown to be optimal for all Hamming weights in general.Comment: 10 pages, 1 figur
Nested-Loops Tiling for Parallelization and Locality Optimization
Data locality improvement and nested loops parallelization are two complementary and competing approaches for optimizing loop nests that constitute a large portion of computation times in scientific and engineering programs. While there are effective methods for each one of these, prior studies have paid less attention to address these two simultaneously. This paper proposes a unified approach that integrates these two techniques to obtain an appropriate locality conscious loop transformation to partition the loop iteration space into outer parallel tiled loops. The approach is based on the polyhedral model to achieve a multidimensional affine scheduling as a transformation that result the largest groups of tilable loops with maximum coarse grain parallelism, as far as possible. Furthermore, tiles will be scheduled on processor cores to exploit maximum data reuse through scheduling tiles with high volume of data sharing on the same core consecutively or on different cores with shared cache at around the same time
A Note on Distributed Estimation and Sufficiency
In relation to distributed parameter estimation, the notion of local and global sufficient statistics is introduced. It is shown that when a sufficiency condition is satisfied by the probability distribution of a random sample, a global sufficient statistic is obtainable as a function of local sufficient statistics. Several standard distributions satisfy the said sufficiency condition
Coded DNN Watermark: Robustness against Pruning Models Using Constant Weight Code
Deep Neural Network (DNN) watermarking techniques are increasingly being used to protect the intellectual property of DNN models. Basically, DNN watermarking is a technique to insert side information into the DNN model without significantly degrading the performance of its original task. A pruning attack is a threat to DNN watermarking, wherein the less important neurons in the model are pruned to make it faster and more compact. As a result, removing the watermark from the DNN model is possible. This study investigates a channel coding approach to protect DNN watermarking against pruning attacks. The channel model differs completely from conventional models involving digital images. Determining the suitable encoding methods for DNN watermarking remains an open problem. Herein, we presented a novel encoding approach using constant weight codes to protect the DNN watermarking against pruning attacks. The experimental results confirmed that the robustness against pruning attacks could be controlled by carefully setting two thresholds for binary symbols in the codeword
Multidimensional Graph Neural Networks for Wireless Communications
Graph neural networks (GNNs) have been shown promising in improving the
efficiency of learning communication policies by leveraging their permutation
properties. Nonetheless, existing works design GNNs only for specific wireless
policies, lacking a systematical approach for modeling graph and selecting
structure. Based on the observation that the mismatched permutation property
from the policies and the information loss during the update of hidden
representations have large impact on the learning performance and efficiency,
in this paper we propose a unified framework to learn permutable wireless
policies with multidimensional GNNs. To avoid the information loss, the GNNs
update the hidden representations of hyper-edges. To exploit all possible
permutations of a policy, we provide a method to identify vertices in a graph.
We also investigate the permutability of wireless channels that affects the
sample efficiency, and show how to trade off the training, inference, and
designing complexities of GNNs. We take precoding in different systems as
examples to demonstrate how to apply the framework. Simulation results show
that the proposed GNNs can achieve close performance to numerical algorithms,
and require much fewer training samples and trainable parameters to achieve the
same learning performance as the commonly used convolutional neural networks
- …