A Distributed Differential Space-Time Coding Scheme With Analog Network Coding in Two-Way Relay Networks

Abstract

which is then solved by a GP solver, e.g., gpcvx or MOSEK based on state-of-the-art interior-point method (IPM).An important subtlety should be noted. When all globally optimumx for (11) contains zero entries, the corresponding optimum y for (12) contains entries equal to 01. In such a case, the IPM iteratively outputs y with g 0 (y) asymptotically approaching the optimum objective value for (12), which leads to an overflow in the processor running the GP solver that implements the IPM. It is rarely known a priori if the optimum x for (11) contains zero entries. To avoid overflow, the GP solver by default adds entrywise lower-bound constraints on x, or equivalently on y before solving (12) (see [21, p. 3]). These constraints should be set to ensure that the optimum x for (11) with the extra constraints corresponds to an objective value within a prescribed small tolerance around the original optimum objective for (11). ACKNOWLEDGMENTThe authors would like to thank Prof. M. Dong and the anonymous reviewers for their precious comments and suggestions which has improved this work. REFERENCES[1] R. Cendrillon, W. Yu, M. Moonen, J. Verlinden, and T. Bostoen, "Optimal multiuser spectrum balancing for digital subscriber lines," IEEE Trans.

Selective combining for hybrid cooperative networks

“…In this section, the analytical and the simulated results are provided for the SCHCN scheme. Without specific mention, all simulations are performed by a BPSK modulation and a frame size of 100 symbols over block Rayleigh fading channels [53]- [55]. We consider the multiple relay nodes scenario, e.g., N = 1, 2, 3.…”

Compressed Relaying for Two-Way Relay Networks With Correlated Sources

“…It is assumed that the information bits at both source nodes are divided equally into blocks and each block consists of n bits. Let a 1i = [a 1i (1), · · · , a 1i (n)] and a 2i = [a 2i (1), · · · , a 2i (n)] be the ith block of message transmitted by T 1 and T 2 , where a 1i , a 2i ∈ {0, 1} 1×n . The binary phase-shift keying (BPSK) modulation is considered for simplicity and the modulated symbols of a 1i and a 2i are denoted by…”

A Study on Orthogonal Space-time Block Codes for Cooperative Function

“…The capacity (2.1) is a random variable and does not give a single-number representation of channel quality. Two straightforward summaries are commonly used: the mean (or ergodic) capacity [9][10][11] and capacity outage [3,7,9,12]. Capacity outage measures (usually based on simulation) are often denoted C0:1 or C0:01, i.e., Now they can focus on the information theoretic capacity of a MIMO system.…”

“…Where the subscript [12] is to represent the in determinates c 1 and c 2 in the transmission matrix. Now, let us consider the following spacetime block code for four transmit antennas as …”