The Performance of Network Coding at the Physical Layer with Imperfect Self-Information Removal

. Network capacity for bidirectional communication between pairs of wireless end users assisted by a relay terminal can be improved by network coding at the physical layer (PNC). Narrowband analog network coding (ANC) was introduced as a simpler implementation of PNC in a ﬂat (i.e., frequency-nonselective fading) channel. Recently, broadband ANC has been studied for communication over a frequency-selective fading channel. In ANC, the end user removes its own information from the received signal before detecting the data of the other user. Clearly, the network performance of ANC scheme depends on the self-information removal at the destination terminal. In this paper, we discuss the impact of imperfect self-information removal on the performance of broadband ANC in terms of the bit error rate (BER) and achievable throughput in a frequency-selective fading channel. The theoretical minimum mean square error (MMSE) equalization weight for ANC based on single carrier with frequency domain equalization (SC-FDE) radio access is derived by taking into account the self-interference. We have used analysis and computer simulation to evaluate how the imperfect removal of self-information inﬂuences the achievable BER and throughput.


Introduction
Next generation wireless communication networks are expected to provide gigabit ubiquitous access and coverage over a large area for wireless users.To enable gigabit broadband services for wireless end-users, a higher capacity is required.Direct application of network coding [1] in a wireless relaying [2] at the physical layer increases the capacity of bi-directional communication in a flat (i.e., frequency-nonselective) fading channel (called bi-directional amplification of the throughput (BAT-relaying) in [3] and physical layer network coding (PNC) in [4]).The analog network coding (ANC) proposed in [5] is essentially another variation of BAT-relaying and PNC schemes in a flat fading channel with a simpler implementation.Recently, broadband ANC based on orthogonal frequency division multiplexing (OFDM) and single carrier with frequency domain equalization (SC-FDE) was investigated in a multipath (i.e., frequency-selective) fading channel [6].
In the ANC scheme, communication is done in two stages; in the first stage both users transmit their signals to the relay, while in the second stage the relay broadcasts the received signal.At the destination terminal, the selfinformation is removed from the received signal before data detection.Naturally the network performance of ANC scheme highly depends on the self-information removal at the destination terminal.Self-information removal accuracy can be degraded due to several factors such as imperfect frame synchronization, carrier frequency offset, and imperfect knowledge of channel state information.Early studies [3][4][5][6] considered perfect self-information removal at the destination terminal.Therefore, an important question is "How much does the imperfect self-information removal affect the performance of ANC scheme?"To the best of authors knowledge, this effect has not been evaluated in the literature yet.
This paper investigates the performance of bi-directional ANC with imperfect self-information removal based on OFDM and SC-FDE radio access in a frequency-selective fading channel.The performance metrics of practical interest are (i) the bit error rate (BER) and (ii) throughput.The achievable performance with imperfect self-information removal is evaluated by analysis and computer simulation.
We develop a theoretical model to take into consideration a random nature of self-interference due to imperfect self-information removal.The theoretical MMSE weight for SC-FDE is derived by taking into account the selfinterference.The theoretical expressions are derived based on the Gaussian approximation of both the residual intersymbol interference (ISI) after equalization and the selfinterference due to imperfect self-information removal.The remainder of this paper is organized as follows.Section 2 explains the network model.In Section 3, we present the theoretical performance with imperfect selfinformation removal.Numerical and computer simulation results are presented in Section 4. Section 5 concludes the paper.

Network Model
This section firstly presents bi-directional ANC based on OFDM and SC-FDE radio access, and then we present a theoretical model for random self-interference due to imperfect self-information removal.

