Skip to main content
Erschienen in: Wireless Networks 3/2011

Open Access 01.04.2011

Performance of amplify-and-forward cooperative networks with differential unitary space time coding

verfasst von: Woong Cho

Erschienen in: Wireless Networks | Ausgabe 3/2011

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

In wireless communications, multi-input multi-output technology has been appreciated for its high transmission rate and diversity gain. These can also be exploited in cooperative networks by using network nodes as virtual antenna arrays. In this paper, we analyze the performance of cooperative networks with differential unitary space-time modulation under high signal-to-noise ratio. Relaying protocol is based on amplify-and-forward. The effect of relay location and energy allocation as well as the comparison with a conventional cooperative network is also addressed.

1 Introduction

Multi-input multi-output (MIMO) scheme in communication systems enhances the system performance and capacity [12]. However, a practical implementation is cumbersome due to the antenna packing constraint especially when small-sized devices are adopted. Cooperative networks provide spatial diversity gain by creating virtual antenna arrays without imposing antenna packing limitation [8]. To bypass channel state information (CSI) and reduce hardware complexity, a space time coding (STC) scheme with noncoherent modulation has been introduced to cooperative networks [7, 9, 15, 16].
In this paper, we will consider cooperative networks employing the differential unitary space time code (DUSTC) which does not require CSI both at the relay and destination nodes. The DUSTC is generated at the source node, and its amplified signal is transmitted to the destination node over a common relay-destination channel, which is referred as the amplify-and-forward (AF) relaying protocol. In the literature, differential modulations for cooperative networks have been considered in e.g., [3, 4, 17]. However, unlike the STC-based approach here, existing differential schemes use relays on an individual basis instead of using them jointly. We consider sequential transmission of STC using relay nodes with same frequency band at the source-relays and relays-destination links, which is different from the existing literature in [7, 9, 15]. Based on the DUSTC signaling scheme, the performance of cooperative networks is analyzed in the form of codeword error rate (CER) under the high signal-to-noise ratio (SNR) assumption. Resource allocation has been considered as an important research topic in cooperative networks, and it has been shown that the location of relays is critical on the error performance [2, 4, 3, 14]. In this paper, we consider the effect of relay locations in cooperative networks including energy allocation. In addition, our results are compared with the cooperative networks which send the signal with a repetitive manner, namely the conventional cooperative networks, as in [8, 4, 17].
The rest of this paper is organized as follows. The signal representation and demodulation rule are described in Sect. 2. In Sect. 3, the upper bound of CER is derived. Simulations, discussions and comparisons are presented in Sect. 4, and concluding remarks are given in Sect. 5.
Notation: We use bold upper case letters to denote matrices. \({\user2{I}}_{N}\) represents an N × N identity matrix and diag\(\{a_1,a_2,\ldots,a_N\}\) stands for a diagonal matrix with \([a_1, a_2,\ldots, a_N]\) on its diagonal. We use \((\cdot)^\mathcal{H}\) for Hermitian, \(\mathcal{C} \mathcal{N}(\mu,\sigma^2)\) for the complex Gaussian distribution with mean μ and variance \(\sigma^2, \|\cdot\|\) for Frobenius norm, and : = for “is defined as”.

2 System model

