# Receiver design for the uplink of base station cooperation systems employing SC-FDE modulations

- Filipe Casal Ribeiro
^{1, 2}Email author, - Rui Dinis
^{1, 3}, - Francisco Cercas
^{1, 2}and - Adão Silva
^{1, 4}

**2015**:7

https://doi.org/10.1186/s13638-014-0237-6

© Ribeiro et al.; licensee Springer. 2015

**Received: **3 June 2014

**Accepted: **28 December 2014

**Published: **21 January 2015

## Abstract

The presented paper considers the uplink transmission in base station (BS) cooperation schemes where mobile terminals (MTs) in adjacent cells share the same physical channel. We consider single-carrier with frequency-domain equalization (SC-FDE) combined with iterative frequency-domain receivers based on the iterative block decision feedback equalization (IB-DFE). We study the quantization requirements when sending the received signals, from different MTs, at different BSs to a central unit that performs the separation of different MTs using iterative frequency-domain receivers. Our performance results show that a relatively coarse quantization, with only 4 bits in the in-phase and quadrature components of the complex envelope already allows close-to-optimum macro-diversity gains, as well as an efficient separation of the transmitted signals associated with each MT.

## Keywords

## 1 Introduction

It is expected that the demand for wireless services will continue to increase in the near and medium term, calling for more capacity and putting more and more pressure on the usage of radio resources. Future spectral efficiency improvements will be focused on interference-reducing techniques that require the cooperation of network elements [1], since the point-to-point link capacities are already close to the fundamental Shannon limit [2]. Conventional cellular systems adopt different frequencies at different cells, with frequency reuse factors of 3, or even more. Clearly, the overall system’s spectral efficiency and capacity are conditioned by the frequency reuse factor, typically decreasing linearly with it. Since the spectrum is a scarce and expensive resource in wireless systems, it would be desirable to design systems operating in universal frequency reuse (i.e., with frequency reuse factor 1). Multicell cooperation is a promising solution to mitigate interference between different cells, to improve the system’s fairness and to increase capacity [3-7]. For these reasons, it is already under study in LTE [8], namely, under the so-called coordinated multi-point concept which although not included in current releases, will probably be specified for future ones.

In conventional cellular architectures, different cells are regarded as separate entities and each mobile terminal (MT) is assigned to a given cell and, consequently, a given base station (BS). The MT transmits its signals to the corresponding BS, and when this signal is received by another BS, it is regarded as interference. In BS cooperation architectures [9], the signals between different MTs and BSs are collected and processed by a central processing unit (CPU), so as to perform the user separation and/or interference mitigation. In fact, BS cooperation allows not only universal frequency reuse but also substantial macro-diversity effects, significantly improving the overall performance of wireless systems, as well as the coverage and power requirements associated with each individual link. The signal separation in the downlink transmission (i.e., the link from the BSs to the MTs) of BS cooperation schemes is usually achieved by appropriate pre-processing schemes [10-12]. In the uplink transmission (i.e., the link from the MTs to the BSs), the overall signals received by different BSs (with contributions from all MTs) are sent to the CPU that performs the signal separation, to extract the data blocks transmitted by each MT, before sending them to the corresponding BS [3]. These BS cooperation schemes involve interference mitigation, allowing the use of the same physical channel by MTs in adjacent cells, which means that the overall system capacity can be significantly improved.

It is well known that block transmission techniques, combined with frequency-domain processing, are choice candidates for broadband wireless systems. These techniques include orthogonal frequency division multiplexing (OFDM) [13] and single-carrier with frequency domain equalization (SC-FDE) [14], which have similar overall signal processing requirements and achievable performance. However, the receiver complexity is higher for SC-FDE, and the transmitter complexity is higher for OFDM. If we also take into account that the envelope fluctuations of single-carrier signals are much lower than the envelope fluctuations of OFDM signals with the same constellations, SC-FDE is clearly preferable for the uplink transmission while OFDM is interesting mainly for the downlink transmission [15,16].

