Open Access

Performance evaluation of time-multiplexed and data-dependent superimposed training based transmission with practical power amplifier model

EURASIP Journal on Wireless Communications and Networking20122012:49

Received: 11 May 2011

Accepted: 16 February 2012

Published: 16 February 2012


The increase in the peak-to-average power ratio (PAPR) is a well known but not sufficiently addressed problem with data-dependent superimposed training (DDST) based approaches for channel estimation and synchronization in digital communication links. In this article, we concentrate on the PAPR analysis with DDST and on the spectral regrowth with a nonlinear amplifier. In addition, a novel Gaussian distribution model based on the multinomial distribution for the cyclic mean component is presented. We propose the use of a symbol level amplitude limiter in the transmitter together with a modified channel estimator and iterative data bit estimator in the receiver. We show that this setup efficiently reduces the regrowth with the DDST. In the end, spectral efficiency comparison between time domain multiplexed training and DDST with or without symbol level limiter is provided. The results indicate improved performance for DDST based approaches with relaxed transmitter power amplifier requirements.


channel estimation data-dependent superimposed pilots iterative receiver nonlinear power amplifier peak-to-average power ratio spectral efficiency.

1 Introduction

Channel estimation and equalization are crucial parts of modern digital transmission links. As we aim for higher spectral efficiencies, the number of time instances allocated for training in the traditional time-domain multiplexed training (TDMT) systems should be minimized. At the moment, the superimposed (SI) scheme is a serious candidate for circumventing this issue, see for example [13] and references therein. SI pilots are added directly on top of the user data, and thus all time instances over the whole allocated spectral region contain user information. The downside is that the user information interferes greatly with the pilot sequence, increasing the mean squared error (MSE) of the initial channel estimates. Furthermore, the peak-to-average power ratio (PAPR) is considerably increased and the user-data-symbol-to-interference power ratio is decreased in detection.

To overcome this problem of self-interference (interference from the user data symbols in channel estimation), a data-dependent superimposed training (DDST) scheme was presented in [4, 5]. The basic idea is very simple. Because the cyclic pilot sequence has its energy concentrated on certain frequency bins, we set the user data frequency response to zero on these frequency bins. This is equivalent to removing the cyclic mean of the user data symbol sequence in the time domain. Therefore, there is no interference from the user data to the pilot symbols. Because the interference from the user data symbols is removed, DDST requires clearly lower pilot powers than traditional SI training to obtain the desired channel estimation MSE levels. This can also be seen as frequency-domain multiplexed (FDM) pilot based training, but the difference to the traditional approach is that the signal spectrum is not widened because of the used SI training symbols. With multicarrier systems, spectral nulling means that we lose some subcarriers for pilot symbols. Recently, a solution to circumvent this problem in multicarrier communications by the so called symbol blanking method was proposed in [6].

The DDST is suitable especially for wide-band single-carrier (SC) systems. The problem to be addressed in this article regarding the addition of DDST sequences is the increased peak power (PP) and PAPR, which violates one of the main benefits of using SC transmission. With increased PAPR we can expect increased spectral regrowth with nonlinear amplifiers, which are preferred in the mobile devices because of their higher efficiency. Based on the authors best knowledge, the effects of increased PP or PAPR on the spectral regrowth have not been taken into account in the recent literature in the performance comparisons between DDST and TDMT systems. More traditional SI-based training was studied in [7], where the frequency bins were in some cases nulled for improved channel estimation performance. The PAPR problem was discussed without any solutions to decrease the PAPR created by the SI pilots. We will address this problem by simply limiting the peak amplitudes at the symbol level before transmission. From now on, this symbol level amplitude limited DDST is denoted as LDDST.

In the receiver side, we have a simple feedback loop based on soft symbol estimates, which we use to estimate the missing cyclic mean and the limited amplitudes. In [8], we studied the symbol level PAPR and used an iterative receiver structure without any knowledge of the error generated by the symbol level amplitude limiter in the transmitter. In this article we will utilize the scaling information available based on Gaussian modeling of the data-dependent pilot sequence (cyclic mean) in the channel estimator.

This article is structured as follows. First we present the system model in Section 2. Then, in Section 3 we model the error caused by the symbol level limiter in the transmitted signal. Next, in Section 4 we briefly discuss the modifications used in the channel estimation algorithms because of the symbol level limiter. In Section 5, we concentrate on the symbol level PP and PAPR, on the PP and PAPR after the transmit pulse shape filtering, and show that the symbol level limiter can remove the PP increase and effectively reduce the PAPR. In addition, we discuss the spectral re-growth related to different training methods. In the Section 6, we provide improved iterative receiver algorithms taking into consideration the amplitude limiter in the transmitter and the removal of the data dependent pilots. Next, in Section 7, the throughput performance comparison of DDST and TDMT training based systems is provided. Finally, in Section 8, conclusions are provided.

Notation: Superscripts T and H denote the transpose and Hermitian transpose operators, refers to the Kronecker product and o defines a continuous-time convolution. For complex numbers |z| defines the absolute value of z and · gives the argument of a complex number. In addition, Re(z) takes the real value of a complex number and Im(z) takes the imaginary value. Exponential function is noted by exp(·) and z defines the Euclidean vector norm. The trace and statistical expectations are denoted by tr[·] and E[·]. Rounding to the largest integer not greater than x is given by the floor function x. The (N × N) identity matrix is denoted by I N and the (N × M) matrix of all ones by 1N × M. For oversampling, we define a column vector r with first element equal to one and i - 1 zeros after the first element, e.g., r = [1,0,...,0] T . We denote the length of this vector with r, which will represent the oversampling rate used in the receiver. Matrices are denoted by boldface uppercase letters and vectors by boldface lowercase letters. Finally, diag(a) = diag(a1,...,a n ) is an (N × N) diagonal matrix whose n th entry is a n and diag(A) is a(N × 1) vector with values from the main diagonal of A, which isa(N × N) square matrix.

2 System model

Our system design originates from the uplink assumption. Thus, the complexity of the transmitting end is kept as small as possible and most of the complexity is positioned to the receiving end. The block level design of the transmitter is given in Figure 1. The transmitter contains a bit source, channel encoder, interleaver (represented by π function), symbol mapper, pilot insertion, symbol level amplitude limiter, L(·), the transmitter pulse shape filter and nonlinear amplifier, G(·).
Figure 1

Transmitter model with LDDST and nonlinear SSPA model. The symbol level amplitude limiter function is presented as L(·) and the nonlinear SSPA is presented as G(·). Also, we have used notion π for the interleaving function.

Let us assume that our symbol mapper produces a vector of data symbols d from some finite alphabet A N , where N is the frame (vector) length. We will use a pilot sequence, p, which has length N p . The pilot sequence is an optimal channel independent (OCI) sequence that was defined in [2], and rewritten here as
p ( k ) = σ p e j π N p [ k ( k + v ) ] ,
where k = 0,...,N p - 1, v = 1 if N p is odd and v = 2 if N p is even number. In addition, we assume that our frame length is an integer multiple of N p , given as N = N c N p , where N c is the number of cyclic copies per frame. With the DDST, we first remove the cyclic mean of the data vector. As shown in [4], this can be expressed as
z = ( I - J T x ) d ,

where J T x = ( 1 / N c ) 1 N c × N c I N p . Now the data dependent pilot sequence is given as p d = -J Tx d. The data dependent pilot sequence is added on top of the data sequence in order to remove the cyclic mean of the data sequence, thus removing the interference caused by data sequence on the known pilot sequence. The symbol sequence including user data symbols, data dependent pilot sequence and the cyclic pilot sequence is given as s = d + p d + p c = z + p c , where the cyclic pilot sequence is defined as p c = 1 N c × 1 p . For a more detailed explanation on DDST, see for example [9] and references therein. The symbol sequence, s, is then inserted to the peak amplitude limiter from which the limited signal s is then obtained. This sequence is then oversampled with rate r, given as s r = r s r , and inserted to the transmit pulse shape filter to obtain transmitted sequence x. We define the power of the data sequence to be σ d 2 = 1 - γ and the power of the known pilot sequence to be σ p c 2 = γ , where γ is the pilot power allocation factor.

