Skip to main content

Improved signal detection for two-way wireless relaying networks under imperfect time synchronisation

Abstract

Most research on two-way wireless relaying networks (TWRNs) assumes perfect time synchronisation between the terminals and among the relays. This is, however, difficult to accomplish as the terminals and relays are randomly located. The lack of synchronisation causes inter-symbol interference which introduces a serious impairment and negatively impacts the network’s performance. In this article, an enhanced interference cancellation (EIC)-based detector is proposed to mitigate the experienced performance degradation while maintaining low complexity. It uses an innovative iterative approach and also benefits of interference components of currently detected symbols using a modified maximum likelihood (ML) scheme. As a result, it shows significant performance improvement compared to the conventional detector under different conditions of imperfect synchronisation. In addition, two existing interference cancellation detectors that are originally proposed for one-way WRNs are extended to TWRNs, even though the timing error among the terminals is a unique issue for TWRNs and never occurs in one-way networks. Unlike the existing literature, the proposed detectors apply to networks with an arbitrary number of multiple-antenna relays. Numerical simulation is provided in terms of bit error rate, to show the improvement in performance when compared to the conventional detector. Moreover, it is shown that the EIC detector outperforms the extended detectors and provides 3 to 4 dB gain under moderate condition of imperfect synchronisation.

1 Introduction

Recently, various data and voice services have been incorporated over modern wireless communication networks, such as the Internet, video calling and gaming. These networks are required to provide both high speed and quality services to gain consumer satisfaction. The use of multiple-antenna nodes in communications is a known technology to increase capacity and improve reliability, especially when compared with single-antenna node networks. This is known as multiple-input multiple-output (MIMO) technology. This is, however, infeasible in some applications due to the size, cost and environmental constraints [1]. The potential spatial diversity that arises from the presence of multiple distributed nodes in a network can be exploited if suitable cooperation is arranged among these nodes [2]. This creates a virtual MIMO network. In [3], the use of a distributed space-time block code (D-STBC) is suggested to exploit the spatial diversity effectively and hence improve the link reliability significantly. In addition, the D-STBCs increase the spectrum efficiency of the network due to the allowance of simultaneous transmission from relays. However, this network is still limited by half-duplex constraints. In other words, to exchange a data packet between the connection terminals, four time slots are required. In contrast, two-way wireless relaying networks (TWRNs) have been proposed to halve this number of required time slots. This is experienced as the terminals are allowed to transmit simultaneously too [4]. Due to the promising bandwidth efficiency, the TWRN has drawn much interest in the literature [59]. However, in most pioneering research, a perfect timing synchronisation between the terminals’ signal in the first phase of transmission as well as among the relays in the next phase of transmission is assumed. Unfortunately, this assumption is unrealistic or at the very least it imposes conditions that will be difficult or even impossible to achieve in a real-world network [10, 11]. Consequently, this makes the channel appears dispersive, and hence, the structure of the code matrix is compromised [11, 12]. This introduces a serious impairment and negatively impacts the network performance due to the rising inter-symbol interference (ISI).

1.1 Prior work

Unlike one-way WRNs, two forms of imperfect timing synchronisation exist in TWRNs. This is due to the dispersed nature of both the terminals and relays. So, this different timing error is introduced between the received signals of terminals at the relays and among the received signals of relays at the terminals too. In [13], the authors consider the timing error among the terminals and conclude that a significant performance degradation is introduced but no mitigation strategy is offered. In [14], a preamble structure is proposed for efficient synchronisation among the terminals only. A delay-tolerant distributed space-time trellis code is proposed to conserve high performance even under imperfect synchronisation in [15]. However, this code functions in the binary field, meaning it cannot be employed in amplify-and-forward (AF) TWRNs. In [1618], robust schemes against the relaying timing error are proposed. They use a sufficient cyclic prefix and/or performing physical-layer network coding. These schemes may involve much higher complexity and introduce a significant control overhead. In addition, the inter-block interference among the relays is not considered. In one-way WRNs, a number of low-complexity methods have been proposed, notably parallel interference cancellation (PIC) and successive interference cancellation (SIC) [11, 12]. Although the timing error among the terminals is a unique issue for TWRNs and never occurs in one-way networks, these methods can be extended to TWRNs.

1.2 Our contribution

In summary and with respect to the current literature, our contributions are threefold:

  • A mathematical model is derived under a condition of imperfect synchronisation for TWRNs with N R a -antenna relays, where N, R a N + . Also, it can be used to evaluate a model for either orthogonal or quasi-orthogonal linear dispersion STBCs.

  • An enhanced interference cancellation (EIC)-based detector is proposed for asynchronous TWRNs to mitigate the experienced performance degradation. It conducts the interference cancellation process in an innovative iterative approach. It orders the cancellation process according to the estimated reliability of the available detected symbols. Unlike [11, 12], this detector shows higher performance, particularly in the first iteration, as it reduces the reliance on low-performance symbols. Moreover, the EIC benefits from interference components of currently detected symbols using a modified maximum likelihood (ML) scheme.

  • Both PIC- and SIC-based one-way detectors are extended to work in TWRNs. They show a significant performance improvement compared to the conventional detectors.

1.3 Notations

In the rest of the paper, non-bold letters, bold lower-case letters and bold capital letters will designate scalars, vectors and matrices, respectively. For matrices A, AH, A and AT denote the hermitian, the conjugate and the transpose of A, respectively. Ψ1(A,a,b) denotes the result of shifting down each b row of A by a rows individually with zero padding. Similarly, Ψ2(A,a,b) denotes the result of shifting A as with Ψ1(A,a,b) but in an upward direction. For a vector v, v ̄ = [ ( v ) T , I ( v ) T ] T , where (.) and I(.) indicate the real and imaginary part, respectively. The operator is the Kronecker product. A Gaussian distribution is denoted by CN(μ, Γ 2 ), with corresponding mean μ and diagonal covariance matrix Γ2 with value σ2.

2 Network model under a condition of imperfect synchronisation

A TWRN consist of two terminals T 1 and T 2 that exchange data through N relay nodes: R n n=1N is considered, see Figure 1. The terminals are single-antenna nodes while the relays are equipped each with R a , R a N + . The relays use linear dispersion STBC and employ an AF relaying protocol. The transmission through the network is conducted in two phases: in the first phase, the information is broadcast from the terminals to the relays simultaneously. In the second phase, each relay amplifies an encoded version of its received symbols and then forwards it to the terminals. The total transmission power for the entire network is denoted by P and is evenly divided between both phases and nodes. The channel through the network is assumed to be a quasi-static Rayleigh fading channel. Like most TWRNs, it is assumed that the channel coefficients remain constant for 2J consecutive channel uses, where J is the number of symbols exchanged each transmission through the network [46]. The relays are assumed to be completely blind while perfect channel-state information (CSI) is assumed only at the terminals.

Figure 1
figure 1

Two-way wireless relaying network (TWRN) model.

Due to the factors such as different timing and different propagation delays, the accurate synchronisation that is assumed among relays and between the terminals is difficult to achieve [10]. Here, the TWRN is generally modelled under a condition of imperfect synchronisation. Then, three instances of the general modelled are evaluated for the following networks: (1) two dual-antenna relays using the novel quasi-orthogonal STBC (QO-STBC) of [5]; (2) two single-antenna relays using the orthogonal Alamouit’s STBC of [19]; and (3) four single-antenna relays using the QO-STBC of [20]. These models are used later to examine the effectiveness of the proposed detectors.