In this paper, we consider the uplink of broadband wireless systems with BS cooperation architectures with the employment of SC-FDE modulation schemes. MTs in adjacent cells can share the same physical channel and the signals received by a given BS are digitalized, through appropriate sampling and quantization procedures. The corresponding bits are sent to the central unit. The separation of the signals associated with different MTs is performed using iterative frequency-domain receivers based on the iterative block decision feedback equalization (IB-DFE) concept [17-19]. Due to its processing nature, the IB-DFE can be considered as a frequency-domain low complexity turbo equalizer [20-22]. Hence, the IB-DFE does not need the channel decoder output at the feedback loop. Nevertheless, turbo equalizers based on IB-DFE schemes can be conceived [23]. The quantization requirements for the signals received at a given BS are studied in detail.

This paper is organized as follows: in Section 4, we describe the BS cooperation scenario considered in this paper and Section 4 is concerned with the receiver design. A set of performance results is presented in Section 4, and Section 4 concludes the paper.

Throughout the paper, we will adopt the following notations: bold letters denote vectors and matrices; **x**
^{∗}, **x**
^{
T
}, and **x**
^{
H
} denote complex conjugate, transpose, and Hermitian (complex conjugate transpose) of **x**, respectively. **I**
_{
N
} denotes a *N*×*N* identity matrix, and **e**
_{
p
} is an appropriate column vector with 0 in all positions except the *p*th position that is 1. The expectation of *x* is denoted by \(\mathbb {E}[x]\).

## 2 System characterization

*P*MTs share the same physical channel (i.e., the information from all MTs is transmitted at the same frequency band) and, in general, there are

*R*≥

*P*BSs which receive the MTs signals and can efficiently cooperate to improve the system’s performance. Although sometimes, we can have

*R*<

*P*, in general, we need at least

*R*=

*P*to be able to separate

*P*users. By adopting

*R*>

*P*, it is possible to have macro-diversity effects, allowing further performances. Typically, in conventional systems, one BS only performs the detection of the signals of its own MTs, interpreting the information from other MTs as interference, that is, ignoring it. Contrarily to conventional architectures, this paper considers a BS cooperation system where the overall signals received at each BS are quantized and sent to a central processing unit that performs the separation of the different transmitted signals and then sends them to the corresponding BS.

It is assumed perfect synchronization and channel estimation. This can be obtained with the help of appropriate training blocks and/or pilots [24-26]. The channel estimation segments are similar to other SC-FDE schemes [27].

*p*th MT (

*p*=1,2,…,

*P*) is {

*s*

_{ n,p };

*n*=0,1,…,

*N*−1}, where constellation symbol

*s*

_{ n,p }is selected from the data, according to a given mapping rule (e.g., a quadrature phase-shift keying (QPSK) constellation with Gray mapping). The corresponding frequency-domain block is {

*S*

_{ k,p };

*k*=0,1,…,

*N*−1} = DFT {

*s*

_{ n,p };

*n*=0,1,…,

*N*−1}. As with other block transmission techniques, an appropriate cyclic prefix is appended to each data block. The useful time-domain received block, i.e., after removing the samples associated with the cyclic prefix, at the

*r*th BS is \(\left \{y_{n}^{(r)};n=0,1,\ldots,N-1\right \}\) (

*r*=1,2,…,

*R*), and the corresponding frequency-domain block is \(\left \{Y_{k}^{(r)};k=0,1,\ldots,N-1\right \}\) = DFT \(\left \{y_{n}^{(r)};n=0,1,\ldots,N-1\right \}\). Clearly, we have

*p*th MT and the

*r*th BS, for the

*n*th time-domain component. \(\nu _{n}^{(r)}\) indicates the channel noise at the

*r*th BS and the

*n*th time-domain component. The

*ξ*

_{ p,r }parameter is a weighting factor that accounts for the combined effects of power control and propagation loss effects (the average received power associated with the

*p*th MT at the

*r*th BS is |

*ξ*

_{ p,r }|

^{2}). In conventional block transmission schemes, the cyclic prefix is required to be longer than the overall impulse response, including channel effects and transmit and receive filters. However, in BS cooperation schemes, it might be necessary to have a slightly longer cyclic prefix to account for different propagation times between MTs and BSs, since the useful part of each block should overlap. This means that if the cyclic prefix is long enough, it can be shown that [19]:

*n*. Consequently, in the frequency-domain, we have:

*r*th BS, \(\left \{y_{n}^{(r)};n=0,1,\ldots,N-1\right \}\), are quantized

^{a}, leading to \(y_{n}^{Q(r)}\), with

*f*