The peak amplitude limiter is presented by a function L(·), which takes as the maximum allowed amplitude value, amax, the maximum amplitude value of the used constellation A , defined as { a max = max ( ( d ) ) , d A , σ d 2 = 1 } . We use this value because we wanted to achieve similar type of PAPR behavior as with TDMT and that the limiter affects mainly pilot sequences added on top of the user data. The limited symbol sequence can be defined as
s ( k ) = L ( s ( k ) ) = s ( k ) , if s ( k ) a max , a max exp ( j s ( k ) ) , if s ( k ) > a max .

Now we have an amplitude limited symbol sequence whose PP is limited to the same value as the original data symbol sequence d. The average power decrease, and the remaining PAPR increase, depends on the constellation. This kind of amplitude limiter, which keeps the argument difference between input and output as a constant, realizes so-called amplitude-modulation to amplitude-modulation (AM-AM) conversion [10], meaning that |L(s(k))| depends only on |s(k)|.

We have chosen to study the hard limiting of the transmitted symbols, but of course other limiters with different input-output mappings require more studies. Furthermore, we have chosen to study symbol level limiting instead of limiting the output of the Tx pulse shape filter, which is a more common approach for controlling the PAPR in SC transmission. From the literature concerning studies on PAPR with OFDM modulation, one can find several possible topics of study in order to reduce PAPR in DDST with a modified data-dependent pilot sequence, and these are left for future studies.

Let us define an error vector e limiter = s - s , which contains the information removed by the limiter from the sequence s. It represents an additive error sequence generated by the limiter. This model is used when we present the receiver feedback structure in Section 7.

The signal after the symbol level limiter, s , is then fed to the transmit pulse shape filter after over-sampling. We have used traditional root-raised-cosine (RRC) filtering with rolloff factor ρ = 0.1 and filter order NRRC = 64. We have chosen two different scenarios for simulations. For the PAPR and spectral leakage simulations we have used four times oversampling, r = 4, and for the performance evaluations we have used two times oversampling, r = 2. We have chosen this setup for better understanding of the spectral spreading and because the used filter bank (FB) based equalizer is designed to work with two times oversampled sequences.

The nonlinear power amplifier model is a widely-used basic model, based on solid-state power amplifier (SSPA) model by Rapp [11]. The AM-to-AM conversion function for an input amplitude A is given as
G ( A ) = v A 1 + v A A 0 2 p - 2 p ,

where v is the small signal amplification, A0 is the saturation amplitude of the amplifier and p defines the smoothness of the transition from linear region to the limiter region. The actual values chosen for the simulations are discussed in more detail in Section 7.

Based on Bussgang's theorem [12], we model the output of the power amplifier as G ( x ) = α P AVG x + n G , where α is a scaling factor for the input signal, PAVG is the average power of the transmitted frame, and n G is uncorrelated Gaussian noise vector caused by the nonlinear power amplifier G(·). PAvg is used to scale the average power of the transmitted frame in order to stay inside the spectral mask to be defined in Section 5. The Bussgang's theorem is based on Gaussian variables, but it's results are widely used, e.g., in PAPR modeling for orthogonal frequency domain multiplexing (OFDM) systems. Also in our case, the signals are not purely Gaussian, but after the pulse shape filter they are Gaussian like and we can apply Bussgang's theorem to model the non-linear limiting caused by the power amplifier model.

We have assumed a discontinuous block wise transmission where the channel is assumed to be time invariant during the transmission time of one frame. The used channel model is a modified ITU-R Vehicular A channel [13].

In Figure 2, we have presented a block diagram of our multiantenna receiver. We have extended the model provided in [4] to our SC model with FB-based frequency-domain equalizer structure, presented in [14]. The analysis FB converts the time domain signal to the frequency domain (similar to the well known DFT operation) and the synthesis FB converts the frequency domain presentation back to time domain (similar to the IDFT operation). The channel estimates are obtained in time domain after which the sub-channel wise equalization (SCE) is performed in the frequency domain with 3-tap complex FIR filter for each sub-channel. The equalizers for each diversity branch are designed based on the maximum ratio combining (MRC) criteria, presented in [15]. The channel estimates could also be obtained in the frequency domain and after suitable interpolation with DDST they could be directly used for defining the SCE equalizer tap values for each sub-channel. The FB-based receiver structure is used because it does not require a cyclic prefix (improved throughput), provides close to ideal linear equalizer performance, has good spectral containment properties (adjacent channel suppression is clearly better than with DFT based solutions) and is equally applicable also to SC-FDMA (DFT-S-OFDMA) as used in 3GPP-LTE uplink.
Figure 2

Receiver model using multiantenna reception with maximum ratio combining and iterative user data bit estimation with DDST based channel estimation.

We assume perfect synchronization in frequency and time domain and ideal down conversion of the received signal in the Rx block. Several studies on DDST suitability for time and frequency synchronization have been performed, e.g., [16, 17], where it has been shown that DDST is also a viable solution for low SNR synchronization. We can present the channel between transmitter and receiver as an r times oversampled discrete-time equivalent channel, heq(n) = |hRRC(t) hchannel(t) hRRC(t)|t=nT/r= |hRRC hchannel+RRC|t=nT/r. The n th received sample y i (n) from the i th antenna can be given as
y i ( n ) = α P AVG m = 0 M - 1 h eq , i ( m ) s r ( n - m ) + k = 0 K - 1 h channel + RRC , 1 ( k ) n G ( n - k ) + l = 0 L - 1 h RRC ( l ) w i ( n - l ) ,

where M is the channel length in samples, n is the time index for r times oversampled symbol sequence, n G (n) is a noise term caused by the nonlinear amplifier, and s r ( n ) is a possibly limited, oversampled transmitted symbol, which is zero if n < 0 or n > rN - 1. The noise term w i (n) is complex additive white Gaussian noise (AWGN). Because of the r times oversampling, in our case s(k) = d(k) = p d (k) = p c (k) = 0 when k modulus r ≠ 0. The channel estimation procedures are simply repeated for each diversity branch. For this reason and for the sake of clarity, we drop out the antenna index i.

We can now rewrite the received discrete-time signal in the matrix notation as
y = α P AVG S r h eq + N G h channel + RRC + W h RRC ,

where the matrix S r = D r + P d , r + P c , r + E limiter , r is built from the oversampled user data symbols, data dependent pilot sequence, known cyclic pilot sequence and the additional error generated by the symbol level limiter (only with LDDST), respectively. Here N G and W are the matrix presentations of the amplifier induced and channel induced noise terms, respectively.

Because we assume a discontinuous block-wise transmission, all matrices D r , Pd,r, Pc,rand Elimiter,rhave the form
B = b 0 0 0 0 b 1 b 0 0 0 b r N p - 1 b r N p - 2 b 1 b 0 b r N - 1 b r N - 2 b r N - r N p + 1 b N - r N p 0 0 0 b r N - 1 0 0 0 0 ,
including the zeros before and after the transmitted frame. Note that the oversampled matrices D r , Pd,r, Pc,r, Elimiter,rare now of dimension (rN + rN p × rN p ) and that we have assumed that M = rN p . This means that in the receiver we have to do the cyclic mean calculation over N c + 1 copies. Thus, the cyclic mean of the received sequence is given as
m ^ y = J R x y = α P AVG [ P r + M ^ e limiter , r ] h eq + M ^ n G h channel + RRC + M ^ w h RRC ,
where J R x = ( 1 / N c ) 1 1 × N c + 1 I r N p . In our notation, for any vector b, the cyclic mean vector is defined as m ^ b = J R x b = [ m ^ b ( 0 ) m ^ b ( 1 ) m ^ b ( r N p - 1 ) ] T , and for any matrix B, the cyclic mean matrix is defined as
M ^ b = J R x B = m ^ b ( 0 ) m ^ b ( r N p - 1 ) m ^ b ( 2 ) m ^ b ( 1 ) m ^ b ( 1 ) m ^ b ( 0 ) m ^ b ( 3 ) m ^ b ( 2 ) m ^ b ( r N p - 1 ) m ^ b ( r N p - 2 ) m ^ b ( 1 ) m ^ b ( 0 ) .