2.1 General network model

As mentioned, the transmission through TWRNs is conducted in two phases.

Broadcasting phase (phase 1): the terminals transmit simultaneously their M-ary PSK-/QAM-modulated symbols that are denoted by x(i)=[x(i,1),..,x(i,j),..,x(i,J)]T and y(i)=[y(i,1),..,y(i,j),..,y(i,J)]T, where i denotes the information block index and J is the number of symbols of each terminal in the broadcasting phase. Due to the different timing and propagation delays, the transmitting symbols arrive to the relays with a different delay: τ n . Similar to [11, 12], a condition of τ n [0,0.5T] is assumed, where T is the symbol signalling period. Thus, the received vector at R n can be expressed by

r n ( i ) ( R a × J ) × 1 = P 2 G n ( 0 ) ( R a × J ) × J x ( i ) J × 1 + P 2 H n ( 0 ) ( R a × J ) × J y ( i ) J × 1 + q n ( i ) ( R a × J ) × 1 + v n ( i ) ( R a × J ) × 1 ,
(1)

with

q n ( i ) = P 1 g n ( 1 ) Qx ( i ) + Nx ( i - 1 ) + P 2 h n ( 1 ) Qy ( i ) + Ny ( i - 1 ) ,
(2)

where P1 and P2 are the power dedicated for the broadcasting phase for T 1 and T 2 , respectively.

Q J × J = 0 1 × ( J - 1 ) 0 I J - 1 0 ( J - 1 ) × 1 and N J × J = 0 1 × ( J - 1 ) 1 0 ( J - 1 ) × ( J - 1 ) 0 ( J - 1 ) × 1 .

G n (0) = I J g n (0), H n (0) = I J h n (0).Both g n (0)= [ g n , 1 ( 0 ) , , g n , R a ( 0 ) ] T and h n (0)= [ h n , 1 ( 0 ) , , h n , R a ( 0 ) ] T are the current time slot channel coefficient vectors for the T 1 -and- R n and T 2 -and- R n links, respectively; g n (ν) and h n (ν) for ν=1,…, represent the composite effects of time delay and the pulse shaping waveform (PSW) for the mentioned links. As they are much less dominant, both g n (ν) and g n (ν) for ν=2,…, can be truncated [12]. The strength of g n (1) or h n (1) can be represented by (3). It is worth noting that regardless of which PSW is used, α n =0 for τ n =0, and α n =1(0 dB) for τ n =0.5T, due to the symmetry of the PSW.

α n = | | g n ( 1 ) | | 2 | | g n ( 0 ) | | 2 .
(3)

Assuming an availability of full-duplex terminals, a direct transmission (DT) link between the terminals exists. This case is not common in TWRNs, and hence, it is considered as an optional case. The DT links are modelled by

r DT , 1 ( i ) J × 1 = P 2 f y J × 1 (i)+ δ 1 J × 1 (i),
(4)

and

r DT , 2 J × 1 (i)= P 1 f x J × 1 (i)+ δ 2 J × 1 (i),
(5)

where f (f(0,1)) is the channel coefficient for the link between T 1 and T 2 . The vector δ k , δ k (0,1), is the noise vector at T k . The detection result of the DT links, denoted later by x ̂ DT (i) and y ̂ DT (i), can be carried through a conventional ML detector [11, 20].

Relaying phase (phase 2): according to the used code, each relay combines the received symbol vector into a new transmitting symbols R a ×J vector t n (i) using

t n ( i , j ) R a × 1 = β A n ( j ) R a × ( R a × J ) r n ( i ) ( R a × J ) × 1 + B n ( j ) R a × ( R a × J ) r n ( i ) ( R a × J ) × 1 , j = 1 , , J ,
(6)

where A n ( j ) and B n ( j ) are the encoding matrices that are used by R n to construct its corresponding part of the employed code in a distributive manner. β is the power amplification gain that is used to normalise the average power per antenna of each relay to be p r . These resulting symbols are then forwarded simultaneously from all participating relays to the terminals. Again, interference terms due to the imperfect time synchronisation among relays arise at the terminals (see Figure 2).

Figure 2
figure 2

The relays’ signal at T 1 under imperfect synchronisation.

Due to the similarity, only the received signal at T 1 is considered, which is expressed as

z 1 ( i ) J × 1 = P 1 β A g ( 0 ) G ( 0 ) C 1 x ( i ) + B g ( 0 ) G ( 0 ) D 1 x ( i ) + P 2 β A g ( 0 ) H ( 0 ) C 2 y ( i ) + B g ( 0 ) H ( 0 ) D 2 y ( i ) + q T 1 ( i ) + ζ 1 ( i ) ,
(7)

where

A g ( 0 ) J × ( J × N × R a ) = g 1 T ( 0 ) A 1 ( 1 ) g 2 T ( 0 ) A 2 ( 1 ) g N T ( 0 ) A N ( 1 ) g 1 T ( 0 ) A 1 ( 2 ) g 2 T ( 0 ) A 2 ( 2 ) g N T ( 0 ) A N ( 2 ) g 1 T ( 0 ) A 1 ( J ) g 2 T ( 0 ) A 2 ( J ) g N T ( 0 ) A N ( J ) , B g ( 0 ) J × ( J × N × R a ) = g 1 T ( 0 ) B 1 ( 1 ) g 2 T ( 0 ) B 2 ( 1 ) g N T ( 0 ) B N ( 1 ) g 1 T ( 0 ) B 1 ( 2 ) g 2 T ( 0 ) B 2 ( 2 ) g N T ( 0 ) B N ( 2 ) g 1 T ( 0 ) B 1 ( J ) g 2 T ( 0 ) B 2 ( J ) g N T ( 0 ) B N ( J ) ,

G(0)= G 1 T ( 0 ) , , G N T ( 0 ) T , and H(0)= H 1 T ( 0 ) , , H N T ( 0 ) T . The noise terms at T 1 can be modelled equivalently as

ζ 1 J × 1 = β A g ( 0 ) + Ψ 1 ( A ̂ g ( 1 ) , 1 , J ) v + B g ( 0 ) + Ψ 1 ( B ̂ g ( 1 ) , 1 , J ) v + η 1 ,
(8)

where v= v 1 T , , v N T T and η 1 CN(0,1). Both Ag(1) and Bg(1) are formed using g n (1) instead of g n (0) as follows:

A g ( 1 ) J × ( J × N × R a ) = g 1 T ( 1 ) A 1 ( 1 ) g 2 T ( 1 ) A 2 ( 1 ) g N T ( 1 ) A N ( 1 ) g 1 T ( 1 ) A 1 ( 2 ) g 2 T ( 1 ) A 2 ( 2 ) g N T ( 1 ) A N ( 2 ) g 1 T ( 1 ) A 1 ( J ) g 2 T ( 1 ) A 2 ( J ) g N T ( 1 ) A N ( J ) , B g ( 1 ) J × ( J × N × R a ) = g 1 T ( 1 ) B 1 ( 1 ) g 2 T ( 1 ) B 2 ( 1 ) g N T ( 1 ) B N ( 1 ) g 1 T ( 1 ) B 1 ( 2 ) g 2 T ( 1 ) B 2 ( 2 ) g N T ( 1 ) B N ( 2 ) g 1 T ( 1 ) B 1 ( J ) g 2 T ( 1 ) B 2 ( J ) g N T ( 1 ) B N ( J ) .

