In this work, we propose and analyze a generalized construction of distributed network codes for a network consisting of M users sending different information to a common base station through independent block fading channels. The aim is to increase the diversity order of the system without reducing its code rate. The proposed scheme, called generalized dynamic network codes (GDNC), is a generalization of the dynamic network codes (DNC) recently proposed by Xiao and Skoglund. The design of the network codes that maximizes the diversity order is recognized as equivalent to the design of linear block codes over a nonbinary finite field under the Hamming metric. The proposed scheme offers a much better tradeoff between rate and diversity order. An outage probability analysis showing the improved performance is carried out, and computer simulations results are shown to agree with the analytical results.
Achieving information-theoretic security using explicit coding scheme in which unlimited computational power for eavesdropper is assumed, is one of the main topics is security consideration. It is shown that polar codes are capacity achieving codes and have a low complexity in encoding and decoding. It has been proven that polar codes reach to secrecy capacity in the binary-input wiretap channels in symmetric settings for which the wiretapper's channel is degraded with respect to the main channel. The first task of this paper is to propose a coding scheme to achieve secrecy capacity in asymmet…
It is shown that polar coding schemes achieve the known achievable rate regions for several multi-terminal communications problems including lossy distributed source coding, multiple access channels and multiple descriptions coding. The results are valid for arbitrary alphabet sizes (binary or nonbinary) and arbitrary distributions (symmetric or asymmetric).
Efficient optimal prefix coding has long been accomplished via the Huffman algorithm. However, there is still room for improvement and exploration regarding variants of the Huffman problem. Length-limited Huffman coding, useful for many practical applications, is one such variant, in which codes are restricted to the set of codes in which none of the $n$ codewords is longer than a given length, $l_{\max}$. Binary length-limited coding can be done in $O(n l_{\max})$ time and O(n) space via the widely used Package-Merge algorithm. In this paper the Package-Merge approach is generalized without i…
We develop and analyze new cooperative strategies for ad hoc networks that are more spectrally efficient than classical DF cooperative protocols. Using analog network coding, our strategies preserve the practical half-duplex assumption but relax the orthogonality constraint. The introduction of interference due to non-orthogonality is mitigated thanks to precoding, in particular Dirty Paper coding. Combined with smart power allocation, our cooperation strategies allow to save time and lead to more efficient use of bandwidth and to improved network throughput with respect to classical RDF/PDF.
In this paper, we propose a new coding scheme and establish new bounds on the capacity region for the multi-sender unicast index-coding problem. We revisit existing partitioned Distributed Composite Coding (DCC) proposed by Sadeghi et al. and identify its limitations in the implementation of multi-sender composite coding and in the strategy of sender partitioning. We then propose two new coding components to overcome these limitations and develop a multi-sender Cooperative Composite Coding (CCC). We show that CCC can strictly improve upon partitioned DCC, and is the key to achieve optimality f…
We investigate the testing-against-independence problem \mw{over a cooperative MAC} with two sensors and a single detector under an average rate constraint on the sensors-detector links. For this setup, we design a variable-length coding scheme that maximizes the achievable type-II error exponent when the type-I error probability is limited to $ε$. Similarly to the single-link result, we show here that the optimal error exponent depends on $ε$ and that variable-length coding allows to \mw{increase the rates over the optimal} fixed-length coding \mw{scheme} by the factor $(1-ε)^{-1}$.
We study an incremental redundancy (IR) cooperative coding scheme for wireless networks. To exploit the spatial diversity benefit we propose a cluster-based collaborating strategy for a quasi-static Rayleigh fading channel model and based on a network geometric distance profile. Our scheme enhances the network performance by embedding an IR cooperative coding scheme into an existing noncooperative route. More precisely, for each hop, we form a collaborating cluster of M-1 nodes between the (hop) sender and the (hop) destination. The transmitted message is encoded using a mother code and partit…
In this paper, we consider the application of Reed- Solomon (RS) channel coding for joint error correction and cooperative network coding on non-binary phase shift keying (PSK) modulated signals. The relay first decodes the RS channel coded messages received each in a time slot from all sources before applying network coding (NC) by the use of bit-level exclusive OR (XOR) operation. The network coded resulting message is then channel encoded before its transmission to the next relay or to the destination according to the network configuration. This scenario shows superior performance in compar…
In this letter, we propose two power allocation schemes based on the statistical channel state information (CSI) and instantaneous s->r CSI at transmitters respectively for a 2-N-2 cooperative multicast system with non-regenerative network coding.Then the isolated precoder and the distributed precoder are respectively applied to the schemes to further improve the system performance by achieving the full diversity gain. Finally, we demonstrate that joint instantaneous s->r CSI based power allocation and distributed precoder design achieve the best performance.
Cooperative transmission is an emerging communication technique that takes advantages of the broadcast nature of wireless channels. However, due to low spectral efficiency and the requirement of orthogonal channels, its potential for use in future wireless networks is limited. In this paper, by making use of multiuser detection (MUD) and network coding, cooperative transmission protocols with high spectral efficiency, diversity order, and coding gain are developed. Compared with the traditional cooperative transmission protocols with single-user detection, in which the diversity gain is only f…
In this paper, we investigate the impact of network coding at the relay node on the stable throughput rate in multicasting cooperative wireless networks. The proposed protocol adopts Network-level cooperation in contrast to the traditional physical layer cooperative protocols and in addition uses random linear network coding at the relay node. The traffic is assumed to be bursty and the relay node forwards its packets during the periods of source silence which allows better utilization for channel resources. Our results show that cooperation will lead to higher stable throughput rates than con…
Efficient optimal prefix coding has long been accomplished via the Huffman algorithm. However, there is still room for improvement and exploration regarding variants of the Huffman problem. Length-limited Huffman coding, useful for many practical applications, is one such variant, for which codes are restricted to the set of codes in which none of the $n$ codewords is longer than a given length, $l_{\max}$. Binary length-limited coding can be done in $O(n l_{\max})$ time and O(n) space via the widely used Package-Merge algorithm and with even smaller asymptotic complexity using a lesser-known …
In this work, we consider the problem of coding for the half-duplex non-orthogonal amplify-and-forward (NAF) cooperative channel where the transmitter to relay and the inter-relay links are highly reliable. We derive bounds on the diversity order of the NAF protocol that are achieved by a distributed space-time bit-interleaved coded modulation (D-ST-BICM) scheme under iterative APP detection and decoding. These bounds lead to the design of space-time precoders that ensure maximum diversity order and high coding gains. The word error rate performance of D-ST-BICM are also compared to outage pro…
Envelopes of upper bounds for nonbinary constant-weight and constant-composition codes
Moscow Institute of Physics and Technology (State University)（莫斯科物理技术学院）；Institute of Mathematics and Informatics, Bulgarian Academy of Sciences（保加利亚科学院数学与信息学研究所）；Lomonosov Moscow State University（莫斯科罗蒙诺索夫国立大学）；Adyghe State University（阿迪格国立大学）
An adaptive delay-tolerant distributed space-time coding (DSTC) scheme that exploits feedback is proposed for two-hop cooperative MIMO networks. Maximum likelihood (ML) receivers and adjustable code matrices are considered subject to a power constraint with a decode-and-forward (DF) cooperation strategy. In the proposed delay-tolerant DSTC scheme, an adjustable code matrix is employed to transform the space-time coded matrix at the relay nodes. Least-squares (LS) algorithms are developed with reduced computational complexity to adjust the parameters of the codes. Simulation results show that t…
Cooperative transmission is an emerging communication technique that takes advantage of the broadcast nature of wireless channels. However, due to low spectral efficiency and the requirement of orthogonal channels, its potential for use in future wireless networks is limited. In this paper, by making use of multiuser detection (MUD) and network coding, cooperative transmission protocols with high spectral efficiency, diversity order, and coding gain are developed. Compared with the traditional cooperative transmission protocols with single-user detection, in which the diversity gain is only fo…
In this work, we propose buffer-aided physical-layer network coding (PLNC) techniques for cooperative direct-sequence code-division multiple access systems. In the proposed buffer-aided PLNC schemes, a relay pair selection algorithm is employed to obtain the relay pair and the packets in the buffer entries with the best performance and the associated link combinations used for data transmission. We also devise PLNC schemes based on the design of linear network coding matrices using maximum likelihood and minimum mean-square error criteria to generate the network coded symbols that are sent to …
A novel lattice coding framework is proposed for outage-limited cooperative channels. This framework provides practical implementations for the optimal cooperation protocols proposed by Azarian et al. In particular, for the relay channel we implement a variant of the dynamic decode and forward protocol, which uses orthogonal constellations to reduce the channel seen by the destination to a single-input single-output time-selective one, while inheriting the same diversity-multiplexing tradeoff. This simplification allows for building the receiver using traditional belief propagation or tree sea…
An adaptive randomized distributed space-time coding (DSTC) scheme and algorithms are proposed for two-hop cooperative MIMO networks. Linear minimum mean square error (MMSE) receivers and an amplify-and-forward (AF) cooperation strategy are considered. In the proposed DSTC scheme, a randomized matrix obtained by a feedback channel is employed to transform the space-time coded matrix at the relay node. Linear MMSE expressions are devised to compute the parameters of the adaptive randomized matrix and the linear receive filter. A stochastic gradient algorithm is also developed to compute the par…
In this paper, a two-relay full-duplex asynchronous cooperative network with the amplify-and-forward (AF) protocol is considered. We propose two distributed space-time coding schemes for the cases with and without cross-talks, respectively. In the first case, each relay can receive the signal sent by the other through the cross-talk link. We first study the feasibility of cross-talk cancellation in this network and show that the cross-talk interference cannot be removed well. For this reason, we design space-time codes by utilizing the cross-talk signals instead of removing them. In the other …
A coding scheme for write once memory (WOM) using polar codes is presented. It is shown that the scheme achieves the capacity region of noiseless WOMs when an arbitrary number of multiple writes is permitted. The encoding and decoding complexities scale as O(N log N) where N is the blocklength. For N sufficiently large, the error probability decreases sub-exponentially in N. The results can be generalized from binary to generalized WOMs, described by an arbitrary directed acyclic graph, using nonbinary polar codes. In the derivation we also obtain results on the typical distortion of polar cod…
This paper deals with the problem of multicasting a set of discrete memoryless correlated sources (DMCS) over a cooperative relay network. Necessary conditions with cut-set interpretation are presented. A \emph{Joint source-Wyner-Ziv encoding/sliding window decoding} scheme is proposed, in which decoding at each receiver is done with respect to an ordered partition of other nodes. For each ordered partition a set of feasibility constraints is derived. Then, utilizing the sub-modular property of the entropy function and a novel geometrical approach, the results of different ordered partitions a…
In this work, we propose and analyze a generalized construction of distributed network codes for a network consisting of $M$ users sending different information to a common base station through independent block fading channels. The aim is to increase the diversity order of the system without reducing its throughput. The proposed scheme, called generalized dynamic-network codes (GDNC), is a generalization of the dynamic-network codes (DNC) recently proposed by Xiao and Skoglund. The design of the network codes that maximize the diversity order is recognized as equivalent to the design of linea…
This paper presents a cross-layer approach to jointly design adaptive modulation and coding (AMC) at the physical layer and cooperative truncated automatic repeat request (ARQ) protocol at the data link layer. We first derive an exact closed form expression for the spectral efficiency of the proposed joint AMC-cooperative ARQ scheme. Aiming at maximizing this system performance measure, we then optimize an AMC scheme which directly satisfies a prescribed packet loss rate constraint at the data-link layer. The results indicate that utilizing cooperative ARQ as a retransmission strategy, noticea…
In this paper, we propose two distributed linear convolutional space-time coding (DLC-STC) schemes for full-duplex (FD) asynchronous cooperative communications. The DLC-STC Scheme 1 is for the case of the complete loop channel cancellation, which achieves the full asynchronous cooperative diversity. The DLC-STC Scheme 2 is for the case of the partial loop channel cancellation and amplifying, where some loop signals are used as the self-coding instead of treated as interference to be directly cancelled. We show this scheme can achieve full asynchronous cooperative diversity. We then evaluate th…
In this paper, a multi-source multi-relay cooperative wireless network with binary modulation and binary network coding is studied. The system model encompasses: i) a demodulate-and-forward protocol at the relays, where the received packets are forwarded regardless of their reliability; and ii) a maximum-likelihood optimum demodulator at the destination, which accounts for possible demodulations errors at the relays. An asymptotically-tight and closed-form expression of the end-to-end error probability is derived, which clearly showcases diversity order and coding gain of each source. Unlike o…
In this work, we propose a dynamic buffer-aided distributed space-time coding (DSTC) scheme for cooperative direct-sequence code-division multiple access systems. We first devise a relay selection algorithm that can automatically select the optimum set of relays among both the source-relay phase and the relay-destination phase for DSTC transmission according to the signal-to-interference-plus-noise ratio (SINR) criterion. Multiple relays equipped with dynamic buffers are introduced in the network, which allows the relays to store data received from the sources and wait until the most appropria…
In this work we propose an adaptive buffer-aided space-time coding scheme for cooperative wireless networks. A maximum likelihood receiver and adjustable code vectors are considered subject to a power constraint with an amplify-and-forward cooperation strategy. Each multiple-antenna relay is equipped with a buffer and is capable of storing the received symbols before forwarding them to the destination. We also present an adaptive relay selection and optimization algorithm, in which the instantaneous signal to noise ratio in each link is calculated and compared at the destination. An adjustable…
In this paper, a joint cross-layer design of adaptive modulation and coding (AMC) and cooperative automatic repeat request (C-ARQ) scheme is proposed for a secondary user in a shared-spectrum environment. First, based on the statistical descriptions of the channel, closed-form expressions of the average spectral efficiency (SE) and the average packet loss rate (PLR) are presented. Then, the cross-layer scheme is designed, with the aim of maximizing the average SE while maintaining the average PLR under a prescribed level. An optimization problem is formed, and a sub-optimal solution is found: …
In this paper, novel cooperative automatic repeat request (ARQ) methods with network coding are proposed for two way relaying network. Upon a failed transmission of a packet, the network enters cooperation phase, where the retransmission of the packets is aided by the relay node. The proposed approach integrates network coding into cooperative ARQ, aiming to improve the network throughput by reducing the number of retransmissions. For successive retransmission, three different methods for choosing the retransmitting node are considered. The throughput of the methods are analyzed and compared. …
An adaptive randomized distributed space-time coding (DSTC) scheme is proposed for two-hop cooperative MIMO networks. Linear minimum mean square error (MMSE) receiver filters and randomized matrices subject to a power constraint are considered with an amplify-and-forward (AF) cooperation strategy. In the proposed DSTC scheme, a randomized matrix obtained by a feedback channel is employed to transform the space-time coded matrix at the relay node. The effect of the limited feedback and feedback errors are considered. Linear MMSE expressions are devised to compute the parameters of the adaptive …
We consider a cognitive radio network scenario where a primary transmitter and a secondary transmitter, respectively, communicate a message to their respective primary receiver and secondary receiver over a packet-based wireless link, using a joint automatic-repeat-request (ARQ) error control scheme. The secondary transmitter assists in the retransmission of the primary message, which improves the primary performance, and is granted limited access to the transmission resources. Conventional ARQ, as well as two network-coding schemes are investigated for application in the retransmission phase;…
In this paper, we contribute to the theoretical understanding, the design, and the performance evaluation of multi-source multi-relay network-coded cooperative diversity protocols. These protocols are useful to counteract the spectral inefficiency of repetition-based cooperation. We provide a general analytical framework for analysis and design of wireless networks using the Demodulate-and-Forward (DemF) protocol with binary Network Coding (NC) at the relays and Cooperative Maximal Ratio Combining (C-MRC) at the destination. Our system model encompasses an arbitrary number of relays which offe…
We present sufficient conditions for multicasting a set of correlated sources over cooperative networks. We propose joint source-Wyner-Ziv encoding/sliding-window decoding scheme, in which each receiver considers an ordered partition of other nodes. Subject to this scheme, we obtain a set of feasibility constraints for each ordered partition. We consolidate the results of different ordered partitions by utilizing a result of geometrical approach to obtain the sufficient conditions. We observe that these sufficient conditions are indeed necessary conditions for Aref networks. As a consequence o…
The problem of communicating a single message to a destination in presence of multiple relay nodes, referred to as cooperative unicast network, is considered. First, we introduce "Mixed Noisy Network Coding" (MNNC) scheme which generalizes "Noisy Network Coding" (NNC) where relays are allowed to decode-and-forward (DF) messages while all of them (without exception) transmit noisy descriptions of their observations. These descriptions are exploited at the destination and the DF relays aim to decode the transmitted messages while creating full cooperation among the nodes. Moreover, the destinati…
This work proposes adaptive buffer-aided distributed space-time coding schemes and algorithms with feedback for wireless networks equipped with buffer-aided relays. The proposed schemes employ a maximum likelihood receiver at the destination and adjustable codes subject to a power constraint with an amplify-and-forward cooperative strategy at the relays. Each relay is equipped with a buffer and is capable of storing blocks of received symbols and forwarding the data to the destination if selected. Different antenna configurations and wireless channels, such as static block fading channels, are…
Cooperation among mobile devices and utilizing multiple interfaces such as cellular and local area links simultaneously are promising to meet the increasing throughput demand over cellular links. In particular, when mobile devices are in the close proximity of each other and are interested in the same content, device-to-device connections such as WiFi-Direct, in addition to cellular links, can be utilized to construct a cooperative system. However, it is crucial to understand the potential of network coding for cooperating mobile devices with multiple interfaces. In this paper, we consider thi…
We propose a base-station (BS) cooperation model for broadcasting a discrete memoryless source in a cellular or heterogeneous network. The model allows the receivers to use helper BSs to improve network performance, and it permits the receivers to have prior side information about the source. We establish the model's information-theoretic limits in two operational modes: In Mode 1, the helper BSs are given information about the channel codeword transmitted by the main BS, and in Mode 2 they are provided correlated side information about the source. Optimal codes for Mode 1 use \emph{hash-and-f…
In a cooperative relay network, a relay node (R) facilitates data transmission to the destination node (D), when the latter is unable to decode the source node (S) data correctly. This paper considers such a system model and presents a cross-layer approach to jointly design adaptive modulation and coding (AMC) at the physical layer and cooperative truncated automatic repeat request (ARQ) protocol at the data link layer. We first derive a closed form expression for the spectral efficiency of the joint cooperative ARQ-AMC scheme. Aiming at maximizing this performance measure, we then optimize tw…
This paper deals with superposition coding for cooperative broadcasting in the case of two coordinated source nodes, as introduced in the seminal work of Bergmans and Cover in 1974. A scheme is introduced for two classes of destination (or relay) nodes: Close nodes and far nodes, as ranked by their spatial distances to the pair of transmitting nodes. Two linear codes are combined using the (u,u+v)-construction devised by Plotkin to construct two-level linear unequal error protection (LUEP) codes. However, instead of binary addition of subcode codewords in the source encoder, here modulated sub…
In this paper, we study the performance of network-coded cooperative diversity systems with practical communication constraints. More specifically, we investigate the interplay between diversity, coding, and multiplexing gain when the relay nodes do not act as dedicated repeaters, which only forward data packets transmitted by the sources, but they attempt to pursue their own interest by forwarding packets which contain a network-coded version of received and their own data. We provide a very accurate analysis of the Average Bit Error Probability (ABEP) for two network topologies with three an…
The goal of the paper is to study specific properties of nonbinary low-density parity-check (NB LDPC) codes when used in coded modulation systems. The paper is focused on the practically important NB LDPC codes over extensions of the Galois field GF$(2^m)$ with $m \le 6$ used with QAM signaling. Performance of NB QC LDPC coded transmission strongly depends on mapping of nonbinary symbols to signal constellation points. We obtain a random coding bound on the maximum-likelihood decoding error probability for an ensemble of random irregular NB LDPC codes used with QAM signaling for specific symbo…
In this study, a cross-layer design which combines adaptive modulation and coding (AMC) and hybrid automatic repeat request (HARQ) techniques for a cooperative wireless network is investigated analytically. Previous analyses of such systems in the literature are confined to the case where the fading channel is independent at each retransmission, which can be unrealistic unless the channel is varying very fast. On the other hand, temporal channel correlation can have a significant impact on the performance of HARQ systems. In this study, utilizing a Markov channel model which accounts for the t…
We evaluate the secrecy performance of a multiple access cooperative network where the destination node is wiretapped by a malicious and passive eavesdropper. We propose the application of the network coding technique as an alternative to increase the secrecy at the destination node, on the top of improving the error performance of the legitimate communication, already demonstrated in the literature. Network coding is leveraged by assuming that the legitime cooperative nodes are able to perform non-binary linear combinations of different frames before the transmission. Different scenarios with…
From currency to cloud storage systems, the continuous rise of the blockchain technology is moving various information systems towards decentralization. Blockchain-based decentralized storage networks (DSNs) offer significantly higher privacy and lower costs to customers compared with centralized cloud storage associated with specific vendors. Coding is required in order to retrieve data stored on failing components. While coding solutions for centralized storage have been intensely studied, topology-aware coding for heterogeneous DSNs have not yet been discussed. In this paper, we propose a j…
In this work, we propose buffer-aided distributed space-time coding (DSTC) schemes and relay selection algorithms for cooperative direct-sequence code-division multiple access (DS-CDMA) systems. We first devise a relay pair selection algorithm that can form relay pairs and then select the optimum set of relays among both the source-relay phase and the relay-destination phase according to the signal-to-interference-plus-noise ratio (SINR) criterion. Multiple relays equipped with dynamic buffers are then introduced in the network, which allows the relays to store data received from the sources a…
Network coding and cooperative communication have received considerable attention from the research community recently in order to mitigate the adverse effects of fading in wireless transmissions and at the same time to achieve high throughput and better spectral efficiency. In this work, we analyze a network coding scheme for a cooperative communication setup with multiple sources and destinations. The proposed protocol achieves the full diversity order at the expense of a slightly reduced multiplexing rate compared to existing schemes in the literature. We show that our scheme outperforms co…
Relay-based cooperative communication has become a research focus in recent years because it can achieve diversity gain in wireless networks. In existing works, network coding and two-path relay are adopted to deal with the increase of network size and the half-duplex nature of relay, respectively. To further improve bandwidth efficiency, we propose a novel cooperative transmission scheme which combines network coding and two-path relay together in a multi-source system. Due to the utilization of two-path relay, our proposed scheme achieves full-rate transmission. Adopting complex field networ…
In this paper, a transmission strategy of fountain codes over cooperative relay networks is proposed. When more than one relay nodes are available, we apply network coding to fountain-coded packets. By doing this, partial information is made available to the destination node about the upcoming message block. It is therefore able to reduce the required number of transmissions over erasure channels, hence increasing the effective throughput. Its application to wireless channels with Rayleigh fading and AWGN noise is also analysed, whereby the role of analogue network coding and optimal weight se…
An adaptive distributed space-time coding (DSTC) scheme is proposed for two-hop cooperative MIMO networks. Linear minimum mean square error (MMSE) receive filters and adjustable code matrices are considered subject to a power constraint with an amplify-and-forward (AF) cooperation strategy. In the proposed adaptive DSTC scheme, an adjustable code matrix obtained by a feedback channel is employed to transform the space-time coded matrix at the relay node. The effects of the limited feedback and the feedback errors are assessed. Linear MMSE expressions are devised to compute the parameters of th…
We consider the problem of data exchange by a group of closely-located wireless nodes. In this problem each node holds a set of packets and needs to obtain all the packets held by other nodes. Each of the nodes can broadcast the packets in its possession (or a combination thereof) via a noiseless broadcast channel of capacity one packet per channel use. The goal is to minimize the total number of transmissions needed to satisfy the demands of all the nodes, assuming that they can cooperate with each other and are fully aware of the packet sets available to other nodes. This problem arises in s…
In this paper, we introduce a game theoretic framework for studying the problem of minimizing the delay of instantly decodable network coding (IDNC) for cooperative data exchange (CDE) in decentralized wireless network. In this configuration, clients cooperate with each other to recover the erased packets without a central controller. Game theory is employed herein as a tool for improving the distributed solution by overcoming the need for a central controller or additional signaling in the system. We model the session by self-interested players in a non-cooperative potential game. The utility…
The energy efficiency (EE) of a multi-user multi-relay system with the maximum diversity network coding (MDNC) is studied. We explicitly find the connection among the outage probability, energy consumption and EE and formulate the maximizing EE problem under the outage probability constraints. Relay scheduling (RS) and power allocation (PA) are applied to schedule the relay states (transmitting, sleeping, \emph{etc}) and optimize the transmitting power under the practical channel and power consumption models. Since the optimization problem is NP-hard, to reduce computational complexity, the ou…
A multiple access relay channel (MARC) is considered in which an analogue-like network coding is implemented in the relay node. This analogue coding is a simple addition of the received signals at the relay node. Using "nulling detection" structure employed in V-BLAST receiver, we propose a detection scheme in the destination which is able to provide a diversity order of two for all users. We analytically evaluate the performance of our proposed scheme for the MARC with two users where tight upper bounds for both uncoded and Convolutionally coded transmission blocks are provided. We verify our…
A non-regenerative dual-hop wireless system based on a distributed space-time coding strategy is considered. It is assumed that each relay retransmits an appropriately scaled space-time coded version of its received signal. The main goal of this paper is to investigate a power allocation strategy in relay stations, which is based on minimizing the outage probability. In the high signal-to-noise ratio regime for the relay-destination link, it is shown that a threshold-based power allocation scheme (i.e., the relay remains silent if its channel gain with the source is less than a prespecified th…
One of the most efficient methods of exploiting space diversity for portable wireless devices is cooperative communication utilizing space-time block codes. In cooperative communication, users besides communicating their own information, also relay the information of other users. In this paper we investigate a scheme where cooperation is achieved using two methods, namely, distributed space-time coding and network coding. Two cooperating users utilize Alamouti space time code for inter-user cooperation and in addition utilize a third relay which performs network coding. The third relay does no…
