Search

Relay channels capture the essence of several important communication scenarios such as sensor network and satellite communication. In this paper, first, we propose an efficient coding scheme for an additive white Gaussian noise (AWGN) relay channel in the presence of AWGN feedback, which generalizes the conventional scheme for the AWGN relay channel with noiseless feedback by introducing a lattice-based strategy to eliminate the impact of the feedback channel noise on the performance of the original scheme. Next, we further extend the proposed scheme to the multi-input single-output (MISO) fading relay channel (FRC) with noisy feedback. The key to this extension is to use a pre-coding strategy to transform the MISO channel into a single-input single-output (SISO) channel and applying a two-dimensional lattice coding strategy to deal with the feedback fading channel noise. Finally, we analyze the security performance of our proposed scheme in several cases, and the results of this paper are further illustrated by numerical examples. [ABSTRACT FROM AUTHOR]

Relay channels capture the essence of several important communication scenarios such as sensor network and satellite communication. In this paper, first, we propose an efficient coding scheme for an additive white Gaussian noise (AWGN) relay channel in the presence of AWGN feedback, which generalizes the conventional scheme for the AWGN relay channel with noiseless feedback by introducing a lattice-based strategy to eliminate the impact of the feedback channel noise on the performance of the original scheme. Next, we further extend the proposed scheme to the multi-input single-output (MISO) fading relay channel (FRC) with noisy feedback. The key to this extension is to use a pre-coding strategy to transform the MISO channel into a single-input single-output (SISO) channel and applying a two-dimensional lattice coding strategy to deal with the feedback fading channel noise. Finally, we analyze the security performance of our proposed scheme in several cases, and the results of this paper are further illustrated by numerical examples.

We develop a new upper bound on the capacity of the relay channel that is tighter than previously known upper bounds. This upper bound is proved using traditional weak converse techniques involving mutual information inequalities and Gallager-type explicit identification of auxiliary random variables. We show that the new upper bound is strictly tighter than all previous bounds for the Gaussian relay channel with non-zero channel gains. When specialized to the relay channel with orthogonal receiver components, the bound resolves a conjecture by Kim on a class of deterministic relay channels. When further specialized to the class of product-form relay channels with orthogonal receiver components, the bound resolves a generalized version of Cover’s relay channel problem, recovers the recent upper bound for the Gaussian case by Wu et al., and improves upon the recent bounds for the binary symmetric case by Wu et al. and Barnes et al., which were obtained using non-traditional geometric proof techniques. For the special class of a relay channel with orthogonal receiver components, we develop another upper bound on the capacity which utilizes an auxiliary receiver and show that it is strictly tighter than the bound by Tandon and Ulukus. Finally, we show through the Gaussian relay channel with i.i.d. relay output sequence that the bound with the auxiliary receiver can be strictly tighter than our main bound. [ABSTRACT FROM AUTHOR]

Communication over a quantum multiple-access channel (MAC) with cribbing encoders is considered, whereby Transmitter 2 performs a measurement on a system that is entangled with Transmitter 1. Based on the no-cloning theorem, perfect cribbing is impossible. This leads to the introduction of a MAC model with noisy cribbing. In the causal and non-causal cribbing scenarios, Transmitter 2 performs the measurement before the input of Transmitter 1 is sent through the channel. Hence, Transmitter 2’s cribbing may inflict a “state collapse” for Transmitter 1. Achievable regions are derived for each setting. Furthermore, a regularized capacity characterization is established for robust cribbing, i.e. when the cribbing system contains all the information of the channel input. Building on the analogy between the noisy cribbing model and the relay channel, a partial decode-forward region is derived for a quantum MAC with non-robust cribbing. For the classical-quantum MAC with cribbing encoders, the capacity region is determined with perfect cribbing of the classical input, and a cutset region is derived for noisy cribbing. In the special case of a classical-quantum MAC with a deterministic cribbing channel, the inner and outer bounds coincide. [ABSTRACT FROM AUTHOR]

