Two-way relaying using constant envelope modulation and phase-superposition-phase-forward

Huai Tan; Paul Ho

doi:10.1186/1687-1499-2011-120

Research
Open Access

Two-way relaying using constant envelope modulation and phase-superposition-phase-forward

Huai Tan¹ and
Paul Ho¹Email author

EURASIP Journal on Wireless Communications and Networking20112011:120

https://doi.org/10.1186/1687-1499-2011-120

Received: 14 December 2010
Accepted: 6 October 2011
Published: 6 October 2011

Abstract

In this article, we propose the idea of phase-superposition-phase-forward (PSPF) relaying for 2-way 3-phase cooperative network involving constant envelope modulation with discriminator detection in a time-selective Rayleigh fading environment. A semi-analytical expression for the bit-error-rate (BER) of this system is derived and the results are verified by simulation. It was found that, compared to one-way relaying, 2-way relaying with PSPF suffers only a moderate loss in energy efficiency (of 1.5 dB). On the other hand, PSPF improves the transmission efficiency by 33%. Furthermore, we believe that the loss in transmission efficiency can be reduced if power is allocated to the different nodes in this cooperative network in an 'optimal' fashion. To further put the performance of the proposed PSPF scheme into perspective, we compare it against a phase-combining phase-forward technique that is based on decode-and-forward (DF) and multi-level CPFSK re-modulation at the relay. It was found that DF has a higher BER than PSPF and requires additional processing at the relay. It can thus be concluded that the proposed PSPF technique is indeed the preferred way to maintain constant envelope signaling throughout the signaling chain in a 2-way 3 phase relaying system.

Keywords

2-way relaying
phase-only-forward
decode-and-forward
cooperative communications
constant envelope modulation
continuous phase modulation
CPFSK
discriminator detection

1. Introduction

Cooperative transmission is a cost effective way to combat fading because it creates a virtual multiple-input-multiple-output (MIMO) communication channel without resorting to mounting antenna arrays at individual nodes [1, 2]. Earlier researches on cooperative transmission focus on one-way relaying with amplify-and-forward (AF) and decode-and-forward (DF) protocols [3–5]. Orthogonal time-slots are employed by the source and the relay to allow the destination node to obtain independent faded copies of the same message for combining purpose [3, 4]. The creation of these orthogonal time slots reduces the throughput of the system [6]. For example, the so-called Protocol II in [7] has a throughput of 1/N message/slot, where N is the number of relays in the system.

To improve the transmission efficiency of cooperative communication, two-way relaying is proposed [8–12]. For example in [12], a two-way relay network where two users exchange information with the assistance of an intermediate relay node was considered. Specifically, the authors consider the so-called decode-superposition-forward (DSF) and decode-XOR-forward (DXF) protocols for 2-way 3-phase relaying. These protocols can support bi-lateral transmission over three orthogonal time slots, leading to an improved throughput of 2/3 message/slot, i.e., a 33% improvement over 1-way relaying with a single relay.

The signals transmitted by all three nodes in the system in [12] are QAM-type linear modulations. While linear modulation has many desirable features, it imposes a relatively stringent requirement on amplifier linearity. This is especially true in the case of DSF, where the transmitted signal constellation at the relay is essentially the superposition of two constituent QAM constellations. In contrast, constant envelope modulation enables the use of inexpensive nonlinear (Class C) power amplifiers. These modulations are widely used in public safety (police, ambulance) and private mobile communication systems (taxi, dispatch, courier fleets), even though they are, in general, not as bandwidth efficient as QAM modulations. The use of constant envelope modulations in cooperative communications had been considered in [13–15]. Specifically, in [15], continuous-phase frequency-shift-keying (CPFSK) and phase-forward was proposed for 2-node MRC-type cooperative communication system with time-selective Rayleigh fading and discriminator detection. The authors reported that PF has a lower BEP than decode-and-forward. It also delivers the same performance as amplify-and-forward when dual-antenna selection is available at the relay. They concluded that PF is a cost-effective alternative to AF and DF, since it does not need signal regeneration at the relay nor does it need expensive linear amplifiers.

In this article, we consider the application of CPFSK and phase-forward in a 2-way 3-phase cooperative communication system with time-selective Rayleigh fading. A major contribution is in the development of a phase-superposition phase-forward (PSPF) strategy that maintains the constant envelope property at the relay without resorting to any intermediate decoding. The usefulness of the proposed PSPF scheme is confirmed via a semi-analytical bit-error-rate (BER) analysis, as well as comparing it against one-way relaying and against a 2-way 3-phase strategy based on decode-and-forward and multi-level CPFSK re-modulation at the relay.

The article is organized as follows. We first describe in Section 2, the signal and system model for the proposed PSPF relaying scheme and competing Decode and Forward (DF) schemes based on multilevel CPFSK re-modulation at the relay. The detection and combining strategies are presented in Section 3, followed by a discussion of implementation issues in Section 4. The BER of the proposed scheme is analyzed in Section 5, and the companion numerical results provided in Section 6. Finally, conclusions of this investigation are given in Section 7.

We adopt the following notations/definitions throughout the article: j² = -1; (·)* and |·| denote, respectively, the conjugate and magnitude of a complex number; (·)^T and (·)^† represent, respectively, the regular and Hermitian transposes of a matrix; E[·] is the expectation operator; $\frac{1}{2} E [| x |^{2}]$ the variance of a zero-mean complex random variable x with independent and identically distributed (i.i.d.) real and imaginary components; CN(μ, σ²) refers to a complex Gaussian random variable with mean μ and variance σ²; sinc(x) = sin(πx)/(πx); and $ẋ$ the derivative of x.

2. 3-phase 2-way cooperative communication system model

We consider a 3-phase 2-way relay cooperative communication system consisting of three nodes: user A and its bilateral partner user B, as well as a relay R. All nodes operate in half duplex mode. The system diagram is shown in Figure 1. During the first phase, A transmits its data to B, while B and R listen. The received signals at R and B are

Figure 1
**3-phase 2-way relaying system model**.

y_{R, 1} (t) = g_{A R} (t) x_{A} (t) + n_{R, 1} (t)

(1)

and

y_{B, 1} (t) = g_{A B} (t) x_{A} (t) + n_{B, 1} (t),

(2)

where x_A (t) is the signal transmitted by A, n_R,1(t) and n_{B, 1}(t) the zero-mean complex additive white Gaussian noise (AWGN) terms at R and B in the first phase, and g_AR (t) and g_AB (t) the zero-mean complex Gaussian processes that represent Rayleigh fading in the A-R and A-B links.

In the second phase, it is B 's turn to transmit its data to A. This time, both A and R are in the listening mode. The received signals at R and A are

y_{R, 2} (t) = g_{B R} (t) x_{B} (t) + n_{R, 2} (t)

(3)

and

y_{A, 2} (t) = g_{B A} (t) x_{B} (t) + n_{A, 2} (t),

(4)

where x_B (t) is the signal transmitted by B, n_{R, 2}(t) and n_A,2(t) the AWGNs at R and A in the second phase, and g_BR (t) and g_BA (t) the zero-mean complex Gaussian processes that represent Rayleigh fading in the B-R and B-A links.

Finally in the last phase, only R transmits, both A and B listen. The received signals at A and B are

y_{A, 3} (t) = g_{R A} (t) x_{R} (t) + n_{A, 3} (t)

(5)

and

y_{B, 3} (t) = g_{R B} (t) x_{R} (t) + n_{B, 3} (t),

(6)

where x_R (t) is the signal transmitted by R, n_A,3(t) and n_B,3(t) the complex AWGNs at A and B in the third phase, and g_RA (t) and g_RB (t) the zero-mean complex Gaussian processes that represent Rayleigh fading in the R-A and R-B links. In this investigation, we assume the six fading processes in (1) to (6) are statistically independent. In addition, all the six noise terms in (1) to (6) are i.i.d.

