Skip to content


  • Research
  • Open Access

A new reduced-complexity detection scheme for zero-padded OFDM transmissions

EURASIP Journal on Wireless Communications and Networking20112011:109

  • Received: 19 December 2010
  • Accepted: 25 September 2011
  • Published:


Recently, zero-padding orthogonal frequency division multiplexing (ZP-OFDM) has been proposed as an alternative solution to the traditional cyclic prefix (CP)-OFDM, to ensure symbol recovery regardless of channels nulls. Various ZP-OFDM receivers have been proposed in the literature, trading off performance with complexity. In this paper, we propose a novel low-complexity (LC) receiver for ZP-OFDM transmissions and derive an upper bound on the bit error rate (BER) performance of the LC-ZP-OFDM receiver. We further demonstrate that the LC-ZP-OFDM receiver brings a significant complexity reduction in the receiver design, while outperforming conventional minimum mean-square error (MMSE)-ZP-OFDM, supported by simulation results. A modified (M)-ZP-OFDM receiver, which requires the channel state information (CSI) knowledge at the transmitter side, is presented. We show that the M-ZP-OFDM receiver outperforms the conventional MMSE-ZP-OFDM when either perfect or partial CSI (i.e., limited CSI) is available at the transmitter side.

Index Terms-Zero-padding, orthogonal frequency division multiplexing (OFDM), equalization.


  • Orthogonal Frequency Division Multiplex
  • Channel State Information
  • Finite Impulse Response
  • Orthogonal Frequency Division Multiplex System
  • Cyclic Prefix

I. Introduction

The growing demand for high data rate services for wireless multimedia and internet services has led to intensive research efforts on high-speed data transmission. A key challenge for high-speed broadband applications is the dispersive nature of frequency-selective fading channels, which causes the so-called intersymbol interference (ISI), leading to an inevitable performance degradation. An efficient approach to mitigate ISI is the use of orthogonal frequency division multiplexing (OFDM) that converts the ISI channel with additive white Gaussian noise (AWGN) into parallel ISI-free subchannels by implementing inverse fast Fourier transform (IFFT) at the transmitter and fast Fourier transform (FFT) at the receiver side [1]. It has been shown that OFDM is an attractive equalization scheme for digital audio/video broadcasting (DAB/DVB) [2, 3] and has successfully been applied to high-speed modems over digital subscriber lines (DSL) [4]. Recently, it has also been proposed for broadband television systems and mobile wireless local area networks such as IEEE802.11a and HIPERLAN/2 (HL2) standards [5].

The IFFT precoding at the transmitter side and insertion of CP enable OFDM with very simple equalization of frequency-selective finite impulse response (FIR) channels. To avoid in-terblock interference (IBI) between successive FFT processed blocks, the CP is discarded and the truncated blocks are FFT processed so that the frequency-selective channels are converted into parallel flat-faded independent subchannels. In this way, the linear channel convolution is converted into circular convolution, and the receiver complexity both in equalization and the symbol decoding stages is reduced [6]. However, since each symbol is transmitted over a single flat subchannel, the multipath diversity is lost along with the fact there is no guarantee for symbol detectability when channel nulls occur in the subchannels. As an additional counter-measure, coded OFDM (C-OFDM), which is fading resilient, has been adopted in many standards [7]. Trellis-coded modulation (TCM) [8] and convolutional codes [9, 10] are typical choices for error-control codes. Interleaving together with TCM enjoys low-complexity Viterbi decoding while enabling a better trade off between bandwidth and efficiency. However, designing systems that achieve diversity gain equal to code length is difficult considering the standard design paradigms for TCM. Linear constellation precoded OFDM (LCP-OFDM) was further proposed in [11] to improve performance over fading channels, where a real orthogonal precoder is applied to maximize the minimum product distance [12, 13] and channel cutoff rate [14], while maintaining the transmission rate and guaranteeing the symbol recovery. In [15, 16], the LCP is combined with space-time block coding (STBC) and channel coding in order to effectively improve the space-time diversity order of the multiple antenna system. The aforementioned LCP systems are based on Hadamard matrices and can employ the simple MMSE linear decoder at the receiver side, which has low complexity compared to the maximum likelihood (ML) decoders currently used in such systems. Subcarrier grouping was proposed in [11] to enable the maximum possible diversity and coding gain. However, the LCP that is used within each subset of subcarriers is in general complex.