Consider a network setup with one source node sL relay nodes \(\{r_k\}_{k=1}^L\), and one destination node d, as depicted in Fig. 1. We assume that each node works in half-duplex mode. At the source node the DUSTC is generated using the diagonal design with the cyclic construction [6]. Notice that each diagonal element of the codeword has equally-spaced phases like the standard symbol-by-symbol PSK signaling with the number of phases increasing as L increases. We adopt the AF relaying protocol in which the relay nodes simply amplify the received signal from the source node and forward it to destination node.
During the first L time slots of a transmission, the diagonal entries of the DUSTC symbol block are broadcast to the relays by sequential manner. Then, the kth relay node amplifies the corresponding kth diagonal element of the STC matrix, i.e., only the corresponding diagonal element of STC matrix is amplified. At the kth relay node, the other row elements which are not corresponding to the kth diagonal element are disregarded. These amplified signals are then transmitted via a common relays-destination link during the following L time slots. Notice that the STC signal is transmitted sequentially by only considering time division. However, distributed differential schemes in [7, 9, 15] transmits signal using both time and frequency, i.e., space and time.
Denote the nth differentially encoded signal block from the source as \({\user2{X}}_{n}^{s}:={\user2{X}}_{n-1}^s {\user2{V}}^{(Q_n)}\) with \({\user2{X}}_0^s= {\user2{I}}_{L}\), where \({\user2{V}}^{(Q_n)}\) is an L × L diagonal unitary matrix, \(Q_n \in \{ 0,1, \ldots, M-1 \}\) with M = 2ηL , and \({\user2{I}}_{L}\) is an L × L identity matrix, where η represents the data rate of the original information which we set to 1. The matrix \({\user2{V}}^{(Q_n)}\) has the form \({\user2{V}}^{(Q_n)}={\user2{V}}_1^{Q_n}\) with (see [6])
$$ {\user2{V}}_1=\left( \begin{array}{ccc} e^{j(2\pi /M) u_1}\quad & 0 \quad& \ldots\quad\\ 0 \quad & \ddots\quad & 0\quad \\ 0 \quad& \ldots \quad& e^{j(2\pi /M) u_L}\quad \\ \end{array}\right), $$
(1)
where \(u_l\in\{0, \ldots, M-1\};\, l=\{1, \ldots,L\}\). Then, the nth received signal block at the relays is given by
$$ \user2{Y}^{r}_n = \sqrt{{\mathcal{E}}_s}{\user2{H}}^{r}_n \user2{X}^s_n + {\user2{Z}}^{r}_n, $$
(2)
where \(\mathcal{E}_s\) is the energy per symbol at the source, \({\user2{H}}_n^{r} := \hbox{diag} \{h^{sr_1}_n, h^{sr_2}_n,\ldots,h^{sr_L}_n \}\) is the channel matrix between the source and relays, and \({\user2{Z}}_n^{r}:= \hbox{diag} \{z^{sr_1}_n, z^{sr_2}_n, \ldots, z^{sr_L}_n\}\) is the noise matrix at the relays. Let us denote the nth transmitted signal block from the relays as \({\user2{X}}^r_n\), then the corresponding received signal block at the destination is given by
$$ {\user2{Y}}^{d}_n = {\user2{E}}^{1/2}_r{\user2{H}}^{d}_n{\user2{X}}^r_n + {\user2{Z}}^{d}_n, $$
(3)
where \({{\user2{E}}_r:=\hbox{diag}\{\mathcal{E}_{r_1},\mathcal{E}_{r_2},\ldots, \mathcal{E}_{r_L}\}}\) is the energy per symbol at the relays, \({\user2{H}}^{d}_n:= \hbox{diag}\{h_n^{r_1d}, h_n^{r_2d}\ldots,h_n^{r_Ld}\}\) is the channel matrix between the relays and destination, \({\user2{Z}}^{d}_n:=\hbox{diag} \{z_n^{r_1d}, z_n^{r_2d}, \ldots, z_n^{r_Ld}\}\) is the noise matrix at the destination, and the amplified signal block at the relays, \({\user2{X}}_n^{r}\), can be represented as
$$ {\user2{X}}^{r}_n ={\user2{A}}{\user2{Y}}^{r}_n, $$
(4)
where \({\user2{A}}:=\hbox{diag} \{A_{r_1}, A_{r_2}, \ldots, A_{r_L} \}\) is the amplification matrix with \(A_{r_k}\) being the amplification factor at the kth relay. To maintain a constant average power at each relay output, the amplification factor is given by
$$ A_{r_k}=(\sigma_{sr_k}^2{\mathcal{E}}_s+{\mathcal{N}}_0)^{-1/2},\quad k = 1,2,\ldots,L. $$
(5)
Then, using the differential modulation, the received signal block at the destination can be represented as
$$ {\user2{Y}}^{d}_n =\tilde{{\user2{H}}}_n{\user2{X}}^s_n+\tilde{{\user2{Z}}}_n^{d} ={\user2{Y}}^{d}_{n-1}{\user2{V}}_n^{(m)}+\tilde{{\user2{Z}}}_n^{\prime d}, $$
(6)
where \(\tilde{{\user2{H}}}_n=\sqrt{E_s}{\user2{E}}^{1/2}_r{\user2{A}}{\user2{H}}^{d}_n{\user2{H}}^{r}_n, \tilde{{\user2{Z}}}_n^{d}={\user2{E}}^{1/2}_r{\user2{A}}{\user2{H}}^{d}_n{\user2{Z}}^r_n+{\user2{Z}}^{d}_n\), and \(\tilde{{\user2{Z}}}_n^{\prime d}=\tilde{{\user2{Z}}}_n^{d} - \tilde{{\user2{Z}}}_{n-1}^{d}{\user2{V}}_n^{(m)}\).
Since transmission signal is based on the differential space-time code, we can apply the corresponding space-time differential demodulation. Then, the maximum likelihood (ML) differential demodulation rule [6], given \({\user2{X}}^s_n={\user2{X}}^m_n\), is
$$ \hat{Q}_n=\arg \max_{m \in \{0,1,\ldots,M-1\}} \|{\user2{Y}}^{d}_{n-1}+{\user2{Y}}^{d}_n {{\user2{V}}^{(m)}_n}^{{\mathcal{H}}} \|, $$
(7)
which represents a general decision for DUSTC.
Throughout this paper, all fading coefficients are assumed to be independent and all noise components are independent and identically distributed (i.i.d) with \(h_{n}^{ij}\sim\mathcal{C} \mathcal{N} (0,\sigma^2_{ij})\) and \(z_{n}^{ij}\sim\mathcal{C} \mathcal{N} (0,\mathcal{N}_0), i,j\in \{s,r_k,d\}\). Then, the received instantaneous signal-to-noise ratio (SNR) between the transmitter i and the receiver j is \({\gamma}_{ij}=(|h_n^{ij}|^2 \mathcal{E}_i) / \mathcal{N}_0\), and the average received SNR is \(\bar{\gamma}_{ij}=(\sigma_{{ij}}^{2} \mathcal{E}_i)/ \mathcal{N}_0\).