In this article, all the transmitted signals x_A (t), x_B (t), and x_R (t) are constant envelope signals.

Specifically, the former two are CPFSK signals of the form

x_{i} (t) = e^{j θ_{i} (t)}; i \in {A, B},

(7)

where

θ_{i} (t) = π h (\sum_{n = 0}^{k - 1} d_{i, n}) + π h d_{i, k} \cdot (t - k T) ∕ T, k T < t \leq (k + 1) T,

(8)

is the information carrying phase, with d_{i, k} ∈ {±1} being the data bit in the k-th symbol interval for User i, i ∈ {A, B}, h being the modulation index, and T the bit-duration. Note that the derivative of the information carrying phase is

{\dot{θ}}_{i} (t) = π h d_{i, k} ∕ T, k T < t \leq (k + 1) T,

(9)

which is proportional to the data bit d_{i, k} . This property is crucial in understanding the decision rule made by the discriminator detector presented in the next section. Another property of CPFSK that is important to the understanding of the results is the bandwidth of the signal. It is well known [16] that CPFSK signals, are in general, not band-limited. As such, a common practice is to adopt the frequency range that contains 99% of the total signal power as the bandwidth of the signal. This is referred to as the 99% bandwidth [16]. As an example, consider the so-called minimum shift keying (MSK) scheme, i.e., CPFSK with h = 1/2. Using the results from [17], the 99% bandwidth of MSK is found to be 1.1818/T.

2.1 Phase superposition phase forward

The signal transmitted by the relay, x_R (t), assumes the following form

x_{R} (t) = exp \{j (arg [y_{R, 1} (t)] + arg [y_{R, 2} (t)])\},

(10)

where arg[y_R,1(t)] and arg[y_R,2(t)] are the phases of the signals y_R,1(t) and y_R,2(t), respectively. Note that x_R (t) is both constant envelope and continuous-phase, just like the data signals x_A (t) and x_B (t). We thus call the forwarding strategy in (10) a phase superposition-phase-forward (PSPF) scheme. Since this phase superposition is equivalent to a multiplication of (the hard-limited versions of) the signals y_R,1(t) and y_R,2(t) in the time domain, the corresponding frequency domain convolution will lead to a spectrum expansion if the relay is destined to transmit without any bandwidth limitation.

One nice feature of the proposed PSPF technique is that constant envelope signaling is maintained at the relay without requiring it to perform any demodulation and re-modulation. A natural question to ask is, how does PSPF compare to decode-and-forward strategies that employ constant envelope signaling at the relay? To be able to answer this question, we introduce next the 3-level decode-and phase-forward (3-DPF) scheme and the alternate 4-level decode-and-phase-forward (A4-DPF) scheme as possible alternatives to PSPF. For both schemes, the relay first make decisions on User A's and User B's data based on the its received signals y_R,1(t) and y_R,2(t). It then applies the decisions, ${\hat{d}}_{A, n}$ and ${\hat{d}}_{B, n}$ , to (7) and (8) to re-generate User A's and User B's signals according to ${\hat{x}}_{A} (t) = exp \{j {\hat{θ}}_{A} (t)\}$ and ${\hat{x}}_{B} (t) = exp \{j {\hat{θ}}_{B} (t)\}$ .

2.2 3-level decode and phase forward (3-DPF)

With this decode and forward strategy, the relay adds the decoded phases in

{\hat{x}}_{A} (t)

and

{\hat{x}}_{B} (t)

synchronously to form the relay signal

x_{R} (t) = exp \{j ({\hat{θ}}_{A} (t) + {\hat{θ}}_{B} (t))\} = {\hat{x}}_{A} (t) {\hat{x}}_{B} (t) .

(11)

This signal is both constant envelope and continuous-phase, just like the data signals x_A (t) and x_B (t). Furthermore, because of synchronous mixing, we can view x_R (t) as a 3-level CPFSK signal with modulation index h and symbol values +2, 0, -2 that occur with priori probabilities $\frac{1}{4}, \frac{1}{2}, \frac{1}{4}$ . The three signal levels and the corresponding priori probabilities are due to the fact that the decoded bits ${\hat{d}}_{A, n}$ and ${\hat{d}}_{B, n}$ at the relay are {± 1} binary random variables. Another consequence of synchronous phase mixing is that the bandwidth of x_R (t) is less than the sum bandwidth of ${\hat{x}}_{A} (t)$ and ${\hat{x}}_{B} (t)$ , even though $x_{R} (t) = {\hat{x}}_{A} (t) {\hat{x}}_{B} (t)$ . Using MSK as example again, the sum bandwidth is two times 1.1818/T or 2.3636/T. The 99% bandwidth of the corresponding x_R (t), on the other hand, is only 1.832/T.

2.3 Alternate 4-level decode and phase forward (A4-DPF)

In general, we can construct a constant-envelope relay signal based on the superposition of the decoded phases as follows

x_{R} (t) = exp \{j (w_{A} {\hat{θ}}_{A} (t) + w_{B} {\hat{θ}}_{B} (t))\}

(12)

where w_A and w_B are weighting coefficients [9, 10, 12]. In the case where w_A = 2 and w_B = 1, x_R (t) becomes a conventional 4-level CPFSK scheme with modulation h and symbol values +3, +1, -1, -3 all occurring with equal probability. This signal will have a wider bandwidth than the 3-level relay signal in the previous section but it also has the potential to provide a better BEP performance (typical power-bandwidth tradeoff). One thing though, the unequal weightings on the two decoded phases will translate into an asymmetric error performance at A and B. This problem can be alleviated by alternating the weighting rules between even and odd time slots as follows:

\begin{gathered} w_{A} = 2, w_{B} = 1; even time slot, \\ w_{A} = 1, w_{B} = 2; odd time slot . \end{gathered}

(13)

We call this strategy alternate 4-level decode and phase forward or A4-DPF.

3. Discriminator detection of the relay signals

As shown in (1) to (6), the transmitted signals at A, B, and R, will in general, experience time-selective fading. This makes the implementation of coherent detection rather complicated. As such we consider the much simpler discriminator detector. This non-coherent detector does not need channel state information when making data decisions and it thus spares the receiver from performing complicated channel tracking and sequence detection tasks. Without loss of generality, we demonstrate in the following sections how User A detects the data intended for it from User B, i.e., the d_{B, k} 's, using a discriminator detector. The detection of User A's data at Node B follows exactly the same procedure. It is further assumed that ideal low-pass filters (LPF) are used to limit the amount of noise admitted into the detector, with the bandwidth of each receive LPF set to the 99% bandwidth of its incoming signal. As such, the noise processes in (1) to (6) are all band-limited white Gaussian noises.

3.1 Detection of PSPF signals

To see how discriminator detector works in the proposed PSPF system, we first rewrite the two received signals at the relay as

y_{R, 1} (t) = g_{A R} (t) e^{j θ_{A} (t)} + n_{R, 1} (t) = a_{R, 1} (t) e^{j ψ_{R, 1} (t)}

(14)

and

y_{R, 2} (t) = g_{B R} (t) e^{j θ_{B} (t)} + n_{R, 2} (t) = a_{R, 2} (t) e^{j ψ_{R, 2} (t)},

(15)

where a_R,1(t), a_R,2(t), ψ_R,1(t), and ψ_R,2(t) are the amplitudes and phases of the two signals. As stated in (10), the relay broadcasts

\begin{gathered} x_{R} (t) = exp \{j θ_{R} (t)\}, \\ θ_{R} (t) = ψ_{R, 1} (t) + ψ_{R, 2} (t), \end{gathered}

(16)

to A and B in the last phase. Substituting (16) into (5), the received signal at A during the third phase can now be written as