All interference terms received at T 1 that resulted due to the imperfect synchronisation in the two phases of transmission can be model as

q T 1 (i)= q 0 , x (i)+ q 1 , x (i)+ q 0 , y (i)+ q 1 , y (i),
(9)

with

q 0 , x ( i ) = P 1 β A g ( 0 ) Ψ 1 ( G ( 1 ) , R a , R a J ) + Ψ 1 ( A g ( 1 ) , 1 , J ) × G ( 0 ) + Ψ 1 ( G ( 1 ) , R a , R a J ) x ( i ) + B g ( 0 ) Ψ 1 ( G ( 1 ) , R a , R a J ) + Ψ 1 ( B g ( 1 ) , 1 , J ) × G ( 0 ) + Ψ 1 ( G ( 1 ) , R a , R a J ) x ( i ) ,
(10)
q 1 , x ( i ) = P 1 β A g ( 0 ) Ψ 2 ( G ( 1 ) , R a ( J - 1 ) , R a J ) + Ψ 2 ( A g ( 1 ) , J - 1 , J ) G ( 0 ) x ( i - 1 ) + B g ( 0 ) Ψ 2 ( G ( 1 ) , R a ( J - 1 ) , R a J ) + Ψ 2 ( B g ( 1 ) , J - 1 , J ) G ( 0 ) x ( i - 1 ) + Ψ 2 ( A g ( 1 ) , J - 1 , J ) Ψ 2 ( G ( 1 ) , R a ( J - 1 ) , R a J ) x ( i - 2 ) + Ψ 2 ( B g ( 1 ) , J - 1 , J ) Ψ 2 ( G ( 1 ) , R a ( J - 1 ) , R a J ) x ( i - 2 ) ,
(11)
q 0 , y ( i ) = P 2 β A g ( 0 ) Ψ 1 ( H ( 1 ) , R a , R a J ) + Ψ 1 ( A g ( 1 ) , 1 , J ) H ( 0 ) + Ψ 1 ( H ( 1 ) , R a , R a J ) C 3 y i + B g ( 0 ) Ψ 1 ( H ( 1 ) , R a , R a J ) + Ψ 1 ( B g ( 1 ) , 1 , J ) H ( 0 ) + Ψ 1 ( H ( 1 ) , R a , R a J ) D 3 y i ,
(12)

and

q 1 , y ( i ) = P 2 β A g ( 0 ) Ψ 2 ( H ( 1 ) , R a ( J - 1 ) , R a J ) + Ψ 2 ( A g ( 1 ) , J - 1 , J ) H ( 0 ) y ( i - 1 ) + B g ( 0 ) Ψ 2 ( H ( 1 ) , R a ( J - 1 ) , R a J ) + Ψ 2 ( B g ( 1 ) , J - 1 , J ) H ( 0 ) y ( i - 1 ) + Ψ 2 ( A g ( 1 ) , J - 1 , J ) Ψ 2 ( H ( 1 ) , R a ( J - 1 ) , R a J ) y ( i - 2 ) + Ψ 2 ( B g ( 1 ) , J - 1 , J ) Ψ 2 ( H ( 1 ) , R a ( J - 1 ) , R a J ) y ( i - 2 ) ,
(13)

where G(1)= G 1 T ( 1 ) , , G N T ( 1 ) T ,H(1)= H 1 T ( 1 ) , , H N T ( 1 ) T , G n (1)=I J g n (1), and H n (1)=I J h n (1). With some algebraic manipulations, Equation 7 can be rearranged and rewritten for detection as

z ̄ 1 ( i ) 2 J × 1 = P 1 β G G x ̄ ( i ) 2 J × 1 + P 2 β G H y ̄ ( i ) 2 J × 1 + G q y ̄ ( i ) 2 J × 1 + q ̄ 1 , y ( i ) 2 J × 1 + q ̄ 0 , x ( i ) 2 J × 1 + q ̄ 1 , x ( i ) 2 J × 1 + ζ ̄ 1 ( i ) 2 J × 1 ,
(14)

where

G G 2 J × 2 J = ( C 1 + D 1 ) I ( - C 1 + D 1 ) I ( C 1 + D 1 ) ( C 1 - D 1 ) ,
(15)
G H 2 J × 2 J = ( C 2 + D 2 ) I ( - C 2 + D 2 ) I ( C 2 + D 2 ) ( C 2 - D 2 ) ,
(16)

and

G q 2 J × 2 J = ( C 3 + D 3 ) I ( - C 3 + D 3 ) I ( C 3 + D 3 ) ( C 3 - D 3 ) .
(17)

It is worth noting that the interference term q0,y(i) is written in terms of transmitting symbols in (17) as the proposed detector requires it to be in this form.

2.2 Two dual-antenna relay TWRNs using QO-STBC

In [5], a novel class of D-QO-STBC is proposed for TWRNs with a number N of dual-antenna relays. This code class is promising as it can achieve the maximum coding gain and the optimal diversity gain while maintaining low decoding complexity. For TWRNs employing the mentioned codes, the general network model is evaluated under imperfect synchronisation, meaning that R a =2 and N=2. The encoding matrices used by this network are shown above the Equation 18 of [5]. The data exchanged is x(i)=[x(i,1),…,x(i,4)]T and y(i)=[y(i,1),…,y(i,4)]T. The instance model can be represented as

C 1 = g 1 T ( 0 ) g 1 ( 0 ) 0 g 2 T ( 0 ) g 2 ( 0 ) 0 0 g 1 T ( 0 ) g 1 ( 0 ) 0 g 2 T ( 0 ) g 2 ( 0 ) g 2 T ( 0 ) g 2 ( 0 ) 0 g 1 T ( 0 ) g 1 ( 0 ) 0 0 g 2 T ( 0 ) g 2 ( 0 ) 0 g 1 T ( 0 ) g 1 ( 0 ) , D 1 = 0 g 1 T ( 0 ) J g 1 ( 0 ) 0 g 2 T ( 0 ) J g 2 ( 0 ) g 1 H ( 0 ) J g 1 ( 0 ) 0 g 2 H ( 0 ) J g 2 ( 0 ) 0 0 g 2 T ( 0 ) J g 2 ( 0 ) 0 g 1 T ( 0 ) J g 1 ( 0 ) g 2 H ( 0 ) J g 2 ( 0 ) 0 g 1 H ( 0 ) J g 1 ( 0 ) 0 ,
(18)
C 2 = g 1 T ( 0 ) h 1 ( 0 ) 0 g 2 T ( 0 ) h 2 ( 0 ) 0 0 g 1 T ( 0 ) h 1 ( 0 ) 0 g 2 T ( 0 ) h 2 ( 0 ) g 2 T ( 0 ) h 2 ( 0 ) 0 g 1 T ( 0 ) h 1 ( 0 ) 0 0 g 2 T ( 0 ) h 2 ( 0 ) 0 g 1 T ( 0 ) h 1 ( 0 ) , D 2 = 0 g 1 T ( 0 ) J h 1 ( 0 ) 0 g 2 T ( 0 ) J h 2 ( 0 ) h 1 H ( 0 ) J g 1 ( 0 ) 0 h 2 H ( 0 ) J g 2 ( 0 ) 0 0 g 2 T ( 0 ) J h 2 ( 0 ) 0 g 1 T ( 0 ) J h 1 ( 0 ) h 2 H ( 0 ) J g 2 ( 0 ) 0 h 1 H ( 0 ) J g 1 ( 0 ) 0 ,
(19)

