• 沒有找到結果。

Low-complexity time-domain linear equaliser for single-carrier block transmissions

N/A
N/A
Protected

Academic year: 2021

Share "Low-complexity time-domain linear equaliser for single-carrier block transmissions"

Copied!
2
0
0

加載中.... (立即查看全文)

全文

(1)

Low-complexity time-domain linear

equaliser for single-carrier block

transmissions

C.-Y. Ma and C.-C. Huang

Traditionally, frequency-domain equalisers have been used to equalise the single-carrier block transmission (SCBT) signals. However, to support the frequency-domain equaliser, two fast Fourier transform modules are required, which will increase the circuit complexity and chip area. A low-complexity time-domain linear equaliser for SCBT is proposed, which is less complicated than conventional frequency-domain equalisers, at the expense of an acceptable degradation in per-formance. For instance, for 60 GHz conference room non-line-of-sight channels, the complexity can be reduced by half at the expense of a 1.5 dB performance loss.

Introduction: Single-carrier block transmission (SCBT) has attracted a lot of attention in recent years mainly for three reasons. First, the SCBT signals can be simply equalised by a one-tap equaliser in the frequency-domain (FD) through the computational efficient fast Fourier transform (FFT) operation [1–4]. Secondly, since SC modulation is adopted, SCBT has relatively low peak-to-average power ratio compared with multicarrier modulation systems. Lastly, for SCBT, multipath diversity gain can be obtained if the equaliser is properly designed. Because of these advantages, SCBT has recently been employed in 60 GHz high data-rate communication systems, e.g. IEEE 802.11ad [5].

It is commonly believed that for SCBT, FD linear equalisers are much simpler than time-domain linear equalisers since computational efficient FFT operation can be applied to transform the signal from time-domain to FD. However, compared with orthogonal frequency division multiplexing (OFDM), which is also employed in IEEE 802.11ad, FD equalisation for SCBT requires an additional FFT operation. This requirement may lead to either considerable increase in the chip area or doubling of the circuit clock rate. For example, it is reported in [6] that 77% of the chip area of the communication baseband IC is occupied by the two FFT modules. Since the additional FFT module drastically increases the chip area and greatly raises the cost, designing low-complexity time-domain equalisers to avoid the use of the additional FFT module is of crucial importance.

Therefore, in this Letter, we propose a simple and well-performed time-domain linear equaliser to avoid the additional FFT operation. We consider the SCBT mode defined in IEEE 802.11ad [5] throughout this Letter, but the proposed method can be directly applied to other block transmission systems, for example, CDMA [4].

Conventional SC-FD equalisation: An SCBT system with block length N is considered in this Letter. The time-domain transmitted signal vector x is defined as

x W x1 · · · xN

 T

(1) We assume that the M leading samples in each block, namely x1,…, xM, are used to transmit data symbols and xM+1,…, xNare used to transmit pre-defined reference signals. The frame format of IEEE 802.11ad SCBT signals is illustrated in Fig.1. In each transmission block, M = 448 samples are used for data transmissions, and Ga64 is the pre-defined reference signal with 64 samples. Hence, the total block length N equals to 448 + 64 = 512.

Ga64 data 448 Ga64 data 448 Ga64 data 448 Ga64

Fig. 1 Frame format of IEEE 802.11ad SCBT transmitted signals

Using the reference signals as the cyclic-prefix, the time-domain received signal vector yW y1 · · · yN

 T

can be expressed as

y = Hx + z (2)

whereH is the time-domain channel circular convolution matrix and z is the AWGN vector. We define F as the unitary FFT matrix. Then, the FD received signal vectoryFcan be written as

yF = Fy = LFx + Fz (3)

where Λ = FHF† is a diagonal matrix representing the channel fre-quency response.

For the traditional single-carrier frequency-domain equaliser (SC-FDE) [1, 4], the received FD signal is equalised by a one-tap equaliser. Afterwards, the time-domain equalised outputr is given by

r W r1 · · · rN

 T

= F†WyF (4) whereW, a diagonal matrix, is the equalisation matrix whose diagonal entries are the equaliser coefficients. In this Letter, we consider the MMSE equaliser; hence, the kth diagonal element ofW, namely Wk, equals to L∗k

 