To ensure symbol recovery regardless of channel nulls, Zero-Padding (ZP) of multicarrier transmission has been proposed to replace the generally non-zero CP. Unlike CP-OFDM, ZP-OFDM guarantees symbol recovery and FIR equalization of FIR channels. Specifically, the zero symbols are appended after the IFFT processed information symbols. In such way, the single FFT required by CP-OFDM is replaced by FIR filtering in ZP-OFDM that adds to the receiver complexity. To trade-off BER performance for extra savings in complexity, two low-complexity equalizers for ZP-OFDM are derived in [17]. Both schemes are developed based on the circularity of channel matrix while reducing complexity by avoiding inversion of a channel dependent matrix. However, the BER performance of the two sub-optimal receivers proposed in [17] is not as good as MMSE-ZP-OFDM.

Adapting the transmitter designs to the propagation channel facilitates performance improvement. Depending on the CSI available to the transmitter, various parameters such as power levels, constellation size, and modulation are adjustable by the channel-adaptive transmissions [18]-[20]. The challenge in a wireless setting is on whether and what type of CSI can be practically made available to the transmitter, where fading channels are randomly varying. Apparently, this is less of an issue for discrete multi-tone (DMT) systems in wireline links, which has been standardized for digital subscriber line modems. In both single-input single-output (SISO) and multiple-input multiple-output (MIMO) versions of DMT, perfect CSI is assumed to be available at the transmitter [21]. Although it is reasonable for wireline links, we can only justify the assumption of perfect CSI-based adaptive transmissions developed for SISO [22] and MIMO OFDM wireless systems [23] when the fading is sufficiently slow. Since no-CSI leads to robust but rather pessimistic designs and perfect CSI is mostly impractical for wireless links, recent efforts geared toward exploitation of partial CSI-based transmissions. In this work, we assume limited CSI knowledge. In particular, we assume that only small number of channel taps are available at the transmitter.

In this paper, we propose a novel reduced-complexity receiver design for ZP-OFDM transmissions (LC-ZP-OFDM) that not only outperforms MMSE-ZP-OFDM (confirmed through simulation results) but also uses low-complexity computational methods that bring a significant power saving to the proposed receiver. We show that linear processing collects both multipath and spatial diversity gains, leading to significant improvement in performance, while maintaining low complexity. Note that the proposed LC-ZP-OFDM receiver consists of two stages, i.e., a low-complexity sub-optimal MMSE receiver at first stage followed by linear operations at second stage to investigate the underlying available diversity. A M-ZP-OFDM receiver for transmitter designs based on perfect, as well as limited CSI knowledge, is further included, which significantly outperforms MMSE-ZP-OFDM. BER upper bounds are presented for the two-stage LC receiver. The performance improvement of the LC-ZP-OFDM and M-ZP-OFDM receivers as compared with the conventional MMSE-ZP-OFDM receiver is further corroborated through simulation results.

The rest of this correspondence is organized as follows. We start in Section II by describing our model and assumptions. In Section III, the reduced-complexity MMSE-based receiver is proposed. Computational complexity analysis and numerical results are presented in Sections IV and V, respectively. The paper is concluded in Section VI.

II. System model

We consider a single-transmit single-receive antenna system over a frequency-selective fading wireless channel. The channel impulse response (CIR) of the j th information block is modeled as an FIR filter with coefficients h j = [h j [0],..., h j [L]]T, where L denotes the corresponding channel memory length. The random vectors h j are assumed to be independent zero-mean complex Gaussian with two choices of power-delay profile: Uniform power-delay profile with variance 1/(L + 1), and exponentially decaying power-delay profile θ ( τ k ) = C e - τ k τ r m s with delays τ k that are uniformly and independently distributed [24].

The j th M ×1 information block x M j is IFFT precoded by the IFFT matrix to yield the time-domain block vector x ̃ z p j and padded by D trailing zeros as follows
x ̃ z p j = Q z p x M j
Q z p = [ Q M 0 D × M ] H
Therefore, the received block symbol is given by
r ̃ z p j = H Q z p x M j + H I B I Q z p x M j - 1 + n ̃ N j
where N = M + D; H is the N × N lower triangular Toeplitz filtering matrix with its first column being [h j [0],..., h j [L] 0,..., 0 ]T; H IBI is the N × N upper triangular Toeplitz filtering matrix that captures the inter-block interference (IBI), with its first row being [0,..., 0 h j [0],..., h j [L] ]; and n ̃ N j denotes the AWGN noise. Since L + 1 ≤ D, we have H IBI Q zp = 0, i.e., the all-zero 0D×Mmatrix plays the key role in ZP-OFDM by eliminating the IBI. Having the H matrix partitioned between its first M and last D columns as H = [H0, H zp ], the received block symbol will be given by
r ̃ z p j = H Q z p x M j + n ̃ N j = H 0 Q M H x M j + n ̃ N j .
The N × M submatrix H0, which corresponds to the first M columns of H, is Toeplitz and is guaranteed to be invertible, which assures symbol recovery regardless of channel zero locations. In this case, due to its channel-irrespective symbol detectability property, ZP-OFDM is able to exploit fully the underlying multipath diversity [1]. Assuming the symbols x M j are i.i.d with variance σ x 2 and the additive white Gaussian noise n ̃ N j to be i.i.d with variance σ x 2 , the minimum mean-square error (MMSE) estimator of x M j is given by [17]
x ^ M j = σ x 2 Q M H 0 H ( σ n 2 I N + σ x 2 H 0 H 0 H ) - 1 r ̃ z p j .