y_{A, 3} (t) = g_{R A} (t) e^{j θ_{R} (t)} + n_{A, 3} (t) = a_{A, 3} (t) e^{j ψ_{A, 3} (t)},

(17)

where a_A,3(t) and ψ_A,3(t) are, respectively, the amplitude and phase.

In order to detect the signal from B, User A first removes its own phase θ_A (t) from ψ_A,3(t). The resultant complex signal is

\begin{gathered} Y_{A, 3} (t) = a_{A, 3} (t) e^{j Ψ_{A, 3} (t)}, \\ Ψ_{A, 3} (t) = ψ_{A, 3} (t) - θ_{A} (t) . \end{gathered}

(18)

It then combines Y_A,3(t), non-coherently, with the signal

y_{A, 2} (t) = g_{B A} (t) e^{j θ_{B} (t)} + n_{A, 2} (t) = a_{A, 2} (t) e^{j ψ_{A, 2} (t)}

(19)

from (4), where a_A,2(t) and ψ_A,2(t) are, respectively, the received signal amplitude and phase.

Specifically at the decision making instant, which is taken to be the mid-symbol position in each bit interval, the non-coherent detector adds the phase derivatives

{\dot{ψ}}_{A, 2}

and

{\dot{Ψ}}_{A, 3}

according to the maximal ratio combining principle [15]

D = D_{2} + D_{3},

(20)

Where

\begin{gathered} D_{2} = 2 a_{A, 2}^{2} {\dot{ψ}}_{A, 2} = (y_{A, 2}^{*} ẏ_{A, 2}^{*}) (\begin{matrix} 0 & - j \\ j & 0 \end{matrix}) (\begin{matrix} y_{A, 2} \\ ẏ_{A, 2} \end{matrix}), \\ D_{3} = 2 a_{A, 3}^{2} {\dot{Ψ}}_{A, 3} = (Y_{A, 3}^{*} Ẏ_{A, 3}^{*}) (\begin{matrix} 0 & - j \\ j & 0 \end{matrix}) (\begin{matrix} Y_{A, 3} \\ Ẏ_{A, 3} \end{matrix}), \end{gathered}

(21)

and then makes a decision on the data bit in question, d_B , according to

{\hat{d}}_{B, k} = sgn (D) .

(22)

An intuitive understanding of the above decision rule can be gained by considering the ideal situation where there are no fading and noise in all the links. In this case, the received phase derivatives at the relay and at node A during the first and second phases of transmission are ${\dot{ψ}}_{R, 1} (t) = π h d_{A, k} ∕ T$ and ${\dot{ψ}}_{A, 2} (t) = π h d_{B, k} ∕ T$ ; see (9). Furthermore, the received phase derivative at node A during the third phase is simply ${\dot{ψ}}_{A, 3} (t) = π h (d_{A, k} + d_{B, k}) ∕ T$ . As a result, ${\dot{Ψ}}_{A, 3} (t) = {\dot{ψ}}_{A, 3} (t) - {\dot{θ}}_{A} (t) = π h d_{B, k} ∕ T$ . This means the sign of the decision variable D in (20) equals the sign of the data bit d_{B, k} . Naturally, in the presence of fading and noise, these phase derivatives are subjected to distortions. However, as long as the channel's average signal-to-noise ratio is at a decent level, the decision rule in (22) will still enable us to recover the data reliably. Further discussion on the optimality of (20) can be found in [15].

3.2. Detection of the 3-DPF and A4-DPF signals

From the discussion in Sections 2.1 and 2.3, we can see that 3-DPF is a specific case of A4-DPF. For both schemes, the relay broadcasts a signal of the form

x_{R} (t) = exp \{j θ_{R} (t)\}

in the final phase of cooperation, where

θ_{R} (t) = (w_{A} {\hat{θ}}_{A} (t) + w_{B} {\hat{θ}}_{B} (t))

is the phase of the relayed signal,

{\hat{θ}}_{A} (t)

and

{\hat{θ}}_{B} (t)

are the decoded phases at the relay, (w_A , w_B ) = (1,1) for 3-DPF, and (w_A , w_B ) alternates between (3,1) and (1,3) for A4-DPF. Using (17) as the definition of the received signal at A during the third phase, we first remove A's own phase from ψ_A,3(t) according to

\begin{gathered} Y_{A, 3} (t) = a_{A, 3} (t) e^{j Ψ_{A, 3} (t)}, \\ Ψ_{A, 3} (t) = (ψ_{A, 3} (t) - w_{A} θ_{A} (t)) ∕ w_{B} . \end{gathered}

(23)

and then combine the derivative of Ψ_A,3(t) non coherently with ${\dot{ψ}}_{A, 2}$ , the received phase derivative at A in Phase 2, according to (20) and (21). As in the case of PSPF, the decision rule is given by (22).

One nice feature about DF-based strategies is that the modulation index used at the relay, h_R , needs not to be identical to h, the modulation index used by A and B. This flexibility is especially important if we want to impose stringent bandwidth requirement on the signal transmitted by the relay. If the relay does use a different modulation index, the effective form of the forwarded phase is

θ_{R} (t) = ρ (w_{A} {\hat{θ}}_{A} (t) + w_{B} {\hat{θ}}_{B} (t))

, where ρ = h_R/h is the ratio of modulation indices. In this case, (23) should be modified to

\begin{gathered} Y_{A, 3} (t) = a_{A, 3} (t) e^{j Ψ_{A, 3} (t)}, \\ Ψ_{A, 3} (t) = (ψ_{A, 3} (t) - ρ w_{A} θ_{A} (t)) ∕ (ρ w_{B}) . \end{gathered}

(24)

before combining with ${\dot{ψ}}_{A, 2}$ according to (20) and (21).

4. Implementation issues

We provide in this section some implementation guidelines for the proposed PSPF strategy. Comparison with the considered decode-and-forward schemes, in terms of implementation complexity, will also be made.

According to (10), a PSPF relay needs to first convert the signals y_R,1(t) and y_R,2(t) in (1) and (3) into the constant envelope signals $ŷ_{R, 1} (t) = exp \{j arg [y_{R, 1} (t)]\}$ and $ŷ_{R, 2} (t) = exp \{j arg [y_{R, 2} (t)]\}$ before transmitting the product signal $x_{R} (t) = ŷ_{R, 1} (t) ŷ_{R, 2} (t)$ in the final phase of relaying. Given that the relay is half-duplex and cannot transmit and receive at the same time, it must first detect and store (the sufficient statistics of) the data packets it receives from A and B in their entireties before generating and forwarding the product constant envelope signal in the final phase. The procedure requires frame synchronization at the relay to ensure proper time-alignment of $ŷ_{R, 1} (t)$ and $ŷ_{R, 2} (t)$ . This can be done by inserting a special sync pattern into each data packet and correlating the received signals with this pattern at the relay. As for storage of the entire frames of $ŷ_{R, 1} (t)$ and $ŷ_{R, 2} (t)$ , this will be done in the digital domain via sampling and quantization. The minimum sampling frequency will be twice the bandwidth of x_R (t), rather than twice the bandwidth of individual $ŷ_{R, 1} (t)$ and $ŷ_{R, 2} (t)$ . This stems from the fact that signal mixing (multiplication) is a bandwidth-expanding process. We found that when the two source signals in (1) and (3) (namely x_A (t) and x_B (t)) are MSK, then the product signal x_R (t) has a bandwidth of 1.832/T, where 1/T is the bit rate. Therefore, in this case, a sampling frequency of 4/T would be sufficient to create signal samples that capture all the information about the product signal. As for quantization, it is relatively straight forward because, unlike the original received signals y_R,1(t) and y_R,2(t), the real and imaginary components of $ŷ_{R, 1} (t)$ and $ŷ_{R, 2} (t)$ all have finite dynamic range. Specifically, the values of these components are confined to the interval [-1, +1]. Given the limited dynamic range, we can use a simple b + 1 bits uniform quantizer, where b is chosen such that the signal-to-quantization noise ratio (SQNR) is much higher than the channel signal-to-noise ratio seen at the destination receiver. Since the SQNR of a uniform quantizer (assuming that the real and imaginary components of $ŷ_{R, 1} (t)$ and $ŷ_{R, 2} (t)$ are uniformly distributed in [-1, +1]) varies according to 2^{2(B + 1)}[18], an 8-bit (b = 7) quantizer can already yield a SQNR of 48 dB, which is much higher than the anticipated channel Signal-to-Noise-Ratio (SNR).