/ |Lk|2+s2z

 

 

, whereΛk is the kth diagonal element ofΛ ands2

z is the AWGN power.

Finally, the time-domain equalised signalr is fed into an entry-wise minimum-distance symbol detector for data detection.

In summary, the block diagram of the conventional FDE is illustrated in Fig.2. Compared with the OFDM receivers, the FDE for SCBT requires an additional FFT module (the shadow block in Fig. 2). Since the additional FFT module will greatly increase the chip area [6], we propose a time-domain equaliser to avoid the use of the additional FFT module in the following.

detected data detector IFFT r y W FFT

Fig. 2 Block diagram of conventional FDE for SCBT

Proposed time-domain linear equaliser: From (2) and (3), we can rewrite (4) as

r = GHx + Gz = Gy (5) whereG = F†WF is a circular convolution matrix. Thus, the output

rn { }N

n=1in (5) can be interpreted as the circular convolution of the time-domain received signal yn

 N

n=1 with the discrete-time finite impulse response (FIR) filter gn

 N

n=1, where gn  N

n=1 is the inverse FFT (IFFT) of W{ }k Nk=1. That is to say, the conventional SC-FDE can be equivalently implemented in domain by convolving the time-domain receive signal {yn} with the time-domain FIRfilter IR {gn}. However, {gn} is, in general, an N-tap FIRfilter, which is too compli-cated to implement in reality.

Therefore, we use a K-tap FIRfilter ˜g to approximate the desired response. The problem can be formulated as