and

C 3 = 0 g 2 T ( 0 ) h 2 ( 1 ) 0 0 ( g 1 T ( 0 ) h 1 ( 1 ) + g 1 T ( 1 ) h 1 ( 0 ) ) g 2 T ( 1 ) h 2 ( 1 ) ( g 2 T ( 0 ) h 2 ( 1 ) + g 2 T ( 1 ) h 2 ( 0 ) ) 0 g 1 T ( 1 ) h 1 ( 1 ) ( g 1 T ( 0 ) h 1 ( 1 ) + g 1 T ( 1 ) h 1 ( 0 ) ) g 2 T ( 1 ) h 2 ( 1 ) g 2 T ( 1 ) h 2 ( 0 ) ( g 2 T ( 0 ) h 2 ( 1 ) + g 2 T ( 1 ) h 2 ( 0 ) ) g 1 T ( 1 ) h 1 ( 1 ) ( g 1 T ( 0 ) h 1 ( 1 ) + g 1 T ( 1 ) h 1 ( 0 ) ) 0 , D 3 = g 1 T ( 0 ) J h 1 ( 1 ) 0 g 2 T ( 0 ) J h 2 ( 1 ) 0 g 1 T ( 1 ) J h 1 ( 1 ) ( g 1 T ( 1 ) J h 1 ( 0 ) - g 2 T ( 0 ) J h 2 ( 1 ) ) g 2 T ( 1 ) J h 2 ( 1 ) g 2 T ( 1 ) J h 2 ( 0 ) ( h 1 H ( 0 ) J g 1 ( 1 ) + g 2 T ( 0 ) J h 2 ( 1 ) ) h 2 H ( 1 ) J g 2 ( 1 ) ( g 1 T ( 0 ) J h 1 ( 1 ) - g 2 T ( 1 ) J h 2 ( 0 ) ) 0 g 2 T ( 1 ) J h 2 ( 1 ) ( h 1 H ( 1 ) J g 1 ( 0 ) + g 2 T ( 1 ) J h 2 ( 0 ) ) g 1 T ( 1 ) J h 1 ( 1 ) g 1 T ( 1 ) J h 1 ( 0 ) ,
(20)

where J= 0 1 - 1 0 . The values of q1,x,q1,y and q0,x are given by

q 1 , x 4 × 1 ( i ) = ( 2 g 1 T ( 0 ) g 1 ( 0 ) x ( i - 1 , 4 ) + g 2 T ( 0 ) g 2 ( 1 ) x ( i - 1 , 2 ) - g 1 T ( 1 ) J g 1 ( 0 ) x ( i - 1 , 3 ) - g 2 T ( 1 ) J g 2 ( 0 ) x ( i - 1 , 1 ) - g 2 T ( 1 ) J g 2 ( 1 ) x ( i - 2 , 4 ) ) - g 1 T ( 0 ) J g 1 ( 1 ) x ( i - 1 , 4 ) g 2 T ( 0 ) g 2 ( 1 ) x ( i - 1 , 4 ) - g 2 T ( 0 ) J g 2 ( 1 ) x ( i - 1 , 4 ) ,
(21)
q 1 , y 4 × 1 ( i ) = ( g 2 T ( 1 ) h 2 ( 0 ) x ( i - 1 , 2 ) - g 1 T ( 1 ) J h 1 ( 0 ) x ( i - 1 , 3 ) - g 2 T ( 1 ) J h 2 ( 0 ) x ( i - 1 , 1 ) - g 2 T ( 1 ) J h 2 ( 1 ) x ( i - 2 , 4 ) + ( g 2 T ( 0 ) h 1 ( 1 ) + g 1 T ( 0 ) h 1 ( 1 ) ) x ( i - 1 , 4 ) ) - g 1 T ( 0 ) J h 1 ( 1 ) x ( i - 1 , 4 ) g 2 T ( 0 ) h 2 ( 1 ) x ( i - 1 , 4 ) - g 2 T ( 0 ) J h 2 ( 1 ) x ( i - 1 , 4 ) ,
(22)

and q0,x(i)=[q0,x(i,1),q0,x(i,2),q0,x(i,3),q0,x(i,4)]T, respectively, where

q 0 , x ( i , 1 ) = g 2 T ( 0 ) g 1 ( 1 ) x ( i , 2 ) + g 1 T ( 0 ) J g 1 ( 1 ) x ( i , 1 ) + g 2 T ( 0 ) J g 2 ( 1 ) x ( i , 3 ) ,
(23)
q 0 , x ( i , 2 ) = 2 g 1 T ( 0 ) g 1 ( 1 ) x ( i , 1 ) + 2 g 2 T ( 0 ) g 2 ( 1 ) x ( i , 3 ) + g 2 T ( 1 ) J g 2 ( 0 ) x ( i , 4 ) + g 1 T ( 1 ) J g 1 ( 1 ) x ( i , 1 ) + g 2 T ( 1 ) J g 2 ( 1 ) x ( i , 3 ) + g 2 T ( 1 ) g 2 ( 1 ) x ( i , 2 ) + ( g 1 T ( 1 ) J g 1 ( 0 ) - g 2 T ( 0 ) J g 2 ( 1 ) ) x ( i , 2 ) ,
(24)
q 0 , x ( i , 3 ) = 2 g 1 T ( 0 ) g 1 ( 1 ) x ( i , 2 ) + g 2 T ( 0 ) g 2 ( 1 ) x ( i , 4 ) - g 2 T ( 1 ) J g 2 ( 1 ) x ( i , 2 ) + g 1 T ( 1 ) g 1 ( 1 ) x ( i , 1 ) + g 2 T ( 1 ) g 2 ( 1 ) x ( i , 3 ) - ( g 1 T ( 1 ) J g 1 ( 0 ) - g 2 T ( 0 ) J g 2 ( 1 ) ) x ( i , 2 ) + ( g 1 T ( 0 ) J g 1 ( 1 ) - g 2 T ( 1 ) J g 2 ( 0 ) ) x ( i , 3 ) ,
(25)

and

q 0 , x ( i , 4 ) = 2 g 1 T ( 0 ) g 1 ( 1 ) x ( i , 3 ) + 2 g 2 T ( 0 ) g 2 ( 1 ) x ( i , 1 ) + g 1 T ( 1 ) J g 1 ( 0 ) x ( i , 4 ) + g 1 T ( 1 ) J g 1 ( 1 ) x ( i , 3 ) + g 2 T ( 1 ) J g 2 ( 1 ) x ( i , 1 ) + g 1 T ( 1 ) g 1 ( 1 ) x ( i , 2 ) - ( g 1 T ( 0 ) J g 1 ( 1 ) - g 2 T ( 1 ) J g 2 ( 0 ) ) x ( i , 2 ) .
(26)

2.3 Two-relay TWRNs using Alamouti’s STBC

Another instance is shown here for a case of two single-antenna relay TWRNs, meaning that R a =1 and N=2. This network uses Alamouti’s STBC that is proposed in [19]. The encoding matrices used by these relays in this network are shown in [20]. This is an orthogonal STBC and full-rate code. The data exchanged through the network is x(i)=[x(i,1),x(i,2)]T and y(i)=[y(i,1),y(i,2)]T. The instance model can be represented as