3 Performance analysis

In this section, we will analyze the error performance of the cooperative system employing the DUSTC. Under high SNR assumption, the upper bound of CER, P e , will be derived using the proposed scheme. The CER can be found by calculating the pairwise CER between the source and destination. Let us first consider the covariance matrix of the aggregate noise \(\tilde{{\user2{Z}}}_n^{\prime d}\) in Eq. 6, which bears the form \(\hbox{diag} \{\sigma^2_{h_{1,eff}},\sigma^2_{h_{2,eff}},\ldots,\sigma^2_{h_{L,eff}}\}\), where the corresponding kth diagonal entry of the covariance matrix is given by
$$ \sigma_{h_{k,eff}}^2= 2 {\mathcal{N}}_0 ({\mathcal{E}}_{r_k}A_{r_k}^2 \sigma_{r_kd}^2 + 1), \quad k=1,2, \ldots, L. $$
(8)
To normalize the aggregate noise variance, let us define the matrix \({\user2{G}}:= \hbox{diag}\{g_1, g_2,\ldots, g_L\}\) with \(g_k=(\mathcal{E}_{r_k}A_{r_k}^2 \sigma_{r_kd}^2+ 1)^{-1/2}\). Then, by multiplying \({\user2{G}}\) with the received signal block at the destination, we can rewrite Eq. 6 as
$$ {\user2{Y}}^{d}_n{\user2{G}} ={\user2{Y}}^{d}_{n-1}{\user2{V}}_n^{(m)}{\user2{G}}+\tilde{{\user2{Z}}}_n^{\prime d}{\user2{G}}, $$
(9)
or equivalently, we have
$$ \tilde{{\user2{Y}}}^{d}_n ={\user2{Y}}^{d}_{n-1}\tilde{{\user2{V}}}_n^{(m)}+\tilde{{\user2{Z}}}_n, $$
(10)
where \(\tilde{{\user2{Y}}}^{d}_n={\user2{Y}}^{d}_n{\user2{G}}, \tilde{{\user2{V}}}^{(m)}_n={\user2{V}}^{(m)}_n{\user2{G}}\), and \(\tilde{{\user2{Z}}}_n=\tilde{{\user2{Z}}}^{\prime d}_n{\user2{G}}\). Then, the conditional CER can be calculated using Eq. 10, which is given by
$$ \begin{aligned} P[\tilde{{\user2{V}}}_n \rightarrow \tilde{{\user2{V}}}^{\prime}_n|{\user2{Y}}_{n-1}] &= Q \left( \sqrt{ D_c^2(\tilde{{\user2{V}}}_n, \tilde{{\user2{V}}}^{\prime}_n) / 4 {\mathcal{N}}_0 } \right) \\ &\leq \exp \left[ - D_c^2(\tilde{{\user2{V}}}_n, \tilde{{\user2{V}}}^{\prime}_n) / 8 {\mathcal{N}}_0\right], \end{aligned} $$
(11)
where \({D_c^2(\tilde{{\user2{V}}}_n, \tilde{{\user2{V}}}^{\prime}_n) =\hbox{tr}\{ {\user2{Y}}_{n-1}({\user2{V}}_ {n}-{\user2{V}}^{\prime}_{n}){\user2{G}}{\user2{G}}^{\mathcal{H}}({\user2{V}}_{n}-{\user2{V}}^{\prime}_{n})^{\mathcal{H}} {\user2{Y}}_{n-1}^{\mathcal{H}} \}}\). Using the relationship \({\user2{Y}}^{d}_n \approx \tilde{{\user2{H}}}_n{\user2{X}}^s_n\) at high SNR (c.f. Eq. 6), the code distance can be approximated as
$$ D_c^2(\tilde{{\user2{V}}}_n, \tilde{{\user2{V}}}^{\prime}_n) \approx \hbox{tr}\{ ({\user2{H}}^{d}_{n} {\user2{H}}^{r}_{n})\Updelta_e({\user2{H}}^{d}_{n} {\user2{H}}^{r}_{n})^{{\mathcal{H}}} \}, $$
(12)
where \({\Updelta_e= \mathcal{E}_s{\user2{E}}^{1/2}_r{\user2{X}}_{n-1} ({\user2{V}}_n-{\user2{V}}^{\prime}_n)({\user2{A}}{\user2{G}}) ({\user2{A}}{\user2{G}})^{\mathcal{H}}({\user2{V}}_n- {\user2{V}}^{\prime}_n)^{\mathcal{H}}{\user2{X}}_{n-1}^{\mathcal{H}} {\user2{E}}^{1/2}_r}\). Since \(\Updelta_e\) is Hermitian, we can perform the following decomposition: \({\Updelta_e= {{\user2{U}}^{\prime}}^{\mathcal{H}}{\user2{D}}_e{\user2{U}}^{\prime}}\), where \({\user2{U}}^{\prime}\) is a unitary matrix, and \({\user2{D}}_e\) is \(\hbox{diag}\{\lambda_{e,1},\lambda_{e,2},\ldots,\lambda_{e,L}\}\). Each diagonal entry \(\lambda_{e,k}, k=1,2,\ldots,L\), represents an eigenvalue of \({\user2{D}}_e\). Then, the CER can be obtained by averaging Eq. 11 with respect to channel realizations \({\user2{H}}^{d}_{n} {\user2{H}}^{r}_{n}\). Let us define \(h:=h^{r_kd}h^{sr_k}\), then the probability density function (PDF) of α = |h| is given by [10]
$$ p_{\alpha}(\alpha)=\frac{4\alpha}{\sigma^2_{r_kd}\sigma^2_{sr_k}} K_0\left(2\sqrt{\frac{\alpha^2} {\sigma^2_{r_kd}\sigma^2_{sr_k}}}\right), $$
(13)
where \(K_0(\cdot)\) is the zeroth order modified Bessel function of the second kind. By assuming each fading coefficient has unit variance, the CER can be computed by using the integration property of Bessel functions [5, Eq. 6.631.3] and follows:
$$ \int_{0}^{\infty}x^\theta e^{-\alpha x^2}K_{\phi}(\beta x)dx\\ =\frac{1}{2}\alpha^{-\frac{1}{2}\theta}\beta^{-1} \Upgamma\left(\frac{1+\theta+\phi}{2}\right) \times \Upgamma\left(\frac{1-\phi+\theta}{2}\right)e^{\frac{\beta^2}{8\alpha}} W_{-\frac{\theta}{2},\frac{\phi}{2}}\left(\frac{\beta^2} {4\alpha}\right),\\ $$
(14)
where \(W_{m,n}(z)=e^{-z/2}z^{n+1/2}U(1/2+n-m,1+2n,z)\) is the Whittaker function with \(U(\cdot,\cdot,\cdot)\) denoting confluent hypergeometric function of the second kind. By further using the approximation \(U(a,1,1/x)\approx \hbox{ln}(x)/\Upgamma(a)\) [1, Eqs. 13.5.9] at high SNR, the CER can be simplified to
$$ P_{e}=P[\tilde{{\user2{V}}}_n \rightarrow \tilde{{\user2{V}}}^{\prime}_n]\leq \prod _{k=1} ^{L} \left[\ln\left(\frac{\lambda_{e,k}}{8 {\mathcal{N}}_0}\right)\right]\left(\frac{\lambda_{e,k}}{8 {\mathcal{N}}_0}\right)^{-1}. $$
(15)
It is worth mentioning that the CER of cooperative networks is very reminiscent of its counterpart, namely the multi-input single-output (MISO) system with co-located mutiple transmit antennas employing the DUSTC (see e.g., [13]). Their difference lies in the log term which reflects the effect of the amplification and the aggregate noise. However, this log term only leads to a coding gain loss. In fact, Eq. (15) also confirms that cooperative networks provide full diversity gain proportional to the number of relays L.