It should be emphasized that channel inversion of a N × N matrix cannot be precomputed due to its dependence on channel that brings about an extra implementation cost for the MMSE-ZP-OFDM receiver. Specifically, equalization in (5) is computationally costly, as the pseudo inverse of the Toeplitz matrix H0 is required, whose precomputation is impossible due to the channel coefficients' variations from block to block. Thus, from an implementation point of view, a low-complexity ZP-OFDM is desirable. This observation motivates the subsequent sub-optimal low-complexity ZP-OFDM equalizers, such as ZP-OFDM-FAST-ZF/MMSE and the ZP-OFDM-OLA [17] originating from the overlap-and-add (OLA) method. Thus, complexity is always an issue when dealing with ZP-OFDM systems, as compared to the computationally efficient FFT-based CP-OFDM systems. Its worth mentioning that ZP-OFDM-OLA is analogous to CP-OFDM; thus, it incurs identical complexity and is not able to fully exploit the underlying multipath diversity. To overcome these limitations, our proposed scheme targets practical ZP-OFDM receiver that exploits full multipath diversity while maintaining low complexity.

III. Reduced-complexity mmse-based receiver

The proposed receiver includes a suboptimal channel independent MMSE equalizer in the feed forward stage, followed by linear processing operations in the feed-back stage. Specifically, the feed forward stage exploits the circulant structure of the channel matrices,
H = Q Λ Q H
where H′ is N × N circulant matrices with entries [H′]k,l= h((k - l) mod N); Λ is a diagonal matrix whose (n, n) element is equal to the n th DFT coefficient of h. Due to the trailing zeros, the last D columns of H in (4) do not affect the received block. Thus, the Toeplitz matrix H can be replaced by the N × N circulant matrix H′ and (4) can be written as
r ̃ z p j = H Q z p x M j + n ̃ N j = H Q z p x M j + n ̃ N j .
The H′ matrix takes advantage of FFT to yield a set of flat fading channels that can be equalized easily. The ZP-OFDM receiver output will be
r N j = Q N H Q z p x M j + n N j = Q N H Q N H Q N Q z p x M j + n N j = Λ Q N Q z p x M j + n N j = Λ V x M j + n N j
V = Q N Q z p .
After applying the N-point FFT Q N to r ̃ z p j , the suboptimal MMSE-ZP-OFDM receiver in the feed forward stage is formed in two steps. First, we obtain an MMSE estimator of x ^ M j using
x ^ M j = E [ x M j ( r N j ) H ] . E - 1 [ r N j ( r N j ) H ] = σ x 2 V H Λ H [ σ n 2 I + σ x 2 Λ V V H Λ H ] - 1 r N j .
The (m, n) th element of VV H is equivalent to 1 N sin ( π M ( n m ) N ) sin ( π ( n m ) N ) e j π ( n m ) ( M 1 ) N , which is equal to M N for the diagonal elements and is negligible compared to the diagonal elements when M N is close to 1. This is a common feature in the context of all current standardized OFDM systems, i.e., DAB and DVB. Therefore, (10) can be further simplified assuming that V V H M N I , leading to
x ^ M j = σ x 2 N M V H Λ H N M σ n 2 I + σ x 2 Λ Λ H - 1 r N j .
The resulting data streams detected from (11) are fed into a minimum Euclidean distance decoder, yielding x ̃ M j , i.e., a decoded version of the transmitted symbols. The decoded signals are then fed into the feed-back stage, which is responsible for exploiting the underlying multipath diversity. Specifically, consider the generation of the matrix Π l , l = 0, 1, 2,..., L, as follows:
[ Π l ] p , q = 0 ( p - q ) m o d N = l [ H ] p , q ( p - q ) m o d N l
where 1 ≤ p, qN, then, (7) can be re-written as
r ̃ l = r ̃ z p j - Π l Q z p x ^ M j .
Under the high SNR assumption, we can safely assume that x M j x ^ M j . Therefore, we can write (13) as follows:
r ̃ l = H l Q z p x M j + n ̃ N j
[ H l ] p , q = [ H ] p , q ( p - q ) m o d N = l 0 ( p - q ) m o d N l .
Combining each diversity branch in (14), we have
z ̃ j = Q z p H l = 0 L H l H r ̃ l l = 0 L | | H l | | 2 .