_{ Q }(·) denotes the quantization characteristic. Due to the Gaussian nature of \(y_{n}^{(r)}\), it can be shown that the quantized signals can be decomposed as the sum of uncorrelated useful and distortion terms (see Appendix), i.e.:

*α*computed as described in the Appendix. Clearly, \(\frac {\text {Re}\left \{y_{n}^{(r)}\right \}}{\sigma _{y}^{(r)}}\) and \(\frac {\text {Im}\left \{y_{n}^{(r)}\right \}}{\sigma _{y}^{(r)}}\) are uncorrelated \(\mathcal {CN}\left (0,1\right)\) random variables. Since the nonlinear distortion component when the input \(\mathcal {CN}\left (0,1\right)\) has variance \({\sigma _{d}^{2}}\) (see Appendix), we have:

^{ m }, with

*m*denoting the number of bits required for the real and imaginary parts of each quantized sample, and the type of quantizer. For the sake of simplicity, we will consider only uniform quantizers in this paper, i.e.,

*f*

_{ Q }(·) has 2

^{ m }levels equally spaced between the saturation levels −

*A*

_{ M }and

*A*

_{ M }. Figure 2 shows the impact of the normalized saturation level \(A_{M}/\sigma _{y}^{(r)}\) and the number of quantization bits

*m*on SQNR. Actually, the number of quantization bits is 2

*m*, since we need

*m*bits for the real part and

*m*bits for the imaginary part, according to (5). For comparison, we include the conventional SQNR that assumes uniform distribution for the quantization noise, therefore neglecting saturation effects, and the signal-to-distortion ratio (SDR) for an ideal clipping, therefore neglecting the quantization error. Clearly, the SDR is accurate for small quantization steps (\(A_{M}/\sigma _{y}^{(r)}<<1\)), and the uniform approximation, for the quantization noise, is reasonable for high values of \(A_{M}/\sigma _{y}^{(r)}\). Moreover, there is an optimum normalized saturation level for each value of

*m*, since the quantizer’s saturation becomes too frequent if \(A_{M}/\sigma _{y}^{(r)}\) is small and the quantization interval becomes too high when \(A_{M}/\sigma _{y}^{(r)}\) is high. In this paper, we always assume the optimum saturation level for each value of

*m*.

*r*th BS, is \(\left \{Y_{k}^{Q(r)};k=0,1,\ldots,N-1\right \} =\) DFT \(\left \{y_{n}^{Q(r)};n=0,1,\ldots,N-1\right \}\), where:

**S**

_{ k }=[

*S*

_{ k,1}, …,

*S*

_{ k,P }]

^{ T }, \(\mathbf {N}_{k} =\left [N_{k}^{(1)},\; \ldots \;,N_{k}^{(R)}\right ]^{T}\), \(\mathbf {D}_{k} =\left [D_{k}^{(1)},\; \ldots \;,D_{k}^{(R)}\right ]^{T}\),

and \(H_{k,p}^{eq^{(r)}}=\alpha \xi _{p,r}H_{k,p}^{(r)}\).

## 3 Receiver design

^{b}. However, our results show that our iterative receiver is highly robust to the detection order, provided that the number of iterations is high enough. In fact, the main advantage of a proper detection order is that we typically can slightly reduce the number of the required iterations for best performance. For each iteration, we detect all MTs in a successive way, using the most updated estimates of the transmitted data symbols, associated with each MT to cancel the corresponding residual interference (see Figure 4). Therefore, our receiver can be regarded as an iterative successive interference cancelation (SIC) scheme. However, as with conventional IB-DFE receivers, we take into account the reliability of the data estimates associated with MTs (as well as interference cancelation) for each detection procedure.

The complexity of our receiver is essentially conditioned by the pair FFT/IFFT for each user and each iteration, as well as the need to solve a system of *R* equations, for every frequency of each user and each iteration.

*i*th iteration, the estimated symbols associated with the

*p*th MT \(\left \{\hat {s}_{n,p};n=0,1,\ldots,N-1\right \}\) are the hard decisions of the time-domain detector output \(\left \{\tilde {s}_{n,p};n=0,1,\ldots,N-1\right \}\) = IDFT \(\left \{\tilde {S}_{k,p};k=\right.\) \(\left.0,1,\ldots,N-1\vphantom {\tilde {S}_{k,p}}\right \}\), where \(\tilde {S}_{k,p}\) is given by