In this paper, the Half-Duplex Relay Channel (HDRC) is thoroughly investigated. Even though this channel model is widely studied, the capacity is not yet fully understood and particularly has not been tightly expressed. In this work, a new capacity expression of the discrete memoryless HDRC is explicitly established. In particular, a new expression of the achievable rate is derived by taking advantage of the well-known capacity results of both the degraded broadcast channel and the multiple access channel. Specifi- cally, in order to obtain the achievable rate, the transmission from the source to destination is operated over two phases. In the first phase, the broadcast phase, the source broadcasts to both relay and destination. In the second phase, both source and relay transmit to destination to form multiple access channel. Then, we prove that the new achievable rate meets the cut-set outer bound such that the capacity of the discrete memoryless HDRC is attained. Next, the new derived capacity result is extended to the case of additive Gaussian channel. Further, the attained capacity is analytically and then numerically shown to encompass all well-known available findings in the literature. Additional numerical examples are also shown to present the cases in which the relay is beneficial and how the achievable capacity varies with the source-relay and relay-destination channel gains. [ABSTRACT FROM AUTHOR]

This paper employs auxiliary receivers as a mathematical tool to identify Gallager-type auxiliary random variables and write outer bounds for some basic multiuser settings. This approach is then applied to the relay, interference, and broadcast channel settings, yielding new outer bounds that improve on existing outer bounds and strictly outperform classical outer bounds. For instance, we strictly improve on: the cutset outer bound for the scalar Gaussian relay channel, the outer bounds for the Gaussian Z-interference channel, and the outer bounds for the two receiver broadcast channel. [ABSTRACT FROM AUTHOR]

In this paper, we analyze inner and outer bounding capacity region of two-user multiple-access relay channel (MARC) with side information (SI) non-causally known at one encoder in different scenarios. First, we obtain a general capacity inner bound including various previous results as its special cases, where, the informed encoder transmits two-layer individual description of side information to the relay and destination, and block Markov, superposition, Marton and Gel'fand-Pinsker coding at the encoders and sliding-window decoding at the receiver are exploited. This individual side information can be considered as the partial SI at the relay and destination, which can potentially increase the transmission rates, especially for the uninformed encoder. Second, to show practical importance of the obtained inner bound, we extend it to the Gaussian version, which can be used in studying the coverage region and energy efficiency. Third, we study outer bounding the capacity region, aiming at outer bounds less than cut set bounds, by considering a general MARC with partial decode and forward (PDF) strategy at the relay. Finally, the obtained Gaussian inner bound is evaluated numerically, and we showed that our capacity inner bound results in more sum-rate in comparison with the previous studies. [ABSTRACT FROM AUTHOR]

Summary: In this paper, we consider the transmission over multiple access relay channel (MARC) in which the relay operates in half‐duplex mode. The main contribution of this paper is establishing the capacity of the multiple access half‐duplex relay channel (MAHRC). Toward achieving this goal, we first derive a new achievable rate region. While deriving the achievable rate region, well‐known encoding and decoding schemes, which are used for transmission and reception over the degraded broadcast channel and the multiple access channel, are used. In this transmission scheme, the transmission from the two sources via the half‐duplex relay, to the destination, is split into two phases. Afterwards, an outer bound to the transmission over the discrete memoryless MAHRC is developed. Consequently, we show that the achievable rate region matches the outer bound and therefore the capacity region is formed. Further, the capacity region is extended to the case of Gaussian channel. Additionally, many numerical examples are shown to validate our theoretical derivations. In particular, these numerical examples show that the achievable rate region, and then the capacity, that we derive is larger than the well‐known results in the literature. [ABSTRACT FROM AUTHOR]

