The work at hand presents a finite-blocklength analysis of the multiple access channel (MAC) sum-rate under the cooperation facilitator (CF) model. The CF model, in which independent encoders coordinate through an intermediary node, is known to show significant rate benefits, even when the rate of cooperation is limited. We continue this line of study for cooperation rates which are sub-linear in the blocklength $n$. Roughly speaking, our results show that if the facilitator transmits $\log{K}$ bits, there is a sum-rate benefit of order $\sqrt{\log{K}/n}$. This result extends across a wide range of $K$: even a single bit of cooperation is shown to provide a sum-rate benefit of order $1/\sqrt{n}$.
A receiver wants to compute a function of two correlated sources separately observed by two transmitters. One of the transmitters may send a possibly private message to the other transmitter in a cooperation phase before both transmitters communicate to the receiver. For this network configuration this paper investigates both a function computation setup, wherein the receiver wants to compute a given function of the sources exactly, and a rate distortion setup, wherein the receiver wants to compute a given function within some distortion. For the function computation setup, a general inner bou…
The Generalized Degrees of Freedom (GDoF) of the two user interference channel are characterized for all parameter regimes under the assumption of finite precision channel state information at the transmitters (CSIT), when a limited amount of (half-duplex or full-duplex) cooperation is allowed between the transmitters in the form of $π$ DoF of shared messages. In all cases, the number of over-the-air bits that each cooperation bit buys is shown to be equal to either $0, 1, 1/2$ or $1/3$. The most interesting aspect of the result is the $1/3$ slope, which appears only under finite precision CSI…
This paper studies the value of limited rate cooperation between the transmitters for managing interference and simultaneously ensuring secrecy, in the 2-user Gaussian symmetric interference channel (GSIC). First, the problem is studied in the symmetric linear deterministic IC (SLDIC) setting, and achievable schemes are proposed, based on interference cancelation, relaying of the other user's data bits, and transmission of random bits. In the proposed achievable scheme, the limited rate cooperative link is used to share a combination of data bits and random bits depending on the model paramete…
In communication networks, cooperative strategies are coding schemes where network nodes work together to improve network performance metrics such as the total rate delivered across the network. This work studies encoder cooperation in the setting of a discrete multiple access channel (MAC) with two encoders and a single decoder. A network node, here called the cooperation facilitator (CF), that is connected to both encoders via rate-limited links, enables the cooperation strategy. Previous work by the authors presents two classes of MACs: (i) one class where the average-error sum-capacity has…
In network cooperation strategies, nodes work together with the aim of increasing transmission rates or reliability. This paper demonstrates that enabling cooperation between the transmitters of a two-user multiple access channel, via a cooperation facilitator that has access to both messages, always results in a network whose maximal- and average-error sum-capacities are the same---even when those capacities differ in the absence of cooperation and the information shared with the encoders is negligible. From this result, it follows that if a multiple access channel with no transmitter coopera…
The aim is formal principles of origin information and information process creating information observer self-creating information in interactive observations. The interactive phenomenon creates Yes-No actions of information Bits in its information observer. Information emerges from interacting random field of Kolmogorov probabilities, which link Kolmogorov 0-1 law probabilities and Bayesian probabilities observing Markov diffusion process by probabilistic 0-1 impulses. Each No-0 action cuts maximum of impulse minimal entropy while following Yes-1 action transfers maxim between impulses perfor…
This letter considers two groups of source nodes. Each group transmits packets to its own designated destination node over single-hop links and via a cluster of relay nodes shared by both groups. In an effort to boost reliability without sacrificing throughput, a scheme is proposed, whereby packets at the relay nodes are combined using two methods; packets delivered by different groups are mixed using non-orthogonal multiple access principles, while packets originating from the same group are mixed using random linear network coding. An analytical framework that characterizes the performance o…
A single-sensor two-detectors system is considered where the sensor communicates with both detectors and Detector 1 communicates with Detector 2, all over noise-free rate-limited links. The sensor and both detectors observe discrete memoryless source sequences whose joint probability mass function depends on a binary hypothesis. The goal at each detector is to guess the binary hypothesis in a way that, for increasing observation lengths, the probability of error under one of the hypotheses decays to zero with largest possible exponential decay, whereas the probability of error under the other …
In this work, the role of unidirectional limited rate transmitter cooperation is studied in the case of the 2-user Z interference channel (Z-IC) with secrecy constraints at the receivers, on achieving two conflicting goals simultaneously: mitigating interference and ensuring secrecy. First, the problem is studied under the linear deterministic model. The achievable schemes for the deterministic model use a fusion of cooperative precoding and transmission of a jamming signal. The optimality of the proposed scheme is established for the deterministic model for all possible parameter settings usi…
Information and multiaccess interference in a complexity-constrained vector channel
Rodrigo de Miguel et al 2007 J. Phys. A：Math. Theor. 5241-5260：引入了在接收机处在严格复杂度约束下操作的噪声向量信道。根据这一约束，通过直接对信道的匹配滤波器输出执行硬判决而获得的检测比特必须与传输的二进制输入相同。利用从神经网络的研究中引入的数学工具进行了渐近分析，结果表明，在有界噪声假设下，这种复杂度约束的信道具有非平凡的香农理论容量。据发现，性能依赖于严格的基于干扰的多用户合作在发射机和这种合作是最好的服务时，所有发射机使用相同的幅度。
Cooperative beamforming (CB) has been proposed as a special case of coordinated multi-point techniques in wireless communications. In wireless sensor networks, CB can enable low power communication by allowing a collection of sensor nodes to transmit data simultaneously to a distant fusion center in one hop. Besides the traditional CB approach where all nodes need to share and transmit the same data, a more recent technique allows each node to transmit its own data while still achieving the benefits of cooperation. However, the intricacies of varying beamforming gains in the direct sequence sp…
In this work, we present a new version of non-binary VT codes that are capable of correcting a single deletion or single insertion. Moreover, we provide the first known linear time algorithms that encode user messages into these codes of length n over the $q$-ary alphabet for $q\ge 2$ with at most $\ceil{\log_q n} + 1$ redundant symbols, while the optimal redundancy required is at least $\log_q n + \log_q (q - 1)$ symbols. Our designed encoder reduces the redundancy of the best-known encoder of Tenengolts (1984) by at least $2+\log_q(3)$ redundant symbols, or equivalently $2\log_2 q+3$ redunda…