The signal in (16) is then fed into a maximum likelihood decoder to recover the transmitted symbols. It is observed from (16) that the maximum achievable diversity order is given by L + 1. This illustrates that our proposed receiver is able to fully exploit the underlying spatial and multipath diversity gains relying on simple linear processing operations only.


In this section, we propose a M-ZP-OFDM receiver that has access to CSI at the transmitter side, such that, at the transmitter side, the zero-padded information symbols are multiplied by the set of matrices C2,land sent through the channel, processed by the circulant matrix H′ and finally multiplied by the the set of matrices C1,lat the receiver side to exploit the underlying multipath diversity. For l = 1,..., L, the matrices C1,land C2,lare generated as following [25].
C 1 , l = a 1 , l t = 1 N | a t , l | 2 0 0 0 a 2 , l l = 1 N | a t , l | 2 0 0 0 a N , l l = 1 N | a t , l | 2 C 2 , l = t = 1 N | a t , l | 2 k = 1 L a 1 , k 0 0 0 t = 1 N | a t , l | 2 k = 1 L a 2 , k 0 0 0 t = 1 N | a t , l | 2 k = 1 L a N , k ,
Λ l = a 1 , l 0 0 0 a 2 , l 0 0 0 a N , l .
Note that C1,land C2,lare built such that Λ l = C1,lΛC2,l, where Λ l = Q H H l Q. Using this property, we can drive their corresponding circulant matrices Ψ1,land Ψ2,lusing Ψ1,l= QC1,lQ H and Ψ2,l= QC2,lQ H . Thus exploiting the circulant structure of these matrices we have
H l = Ψ 1 , l H Ψ 2 , l .
Thus, multiplying the zero-padded symbols at the transmitter side with Ψ2,land the output at the receiver side by Ψ1,l, for each diversity branch we can rewrite (7) as following
r c , l = H Ψ 2 , l Q z p x M j + n N j r c , l = Ψ 1 , l r c , l = Ψ 1 , l H Ψ 2 , l Q z p x M j + Ψ 1 , l n N j = H l Q z p x M j + Ψ 1 , l n N j

Note that for l = 1,..., L + 1, both C1,land Ψ1,lhave unit power and thus do not lead to noise enhancement. More importantly, it can be seen that (20) is similar to (14) in LC-ZP-OFDM proposed in Section III, in the sense that we are exploiting the underlying multipath diversity from each diversity branch.

V. Analytical bounds on the ber performance for the low-complexity receiver

The two-stage receiver consists of the suboptimal MMSE-ZP-OFDM at the first stage and the linear operations at the second stage. The BER can then be written as
p e = ( p e - 1 s t S t a g e p e - 2 n d S t a g e ) + ( ( 1 - p e - 1 s t S t a g e ) p e - 2 n d S t a g e ) ,
where p e - 1 s t S t a g e stands for the probability of decoding the symbols erroneously at the first stage and p e - 2 n d S t a g e stands for the probability of decoding the symbols erroneously at the second stage. p e can be further simplified as following
p e = p e - 2 n d S t a g e | p e - 1 s t S t a g e p e - 1 s t S t a g e + p e - 2 n d S t a g e | 1 - p e - 1 s t S t a g e ( 1 - p e - 1 s t S t a g e ) = p e - 2 n d S t a g e | p e - 1 s t S t a g e - p e - 2 n d S t a g e | 1 - p e - 1 s t S t a g e × p e - 1 s t S t a g e + p e - 2 n d S t a g e | 1 - p e - 1 s t S t a g e
In order to find each of p e - 1 s t S t a g e , p e - 2 n d S t a g e | ( 1 - p e - 1 s t S t a g e ) , and ( p e - 2 n d S t a g e | p e - 1 s t S t a g e ) , we resort to the conventional Chernoff bound on the BER performance. As mentioned earlier, through the MMSE criterion, the mean-squared error (MSE) is minimized, which can be expressed as following [25]
ε MMSE = E [ t r ( ( x ^ M j ˒ x M j ) ( x ^ M j ˒ x M j ) H ) ] = [ t r ( 1 σ d 2 I M + 1 σ n 2 V H Λ H Λ V ) ] ˒ 1 [ t r ( 1 σ d 2 I M + M σ n 2 N Q z p H H H H Q z p ) ] ˒ 1 a s i s c o n s i d e r e d i n t h e 1 s t s t a g e s u b ˒ o p t i m a l r e c e i v e r = N σ n 2 M [ N σ n 2 M σ d 2 + l = 1 L | h ( l ) | 2 ]
The upper bound for the conditional p e - 1 s t S t a g e can be then written as
p e - 1 s t S t a g e exp - d c 2 σ d 2 1 - ε M M S E σ d 2 4 ε M M S E = exp d c 2 4 1 - σ d 2 ε M M S E = exp - M d c 2 σ d 2 4 N σ n 2 q ,
where q = l = 1 L | h ( l ) | 2 whose pdf is denoted by p (q) that has a chi-square distribution with 2L degrees of freedom, and d c 2 stands for the minimum squared distances for different modulation types that are summarized in Table 1. Note that for M-PSK modulation, d c 2 = | 1 - e - j 2 π / M | 2 . The average BER is thus upper bounded by
Table 1