Broadband ANC Scheme.
A two-way relay network with the users T 0 and T 1 and the relay R is illustrated in Figure 1.We assume that coverage area of terminals T 0 and T 1 includes relay terminal R while they are out of each other's transmission range due to solid obstacles as illustrated in Figure 1.Each terminal is equipped with an omnidirectional antenna, and the communication takes place in two stages as summarized in Table 1.During the first stage, terminals T 0 and T 1 transmit simultaneously.During the second stage, the relay broadcast the received signal to both terminals T 0 and T 1 using an amplify-and-forward network protocol [7].
Information bit sequence of length M is channel coded, bit interleaved, and mapped into the data-modulated symbols using quadrature phase-shift keying (QPSK) modulation scheme.The terminal denotes the ensemble average.Henceforth, the frame index k is omitted without loss of generality.We consider two radio access schemes for bi-directional ANC: (i) OFDM and (ii) SC-FDE.In the case of SC radio access, the transmit signal is given by {d j (n)}, while in the case of OFDM signaling, {d j (n)} is fed to an N c -point inverse fast Fourier transform (IFFT) to generate the OFDM signal.After insertion of N gsample cyclic prefix into the guard interval (GI), the signal is transmitted over a frequency-selective fading channel.
The signal propagates through the channel with a discrete-time channel impulse response h m, j (τ) given by where L, h l,m, j , τ l , and δ(t) denote the number of paths, the path gain between the terminal T j and relay at stage m (=1,2), the lth path time delay normalized by IFFT sampling period, and the delta function, respectively.Without loss of generality, we assume that τ 0 = 0 < τ 1 < • • • < τ L−1 and that the lth path time delay is τ l = lΔ, where Δ (≥ 1) defines the separation between adjacent paths.
Stage I.The signals transmitted from both terminals are superimposed in the wireless channel and reach the relay simultaneously.In this paper, we assume ideal synchronization and also assume no path loss and shadowing loss.It should be noted that the assumptions of no path loss and shadowing loss do not change our general conclusion.
The signal received at the relay terminal in the frequency domain can be represented as for n = 0 ∼ N c − 1, where P s (=E s /T c ), S j (n), H 0, j (n), and N r (n), respectively, denote the transmit signal power, the Fourier transforms of the terminal T j transmit signal, the channel gain between T j and R, and the additive white Gaussian noise (AWGN) at the relay with power spectral density N 0 .E s and T c denote the data-modulated symbol energy and the sampling interval of IFFT.The received signal at the relay is amplified and broadcasted to both destination terminals.
Stage II.At the terminal T j , N c -point FFT is applied to decompose the received signal into N c frequency components represented by for j ∈ {0, 1} and n = 0 ∼ N c − 1, where R r (n), H 1, j (n), and N j (n) denote the Fourier transforms of the relay transmitted signal, the channel gain between R and terminal T j , and the additive white Gaussian noise (AWGN) with power spectral density N 0 at the terminal T j , respectively.
2.2.Self-Information Removal.The terminal T j removes its self-information from the received signal.However, the self-information removal is not perfect, and hence, the self interference is present.Since an exact analysis of self interference is quite difficult if not impossible, we introduce a simplified model to include the random interference resulting from, for example, imperfect channel estimation as where S j (n) denotes the SC-or OFDM-transmitted signal of the terminal T j (i.e., {d j (n)} in case of OFDM and , where the error term δ m, j (n) (m = 0, 1) is assumed to be independent zero mean complex Gaussian random variable [8].Thus, we can rewrite (4) as where Δ j (n) denotes the random self interference due to imperfect channel estimation given by For the given channel gains H m, j (n), the products H 1, j (n)δ 0, j (n) and H 1, j (n)δ 0, j (n) are also assumed to be independent complex Gaussian random variables.On the other hand, the cross term δ 0, j (n)δ 1, j (n) is not a Gaussian variable.However, most of the time, the term δ 0, j (n)δ 1, j (n) is much smaller than H 1, j (n)δ 0, j (n) + H 1, j (n)δ 0, j (n) and therefore can be neglected.As a consequence, the self interference Δ j (n) behaves as a complex Gaussian random variable with the variance given as denotes the root mean square (rms) estimation error, which reflects the degree of imperfect self-information removal due to estimation error at the destination end.The case with β = 0 represents the perfect self-information removal case.We note here that the self interference also may be caused by imperfect synchronization, carrier frequency offset, and so forth, in addition to the imperfect channel estimation, but their analysis is out of the scope of this work.

FDE.
One-tap equalization is applied in the frequency domain to combat the channel impairments as presented below.The equalized signal can be represented as for n = 0 ∼ N c − 1, where the equalization weight at the terminal T j is given by ( 8) at the top of the next page.We note here that the theoretical MMSE equalization weight for SC-FDE is derived to take into consideration the random interference due to imperfect self-information removal (see the appendix).
, SC, In the case of SC-FDE transmission, N c -point IFFT is applied to (7) to obtain decision variables for data detection, while for OFDM case, (7) denotes the decision variables.Finally, the log-likelihood ratio (LLR) is computed, and deinterleaving followed by Viterbi decoding is carried out.

Performance Analysis
In this section, we first present the conditional signal-tointerference plus noise ratio (SINR) taking into account imperfect self-information removal.Later the conditional BER and throughput expressions are presented.We note here that the derivation of closed form BER and throughput expressions with imperfect self-information removal is very difficult if not impossible due to the presence of the residual ISI after FDE and self interference term in (11).We assume that the relay normalizes received signal (2) by the factor α which represents its noise variance.This will not alter the signal-to-noise ratio (SNR) but will assist theoretical derivations.

Decision Variables with Imperfect Self-Information
Removal.Using (2) through (6), the decision variables at the terminal T j after equalization can be expressed as where with j = 0(1) if j = 1(0).In (9), S j (n) = d j (n) in the case of OFDM while S j (n) = FFT[{d j (n)}] for SC-FDE radio access.I j (n) denotes the total interference (i.e., the residual ISI after equalization plus random self interference due to imperfect self-information removal) given by (11) at the top of the next page.We note here that in the case of OFDM the ISI is eliminated by the insertion of the cyclic prefix within the GI.
It can be seen from ( 11) that the residual ISI is a weighted sum of a large number of independent and identically distributed (i.i.d.) data-modulated symbols as shown by summation in (11).The Gaussian approximation of the residual ISI remains valid only if the number of ISI components is large and if they are i.i.d.so that the central limit theorem can be considered.This is true for OFDM and SC-FDE when the IFFT/FFT size is large enough.Thus, we assume that the residual ISI after FDE, for SC-FDE, can be approximated as a complex-valued random Gaussian variable.Consequently, since the self interference due to imperfect self-information removal can be approximated as a complex-valued random Gaussian variable (see Section 2.2), the sum of the residual ISI, the self interference, and AWGN can be treated as a new complex-valued random Gaussian noise with variance 2σ 2 given by It can be seen from ( 9) that the OFDM (SC-FDE) equalized (IFFT) output can be seen as a random variable with mean P s d j (n) H (P s d j (n) H(n)).Using ( 9) and (12), the conditional signal-to-interference plus noise ratio (SINR) γ j [E s /N 0 , {H m, j (n)}] at the jth terminal T j is represented by (13). (13)

BER and Throughput Analysis for Uncoded System.
We assume QPSK data modulation with all "1" transmission without loss of generality.The conditional BER at the terminal T j is given by [8] where E s /N 0 and erfc[•] denote the given average signal energy per symbol-to-AWGN power spectrum density ratio and the complementary error function, respectively.We define the packet length of M bits.Using (14), the conditional packet error rate (PER) at the terminal T j can be expressed by The average PER at terminal T j can be numerically evaluated by averaging the conditional PER (15) over all possible  realizations of {H m, j (n); n = 0 ∼ N c − 1} as Finally, the achievable throughput η j at terminal T j is given as which is the theoretical throughput achievable by selective repeat ARQ, where the transmission is done using a packet of 2 OFDM symbols (i.e., two N c -sample IFFT blocks).The evaluation of the throughput is done by Monte-Carlo numerical computation method as follows.First, a set of channel gains {H m, j (n); n = 0 ∼ N c − 1} is generated as a Fourier transform of the corresponding channel impulse response given by (1).Then, the equalization weight {w j (n); n = 0 ∼ N c − 1} is computed for each of the source terminals [6].Secondly, the conditional BER is computed using (14) for the given set of channel gains {H m, j (n)} for the given E s /N 0 .Then, the average PER is computed using (16) to obtain the achievable throughput by evaluating (17).

Results and Discussions
Numerical and computer simulation parameters are summarized in Table 2.In our numerical evaluation and computer simulation, we assume N c = 256, GI length of N g = 32 samples, and ideal coherent QPSK data modulation and demodulation.The information bit sequence length is taken to be 1024 bits.For channel coding, we apply {g 1 = (111), g 2 = (101)} convolutional encoder [9] with coding rate 1/2 and constraint length 3 (each new frame state of the encoder is initialized before transmission).2048-bit random interleaver is used as channel interleaver.At the receiver, a hard decision Viterbi decoder is applied.The propagation channel is an L = 16-path block Rayleigh fading channel having the uniform power delay profile, where {h l,m, j ; l = 0 ∼ L − 1} are zero mean independent complex variables with E[|h l,m, j | 2 ] = 1/L.The normalized Doppler frequency is the transmission symbol rate, is assumed (under this assumption, the path gains can be considered to remain almost constant over a packet of 1024 information bits and vary packet-by-packet).We assume that the maximum time delay of the channel is less than the GI length (i.e., L < N g with Δ = 1) and that all paths in any channel are independent of each other.In this paper, we do not consider geometry, and thus, we assume neither shadowing nor path loss.

BER.
We perform computer simulation to evaluate the uncoded and coded BER of broadband ANC as a function of the cancelation factor β with the average signal energy per bit-to-AWGN power spectrum density ratio E b /N 0 (= 0.5 × 0.5×(E s /N 0 )×(1+N g /N c )) as a parameter being illustrated in Figures 2 and 3.The uncoded BER is evaluated by both numerical computation using (14) and computer simulation, while the coded BER is measured by computer simulation.It can be seen from the figure that in a lower E b /N 0 region, impact of imperfect self-information removal is negligible; for E b /N 0 = 0 and 5 dB, the BER performance slightly degrades as the cancelation coefficient β increases.On the other side, for a higher E b /N 0 , the BER performance is severely affected by imperfect self-information removal.For example, if 10 times increase of the BER performance is allowable in comparison with the perfect self-information removal (i.e., β = 0) case, it is required to cancel 96% of self-information (β = 0.04 in Figure 2) for uncoded OFDM case, while SC-FDE radio access is more sensitive to self-information removal since more than 99% of cancelation is required to allow only 10 times performance degradation.It can be seen from the figure that more self-interference is allowed in the lower E b /N 0 region to achieve the same performance degradation.
In the case of channel coding illustrated in Figure 3, a higher resistance to imperfect self-information removal due to channel coding gain is observed; a lower percentage of cancelation is required to allow 10 times performance degradation in comparison with the uncoded case.Note that, the BER of broadband ANC based on SC-FDE is lower in comparison with OFDM radio access due to the frequency diversity gain obtained through MMSE-FDE.However, the BER performance between their coded performances is significantly reduced since OFDM system achieves the frequency diversity gain through channel decoding.In this paper, we assume simple convolutional encoding and hard  decision Viterbi decoding, which provides a relatively small coding gain.Much larger coding gain can be obtained with soft decision decoding or state-of-the-art channel coding techniques such as turbo codes and low-density parity check codes.

Throughput.
The achievable throughput of broadband ANC as a function of E b /N 0 is illustrated in Figure 5 for (i) uncoded and (ii) coded cases.The uncoded case is numerically evaluated by (17).Throughput in the coded case is evaluated by measuring the BER by computer simulation.Then, the PER is computed using (16) assuming that the bit errors after decoding are random, and finally, we compute the throughput using (17).In the uncoded case, the achievable throughput of broadband ANC using SC-FDE is higher than that using OFDM.This is because SC-FDE is able to exploit the channel frequency selectivity and obtain frequency diversity gain.However, the OFDM system achieves the frequency diversity gain through channel decoding.The performance difference between coded SC-FDE and coded OFDM is significantly reduced.In this paper, we assumed the hard decision decoding; however, the use of soft decision decoding provides better throughput.
Next, we discuss the impact of self-information removal on the achievable throughput.We perform computer simulation to evaluate the achievable throughput of broadband ANC as a function of the cancelation factor β as illustrated in Figure 5.It can be seen from the figure that channel coding provides a better resistance to imperfect self-information removal in comparison with the uncoded case.

Conclusion
In this paper, we discussed the impact of imperfect selfinformation removal on the BER and achievable throughput of bi-directional ANC based on OFDM and SC-FDE radio access in a frequency-selective fading channel.The performance is evaluated by analysis and computer simulation.The theoretical MMSE equalization weight for SC-FDE is derived by taking into account the self interference due to imperfect self-information removal.Our results show that the allowable performance degradation in comparison with the perfect self-information removal case highly depends on the level of E b /N 0 for both uncoded and coded performances.In the case of channel coding, due to coding gain, a lower percentage of self-information cancelation is required to allow the same performance degradation in comparison with uncoded case.It was also shown that broadband ANC based on SC-FDE is more sensitive to imperfect self-information removal in comparison with OFDM signaling radio access.
The self interference may be caused by different factors such as imperfect synchronization, carrier frequency offset, in addition to channel estimation error, but the analysis taking into account their full impact on the performance is very difficult.This is left as an interesting future work.

EURASIP Journal on Wireless Communications and Networking
nth frequency as MSE j (n Substituting (5) into (7), the MSE j (n) term can be expressed as where N r (n) and N j (n) denote the zero mean and independent identically distributed (i.i.d.) complex Gaussian variable with variance 2N 0 /T c .Since data symbols are independent, that is, E[d(x)d * (y)] = δ(x − y), we obtain where H(n) = |H 0, j (n)| 2 + |H 1, j (n)| 2 , P s = E s /T c and R{z} denotes the real part of the complex number z.By solving ∂MSE j (n)/∂w j (n) = 0, we obtain the equalization weight given by (8).
E[S j (n)S * j (n )] = δ(n − n ).After the expectation with respect to the noise and self interference components, we obtain 2 − 2P 2 s R E H 0, j (n)H 1, j (n)w j (n)