For example, if you set b = elimiter,r, then M ^ e limiter , r is a cyclic matrix having m ^ e limiter , r as the first column. The pilot matrix P r is a cyclic matrix, having the r times oversampled OCI pilot sequence p r = r p r as its first column.

From the receiver frontend, the oversampled signal is provided for the channel estimator and for the analysis FB. After obtaining a channel estimate, SCE is performed in the frequency domain. More details on the equalizer structure can be found from [14, 18], and references therein. After the SCE, different antenna branches are added together sub-channel wise according to the MRC principle. The composite sub-channels are then recombined in the synthesis FB, which also efficiently realizes the sampling rate reduction by 2.

After the synthesis FB, we have the Pilot removal and information symbol power normalization block. Inside this block, the received sequence power is normalized to σ s ̃ ^ 2 = 1 + σ w 2 h RRC 2 , which corresponds to the total received power. We have assumed that we exactly know the noise variance in the receiver. Next, we scale the power based on the pilot power allocation and remove the cyclic mean of the received sequence. If we use LDDST, we normalize the sequence based on our estimate on the average transmit power σ s 2 , to be defined in (18), to obtain an estimate for the distorted data sequence,
z ̃ ^ = σ s ( I - J ) 1 1 - γ 1 + σ w 2 h RRC 2 σ s ̃ ^ 2 s ̃ ^ .

Here z ̃ ^ is an estimate for z with cyclic mean set to zero and including the limiter error. Note that the cyclic mean of the limiter error is also zero.

Next, we have the Iterative data bit estimation block, where we iteratively obtain the data bit estimates. The procedures performed inside this block are described in detail in Section 6. Finally, the bit estimates are collected for bit error rate (BER) and block error rate (BLER) evaluations. The concept of (data) block in our system will be described in more detail in Section 7.

3 Symbol level limiter error modeling

Even though the earlier discussion assumed that the error caused by the symbol level limiter is purely additive, we will adopt an another model for the channel estimator modifications. In this Section, we will assume that symbol level amplitude limiter will only affect the data dependent pilot sequence, p d , and cyclic pilot sequence, p c . We model the effects by a common scaling factor and added noise. We refer to this model as the double-scaling model. We start by rewriting the limited symbol sequence as
s = L ( s ) = d + β ( p d + p c ) + n L .

Here the additive noise component caused by the limiter, n L , is assumed to be uncorrelated with p d and p c , and it is assumed to have complex Gaussian distribution. This model is a rough approximation of the phenomena that take place in the symbol level limiter, but based on our experience it provides sufficient accuracy for the channel estimator. The main difficulty in the modeling is to incorporate the effect of the limiter on the random data-dependent pilot sequence. We have tried several models, but they all have similar or worse accuracy than the Gaussian model we are going to present here, so we chose it because of its simplicity.

We can rewrite the purely additive limiter error given in the previous Section as e limiter = s - s = ( β - 1 ) ( p d + p c ) + n L . The cyclic mean of the received sequence can now be rewritten as
m ^ y = J R x y = J R x α P AVG ( D r + β ( P d , r + P c , r ) + N L , r ) h eq + N G h channel + RRC + W h RRC = α P AVG ( β P r + ( β - 1 ) M ^ d , r + M ^ n L , r ) h eq + M ^ n G h channel + RRC + M ^ w h RRC .
Because we have assumed that the limiter would affect only the pilot sequences, we have to define new methods for approximating these scaling parameters. We approximate β by generating a symbol vector consisting of all possible data symbol and pilot symbol combinations, defined as s comb,1 = ( 1 - γ ) d l + γ p l = 1 N p × 1 d + p 1 2 Q × 1 , where d is a vector containing all possible symbols, p is the OCI pilot sequence and Q is the number of bits per symbol. Next, we run this test sequence through the limiter and approximate the scaling factor as
β = p l H L ( s comb , 1 ) p l H p l ,

where we basically calculate a correlation based weighting factor for the extended pilot sequence, p l . We use this same weighting factor for data dependent pilot sequence because it undergoes similar effects in the symbol level amplitude limiter.

Now the difficult question is, how can we approximate σ e limiter 2 = E [ s - s 2 ] . First we have to somehow model the distribution of the cyclic mean of the transmitted sequence. The probability of a certain combination of N c symbols follows the multinomial distribution
p ( x 1 , x 2 , , x k ; n , p 1 , p 2 , , p k ) = n ! x 1 ! x 2 ! x k ! p 1 x 1 p 2 x 2 p k x k , when i = 1 k x i = n 0 otherwise ,
where x i is the number of observations of a certain constellation point on a real or imaginary axis, p i is the probability of that constellation point and in our case n = N c is the number of realizations in total per cyclic mean value. Here k is the number of constellation points per real or imaginary axis and takes the value of 2, 4 or 6 for QPSK, 16-QAM and 64-QAM, respectively. In this case, because all symbols are equally probable, p i = 1/k for all i. To get the true probability of a certain cyclic mean value, one has to add together all the probabilities of different combinations leading to that specific cyclic mean value. With high number of cyclic copies, the distribution of the cyclic mean value tends toward the Gaussian distribution, as expected based on the central limit theorem. For this reason, we have chosen to model the data dependent pilot sequence p d with a continuous complex Gaussian distribution n p d N ( 0 , σ p d 2 ) , where σ p d 2 = E [ p d 2 ] = σ d 2 / N c , is the expected power of the data-dependent pilot sequence. In Figure 3, we have shown the true distribution of the real part of the cyclic mean component of QPSK constellation based on the multinomial distribution (which in this case is actually binomial), its Gaussian approximation and the error between these two models. The Gaussian approximation is a good compromise for modeling purposes.
Figure 3

Example of the true distribution of the cyclic mean component based on the multinomial distribution for real part of the QPSK constellation and its Gaussian approximation with N c = 80 and γ = 0.1.

In order to approximate σ e limiter 2 , let us first define another symbol vector consisting of all possible data symbol and pilot symbol combinations, defined as s comb , 2 = ( 1 - 1 / N c ) ( 1 - γ ) d l + γ p l , where the power scaling factor 1 - 1 / N c is used to ensure that the total probability over the grid model, after adding Gaussian noise modeling the cyclic mean, equals to unity. Next, we add together probability grids, in which the different grids are based on the Gaussian distribution of n pd centered on a certain point of vector scomb,2. The overall distribution can be given as
P ( probability of symbols s comb at point x , y ) = P ( s comb , x , y ) = ste p 2 2 Q N p k = 1 2 Q N p 1 / π σ p d 2 exp { 1 / σ p d 2 [ ( Re ( s comb , 2 ( k ) ) - x ) 2 + ( Im ( s comb , 2 ( k ) ) - y ) 2 ] } ,

where x and y present the real and imaginary axes, respectively, in a grid with values from -2 to 2. The step size used for real and imaginary axis for calculating the probabilities of cyclic mean values from the Gaussian distribution is determined by the constellation, power normalization, pilot power allocation factor and the number of cycles used in the cyclic mean calculation. For example, if we are using 16-QAM constellation with γ = 0.05 and have N c = 80 cycles, the step size used is step = 2 1 - 0 . 05 / ( 80 10 ) , where 10 is the power normalization factor to set 16-QAM constellation average power to unity. This step now corresponds to the smallest change in the cyclic mean over possible symbols in real or imaginary axis and directly provides us a model for the discrete distribution of the cyclic mean with the defined parameters.