Uplink-downlink duality refers to the fact that under a sum-power constraint, the capacity regions of a Gaussian multiple-access channel and a Gaussian broadcast channel with Hermitian transposed channel matrices are identical. This paper generalizes this result to a cooperative cellular network, in which remote access-points are deployed as relays in serving the users under the coordination of a central processor (CP). In this model, the users and the relays are connected over noisy wireless links, while the relays and the CP are connected over noiseless but rate-limited fronthaul links. Based on a Lagrangian technique, this paper establishes a duality relationship between such a multiple-access relay channel and broadcast relay channel, under the assumption that the relays use compression-based strategies. Specifically, we show that under the same total transmit power constraint and individual fronthaul rate constraints, the achievable rate regions of the Gaussian multiple-access and broadcast relay channels are identical, when either independent compression or Wyner-Ziv and multivariate compression strategies are used. The key observations are that if the beamforming vectors at the relays are fixed, the sum-power minimization problems under the achievable rate and fronthaul constraints in both the uplink and the downlink can be transformed into either a linear programming or a semidefinite programming problem depending on the compression technique, and that the uplink and downlink problems are Lagrangian duals of each other. Moreover, the dual variables corresponding to the downlink rate constraints become the uplink powers; the dual variables corresponding to the downlink fronthaul constraints become the uplink quantization noises. This duality relationship enables an efficient algorithm for optimizing the downlink transmission and relaying strategies based on the uplink. [ABSTRACT FROM AUTHOR]

Abstract We investigate the transmission of a secret message from Alice to Bob in the presence of an eavesdropper (Eve) and many of decode-and-forward relay nodes. Each link comprises a set of parallel channels, modeling for example an orthogonal frequency division multiplexing transmission. We consider the impact of efficient implementations, including discrete constellations and finite-length coding, defining an achievable secrecy rate under a constraint on the equivocation rate at Eve. Then, we propose a power and channel allocation algorithm that maximizes the achievable secrecy rate by resorting to two coupled Gale-Shapley algorithms for stable matching problem. We consider the scenarios of both full and partial channel state information at Alice. In the latter case, we only guarantee an outage secrecy rate, i.e., the rate of a message that remains secret with a given probability. Numerical results are provided for Rayleigh fading channels in terms of average outage secrecy rate, showing that practical schemes achieve a performance quite close to that of ideal ones.

In this paper, we establish the signal-to-interferencenoise ratio (SINR) duality between multiple access (MAC) and broadcast (BC) multihop amplify-and-forward (AF) multipleinput multiple-output (MIMO)relay systems under an imperfect channel state model, which is a generalization of several previously established MAC-BC duality results. We show that identical SINRs in the MAC and BC systems can be achieved by two approaches. The first one is to use the Hermitian transposed MAC relay amplifying matrices at the relay nodes in the BC system, under the same total network transmission power constraint. The second one is to use the scaled and Hermitian transposed MAC relay amplifying matrices in the BC system, under the transmission power constraint at each node of the system, where the scaling factors are obtained by swapping the power constraints of the nodes in the MACsystem. Moreover, we derive the MAC-BC mean-squared error (MSE) and achievable sum-rate (or mutual information (MI)) duality properties based on the SINR duality. Numerical results show the utility of the duality results established.

Summary: This paper introduces a new multiuser communication model, which we call multiple access diamond channel. In this channel model, many sources transmit their signals to a destination in the case of no direct links between the end terminals. Therefore, we employ two parallel relays to extend transmission to the destination. Further, we specifically characterize two different transmission schemes along with their respective achievable rate regions. Then, we develop an outer bound to the transmission in each scheme. Moreover, we present many numerical examples to mainly compare between the two different transmission schemes and to distinguish the case for which we attain the capacity region. [ABSTRACT FROM AUTHOR]

We revisit the primitive relay channel, introduced by Cover in 1987. Recent work derived upper bounds on the capacity of this channel that are tighter than the classical cutset bound using the concentration of measure. In this paper, we recover, generalize, and improve upon some of these upper bounds with simpler proofs using reverse hypercontractivity. To our knowledge, this is the first application of reverse hypercontractivity in proving first-order converses in network information theory. [ABSTRACT FROM AUTHOR]