4 Simulations and discussions

In this section, we present the numerical examples and simulation results for the cooperative networks with DUSTC. We first consider CER of the system, and then the effects of relay location and comparison with the conventional system will be discussed.

4.1 CER performance

In Fig. 2, we plot the bounds and simulated CERs for the proposed systems when \(L = 1, 2, \hbox{and } 3\). When L = 1, the STC-based cooperative system reduces to the conventional cooperative network, thus we can use the SER formulas derived in [4] as the CER bound of the cooperative scheme in this paper. Figure 2 shows that the bounds (Eq. 15) are tight at high SNR. However, the bounds are less accurate when SNR is low because of the log term in the analytical expression. It is also evident from Fig. 2 that the proposed scheme provides full diversity gain, which shows the same trend as the per-relay differential modulation with AF protocol in [4].
Let us consider the effect of unbalanced link quality. We assume that \(\bar{\gamma}_{sr_k}=\bar{\gamma}_{sr}\), and \(\bar{\gamma}_{r_kd}=\bar{\gamma}_{rd}, \forall k\), and consider (1) equal SNR for both the source-relays and relays-destination links, (2) higher SNR is assigned at the source-relays links, and (3) higher SNR is assigned at the relays-destination links with L = 1,2 and 3. Figure 3 reveals that the coding gain can be achieved by assigning higher SNR at both links. Increasing SNR at the source-relays and relays-destination links leads to decrement of aggregate noise effect and increment SNR at the destination, respectively. Notice that the effect of SNR at the relays-destination links provides more coding gain than the source-relays links, which implies that the relays-destination links is more critical than the source-relays links to obtain better performance.