C 1 = g 1 2 ( 0 ) 0 0 g 1 2 ( 0 ) , D 1 = 0 - | g 2 | 2 ( 0 ) | g 2 | 2 ( 0 ) 0 ,
(27)
C 2 = g 1 ( 0 ) h 1 ( 0 ) 0 0 g 1 ( 0 ) h 1 ( 0 ) , D 2 = 0 - g 2 ( 0 ) h 2 ( 0 ) g 2 ( 0 ) h 2 ( 0 ) 0 ,
(28)

and

C 3 = 0 0 g 1 ( 0 ) h 1 ( 1 ) + g 1 ( 1 ) h 1 ( 0 ) 0 , D 3 = - g 2 ( 0 ) h 2 ( 1 ) 0 - g 2 ( 1 ) h 2 ( 1 ) - g 2 ( 1 ) h 2 ( 0 ) .
(29)

The values of q1,x,q1,y and q0,x are given by

q 1 , x 2 × 1 (i)= ( | g 2 ( 1 ) | 2 x ( i - 2 , 2 ) + g 2 ( 1 ) g 2 ( 0 ) x ( i - 1 , 1 ) + 2 g 1 ( 0 ) g 1 ( 1 ) x ( i - 1 , 2 ) ) g 2 ( 0 ) g 2 ( 1 ) x ( i - 1 , 2 ) ,
(30)
q 1 , y 2 × 1 (i)= ( ( g 1 ( 0 ) h 1 ( 1 ) + g 1 ( 1 ) h 1 ( 0 ) ) x ( i - 1 , 2 ) + g 2 ( 1 ) h 2 ( 0 ) x ( i - 1 , 1 ) + g 2 ( 1 ) h 2 ( 1 ) x ( i - 2 , 2 ) ) g 2 ( 0 ) h 2 ( 1 ) x ( i - 1 , 2 ) ,
(31)

and

q 0 , x 2 × 1 (i)= - g 2 ( 0 ) g 2 ( 1 ) x ( i , 1 ) ( 2 g 1 ( 0 ) g 1 ( 1 ) x ( i , 1 ) - g 2 ( 1 ) g 2 ( 0 ) x ( i , 2 ) - | g 2 ( 1 ) | 2 x ( i , 1 ) ) .
(32)

2.4 Four-relay TWRNs using QO-STBC

A TWRN with four single-antenna relays that use QO-STBC from [20] is evaluated, meaning that R a =1, N=4 and J=4. This network along with the encoding matrices is shown in [9]. The instance model can be represented as

C 1 = g 1 2 ( 0 ) 0 0 g 4 2 ( 0 ) 0 g 1 2 ( 0 ) - g 4 2 ( 0 ) 0 0 - g 4 2 ( 0 ) g 1 2 ( 0 ) 0 g 4 2 ( 0 ) 0 0 g 1 2 ( 0 ) , D 1 = 0 - | g 2 ( 0 ) | 2 - | g 3 ( 0 ) | 2 0 | g 2 ( 0 ) | 2 0 0 - | g 3 ( 0 ) | 2 | g 3 ( 0 ) | 2 0 0 - | g 2 ( 0 ) | 2 0 | g 3 ( 0 ) | 2 | g 2 ( 0 ) | 2 0 ,
(33)
C 2 = g 1 ( 0 ) h 1 ( 0 ) 0 0 g 4 ( 0 ) h 4 ( 0 ) 0 g 1 ( 0 ) h 1 ( 0 ) - g 4 ( 0 ) h 4 ( 0 ) 0 0 - g 4 ( 0 ) h 4 ( 0 ) g 1 ( 0 ) h 1 ( 0 ) 0 g 4 ( 0 ) h 4 ( 0 ) 0 0 g 1 ( 0 ) h 1 ( 0 ) , D 2 = 0 - g 2 ( 0 ) h 2 ( 0 ) - g 3 ( 0 ) h 3 ( 0 ) 0 g 2 ( 0 ) h 2 ( 0 ) 0 0 - g 3 ( 0 ) h 3 ( 0 ) g 3 ( 0 ) h 3 ( 0 ) 0 0 - g 2 ( 0 ) h 2 ( 0 ) 0 g 3 ( 0 ) h 3 ( 0 ) g 2 ( 0 ) h 2 ( 0 ) 0 ,
(34)

and

The values of q1,x,q1,y and q0,x are given by

q 1 , x ( i ) = ( g 4 2 ( 1 ) x ( i - 2 , 4 ) + g 4 ( 0 ) g 4 ( 1 ) x ( i - 1 , 1 ) + g 2 ( 1 ) g 2 ( 0 ) x ( i - 1 , 3 ) + g 3 ( 1 ) g 3 ( 0 ) x ( i - 1 , 2 ) + 2 g 1 ( 0 ) g 1 ( 1 ) x ( i - 1 , 4 ) ) g 2 ( 0 ) g 2 ( 1 ) x ( i - 1 , 4 ) g 3 ( 0 ) g 3 ( 1 ) x ( i - 1 , 4 ) g 4 ( 0 ) g 4 ( 1 ) x ( i - 1 , 4 ) ,
(36)
q 1 , y ( i ) = ( ( g 1 ( 0 ) h 1 ( 1 ) + g 1 ( 1 ) h 1 ( 0 ) ) x ( i - 1 , 4 ) + g 2 ( 1 ) h 2 ( 0 ) x ( i - 1 , 3 ) + g 3 ( 1 ) h 3 ( 0 ) x ( i - 1 , 2 ) + g 4 ( 1 ) h 4 ( 0 ) x ( i - 1 , 1 ) + g 4 ( 1 ) h 4 ( 1 ) x ( i - 2 , 4 ) ) g 2 ( 0 ) h 2 ( 1 ) x ( i - 1 , 4 ) g 3 ( 0 ) h 3 ( 1 ) x ( i - 1 , 4 ) g 4 ( 0 ) h 4 ( 1 ) x ( i - 1 , 4 ) ,
(37)

and q0,x(i)=[q0,x(i,1),q0,x(i,2),q0,x(i,3),q0,x(i,4)]T, respectively, where

q 0 , x ( i , 1 ) = g 4 ( 0 ) g 4 ( 1 ) x ( i , 3 ) - g 3 ( 0 ) g 3 ( 1 ) x ( i , 2 ) - g 2 ( 0 ) g 2 ( 1 ) x ( i , 1 ) ,
(38)
q 0 , x ( i , 2 ) = - | g 2 ( 1 ) | 2 x ( i , 1 ) - ( | g 3 ( 1 ) | 2 + g 2 ( 1 ) g 2 ( 0 ) ) x ( i , 2 ) - ( g 3 ( 0 ) g 3 ( 1 ) + g 3 ( 1 ) g 3 ( 0 ) ) x ( i , 3 ) + g 4 2 ( 1 ) x ( i , 3 ) + 2 g 1 ( 0 ) g 1 ( 1 ) x ( i , 1 ) - g 4 ( 0 ) g 4 ( 1 ) x ( i , 2 ) + g 4 ( 0 ) g 4 ( 1 ) x ( i , 4 ) ,
(39)
q 0 , x ( i , 3 ) = - g 4 2 ( 1 ) + 2 g 1 ( 0 ) g 1 ( 1 ) x ( i , 2 ) - g 4 ( 0 ) g 4 ( 1 ) - g 1 2 ( 1 ) × x ( i , 1 ) + g 2 ( 1 ) g 2 ( 0 ) x ( i , 1 ) - ( g 2 ( 0 ) g 2 ( 1 ) + g 3 ( 1 ) g 3 ( 1 ) ) x ( i , 3 ) - g 3 ( 1 ) g 3 ( 0 ) x ( i , 4 ) - g 4 ( 0 ) g 4 ( 1 ) x ( i , 3 ) ,
(40)