In Figure 4, we show as an example the generated grid model for QPSK constellation with pilot power allocation factor γ = 0.1 and number of cyclic means N c = 80 after the limiter function. With QPSK the constellation power normalization factor is one, thus the step size is step = 2 0 . 9 / 80 .
Figure 4

Example of the grid presentation for the probability distribution after the limiter function with QPSK modulation, cyclic OCI training sequence, and approximated Gaussian distributions used to define σ e limiter 2 with parameter values N c = 75 and γ = 0.1.

If we define g ( x , y ) = x 2 + y 2 as a vectorized function of the distances of grid points (x, y) from the origo, we can approximate σ e limiter 2 , given as
σ e limiter 2 = x , y g ( x , y ) - L ( g ( x , y ) ) 2 P ( s comb , x , y ) .

We will use the σ e limiter 2 value in the ML-LMMSE channel estimator to incorporate a priori knowledge of the symbol limiter based error term.

If we now assume that p c , p d , and nlimiter are uncorrelated, we can obtain the power of the limiter error with double-scaling model to be
σ n L 2 = σ e limiter 2 - ( β - 1 ) 2 ( σ p d 2 - σ p 2 ) = σ e limiter 2 - ( β - 1 ) 2 ( σ d 2 / N c - σ p 2 ) .
By using the same grid model, we can obtain our estimate of the average power of the limited symbol sequence σ s 2 = E [ s 2 ] , as
σ s 2 = x , y L ( g ( x , y ) ) 2 P ( s comb , x , y ) .

Here, the average power of the amplitude limited signal and the limiter error power could also be estimated by Bussgang's method [12]. However, based on our simulations, the developed model gives similar estimates and is simpler because it does not require averaging simulations for the framewise correlation calculations. Thus, it provides an alternative approach to define these parameters.

4 Channel estimation with LDDST

In this Section, we will provide the used channel estimator for LDDST. When defining the LMMSE channel estimator, we want to minimize the expected value of the squared error, E{|ĥ - h|2}. If we now make the assumptions that the noise and the total interference experienced by the pilot sequence is AWGN, channel taps are i.i.d. and have zero mean, i.e., E{h} = 0, the LMMSE estimator can be simplified to [19]
h ^ = σ 2 C h ^ apriori - 1 + P c , r H P c , r - 1 P c , r H y ,
where σ 2 = h RRC 2 σ w 2 + E [ h channel + RRC 2 ] σ n G 2 + E [ h eq 2 ] σ n L 2 models the total interference power based on the Gaussian channel noise, nonlinear power amplifier caused interference and the limiter error. The channel covariance matrix, C h ^ apriori , contains the apriori information of the channel tap values. The apriori information of the channel taps is obtained through a least squares (LS) channel estimator. From (12), the LS channel estimator can be defined as
h ^ L S = P r H β r 2 N p σ p 2 m ^ y = α P AVG - 1 h eq + α P AVG P r H β r 2 N p σ p 2 [ ( 1 - β ) M ^ d , r + M ^ n L ] h eq + P r H β r 2 N p σ p 2 ( M ^ n G h channel + RRC + M ^ w h RRC ) .

We have assumed independent tap coefficients, which allows us to model the apriori channel correlation matrix C h ^ apriori as a diagonal matrix. Because of the receiver pulse shape filtering, this assumption is not exactly true, but it is used to provide us simpler diagonalized LMMSE estimator model, which reduces the channel estimation complexity. We shall refer to this LMMSE estimator, that uses LS based channel estimates as a priori information, as LS-LMMSE channel estimator. The performance of the receiver could be improved with more advanced methods taking the correlation into account, like the universal basis based decomposition of the receiver pulse shape filter correlation, as was discussed in [20]. In a sense, the idea of using only the most significant components of the decomposition is similar to our idea of truncating the time window of the channel estimator to take into account only the most significant channel taps. Both methods gain in noise power reduction in the channel estimation but lose in the asymptotic accuracy.

In the channel estimator, we approximate the diagonal correlation matrix C by the instantaneous tap power obtained from the LS channel estimator, i.e.,
C h ^ L S = diag ĥ L S ( 0 ) 2 , ĥ L S ( 1 ) 2 , , ĥ L S ( r N p - 1 ) 2 .
By assuming the cyclic OCI training sequence, the LS-LMMSE estimator can be reduced to
h ^ LS - LMMSE = P r H β σ est 2 C h ^ L S - 1 + r 2 N p σ p 2 I r N p × r N p m ^ y .
The variable σ est 2 corresponds to the total interference power on top of each received pilot symbol and is estimated as
σ est 2 = 1 β 2 N c h ^ L S 2 σ n L 2 + ( 1 + 1 / N c ) σ w 2 h RRC 2 ,

where we do not have a term related to σ n G 2 because this value is unknown to the receiver. Similar channel estimator structure with traditional SI pilots and iterative interference canceling feedback was studied in [21].

5 PAPR analysis and spectral leakage comparison

One drawback with DDST in SC transmission is the increased PP and PAPR in the transmitted signal and spectral leakage caused by the non-linear amplifier due to the increased PAPR. These problems are well known but have received relatively little attention in the recent literature.

In a SC transmission, the PAPR of the transmitted sequence is defined after the Tx pulse-shape filter. The PP we see in the filter output depends on the maximum amplitude of the input symbols and on a portion of the absolute values of the filter coefficients, depending on the oversampling. Because we have fixed the Tx pulse-shape filter, only the maximum amplitudes of the input symbols effect the observed PAPR.

There are two main reasons for increased symbol level amplitude in DDST. First of all, we increase the amplitude range related to a certain constellation by adding a power scaled pilot sequence on top of a power scaled symbol sequence. The second main reason for increased amplitude is the possibility of a cyclic mean (data dependent pilot) component with relatively high amplitude. When this component is added on top of data and known pilot symbols, and if the angles of these complex variables happen to align, then the total symbol amplitude is significantly increased.

In this Section, we will first discuss the worst case PP and PAPR effects in more detail and after that we will describe the reference spectral power mask and related simulations and results.

5.1 PAPR analysis and simulated results

For the analysis and results in this section, we have used oversampling ratio equal to four, r = 4. The worst case evaluations are based on the filter taps with separation of r samples that have the highest sum-power. This is because the transmitted symbol sequence is oversampled by factor r, so then for each output only every r th filter tap value participates in the corresponding power value. In other words, the filter model used in the following derivations is defined as hRRC(i), where the set of indices i is chosen based on criteria
i = [ k , k + r , , k + nr ] | max k i i h RRC , T x ( i ) 2 ,

where k [0,1,...,r - 1] and k + nr ≤ NRRC. With RRC transmit pulse shape filter of degree 64 and r = 4, the starting index which maximizes the sum-power is k = 2. Because the RRC filter acts also as a oversampling filter, the taps of the filter are multiplied by the oversampling factor r in order to keep the average transmitted power equal to unity.