with \(\mathbf {F}_{k,p}^{T}=\left [F_{k,p}^{(1)},\; \ldots \;,F_{k,p}^{(R)}\right ]^{T}\) denoting the feedforward coefficients. \(\mathbf {B}_{k,p}^{T}=\left [B_{k,p}^{(1)},\; \ldots \;,B_{k,p}^{(P)}\right ]^{T}\) denotes the feedback coefficients and vector \(\bar {\mathbf {S}}_{k,p}\) is given by \(\bar {\bold {S}}_{k,p}=\left [\bar {S}_{k,1},\dots,\bar {S}_{k,p-1}, \bar {S}_{k,p},\dots,\bar {S}_{k,P}\right ]^{T}\), where block \(\left \{\bar {S}_{k,p};k=0,1,\ldots,N-1\right \}\) is the DFT of the block of time-domain average values conditioned to the detector output \(\left \{\bar {s}_{n,p};n=0,1,\ldots,N-1\right \}\), for user *p* at a given iteration. Clearly, the elements of \(\bar {\mathbf {S}}_{k,p'}\) are associated with the current iteration for the MTs already detected (*p*
^{′}<*p*) and associated with the previous iterations for the MT that is being detected, and also to the MTs still not detected in this iteration.

*s*

_{ n,p }=±1±

*j*, the average values \(\bar {s}_{n,p}\) are given by [28]:

This means that we replace the transmitted symbols by the hard decision estimates in the computation of the \(\sigma _{n,p}^{2}\), with its error being negligible for a low bit error rate (BER) [28]. The hard decisions associated with the symbol *s*
_{
n,p
} are \(\hat {s}_{n,p}=\text {sign}\left (\text {Re}\left \{\tilde {s}_{n,p}\right \}\right)+j\text {sign}\left (\text {Im}\left \{\tilde {s}_{n,p}\right \}\right)\).

*p*th MT, the receiver is characterized by coefficients

**F**

_{ k,p }and

**B**

_{ k,p }(

*k*=0,1,…,

*N*−1). These coefficients are selected to minimize the BER performance. For a QPSK constellation with Gray mapping, the BER is given by:

*Q*(

*x*) denotes the well known Gaussian error function and:

designating the mean squared error (MSE) on the frequency-domain samples \(\tilde {S}_{k,p}\) [29]. The processing of *Θ*
_{
k,p
} concerns the evaluation of the optimum values of coefficients **F**
_{
k,p
} and **B**
_{
k,p
}, and to do so, the minimization of *Θ*
_{
k,p
} is required.

**Δ**

_{ k,p }=[

*Δ*

_{ k,1},…,

*Δ*

_{ k,P }]

^{ T }, is a mean zero error vector for

*P*MTs, with its elements uncorrelated to

*S*

_{ k,p }and between them, meaning that \(\mathbb {E}\left [\left |\Delta _{k,p}\right |^{2}\right ]=\left (1-\left |\rho _{p}\right |^{2}\right)\mathbb {E}\left [\left |S_{k,p}\right |^{2}\right ]\). In matrix format, we have \(\bar {\mathbf {S}}_{k}\simeq {\mathbf {P}^{2}}\mathbf {S}_{k}+\mathbf {P}\boldsymbol {\Delta }_{k}\) and

**P**=

*d*

*i*

*a*

*g*(

*ρ*

_{1},…,

*ρ*

_{ P }), with correlation coefficients:

*i*th iteration. It can be shown that, for QPSK constellations, we have

*ρ*

_{ p }=1−2

*P*

_{ e }[30], which can be approximately given by:

*Θ*is given by:

*S*

_{ p }factor, were dropped from in (26) and following equations. The different correlation matrices of (26) are as follows:

with \(\mathbf {R}_{S}=\mathbb {E}\left [\mathbf {S}^{*}\mathbf {S}^{T}\right ]=2{\sigma _{S}^{2}}\mathbf {I}_{P}\) and \(\mathbf {R}_{N^{Tot}}=\mathbb {E}\left [\mathbf {N^{Tot}}^{*}\mathbf {N^{Tot}}^{T}\right ]=|\alpha |^{2}\mathbf {R}_{N}+\mathbf {R}_{D}\), being the correlation matrices of **S** and *N*
^{
T
o
t
}, respectively. \(\mathbf {R}_{N}=2{\sigma _{N}^{2}}\mathbf {I}_{R}\) and \(\mathbf {R}_{D}=2diag\left (\sigma _{D}^{(1)^{2}}, \sigma _{D}^{(2)^{2}}, \ldots, \sigma _{D}^{(R)^{2}}\right)\) are the correlations matrices for the channel noise and quantization noise, respectively, and \({\sigma _{S}^{2}}\) and \({\sigma _{N}^{2}}\) denote the symbol’s and noise’s variance, in the frequency domain, respectively.

*Θ*

_{ k,p }. In order to obtain the minimization of the MSE, we subject it to the condition

**F**

_{ k,p }and

**B**

_{ k,p }being the solution for the system of equations:

and *κ* selected to ensure that *γ*
_{
p
}=1, in order to have a normalized FDE with \(\mathbb {E}\left [\tilde {s}_{n,p}\right ]=s_{n,p}\).

It should be pointed out that when we ignore the quantization effects, \(\mathbf {R}_{N^{\text {Tot}}}=\mathbf {R}_{N}\) and *α*=1. In practice, \(\alpha \simeq 1-2Q\left (\frac {A_{M}}{\sigma _{y}^{(r)}}\right)\) [33], which means that for practical quantizers, *α*≃1 and using *α*=1 has a negligible impact on the receiver’s performance.

## 4 Performance results

*N*= 256 data symbols, selected from a QPSK constellation under a Gray mapping rule, plus an appropriate cyclic prefix. We considered a multipath channel with 64 symbol-spaced taps and uncorrelated Rayleigh fading on the different multipath components (similar results were observed for other channels with rich multipath propagation). The channels between different transmitting and receiving antennas are assumed uncorrelated. We have perfect synchronization and channel estimation. It is assumed that the useful part of the blocks transmitted by different MTs arrive at each BS simultaneously. In practice, this could be accomplished by employing extended cyclic prefixes, with duration longer than the maximum overall channel impulse response plus the difference between the maximum and minimum propagation delay between MTs and BSs, provided that we have accurate channel estimates. The real and imaginary parts of the complex envelope of the signals received by each BS are sampled and quantized by a uniform quantizer with 2

^{ m }levels (i.e.,

*m*bits) and sent to the central unit. Throughout this section, the theoretical results were obtained with the analytical MSE-based approach described in the previous section. Initially, a single-MT case (

*P*=1) is considered. Figure 5 illustrates the BER performance when we have a single BS, as in conventional point-to-point communications, and when we have two BSs (

*R*=2), as in a macro-diversity scenario. All the links considered between the MT and the BSs are characterized by

*ξ*

_{ p,r }=0 dB. From the corresponding results, it is clear that the proposed analytical approach is very precise, especially regarding the first iteration (linear FDE). When the subsequent iterations are considered, that is, when the Gaussian approximation is accurate, the difference between the simulated and analytical approaches vary only in a few tenths of dB. As expected, the BER performance improves with the number of iterations, and it is clearly better when there is a macro-diversity scenario (

*R*=2 BSs).

*P*=2 MTs and

*R*=2 BSs. The power associated with the different links

*ξ*

_{ p,r }can be characterized by the matrix:

The BER performance is excellent, with the corresponding values close to the MFB after four iterations, which means that the proposed receiver is able to efficiently separate the MTs while taking advantage of the signal contributions associated with a given MT at each BS. The simulated results are very accurate for the first MT that is detected, with a slight difference between analytical and simulated results, although this difference is always below 1 dB and most of the time even lower, proving right accuracy for our analytical approach.

*P*=

*R*=1) for iterations 1 and 4, respectively. Here, samples are quantized with