From the above discussion, it becomes clear that the proposed PSPF scheme requires a total of

N_{PSPF} = 4 \cdot (b + 1) \cdot K \cdot N

(25)

bits to store the signals

ŷ_{R, 1} (t)

and

ŷ_{R, 2} (t)

at the relay, where f_s = K/T is the sampling frequency, b + 1is the number of bits used in quantization, N is the number of bits in each data packet, and the factor of 4 is the total number of real and imaginary components in

ŷ_{R, 1} (t)

and

ŷ_{R, 2} (t)

. In contrast, the 3-DPF and A4-DPF schemes described in Sections 2.2 and 2.3 require only

N_{DPF} = 2 N

(26)

bits to store the decoded bit streams

{\{{\hat{d}}_{A, n}\}}_{n = 1}^{N}

and

{\{{\hat{d}}_{B, n}\}}_{n = 1}^{N}

. However, this reduction in storage requirement comes at the expense of additional computations required for demodulation and re-modulation at the relay. According to (21), the discriminator detector used for demodulation needs to compute the phase derivatives in the original received signal y_R,1(t) and y_R,2(t) at the decision making instants. These derivatives can be expressed in terms of the constant envelope signals

ŷ_{R, 1} (t)

and

ŷ_{R, 2} (t)

as

- j \cdot {ŷ^{*}}_{R, 1} (t) {\dot{ŷ}}_{R, 1} (t)

and

- j \cdot {ŷ^{*}}_{R, 2} (t) {\dot{ŷ}}_{R, 2} (t)

, where

ŷ^{*}

and

\dot{ŷ}

represent respectively signal conjugation and derivative. Let us assume the two signal derivatives

{\dot{ŷ}}_{R, 1} (t)

and

{\dot{ŷ}}_{R, 2} (t)

are computed in the digital domain with

ŷ_{R, 1} (t)

and

ŷ_{R, 2} (t)

represented by samples spaced T/K seconds apart, where K is an integer that is large enough to ensure that the sampling frequency f_s = K/T is higher than twice the bandwidth of the product signal

x_{R} (t) = ŷ_{R, 1} (t) ŷ_{R, 2} (t)

. Then the corresponding discrete-time differentiator is simply a K-tap digital finite impulse response filter^a with a computational complexity of K complex multiply-and-add (CMAD) for each decoded bit

{\hat{d}}_{A, n}

or

{\hat{d}}_{B, n}

. As a result, the total demodulation complexity is

C_{DEMOD} = 2 K N (CMAD)

(27)

As for the re-modulation complexity in DPF, if we assume a table look-up based modulator, then the basic operations are waveform fetching and concatenation. These operations can be assumed insignificant when compared to the multiply-and-add operations mentioned above. Although a table-look-up re-modulator requires storage of all possible modulation waveforms, this should not be counted towards the storage requirement of the two DPF schemes, since the modulator is always required to transmit a node's own data, irrespective of whether it uses PSPF or DPF while in the relay mode. Another implementation structure that is common to PSPF and DPF is the analog-to-digital converter front end.

In summary, from the computational complexity point of view, PSPF is simpler because it avoids the CMAD operations required for demodulation at the relay. Although it requires substantially more storage, the tradeoff still favors PSPF because memory is inexpensive while additional computational load can, in general, lead to quicker battery drain and even the need of a more powerful processor. We note further that the complexity of PSPF can be further reduced if we adopt direct bandpass processing. This is achieved by first passing $ỹ_{R, 1} (t)$ and $ỹ_{R, 2} (t)$ , the bandpass versions of y_R,1(t) and y_R,2(t), through a bandpass filter, followed by bandpass limiting [19], then bandpass sampling [20] and quantization. As shown in [20], the sampling frequency of the bandpass signals is roughly the same as that of their complex baseband versions. Therefore, no high-speed analog to digital converter (ADC) is required. By direct bandpass processing, we can bypass up and down conversions in PSPF altogether, which in turn reduces the number of multiplication and addition required to perform these steps in a digital modulator/demodulator. It should be emphasized that with decode-and-phase-forward, down and up conversion are unavoidable.

5. Performance analysis

5.1. The BER of PSPF

The BER performance of the proposed PSPF scheme with discriminator detection is evaluated using the characteristic function (CF) approach; see [15]. In the analysis, the variances of the fading processes g_AR (t), g_BR (t), g_AB (t), g_BA (t), g_RA (t), and g_RB (t) in (1) to (6) are denoted as $σ_{g_{A R}}^{2}, σ_{g_{B R}}^{2}, σ_{g_{A B}}^{2}, σ_{g_{B A}}^{2}, σ_{g_{R A}}^{2}$ , and $σ_{g_{R B}}^{2}$ , respectively, with $σ_{g_{A R}}^{2} = σ_{g_{R A}}^{2}, σ_{g_{B R}}^{2} = σ_{g_{R B}}^{2},$ and $σ_{g_{A R}}^{2} = σ_{g_{B A}}^{2}$ . On the other hand, the variances of the noise processes n_{R, 1}(t), n_{B, 1}(t), n_{R, 2}(t), n_A,2(t), n_A,3(t), and n_B,3(t) in these equations are $σ_{n_{R, 1}}^{2}, σ_{n_{B, 1}}^{2}, σ_{n_{R, 2}}^{2}, σ_{n_{B, 2}}^{2}, σ_{n_{A, 3}}^{2}$ , and $σ_{n_{B, 3}}^{2}$ , respectively, with $σ_{n_{R, 1}}^{2} = σ_{n_{B, 1}}^{2} = σ_{n_{R, 2}}^{2} = σ_{n_{B, 2}}^{2} = N_{0} B_{12}$ and $σ_{n_{A, 3}}^{2} = σ_{n_{B, 3}}^{2} = N_{0} B_{3}$ , where N₀ is the noise power spectral density (PSD), B₁₂ the bandwidth of the receive LPFs in Phases I and II, and B₃ the bandwidth of the receive LPF in Phase III. In this investigation, B₁₂ is always set to the 99% bandwidth of x_A (t) and x_B (t), while B₃ is either the same as B₁₂, or set to the 99% bandwidth of the relay signal x_R (t). Given the nature of the symbol-by-symbol detectors described in the previous section, we take the liberty to drop the symbol index k in d_{A, k} and d_{B, k} in the performance analysis.

First, it is observed that the terms D₂ in (21) is a quadratic forms of complex Gaussian variables

(y_{A, 2}, ẏ_{A, 2})

when conditioned on

{\dot{θ}}_{B}

; refer to the Appendix for the statistical relationships between different parameters in the general channel model

y (t) = g (t) e^{j θ (t)} + n (t) = a (t) e^{j ψ (t)},

where g(t) and n(t) are, respectively,

C N (0, σ_{g}^{2})

and

C N (0, σ_{n}^{2}), θ (t)

is the signal phase, and a(t) and ψ(t) are respectively the amplitude and phase of y(t). Without loss of generality, we assume d_{B, k} = +1 and hence

{\dot{θ}}_{B} (t) = π h ∕ T