This article investigates cross-layer design of nonorthogonal layered (NOL) coding schemes over relay-assisted downlink of cellular networks that incorporates with successive refinement (SR) source code for transmission of adaptive multiresolution multimedia content. Two novel-layered relaying strategies, namely NOL compress-forward (NOL-CF) and NOL decode-forward (NOL-DF) coding, concatenated to the SR source coding scheme are outlined. The network parameters are jointly optimized, to derive optimal end-to-end system performance. Taking the expected distortion (ED) as the end-to-end system performance metric, the explicit analytical solution achieving optimal ED under the proposed NOL-CF scheme with two layers is derived. For the NOL-DF coding, the numerical analysis demonstrates the merits of the proposed scheme, which dynamically adapts the transmission to the instantaneous channel realization in the absence of channel knowledge at the source node. The superiority of the proposed layered coding over several available nonorthogonal multiple access relaying schemes is demonstrated for Gaussian channels. Also, simulation results confirm the effectiveness of the proposed relay-assisted NOL codes to improve the ED over Rayleigh fading channel. [ABSTRACT FROM AUTHOR]

Optimally encoding classical information in a quantum system is one of the oldest and most fundamental challenges of quantum information theory. Holevo’s bound places a hard upper limit on such encodings, while the Holevo-Schumacher-Westmoreland (HSW) theorem addresses the question of how many classical messages can be “packed” into a given quantum system. In this article, we use Sen’s recent quantum joint typicality results to prove a one-shot multiparty quantum packing lemma generalizing the HSW theorem. The lemma is designed to be easily applicable in many network communication scenarios. As an illustration, we use it to straightforwardly obtain quantum generalizations of well-known classical coding schemes for the relay channel: multihop, coherent multihop, decode-forward, and partial decode-forward. We provide both finite blocklength and asymptotic results, the latter matching existing classical formulas. Given the key role of the classical packing lemma in network information theory, our packing lemma should help open the field to direct quantum generalization. [ABSTRACT FROM AUTHOR]

The paper introduces a cross-layer design for transmission of Successive Refinement (SR) source code interplayed with non-orthogonal layered code, deployed over a half-duplex multi-relay Non-orthogonal Amplify-Forward (NAF) network. Assuming the Channel State Information (CSI) is not available at the source node, firstly the achievable layered Diversity-Multiplexing Tradeoff (DMT) curve is derived. Then, by taking Distortion Exponent (DE) as the figure of merit, several achievable lower bounds are proved and the optimal expected distortion performance under high Signal to Noise Ratio (SNR) approximation is explicitly obtained. It is shown that the proposed coding can achieve the Multi-Input Single-Output (MISO) upper bound under certain regions of bandwidth ratios, by which the optimal performance in these regions can be explicitly characterized. Further the non-orthogonal layered coding scheme is extended to a multi-hop MIMO Decode-Forward (DF) relay network and set of DE lower bounds is derived. Simulation results confirm the effectiveness of the proposed scheme under general SNR values and compared with its counterparts. [ABSTRACT FROM AUTHOR]

We investigate the transmission of a secret message from Alice to Bob in the presence of an eavesdropper (Eve) and many of decode-and-forward relay nodes. Each link comprises a set of parallel channels, modeling for example an orthogonal frequency division multiplexing transmission. We consider the impact of efficient implementations, including discrete constellations and finite-length coding, defining an achievable secrecy rate under a constraint on the equivocation rate at Eve. Then, we propose a power and channel allocation algorithm that maximizes the achievable secrecy rate by resorting to two coupled Gale-Shapley algorithms for stable matching problem. We consider the scenarios of both full and partial channel state information at Alice. In the latter case, we only guarantee an outage secrecy rate, i.e., the rate of a message that remains secret with a given probability. Numerical results are provided for Rayleigh fading channels in terms of average outage secrecy rate, showing that practical schemes achieve a performance quite close to that of ideal ones. [ABSTRACT FROM AUTHOR]

With the emergence of wireless networks, cooperation for secrecy is recognized as an attractive way to establish secure communications. Departing from cryptographic techniques, secrecy can be provided by exploiting the wireless channel characteristics; that is, some error-correcting codes besides reliability have been shown to achieve information-theoretic security. In this paper, we propose a polar-coding-based technique for the primitive relay wiretap channel and show that this technique is suitable to provide information-theoretic security. Specifically, we integrate at the relay an additional functionality, which allows it to smartly decide whether it will cooperate or not based on the decoding detector result. In the case of cooperation, the relay operates in a decode-and-forward mode and assists the communication by transmitting a complementary message to the destination in order to correctly decode the initial source’s message. Otherwise, the communication is completed with direct transmission from source to the destination. Finally, we first prove that the proposed encoding scheme achieves weak secrecy, then, in order to overcome the obstacle of misaligned bits, we implement a double-chaining construction, which achieves strong secrecy.