4.2 Effect of relay locations

In this subsection, we consider the effect of relay locations. We make use of the relationship between the variance of channel fading coefficient σ ij 2 and the inter-node distance D ij as follows:
$$ \sigma_{ij}^2= C \cdot D_{ij}^{-\nu}, \quad i,j \in \{s,r_k,d\}\;, $$
(16)
where C is a constant and ν is the path loss exponent of the wireless channel. Without loss of generality, we set C to 1, and line topology is considered,i.e., \(D_{sr_k}+D_{r_kd}=D_{sd}=1\). To express the energy constraint by SNR, let us define the total SNR \(\rho_T:=\mathcal{E}/\mathcal{N}_0\), the transmit SNR at the source node \(\rho_s:=\mathcal{E}_s/\mathcal{N}_0\), and the transmit SNR at the relay nodes \(\rho_{r_k}:=\mathcal{E}_{r_k}/\mathcal{N}_0\), where we use the total energy constraint as \(\rho_T=\rho_{s}+\sum_{k=1}^{L}\rho_{r_k}\).
In Fig. 4, we show the CER depending on various relay locations with L = 2, and its corresponding contour is depicted in Fig. 5. We also plot the CER for L = 3 with various locations in Fig. 6. We set ν = 4, ρ j  = 10dB, j ∈ {sr k }, k = 1, 2 and 3. In Figs. 4 and 5, x axis represents the location of relay node 1 and y axis represents the location of relay node 2. The figures show that the relay located at the same position has the minimum CER for the given one relay’s location. Figure 5 reveals that the minimum CER is obtained both relays’ are located at the midpoint between the source node and destination node with L = 2. By letting (abc) as the location of relay node 1, 2, and 3, the CER with L = 3 is depicted in Fig. 6. In general, the relay located at the midpoint (0.5 in Fig. 6) enhances the error performance. Whereas, the relay located near the destination node (0.8 in Fig. 6) induces degradation of error performance, which results in the degradation of overall error performance. Similar to the L = 2, the system with co-located relays has better performance than the system with different relay locations. Therefore, it is good choice to select co-located relay nodes to achieve better performance. The minimum CER is obtained when all relay nodes are located at the midpoint between the source node and destination node, i.e., (0.5, 0.5, 0.5) location.

