State-Dependent Relay Channel with Private Messages with Partial Causal and Non-Causal Channel State Information

In this paper, we introduce a discrete memoryless State-Dependent Relay Channel with Private Messages (SD-RCPM) as a generalization of the state-dependent relay channel. We investigate two main cases: SD-RCPM with non-causal Channel State Information (CSI), and SD-RCPM with causal CSI. In each case, it is assumed that partial CSI is available at the source and relay. For non-causal case, we establish an achievable rate region using Gel'fand-Pinsker type coding scheme at the nodes informed of CSI, and Compress-and-Forward (CF) scheme at the relay. Using Shannon's strategy and CF scheme, an achievable rate region for causal case is obtained. As an example, the Gaussian version of SD-RCPM is considered, and an achievable rate region for Gaussian SD-RCPM with non-causal perfect CSI only at the source, is derived. Providing numerical examples, we illustrate the comparison between achievable rate regions derived using CF and Decode-and-Forward (DF) schemes.Comment: 5 pages, 2 figures, to be presented at the IEEE International Symposium on Information Theory (ISIT 2010), Austin, Texas, June 201

Cooperative Strategies for Simultaneous and Broadcast Relay Channels

Consider the \emph{simultaneous relay channel} (SRC) which consists of a set of relay channels where the source wishes to transmit common and private information to each of the destinations. This problem is recognized as being equivalent to that of sending common and private information to several destinations in presence of helper relays where each channel outcome becomes a branch of the \emph{broadcast relay channel} (BRC). Cooperative schemes and capacity region for a set with two memoryless relay channels are investigated. The proposed coding schemes, based on \emph{Decode-and-Forward} (DF) and \emph{Compress-and-Forward} (CF) must be capable of transmitting information simultaneously to all destinations in such set. Depending on the quality of source-to-relay and relay-to-destination channels, inner bounds on the capacity of the general BRC are derived. Three cases of particular interest are considered: cooperation is based on DF strategy for both users --referred to as DF-DF region--, cooperation is based on CF strategy for both users --referred to as CF-CF region--, and cooperation is based on DF strategy for one destination and CF for the other --referred to as DF-CF region--. These results can be seen as a generalization and hence unification of previous works. An outer-bound on the capacity of the general BRC is also derived. Capacity results are obtained for the specific cases of semi-degraded and degraded Gaussian simultaneous relay channels. Rates are evaluated for Gaussian models where the source must guarantee a minimum amount of information to both users while additional information is sent to each of them.Comment: 32 pages, 7 figures, To appear in IEEE Trans. on Information Theor

An Achievable Rate Region for Relay Multiple Access Channel Based on Decode-and-Forward

In this paper, we model a specific relay channel named relay multiple access channel (RMAC) aiming at providing a clue to select the relay node in multiple access channels such as the uplink of cellular communication system. In this channel, the relay node not only aids to send the information of the source but also sends its private message to the destination. We derive the achievable rate regions based on decode-and-forward strategy for the discrete memoryless RMAC (DM-RMAC) and the additive white Gaussian noise RMAC (AWGN-RMAC), respectively. Numerical results of the achievable rate region for the AWGN-RMAC show that the proposed scheme can improve the rate of user far from the base station with the help of a relay node near to the base station. Keywords: Relay multiple acces

Capacity of a Class of State-Dependent Orthogonal Relay Channels

The class of orthogonal relay channels in which the orthogonal channels connecting the source terminal to the relay and the destination, and the relay to the destination, depend on a state sequence, is considered. It is assumed that the state sequence is fully known at the destination while it is not known at the source or the relay. The capacity of this class of relay channels is characterized, and shown to be achieved by the partial decode-compress-and-forward (pDCF) scheme. Then the capacity of certain binary and Gaussian state-dependent orthogonal relay channels are studied in detail, and it is shown that the compress-and-forward (CF) and partial-decode-and-forward (pDF) schemes are suboptimal in general. To the best of our knowledge, this is the first single relay channel model for which the capacity is achieved by pDCF, while pDF and CF schemes are both suboptimal. Furthermore, it is shown that the capacity of the considered class of state-dependent orthogonal relay channels is in general below the cut-set bound. The conditions under which pDF or CF suffices to meet the cut-set bound, and hence, achieve the capacity, are also derived.Comment: This paper has been accepted by IEEE Transactions on Information Theor

Distributed spectrum leasing via cooperation