*m*=2, 3, 4, 5, and

*∞*bits, in which

*m*=

*∞*indicates that no quantization is performed. The power from link from the MT and the BS is

*ξ*=0 dB. In both figures, a conventional receiver is presented (denoted as ‘Conv. Rx’), where we do not take into account the characteristics of the quantization noise, and an optimized receiver (indicated as ‘Opt. Rx’), where the quantization noise is taken into account.

Clearly, with *m* above 4, the degradation due to quantization effects is negligible, and below 4, the performance degradation can be considerable. On the first iteration, the degradation considering the conventional receiver is higher, with a significant difference between performances even when *m*=4. Ultimately, for the fourth iteration, the main advantage in considering the optimum receiver is when the quantization is employed with low values of *m*, such as *m*=2 bits.

*m*=3 and 4 bits, Figures 10 and 11, respectively, show the simulated and its theoretical BER performance results.

As expected, for *m* high, the quantization effects are negligible, but for low values of *m*, we can have a significant performance degradation when we employ the conventional receivers. With the optimized receiver, we decrease this degradation. Finally, we can see a close match between our theoretical results and the results obtained by simulation, especially for the first iteration, that corresponds to the linear FDE.

*P*=2 MTs transmitting simultaneously to

*R*=2 BSs, the corresponding BER performance for the first MT, i.e., the MT that is first detected in our SIC-like iterative FDE, and second one, i.e., the MT that is detected in second place, are presented in Figures 12 and 13, respectively. All the links between the MTs and the BSs are characterized by

