The Gaussian Multiple Access Diamond Channel

In this paper, we study the capacity of the diamond channel. We focus on the special case where the channel between the source node and the two relay nodes are two separate links with finite capacities and the link from the two relay nodes to the destination node is a Gaussian multiple access channel. We call this model the Gaussian multiple access diamond channel. We first propose an upper bound on the capacity. This upper bound is a single-letterization of an $n$-letter upper bound proposed by Traskov and Kramer, and is tighter than the cut-set bound. As for the lower bound, we propose an achievability scheme based on sending correlated codes through the multiple access channel with superposition structure. We then specialize this achievable rate to the Gaussian multiple access diamond channel. Noting the similarity between the upper and lower bounds, we provide sufficient and necessary conditions that a Gaussian multiple access diamond channel has to satisfy such that the proposed upper and lower bounds meet. Thus, for a Gaussian multiple access diamond channel that satisfies these conditions, we have found its capacity.Comment: submitted to IEEE Transactions on Information Theor

A new insight on induced-tribological behaviour of hypereutectic Al-Si alloys manufactured by selective laser melting

In this work, the tribological behaviour of selective laser melting (SLM) processed hypereutectic Al-Si alloy is investigated by the ball on disc test with focus on the effect of silicon content (18 and 50 wt %). Different from the conventional casted sample, the SLM processed sample shows an ultra-fine microstructure with silicon size inferior to 5 μm. Indeed, the SLM processed hypereutectic Al-Si alloy illustrates a pseudo-eutectic microstructure consisted by supersaturated Al(Si) and primary silicon. Both the SLM processed Al-18Si and Al-50Si presents low wear rate about of 7.0 and 8.1◊10−4 mm3/(N◊m) respectively. Moreover, the wear mechanisms of conventional casted and SLM processed hypereutectic Al-Si alloys are compared and discussed

On the Rate-Memory Tradeoff of D2D Coded Caching with Three Users

The device-to-device (D2D) centralized coded caching problem is studied for the three-user scenario, where two models are considered. One is the 3-user D2D coded caching model proposed by Ji et al, and the other is a simpler model named the 3-user D2D coded caching with two random requesters and one sender (2RR1S), proposed in this paper, where in the delivery phase, any two of the three users will make file requests, and the user that does not make any file request is the designated sender. We allow for coded cache placement and none one-shot delivery schemes. We first find the optimal caching and delivery schemes for the model of the 3-user D2D coded caching with 2RR1S for any number of files. Next, we propose a new caching and delivery scheme for the 3-user D2D coded caching problem using the optimal scheme of the 3-user D2D coded caching with 2RR1S as a base scheme. The new caching and delivery scheme proposed employs coded cache placement and when the number of files is equal to 2 and the cache size is medium, it outperforms existing schemes which focus on uncoded cache placement. We further characterize the optimal rate-memory tradeoff for the 3-user D2D coded caching problem when the number of files is equal to 2. As a result, we show that the new caching and delivery scheme proposed is in fact optimal when the cache size is in the medium range.Comment: To be submitted for possible journal publicatio

On the Asymptotic Capacity of Information Theoretical Privacy-preserving Epidemiological Data Collection

We formulate a new secure distributed computation problem, where a simulation center can require any linear combination of $K$ users' data through a caching layer consisting of $N$ servers. The users, servers, and data collector do not trust each other. For users, any data is required to be protected from up to $E$ servers; for servers, any more information than the desired linear combination cannot be leaked to the data collector; and for the data collector, any single server knows nothing about the coefficients of the linear combination. Our goal is to find the optimal download cost, which is defined as the size of message uploaded to the simulation center by the servers, to the size of desired linear combination. We proposed a scheme with the optimal download cost when $E < N-1$. We also prove that when $E\geq N-1$, the scheme is not feasible