This paper studies the downlink of a cloud radio access network (C-RAN) in which a centralized processor (CP) communicates with mobile users through base stations (BSs) that are connected to the CP via finite-capacity fronthaul links. Information theoretically, the downlink of a C-RAN is modeled as a two-hop broadcast-relay network. Among the various transmission and relaying strategies for such model, this paper focuses on the compression strategy, in which the CP centrally encodes the signals to be broadcast jointly by the BSs, then compresses and sends these signals to the BSs through the fronthaul links. We characterize an achievable rate region for a generalized compression strategy with Marton’s multicoding for broadcasting and multivariate compression for fronthaul transmission. We then compare this rate region with the distributed decode-forward (DDF) scheme, which achieves the capacity of the general relay networks to within a constant gap, and show that the difference lies in that DDF performs Marton’s multicoding and multivariate compression jointly as opposed to successively as in the compression strategy. A main result of this paper is that under the assumption that the fronthaul links are subject to a sum capacity constraint, this difference is immaterial; so, for the Gaussian network, the compression strategy based on successive encoding can already achieve the capacity region of the C-RAN to within a constant gap, where the gap is independent of the channel parameters and the power constraints at the BSs. As a further result, for C-RAN under individual fronthaul constraints, this paper also establishes that the compression strategy can achieve to within a constant gap to the sum capacity. [ABSTRACT FROM AUTHOR]

The capacity of the semi-deterministic relay channel (SD-RC) with non-causal channel state information (CSI) only at the encoder and decoder is characterized. The capacity is achieved by a scheme based on cooperative-bin-forward. This scheme allows cooperation between the transmitter and the relay without the need of the later to decode a part of the message. The transmission is divided into blocks, and each deterministic output of the channel (observed by the relay) is mapped to a bin. The bin index is used by the encoder and the relay to choose the cooperation codeword in the next transmission block. In causal settings, the cooperation is independent of the state. In non-causal settings, dependence between the relay’s transmission and the state can increase the transmission rates. The encoder implicitly conveys partial state information to the relay. In particular, it uses the states of the next block and selects a cooperation codeword accordingly, and the relay transmission depends on the cooperation codeword and, therefore, also on the states. We also consider the multiple access channel with partial cribbing as a semi-deterministic channel. The capacity region of this channel with non-causal CSI is achieved by the new scheme. Examining the result in several cases, we introduce a new problem of a point-to-point (PTP) channel where the state is provided to the transmitter by a state encoder. Interestingly, even though the CSI is also available at the receiver, we provide an example showing that the capacity with non-causal CSI at the state encoder is strictly larger than the capacity with causal CSI. [ABSTRACT FROM AUTHOR]

In this paper, we consider the multiple access relay channel (MARC) in which two users want to communicate with a destination in the presence of a common intermediate node, the relay. This paper considers the case in which the relay can partially listen to both the users until it can estimate their signals. Specifically, a two-phase transmission scheme, (i) listening phase, and (ii) forwarding phase, is designed toward deriving the achievable rate region. In particular, the achievable rate region is basically derived in the cases of additive Gaussian channel and Rayleigh fading channel. Our numerical results show that (i) the derived achievable rate region contains the available rate region in the literature, and (ii) the sum rate has a concave relation with the number of channel uses in the listening phase. [ABSTRACT FROM AUTHOR]

Consider a memoryless relay channel, where the relay is connected to the destination with an isolated bit pipe of capacity $C_{0}$. Let $C(C_{0})$ denote the capacity of this channel as a function of $C_{0}$. What is the critical value of $C_{0}$ , such that $C(C_{0})$ first equals $C(\infty)$ ? This is a long-standing open problem posed by Cover and named “The Capacity of the Relay Channel,” in Open Problems in Communication and Computation, Springer-Verlag, 1987. In this paper, we answer this question in the Gaussian case and show that $C(C_{0})$ cannot equal to $C(\infty)$ unless $C_{0}=\infty $ , regardless of the SNR of the Gaussian channels. This result follows as a corollary to a new upper bound we develop on the capacity of this channel. Instead of “single-letterizing” expressions involving information measures in a high-dimensional space as is typically done in converse results in information theory, our proof directly quantifies the tension between the pertinent $n$ -letter forms. This is done by translating the information tension problem to a problem in high-dimensional geometry. As an intermediate result, we develop an extension of the classical isoperimetric inequality on a high-dimensional sphere, which can be of interest in its own right. [ABSTRACT FROM AUTHOR]