. By substituting

θ = {\dot{θ}}_{B}

into (A5) and (A8), and with F in (A10) set to the

[\begin{matrix} 0 & - j \\ j & 0 \end{matrix}]

matrix in (21), we can find the two poles of the CF of D₂ as following:

p_{1} = - \frac{1}{2 α_{A, 2} β_{A, 2} (1 + ρ_{A, 2})} < 0, p_{2} = + \frac{1}{2 α_{A, 2} β_{A, 2} (1 - ρ_{A, 2})} > 0,

(28)

where α_A,2, β_A,2, ρ_A,2are determined from (A10) under the conditions $\dot{θ} = π h ∕ T, σ_{g}^{2} = σ_{g_{B A}}^{2}$ , and $σ_{n}^{2} = N_{0} B_{12}; B_{12}$ the bandwidth of the receive filter in Phases I and II.

How about the term D₃ in (21)? This term can be rewritten as

D_{3} = 2 a_{A, 3}^{2} {\dot{Ψ}}_{A, 3} = 2 (a_{A, 3}^{2} {\dot{ψ}}_{A, 3} - a_{A, 3}^{2} {\dot{θ}}_{A})

, or as

D_{3} = (y_{A, 3}^{*} ẏ_{A, 3}^{*}) (\begin{matrix} - 2 {\dot{θ}}_{A} & - j \\ j & 0 \end{matrix}) (\begin{matrix} y_{A, 3} \\ ẏ_{A, 3} \end{matrix}),

(29)

which is once again a quadratic form of complex Gaussian variables. This quadratic form, however, depends on a number of parameters. First is the data phase derivation

{\dot{θ}}_{A}

. Second, it depends on the forwarded phase derivative

{\dot{θ}}_{R} = {\dot{ψ}}_{R, 1} + {\dot{ψ}}_{R, 2}

, which in turns depends on both

{\dot{ψ}}_{R, 1}

and

{\dot{ψ}}_{R, 2}

; refer to (16). Of course,

{\dot{ψ}}_{R, 1}

depends on

{\dot{θ}}_{A}

, while

{\dot{ψ}}_{R, 2}

depends on

{\dot{θ}}_{B}

, refer to (14) and (15). Note that D₂ and D₃ are statistically independent. Conditioned on

{\dot{ψ}}_{R, 1}, {\dot{ψ}}_{R, 2}, {\dot{θ}}_{A}, {\dot{θ}}_{B} = π h ∕ T

, and

F = (\begin{matrix} - 2 {\dot{θ}}_{A} & - j \\ j & 0 \end{matrix})

, we can determine from (A10) the poles of the CF of D₃ as

\begin{gathered} Q_{1} = \frac{(χ_{A, 3}^{2} - {\dot{θ}}_{A} α_{A, 3}^{2}) - \sqrt{α_{A, 3}^{2} ({\dot{θ}}_{A}^{2} α_{A, 3}^{2} -, 2 {\dot{θ}}_{A} χ_{A, 3}^{2} + β_{A, 3}^{2})}}{2 (1 - ρ_{A, 3}^{2}) α_{A, 3}^{2} β_{A, 3}^{2}} < 0, \\ Q_{2} = \frac{(χ_{A, 3}^{2} - {\dot{θ}}_{A} α_{A, 3}^{2}) + \sqrt{α_{A, 3}^{2} ({\dot{θ}}_{A}^{2} α_{A, 3}^{2} - 2 {\dot{θ}}_{A} χ_{A, 3}^{2} + β_{A, 3}^{2})}}{2 (1 - ρ_{A, 3}^{2}) α_{A, 3}^{2} β_{A, 3}^{2}} > 0 . \end{gathered}

(30)

where $α_{A, 3}, β_{A, 3}, p_{A, 3}, χ_{A, 3}^{2}$ are determined from (A10) under the conditions $\dot{θ} = {\dot{ψ}}_{R, 1} + {\dot{ψ}}_{R, 2}$ , $σ_{g}^{2} = σ_{g_{R A}}^{2}$ , and $σ_{n}^{2} = N_{0} B_{3}$ ; B₃ the bandwidth of the receive filter in Phase III.

Recall that we assume d_B = +1 and hence ${\dot{θ}}_{B} (t) = π h ∕ T$ . In this case, the detector makes a wrong decision when D < 0. Since the characteristic function of D is $ϕ_{D} (s) = (p_{1} p_{2}) (Q_{1} Q_{2}) / {(s - p_{1}) (s - p_{2}) (s - Q_{1}) (s - Q_{2})},$

the probability that D < 0 is the sum of residues of -ϕ_D(s)/s at the right plane poles p₂ and Q₂, yielding

Pr [D < 0 | {\dot{θ}}_{A}, {\dot{θ}}_{B} = π h ∕ T, {\dot{ψ}}_{R, 1}, {\dot{ψ}}_{R, 2}] = \frac{- p_{1}}{p_{2} - p_{1}} \cdot \frac{Q_{1} Q_{2}}{(p_{2} - Q_{1}) (p_{2} - Q_{2})} + \frac{- Q_{1}}{Q_{2} - Q_{1}} \cdot \frac{p_{1} p_{2}}{(Q_{2} - p_{1}) (Q_{2} - p_{2})} .

(31)

Finally, since

{\dot{ψ}}_{R, 1}

and

{\dot{ψ}}_{R, 2}

are random variables given

{\dot{θ}}_{A}

and

{\dot{θ}}_{B}

, respectively, the unconditional error probability can be expressed in semi-analytical form as

\begin{gathered} P_{b} = \frac{1}{2} \sum_{d_{A} = - 1}^{+ 1} \int_{{\dot{ψ}}_{R, 1 = - \infty}}^{\infty} \int_{{\dot{ψ}}_{R, 2 = - \infty}}^{\infty} Pr [D < 0 | {\dot{θ}}_{A} = π h d_{A} ∕ T, {\dot{θ}}_{B} = π h ∕ T, {\dot{ψ}}_{R_{2} 1}, {\dot{ψ}}_{R_{2} 2}] \\ p ({\dot{ψ}}_{R, 1} | {\dot{θ}}_{A} = π h d_{A} ∕ T) p ({\dot{ψ}}_{R, 2} | {\dot{θ}}_{B} = π h ∕ T) d {\dot{ψ}}_{R, 1} d {\dot{ψ}}_{R, 2}, \end{gathered}

(32)

where the marginal probability density functions (PDF) $p ({\dot{ψ}}_{R, 1} | {\dot{θ}}_{A} = π h d_{A} ∕ T)$ and $p ({\dot{ψ}}_{R, 2} | {\dot{θ}}_{B} = π h ∕ T)$ can be determined from (A5) to (A6) in the Appendix.

5.2. BER of 3-DPF and A4-DPF Signals

The two multi-level DPF signals broadcasted by the relay in (11) and (12) are constructed from decisions made by the relay about Users A and B's data. Although different from (10), the exact BER analysis of these signals can still be determined via the characteristic function approach. This stems from the fact that the decision variable D of these DPF schemes are again quadratic forms of complex Gaussian variables when conditioned on the data phase derivatives

{\dot{θ}}_{A}

and

{\dot{θ}}_{B}

, as well as their decoded versions

{\dot{\hat{θ}}}_{A}

and

{\dot{\hat{θ}}}_{B}

at the relay. Specifically, the poles of the CF of D₂ are identical to those in the PSPF case, and can be found in (28). As for the poles of the CF of D₃, we should first replace the term

\dot{θ}

in the Appendix by

{\dot{θ}}_{R} = w_{A} {\dot{\hat{θ}}}_{A} + w_{B} {\dot{\hat{θ}}}_{B}

and then modify the F matrix in (A10) to