*ξ*

_{1,1}=

*ξ*

_{1,2}=

*ξ*

_{2,1}=

*ξ*

_{2,2}=−3 dB.

We considered quantizers with *m*=3 and *m*=4 bits for the real and imaginary parts of the complex envelope samples and the receiver is always designed taking into account the quantization effects. From these figures, it is clear that the proposed receiver is able to separate the MTs. Although the performance for the first MT is significantly worse at the first iteration, the difference between MTs becomes negligible after four iterations, and the resulting performance is already close to the MFB. The degradation due to quantization is slightly higher for this case, especially for the first iteration. Once again, there is a close match between theoretical and simulated results, although the difference is higher than for the case where *P*=1, especially at the fourth iteration. However, the difference is always below 0.5 dB, so our analytical approach is relatively accurate.

*P*=2 MTs and

*R*=2 BSs, in which users are not perfectly symmetric and there is not a perfect average power control. Figures 14 and 15 show the simulated and its theoretical BER performance for the first MT and the second MT, respectively. In both figures, the first and fourth iterations are depicted. The power associated to the different links is given by:

where the samples are quantized considering an optimized receiver with *m*=4 bits.

This could be regarded as a scenario where one user is between two BSs and the other is closer to one BS.

*P*=3 MTs transmitting to

*R*=3 receiving BSs with all links characterized by

*ξ*

_{ p,r }=−4.77 dB (i.e., 1/3 in linear units), which can be regarded as the case where the MTs are approximately in the intersection of the three cells. The corresponding performance results are depicted in Figure 16.

Clearly, we can still separate the three MTs. Similar results were observed for other values of *P*=*R*.

As a final remark, we would like to point out that (35) assumes perfect average power control. Our simulations indicate that we are still able to separate the users when we do not have power control, i.e., the total received power for distinct users is substantially different.

## 5 Conclusions

In this paper, we considered the receiver design for the uplink transmission in BS cooperation schemes employing SC-FDE signals. Here, the received signals at a certain BS are sampled and have the option of being quantized, with the corresponding bits being transmitted to a central unit that performs the user detection and/or separation using iterative frequency-domain receivers. Also, in this paper, we developed and presented an analytical approach for obtaining the performance of the proposed receivers.

The presented performance results demonstrated that the proposed receivers allow significant macro-diversity gains, as well as an efficient user separation. It is shown that we can have excellent performances using only 4 bits to quantize the real and imaginary parts of the complex envelope of the received signal at the BS, with a performance close to the MFB, and although relatively simple, our analytical approach was shown to be quite accurate. Hence, these techniques are presented as an excellent approach for future broadband wireless systems employing BS cooperation schemes.

## 6 Endnotes

^{a}For the sake of simplicity, we will describe only the case where the signals associated with each BS are quantized. The extension for the case where the central unit is placed in a given BS, and we only need to quantize and transmit through the backhaul the signal from the other BS which is straightforward.

^{b}Actually, the users should be ordered according to the signal-to-noise plus overall interference ratio (including residual inter-symbol interference (ISI) and residual inter-user interference) at the FDE output, but usually, there is strong correlation between this value and the overall power associated with that MT.

## 7 Appendix

*x*

^{ Q }=

*α*

*x*+

*d*, where

*d*is uncorrelated with

*x*, and:

with *f*
_{
Q
} denoting the quantization characteristic associated with the real and imaginary parts of *x*.

where \({\sigma _{d}^{2}}=\sigma _{x^{Q}}^{2}-|\alpha |^{2}\) that is obtained from (37) and (38).

## Declarations

### Acknowledgements

