• 沒有找到結果。

Space-time coding for ultra-wideband OFDM-based wireless system

N/A
N/A
Protected

Academic year: 2021

Share "Space-time coding for ultra-wideband OFDM-based wireless system"

Copied!
4
0
0

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

全文

(1)

The 47th IEEE International Midwest Symposium on Circuits and Systems

Space-Time Coding for Ultra-Wideband OFDM-based Wireless System

Shing Tenqchen“’, Ying-Haw Shu’, Min-Chang, Sun’, Wu-Shiung Feng **

‘Lab 331, Department ofElectrical Engineering, National Taiwan University. Taipei, Taiwan, R.O. C. Thunghwa Telecom Telecommunication Labs., 12. Lane 551, Sec. 5, Min-Tsu Rd.. Yang-Mei Zien, Tao-Yuan County. Taiwan 326, R.O.C.

**Department of Electronics Engineering, Chang Gung University, Taoyuan. Taiwan, R.O.C.

E-mail: ,&&~&~g~gm~ll.csv_ and p ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ - ~ m ~ . ~ ~ ~ ~ ~ ~ ~

ABSTRACT-we consider the performance analysis of beam space-time of a multiple-input multiple output (MIMO) orthogonal frequency-division multiplexing (OFDM) systems for high data rate wireless transmission. Employing multiple antennas at both the transmitter and receiver end offers a promising channel capacity, to facilitate the performance complexity tradeoff design in practice. This paper proposes the asymptotic capacity performance of Bezout WHT equalizers under i.i.d. AWGN and Rayleigh fading channels. Finally, we deploy our system with a high-data rate ultra multi-band OFDM (MB-OFDM) based wireless system for IEEE 802.15.3a.

1. INTRODUCTION

Currently, ultra-wideband (UWB) systems are gaining interests from researchers and companies due to its wireless link with high data rate [4]-[8]. The wireless indoor radio channel incurs a large number of constructive and destructive multipath components of the transported pulses at the receiver. However, the use of rake receivers, a diversity gain is achievable. Rake receivers consist of several baseband correlators or fingers which process the multipath components individually. Phases, amplitudes, and delays introduced by the channel are required for the Rake receivers and this can be solved by using a channel estimation algorithm to estimate these channel parameters.

Multi-band Orthogonal Frequency Division Multiplexing (MB-OFDM) has been standardized for a variety application, such as digital audio broadcasting (DAB) and terrestrial digital video broadcasting (DVB-T). The Basic idea of MB- OFDM is that information is transmitted using OFDM modulation on each band. OFDM carriers are efficiently generated using a 128-point IFFT/FFT. Internal precision is reduced by limiting the constellation size to QPSK. Information bits are interleaved across all bands to exploit frequency diversity and provide robustness against multi-path and interference.

The main purpose of this paper is to simulate a UWB system based on pulsed multiband over the IEEE 802.15.3 UWB channel model [6] to observe the system’s performance for a single user link with channel estimation algorithm. Here, we combine the Bezout inverse (zero-forcing) theory [2] and Walsh-Hadamard Transform (WHT) with the space-time coding (STC) techniques. Finally, via the maximum

likelihood decoding rule analysis, it can be shown that the Bezout WHT outperforms the OFDM precoder in power, rate, and receiver implementation [2].

2. PROBLEM DESCRIPTION

Channel parameter estimation in UWB communications has been previously addressed in [3] & [4] to assess the signal energy capture in Rake receivers as a function of the number of the Rake fingers. Figure 1 shows the block diagram of the MB-OFDM. The transmitted signal on each band is

I