and

q 0 , x ( i , 4 ) = g 3 ( 0 ) g 3 ( 1 ) + g 3 ( 1 ) g 3 ( 0 ) x ( i , 1 ) - g 4 ( 0 ) g 4 ( 1 ) - g 1 2 ( 1 ) × x ( i , 2 ) + g 2 ( 0 ) g 2 ( 1 ) x ( i , 2 ) - g 4 2 ( 1 ) x ( i , 1 ) - | g 2 ( 1 ) | 2 x ( i , 3 ) - g 2 ( 1 ) g 2 ( 0 ) x ( i , 4 ) + 2 g 1 ( 0 ) g 1 ( 1 ) x ( i , 3 ) .
(41)

3 Detection methods

In this section, the conventional detector is outlined, and then, the two existing detectors of [11, 12] are extended for TWRNs. In addition, an enhanced detector is proposed. Its performance outperforms that of the extended detectors.

3.1 Conventional detector

  • Self-interference cancellation:

    z ̄ ~ 1 (i)= z ̄ 1 (i)- P 1 β G G x ̄ (i).
    (42)
  • Equalisation process: obtain the equalised vector u1 by

    u 1 ( i ) = G H H z ̄ ~ 1 ( i ) = P 2 β y ̄ ( i ) + P 2 β y ̄ + G H H ( q ̄ 1 , y + q ̄ 0 , x + q ̄ 1 , x ) + G H H ζ ̄ 1 ,
    (43)

    where = G H H G H and = G H H G q .

  • Group decoding: assuming a code with L decoding groups, the decoding can be carried through (if the used code is fully orthogonal, then L=J, see [20]),

    y ̂ l (i)= argmin y l S ( J / L ) × 1 || d l (i)- l y ̄ l | 2 },l=1,,L,
    (44)

    where y ̂ l is the vector contained the estimation result of symbol group l. Both d l and l are the corresponding elements of the group l of the u1 and, respectively. For example, for a code of Section 2.2 that has J=4, L=2, its indices are s1=[1,3] and s2=[2,4] for the first group and second group, respectively. Accordingly, y ̂ (i)= [ y ̂ 1 ( i , 1 ) , y ̂ 2 ( i , 1 ) , y ̂ 1 ( i , 2 ) , y ̂ 2 ( i , 2 ) ] T ,

    d 1 ( i ) = u 1 ( i , 1 ) u 1 ( i , 3 ) + 1 i u 1 ( i , 5 ) u 1 ( i , 7 ) , d 2 ( i ) = u 1 ( i , 2 ) u 1 ( i , 4 ) + 1 i u 1 ( i , 6 ) u 1 ( i , 8 ) ,
    1 = h 11 h 12 h 13 h 14 h 31 h 32 h 33 h 34 h 51 h 52 h 53 h 54 h 71 h 72 h 73 h 74 , 2 = h 21 h 22 h 23 h 24 h 41 h 42 h 43 h 44 h 61 h 62 h 53 h 64 h 81 h 82 h 83 h 84

as for this code is modelled as

= h 11 0 h 12 0 h 13 0 h 14 0 0 h 21 0 h 22 0 h 23 0 h 24 h 31 0 h 32 0 h 33 0 h 34 0 0 h 41 0 h 42 0 h 43 0 h 44 h 51 0 h 52 0 h 53 0 h 54 0 0 h 61 0 h 62 0 h 63 0 h 64 h 71 0 h 72 0 h 73 0 h 74 0 0 h 81 0 h 82 0 h 83 0 h 84 .

Due to the interference components in (43), the designed code matrix is compromised. Unless an interference cancellation is used, a significant performance degradation is introduced.

3.2 Existing IC detectors

As mentioned, the PIC- and SIC-based detectors are proposed for one-way WRNs [11, 12]. Here, these detectors are extended for TWRNs. Unlike one-way networks, the interference that arises due to the imperfect synchronisation in TWRNs originates from two sources and is introduced in the two phases of transmission. The terms, from the current processing terminals, are known to the terminal, and hence, both q0,x(i) and q1,x(i) can be eliminated completely. In addition, if the transmission has been initialised properly, q1,y(i) can be cancelled as well. This can be conducted through the modified version of the self-interference cancellation step of Section 3.1 as

  • Self-interference cancellation:

    z ̄ ~ 1 0 = z ̄ ~ 1 - q ̄ 0 , x - q ̄ 1 , x - q ̄ 1 , y = P 2 β G H y ̄ + q ̄ 0 , y + ζ ̄ 1 .
    (45)

Most IC detectors differ in how they deal with the current-block interference term (q0,y). However, they are all reliant on initialisation of the interference cancellation process by the DT detected symbols and feeding of the results into a new iteration of the cancellation and decoding process [12]. In addition to the mentioned difference between the one-way and two-way networks, the DT link is not commonly feasible in the TWRNs as it requires full-duplex terminals.

3.2.1 Extended PIC-based detector

Here, the PIC-based detector of [12] proposed for one-way WRNs is extended for TWRNs to combat the performance degradation due to the imperfect synchronisation. In [21], the PIC-based detector is used for TWRNs with only two relays that employ Alamouti’s orthogonal STBC code. In contrast, the PIC-based detector is extended here for the TWRN with N R a -antenna relays and can employ either an orthogonal or quasi-orthogonal STBC. The extended PIC can be conducted through

3.2.2 Extended SIC-based detector

In [11], a SIC-based detector is proposed to combat the performance degradation in one-way WRNs due to the imperfect synchronisation. This detector is designed for a network with four relays that employ the decode-and-forward relaying protocol and the orthogonal STBC codes. It was shown that the SIC-based detector proposed converges faster than the existing PIC ones due to the successive behaviour of the interference cancellation process. In [8], a SIC-based detector is designed for TWRNs that employ Alamouti’s orthogonal STBC. Similar to the former section, the SIC-based detector is extended for TWRNs with an arbitrary number of relays and can either use orthogonal STBC or quasi-orthogonal STBCs.

3.3 Proposed detector

The idea behind the new detector is firstly explained, and then, its steps are designed. Unlike the existing detectors, the proposed detector tries to cancel the terms that must be eliminated and tries to benefit from the other terms in an innovative manner. Therefore, the achieved performance is enhanced as the reliance on the first low-performance conventional detection result is reduced. The enhancements are particularly clear in the first iteration of the detection process.

The explanation is conducted for the network shown in Section 2.2. Rewriting (45) for illustration purposes as

z ̄ ~ 1 0 (i)= P 2 β G H y ̄ (i)+ P 2 β G q y ̄ (i)+ ζ ̄ 1 (i),
(46)

and assuming that the second, fourth, sixth and eighth columns of G q are zeros, then the equalisation process u 1 (i)= G H H z ̄ ~ 1 0 (i) leads to (ignoring non-important terms):