F = (\begin{array}{l} - 2 \frac{w_{A}}{w_{B}} {\dot{θ}}_{A} & \frac{- j}{w_{B}} \\ \frac{j}{w_{B}} & 0 \end{array}) .

(33)

The resultant poles are found to be

\begin{gathered} Z_{1} = \frac{(χ_{A, 3}^{2} - w_{A} {\dot{θ}}_{A} α_{A, 3}^{2}) - \sqrt{α_{A, 3}^{2} ({(w_{A} {\dot{θ}}_{A})}^{2} α_{A, 3}^{2} - 2 w_{A} {\dot{θ}}_{A} χ_{A, 3}^{2} + β_{A, 3}^{2})}}{2 (1 - ρ_{A, 3}^{2}) α_{A, 3}^{2} β_{A, 3}^{2}} . w_{B} < 0, \\ Z_{2} = \frac{(χ_{A, 3}^{2} - w_{A} {\dot{θ}}_{A} α_{A, 3}^{2}) + \sqrt{α_{A, 3}^{2} ({(w_{A} {\dot{θ}}_{A})}^{2} α_{A, 3}^{2} - 2 w_{A} {\dot{θ}}_{A} χ_{A, 3}^{2} + β_{A, 3}^{2})}}{2 (1 - ρ_{A, 3}^{2}) α_{A, 3}^{2} β_{A, 3}^{2}} . w_{B} > 0, \end{gathered}

(34)

Where

α_{A, 3}, β_{A, 3}, ρ_{A, 3}, χ_{A, 3}^{2}

are determined from (A10) under the conditions

\dot{θ} = w_{A} {\dot{\hat{θ}}}_{A} + w_{B} {\dot{\hat{θ}}}_{B}

,

σ_{g}^{2} = σ_{g_{R A}}^{2}

, and

σ_{n}^{2} = N_{0} B_{3}; B_{3}

the bandwidth of the receive filter in Phase III. As in the case of PSPF, the conditional BER is expressed in the form

Pr [D < 0 | {\dot{θ}}_{A}, {\dot{θ}}_{B} = \frac{π h}{T}, {\dot{\hat{θ}}}_{A}, {\dot{\hat{θ}}}_{B}] = \frac{- p_{1}}{p_{2} - p_{1}} \cdot \frac{z_{1} z_{2}}{(p_{2} - Z_{1}) (p_{2} - Z_{2})} + \frac{- Z_{1}}{z_{2} - Z_{1}} \cdot \frac{p_{1} p_{2}}{(Z_{2} - p_{1}) (Z_{2} - p_{2})} .

(35)

The only difference between (35) and (31) is that the former is conditioned on the hard decisions

{\dot{\hat{θ}}}_{A}

and

{\dot{\hat{θ}}}_{B}

made at the relay, while the latter is based on the soft decisions

{\dot{ψ}}_{R, 1}

and

{\dot{ψ}}_{R, 1}

. If we let P_{e, A} and P_{e, B} be the probabilities that the relay makes a wrong decision about A and B's data, respectively, then the unconditional BER is

\begin{gathered} P_{b} = \frac{1}{2 N_{w}} \sum_{d_{A} = - 1}^{+ 1} \sum_{\{w_{A}, w_{B}\}} \{(1 - P_{e, A}) (1 - P_{e, B}) Pr [D < 0 | {\dot{θ}}_{A} = π h d_{A} ∕ T, {\dot{θ}}_{B} = π h ∕ T, {\dot{\hat{θ}}}_{A} = {\dot{θ}}_{A}, {\dot{\hat{θ}}}_{B} = {\dot{θ}}_{B}] \\ + (1 - P_{e, A}) P_{e, B} Pr [D < 0 | {\dot{θ}}_{A} = π h d_{A} ∕ T, {\dot{θ}}_{B} = π h ∕ T, {\dot{\hat{θ}}}_{A} = {\dot{θ}}_{A}, {\dot{\hat{θ}}}_{B} = - {\dot{θ}}_{B}] \\ + P_{e, A} (1 - P_{e, B}) Pr [D < 0 | {\dot{θ}}_{A} = π h d_{A} ∕ T, {\dot{θ}}_{B} = π h ∕ T, {\dot{\hat{θ}}}_{A} = - {\dot{θ}}_{A}, {\dot{\hat{θ}}}_{B} = {\dot{θ}}_{B}] \\ + P_{e, A} P_{e, B} Pr [D < 0 | {\dot{θ}}_{A} = π h d_{A} ∕ T, {\dot{θ}}_{B} = π h ∕ T, {\dot{\hat{θ}}}_{A} = - {\dot{θ}}_{A}, {\dot{\hat{θ}}}_{B} = - {\dot{θ}}_{B}]\} \end{gathered}

(36)

where N_w = 1 for 3-DPF and N_w = 2 for A4-DPF, and the inner summation is over the two different permutations of w_A and w_B in (13). It should be pointed out the error probabilities P_{e, A} and P_{e, B} can be determined by integrating the marginal pdf in (A6) from -∞ to 0 when the data bit is a + 1, or from 0 to +∞ when the data bit is a -1. The end result is of the form [15, 21]

P_{e, i} = \frac{1}{2} (1 - | ρ_{i} |); i = A, B,

(37)

where |ρ_A | and |ρ_B | are |ρ| in (A5) obtained under the conditions $σ_{g}^{2} = σ_{g_{A R}}^{2}, σ_{n}^{2} = N_{0} B_{12}$ and $σ_{g}^{2} = σ_{g_{B R}}^{2}, σ_{n}^{2} = N_{0} B_{12}$ , respectively.

6. Results

We present next some numerical results for the proposed 2-way 3-phase PSPF and DPF relaying schemes. For simplicity, we only consider the case of minimum shift keying (MSK), i.e., h = 1/2, and plot the BER of the resultant cooperative communication system as a function of the SNR in the direct link between A and B. In general, the SNR of a link is defined as the fading variance $σ_{g}^{2}$ to noise variance $σ_{n}^{2}$ ratio in that link. Since the energy per transmitted bit is $E_{b} = σ_{g_{A B}}^{2} T$ and the noise variance is $σ_{n}^{2} = N_{0} B_{12} = N_{0} \times 1.1818 ∕ T$ in the direct link, where N₀ is the noise power spectral density and 1.1818/T is the 99% bandwidth of MSK, the SNR is equivalent to 0.85 E_b /N₀. Unless otherwise stated, all the links are assumed to have the same SNR and the same fade rate f_d .

Figure 2 considers the case of static fading. Figure 3 considers the case of time-selective fading with a normalized Doppler frequency of f_dT = 0.03 in all the links. To put the 2-way relaying results into perspective, we compare them against the 1-way relaying results from [15] for MSK source signal and phase-forward relay signal. The BER curves shown in these figures were obtained from the semi-analytical expression in (22) and as well as from simulation. The two sets of results are in good agreement.