SpaosT,mFra(uauyccdj----f Fig. 1 Block diagram of Multiband-OFDM UWB[7]-[8].

For rates up to 200 Mb/s, the input to the IFFT is forced to be conjugate symmetric (for spreading gains 2 2). The analog section of TX can be simplified when the input is real. It is needed to only implement the “ I ” portion of DAC and mixer. For rates > 200 Mb/s, need to implement full “I/Q” transmitter. For rates <: 200 Mb/s Only requires half the analog die size of a complete “I/Q” transmitter. The total of 128 tones consist of

- 100 data tones used to transmit information (constellation: - 12 pilot tones used for carrier and phase tracking. - 10 user-defined pilot tones.

-Remaining 6 tones including DC are NULL tones. - 60.6 ns zero-padded cyclic prefix provides robustness

against multi-path even in the worst channel environments.

-

9.5 ns guard interval provides sufficient time for switching between bands.

-Convolutional code of R=1/3, K =7 with generator

QPSK).

polynomial:

g,

=

[133,l,g,

= P4581,

g,

=

[

1 75

1,

puncturer & depuncturer for R=3/4. -Bit interleaving is performed in 3 stages: symbol

interleaver across OFDM, intra-symbol tone interleaver, intra-symbol cyclic shifts.

The signal transmission in a flat-fading MIMO system with nT transmit and n R receive antennas is modelled as:

x ( k )

=

Hs(k)

+

n(k)

(1)

0-7803-8346-X/04/$20.00 0 2 0 0 4 IEEE

(2)

where x(k) E

c""

S(k)

E

c"'

are sample stacks of complex-valued receiver data and source sequences, and H is the

n,

X

n,

channel transfer function.

PT

where

P

=

-

is the nominal signal to noise ratio and the MIMO system is

N

where

(IAi12

are the singular values of

"H

and the upper script of H is the Hermittian transform.

Theorem 1: With a white space-time transmission distribution, the capacity per transmitted symbol for the time- varying, discrete-time, spatio-temporal channel (J = S, V, M )

subject to a transmitted-power limit for each channel use is

I

N-l

c=-cz

N

k=o

"'

C = E, { W log, det[(I

+

A Q ) ] } c 2 n T (4) 1 N - l

= -Xlog,[det(I+

+

SNRH(e'2"''"') .(HIf

))I

N I = O

where the quantity Ink is the mutual information of the kth MIMO OFDM subchannel. Note that since the bandwidth of each sub-channel and PT is the received signal power in the ith sub-channel,

E ,

[ e ] denotes the expectation of channel

H with respect to the random variable

xi

,

.,/AJ,.

are the singular values of the channel matrix, Q is defined as

HH", n, < nT

,

I n R

is the identity matrix of

Q = {

H"H,

n,

> n,

size nR,

Hk

is an

n R

x

n,

channel matrix with its (j, i)-th entry

HJ:f',

and SNR is the signal-to-noise ratio per receive antenna.

Proof Sketch: The proof follows directly from the definition of mutual information (Theorem 1) and the white transmitter-

covariance matrix assumption. The reader is referred to [1],[5] for the complete proof.

Proposition 1: The distribution of

InR

(nR = 0, 1, . . ., N- 1) is

independent of k and given by

InR

=

log[det(InR

+

pAH,Ht)],

for

nR

=

0,1,

...,

N -

1.

where I\ = dzhg{Al(R)}yJil , H,, is an

n R x n ,

i.i.d. random matrix with

CNO,

1) entries, and

R

=

C R , .

Finally,

ll

(R)

denotes the ith eigenvalue of R.

Proof Sketch: The proof similarly follows directly from [l], [ 5 ] . The instantaneous channel capacity can be estimated by simulation.

3. Performance Analysis of STC-OFDM Systems The MB-OFDM receiver shown at Fig.2 (a)-(c), is performed the OFDM-related FFT-aided demodulation of the incoming signal samples, followed by subcarrier-based channel transfer function equalization and dispreading with the aid of inverse WHT (1WHT)for the pre-select filter.

L-l I=O

.A

J

.

.

i__l S l N W I , lrorhing

Fig. 2a The Pre-select Filter for IWHT STCI-dFDM structure.

7 \'I ' _'

Fig.2b Block diagram of IWHT STC -0FDM receiver with synchronized sampling structure.

Preambla

Fig. 2c Block diagram of IWHT STC -0FDM receiver with frequency offset estimation.

The symbol timing estimation is found by the precise estimate of the start of the band sequence of an incoming data

(3)

and finding an approximate estimation of the start of the preamble of an incoming data packet. The typical algorithm is to use periodicity of preamble sequences to perform autocorrelation and using known preamble symbols with received symbols and find peak. After packet detection, the symbol timing algorithm refines the estimate to sample level precision. The refinement is performed by calculating the cross-correlation of the received signal

r,

and a known reference

s k ,

shown in Fig. 3(a)-(c).

Due to OFDM sensitive to carrier frequency offset, the frequency offset must be estimated and corrected before actual packets start. The typical algorithm is being used by the data aided algorithm: based on known preamble sequences and cyclic prefix based algorithm is to use the inherent structure of the OFDM signal provided by cyclic prefix or periodicity of preamble sequences. The structure is shown in Figure 3(c) [SI. The channel estimation is to use preamble sequences transmitted on every subcarrier and use pilot and decision-directed data to overcome time varying channel. After frequency offset compensation, there is always some residual frequency error to cause constellation rotation. The typical algorithm is the use of data-aided methods using pilot symbols. Twelve predefined subcarriers among the transmitted data are referred as pilots in 802.15.3a. The decision-directed method is used to improve the phase estimation quality.

Fig. 3(a) Joint of band acquisition and packet detection (auto- correlation)

’_ rstlrnrrlnn

Fig. 3 (b) Symbol timing estimation (cross-correlation)

_ _ _ . ~

Frequency Oflret Sum Over

Preamble

h--w

Samplesatla Packet Angle(Sum)

I

Estimation

i

y

j Detection

i -

Y

Fig. 3(c) The frequency offset estimation for the delay adjustment of IWHT STC-OFDM.

4. Simulation Results

This section shows the results of a number of simulations that are performed to obtain the results of IEEE 802.15.3a. The main simulation parameters are based on the IEEE

802.15.3a standard and summarized in Table I, shown in Fig. 4 (a)-(f). Model simplifications/ assumptions for 802.15.3a are as follows:

Model assumptions:

0 Baseband-equivalent model (no up/down conversion), Random data transmission (no data scrambling used) 0 Fixed (selectable) number of data symbols per packet

(no pad bits used), continuous frame-to-frame operation 0 Fixed transmit power level; link-SNR specified (on-the-

fly), Idealized timing/frequency acquisition 0 Not modeled:

-

Other mandatory and optional data rates (55, 80, 110,

-

MAC/PHY interface and PLCP header (TX vector

-

Time windowing of OFDM symbols. 160,200, 320,480 Mb/s)

/RX vector, HCSRCS)

IEEE 802.15.3a Multiband OFDM - 200 Mb/s Mode [6]

Fig. 4 (b) QPSK & (c) QAM

The Simulation results of signal constellation of equalizer with QPSK & QAM rate R = 1/3, K = 7 (Convolutional

I in Fig.

I

i

/.

:tion of

Rayleigh channels with perfect parameters estimation. Fig.4(e) The results of system performance for prob. of miss detect (Pm) vs. distance (@ 110 Mb/s was averaged over 500 noise realization for 100 channels in each channel environment.

5. CONCLUDING REMARKS

In this paper, we have considered the performance analysis, design criteria, and detection algorithm of MB-OFDM systems for high data-rate wireless transmission. The main contributions are listed as follows:

1) Multi-band OFDM system can achieve more than 10 m in all multipath channels. OFDM is a well-known multipath energy capture technique. Multi-band OFDM offers multi-mode scalable devices. IWHT STC-OFDM offers the best trade-off between the transceiver architectures and various parameters in receivers.

2) The bit-error probability is determined as a function of average channel SNR, with time-domain channel taps that fade with identical independent complex Gaussian

(4)

distribution, deep frequency-domain interleaving, and [4] J. Balakrishnan, A. Batra and A. Dabak, “A multiband

ideal channel estimation. OFDM system for UWB communication,” IEEE Ultra

Wideband Systems and Technologies Con$ pp.354-358, Nov. 2003.

REFERENCES

[ l ] T. L. Marzetta and B. H. Hochwald, “Capacity of a mobile multiple antenna communication link in Rayleigh flat fading,” IEEE Trans. In$ Theory, vol. 45, pp. 139-157, Jan 1999.

[2] S. Y. Kung, Y . Wu, and X. Zhang, “Bezout Space-Time Precoders and Equalizers for MIMO Channels,” IEEE Trans. Signal Processing, vol. 50, pp.2499-25 14, Oct. 2002.

[3] V. Lottici, A. D’Andrea, U. Mengali, “Channel Estimation for Ultra-wideband Communications,” IEEE Trans. on Selected Areas in Communications, vol. 20, no. 9, pp. 1638-1645, Dec. 2002.

[ 5 ] H. Bolcskei, D. Gesbert, and A. J. Paulraj, “On the

capacity of OFDM-based spatial multiplexing systems,” IEICE Trans. On Comms., No. 2, pp. 225-234, Feb. 2002.

02490r1 P802- 15-SG3a-Channel-Modeling- Subcommittee-report-Final.zip.

[7] A. Batra et. al., “Multi-band OFDM physical layer

proposal for IEEE 802.15 task group 3a”, IEEE 802.15- 03/268r2, TI Inc., 10 Nov., 2003.

[8] J. H. Deng, “Performance Evaluation and Architecture Design for Multiband OFDM UWB System using M A T L A B , MATLAB Simulink Terasoft Conf. at Taipei June 1 & 2, 2004. [ 61 IIIP

:/!e

roup er. -.igrgi‘’rxip~~~02/ 1 5 /pi ib/2 003VarO 3 .’

Fin. 4 (a) The Simulink model of UWB

-

- Multiband OFDM 200Mb/s Mode.

Fig. 4(f) The Simulation result of spectral grim of UWB - Multiband OFDM 2OOMb/s Mode.

ulti-path Tolerance 160.6 ns 160.6 ns 160.6 ns 160.6 ns 160.6 ns 160.6 ns 160.6 ns

I

Table I: Simulation parameters, Based on the IEEE 802.15.3a Multi-band OFDM 55-480Mb/x Mode.

數據

Fig. 2a The Pre-select  Filter for IWHT STCI-dFDM  structure.
Fig. 4 (b) QPSK  &amp;  (c) QAM
Table I: Simulation parameters,  Based on the IEEE 802.15.3a Multi-band OFDM 55-480Mb/x  Mode

參考文獻

相關文件

Real Schur and Hessenberg-triangular forms The doubly shifted QZ algorithm.. Above algorithm is locally

&#34;Extensions to the k-Means Algorithm for Clustering Large Data Sets with Categorical Values,&#34; Data Mining and Knowledge Discovery, Vol. “Density-Based Clustering in

Then, we recast the signal recovery problem as a smoothing penalized least squares optimization problem, and apply the nonlinear conjugate gradient method to solve the smoothing

A derivative free algorithm based on the new NCP- function and the new merit function for complementarity problems was discussed, and some preliminary numerical results for

In this chapter we develop the Lanczos method, a technique that is applicable to large sparse, symmetric eigenproblems.. The method involves tridiagonalizing the given

Like the proximal point algorithm using D-function [5, 8], we under some mild assumptions es- tablish the global convergence of the algorithm expressed in terms of function values,

• Use table to create a table for column-oriented or tabular data that is often stored as columns in a spreadsheet.. • Use detectImportOptions to create import options based on

The GCA scheduling algorithm employs task prioritizing technique based on CA algorithm and introduces a new processor selection scheme by considering heterogeneous communication