This paper is concerned with the moving horizon estimation problem for networked systems over relay channels. The relay channel under consideration is a wireless communication channel with a so-called relay node. Under the effects of relay node, the signal transmission between the plant and estimator is determined by a combination of three communication processes, namely the sensor-to-estimator, the sensor-to-relay and the relay-to-estimator communication processes. In order to characterize the impact of such kind of relay-channel-based communication, a three-terminal relay model is employed to describe the signal transmission behaviors between the plant and the estimator. Three Bernoulli-distributed white sequences are adopted to model the packet losses occurring in the communication processes. A full information estimation strategy is firstly developed in the sense of maximum a posteriori according to the system dynamics and transmission behaviors. Then, a moving horizon estimator is designed based on the derived full information estimation strategy. Furthermore, the solution of the proposed moving horizon estimation strategy is achieved by using the completing-the-square approach and, subsequently, sufficient conditions are derived to guarantee the mean-square ultimate boundedness of the resultant error dynamics of the state estimation. Two simulation examples are given to demonstrate the effectiveness of our developed estimation scheme. [ABSTRACT FROM AUTHOR]

This paper proposes the interleaving gain in two different distributed turbo-coding schemes: Distributed Turbo Codes (DTC) and Distributed Multiple Turbo Codes (DMTC) for half-duplex relay system as an extension of our previous work on turbo coding interleaver design for direct communication channel. For these schemes with half-duplex constraint, the source node transmits its information with the parity bit sequence(s) to both the relay and the destination nodes during the first phase. The relay received the data from the source and process it by using decode and forward protocol. For the second transmission period, the decoded systematic data at relay is interleaved and re-encoded by a Recursive Systematic Convolutional (RSC) encoder and forwarded to the destination. At destination node, the signals received from the source and relay are processed by using turbo log-MAP iterative decoding for retrieving the original information bits. We demonstrate via simulations that the interleaving gain has a large effect with DTC scheme when we use only one RSC encoder at both the source and relay with best performance when using Modified Matched S-Random (MMSR) interleaver. Furthermore, by designing a Chaotic Pseudo Random Interleaver (CPRI) as an outer interleaver at the source node instead of classical interleavers, our scheme can add more secure channel conditions.

Energy Harvesting (EH) is a novel technique to prolong the lifetime of the wireless Ad-hoc and sensor networks with replenishable nodes. In this sense, it has emerged as a promising technique for Green Communications. On the other hand, cooperative communication with the help of relay nodes improves the performance of wireless communication networks. In this paper, we investigate the cooperation in EH nodes. We consider the optimal power and rate allocation in the full-duplex Gaussian relay channel in which source and relay can harvest energy from their environments. In our model, the energy arrivals at the source and the relay are general stochastic processes with known EH times and amounts before the start of transmission. This problem has a constrained min-max optimization form that is not easy to solve. We propose a method based on a mathematical theorem to decompose it into two problems: the first problem has a tractable convex optimization form and can be solved efficiently. We show that the second problem is an unconstrained discrete convex optimization problem, which has the complexity of O ( K 2 ), instead of O (2 K ), where K is the dimension of variables. Also, we provide some numerical examples that confirm our results. [ABSTRACT FROM AUTHOR]