Figure 2
**BER of PSPF 2-way 3-phase cooperative transmission in a static Rayleigh fading channel;** B₁₂ **= 1.1818/** T **and** B₃ **= 1.832/** T.

Figure 3
**BER of PSPF 2-way 3-phase cooperative transmission in a time-selective Rayleigh fading channel;** f_dT **= 0.03;** B₁₂ **= 1.1818/** T **and** B₃ **= 1.832/** T.

In the static fading case, it is observed from Figure 2 that 2-way relaying is consistently 3 dB less power efficient than 1-way relaying over a wide range of BER. In the 'fast' fading case, 2-way relaying has an irreducible error floor around 10^-3 while that of 1-way relaying sits at 6 × 10^-4. Above the irreducible error floors and at a BER of 10^-2, the difference between 1 and 2-way relaying is about 5 dB.

One source for the degraded performance stated above is simply energy normalization. In both figures, we assume all the nodes transmit with a bit-energy of E_b . This means 1-way relaying needs a total of 4E_b to transmit two bits while 2-way relaying needs only 3E_b to transmit the same amount of information. Therefore, if we normalize the energy, the difference between the two schemes in the static fading case actually reduces to only 1.5 dB. We regard this loss as acceptable, given that 2-way relaying improves the transmission efficiency by 33%.

The results obtained above were based on using a receive low pass filter (LPF) in the R-A path whose bandwidth, B₃, equals the 99% bandwidth of the relay signal. As mentioned earlier, because of the spectral convolution effect, the bandwidth of the relay signal is larger than that of the original MSK signal and is found to be 1.832/T. A natural question is, how would PSPF perform if the signal in the R-A path is band-limited to that of the MSK signal? Specifically, what is the tradeoff between a reduced noise figure, but an increased signal distortion because of tighter filtering?

Figure 4 shows the effect of using the same LPF in the relay path and the direct path, i.e., B₃ = B₁₂ = 1.1818/T. The simulation results show that with a narrower filter in the relay path, the proposed PSPF scheme actually achieves a better performance. We attribute this to the fact that non-coherent detection is not match filtering, and the reduction in noise level through tighter filtering more than compensates for the self interference that it generates.

Figure 4
**Effect of using the different LPF bandwidth,** B₃**, in Phase 3 of PSPF 2-way 3-phase cooperative transmission;** f_dT **= 0.03**.

In a 3-phase 2-way system, the SNRs of different links are not necessarily equal. For instance, if the relay is much closer to one of A and B, then we expect the SNR in the AR or BR link to be higher than that in the AB link. We next show in Figures 5 and 6 BER results for different asymmetric channel conditions, for both static fading and time-selective fading with a normalized fade rate of 0.03. As in Figure 4, the bandwidth of the LPF filter in the R-A path is set to that of MSK. Three different scenarios are considered--(1) all the links have the same SNR, (2) the two source-relay paths have higher SNRs, and (3) only one of the source-relay paths is stronger. Also included in Figures 5 and 6 are the BERs of MSK without diversity and with dual-receive diversity. From the figures, we can see that when the SNR in both the A-R and B-R links is 20 dB stronger than that in the A-B link, the BER curve exhibits a very prominent second order diversity effect. In contrast, when all the three links are equally strong, the diversity effect disappears (the case when only the AR link has a higher SNR than the A-B link falls in between these two cases).

Figure 5
**BER at** B **for unequal SNR under static fading; SNR**_AR, SNR_BR, and SNR_ABare the SNR's in the A-R, B-R **, and** A-B **links**.

Figure 6
**BER at** B **for unequal SNR and a fade rate of** f_dT **= 0.03; SNR**_AR, SNR_BR, and SNR_ABare the SNR's in the A-R, B-R **, and** A-B **links**.

Finally, we show in Figures 7 and 8 BER curves for the decode-and-forward based 3-DPF and A4-DPF schemes. Also included in the figures are results for the proposed PSPF scheme. The bandwidth of all the receive LPFs is set to 1.1818/T, the bandwidth of MSK. From Figure 7, we can see that the performance of PSPF is consistently 2 dB more energy efficient than the two multi-level DPF schemes when fading is static. With time-selective fading, the simulation results indicate PSPF and A4-DPF have somewhat similar performance and both are more power efficient than 3-DPF. Hence, it can be concluded that the proposed PSPF scheme not only offers a complexity advantage over multi-level DPF, it also provides a BER advantage.

Figure 7
**Performance of multi-level DPF and PSPF in static fading channel;** B₁₂ = B₃ **= 1.1818/** T.

Figure 8
**Performance of multi-level DPF and PSPF in a time-selective fading channel with an** f_dT = **0.03;** B₁₂ = B₃ **= 1.1818/** T.

7. Conclusions

We consider in this article the use of constant envelope modulation in 2-way 3-phase cooperative transmission. Specifically, a technique referred to as PSPF is proposed and its BER performance compared to 1-way relaying and to 2-way relaying based on decode-and-forward and multi-level re-modulation. As demonstrated in the paper, the proposed technique allows us to maintain constant envelope signaling throughout the signaling chain and does not require complicated signal processing at the relay like its decode-and-forward counterparts. Through analytical and simulation studies, we found that the BER of PSPF with discriminator detection in Rayleigh fading suffers only a moderate loss in energy efficiency (of 1.5 dB after energy normalization) when compared to its 1-way relaying counterpart. We consider this loss as acceptable, considering that PSPF improves the transmission efficiency by 33% and it offers a way to avoid expensive linear power amplifiers and complicated signal processing at the relay. We also found that, in comparison with its decoded and forward counterparts, the proposed PSPF scheme offers a lower BER, while at the same time relieves the relay from performing unnecessary demodulation and re-modulation tasks.

Appendix

We discuss in this Appendix the statistical properties of the faded signal

y (t) = g (t) e^{j θ (t)} + n (t) = a (t) e^{j ψ (t)},

(A1)

where g(t) and n(t) are zero-mean complex Gaussian processes with variances (per dimension) of

σ_{g}^{2}

and

σ_{n}^{2}

, respectively, θ(t) the transmitted signal phase, which is treated as a 'deterministic' parameter, and a(t) and Ψ(t), respectively, the amplitude and phase of y(t). Furthermore, the autocorrelation functions of g(t) follows a Jakes spectrum, that is

R_{g} (τ) = \frac{1}{2} E [g^{*} (t) g (t + τ)] = σ_{g}^{2} J_{0} (2 π f_{d} τ)

(A2)

where f_d is the bandwidth (Doppler frequency) of g(t). The noise term, n(t), on the other hand, is band-limited white noise with an autocorrelation function of

R_{n} (τ) = \frac{1}{2} E [n^{*} (t) n (t + τ)] = σ_{n}^{2} sinc (B τ);

(A3)

where $σ_{n}^{2} = N_{0} B, N_{0}$ being the power spectral density of n(t), and B the bandwidth of e^jθ(t).

At any time instant, the joint pdf of a, its derivative

ȧ, ψ

its derivative

\dot{ψ}

, given the data phase derivative

\dot{θ}

, is [15, 22]

\begin{gathered} p (a, ȧ, ψ, \dot{ψ} | \dot{θ}) = \frac{a^{2}}{4 π^{2} α^{2} β^{2} (1 - ρ^{2})} exp \{- \frac{ȧ^{2}}{2 β^{2} (1 - ρ^{2})}\} \\ \times exp \{- \frac{a^{2}}{2 β^{2} (1 - ρ^{2})} [{(\dot{ψ} - ρ \frac{β}{α})}^{2} + \frac{β^{2}}{α^{2}} (1 - ρ^{2})]\}, \end{gathered}

(A4)

Where

\begin{gathered} α^{2} = \frac{1}{2} E [| y (t) |^{2}] = σ_{g}^{2} + σ_{n}^{2}, β^{2} = \frac{1}{2} E [| ẏ (t) |^{2}] = σ_{g}^{2} {\dot{θ}}^{2} + λ + σ_{ṅ}^{2}, \\ λ = \frac{1}{2} E [| ġ (t) |^{2}] = 2 π^{2} f_{d}^{2} σ_{g}^{2}, σ_{ṅ}^{2} = \frac{1}{2} E [| ṅ (t) |^{2}] = π^{2} B^{2} σ_{n}^{2} ∕ 3, \\ χ^{2} = j \frac{1}{2} E [y (t) ẏ^{*} (t)] = σ_{g}^{2} \dot{θ}, ρ = χ^{2} ∕ (α β) = σ_{g}^{2} \dot{θ} ∕ (α β), \end{gathered}

(A5)

with

ġ (t), ṅ (t), ẏ (t)

being the derivatives of g(t), n(t), y(t), respectively. A useful marginal pdf of (A4) is the pdf of

\dot{ψ}

given

\dot{θ}

, which is found to be

p (\dot{ψ} | \dot{θ}) = \frac{β^{2} (1 - ρ^{2})}{2 α^{2}} {[{(\dot{ψ} - ρ \frac{β}{α})}^{2} + \frac{β^{2}}{α^{2}} (1 - ρ^{2})]}^{- 3 ∕ 2}

(A6)

Another useful property is that the random vector

r = (\begin{matrix} y \\ ẏ \end{matrix})

(A7)

is zero mean complex Gaussian with a covariance matrix of

Φ = \frac{1}{2} E [r r^{†}] = (\begin{array}{l} α^{2} & - j χ^{2} \\ j χ^{2} & β^{2} \end{array})

(A8)

Consequently, the CF of the quadratic form

D = r^{†} F r

(A9)

is

ϕ (s) = {∥I + 2 s Φ F∥}^{- 1} = \frac{p_{1} p_{2}}{(s - p_{1}) (s - p_{2})},

(A10)

where ||•|| denotes the determinant of a matrix, s the transform domain parameter, and p₁ < 0 and p₂ > 0, respectively, the left and right plane poles of the CF.

Endnotes

^aNote that in theory, we can use a higher (> K) order differentiator to improve the accuracy of the derivative estimate. However, it is unclear if this is actually beneficial in practice, given that such a differentiator inevitably involves using samples that span multiple bits and the bit transitions may actually degrade the accuracy of the derivative estimate at the decision making instants.

List of abbreviations

AF:: amplify-and-forward

ADC:: analog to digital converter

A4-DPF:: alternate 4-level decode-and-phase-forward

AWGN:: additive white Gaussian noise

BER:: bit-error-rate

CF:: characteristic function

CPFSK:: continuous-phase frequency-shift-keying

DF:: decode-and-forward

DSF:: decode-superposition-forward

3-DPF:: 3-level decode-and phase-forward

DXF:: decode-XOR-forward

LPF:: low-pass filters

MIMO:: multiple-input-multiple-output

MSK:: minimum shift keying

PSD:: power spectral density

PDF:: probability density function

PSPF:: phase-superposition-phase-forward

SQNR:: signal-to-quantization noise ratio.

Declarations

Acknowledgements

This work was supported by the Natural Sciences and Engineering Research Council (NSERC) of Canada. It was presented in parts at VTC 2010F in Ottawa, Canada, Sept 2010.

Authors' original submitted files for images

Below are the links to the authors’ original submitted files for images.

13638_2010_120_MOESM1_ESM.pdf Authors’ original file for figure 1

13638_2010_120_MOESM2_ESM.pdf Authors’ original file for figure 2

13638_2010_120_MOESM3_ESM.pdf Authors’ original file for figure 3

13638_2010_120_MOESM4_ESM.pdf Authors’ original file for figure 4

13638_2010_120_MOESM5_ESM.pdf Authors’ original file for figure 5

13638_2010_120_MOESM6_ESM.pdf Authors’ original file for figure 6

13638_2010_120_MOESM7_ESM.pdf Authors’ original file for figure 7

13638_2010_120_MOESM8_ESM.pdf Authors’ original file for figure 8

Authors’ Affiliations

(1)

School of Engineering Science, Simon Fraser University, Burnaby, British Columbia, V5A 1S6, Canada

References

Nosratinia A, Hunter TE, Hedayat A: Cooperative communication in wireless network. IEEE Commun Mag 2004, 42(10):74-80. 10.1109/MCOM.2004.1341264View ArticleGoogle Scholar
Sendonaris A, Erkip E, Aazhang B: User cooperative diversity--part I: system description. IEEE Trans Commun 2003, 51(11):1927-1938. 10.1109/TCOMM.2003.818096View ArticleGoogle Scholar
Laneman JN, Tse DNC, Wornell GW: Cooperative diversity in wireless networks: efficient protocols and outage behavior. IEEE Trans Inf Theory 2004, 50(12):3062-3080. 10.1109/TIT.2004.838089MATHMathSciNetView ArticleGoogle Scholar
Ribeiro A, Cai XD, Giannakis GB: Symbol error probabilities for general cooperative links. IEEE Trans Wireless Commun 2005, 4(3):1264-1273.View ArticleGoogle Scholar
Jing YD, Jafarkhani H: Single and multiple relay selection schemes and their achievable diversity orders. IEEE Trans Wireless Commun 2009, 8(3):1414-1423.View ArticleGoogle Scholar
Zhao Y, Adve R, Lim TJ: Improving amplify-and-forward relay networks: optimal power allocation versus selection. IEEE Trans Wireless Commun 2007, 6(8):3114-3123.Google Scholar
Nabar RU, Bolcskei H, Kneubuhler FW: Fading relay channels: performance limits and space-time signal design. IEEE J Select Areas Commun 2004, 22(6):1099-1109. 10.1109/JSAC.2004.830922View ArticleGoogle Scholar
Kim SJ, Mitran P, Tarokh V: Performance bounds for bidirectional coded cooperation protocols. IEEE Trans Inf Theory 2008, 54(11):5235-5241.MathSciNetView ArticleGoogle Scholar
Zhang XJ, Gong Y: Adaptive power allocation in two-way amplify-and-forward relay networks. IEEE ICC'09 2009.Google Scholar
Yi ZH, Kim IM: Optimum beamforming in the broadcasting phase of bidirectional cooperative communication with multiple decode-and-forward relays. IEEE Trans Wireless Commun 2009, 8(12):5806-5812.View ArticleGoogle Scholar
Zhou QF, Li YH, Lau FCM, Vucetic B: Decode-and-forward two-way relaying with network coding and opportunistic relay selection. IEEE Trans Commun 2010, 58(11):3070-3076.View ArticleGoogle Scholar
Chen M, Yener A: Power allocation for multiple access two-way relaying. In Proceedings of IEEE ICC'09. Dresden, Germany; 2009.Google Scholar
Maw RL, Martin PA, Taylor DP: Cooperative relaying with CPFSK and distributed space-time trellis codes. IEEE Commun Lett 2008, 12(5):356-358.View ArticleGoogle Scholar
Valenti MC, Torrieri D, Ferrett T: Noncoherent physical-layer network coding using binary CPFSK modulation. Millcom 2009 2009.Google Scholar
Yang Q, Ho P: Cooperative transmssion with continuous phase frequency shift keying and phase-only forward relays. In Proceedings of IEEE Globecom'09. Hawaii, USA; 2009.Google Scholar
Anderson JB, Aulin T, Sundberg C-EW: Digital Phase Modulation. Plenum, New York; 1986.View ArticleGoogle Scholar
Proakis JG: Digital Communications. 4th edition. McGraw Hill, New York; 2000.Google Scholar
Oppenheim AV, Schafer RW: Discrete-Time Signal Processing. 2nd edition. Prentice Hall, New Jersey; 1998.Google Scholar
Max J: Envelope Fluctuation in the Output of a Bandpass Limiter. IEEE Trans Commun Technol 1970, COM-18(5):597-605.View ArticleGoogle Scholar
Vaughan RG, Scott NL, White DR: The Theory of Bandpass Sampling. IEEE Trans Signal Process 1991, 39(9):1973-1984. 10.1109/78.134430View ArticleGoogle Scholar
Ho P, Kim JH: Pilot symbol-assisted detection of CPM schemes operating in fast fading channels. IEEE Trans Commun 1996, 44(3):337-347. 10.1109/26.486328View ArticleGoogle Scholar
Elnoubi SM: Analysis of GMSK with discriminator detection in mobile radio channel. IEEE Trans Veh Technol 1986, VT-35(2):71-76.View ArticleGoogle Scholar

Copyright

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.