4.3 Effect of energy allocation

In this subsection, the performance of the proposed system is analyzed depending on the energy (power) allocation. We consider L = 2 and assume that each relay node has the same energy, i.e., \(\rho_{r_1}=\rho_{r_2}=\rho_r\). The line setup, D sd  = 1, is considered by locating both relay nodes at the midpoint between the source and destination node since the midpoint provides minimum error rate as we mentioned Sect. 4.2. Figure 7 depicts the CER depending on various energy allocations at the source node and relay nodes. Regardless of energy allocation, the performance has no big difference when each relay node has low energy. However, in high SNR, the equally distributed energy allocation shows minimum CER. This result is the same as the AF cooperative networks with coherent scheme in [11]. Therefore, the optimum energy allocation which minimizes the error performance is closely related to the relaying protocol not the transmission scheme such as coherent and non-coherent transmission. Based on the results of this section and Sect. 4.2, the minimum error rate can be obtained by locating relay nodes at the midpoint between the source node and destination node and assigning equal energy.

4.4 Comparison with the conventional system

It is worth noting the differences between our schemes and the conventional cooperative networks. For the conventional system as in [8, 4, 17], the signal is transmitted by repetitive manner. Specifically, during the first time slot, the source broadcasts the information symbol to the relays, and then the L relays forward their amplified information to the destination using distinct channels at the relays-destination links. If the original information symbols of both the STC-based and conventional cooperative networks are equi-probable binary signal (η = 1 in this paper), the STC-based system uses 2L time slots for L symbols transmission; whereas the conventional system uses (L + 1) time slots for 1 symbol transmission. Hence, the STC-based system can provide higher data rate especially when L > 1. This implies that the STC-based system can potentially provide the differential benefit as well as high transmission rate regardless of the number of relays. On the other hand, conventional system also can support higher data rate by increasing modulation size of the data symbol, but this causes error performance loss. To capture this phenomenon, we compare the bit error rate (BER) of the conventional system which adopts the same modulation size with the STC-based system in Fig. 8, i.e., use DQPSK, D8PSK, and D16PSK for L = 2, 3, and 4, respectively, for the conventional system. Notice that the performance is compared using BER not CER. For BER comparison, we convert CER of the DUSTC system to BER. Then, the data rate of each modulation is L/(L + 1) bps, whereas the data rate of STC-based system is 1/2 bps regardless of L. The figure shows that STC-based system performs comparably with or better than the conventional system especially when \(L\geq3\). For the conventional system, the error performance decreases as L increases. However, for the STC-based system, the BER is not affected dramatically regardless of L, and the diversity gain is always guaranteed.

5 Conclusions