min ˜g[CNF˜g − Fg 2 2 s.t. ˜g0≤ K (6) where gW g1 · · · gN  T

. Since problem (6) is NP-hard, we solve the following optimisation problem instead, which is an approximation of (6) by using the Cauchy-Schwartz inequality

min ˜g[CN˜g − g

2

2 s.t. ˜g0≤ K (7) Solving problem (7) is equivalent tofinding the largest K elements of

|gn|  N−1

n=0, and this problem can be easily solved.

Comparison of computational complexity: The proposed algorithm involves an IFFT operation in the calculation of {gn}. Since IEEE 802.11ad supports both SCBT and OFDM transmission modes, there is already an IFFT module, which is necessary for the OFDM trans-ceiver, in the baseband communication circuit; namely, no additional FFT module is required for the proposed method. A K-tap FIRfilter is required in the proposed method, but the increase in circuit area and computational complexity can be controlled by selecting an appro-priate value of K at the expense of a tolerable performance degradation. The computational complexity for the calculation of FD equalisation coefficients {Wk} and the time-domain K-tap FIR coefficients ˜g is a minor issue. Typically, the channel coherent time for IEEE 802.11ad applications is so long that the complexity of the above-mentioned cal-culations can be ignored. Therefore, we only compare the computational complexity of the equalisation in the following.

To execute the FD equalisation, two N-point FFT operations and N complex multiplications are required. For convenience, we assume that an N-point FFT operation requires N log2N complex multiplications. Therefore, the number of complex multiplications required by the FD

(2)

equalisation for IEEE 802.11ad SCBT mode is 2× FFT + N (multiplications)

= 2 × 512 log2512+ 512 (multiplications)

= 9728 (multiplications) (8) On the other hand, the number of complex multiplications required by the proposed method with a K-tap FIRfilter is

M× K = 448 × K (multiplications) (9) It it noteworthy that the number of multiplications of the proposed time-domain equaliser will be approximately the same as the traditional FDE when K = 21.

Simulation results: The physical layer system parameters follow the IEEE 802.11ad specification [5], and QPSK is employed in our simu-lations. We use the conference room non-line-of-sight (NLOS) STA– STA sub-scenario of the 60 GHz channel model [7], which is suggested by IEEE 802.11ad, as our simulation channel model. All the channel-dependent parameters are set as the default values in [7].

Fig.3shows the bit error rate (BER) performance of the MMSE FDE and the proposed method with different values of K. It is obvious that the proposed method has a degradation in performance compared with FDE-MMSE, but the computational complexity can be greatly reduced. For example, for K = 15, there is about 1 dB performance loss at the BER level 10−3, but the number of complex multiplications is reduced by 31%. Taking the case K = 10 as another example, the number of complex multiplications is reduced by 54% at the expense of a 1.5 dB performance loss at the BER level 10−3.

10–1 10–2 10–3 proposed method, K=2 proposed method, K=5 proposed method, K=10 proposed method, K=15 proposed method, K=20 FDE-MMSE 10–4 2 3 4 5 6 Eb/No, dB BER 7 8 9 10

Fig. 3 Performance of FDE-MMSE and proposed method with different values of K

Conclusion: In this Letter, we propose a simple time-domain linear equaliser to replace the conventional FDEs for SCBT. The proposed equaliser can effectively reduce the computational complexity at the expense of an acceptable degradation in performance. Our simulation results show that in the 60 GHz conference room NLOS channels, the proposed method can reduce computational complexity by 54% at the expense of a 1.5 dB performance loss. In general, the proposed method provides an efficient way to make a trade-off between com-plexity and BER performance.

Acknowledgment: This work was supported by the National Science Council of the Republic of China (Taiwan) under grant NSC 100-2220-E-009-025.

© The Institution of Engineering and Technology 2013 17 April 2013

doi: 10.1049/el.2013.1294

C.-Y. Ma and C.-C. Huang (Institute of Communications Engineering, National Chiao Tung University, Hsin-Chu, Taiwan)

E-mail: ma_chun_ying.cm93@g2.nctu.edu.tw References

1 Falconer, D., et al.:‘Frequency domain equalization for single-carrier broadband wireless systems’, IEEE Commun. Mag., 2002, 40, pp. 58–66 2 Li, Y., McLaughlin, S., and Cruickshank, D.G.M.:‘Bandwidth efficient single carrier systems with frequency domain equalisation’, Electron. Lett., 2005, 41, pp. 857–858

3 Wang, Y., et al.:‘Cyclic prefixed single carrier transmission in ultra-wideband communications’, IEEE Trans. Wirel. Commun., 2006, 5, pp. 2017–2021

4 Adachi, F., Sao, T., and Itagaki, T.: ‘Performance of multicode DS-CDMA using frequency domain equalisation in frequency selective fading channel’, Electron. Lett., 2003, 39, pp. 239–241

5 Abu-Surra, S., et al.: ‘IEEE P802.11 wireless LANs PHY/MAC

Complete Proposal Specification’, doc.: IEEE 802.11-10/0433r2. Available at http://www.ieee802.org/11/Reports/tgadupdate.htm 6 Yeh, F.-C., et al.:‘A SC/OFDM dual mode frequency-domain equalizer

for 60 GHz multi-Gbps wireless transmission’. Proc. IEEE Int. Symp. VLSI Design, Automation, and Test, Hsinchu, Taiwan, April 2011, pp. 1–4

7 Maltsev, A., et al.:‘Channel models for 60 GHz WLAN systems’, doc.: IEEE 802.11-09/0334r8, May 2010. Available at http://www.ieee802. org/11/Reports/tgadupdate.htm

數據

Fig. 3 shows the bit error rate (BER) performance of the MMSE FDE and the proposed method with different values of K

參考文獻

相關文件

The coordinate ring of an affine variety is a domain and a finitely generated k-algebra.. Conversely, a domain which is a finitely generated k-algebra is a coordinate ring of an

The coordinate ring of an affine variety is a domain and a finitely generated k-algebra.. Conversely, a domain which is a finitely generated k-algebra is a coordinate ring of an

GCG method is developed to minimize the residual of the linear equation under some special functional.. Therefore, the minimality property does not hold... , k) in order to construct

A subgroup N which is open in the norm topology by Theorem 3.1.3 is a group of norms N L/K L ∗ of a finite abelian extension L/K.. Then N is open in the norm topology if and only if

– The futures price at time 0 is (p. 275), the expected value of S at time ∆t in a risk-neutral economy is..

It is interesting that almost every numbers share a same value in terms of the geometric mean of the coefficients of the continued fraction expansion, and that K 0 itself is

„ There is no Hamilton circuit in G2 (this can be seen by nothing that any circuit containing every vertex must contain the edge {a,b} twice), but G2 does have a Hamilton

* All rights reserved, Tei-Wei Kuo, National Taiwan University, 2005..