The authors would like to thank the anonymous reviewers for their values comments which helped improve the paper. This work was partially supported by the FCT (Fundação para a Ciência e a Tecnologia) under projects PEst-OE/EEI/LA0008/2013, HETCOP, ADIN (PTDC/EEI- TEL/2990/2012), CoPWIN (PTDC/EEI- TEL/1417/2012) and grant SFRH/BD/87524/2012.

## Authors’ Affiliations

## References

- M Dohler, RW Heath, A Lozano, CB Papadias, RA Valenzuela, Is the PHY layer dead?IEEE Commun. Mag. 49(4), 159–165 (2011).View ArticleGoogle Scholar
- C Shannon, A Mathematical theory of communication. Bell Syst. Tech. J. 27, 379–423623656 (1948).View ArticleMATHMathSciNetGoogle Scholar
- D Gesbert, S Hanly, H Huang, S Shamai Shitz, O Simeone, W Yu, Multi-cell MIMO cooperative networks: a new look at interference. IEEE J. Select. Areas Commun. 28(9), 1380–1408 (2010).View ArticleGoogle Scholar
- J Zhang, R Chen, JG Andrews, A Ghosh, RW Heath, Networked MIMO with clustered linear precoding. Wireless Commun. IEEE Trans. 8(4), 1910–1921 (2009).View ArticleGoogle Scholar
- M Sawahashi, Y Kishiyama, A Morimoto, D Nishikawa, M Tanno, Coordinated multipoint transmission/reception techniques for LTE-advanced [coordinated and distributed MIMO]. Wireless Commun. IEEE. 17(3), 26–34 (2010).View ArticleGoogle Scholar
- X-H You, D-M Wang, B Sheng, X-Q Gao, X-S Zhao, M Chen, Cooperative distributed antenna systems for mobile communications [coordinated and distributed MIMO]. Wireless Commun. IEEE. 17(3), 35–43 (2010).View ArticleGoogle Scholar
- H-H Choi, On the degrees of freedom of interference alignment for multicell MIMO interfering broadcast channels. Sci. World J. 2014, 1–8 (2014).Google Scholar
- 3GPP Long Term Evolution. http://www.3gpp.org/LTE.
- FC Ribeiro, R Dinis, F Cercas, A Silva, in Computer Communications and Networks (ICCCN) 2012 21st International Conference On. Iterative frequency-domain receivers for the uplink of cellular systems with base station cooperation (Munich, Germany, 2012).Google Scholar
- O Somekh, BM Zaidel, S Shamai, Sum rate characterization of joint multiple cell-site processing. IEEE Trans. Inform. Theory. 53(12), 4473–4497 (2007).View ArticleMATHMathSciNetGoogle Scholar
- E Bjoĺ andrnson, R Zakhour, D Gesbert, B Ottersten, Cooperative multicell precoding: rate region characterization and distributed strategies with instantaneous and statistical CSI. IEEE Trans. Signal Process. 58(8), 4298–4310 (2010).View ArticleMathSciNetGoogle Scholar
- A Silva, R Holakouei, D Castanheira, A Gameiro, R Dinis, A novel distributed power allocation scheme for coordinated multicell systems. J. Wireless Commun. Netw. EURASIP. 30, 1–11 (2013).Google Scholar
- LJ Cimini, Analysis and simulation of a digital mobile channel using orthogonal frequency division multiplexing. Commun. IEEE Trans. 33(7), 665–675 (1985).View ArticleGoogle Scholar
- H Sari, G Karam, I Jeanclaude, in Vehicular Technology Conference, 1994 IEEE 44th. An analysis of orthogonal frequency-division multiplexing for mobile radio applications (Stockholm, Sweden, 1994), pp. 1635–16393.Google Scholar
- A Gusmao, R Dinis, J Conceicao, N Esteves, in Vehicular Technology Conference Proceedings, 2000. VTC 2000-Spring Tokyo 2000 IEEE 51st, 2. Comparison of two modulation choices for broadband wireless communications (Tokyo, Japan, 2000), pp. 1300–13052.Google Scholar
- D Falconer, SL Ariyavisitakul, A Benyamin-Seeyar, B Eidson, Frequency domain equalization for single-carrier broadband wireless systems. IEEE Commun. Mag. 40(4), 58–66 (2002).View ArticleGoogle Scholar
- R Kalbasi, R Dinis, D Falconer, A Banihashemi, in Acoustics, Speech, and Signal Processing, 2004. Proceedings. (ICASSP ’04). IEEE International Conference On, 4. An iterative frequency-domain layered space-time receiver for SDMA systems with single-carrier transmission (Montreal, Canada, 2004), pp. 793–7964.Google Scholar
- R Dinis, R Kalbasi, D Falconer, AH Banihashemi, Iterative layered space-time receivers for single-carrier transmission over severe time-dispersive channels. IEEE Commun. Lett. 8(9), 579–581 (2004).View ArticleGoogle Scholar
- N Benvenuto, R Dinis, D Falconer, S Tomasin, Single carrier modulation with nonlinear frequency domain equalization: an idea whose time has come again. Proc. IEEE. 98(1), 69–96 (2010).View ArticleGoogle Scholar
- M Tüchler, R Koetter, AC Singer, Turbo equalization: principles and new results. IEEE Trans. Commun. 50(5), 754–767 (2002).View ArticleGoogle Scholar
- M Tüchler, J Hagenauer, in Allerton Conf. Turbo equalization using frequency domain equalizers (Monticello, USA, 2000).Google Scholar
- M Tüchler, J Hagenauer, in IEEE Vehicular Technology Conference, 2001. VTC 2001 Fall, 4. Linear time and frequency domain turbo equalization, (2001), pp. 2773–2777.Google Scholar
- N Benvenuto, S Tomasin, Iterative design and detection of a DFE in the frequency domain. IEEE Trans. Commun. 53(11), 1867–1875 (2005).View ArticleGoogle Scholar
- C-T Lam, DD Falconer, F Danilo-Lemoine, R Dinis, in Vehicular Technology Conference, 2006. VTC-2006 Fall 2006 IEEE 64th. Channel estimation for SC-FDE systems using frequency domain multiplexed pilots (Montreal, Canada, 2006), pp. 1–5.Google Scholar
- F Coelho, R Dinis, P Montezuma, in Military communications conference, 2010 - MILCOM 2010. Joint detection and channel estimation for block transmission schemes, (2010), pp. 1765–1770. doi:10.1109/MILCOM.2010.5680240.Google Scholar
- F Coelho, R Dinis, P Montezuma, in Vehicular Technology Conference (VTC Fall) 2011, IEEE. Efficient channel estimation for single frequency broadcast systems (San Francisco, USA, 2011), pp. 1–6.Google Scholar
- N Souto, R Dinis, JC Silva, Impact of channel estimation errors on SC-FDE systems. Commun. IEEE Trans. 62(5), 1530–1540 (2014).View ArticleGoogle Scholar
- F Silva, R Dinis, PM Montezuma, Estimation of the feedback reliability for IB-DFE receivers. ISRN Commun. Netw. J. 2011, 1–7 (2011).View ArticleGoogle Scholar
- FC Ribeiro, R Dinis, F Cercas, A Silva, in Globecom Workshops (GC Wkshps) 2012 IEEE. Analytical performance evaluation of Base Station cooperation systems using SC-FDE modulations with iterative receivers (Anaheim, USA, 2012), pp. 637–641.Google Scholar
- A Gusmao, P Torres, R Dinis, N Esteves, A turbo FDE technique for reduced-CP SC-based block transmission systems. IEEE Trans. Commun. 55(1), 16–20 (2007).View ArticleGoogle Scholar
- A Gusmao, P Torres, R Dinis, N Esteves, in Turbo Codes Related Topics; 6th International ITG-Conference on Source and Channel Coding (TURBOCODING), 2006 4th International Symposium On. A class of iterative FDE techniques for reduced-CP SC-based block transmission (Munich, Germany, 2006), pp. 1–6.Google Scholar
- R Dinis, N Esteves, in Proc. Wireless. On broadband block transmission over strongly frequency-selective fading channels (Calgary, Canada, 2003).Google Scholar
- T Araujo, R Dinis, Performance evaluation of quantization effects on multicarrier modulated signals. IEEE Trans. Vehic. Technol. 56(5), 2922–2930 (2007).View ArticleGoogle Scholar
- HE Rowe, Memoryless nonlinearities with Gaussian inputs: elementary results. Bell Syst. Tech. J. 61(7), 1519–1525 (1982).View ArticleGoogle Scholar

## Copyright

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