In this paper, we explored the performance of cooperative networks employing the differential unitary space time code (DUSTC) with amplify-and-forward (AF) protocol. Based on the DUSTC-based transmission scheme, the codeword error rate (CER) bound was analyzed under high SNR assumption. Our analysis and simulations showed that: (1) AF protocol provides full diversity gain; (2) co-located relay selection is good choice to achieve good error performance; and (3) the minimum CER can be obtained by locating relay nodes at the midpoint between the source node and destination node and by distributing the energy equally in each node. The comparison with conventional cooperative networks revealed that STC-based cooperative networks can support higher data rate by providing comparative error performance compared with the conventional system.

Acknowledgments

This work is in part supported by the IT R&D program of MKE/IITA [2007-F-039-01, Vehicle Multi-hop Communication Technology Development]. Part of the results in this paper was presented at IEEE Conference on Acoustics, Speech and Signal Processing, Las Vegas, Nevada, 2008.

Open Access

This article is distributed under the terms of the Creative Commons Attribution Noncommercial License which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
Open AccessThis is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://​creativecommons.​org/​licenses/​by-nc/​2.​0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
Literatur
1.
Zurück zum Zitat Abramowitz, M., & Stegun, I. A. (1972). Handbook of mathematical functions with formulas, graphs, and mathematical tables. Dover: New York. Abramowitz, M., & Stegun, I. A. (1972). Handbook of mathematical functions with formulas, graphs, and mathematical tables. Dover: New York.
2.
Zurück zum Zitat Cao, R., & Yang, L. (2008). Practical issues in resource optimization of relay networks. In Proceedings of CISS. Cao, R., & Yang, L. (2008). Practical issues in resource optimization of relay networks. In Proceedings of CISS.
3.
Zurück zum Zitat Cho, W., & Yang, L. (2008). Optimum resource allocation for relay networks with differential modulation. IEEE Transactions on Communications, 56(4), 531–534.CrossRefMathSciNet Cho, W., & Yang, L. (2008). Optimum resource allocation for relay networks with differential modulation. IEEE Transactions on Communications, 56(4), 531–534.CrossRefMathSciNet
4.
Zurück zum Zitat Cho, W., Cao, R., & Yang, L. (2008). Optimum resource allocation for amplify-and-forward relay networks with differential modulation. IEEE Transactions on Signal Processing, 56(11), 5680–5691.CrossRefMathSciNet Cho, W., Cao, R., & Yang, L. (2008). Optimum resource allocation for amplify-and-forward relay networks with differential modulation. IEEE Transactions on Signal Processing, 56(11), 5680–5691.CrossRefMathSciNet
5.
Zurück zum Zitat Gradshteyn, I. S., & Ryzhik, I. M. (2000). Table of integradls, series, and products (6th ed.). New York: Academic Press. Gradshteyn, I. S., & Ryzhik, I. M. (2000). Table of integradls, series, and products (6th ed.). New York: Academic Press.
6.
Zurück zum Zitat Hochwald, B. M., & Sweldens, W. (2000). Differential unitary space-time modulation. IEEE Transactions on Communications, 48(12), 2041–2052.CrossRef Hochwald, B. M., & Sweldens, W. (2000). Differential unitary space-time modulation. IEEE Transactions on Communications, 48(12), 2041–2052.CrossRef
7.
Zurück zum Zitat Jing, Y., & Jafarhani, H. (2008). Distributed space-time coding for wireless relay network. IEEE Transactions on Communications, 56(7), 1192–1100.CrossRef Jing, Y., & Jafarhani, H. (2008). Distributed space-time coding for wireless relay network. IEEE Transactions on Communications, 56(7), 1192–1100.CrossRef
8.
Zurück zum Zitat Laneman, J. N., & Wornell, G. W. (2000). Energy-efficient antenna sharing and relaying for wireless networks. In Proceedings of wireless communications and networking conference (Vol. 1, pp. 7–12). Laneman, J. N., & Wornell, G. W. (2000). Energy-efficient antenna sharing and relaying for wireless networks. In Proceedings of wireless communications and networking conference (Vol. 1, pp. 7–12).
9.
Zurück zum Zitat Oggier, F., & Hassibi, B. (2007). A coding scheme for wireless networks with multiple antenna nodes and no channel information. In Proceedings of international conference on acoustics, speech and signal processing (Vol. 3, pp. 413–416). Oggier, F., & Hassibi, B. (2007). A coding scheme for wireless networks with multiple antenna nodes and no channel information. In Proceedings of international conference on acoustics, speech and signal processing (Vol. 3, pp. 413–416).
10.
Zurück zum Zitat Patel, C. S., Stüber, G. L., & Pratt, T. G. (2006). Statistical properties of amplify and forward relay fading channel. IEEE Transactions on Vehicular Technology, 55(1), 1–9.CrossRef Patel, C. S., Stüber, G. L., & Pratt, T. G. (2006). Statistical properties of amplify and forward relay fading channel. IEEE Transactions on Vehicular Technology, 55(1), 1–9.CrossRef
11.
Zurück zum Zitat Ribeiro, A., Cai, X., & Giannakis, G. B. (2005). Symbol error probabilities for general cooperative links. IEEE Transactions on Wireless Communications, 4(3), 1264–1273.CrossRef Ribeiro, A., Cai, X., & Giannakis, G. B. (2005). Symbol error probabilities for general cooperative links. IEEE Transactions on Wireless Communications, 4(3), 1264–1273.CrossRef
12.
Zurück zum Zitat Tarokh, V., Seshadri, N., & Calderbank, A. R. (1998). Space-time codes for high data rate wireless communication: Performance criterion and code construction. IEEE Transactions on Information Theory, 44(2), 744–765.CrossRefMATHMathSciNet Tarokh, V., Seshadri, N., & Calderbank, A. R. (1998). Space-time codes for high data rate wireless communication: Performance criterion and code construction. IEEE Transactions on Information Theory, 44(2), 744–765.CrossRefMATHMathSciNet
13.
Zurück zum Zitat Yiu, S., Schober, R., & Lampe, L. (2006). Distributed space-time blcok coding. IEEE Transactions on Communications, 54(7), 1195–1206CrossRef Yiu, S., Schober, R., & Lampe, L. (2006). Distributed space-time blcok coding. IEEE Transactions on Communications, 54(7), 1195–1206CrossRef
14.
Zurück zum Zitat Yu, M., Li, J., & Sadjadpour, H. (2005). Amplify-forward and decode-forward: The impact of location and capacity contour. In Proceedings of MILCOM (Vol. 3, pp. 1609–1615). Yu, M., Li, J., & Sadjadpour, H. (2005). Amplify-forward and decode-forward: The impact of location and capacity contour. In Proceedings of MILCOM (Vol. 3, pp. 1609–1615).
15.
Zurück zum Zitat Wang, G., Zhang, Y., & Amin, M. (2006). Differential distributed space-time modulation for cooperative networks. IEEE Transactions on Wireless Communications, 5(11), 3097–3180.CrossRef Wang, G., Zhang, Y., & Amin, M. (2006). Differential distributed space-time modulation for cooperative networks. IEEE Transactions on Wireless Communications, 5(11), 3097–3180.CrossRef
16.
Zurück zum Zitat Wang, T., Yao, Y., & Giannakis, G. B. (2006). Non-coherent distributed space-time processing for multiuser cooperative transmissions. IEEE Transactions on Wireless Communications, 5(12), 3339–3343.CrossRef Wang, T., Yao, Y., & Giannakis, G. B. (2006). Non-coherent distributed space-time processing for multiuser cooperative transmissions. IEEE Transactions on Wireless Communications, 5(12), 3339–3343.CrossRef
17.
Zurück zum Zitat Zhao, Q., & Li, H. (2007). Differential modulation for cooperative wireless systems. IEEE Transactions on Signal Processing, 55(5), 2273–2283.CrossRef Zhao, Q., & Li, H. (2007). Differential modulation for cooperative wireless systems. IEEE Transactions on Signal Processing, 55(5), 2273–2283.CrossRef
Metadaten
Titel
Performance of amplify-and-forward cooperative networks with differential unitary space time coding
verfasst von
Woong Cho
Publikationsdatum
01.04.2011
Verlag
Springer US
Erschienen in
Wireless Networks / Ausgabe 3/2011
Print ISSN: 1022-0038
Elektronische ISSN: 1572-8196
DOI
https://doi.org/10.1007/s11276-010-0301-z

Weitere Artikel der Ausgabe 3/2011

Wireless Networks 3/2011 Zur Ausgabe

Neuer Inhalt