First, we define the worst case symbol level PP. Assume now that d(k) = ae is some corner symbol with amplitude a and all the other symbols present in the cyclic mean calculation, d(k + iN p ) = aej(ϕ-π)with i = 1,2,...,N c - 1, are opposite corner symbols with amplitude a. Then the data dependent pilot added on top of d(k) is equal to
p d ( k ) = - 1 N c i = 0 N c - 1 d ( k + i N p ) = - 1 N c [ ( N c - 1 ) ( a e j ( ϕ - π ) ) + a e j ϕ ] = ( N c - 2 ) N c a e j ϕ = N c - 2 N c 1 - γ a max e j ϕ ,
which corresponds to the worst case peak amplitude with the data dependent pilot sequence and its value depends on the used constellation and the pilot power allocation factor γ. The worst case symbol level PP is defined for an aligned pilot p c (k) which has amplitude γ . By aligned, we mean that the arguments of data and the pilot are equal, d(k) = p c (k) = ϕ. Now we can write the worst case symbol level PP as
WP P s = d ( k ) + p d ( k ) + p c ( k ) 2 = 1 + N c - 2 N c 1 - γ a max + γ 2 .
By using (26), we can define then the worst case PP after the transmit pulse shape filtering to be
WP P T x , DDST = i i h RRC ( i ) 2 1 + N c - 2 N c 1 - γ a max + γ 2 ,
For TDMT, the worst case PP after the transmit pulse shape filtering is
WP P T x , TDMT = a max 2 i i h RRC ( i ) 2 .
If we use the presented hard symbol level limiter in the transmitter, then the worst case symbol level PP can be given as
WP P s , limited = L ( d ( k ) + p d ( k ) + p c ( k ) ) 2 = a max 2 ,
which is the same as with TDMT. Then the worst case PP after the RRC filtering is
WP P T x , DDST,limited = a max 2 i i h RRC ( i ) 2 .

which is equal to TDMT case.

With the PPs defined, we can define the PAPRs for different cases. While reading the results for PAPR from Table 1, one should note the difference in the average powers used to define these PAPR results. The average power of a TDMT signal is given as E[|sTDM|2] = 1. For DDST based system, the average power of the signal is E [ s 2 ] = ( 1 - 1 / N c ) σ d 2 + σ p 2 . The weighting factor (1 - 1/N c ) is caused by the removal of the cyclic mean from the data sequence. Now the worst case PAPR for DDST without limiter before and after the transmitter pulse shape filter can be given as
Table 1

WPP and WPAPR for the used constellations with parameter values N c = 75, N p = 60, and γ = 0.1





WPP s (26)
































All values are given in linear scale

WPAP R s = WP P s E [ s 2 ] = 1 + N c - 2 N c 1 - γ a max + γ 2 ( 1 - 1 / N c ) σ d 2 + σ p 2 ,
WPAP R T x , DDST = WP P T x , DDST E [ s 2 ] = i i h RRC ( i ) 2 1 + N c - 2 N c 1 - γ a max + γ 2 ( 1 - 1 / N c ) σ d 2 + σ p 2 .
The average power for LDDST is given as E [ s 2 ] = σ s 2 and is defined based on the Gaussian grid model in (18) in Section 3. The PAPRs for the limited case can be written as
WPAP R s , limited = WP P s , limited E [ s 2 ] = a max 2 σ s 2 ,
WPAP R T x , DDST,limited = a max 2 i i h RRC ( i ) 2 σ s 2 .
Finally, the PAPR for the TDMT case equals
WPAP R T x , TDMT = WP P T x , TDM E [ s TDM 2 ] = a max 2 i i h RRC ( i ) 2 .

In Table 1, we have calculated different symbol level and transmitted signal related worst case PPs and PAPRs for different constellations with pilot power allocation factor γ = 0.1. As we can see, the hard limiter significantly decreases the worst case PPs and PAPRs and the limited worst case PAPRs are close to the TDMT cases, as was desired.

If we assume that with DDST we want to set the PP at the transmit pulse shape filter output to be at a similar level as with TDMT, based on Table 1, a significant backoff is required. With symbol level amplitude limiter we can remove this backoff requirement. As a downside, the amplitude limiter causes additional interference in the transmitted symbols, which might be significant especially with higher order modulations.

In Table 2, the different simulated PPs and PAPRs are given for each constellation. The simulated values were obtained by finding the maximum PAPR over 100,000 random frame realizations. These results provide more insight on the average PAPR performance of the given system with different training methods, and show that the defined analytic worst case PPs and PAPRs are reliable upper bounds.
Table 2

Simulated PPs and PAPRs for the used constellations with parameter values N c = 75, N p = 60, and γ = 0.1





PP s
































All values are given in linear scale

As expected, the PP and PAPR results with DDST are not as bad as the worst case studies suggested. The main benefit of using symbol level limiter seems to be with QPSK and 16-QAM constellations, where significant reduction in PAPR can be achieved. 64-QAM has quite similar performance with and without symbol level limiter. In Figure 5, an example of the complementary cumulative distribution functions (CCDF) for PP and PAPR distributions with QPSK constellation are shown. Here we can see that the PAPR distributions are similar but the PP distributions are quite different.
Figure 5

Example of the complementary cumulative distribution functions. (a) PAPR and (b) PP distributions with QPSK constellation.

5.2 Spectral leakage with SSPA amplifier model

In this section we will study the spectral re-growth with different training methods and with QPSK, 16-QAM, and 64-QAM constellations. The power amplifier model was given in Section 2. We have chosen to use values v = 1 and p = 3 for the simulations. Because we have assumed that the power amplifier is matched to work with TDMT transmission, we have set the 1 dB compression point of the power amplifier based on the 64-QAM constellation PP distribution. The chosen amplitude limit is related to the PP which gives us 1% probability in the CCDF. Thus, from the results obtained in the previous section, we can look for the PP with 64-QAM that P(PP64-QAMP1dB) = 0.01. Based on our simulations, this value is equal to P1dB = 4.8 dB. Now, we use this power value to solve the power amplifier saturation amplitude. The amplitude corresponding to the 1 dB compression point is A = 104.8/ 20and the saturation amplitude can be solved to be
A 0 = v A 10 p / 10 - 1 - 10 2 p ,

which gives us A0 ≈ 1.739.

The used spectral mask is based on 3GPP technical specification for E-UTRA user equipment [22]. The used required attenuation levels are based on 23 dBm transmission power in the used 20 MHz bandwidth and Table in page 44 of [22]. We chose the values of this Table because it provides the most strict attenuation mask. The obtained attenuation levels are given in Table 3 with respect to the distance from the channel band edge. This distance is defined as an out-of-band frequency distance, ΔfOOB. The required attenuation levels are defined for a measurement bandwidth of 1 MHz.
Table 3

Attenuation at distance Δf OOB from the channel band edge


Attenuation requirement [dB]







For the simulations, we have assumed to use 20 MHz channel bandwidth, 18 MHz symbol frequency and a roll-off factor 0.1 in the RRC filter. We wanted to keep the roll-off factor small because we are aiming toward very high spectral efficiency. For different training methods and constellations, we ran the simulations looking for smallest IBO with 0.5 dB step in the average transmitted power, PAVG. We have defined the input backoff (IBO) as IBO = 10 log 10 ( A 0 2 / P AVG ) . Based on the results, we chose the smallest IBO for each training method and constellation which leads to spectral leakage that stays below the given spectral mask. The obtained IBO and output backoff (OBO) results are provided in the Table 4. The OBO is defined as the maximum output power to the average output power ratio, given as OBO = 10 log 10 ( A 0 2 / E [ G ( x ) 2 ] ) .
Table 4

Simulation based IBO and OBO results for different training methods and constellations

Training method/constellation




Required IBO [dB]










   DDST with limiter




Corresponding OBO [dB]










   DDST with limiter




All values are given in decibels [dB]

As expected, based on the PP and PAPR analysis, we can reach significantly lower OBO when using limited DDST with QPSK constellation. With 16-QAM constellation we can decrease the OBO somewhat with symbol level limiter. With 64-QAM, meaningful gains were not achieved with symbol level amplitude limiter. These IBO values are used in Section 7 when we compare the throughput performance of different training methods.

Next, we will return to the actual implementation of the iterative receiver used with limited DDST before we study the throughput performance with different training methods.

6 Iterative receiver algorithms

The receiver operations before the iterative data bit estimation were already described in Section 2. In this section we discuss in more detail the operations performed inside the iterative data bit estimation block, shown in more detail in Figure 6.
Figure 6

A block diagram presenting the operations performed inside the Iterative data bit estimation.