Minimum squared distance for different modulation types with average power normalized to one


d c 2













p e - 1 s t S t a g e 0 exp - M d c 2 σ d 2 4 N σ n 2 q p ( q ) d q = 1 2 1 - M d c 2 S N R 4 N L + M d c 2 S N R L × k = 0 L - 1 L - 1 + k k 1 2 1 + M d c 2 S N R 4 N L + M d c 2 S N R k ,

where a b is the binomial coefficient, and S N R = σ d 2 σ n 2 .

Assuming that no error is propagated from the first stage to the second stage, the second stage involves maximum likelihood estimation of the originally transmitted symbols from the L branch outputs r ̃ l in (14), each of which comes with diversity order 1. The upper bound for this error probability is thus given by
( p e - 2 n d S t a g e | ( 1 - p e - 1 s t S t a g e ) ) 1 2 1 - d c 2 S N R 4 L + d c 2 S N R L × k = 0 L - 1 L - 1 + k k 1 2 1 + d c 2 S N R 4 L + d c 2 S N R k ,
Assuming that there is error propagated from the first stage to the second stage, we can rewrite (14) as following
r ̃ l = r ̃ z p j - Π l Q z p x ^ M j = H Q z p x M j + n ̃ N j - Π l Q z p x M j + n 1 = H l Q z p x M j + n ̃ N j - Π l Q z p n 1 n 2 , l ,
where n1 has variance εMMSE and n2,lhas variance - σ n 2 = σ n 2 + t = 1 , t l L | h ( l ) | 2 ε M M S E ( 1 + N M ) σ n 2 . Thus, the error probability for this scenario can be written as
( p e - 2 n d S t a g e | p e - 1 s t S t a g e ) 1 2 1 - d c 2 S N R 4 L + d c 2 S N R L × k = 0 L - 1 L - 1 + k k 1 2 1 + d c 2 S N R 4 L + d c 2 S N R k ,

where S N R = M M + N S N R . Therefore, (22) can be reconstructed following (25, 26), and (28).

VI. Computational complexity analysis

In this section, we focus on the computational complexity of the proposed receiver compared to the conventional MMSE-ZP-OFDM receiver. The computational complexity is measured based on the number of the complex multiplications and complex divisions. Since complex divisions can be implemented in various different ways, we did not decompose them into complex multiplication. Note that it is not trivial to elaborate explicit complexity expressions for different OFDM systems in terms of the system's parameters. Specifically, system's complexity depends on the parameters such as N, M, D, and L, each of which are decisive in finding the number of the complex multiplications involved. Finding a closed-form expression in terms of the aforementioned system parameters is rather difficult; therefore, in this work, we have derived expressions for the approximate multiplicative complexity counts and have used Matlab simulations to find the exact number of complex multiplications implemented. To do so, we have used the minimal multiplicative bounds [26] to find the arithmetic complexity of FFT of different block lengths. Besides, to implement the FFT of length W decomposable to the product of two prime numbers a and b, we have implemented a FFTs of size b or b FFTs of size a instead, without inquiring any additional operations such as multiplications by twiddle factors [27].

Following (5), we derive the approximate computational complexity count for the conventional MMSE-ZP-OFDM as below
x ^ M j = σ x 2 × M Q M × M 2 H 0 H × [ M N ] σ n 2 I N + σ x 2 × [ N 2 ] H 0 × H 0 H [ N 2 M ] - 1 × r ̃ z p j [ N 2 ] [ N 3 ] .

where [·] stands for the approximate operation count involved in the operation implementation. (28) requires total of N3 + N2 (N + M + 2) + M2 + M (N + 1) operations.