“Cognitive radio” networks enable the coexistence of primary (licensed) and secondary (unlicensed) terminals. Conventional frameworks, namely commons and property-rights models, while being promising in certain aspects, appear to have significant drawbacks for implementation of large-scale distributed cognitive radio networks, due to the technological and theoretical limits on the ability of secondary activity to perform effective spectrum sensing and on the stringent constraints on protocols and architectures. To address the problems highlighted above, the framework of distributed spectrum leasing via cross-layer cooperation (DiSC) has been recently proposed as a basic mechanism to guide the design of decentralized cognitive radio networks. According to this framework, each primary terminal can ”lease” a transmission opportunity to a local secondary terminal in exchange for cooperation (relaying) as long as secondary quality-of-service (QoS) requirements are satisfied. The dissertation starts by investigating the performance bounds from an information-theoretical standpoint by focusing on the scenario of a single primary user and multiple secondary users with private messages. Achievable rate regions are derived for discrete memoryless and Gaussian models by considering Decode-and-Forward (DF), with both standard and parity-forwarding techniques, and Compress-and-Forward (CF), along with superposition coding at the secondary nodes. Then a framework is proposed that extends the analysis to multiple primary users and multiple secondary users by leveraging the concept of Generalized Nash Equilibrium. Accordingly, multiple primary users, each owning its own spectral resource, compete for the cooperation of the available secondary users under a shared constraint on all spectrum leasing decisions set by the secondary QoS requirements. A general formulation of the problem is given and solutions are proposed with different signaling requirements among the primary users. The novel idea of interference forwarding as a mechanism to enable DiSC is proposed, whereby primary users lease part of their spectrum to the secondary users if the latter assist by forwarding information about the interference to enable interference mitigation at the primary receivers. Finally, an application of DiSC in multi-tier wireless networks such as femtocells overlaid by macrocells whereby the femtocell base station acts as a relay for the macrocell users is presented. The performance advantages of the proposed application are evaluated by studying the transmission reliability of macro and femto users for a quasi-static fading channel in terms of outage probability and diversity-multiplexing trade-off for uplink and, more briefly, for downlink

Design of low-density parity-check codes in relay channels

Recent breakthroughs in forward error correction, in the form of low-density parity-check (LDPC) and turbo codes, have seen near Shannon limit performances especially for pointto- point channels. The construction of capacity-achieving codes in relay channels, for LDPC codes in particular, is currently the subject of intense interest in the research and development community. This thesis adds to this field, developing methods and supporting theory in designing capacity-achieving LDPC codes for decode-and-forward (DF) schemes in relay channels. In the first part of the thesis, new theoretical results toward optimizing the achievable rate of DF scheme in half-duplex relay channels under simplified and pragmatic conditions (equal power or equal time allocation) are developed. We derive the closed-form solutions for the optimum parameters (time or power) that maximize the achievable rates of the DF scheme in the half-duplex relay channel. We also derive the closed-form expression for the DF achievable rates under these simplified and pragmatic conditions. The second part of the thesis is dedicated to study the problem of designing several classes of capacity-achieving LDPC codes in relay channels. First, a new ensemble of LDPC codes, termed multi-edge-type bilayer-expurgated LDPC (MET-BE-LDPC) codes, is introduced to closely approach the theoretical limit of the DF scheme in the relay channel. We propose two design strategies for optimizing MET-BE-LDPC codes; the bilayer approach and the bilayer approach with intermediate rates. Second, we address the issue of constructing capacity-achieving distributed LDPC codes in the multiple-access and two-way relay channels, with broadcast transmissions and time-division multiple accesses. We propose a new methodology to asymptotically optimize the code’s degree distribution when different segments within the distributed codeword have been transmitted through separate channels and experienced distinct signal-to-noise ratio in the relay system. Third, we investigate the use of LDPC codes under the soft-decode-and forward (SDF) scheme in the half-duplex relay channel. We introduce the concept of a K-layer doping matrix that enables one to design the rate-compatible (RC) LDPC code with a lower triangular parity-check matrix, subsequently allowing the additional parity bits to be linearly and systematically encoded at the relay. We then present the soft-decoding and soft-re-encoding algorithms for the designed RC-LDPC code so that the relay can forward soft messages to the destination when the relay fails to decode the source’s messages. Special attention is given to the detection problem of the SDF scheme. We propose a novel method, which we refer to as soft fading, to compute the log-likelihood ratio of the received signal at the destination for the SDF scheme