u 1 ( i ) = h 11 0 h 12 0 h 13 0 h 14 0 0 h 21 0 h 22 0 h 23 0 h 24 h 31 0 h 32 0 h 33 0 h 34 0 0 h 41 0 h 42 0 h 43 0 h 44 h 51 0 h 52 0 h 53 0 h 54 0 0 h 61 0 h 62 0 h 63 0 h 64 h 71 0 h 72 0 h 73 0 h 74 0 0 h 81 0 h 82 0 h 83 0 h 84 y ̄ ( i ) + b 11 1 0 b 12 1 0 b 13 1 0 b 14 1 0 b 21 1 0 b 22 1 0 b 23 1 0 b 24 1 0 b 31 1 0 b 32 1 0 b 33 1 0 b 34 1 0 b 41 1 0 b 42 1 0 b 43 1 0 b 44 1 0 b 51 1 0 b 52 1 0 b 53 1 0 b 54 1 0 b 61 1 0 b 62 1 0 b 63 1 0 b 64 1 0 b 71 1 0 b 72 1 0 b 73 1 0 b 74 1 0 b 81 1 0 b 82 1 0 b 83 1 0 b 84 1 0 y ̄ ( i )
(47)

Notice that all of the first, third, fifth and seventh time slots of u1(i) are independent of y(i,2) and y(i,4). Therefore, the first group of symbols (y1(i)=[y(i,1), y(i,3)]T) can be detected independently through these mentioned slots of u1(i), denoted as u1,1(i). Similarly, the equalisation process provides

u 1 ( i ) = h 11 0 h 12 0 h 13 0 h 14 0 0 h 21 0 h 22 0 h 23 0 h 24 h 31 0 h 32 0 h 33 0 h 34 0 0 h 41 0 h 42 0 h 43 0 h 44 h 51 0 h 52 0 h 53 0 h 54 0 0 h 61 0 h 62 0 h 63 0 h 64 h 71 0 h 72 0 h 73 0 h 74 0 0 h 81 0 h 82 0 h 83 0 h 84 y ̄ ( i ) + 0 b 11 2 0 b 12 2 0 b 13 2 0 b 14 2 0 b 21 2 0 b 22 2 0 b 23 2 0 b 24 2 0 b 31 2 0 b 32 2 0 b 33 2 0 b 34 2 0 b 41 2 0 b 42 2 0 b 43 2 0 b 44 2 0 b 51 2 0 b 52 2 0 b 53 2 0 b 54 2 0 b 61 2 0 b 62 2 0 b 63 2 0 b 64 2 0 b 71 2 0 b 72 2 0 b 73 2 0 b 74 2 0 b 81 2 0 b 82 2 0 b 83 2 0 b 84 2 y ̄ ( i )
(48)

if the first, third, fifth and seventh columns of G q are zeros. This leads to the second group of symbols (y2(i)=[y(i,2), y(i,4)]T) which can be detected independently through second, fourth, sixth and eighth time slots of u1(i), denoted as u1,2(i).

Assuming that the mentioned assumptions hold, the detection can be carried out for the two groups of symbol using

y ̂ l (i)= argmin y l S | u ̄ 1 , l - l y ̄ l + l y ̄ l | 2 ,
(49)

where = G H H G H and = G H H G q . l and l are the matrices that contained the corresponding elements of the group l from and, respectively. For example, for (46):

1 (i)= h 11 h 12 h 13 h 14 h 31 h 32 h 33 h 34 h 51 h 52 h 53 h 54 h 71 h 72 h 73 h 74 , 1 = b 11 1 b 12 1 b 13 1 b 14 1 b 31 1 b 32 1 b 33 1 b 34 1 b 51 1 b 52 1 b 53 1 b 54 1 b 71 1 b 72 1 b 73 1 b 74 1 ,
(50)

and

2 (i)= h 21 h 12 h 23 h 24 h 41 h 42 h 43 h 44 h 61 h 62 h 63 h 64 h 81 h 82 h 83 h 84 , 2 = b 21 2 b 22 2 b 23 2 b 24 2 b 41 2 b 42 2 b 43 2 b 44 2 b 61 2 b 62 2 b 63 2 b 64 2 b 81 2 b 82 2 b 83 2 b 84 2 .
(51)

We now consider a method for cancelling these columns, and specifically, the order in which they are cancelled. Similar to all IC detectors, a subtraction of interference terms of the corresponding time slots is proposed. Logically, the ordering should be according to the ordering of reliability of available detected symbols. This can be achieved by estimating which time slots have a better signal-to-noise ratio (SNR). The estimation of SNR values can be done through a two-phase training pilot sequence for channel estimation [22, 23] and traditionally as in [24, 25] if the DT link exists. Consequently, better performance is achieved, particularly in the first iteration of the EIC detector, and hence, faster convergence is achieved in the consequent iteration.

4 Simulation results and discussion

In terms of bit error rate (BER), simulation results are presented to demonstrate the performance of the proposed detector under different conditions of imperfect synchronisation. Also, the results of both the extended PIC- and SIC-based detectors are included. The simulation uses 4-QAM Gray coded modulation over a Rayleigh fading channel. The configurations of simulated networks are shown in Table 1. The power loading scheme for each network is similar to the network under a condition of perfect synchronisation.

Table 1 The configurations of the simulated Networks

Network 1 is simulated under a condition of α =-5 and -3 dB in Figures 3 and 4, respectively. Figure 3 shows that even under a limited condition of imperfect synchronisation, much performance degradation is experienced if the conventional detector is used. This degradation can be mitigated if the extended PIC- and SIC-based detectors are used and better when the proposed EIC detector is used. Due to the innovative cancellation used, one iteration of EIC can offer a performance close to the performance of two iterations of either the PIC or SIC detector. In addition, it can offer a three to four SNR gain within two iterations to get a BER of 10-3 over the SIC and PIC detector, respectively. In Figure 4, the network is simulated under a condition of -3 dB imperfect synchronisation. The performance of the extended detectors is degraded, but they are still effective compared to the conventional detector. In contrast, the EIC detector outperforms the extended detectors and shows a performance closer to the perfect synchronisation condition.

Figure 3
figure 3

The BER using PIC, SIC and EIC detectors under a condition of α =-5 dB in Network 1.

Figure 4
figure 4

The BER using PIC, SIC and EIC detectors under a condition of α =-3 dB in Network 1.

In Figure 5, the simulation results of Network 1 and Network 2 are included for the proposed and extended detector under a condition of α = 0 dB. This condition corresponds to the most severe value of time misalignment. In spite of severe timing errors, the proposed detector still outperforms the extended ones and performs much better than the conventional detector. It is worth noting that the EIC detector fails to achieve performance close to perfect synchronisation under this severe condition in the event of no DT link but it is still effective in the case where it exists.

Figure 5
figure 5

The BER using PIC, SIC and EIC detectors a condition of α = 0 dB in Network 1 and Network 2.

The simulation results of using the proposed detectors in Network 3 and Network 4 are shown in Figures 6 and 7, respectively. They are simulated under a moderate condition of imperfect synchronisation, α = -3 dB. The figures show that these detectors are designed not only for particular networks as in [11, 12] but also for any TWRNs with N R a -antenna relays. In addition, they can be used for an orthogonal or quasi-orthogonal linear dispersion STBC. It can be concluded that the EIC detector outperforms the extended detectors and these extended detectors are still effective compared to the conventional detector.

Figure 6
figure 6

The BER using PIC, SIC and EIC detectors under a condition of α = -3 dB in Network 3.

Figure 7
figure 7

The BER using PIC, SIC and EIC detectors under a condition of α = -3 dB in Network 4.

5 Conclusions