Similarly, we derive the approximate computational complexity count for the low-complexity receiver using (11) and (16) as following
x ^ M j = σ x 2 N M × [ M ] V H × [ N M ] Λ H × [ N ] N M σ n 2 I + σ x 2 × [ N ] Λ Λ H [ N ] - 1 × r N j [ N ] [ N ] ,
z ̃ j = Q z p H × [ M N ] l = 0 L H l H × [ N ] z l j [ N ( M + 5 ) + M ] [ L N ( M + 6 ) + L M ] l = 0 L | | H l | | 2 [ M ] .

Therefore, the total number of operations required to implement the low-complexity receiver is N ((M + 6) L + M) + M (L + 1).

We also derive the approximate computational complexity count for the M-ZP-OFDM receiver that includes the additional complexity brought to the transmitter side by multiplying the zero-padded information symbols by the set of matrices C2,l, as well as the computational complexity at the receiver side. Thus, using [19] we have
r c , l = H Ψ 2 , l Q z p [ N 2 ] x M j + n N j ,
which shows the additional complexity cost at the transmitter side per diversity branch and
r c , l = Ψ 1 , l r c , l [ N 2 ] ,
z ^ j = Q z p H × [ M N ] l = o L H l H × [ N ] r c , l [ N 2 ] [ L ( N 2 + N ) ] l = 0 L | | H l | | 2 [ M ]

which shows the additional complexity cost at the receiver side. Therefore, the total number of operations required to implement the low-complexity receiver is N (NL + L + M) + M.

The overall computational complexity for the LC-ZP-OFDM receiver, M-ZP-OFDM receiver, and the conventional MMSE-ZP-OFDM receiver is summarized in Table 2 for the case of M = 64 and N = 80 and scenarios with different combinations of channel memory lengths:
Table 2

Comparison of overall computational complexity


Number of complex multiplications

Number of complex divisions


Scenario 1

Scenario 2

Scenario 1

Scenario 2












RC = 3,3408

RC = 66,648




TC = 25,600

TC = 51,200


TC transmitter complexity, RC receiver complexity

Scenario (1) L + 1 = 5

Scenario (2) L + 1 = 10

Note that the computational complexity of M-ZP-OFDM receiver at the transmitter side does not include the CSI estimation. The computational complexity of the LC-ZP-OFDM receiver and the M-ZP-OFDM receiver versus the MMSE-ZP-OFDM receiver in terms of the number of the complex multiplications is illustrated in Figure 1, which is plotted against time, assuming that the channel estimate is updated at every t seconds. We would like to emphasize that the MMSE equalizer in MMSE-ZP-OFDM requires the inversion of an N × N Toeplitz channel dependent matrix, which has to be computed at every t seconds with a complexity of the order O(N2). Note that as the channel memory lengths of the underlying channel links increase, the complexity of MMSE-ZP-OFDM, M-ZP-OFDM, and the LC-ZP-OFDM receiver increases.
Figure 1
Figure 1

Computational complexity of the LC-ZP-OFDM receiver compared to MMSE-ZP-OFDM.

It is observed from Figure 1 that for scenarios one and two with reasonable memory length for the underlying channels, the aggregate complexity of the LC-ZP-OFDM receiver is insignificant compared to the conventional MMSE-ZP-OFDM as well as M-ZP-OFDM, as channel parameters change with time.

VII. Numerical results

In this section, we present Monte-Carlo simulation results for the proposed receiver assuming a quasi-static Rayleigh fading channel.

Figure 2 illustrates the symbol error rate (SER) performance of the proposed receiver for L+1 = 2. We assume 64-QAM, M = 64, and N = 80 as is practiced in the context of HL2 systems. Our simulation results indicate that LC-ZP-OFDM receiver outperforms the conventional MMSE-ZP-OFDM equalizer by ≈ 3.3 dB without error propagation (EP) from the first stage and by ≈ 0.5 dB with EP from first stage at SER = 10-3. We are also including the SER performance of the M-ZP-OFDM receiver with perfect CSI, as well as partial CSI (limited CSI is available, e.g., only one of the two channel taps are available at the transmitter side). As is illustrated in Figure 2, the M-ZP-OFDM receiver with partial CSI outperforms the conventional MMSE-ZP-OFDM by ≈ 4 dB at SER = 10-3, when l = 1. The system's SER performance for 64-QAM AWGN channel is provided as a reference curve.
Figure 2
Figure 2

SER performance of MMSE-ZP-OFDM, LC-ZP-OFDM receiver with and without EP, and M-ZP-OFDM in the context of HL2 ( L + 1 = 2).