We have used notation z ̃ ^ to represent our estimates of the data symbol sequence, including the limiter error, with cyclic mean set to zero, obtained from the pilot removal and information symbol power normalization block, as shown in Figure 2. We use z ̃ ^ as a initial data symbol estimates to generate hard symbol based cyclic mean estimate in the hard symbol based p d estimation and compensation block. Inside this block, we generate hard symbol estimates based on z ̃ ^ , calculate their cyclic mean and add it to z ̃ ^ , to obtain initial symbol estimates d ^ 0 . Here superscript 0 points out that these symbol estimates are obtained before coded feedback. This idea was presented in [4], and we use it before the first soft symbols to bits mapping.

We start the iterative reception process by using d ^ 0 to generate soft coded bit estimates b ̃ ^ in the soft symbols-to-bits block. These are then provided to the soft-input soft-output (SISO) decoder from which we obtain our first soft decoded bit estimates to be provided for the p d and elimiter estimation and compensation block and for bit error evaluation. This block is presented in more detail in Figure 7, where superscript i refers to the iteration number. These procedures, before we obtain the first feedback data symbol estimates, d ^ 1 , are considered to happen in the zeroth feedback iteration (i = 0). In our notation, after first pass through channel decoder, symbol estimation and compensation processes, we obtain our first feedback data symbol estimates d ^ 1 , to be used for soft bit estimation.
Figure 7

A block diagram presenting the operations performed inside the p d and e limiter estimation and compensation block.

The operations inside the p d and elimiter estimation and compensation block, shown in Figure 7, are performed as follows. First we generate soft symbol estimates based on the latest soft bit estimates b ^ i , which are equal to the log-likelihood presentation of the a posteriori probabilities obtained from the soft decoder. The soft symbols are given by equation
d ^ ν i = a = 1 A d a p d a | b ^ ν i , 0 ν N - 1 ,
where |A| gives the number of symbols in alphabet A, ν is a symbol index, b ^ ν i are the soft bit estimates related to the ν th symbol, and p d a | b ^ ν i is the probability of a symbol d a , given the latest soft bit estimates b ^ ν i . The probability of a symbol d a is defined as
p d a | b ^ ν i = 2 - Q q = 1 Q 1 + b ̄ d a ( q ) tanh b ^ ν i ( q ) 2 ,
where Q is the number of bits per symbol, b ̄ d a ( q ) [ - 1 , + 1 ] is the q th bit of the hypothesis d a , and b ^ ν i ( q ) is the log-likelihood presentation of the a posteriori probability related to the q th bit of the ν th symbol in the i th iteration, given as
b ^ ν i ( q ) = log P a p p ( b ν i ( q ) = 1 ) P a p p ( b ν i ( q ) = 0 ) .

We have also normalized the variance of the soft symbol vector, d ^ i , to be equal to unity. This improves the feedback performance when the soft bit estimates have very low reliability. In our simulations, using soft symbol feedback for the limiter error estimation provided better results than using hard symbol feedback.

Then, we calculate the symbol wise cyclic mean and remove it from the symbol sequence to obtain z ^ i . Now - p ^ d i is an improved estimate of the cyclic mean, assuming that the SISO decoder has been able to reduce the number of bit errors in the detected bit sequence. Next, we add the known pilot sequence on top of the sequence z ^ i to get s ^ i and provide this sequence to the amplitude limiter. Then we calculate the limiter error estimate based on the input and the output of the limiter function and an improved estimate of the average power, σ ŝ i 2 . At this point, when i > 0, we obtain our first estimate of the limiter error. Based on our results, it is better to estimate the limiter error after the channel decoder and not based on the uncoded hard symbol estimates d ^ 0 . With low code rates (low E b /N0 region) the uncoded limiter error estimation leads to worse performance in all iterations. Then again, with high code rates (high E b /N0 region) uncoded limiter error estimation improves the BLER performance at the 0th iteration, but the iterative gain decreases, leading to worse performance at the fifth iteration.

Based on this improved average amplitude estimate, we can obtain improved symbol estimates by rescaling the average power of the received sequence, remembering that we have already scaled the incoming sequence by σ s in (10). Finally, we can generate new symbol estimates by adding to the received symbol estimates z ̃ ^ the latest cyclic mean and limiter error estimates, given as
d ^ i + 1 = σ ŝ i σ s z ̃ ^ - e ̃ ^ limiter i - p ^ d i = σ ŝ i σ s z ̃ ^ - ( I - J T x ) e ^ limiter i + J T x d ^ i .

We remove the cyclic mean of the estimated limiter error e ^ limiter i , because we have completely removed the cyclic mean from z ̃ ^ , including the limiter error.

Based on our results, it is better not to use the extrinsic information obtained from the channel decoder as a priori information in the soft symbols-to-bits mapping, if this information is already used to improve the cyclic mean estimate. This is probably because we are using the same information twice inside the same loop, thus losing the independence of the a priori information. We can use it as a priori information if we do not improve the cyclic mean, but based on our studies this does not provide as good iterative gain in the receiver. This could be because of the error averaging nature of the cyclic mean computation.

Here we remind the reader, that even without symbol level amplitude limiter, we have to use iterative detection algorithm for the cyclic mean estimation. Of course, the limiter error estimation is not required. Therefore, in the simulation results presented in Section 7, the throughput results obtained with DDST also include five feedback iterations.

For a reader interested in a pure SI training with iterative reception, a good starting point is, for example, [23]. In this article a computationally efficient, iterative frequency-domain equalization and channel estimation is presented. In this article, we have not considered of including the channel estimation process in the iterative loop because with DDST there is no interference from the data symbols to the known pilot symbols. Nonetheless, when there is symbol level limiter involved, we could feedback the cyclic mean of the limiter error estimate in order to improve the channel estimates with LDDST. In addition, in SISO case or in spatially multiplexed MIMO case, the feedback filtering used also in [23], is of great interest and provides interesting topics for future research.

7 Performance comparisons

In this section, we will first provide some results demonstrating the performance of our iterative receiver algorithm. In the end, spectral efficiency comparisons between TDMT and DDST based training are provided. This is, after all, the most important topic of this article. We will investigate whether the end user spectral efficiency is really improved with DDST and do we gain something by using a symbol level amplitude limiter.

The used channel model is a block-fading extended ITU-R Vehicular A channel with approximately 20 MHz bandwidth [13]. The maximum delay spread of the channel is 78 samples. In [13], the channel model was defined for sampling interval t s = 32.55 ns where as in our system the sampling interval is t s = 27.78 ns. This modification has a minor effect on the spectral correlation properties of the channel. However, the main idea is only to do some initial comparisons in the possible throughput performance between DDST and TDMT training based systems. Therefore, the used model provides a good starting point for the simulations.

The oversampling in the receiver allows us to efficiently realize the RRC filtering in frequency domain in combination with the channel equalization process. More details can be found in [14] and references therein. In this article we have considered single-input single-output (SISO), and 1 × 2 and 1 × 4 single-input multiple-output (SIMO) antenna configurations with MRC equalizer.

In our simulations, the channel estimator length is rN p = 120 while the true equivalent channel length, including the effects of transmitter and receiver RRC filters, is Nchannel + 1 + 2NRRC = 206 samples. This kind of short channel estimator was studied in [21, 24]. The reason behind using short channel estimator is to maximize the number of cycles, N c , with the cost of minimizing the estimator length, N p . Because we are estimating the equivalent channel, we can ignore channel tap values close to zero, which are caused by the heavy tailing of the RRC filters. In the presented simulations we have used values N c = 75 and N p = 60 with DDST and LDDST. This gives us a good compromise with the estimator accuracy and achievable number of cyclic copies. Especially with QPSK modulation, when we are working in a high noise environment, it is worth to consider sacrificing the channel estimation accuracy to achieve better noise power averaging through increased number of cyclic copies. With higher order constellations, in addition to the improved noise averaging, with increased number of copies we can also decrease the variance of the data dependent training sequence, p d , and this improves the accuracy of the first symbol estimates.