A TWRN employing either quasi-orthogonal or orthogonal STBC was considered under imperfect synchronisation. The network consisted of two terminals exchanging data through N R a -antenna relays. The relays employed the AF relaying protocol. The general model was derived for the considered network under a condition of imperfect synchronization, and then, instances were evaluated for the case of two single-antenna relays, two dual-antenna relays and four single-antenna relays. Both PIC- and SIC-based detectors which were proposed previously for one-way relaying networks were extended here for TWRNs to mitigate the performance degradation due to the imperfect synchronisation. In addition, an EIC-based detector was proposed while maintaining low computational complexity. This detector showed better performance improvement as it is based on an innovative iterative cancellation process and it reduces the dependency on low-performance symbols. The simulation results show in terms of bit error rate that significant performance improvement can be gained compared to the conventional detector. Moreover, the proposed detector achieved better performance compared to the extended detectors under all conditions of imperfect synchronisation.

References

  1. Liu K, Sadek A, Weifeng S, Kwasinski A: Cooperative Communications and Networking. Cambridge University Press, London, UK; 2009.

    MATH  Google Scholar 

  2. Laneman JN, Tse DN, 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.838089

    Article  MathSciNet  MATH  Google Scholar 

  3. Laneman JN, Wornell GW: Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks. IEEE Trans. Inf. Theory 2003, 49(10):2415-2425. 10.1109/TIT.2003.817829

    Article  MathSciNet  MATH  Google Scholar 

  4. Cui T, Gao F, Ho T, Nallanathan A: Distributed space-time coding for two-way wireless relay networks. IEEE Trans. Signal Process 2009, 57(2):658-671.

    Article  MathSciNet  Google Scholar 

  5. Gong F, Zhang J, Ge J: Novel distributed quasi-orthogonal space-time block codes for two-way two-antenna relay networks. IEEE Trans. Wireless Commun 2013, 12(9):4338-4349.

    Article  Google Scholar 

  6. Gong F, Zhang J, Ge J: Distributed concatenated Alamouti codes for two-way relaying networks. IEEE Wireless Commun. Lett 2012, 1(3):197-200.

    Article  Google Scholar 

  7. Wang M, Wang F, Zhong Z: Wireless MIMO switching: distributed zero-forcing and MMSE relaying using network coding. EURASIP J. Adv. Signal Process 2013., 2013(1):

  8. El Astal M. -T. O., Salmon B. P., Olivier J. C.: Distributed space-time block coding for two-way wireless relaying networks: improved performance under imperfect synchronization. In Proceedings of the 2014 IEEE Wireless Communications and Networking Conference (WCNC). IEEE, Istanbul, Turkey; 2014:1176-1181.

    Chapter  Google Scholar 

  9. Abdurahman F, Elazreg A, Chambers JA: Distributed quasi-orthogonal space-time coding for two-way wireless relay networks. In Proceedings of the 2010 7th International Symposium on Wireless Communication Systems (ISWCS). IEEE, York, UK; 2010:413-416.

    Chapter  Google Scholar 

  10. Wei S, Goeckel DL, Valenti MC: Asynchronous cooperative diversity. IEEE Trans. on Wireless Commun 2006, 5(6):1547-1557.

    Article  Google Scholar 

  11. El Astal M-TO, Abu-Hudrouss AM: SIC detector for 4 relay distributed space-time block coding under quasi-synchronization. IEEE Commun. Lett 2011, 15(10):1056-1058.

    Article  Google Scholar 

  12. Zheng F, Burr AG, Olafsson S: Signal detection for distributed space-time block coding: 4 relay nodes under quasi-synchronisation. IEEE Trans. Commun 2009, 57(5):1250-1255.

    Article  Google Scholar 

  13. Zhang S, Liew S-C, Lam PP: On the synchronization of physical-layer network coding. In Procedding of the 2006 IEEE Information Theory Workshop (ITW). IEEE, Chengdu, China; 2006:404-408.

    Google Scholar 

  14. Chang S, Kelley B: An efficient time synchronization scheme for broadband two-way relaying networks based on physical-layer network coding. IEEE Commun. Lett 2012, 16(9):1416-1419.

    Article  Google Scholar 

  15. Zhong Z, Zhu S, Nallanathan A: Distributed space-time trellis code for asynchronous cooperative communications under frequency-selective channels. IEEE Trans. Wireless Commun 2009, 8(2):796-805.

    Article  Google Scholar 

  16. Li Z, Xia X, Li B: Achieving full diversity and fast ML decoding via simple analog network coding for asynchronous two-way relay networks. IEEE Trans. Commun 2009, 57(12):3672-3681.

    Article  Google Scholar 

  17. Liu Y, Xia X, Zhang H: Distributed linear convolutional space-time coding for two-relay full-duplex asynchronous cooperative networks. IEEE Trans. Wireless Commun 2013, 12(12):6406-6417.

    Article  Google Scholar 

  18. Zhong Z, Zhu S, Lv G: Distributed space-time code for asynchronous two-way wireless relay networks under frequency-selective channels. In Procedding of the 2009 IEEE International Conference on Communications. IEEE, Dresden, Germany; 2009:1-5.

    Google Scholar 

  19. Alamouti SM: A simple transmit diversity technique for wireless communications. IEEE J. Sel. Areas in Commun 1998, 16(8):1451-1458. 10.1109/49.730453

    Article  Google Scholar 

  20. Jing Y, Jafarkhani H: Using orthogonal and quasi-orthogonal designs in wireless relay networks. IEEE Trans. Inf. Theory 2007, 53(11):4106-4118.

    Article  MathSciNet  MATH  Google Scholar 

  21. Mannai UN, Abdurahman FM, Elazreg AM, Chambers JA: Orthogonal space time block coding for two-way wireless relay networks under imperfect synchronization. In Proceeding of the 7th International Wireless Communications and Mobile Computing Conference (IWCMC). IEEE, Istanbul, Turkey; 2011:1694-1697.

    Google Scholar 

  22. Zhang S, Gao F, Pei C: Optimal training design for individual channel estimation in two-way relay networks. IEEE Trans. Signal Process 2012, 60(9):4987-4991.

    Article  MathSciNet  Google Scholar 

  23. Xu X, Wu J, Ren S, Luan X, Xiang H: Superimposed training and channel estimation for two-way relay networks. In Proceeding of the International Conference on Advanced Communication Technology (ICACT). IEEE, Pyongyang, South Korea; 2014:1050-1054.

    Chapter  Google Scholar 

  24. Biguesh M, Gershman AB: Training-based MIMO channel estimation: a study of estimator tradeoffs and optimal training signals. IEEE Trans. Signal Process 2006, 54(3):884-893.

    Article  Google Scholar 

  25. Wong TF, Park B: Training sequence optimization in MIMO systems with colored interference. IEEE Trans. Commun 2004, 52(11):1939-1947. 10.1109/TCOMM.2004.836558

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mohammed Taha O. El Astal.

Additional information

Competing interests

The authors declare that they have no competing interests.

Authors’ original submitted files for images

Rights and permissions

Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (https://creativecommons.org/licenses/by/4.0), which permits use, duplication, adaptation, distribution, and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

El Astal, M.T.O., Olivier, J.C. Improved signal detection for two-way wireless relaying networks under imperfect time synchronisation. EURASIP J. Adv. Signal Process. 2014, 177 (2014). https://doi.org/10.1186/1687-6180-2014-177

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1186/1687-6180-2014-177

Keywords