In Figure 3, we provide further results on the performance of the LC-ZP-OFDM receiver for L + 1 = 6. Our results indicate that the LC-ZP-OFDM receiver outperforms the MMSE-ZP-OFDM equalizer by ≈ 5 dB without EP and by ≈ 0.75 dB with EP at SER = 10-7. Moreover, we are including the SER performance of the M-ZP-OFDM receiver with partial CSI (e.g., only two or three of the six channel taps are available at the transmitter side) when l = 2, 3. It can be seen that the proposed receiver outperforms the MMSE-ZP-OFDM receiver by ≈ 4 dB at SER = 10-6, when l = 3.
Figure 3
Figure 3

SER performance of MMSE-ZP-OFDM, LC-ZP-OFDM receiver with and without EP, and M-ZP-OFDM in the context of HL2 ( L + 1 = 6).

In Figure 4, the SER performance of the LC-ZP-OFDM receiver for L+1 = 2, 4, 6 is presented, assuming 64-QAM modulation in the context of HL2, and is compared with the theoretical values presented in Section V. As is illustrated in Figure 4, both the theoretical curves and their corresponding simulated versions come with similar slopes. As an example, when L+1 = 4, the theoretical curve differs from its simulated counterpart by ≈ 2 dB.
Figure 4
Figure 4

SER performance of LC-ZP-OFDM receiver compared to theoretical.

VIII. Conclusion

We propose a novel reduced-complexity MMSE-based receiver for ZP-OFDM systems. We show that, by incorporating linear processing techniques, our MMSE-based receiver is able to collect full antenna and multipath diversity gains. Simulation results demonstrate that our LC-ZP-OFDM receiver outperforms the conventional MMSE-ZP-OFDM receiver, while maintaining much less complexity by avoiding channel dependent matrix inversion. By using linear processing techniques that require minimum computational complexity, the communication power is minimized at no additional hardware cost. We also propose a modified receiver that outperforms the conventional MMSE-ZP-OFDM.

The authors declare that they have no competing interests.

IX. Endnotes

Notation: . ¯ , (.)T, (.) and (.)H denote conjugate, transpose, pseudo inverse, and Hermitian transpose operations, respectively. |.| denotes the absolute value, and ||.|| denotes the Euclidean norm of a vector. [.]k,ldenotes the (k, l)th entry of a matrix, [.] k denotes the kth entry of a vector, I M denotes the identity matrix of size M, and 0M×Mdenotes all-zero matrix of size M × M. Q represents the M × M FFT matrix whose (l, k) element is given by Q ( l , k ) = 1 / M exp ( j 2 π l k / M ) and Q M - 1 = Q M H represents the M × M IFFT matrix where 0 ≤ l, kM - 1. Bold upper-case letters denote matrices and bold lower-case letters denote vectors.


Authors’ Affiliations