The channel codec uses turbo code [25] with generator matrix G = [ 1 1 5 1 3 ] . We have used the max-log-MAP algorithm presented in [26] without any correction factor for the max-operator. The extrinsic information exchanged between the component decoders is weighted by a factor 0.75 to reduce the error propagation, as proposed in [27]. Iterations in the turbo decoder are terminated based on the hard-data-aided algorithm presented in [28]. The used interleavers are bitwise S-interleavers [29], where the distance parameter is defined as S = U / 2 where U is the length of the unit which is interleaved. In channel interleaving the unit is the whole transmitted frame U = QN, where Q is the number of bits per symbol and N is the number of symbols per transmitted frame. We divide each transmitted frame into Q coded blocks. Inside the turbo codec the length of the interleaved unit is equal to one uncoded data block U = R(N - 2m), where m = 3 is the memory length of the component encoder and the term 2 m is caused by the unpunctured termination bits [30].

We have run the simulations for QPSK, 16-QAM, and 64-QAM constellations with code rates R = 0.5, R = 0.67 and R = 0.75. With TDMT pilots, the number of transmitted data symbols in each frame is decreased by the number of pilot symbols, which is set to be 450 in our simulations (10% of the frame duration). The TDMT pilots are the first 450 binary symbols from a Gold code of length 512 symbols [31] with unity power. The channel estimator length is equal to the equivalent channel length. With DDST, we decided to provide same portion of total power for the pilots, thus γ = 0.1. This gives us a fair comparison between TDMT training and DDST based transmission, because the channel estimation MSE of basic least-squares channel estimator with DDST is the same as with TDMT, if equal amount of power is allocated for the pilots [4]. The optimization of the pilot powers with TDMT or DDST for channel estimation with transmitted average power and PP restrictions is an interesting and open problem, but is out of the scope of this article. Some additional simulation parameters related to the simulation model are given in Table 5.
Table 5

Simulation parameters

Symbol rate

18 MHz

Signal bandwidth

19.8 MHz

Frame duration

250 μ s

Order of the RRC filter


RRC roll-off


Symbols per frame


TDMT pilot symbols per frame


Number of feedback iterations


No. of subbands in the analysis bank


No. of subbands in the synthesis bank


FB Overlapping factor


FB roll-off


In all the simulated cases we have used the maximum of five feedback iterations for p ^ d and êlimiter estimation. Typically, for QPSK modulation two and for 16-QAM modulation three feedback iterations already provide relatively good performance. With 64-QAM modulation we need five feedback iterations to ensure convergence in all of the cases. Example of the typical BLER behavior over iterations with LDDST using amplitude limiter with different constellations, compared to TDMT, is shown in Figure 8. We have assumed that the receiver does not know the IBO used in the transmitter and this degrades the performance results in all of the simulated cases.
Figure 8

BLER for QPSK, 16-QAM, and 64-QAM with two receiving antennas and with code rate R = 0.75 using LDDST or TDMT.

One rather intriguing problem while planning the spectral efficiency comparison was the choice of the reference power. The comparison of performance with DDST and TDMT based systems is not so trivial and one has to be careful about what to compare and how these results should be interpreted.

In the simulations, we chose to do the performance comparisons with respect to the energy per transmitted data bit over one sided noise spectral density, E b /N0. We have chosen this parameter because what matters most in modern wireless communications is the used energy per data bit to transmit with certain spectral efficiency. We have defined the SNR based on E b /N0 as
SNR =  E b Q R true N 0 r ,

where Q is the number of bits per symbol, Rtrue is the true coding rate (including the effect of possible termination bits, block length modifications with zero padding, etc.), and r = 2 is the oversampling rate used in the receiver.

Figures 9 and 10 present spectral efficiency results for DDST, LDDST and for TDMT training, using also a LS-LMMSE type equalizer, with QPSK modulation and with 16-QAM and 64-QAM modulations, respectively. From Figure 9 we can observe how the increased average transmit power allowed by the symbol level amplitude limiter improves the spectral efficiency in the low E b /N0 range with QPSK modulation. In Figure 10 we have shown the performance with higher order modulations. Here, the performance of LDDST compared to DDST is quite similar. Clearly, both DDST based systems improves the spectral efficiency over the whole E b /N0 range for each antenna configuration. The maximum spectral efficiency difference for each constellation is equal to 10%, which corresponds to the pilot overhead of TDMT.
Figure 9

Spectral efficiency comparison for DDST and TDMT training based systems in extended ITU-R Vehicular A channel with QPSK modulation.

Figure 10

Spectral efficiency comparison for DDST and TDMT training based systems in extended ITU-R Vehicular A channel with 16-QAM and 64-QAM modulations.

With the proposed symbol level amplitude limiter we can obtain improved spectral efficiency performance with QPSK modulation in all antenna configurations. With 16-QAM or 64-QAM modulations, LDDST and DDST have quite the same performance. Possibly, one could improve the LDDST performance with higher order modulations by tighter limiting bounds. In addition, by first performing tighter limiting and after that removing the cyclic mean, we could decrease the limiter error effect in the channel estimation and possibly improve the system performance. These topics are left for future studies.

8 Conclusion

In this article, we have discussed the effects of a DDST based training on the signal PP and PAPR distributions. We demonstrated that the PP and PAPR distributions of the DDST based training have longer tails and therefore there is a higher probability for big PAPR values. Especially, with constant amplitude modulations like QPSK, the average PAPR is significantly increased. Furthermore, the effects of the increased PAPR on the spectral leakage with SSPA amplifier model were studied. It was shown, that DDST does not require higher IBO compared to TDMT, but does provide slightly worse OBO performance. The proposed symbol level limiter can decrease further the IBO and OBO requirements with QPSK and 16-QAM constellations. The reduced OBO and IBO may significantly ease the design, implementation and cost of the required power amplifier. With QPSK modulation the symbol level limiter also clearly decreases the spectral re-growth and improves the spectral efficiency performance via higher average transmitted power.

Based on our results, with QPSK and 16-QAM, one should consider using LDDST to allow higher average transmitted power (lower OBO) and to achieve improved throughput compared to DDST. With higher order constellations symbol level amplitude limiter, as presented in this article, doesn't seem to provide significant benefit.

With DDST, with or without symbol level amplitude limiter, the complexity increase compared to traditional TDMT training can be approximated by the complexity of the SISO decoder used. In the soft feedback loop with DDST, with or without symbol level amplitude limiter, the SISO decoder is dominating the detection complexity. Thus, the average increase in the detection complexity compared to TDMT, is roughly the average number of feedback iterations times the number of blocks decoded in average in each feedback iteration times the average complexity of decoding one block in the SISO decoder. With TDMT no feedback iterations are required.

The performance comparisons between DDST and TDMT based system showed that DDST can provide similar or better performance over the whole E b /N0 range with all antenna configurations. The proposed symbol level amplitude limiter improves the throughput performance of the DDST in the low E b /N0 range with all antenna configurations tested.

In addition to careful performance analysis and comparisons, we have provided some new ideas for PAPR control with DDST, for modeling the effects of symbol level limiter in channel estimation, and for modeling the cyclic mean distribution based on multinomial distribution or its Gaussian approximation.



The authors would like to thank Dr. Ali Shahed Hagh Ghadam for enlightening the mysteries of power amplifiers. This work was supported by the Tampere Graduate School in Information Science and Engineering (TISE), the Nokia Foundation and the Academy of Finland (under Project No. 129077, "Hybrid Analog-Digital Signal Processing for Communications Transceivers").

Authors’ Affiliations