Recently, distributed transmit-antenna selection schemes have attracted great interest, since they capture the essential benefits of multi-antenna systems while reducing their cost, complexity, delay, and feedback overhead. In those distributed schemes, the antenna selection is based on local channel-state information, in contrast to their optimal centralized counterparts, which require knowing the channel state of all links. Herein, we design two such distributed schemes for a dual-hop variable-gain amplify-and-forward relaying system with one multi-antenna source, one single-antenna relay, and one single-antenna destination. The two schemes differ in the diversity method used at the destination, namely, selection combining or maximal-ratio combining, and in the selection rule accordingly. In addition to conceiving these new schemes, we analyze their outage performance. Since an exact analysis proves intractable, we tackle the outage probability in terms of lower-bound expressions and their asymptotes at high signal-to-noise ratio. Importantly, the derived bounds turn out to be almost indistinguishable from the true performance, assessed via simulation. Our results reveal that the proposed distributed schemes achieve the same diversity order of their optimal centralized counterparts and perform closely to these, specially when the relay is near the source or destination. [ABSTRACT FROM AUTHOR]

Anytime codes are known to be useful for tracking and controlling unstable systems over noisy channels. Although practical anytime codes have been developed for point-to-point communication, to date no practical code constructions and tractable analysis of anytime codes are known to exist for relay networks. In this paper, we study the design and theoretical analysis of anytime codes for a three-terminal relay network. We propose bilayer codes for anytime transmission over the relay network and consider two transmission schemes for the relay-destination link. For both schemes, we analytically derive the delay-exponents and show that they closely match the corresponding numerical results obtained from density evolution. Through simulation, we also show the finite-length performance of the proposed bilayer anytime code. [ABSTRACT FROM AUTHOR]

In a primitive relay channel, a new one-shot relaying scheme termed color-and-forward is proposed that guarantees a probability of error equal to zero. This relaying scheme constructs a relaying compression graph of relay outputs based on the joint conditional distribution of the relay and destination outputs, and forwards a minimum coloring of this graph. The $n$ -letter extension of the proposed color-and-forward scheme is shown to be optimal in the sense that it results in the smallest needed out-of-band relay to destination link rate for the overall message rate to equal the single-input multiple-output outer bound for any fixed number of channel uses. This is used to obtain an upper bound on the asymptotic minimal relay to destination link rate needed to achieve the single-input multiple-output outer bound. [ABSTRACT FROM AUTHOR]

We study the arbitrarily varying relay channel, which models communication with relaying in the presence of an active adversary. We establish the cutset bound and partial decode-forward bound on the random code capacity. We further determine the random code capacity for special cases. Then, we consider conditions under which the deterministic code capacity is determined as well. In addition, we consider the arbitrarily varying Gaussian relay channel with sender frequency division under input and state constraints. We determine the random code capacity, and establish lower and upper bounds on the deterministic code capacity. Furthermore, we show that as opposed to previous relay models, the primitive relay channel has a different behavior compared to the non-primitive relay channel in the arbitrarily varying scenario.

This letter proposes a fast optimization procedure to design bilayer-expurgated low density parity check codes in the relay channel. The code optimization problem aims to maximize the code rate while guaranteeing the convergence of the density evolution relations in upper and lower layer codes. The original problem is linear programming. Nevertheless, it suffers from high computational complexity, as it is semi-infinite programming (SIP) in a 2-D continuous interval. To efficiently solve it, we first approximate the density evolutions by polynomials. Then, leveraging optimization problems over the solution of sum of square multivariate polynomials the problem is transformed to semi-definite programming (SDP), where the global solution can be found efficiently using available SDP solvers. Our simulation shows that our approach results in significantly lower computational complexity with respect to the well-known method of quantization for solving the SIP problem, while both achieve the same performance. [ABSTRACT FROM PUBLISHER]

This paper introduces and studies a model in which two relay channels interfere with each other. Motivated by practical scenarios in heterogeneous wireless access networks, each relay is assumed to be connected to its intended receiver through a digital link with finite capacity. Inner and outer bounds for achievable rates are derived and shown to be tight for new discrete memoryless classes, which generalize and unify several known cases involving interference and relay channels. Capacity region and sum capacity for multiple Gaussian scenarios are also characterized to within a constant gap. The results show the optimality or near-optimality of the quantize-bin-and-forward coding scheme for practically relevant relay-interference networks, which brings important engineering insight into the design of wireless communications systems. [ABSTRACT FROM AUTHOR]