School of Engineering Science, Simon Fraser University, Burnaby, Canada


  1. Wang Z, Giannakis GB: Linearly precoded or coded OFDM against wireless channel fades? Proceedings of the IEEE Workshop on Signal Processing Advances for Wireless Communications Taiwan, China 2001.Google Scholar
  2. Lu WW: Compact multidimensional broadband wireless: the convergence of wireless mobile and access. IEEE Commun. Mag 2000, 119-123.Google Scholar
  3. ETSI Normalization Committee: Digital Broadcasting Systems for Television, Sound and Data Services; Framing Structure, Channel Coding and Modulation for Digital Terrestrial Television. Norme ETSI, document pr ETS 300 744. European Telecommunications Standards Institute, Sophia-Antipolis, Valbonne; 1996.Google Scholar
  4. ANSI T1E1.4 Committee Contribution: The DWMT: A Multicarrier Transceiver for ADSL using M-band Wavelets. Technical Report, ANSI; 1993.Google Scholar
  5. Broadband Radio Access Networks (BRAN): HIPERLAN Type 2 Technical Specification Part 1-Physical Layer. Eur. Telecommun. Standards Inst. (ETSI), DTS/BRAN030 003-1. 1999.Google Scholar
  6. Palomar DP, Cioffi JM, Lagunas MA: Joint Tx-Rx beamforming design for multicarrier MIMO channels: a unified framework for convex optimization. IEEE Trans. Signal Process 2003., 51(9):Google Scholar
  7. Zou W, Wu Y: COFDM: an overview. IEEE Trans. Broadcast 1995, 41: 1-8. 10.1109/11.372015View ArticleGoogle Scholar
  8. Divsalar D, Simon MK: Multiple trellis coded modulation (MTCM). IEEE Trans. Commun 1988, 36: 410-419. 10.1109/26.2765View ArticleGoogle Scholar
  9. Viterbi AJ: Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Trans. Inform. Theory 1967, IT-13: 260-269.View ArticleGoogle Scholar
  10. Lee I: Space-time bit-interleaved coded modulation for OFDM systems. IEEE Trans. Signal Process 2004, 52: 820-825. 10.1109/TSP.2003.822350MathSciNetView ArticleGoogle Scholar
  11. Liu Z, Xin Y, Giannakis GB: Linear constellation precoding for OFDM with maximum multipath diversity and coding gains. IEEE Trans. Commun 2003, 51: 416-427. 10.1109/TCOMM.2003.809791View ArticleGoogle Scholar
  12. Boutros J, Viterbo E: Signal space diversity: a power- and bandwidth-efficient diversity technique for the Rayleigh fading channel. IEEE Trans. Inform. Theory 1998, 44: 1453-1467. 10.1109/18.681321MATHMathSciNetView ArticleGoogle Scholar
  13. Hero AO, Marzetta TL: Cutoff rate and signal design for the quasistatic Rayleigh fading space-time channel. IEEE Trans. Inform. Theory 2001, 47: 2400-2416. 10.1109/18.945254MATHMathSciNetView ArticleGoogle Scholar
  14. Rong Y, Vorobyov SA, Gershman AB: Linear block precoding for OFDMsystems based on maximization of mean cutoff rate. IEEE Trans. Signal Process 2005, 53(12):4691-4696.MathSciNetView ArticleGoogle Scholar
  15. Le Nir V, Helard M: Reduced-complexity space-time block coding and decoding schemes with block linear precoding. IEE Electron. Lett 2003, 39(14):1066-1068. 10.1049/el:20030671View ArticleGoogle Scholar
  16. Le Nir V, Helard M, Le Gouable R: Space-time block codes with maximal diversity in OFDM-based systems. Proceedings of the 5th World Wireless Congress (WWC'2004) San Francisco, USA 2004.Google Scholar
  17. Muquet B, Wang Z, Giannakis GB, de Courville M, Duhamel P: Cyclic prefixing or zero padding for wireless multicarrier transmissions? IEEE Trans. Commun 2002, 50: 2136-2148. 10.1109/TCOMM.2002.806518View ArticleGoogle Scholar
  18. Alouini MS, Goldsmith A: Adaptive modulation over Nakagami channels. J. Wirel. Commun 2000, 13(1-2):119-143.View ArticleGoogle Scholar
  19. Goldsmith A, Chua S: Variable rate variable power M-QAM for fading channels. IEEE Trans. Commun. 1997, 45: 1218-1230. 10.1109/26.634685View ArticleGoogle Scholar
  20. Keller T, Hanzo L: Adaptive multicarrier modulation: a convenient framework for time-frequency processing in wireless communications. Proc. IEEE 2000, 88: 611-640. 10.1109/5.849157View ArticleGoogle Scholar
  21. Raleigh GG, Cioffi JM: Spatio-temporal coding for wireless communication. IEEE Trans. Commun 1998, 46: 357-366. 10.1109/26.662641View ArticleGoogle Scholar
  22. Keller T, Hanzo L: Adaptive multicarrier modulation: a convenient framework for time-frequency processing in wireless communications. Proc. IEEE 2000, 88: 611-640. 10.1109/5.849157View ArticleGoogle Scholar
  23. Wong K, Cheng R, Letaief K, Murch R: Adaptive antennas at the mobile and base stations in an OFDM/TDMA system. IEEE Trans. Commun 2001, 49: 195-206. 10.1109/26.898262MATHView ArticleGoogle Scholar
  24. Edfors O, Sandell M, van de Beek J-J, Wilson SK, Brjesson PO: OFDM channel estimation by singular value decomposition. IEEE Comm. Lett 1998, 46(7):931-939.View ArticleGoogle Scholar
  25. Gusmo A, Dinis R, Esteves N: On frequency-domain equalization and diversity combining for broadband wireless communications. IEEE Commun. Lett 2003, 51(7):1029-1033.View ArticleGoogle Scholar
  26. Heideman MT, Sidney Burrus C: On the number of multiplications necessary to compute a length-2n DFT. IEEE Trans. Acoust. Speech. Sig. Proc 1986, 34: 91-95. 10.1109/TASSP.1986.1164785View ArticleGoogle Scholar
  27. Duhamel P, Vetterli M: Fast Fourier transforms: a tutorial review and a state of the art. Signal Process 1990, (19):259-299.Google Scholar


© Eghbali and Muhaidat; licensee Springer. 2011

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.