Department of Communications Engineering, Tampere University of Technology


  1. Hoeher P, Tufvesson F: Channel estimation with superimposed pilot sequence. In Proc IEEE Global Telecommunications Conference 1999 GLOBECOM '99. Volume 4. Janeireo, Brazil; 1999:2162-2166.Google Scholar
  2. Orozco-Lugo AG, Lara MM, McLernon DC: Channel estimation using implicit training. IEEE Trans Signal Process 2004, 52(1):240-254. 10.1109/TSP.2003.819993MathSciNetView ArticleGoogle Scholar
  3. Jagannatham SAK, Rao BD: Superimposed pilot vs. conventional pilots for channel estimation. In Fortieth Asilomar Conference on Signals Systems and Computers 2006 ACSSC '06. Pacific Grove, California USA; 2006:767-771.View ArticleGoogle Scholar
  4. Ghogho M, McLernon DC, Alameda-Hernandez E, Swami A: Channel estimation and symbol detection for block transmission using data-dependent superimposed training. IEEE Signal Process Lett 2005, 12(3):226-229.View ArticleGoogle Scholar
  5. McLernon DC, Alameda-Hernandez E, Orozco-Lugo AG, Lara MM: Performance of data-dependent superimposed training without cyclic prefix. Electron Lett 2006, 42(10):604-606. 10.1049/el:20060127View ArticleGoogle Scholar
  6. Gayosso-Rios E, Lara MM, Orozco-Lugo AG, McLernon DC: Symbol-blanking superimposed training for orthogonal frequency division multiplexing systems. In 7th International Symposium on Wireless Communications Systems(ISWCS). York, UK; 2010:204-208.Google Scholar
  7. Lam C-T, Falconer DD, Danilo-Lemoine F, Dinis R: Channel estimation for SC-FDE systems using frequency domain multiplexed pilots. In IEEE 64th Vehicular Technology Conf 2006 VTC-2006 Fall. Montreal, Canada; 2006:1-5.Google Scholar
  8. Levanen T, Talvitie J, Renfors M: Performance evaluation of a DDST based SIMO SC system with PAPR reduction. In 6th International Symposium on Turbo Codes & Iterative Information Processing, ISTC 2010. Brest, France; 2010:186-190.View ArticleGoogle Scholar
  9. McLernon DC, Alameda-Hernandez E, Orozco-Lugo A, Lara MM: New results for channel estimation via superimposed training. In Proc Second International Symposium on Communications Control and Signal Processing ISCCSP 2006. Marrakech, Morocco; 2006. (Article ID cr1001). ISBN: 2-908849-17-8Google Scholar
  10. Raich R, Qian H, Zhou GT: Optimization of SNDR for amplitude-limited nonlinearities. IEEE Trans Com-mun 2005, 53(11):1964-1972.MathSciNetView ArticleGoogle Scholar
  11. Rapp C: Effects of HPA-nonlinearity on a 4-DPSK/OFDM-signal for a digital sound broadcasting system. In Second European Conference on Satellite Communications, ECSC-2. Liege, Belgium; 1991:179-184.Google Scholar
  12. Bussgang JJ: Crosscorrelation functions of amplitude-distorted gaussian signals. Technical report (Massachusetts Institute of Technology. Research Laboratory of Electronics); 1952.Google Scholar
  13. Sorensen TB, Mogensen PE, Frederiksen F: Extension of the ITU channel models for wideband (OFDM) systems. In IEEE 62nd Vehicular Technology Conference 2005 (VTC-2005-Fall). Dallas, Texas, USA; 2005:392-396.View ArticleGoogle Scholar
  14. Yang Y, Ihalainen T, Rinne M, Renfors M: Frequency-domain equalization in single-carrier transmission: filter bank approach. EURASIP J Adv Signal Process 2007. 2007, (Article ID 10438)Google Scholar
  15. Clark MV: Adaptive frequency-domain equalization and diversity combining for broadband wireless communications. IEEE J Sel Areas Commun 1998, 16(8):1385-1395. 10.1109/49.730448View ArticleGoogle Scholar
  16. Alameda-Hemndez E, McLernon DC, Orozco-Lugo AG, Lara MM, Ghogho M: Improved synchronization for superimposed training based channel estimation. In IEEE/SP 13th Workshop on Statistical Signal Processing. Bordeaux, France; 2005:1324-1329.Google Scholar
  17. Moosvi SMA, McLernon DC, Orozco-Lugo AG, Lara MM, Ghogho M: Carrier frequency offset estimation using data-dependent superimposed training. IEEE Commun Lett 2008, 12(3):179-181.View ArticleGoogle Scholar
  18. Yang Y, Ihalainen T, Renfors M: Filter bank based frequency domain equalizer in single carrier modulation. In Proc 14th IST Mobile & Wireless Communications Summit. Dresden, Germany; 2005.Google Scholar
  19. Pukkila M: Iterative Receivers and Multichannel Equalisation for Time Division Multiple Access Systems, Ph.D. dissertation. Helsinki University of Technology, Espoo, Finland; 2003.Google Scholar
  20. Carrasco-Alvarez R, Parra-Michel R, Orozco-Lugo AG, Tugnait JK: Enhanced channel estimation using superimposed training based on universal basis expansion. IEEE Trans Signal Process 2009, 57(3):1217-1222.MathSciNetView ArticleGoogle Scholar
  21. Levanen T, Renfors M: Improved performance bounds for iterative IC LMMSE channel estimator with SI pilots. In 21st Annual IEEE International Symposium on Personal Indoor and Mobile Radio Communications. Istanbul, Turkey; 2010:9-14.Google Scholar
  22. 3GPP TS36.101 V10.1.0 (2010-12), 3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Evolved Universal Terrestrial Radio Access (E-UTRA); User Equipment (UE) radio transmission and reception (Release 10)2012. []
  23. Dinis R, Lam C-T, Falconer D: Joint frequency-domain equalization and channel estimation using superimposed pilots. In IEEE Wireless Communications and Networking Conference (WCNC). Las Vegas, NV, USA; 2008:447-452.Google Scholar
  24. Levanen T, Talvitie J, Renfors M: Improved performance analysis for super imposed pilot based short channel estimator. In IEEE International Workshop on Signal Processing Advances for Wireless Communications SPAWC 2010. Marrakech, Morocco; 2010:1-6.View ArticleGoogle Scholar
  25. Berrou C, Glavieux A, Thitimajshima P: Near shannon limit error-correcting coding and decoding: turbo-codes, in. In IEEE International Conference on Communications. Volume 2. Geneva; 1993:1064-1070.View ArticleGoogle Scholar
  26. Robertson P, Villebrun E, Hoeher P: A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain. In Proc IEEE International Conference on Communications ICC 95 Gateway to Globalization. Volume 2. Seattle, WA, USA; 1995:1009-1013.View ArticleGoogle Scholar
  27. Sharma S, Attri S, Chauhan RC: A simplified and efficient implementation of FPGA-based turbo decoder. In 2003 IEEE International Performance Computing and Communications Conference. Longowal, Sangnu; 2003:207-213.Google Scholar
  28. Kei CL, Mow WH: Improved stopping criteria for iterative decoding of short-frame multi-component turbo codes. In Proc IEEE International Conference on Communications Circuits and Systems and West Sino Expositions. Volume 1. Chengdu, Sichuan, China; 2002:42-45.Google Scholar
  29. Divsalar D, Pollara F: Turbo codes for PCS applications. In Proc IEEE International Conference on Communications ICC'95 Gateway to Globalization. Volume 1. Seattle, WA, USA; 1995:54-59.View ArticleGoogle Scholar
  30. 3rd Generation Parthership Project. 3GPP TS 25.212 V7.2.0 (2006-09); 3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Multiplexing and channel coding (FDD) (Release 7)2011. []
  31. Gold R: Optimal binary sequences for spread spectrum multiplexing. IEEE Trans Inf Theory 1967, 13(4):619-621.MathSciNetView ArticleGoogle Scholar


© Levanen et al; licensee Springer. 2012

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