Multiuser MIMO OFDM Based TDD TDMA For Next Generation Wireless Communication Systems

Wireless Pers Commun (2010) 52:289324
DOI 10.1007/s11277-008-9649-0
Multiuser MIMO OFDM Based TDD/TDMA for Next
Generation Wireless Communication Systems
Lu Zhaogan Rao Yuan Zhang Taiyi Wang Liejun
Published online: 2 December 2008
Springer Science+Business Media, LLC. 2008
Abstract Multiple-input multiple-output (MIMO) wireless technology in combination
with orthogonal frequency division multiplexing (MIMO OFDM) is an attractive air-inter-
face solution for next-generation wireless local area networks (WLANs), wireless metro-
politan area networks (WMANs), and fourth-generation mobile cellular wireless systems.
In this paper, one multiuser MIMO OFDM systems with TDD/TDMA was proposed for
next-generation wireless mobile communications, i.e., TDD/TDMA 4G, which can avoid
or alleviate the specic limitations of existing techniques designed for multiuser MIMO
OFDM systems in broadband wireless mobile channel scenarios, i.e., bad performance and
extreme complexity of multiuser detectors for rank-decient multiuser MIMO OFDM sys-
tems with CDMA as access modes, extreme challenges of spatial MIMO channel estimators
in rank-decient MIMO OFDM systems, and exponential growth complexity of optimal
sub-carrier allocations for OFDMA-based MIMO OFDM systems. Furthermore, inspired
from the Steiner channel estimation method in multi-user CDMA uplink wireless channels,
we proposed a new design scheme of training sequence in time domain to conduct channel
estimation. Training sequences of different transmit antennas can be simply obtained by trun-
cating the circular extension of one basic training sequence, and the pilot matrix assembled
by these training sequences is one circular matrix with good reversibility. Anovel eigenmode
transmission was also given in this paper, and data symbols encoded by spacetime codes
can be steered to these eigenmodes similar to MIMO wireless communication systems with
single-carrier transmission. At the same time an improved water-lling scheme was also
described for determining the optimal transmit powers for orthogonal eigenmodes. The clas-
sical water-lling strategy is rstly adopted to determine the optimal power allocation and
correspondent bit numbers for every eigenmode, followed by a residual power reallocation
L. Zhaogan (B) Z. Taiyi W. Liejun
School of Electronic & Information Engineering, Xian Jiaotong University,
Xian, Peoples Republic of China
e-mail: luzhaogan@mailst.xjtu.edu.cn
R. Yuan
Software Engineering School, Xian Jiaotong University,
Xian, Peoples Republic of China
123
290 L. Zhaogan et al.
to further determine the additional bit numbers carried by every eigenmode. Compared with
classical water-lling schemes, it can also obtain larger throughputs via residual power alloca-
tion. At last, three typical implementation schemes of multiuser MIMO OFDMwith TDMA,
CDMA and OFDMA, i.e., TDD/TDMA 4G, VSF-OFCDM and FuTURE B3G TDD, were
tested by numerical simulations. Results indicated that the proposed multiuser MIMOOFDM
system schemes with TDD/TDMA, i.e., TDD/TDMA 4G, can achieve comparable system
performance and throughputs with low complexity and radio resource overhead to that of
DoCoMo MIMO VSF-OFCDM and FuTURE B3G TDD.
Keywords Multiple-input multiple-output Orthogonal frequency division multiplexing
Multiuser diversity Link adaptation Channel estimation
1 Introduction
In recent years, orthogonal frequency-division multiplexing (OFDM) [1] has emerged as
a promising air-interface technique. In the context of wired environments, OFDM tech-
niques are also known as Discrete MultiTone (DMT) [2] transmissions and are employed
in the American National Standards Institutes (ANSI) Asymmetric Digital Subscriber Line
(ADSL) [3], High-bit-rate Digital Subscriber Line (HDSL) [4], and Very-high-speed Dig-
ital Subscriber Line (VDSL) [5] standards as well as in the European Telecommunication
Standard Institutes (ETSI) [6] VDSL applications. In wireless scenarios, OFDM has been
advocated by many European standards, such as Digital Audio Broadcasting (DAB) [7],
Digital Video Broadcasting for Terrestrial Television (DVB-T) [8], Digital Video Broad-
casting for Handheld Terminals (DVB-H) [9], Wireless Local Area Networks (WLANs)
[10], and Broadband Radio Access Networks (BRANs) [11]. Furthermore, OFDM has been
ratied as a standard or has been considered as a candidate standard by a number of stan-
dardization groups of the Institute of Electrical and Electronics Engineers (IEEE), such
as IEEE 802.11a [12], IEEE 802.11g [13], IEEE 802.11n [14], IEEE 802.16 [15], and
so on.
The main merit of OFDM is the fact that the radio channel is divided into many narrow-
band, low-rate, frequency-nonselective sub-channels or sub-carriers, so that multiple symbols
can be transmitted in parallel, while maintaining a high spectral efciency. Each sub-carrier
may also deliver information for a different user, resulting in a simple multiple access scheme
known as orthogonal frequency division multiple access (OFDMA) [16]. This enables dif-
ferent media such as video, graphics, speech, text, or other data to be transmitted within
the same radio link, depending on the specic types of services and their quality-of-service
(QoS) requirements. Furthermore, in OFDM systems different modulation schemes can be
employed for different sub-carriers or even for different users. Besides its implementation-
al exibility, the low complexity required in transmission and reception with the attainable
high performance, render OFDM a highly attractive candidate for high data-rate communi-
cations over time-varying frequency-selective radio channels. Incorporating channel coding
techniques into OFDM systems, which results in Coded OFDM (COFDM) [17], allows us
to maintain robustness against frequency-selective fading channels, where busty errors are
encountered at specic sub-carriers in the frequency domain (FD). Additionally, when using
a cyclic prex [18], OFDM exhibits a high resilience against the ISI introduced by multi-
path propagation. Moreover, based on conventional code divisions, an orthogonal frequency
and code division multiplexing system (OFCDM) [19] could be used to combat the severe
multi-path interference. Two dimensional spreading with both time and frequency domain
123
Multiuser MIMO OFDM Based TDD/TDMA 291
spreading is employed in the OFDCM system. The total spreading factor (N) is the prod-
uct of time domain spreading factor (N
t
) and frequency domain spreading factor (N
F
), i.e.,
N = N
t
N
F
. In order to work in different cell environments, orthogonal variable spreading
factor (VSF) is adopted for two-dimensional spreading, and the resultant OFCDM system is
called VSF-OFCDM [20, 21].
However, high data-rate wireless communications have attracted significant interest and
constitute a substantial research challenge in the context of the emerging WLANs and
other indoor multimedia networks. Specifically, the employment of multiple antennas at
both the transmitter and the receiver, which is widely referred to as the MIMO technique
[22], constitutes a cost-effective approach to high-throughput wireless communications. As
a key building block of next-generation wireless communication systems, MIMOs are capa-
ble of supporting significantly higher data rates than the universal mobile telecommuni-
cations system (UMTS) and the high-speed downlink packet access (HSDPA)-based 3G
networks [23]. Briey, compared to single-input single-output (SISO) systems, the capac-
ity of a wireless link increases linearly with the minimum of the number of transmitter or
the receiver antennas [22]. The data rate can be increased by spatial multiplexing with-
out consuming more frequency resources and without increasing the total transmit power.
Furthermore, dramatic reduction of the effects of fading due to the increased diversity
could also be done, though this is particularly benecial when the different channels fade
independently.
In order to provide more larger data transmission in wireless doubly selective fading chan-
nel scenarios, the combination of MIMOand OFDMis an attractive air-interface solution for
next-generation WLANs, wireless metropolitan area networks (WMANs), and fourth-gen-
eration mobile cellular wireless systems. MIMO OFDM, which is claimed to be invented
by Airgo Networks [24], has formed the foundation of all candidate standards proposed
for IEEE 802.11n [14]. In recent years, this topic has attracted substantial research efforts,
addressing numerous aspects, such as system capacity [25], space/time/frequency coding
[26], peak-to-average power ratio (PAPR) control [27], channel estimation [28], receiver
design [29], etc. Recently, Paulraj et al. [30] and Stber et al. [31] provided compelling over-
views of MIMO OFDM communications. Furthermore, Nortel Networks has developed a
MIMOOFDMprototype [31] during late 2004, which demonstrates the superiority of MIMO
OFDM over todays networks in terms of the achievable data rate. So, up to now, several
fourth-generation mobile cellular wireless systems based MIMO and OFDM were given
by recent literatures [3241], such as VSF-OFCDM by Japan DoCoMo [3234] (DoCoMo
MIMO VSF-OFCDM), TDD-MIMO-OFDM by China FuTURE project [3538] (FuTURE
B3G TDD), TDD-CDM-OFDM as the evolved version of TD-SCDMA by Datang Mobile
[3841], and so on.
Undoubtedly, MIMO OFDM has demonstrated a high potential for employment in future
high rate wireless communication systems [30]. However, the associated detection and chan-
nel estimation techniques found in the multiuser MIMO OFDM literature have various
limitations. In this paper, we rstly discussed specic limitations of existing techniques
designed for multiuser MIMO OFDM systems, and then multiuser MIMO OFDM systems
based TDD/TDMA for fourth-generation mobile wireless communications (TDD/TDMA
4G) was given and compared to those systems with OFCDM and OFDMA as multiuser
access modes in terms of multiuser diversity, channel estimation overhead and complex-
ity. Then, we showed different numerical simulation results of proposed multiuser MIMO
OFDM systems based TDD/TDMA and other FuTURE B3G TDD and VSF-OFCDM
systems, respectively.
123
2 Limitations of Existing Multiuser MIMO OFDM Systems
2.1 Multiuser Detection
Among the various multi-user detectors (MUDs), the classic linear least squares (LS) [1, 42]
and MMSE [1, 29, 42] MUDs exhibit a low complexity at the cost of a limited performance.
By contrast, the high-complexity optimum maximum-likelihood (ML) MUD [1, 42] is capa-
ble of achieving the best performance owing to invoking an exhaustive search, which imposes
a computational complexity typically increasing exponentially with the number of simulta-
neous users supported by the MIMO OFDM system and, thus rendering its implementation
prohibitive in high-user-load scenarios.
In the literature, a range of suboptimal nonlinear MUDs have also been proposed, such
as for example the MUDs based on successive interference cancellation (SIC) [1, 42] or par-
allel interference cancellation (PIC) [1, 42] techniques. Explicitly, instead of detecting and
demodulating the users signals in a sequential manner, as the LS and MMSE MUDs do, the
PIC and SIC MUDs invoke an iterative processing technique that combines detection and
demodulation. More specifically, the output signal generated during the previous detection
iteration is demodulated and fed back to the input of the MUD for the next iterative detection
step. Similar techniques invoking decision-feedback have been applied also in the context of
classic channel equalization.
However, since the philosophy of both the PIC and SIC MUDs is based on the principle
of removing the effects of the interfering users during each detection stage, they are prone to
error propagation occurring during the consecutive detection stages due to the erroneously
detected signals of the previous stages [1]. In order to mitigate the effects of error propagation,
an attractive design alternative is to simultaneously detect all the users signals, rather than
invoking iterative interference cancellation schemes. Recently, another family of multiuser
detection schemes referred to as sphere decoders (SDs) [43, 44] as well as their derivatives
such as the optimized hierarchy reduced search algorithm (OHRSA)-aided MUD [45], have
also been proposed for multiuser systems, which are capable of achieving ML performance
at a lower complexity. Other MUD techniques, for example those based on the minimum bit
error rate (MBER) MUD algorithms [46] have also been advocated.
As far as we are concerned, however, most of the above-mentioned techniques were pro-
posed for the systems, where the number of users N is less than or equal to the number
of receivers Q, referred to here as the under-loaded or fully loaded scenarios, respectively.
Nonetheless, in practical applications it is possible that N exceeds Q, which is often referred
to as a rank-decient scenario, where we have no control over the number of users roam-
ing in the base stations coverage area. In rank decient systems the (Q N)-dimensional
MIMO channel matrix representing the (Q N) number of channel links becomes singular
and, hence, noninvertible, thus rendering the degree of freedom of the detector insufciently
high for detecting the signals of all the transmitters in its vicinity. This will catastrophically
degrade the performance of numerous known detection approaches, such as for example
the Vertical Bell Labs Layered SpaceTime architecture (V-BLAST) detector of [43], the
LS/MMSE algorithms of [1, 42] and the QR Decomposition combined with the M-algorithm
(QRD-M) algorithm of [47].
2.2 Channel Estimation
In MIMO OFDM systems accurate channel estimation is required at the receiver for the sake
of invoking both coherent demodulation and interference cancellation. Compared to single-
123
input single-output (SISO) systems, channel estimation in the MIMOscenario becomes more
challenging, since a significantly increased number of independent transmitter receiver chan-
nel links have to be estimated simultaneously for each sub-carrier. Moreover, the interfering
signals of the other transmitter antennas have to be suppressed.
In the literature, a number of blind channel estimation techniques have been proposed for
MIMO OFDM systems [48], where an attempt is made to avoid the reduction of the effective
throughout by dispensing with the transmission of known FD channel sounding pilots. How-
ever, most of these approaches suffer from either slow convergence rates or performance
degradation, owing to the inherent limitations of blind search mechanisms. By contrast,
the techniques beneting from explicit training with the aid of known reference/pilot signals
are typically capable of achieving a better performance at the cost of a reduced effective
systemthroughput. For example, Li et al. [49] proposed an approach of exploiting both trans-
mitter diversity and the delay prole characteristics of typical mobile channels, which was
further simplied and enhanced in [28, 29, 50], respectively. Other schemes employed MMSE
[50], constrained least-squares (CLS) [51], iterative LS [39], QRD-M [52] as well as second-
order statistics (SOS)-based subspace estimation [53] or techniques based on the received
signals time-of-arrival (TOA) [54], etc. Some researchers have focused their attention on
designing optimumtraining patterns or structures [28]. Furthermore, various joint approaches
combining channel estimation with data symbol detection at the receiver were also proposed
for CDMA [54], SISO OFDM [55] and MIMO OFDM [52] systems.
However, in the context of BLAST or SDMA type multiuser MIMO OFDM systems, all
channel estimation techniques found in the literature were developed under the assumption
of either the under-loaded [53] or the fully loaded [51, 54] scenario mentioned above. Unsur-
prisingly, in rank-decient MIMO OFDM systems the task of channel estimation becomes
extremely challenging, since the associated significant degradation of the rank-decient
MUDs performance will inevitably result in a further degraded performance of the asso-
ciated channel estimators, especially in decision-directed type receivers, which are quite
sensitive to error propagation [1].
2.3 Sub-carrier Allocations
In traditional OFDMA system, e.g., 802.16 [56], different users are assigned different fre-
quency basis vectors so that each users signals can be detected at different frequency bands
without interfering with one other. As a result, OFDMA enjoys the merit of easy decoding
at the user side. Such simplicity is particularly appealing during downlink operations where
the processing power at user terminals is often limited. For xed or portable applications
where the radio channels are slowly varying, an intrinsic advantage of OFDMA over other
multiple access methods is its capability to exploit the so-called multiuser diversity embed-
ded in diverse frequency-selective channels [5759]. The promise of simply receivers and
high system performance has landed OFDMA as one of the prime multiple access schemes
for future generation broadband wireless networks, e.g., 802.16a-e.
In principle, OFDMA and MIMO can be synergistically integrated to offer the benets
of both system simplicity and high performance. Such is indeed an active topic within the
IEEE802.16/20 standardization bodies. Despite these promises, a fewfundamental questions
remain as whether or not OFDMA/MIMO is the right choice for multiuser communications.
For example, the optimality of OFDMA/MIMOin the multiuser multi-carrier systemis yet to
be established. To achieve the capacity bound however, one must solve a multiuser sub-car-
rier allocation and the optimal power allocation jointly. The computational cost for nding
123
the optimal solution is exponential with respect to the number sub-carriers and polynomial
with respect to the number of users. However, for the suboptimal sub-carrier allocation cri-
teria [60] for OFDMA MIMO systems, namely, the Product-criterion and the Sum-criterion,
the computation complexity of these suboptimal approaches are still grow linearly with the
number of users and the number of sub-carriers.
3 Overview of Multiuser MIMO OFDM with TDD/TDMA
The target frequency band for TDD/TDMA4Gis 25GHz due to favorable propagation char-
acteristics and low radio frequency (RF) equipment cost. The broadband channel is typically
non-LOS channel and includes impairments such as time-selective fading and frequency-
selective fading. According to technical requirements of the broadband cellular channel and
constraints of practical of hardware and RF, the physical (PHY) design of TDD/TDMA 4G
systems is given in following.
3.1 System Parameters
The time interval of channel estimation and the sub-carrier separation for multiple-carrier
transmission are determined by coherence time and bandwidth of wireless channels, respec-
tively. So, coherence time and bandwidth of target channels for TDD/TDMA 4G systems, is
rstly determined in followings. As the proposed TDD/TDMA 4G systems can t for target
cellular channel scenarios, we consider the typical multi-path fading propagation conditions
[61] as target scenarios, and use the ITUVehicular Channel Models (channel B) [61] as target
cellular channels.
According to the tapped-delay-line parameters of the ITUVehicular Channel (channel B),
which has maximum root mean square delay
rms
= 4, 000ns, its coherence bandwidth (B
c
)
can be achieved by [62].
B
c
=
1
5
rms
= 50 kHz (1)
For mobile stations (MS) with 500km/h, the channel coherence time (T
c
) is calculated by its
corresponding Doppler frequency ( f
d
= 924.3Hz) [62], i.e.,
T
c
=
_
9
16 f
2
d
= 1.07 ms (2)
As pointed out in literature [63], it is suitable to take one third of coherence bandwidth (B
c
)
as sub-carrier frequency spacing, for the reasons of complexity of FFT for small frequency
spacing and poor performance for large frequency spacing. Firstly, guard time (T
G
) is taken
as four times the root mean square delay of cellular channels, i.e., T
G
= 16us. Subsequently,
the length of OFDM symbols (T
s
) is taken as ve times that of guard time, i.e., T
s
= 80us.
So, subcarrier spacing (f ) is given as
f =
1
T
s
T
G
= 15.625 kHz (3)
123
Ts1 Ts2 Ts3 Ts4 Ts5
675us
Guard Slot
96chips
Ts6 Ts0 1.28Mchips
DwPTS
96chips
UpPTS
160chips
Switching
Point
Uplink Slot
Sub-frame (5ms)
Data(352chips) Data(352chips) Mimable
144chips
GP
16chips
Downlink Slot
Fig. 1 Frame structure of TD-SCDMA with 7 data time slots, 2 synchronization slots and 1 switch slots for
up links and down links
Then, the 20MHz bandwidth can be divided into 1,280 sub-channels rather than the number
of 2 integer power. In order to efciently implement FFT, carrier number (K) is assumed to
2,048, and the subcarrier spacing is nally given as
f =
B
K
= 9.765625 kHz (4)
where B denotes channel bandwidth (B = 20MHz).
In practical OFDM systems, many sub-carriers are used as guard bands and DC carrier
to keep interference from other systems. If carrier spacing is taken as 9.765625kHz, many
sub-carriers could not be utilized completely. So, in order to increase spectrum efciency,
carrier spacing should be larger that given in (4). Here, the carrier spacing for 802.16a wire-
less local networks [64], is taken as the carrier spacing of TDD/TDMA 4G systems, i.e.,
f = 11.16kHz, which is much smaller than the coherence bandwidth as showed in (3).
The rst 127 and last 128 sub-carriers are used as lower frequency and higher frequency guard
bands respectively, and DC carrier is reserved. The residual 1,792 sub-carriers are used to
transport data symbols, completely, without pilot symbols inserted into xed sub-carriers.
3.2 Frame Structure
In order to meet the requirement [65] of fast beamforming in high moving speed as 120km/h
when the smart antenna technology is deployed, the length of radio sub-frame is taken as
5ms similar to that of TD-SCDMA radio sub-frame as shown by Fig. 1, other than 10ms in
WCDMA/TDD systems.
As shown in Fig. 2, a radio frame with duration of 5ms is subdivided into seven main
time slots (TS) of 675s duration each and four special time slots: down link synchroniza-
tion (DwPTS), switch slot from down links to up links (TTG slot), up link synchronization
(UpPTS), and switch slot from up links to down links (RTG slot). Time slot TS0 is always
used for down links, whereas the other time slots can be used for either up links or down links,
depending on exible switching point conguration. The location information about TTG
Slot, UpPTS and switch points would be sent to mobile stations by information transported in
TS0. As the synchronization slot for down links, DwPTS can calibrate the synchronization
between BS and MS, estimate and compensate carrier frequency offset due to frequency
drift of carrier generators at transmitter and receivers. So does the UpPTS for up links. Due
to the requirement of synchronization accuracy of timing and carriers, their durations are
determined to 75us so that BS and MS can achieve the same synchronization performance.
For systems with TDD, switch slots between up links and down links should be greater than
the maximum round time of radio between transmitter and receivers, that is double of the
123
Ts1 .... .... TsN
675us
TTG Slot (75us)
Ts1
DwPTS (75us)
UpPTS (75us) RTG Slot (50us)
Uplink Slot Downlink Slot
Sub-frame (5ms)
TsM
Fig. 2 Frame structure of TDD/TDMA 4G systems with 7 data time slots, 2 synchronization slots and 2
switch slots for up links and down links
TS 0 TS 1 TS 2 TS 3 TS 4 TS 5
...
TS 7
Sync TS Short TS Long TS
Radio frame 5 ms
1 2 3 1 P 1 2 3 4 5 P
P
1 2 3 4 . P . .
1
3
Sync Sync
Guard time 1
106 s
Data
Switch point
Pilot
P
Guard time 2
15 s
Fig. 3 Frame structure of FuTURE B3G TDD systems with 1 synchronization slot, 2 short data time slots,
5 long data time slots, and 1 switch point for uplinks and downlinks
Forward link
Reverse link
(a)
(b)
Fig. 4 Frame structure of two slots with duration 0.5ms for DoCoMo 4G VSF-OFCDM forward links and
MC-CDMA reverse links, where time and frequency domain spreading are used to improve system diversity
gains
maximum radio delay proles [64]. According to the proles of the ITU Vehicular Channel
(channel B), after refering to frame structure in 802.16a TDD [64] and inital frame stru-
acture in TD-SCDMA [66], the durations for TTG and RTG is 75 and 50us, respectively,
under the limation of the 5ms radio sub-frame length. Furthermore, we also give the radio
frame structures of FuTRUE B3G TDD and DoCoMo 4G schemes, as shown by Figs. 3, 4,
respectively.
123
Fig. 5 Burst structure of
TDD/TDMA 4G systems, where
Midamble is training sequence
for channel estimation in time
domain and the estimated
channel information is used to
decoding data symbols before
and after Midamble
S1 S2 Midamble S3 S4
125us 175us
Slot (675us)
256 256 128
1536
Fig. 6 Structure of synchronization slot for TDD/TDMA4Gsystems, where timing synchronization and ne-
coarse carrier frequency synchronization can be done by identical training sequences distributed in different
intervals
3.3 Burst Structure
The burst structure of the data time slots consists of four data blocks and one training signal
for channel estimation in time domain, as showed in Fig. 5. Actually, one data block is one
MIMOOFDMsymbol, whose duration is 125us, while midamble is the training symbols for
channel estimations in time domain and the estimated channel information is used to decode
data symbols before and after midamble codes. The sample rate of IFFT/FFT for data blocks
is 20.48MHz.
3.4 Synchronization Slots
In proposed TDD/TDMA 4G systems, links between BS and MS are actually equivalent to
point to point links, so synchronization slots for up links and down links have the same slot
structures and consist of 1,536 samples. According to the strategies [67, 68] for timing syn-
chronization and carrier frequency offset estimation, a novel synchronization slot is designed
to conduct timing synchronization and the ne and coarse carrier frequency offset estimation
through identical training sequences distributed in different intervals, as displayed in Fig. 6.
Firstly, two identical training sequences S1 transmitted in series by transmitters are used to
obtain coarse timing synchronization by calculating the delay correlation function of training
sequences. Subsequently, ne timing synchronization is done through two training sequences
S3. Furthermore, the conjoint two S3 have small time delay with large frequency offset esti-
mation range, and can be also used to conduct coarse frequency offset estimation. Then,
different delay S2 and S3 have large delay with small frequency offset estimation range and
are used to perform ne frequency offset estimation by averaging their estimated frequency
offsets.
4 Transceiver Architecture
Considering a TDD/TDMA4Gsystems with two and eight antennas at MS and BS, its system
architecture is designed as showed in Fig. 7, where the simplied block diagrams of MS and
BS are given in Fig. 7a, b, respectively. Furthermore, adaptive modulation and codes (AMC),
123
Fig. 7 System Architecture of TDD/TDMA 4G System with 4 8 antennas at MS and BS, respectively, and
adaptive modulation and codes (AMC), adaptive power control (APC) and adaptive space time codes (ASTC)
are used to conduct link adaptation with eigenmodes
adaptive power control (APC) and adaptive space time codes (ASTC) are used to conduct
link adaptation with eigenmodes detailed in Sect. 7.1. Compared with DoCoMo 4G [3234]
and FuTURE B3G TDD [3538], the proposed TDD/TDMA 4G systems have smaller car-
rier bandwidth and simple implementation, and can t for larger cell area with fast fading
channel scenarios. Whats more, the conguration with 2 8 antennas at MS and BS could
also make TDD/TDMA 4G system serve as an evolution version of TDS-CDMA 3G system
[3941], proposed by Datang Mobile. Their system conguration could be found in Table1.
123
Table 1 System conguration of TDD/TDMA 4G, DoCoMo 4G and FuTURE B3G TDD
TDD/TDMA 4G DoCoMo 4G FuTURE B3G TDD
VFS-OFDM MC/DS-CDMA (Uplink)
(Downlink)
FFT/IFFT sample
rate
20.48Msps 135Msps 24.15Msps
Carrier frequency 2GHz 4.635GHz 4.9GHz 3.5GHz
Chip rate 16.384Mcps
FFT size 2,048 1,024 1,024
Carrier spacing 11.16kHz 131.836kHz 20MHz 19.5kHz
Number of low
frequency guard
sub-carrier
127 127 69
Number of high
frequency guard
sub-carrier
128 128 70
Number of pilot
sub-carrier
0 0 52
Number of data
sub-carrier
1,792 768 2 832
Cyclic prex
duration (s)
25 1.674 10.6
Symbol duration
(s)
125 9.259 53
Length of radio
frame (ms)
5 0.481 (48 Data+4
Pilot symbols)
0.5 5
Bandwidth 20MHz 100MHz 40MHz 20MHz
Antenna
conguration
2 8 2 4 2 4 2 8
Number of
sub-carrier
2,048 1,024 2 1,024
Wireless access TDMA CDMA CDMA TDMA/OFDMA
Duplex TDD FDD TDD
5 System Model
Let us consider the MIMO OFDM system with M
t
transmit and M
r
receive antennas, and
an OFDM modulation is conducted on K sub-carriers, as illustrated in Fig. 8. Firstly, one
universal spacetime code can be dened as a rate T/K M
t
K design scheme over one
complex subeld A of complex eld, whose codeword matrix X is one M
t
K matrix with
entries obtained from the K-linear combinations of T data symbols and their conjugates.
If one codeword matrix X is represented as a column vector by stacking its columns, the col-
umn vector can be delineated as the linear transform of T data symbols and their conjugates,
i.e.,
vec (X) = s (5)
where vec () denotes the column vector by stacking the columns of a matrix into one column
vector, s is a column vector whose elements consist of T data symbols and their conjugates,
123
Space-Time Coder
S/P
S/P
S/P
Insert Pilots
Insert Pilots
Insert Pilots
IFFT
IFFT
IFFT
CP
CP
CP
P/S
P/S
P/S
1
x
2
x
t
M
x
s
Transmitter
S/P
S/P
S/P
R
CP
S/P R
CP
R
CP
IFFT
IFFT
IFFT
Space-Time Decoder
CFO & Channel
Estimation
s
1
y
2
y
r
M
y
Receiver
(a)
(b)
Fig. 8 Discrete-time equivalent base-band model of MIMO OFDM block transmission systems
and the transformmatrix is denoted as the generation matrixof the spacetime code design
scheme.
A space time code is used to encode a data symbol vector s along spacetime directions
with T data symbols and their conjugates, while a least squared spacetime decoder is used to
restore the transmitted data symbols by decoding the received spacetime signals. In order to
delineate the system model compactly, we omit the time indicator of MIMO OFDM symbols
and neglect symbol timing errors and frequency offsets. Assume a MIMO OFDM only can
carry one spacetime codeword, so the receive signals in a MIMO OFDM symbol period
can be given as
y (n, k) =
M
t
1
m=0
H [n, m] (k) x (m, k) + w(n, k) , n = 1, . . . , M
r
, k = 1, . . . , T (6)
where y (n, k) is the received data at the k-th carrier of the n-th receive antenna, H [n, m] (k)
represents the fading coefcient at the k-th carrier of the spatial channel between the n-th
receive antenna and the m-th transmit antenna, x (m, k) denotes the element at m-th row and
k-th column of a spacetime codeword matrix X, and w(n, k) is the channel noise at the k-th
carrier for the n-th receive antenna.
Substituting the sum term in (6) by its matrix form, we rewrite (6) as
y (n, k) = H[:, n] (k) x (:, k) + w(n, k) (7)
where x (:, k) is the k-th column of spacetime codeword X, H[:, n] (k) is the n-th column of
the MIMOchannel fading coefcient matrix H(k) at k-th carriers, which can be delineated as
H(k) =
H [1, 1] (k) H [1, 2] (k) H [1, M

t
] (k)
H [2, 1] (k) H [2, 2] (k) H [2, M
t
] (k)
.
.
.
.
.
.
.
.
.
H [M
r
, 1] (k) H [M
r
, 2] (k) H [M
r
, M
t
] (k)
(8)
123
Let y (n, :) denote the received signal vector at the n-th receive antenna in one MIMOOFDM
symbol period, we can rewrite (7) into matrix form as followings.
_
y (:, n)
_
T
=
H[:, n] (1)
H[:, n] (2)
.
.
.
H[:, n] (T)
. , .
H(:,n)
x (:, 1)
x (:, 2)
.
.
.
x (:, T)
. , .
x
+[w(:, n)]
T
(9)
where w(n, :) is the channel white noise corresponding to y (n, :), and x = vec (X). Thus,
in one MIMO OFDM symbol period, assembling the received signals from all the receive
antennas into matrix form, we can get
vec
_
y
T
_
=

Hs + vec
_
w
T
_
(10)
where y = [y(1, :)
T
, y(2, :)
T
,,y(M
r
,:)
T
], w = [w(1, :)
T
, w(2, :)
T
,, w(M
r
, :)
T
],

H =
_
H(:, 1)
T
,

H(:, 2)
T
, . . .

H(:, M
r
)
T
_
T
.
According to (10), the least squared estimation of s can be achieved as following
s =
_

H
_
1
vec
_
y
T
_
+ w (11)
where w =
_

H
_
1
vec
_
w
T
_
. Then, since s consists of T data symbols and their conjugates,
the transmitted data can be derived from s, completely. Moreover, for the scenario where one
MIMO OFDM symbol can carry multiple spacetime code words, the similar results can
also be derived in the same way.
However, Assuming that perfect channel state information is available at the receiver, the
maximum likelihood decoding rule for space time code words is given by
X = arg min
X
M
r
n=1
K
k=1
_
_
_
_
_
y (n, k)
M1
m=0
H [n, m] (k) x (m, k)
_
_
_
_
_
2
(12)
where the minimization is performed over all possible spacetime code words and x (m, k)
denotes the element of X at m-th row and k-th column.
6 Stainer Channel Estimation
In fact, spatial channels for every receive antenna in MIMO links can be considered as
multiple-input single-out (MISO) channels, i.e., equivalents of links in multi-user CDMA
uplinks. So, in order to achieve good channel estimation in rank-decient MIMOOFDMsys-
tems, we generalize the Steiner channel estimation in uplink CDMA wireless links [69, 70]
to estimate MIMO OFDM spatial channels.
6.1 Training Sequences
As showed in Sect. 3, the midamble symbols are used to conduct channel estimation and track
channel uctuation information, and both data symbols before and after midamble can be
checked out according the estimated channel states by midamble. Compared with FuTURE
123
( ) 1
m
L K W +
W
W
W
m
L
Fig. 9 Construction of midamble by truncating the circular extended version of a basic sequence, where L
m
and W denote the length of training sequence and spatial channel impulse respondence, respectively
B3G TDD systems [3538], channel estimation overhead is reduced greatly with simple
implementation. The midamble code with duration about 175us consists of 3,585 samples,
and is obtained by truncating the circular extended version as showed in Fig. 9.
Denote L
m
as length of training sequence, W as length of spatial channel impulse respon-
dence, and L = W M
t
as length of a basic sequence, which can be delineated as
m = (m
1
, m
2
, . . . , m
L
) (13)
Its circular extension version is given by
m =
_
m
1
, m
2
, . . . , m
L
m
+(M
t
1)W
_
(14)
where the rst L elements are consistent with corresponding elements of the basic sequence
and other elements are determined by
m
i
= m
i L
, i = (L + 1) , . . . , [L
m
+ (M
t
1) W] (15)
Then, training sequences for different transmit antennas are obtained by truncating the cir-
cular extended version. Furthermore, the pilot for the u-th transmit antenna is presented as
m
(u)
=
_
m
(u)
1
, m
(u)
2
, . . . , m
(u)
L
m
_
(16)
where
m
(u)
i
= m
i +(M
t
1)W
, i = 1, . . . , L
m
, u = 1, . . . , M
t
(17)
If the design parameters showed above can be denoted as a quaternion (L
m
, L, M
t
, W), there
exists the following relationship among these parameters, i.e.,
W =
_
L
m
M
t
+ 1
_
, L = WM
t
(18)
where operator . denotes the largest integer not more than a given real number in the
operator.
However, the training sequences given by (16) are generally described as binary sequences,
and should be converted into complex number. Firstly, they are re-presented as bi-polar
sequences and then further converted into complex numbers. Denote m
(u)
as one bi-polar
sequence, m
(u)
c
as its correspondent complex form, which can be determined by
m
(u)
c
(i ) = ( j )
i
m
(u)
(i ), i = 1, . . . , L (19)
where j is unit of imaginary number.
123
It is the elaborately designed training symbols as showed above, that result in the circular
pilot matrix. So, the pilot sequence pilot design scheme can avoid matrix inversion calcula-
tion with good robustness to rank-decient MIMO OFDM systems, and the complexity of
MIMO channel estimation can be further reduced.
6.2 Estimation Algorithm
For the considering MIMO OFDM systems, one receive antenna must estimate all the spatial
channels between the receive antenna and all the transmit antennas, simultaneously. Then, the
channel information estimated by all receive antennas will be assembled together to coher-
ently decode data symbols carried by one MIMO OFDM symbol. Therefore, the following
algorithm will be described for one receive antenna, the same counterparts can be easily
applied to all the receive antennas.
Provided that all spatial channels for MIMO radio links have the same delay proles, the
channel impulse response (CIR) between the u-th transmit antenna and the receive antenna,
is described as
h
(u)
=
_
h
(u)
1
, h
(u)
2
, . . . , h
(u)
W
_
T
, u = 1, 2, . . . , M
t
(20)
Furthermore, training sequence transmitted by the u-th transmit antenna is given by
m
(u)
=
_
m
(u)
1
, m
(u)
2
, . . . , m
(u)
L+W1
_
T
(21)
which is obtained by truncating the rst L +W 1 elements fromdesigned training sequence
as showed above. After spatial channel ltering, its received version is given by
e
(u)
=

G
(u)
h
(u)
+ w
(u)
, u = 1, 2, . . . , M
t
(22)
where e
(u)
and w
(u)
denote received training symbols and correspondent noise vector, respec-
tively, and

G
(u)
is the pilot symbol matrix assembled by training sequence from the u-th
transmit antenna, which can be delineated as
G
(u)
=
m
(u)
1
m
(u)
2
m
(u)
1
.
.
.
.
.
.
.
.
.
m
(u)
W
m
(u)
W1
m
(u)
1
.
.
. m
(u)
W
m
(u)
2
.
.
.
.
.
.
.
.
.
m
(u)
W+L1
m
(u)
W+L2
m
(u)
L
m
(u)
W+L1
.
.
.
.
.
.
.
.
.
m
(u)
W+L1
(23)
According to linear convolution theory [71], the received training symbols are the polluted
version of training symbols transmitted by the u-th transmit antenna. Hence, their rst W 1
elements and last W1 elements will be discarded away as they are interfered by the transmit
signals before and after pilot sequence, respectively. So, the usable received data is given by
123
e
(u)
=
_
e
(u)
W
, e
(u)
W
, . . . , e
(u)
W+L1
_
T
(24)
At the same time, let w
(u)
=
_
w
(u)
W
, w
(u)
W+1
, . . . , w
(u)
W+L1
_
T
, we could obtain following
relationship based on formula (22)
e
(u)
= G
(u)
h
(u)
+w
(u)
(25)
where G
(u)
is one sub-matrix consisting of all the rows between the W-th rowand (W+L1)-
th row of pilot matrix

G
(u)
, i.e.,
G
(u)
=
m
(u)
W
m
(u)
W1
m
(u)
1
.
.
. m
(u)
W
m
(u)
2
.
.
.
.
.
.
.
.
.
m
(u)
W+L1
m
(u)
W+L2
m
(u)
L
(26)
In fact, the received data at one receive antennas is the superimposed data from all transmit
antennas, which can be described as
e =
M
t
u=1
e
(u)
(27)
which could be further expressed in matrix form according to (25), i.e.,
e = Gh +w (28)
Simultaneously, other terms in (28) expression are given by
G =
_
G
(M
t
)
, G
(M
t
1)
, . . . , G
(1)
_
; w =
M
t
u=1
w
(u)
; h =
_
h
(M
t
)T
, h
(M
t
1)T
, . . . , h
(1)T
_
T
(29)
Assume the noise vector in (28) is a wide-sense stationary (WSS) complex Gaussian vector
with zero means and covariance matrix given by R
L
=
2
I, where
2
is noise variance and
I is L-order unit matrix. Then, according to (28), the spatial channels between all transmit
antennas and the receive antenna, could be estimated by
h =
_
G
H
G
_
1
G
H
e (30)
If G is invertible, the above expression is further rewritten as
h = h +G
1
w (31)
Moreover, according to (26) and (29), G is actually a L-order circular matrix, which could
be diagonalized by an unitary DFT matrix [71], i.e.,
G = FF
H
(32)
where F is a L-order DFT matrix, is a L-order diagonal matrix whose elements are given
by the DFT of the basic training sequence. Subsequently, substitute (32) into (30), then we
will get
h = F
1
F
H
e (33)
123
T
1.1
T
2.2
T
Mt,Mt
null null
null null
null null
Tx1
Tx2
TxMt
M
t
OFDM symbol duration
Staggered preamble
T
1.1
T
2.2
T
Mt,Mt
Tx1
Tx2
TxMt
M
t
OFDM symbol duration
Overlapped preamble
T
1.2
T
1.Mt
T
2.1
T
2.Mt
T
Mt,1
T
Mt.2
(a) (b)
Fig. 10 Two typical pilot patterns for channel estimation in MIMO OFDM systems, where pilot sequences
transmitted by every transmit antenna are designed to be orthogonal to each other and carried by M
t
OFDM
symbols as used in common MIMO OFDM channel estimation approaches
where operator F() and F
H
() could be explained as performing DFT and inverse discrete
Fourier transformation (IDFT) to one vector, respectively. So, we can be rewritten (33) into
an alternative form as
h = dft
_
dft (e) ./idft ( m)
_
(34)
where operator dft() and idft() denote to perform DFT and IDFT on a vector, respectively,
while ()./() denotes array right division operator in element-wise. Note that m is the reverse
version of basic sequence m, the result spatial channel are also estimated in the reverse order.
Here, we use the appropriator intervals as bandwidth overhead of channel estimation,
which are quantied into sample periods in corresponding MIMO OFDM system congu-
rations, and the number of multiplication as metric of complexity for channel estimation.
The bandwidth overhead and complexity for different channel estimation approaches are
analyzed and compared with each other in the followings.
For the frequency approaches [72, 73], pilot sequences transmitted by every transmit
antenna are designed to be orthogonal to each other and carried by M
t
OFDM symbols
at least, and the corresponding pilot patterns can be showed in Fig. 10. Following these
schemes, M
t
times K-IFFT for OFDM modulation, M
t
times K-FFT for OFDM demodula-
tion and M
t
K times division are needed to estimate all the spatial channels between all the
transmit antennas and the receive antenna. However, M
t
L samples must be observed at one
receive antenna to estimate the M
t
spatial channel impulse responses in the time approaches
[74, 75]. The training sequences transmitted at different antennas only occupy M
t
L sam-
ples. Firstly, one M
t
L matrix inversion is involved to estimate all the CIRs of M
t
spatial
channels, and then these spatial CIRs must be further converted into frequency domain via
M
t
times K-FFT transforms to obtain corresponding fading coefcients at different carriers.
As a result, M
t
times K-FFT and a M
t
L dimension matrix inversion calculation are used
to obtain these MIMO OFDM channel coefcients. Without matrix inversion, it will take a
M
t
L point IFFT, two M
t
L point FFT and M
t
times K-FFT for the Steiner scheme to
obtain all MIMO OFDM sub-channel coefcients with the same bandwidth overhead as the
time approaches.
Their bandwidth overhead and complexity are delineated in Table2, where the generalized
Steiner approach is indicated to have smaller bandwidth overhead and complexity when com-
pared with frequency and time approaches, respectively. Thus, the scheme can make good
tradeoff between classical frequency approaches and classical time approaches with respect
to complexity and bandwidth overhead.
123
Table 2 Bandwidth overhead and complexity for Steiner scheme, classical frequency and time approaches,
respectively
Scheme candidate Bandwidth overhead Complexity
(sample period) (multiplication operations)
Frequency scheme 5M
t
K/4 2M
t
K(log
2
K+1)
Time scheme M
t
L M
t
Klog
2
K+(M
t
L)
2.37
Steiner scheme M
t
L 3M
t
Llog
2
L+M
t
Klog
2
K
7 Link Adaptation
When channel parameters are known at the transmitter, the capacity of MIMOOFDMsystems
can be further increased by adaptively assigning transmitted power to orthogonal eigenmodes
according to the water-lling rule [76]. At transmitters, the transmitted signals of differ-
ent carriers are usually eigen beam formed independently to orthogonal modes of spatial
channels at every sub-channel in MIMO OFDM systems [7779], which can be formed via
spatial ltering according to the singular value decomposition (SVD) of channel matrix at
transmitters. However, these eigenmodes can not be used to steer the data symbols encoded
by spacetime codes, as one spacetime codeword is transferred simultaneously by multiple
carriers, while the eigenmodes are obtained at every carriers. So, when coupled with adap-
tive power and bit allocation, these eigenmodes have many disadvantages relative to their
counterparts of MIMO systems in single-carrier transmission.
(a) These eigenmodes ignore the effects of spacetime diversity gains on the equivalent
signal noise ratios of data symbols encoded by one spacetime coder.
(b) For the MIMO OFDM system congured with low rate spacetime codes, it will be
difcult to conduct adaptive power allocation as a large number of eigenmodes exist,
compared with data symbols carried by one MIMO OFDM symbol.
(c) It is also difcult to determine the modulation order of data symbols encoded in one
spacetime codeword, as one spacetime codeword is carried by many eigenmodes at
multiple carriers.
Therefore, these eigenmodes can be viewed as the simple generalization of their counterparts
of MIMO systems in single-carrier transmission for conveniently analyzing system capacity,
but not reect the fact of one spacetime codeword being carried by multiple sub-channels.
Here, we present a new approach to construct orthogonal eigenmodes in MIMO OFDM
systems. For the MIMOOFDMsystems with least-squared decoders, orthogonal eigenmodes
can be obtained by the SVD of equivalent channel matrix in system models, where one gen-
eral spacetime code is considered in general way. The result eigenmodes are correspondent
to data symbols encoded in spacetime code words carried by one MIMO OFDM symbol.
Thus, the novel eigenmodes can be used directly to steer adaptive power allocation to data
symbols and their bit allocations, as usually do in the MIMO systems with single-carrier
transmission.
7.1 Eigenmodes with Spacetime Codes
By the singular value decomposition of equivalent channel matrixes, the eigenmodes in (10)
can be disclosed in the same way as their counterparts in single-carrier MIMO systems [80].
123
Let

H =

H, it can be decomposed into orthogonal eigenmodes by singular value decom-
position as showed
H = UDV
H
(35)
where U and V denote the unitary matrices representing the left and right eigenvectors of

H,
respectively, and D is a diagonal matrix, whose elements are the ordered singular values of
H, i.e., the corresponding fading coefcients of those orthogonal eigenmodes.

Then, substituting

H by its SVD, we can get
U
H
vec
_
y
T
_
= DV
H
s +U
H
vec
_
w
T
_
(36)
Now, let y
= U
H
vec
_
y
T
_
,s
= V
H
s, w
= U
H
vec
_
w
T
_
, and (36) can be rewritten as
y
= Ds
+w
(37)
Furthermore, it is also equivalent to
_
y
i
=

i
s
i
+ w
i
(i = 1, 2, . . . , r)
y
i
= w
i
(i = r + 1, r + 2, . . . , min(M
t
, M
r
))
(38)
where r and

i
are the rank of

H and its i-th singular value, respectively.
As the equivalent channel matrix

H includes the generation matrix of spacetime codes,
the eigenmodes obtained by (37) can also reect the corresponding spacetime diversity
gains of spacetime codes. Furthermore, these eigenmodes have unique corresponding rela-
tions with the data symbols, transported by one MIMO OFDM symbol. Thus, according to
these eigenmodes and power allocation schemes, it is very easy to determine the modulation
orders of these data symbols and their transmit power. So, when compared with the classical
eigenmodes for different carriers as showed in reference [7779], adaptive spatial processing
could be performed conveniently with these novel eigenmodes.
Furthermore, as the relations between the equivalent channel matrix and the generation
matrix of one spacetime code, system capacity is significantly effected on by the code
rate of spacetime codes. For one spacetime code scheme with one unitary generation
matrix, the spacetime diversity does not change the corresponding system capacities with-
out spacetime codes. That is, the number of data symbols in the novel eigenmodes should
be identical to that in classical eigenmodes. So, there exists M = 2 T/K for spacetime
codes that could keep systemcapacity unchanged, and only Alamouti spacetime code exists
for a transmitter with two antennas, when T/K is not more than one. For other spacetime
codes, system capacity will increase in inverse proportion to spacetime code rates, i.e., the
larger the transmission rate, the more the system capacity. In Sect. 5, this will be disclosed
by numerical simulation results.
Generally speaking, the classical eigenmodes at different carriers for MIMO OFDM sys-
tems can be viewed as one simple extension of the eigenmodes in MIMO systems in single-
carrier transmission, which t for the analysis of system capacity other than link adaptation
techniques. However, besides system capacity analysis, the novel Eigenmode transmission
can couple spacetime codes and link adaptation techniques, perfectly. Furthermore, the
number of novel eigenmodes is only limited to the number of the transmitted data symbols
carried by one MIMO OFDM symbol, while M M eigenmodes have to be disclosed to
conduct power allocation to data symbols transported in these eigenmodes.
123
7.2 Improved Water-Filling Power Allocation
Based on adaptive modulation margin adaptive (MA) principals [80], link adaptation tech-
niques can be implemented from two aspects, i.e., adaptive power allocation under total
transmit power constraint for maximal transported bits, and adaptive bits allocation under
total transmit bits for minimal transmit power, respectively. Under the constraints of given
total power and target bit error ratio (BER), we only consider howto conduct power allocation
to orthogonal eigenmodes to maximize transmit bits.
In order to maximize the transported total bits, an improved water-lling power allocation
scheme is given on the base of classical water-lling schemes. According to the scheme,
the adaptive power and bit allocation are conducted in two steps. Firstly, an initial power
allocation is given by classical water-lling scheme, i.e., the rst step is executed to initially
allocate the power for different orthogonal eigenmodes according to the classical water-ll-
ing scheme. Then, after determining the transported bits at channel eigenmodes, the residual
power is reallocated among these eigenmodes to transport additional bits.
For given target BER (P
e
), the transmit power for an additive white Gaussian noise
(AWGN) channel to transmit c bits information with M-QAM modulation, is given by [81]
P (c) =

2
3
_
Q
1
_
P
e
4
__
2
_
2
c
1
_
(39)
where Q (x) =
1
2
_
x
e
t
2
/2
dt is denoted as complementary error function. Then, for given
transmit power, the number of bits transported by the AWGNchannel, can be derived accord-
ing to (39), as showed in the following formula
c = oor
_
log
2
_
1 +
3P
2
_
Q
1
_
P
e
4
__
2
__
(40)
where oor denotes the operator to round towards minus innity.
Now, we present the details of the improved water-lling scheme, which is conducted in
tow steps as showed in followings.
7.2.1 Initial Power Allocation Based Water-lling Scheme
For the eigenmodes given by (38), the power allocation scheme can be described as an opti-
mal problem to maximize the system capacity under the constraint of given total transmit
power, i.e.,
C
max
= max
P
i
(i =1,...,r)
r
i =1
log
2
_
1 +
P
i
2
_
st.
r
i =1
P
i
= K P (41)
where C denotes system capacity, while P is the given total transmit power. According to
water-lling power allocation algorithm, the optimal power allocation can be given by
P
i
= max
_
0,

2
i
_
(i = 1, 2, . . . , r) (42)
where =
1
r
_
K P +
r
i =1
i
_
, and
2
is noise variance of orthogonal eigenmodes,
assumed to have the same variance.
123
The power allocated to orthogonal eigenmodes as showed in (42), is called water-lling
power to distinguish different power allocation results in the following. With the water-lling
power allocated the i -th eigenmode, its maximal bits carried can be given by (11), that is
c
i
= oor
_
log
2
_
1 +
3P
i
2
_
Q
1
_
P
e
4
__
2
__
, (i = 1, 2, . . . , r) (43)
However, according to (39), the necessary power to transmit c
i
bits is determined by
P
i
=

2
3
_
Q
1
_
P
e
4
__
2
_
2
c
i
1
_
, (i = 1, 2, . . . , r) (44)
which is called the expectation power to transmit c
i
bits. Clearly, the water-lling power
for the i -th eigenmode is larger than its expectation power, and their difference is named as
residual power, which will be further reallocated among these eigenmodes.
7.2.2 Reallocation of Residual Power
Subsequently, on the basis of the power allocation results in the rst period, we calculate the
additional power to transmit an additional bit at the i -th eigenmode. i.e.,

P
i
= [P (c
i
+ 1) P (c
i
)]/
2
i
, (i = 1, 2, . . . , r) (45)
which is called additional power. Then, an accumulative sum sequence is obtained by a
sorted version of additional power in ascending order at all the eigenmodes. The elements
in the accumulative sum sequence, not more than the total residual power, can be found
out, and the eigenmodes corresponding with these elements can transport an additional bit.
So, the additional powers of these eigenmodes are allocated to these eigenmodes from the
total residual power, whose residual power after reallocation, i.e., total overplus power, is
averagely allocated to all the eigenmodes. At last, the bit number of these eigenmodes should
be increased by one, respectively.
8 Performance Analysis
Let us consider the maximumlikelihood decoding as shown in (12). Assuming that ideal CSI
is available at the receiver, for a given realization of the fading channel H, the pairwise error
probability of transmitting X and deciding in favor of another codeword

X at the decoder
conditioned on H is given by
P
_
X,

X|H
_
exp
_
d
2
H
_
X,

X
_
E
s
4N
0
_
(46)
where E
s
is the average symbol energy, N
0
is the noise power spectral density. Let
h
j
=
_
_
h
j,1
_
T
,
_
h
j,1
_
T
, . . . ,
_
h
j,1
_
T
_
1LM
t
, W
k
=
k
I
LM
t
, e
k
=
x
1
k
x
1
k
x
2
k
x
2
k
.
.
.
x
M
t
k
x
M
t
k
M
t
1
and d
2
H
(X,

X) is given by
123
d
2
H
_
X,

X
_
=
M
r
j =1
h
j
D
H
(X, X) h
H
j
(47)
Here, d
2
H
_
X,

X
_
is an LM
t
LM
t
matrix given by
D
H
_
X,

X
_
=
K
k=1
W
k
e
k
(W
k
e
k
)
H
(48)
It is clear that matrix D
H
_
X,

X
_
is a variable depending on the codeword difference and
the channel delay prole. Let us denote the rank of D
H
_
X,

X
_
by r
h
. Since D
H
_
X,

X
_
is
nonnegative definite Hermitian, the eigen-values of the matrix can be ordered as
1

2

r
h
0
Therefore, we can obtain the pairwise error probability over a frequency-selective fading
channel by averaging (46) with respect to the channel coefcients. It is upper bounded by
P
_
X,

X
_

1
_
r
h
j =1
_
1 +
j
1
4N
0
_
M
r
r
h
j =1
M
R
_
E
s
4N
0
_
r
h
M
r
(49)
Note that this performance upper-bound is similar to the upper-bound on slow Rayleigh fad-
ing channels. The systems on frequency-selective fading channels can achieve a diversity
gain of r
h
M
r
and a coding gain of
_
r
h
j =1

j
_
1/r
h _
d
2
u
, where d
2
u
is the squared Euclidean
distance of the reference uncoded system.
According to time division multiple access, there is only one user that can communicate
to base stations at one time. However, in order to meet the access requirements of multiple
users in one period, three different scheduler schemes, could be used, i.e., max total capacity
scheduler (MCs), Round Robin scheduler (RRs) and proportional fairness scheduler (PFs).
We assume that the fading is quasi-static and the channel is unknown at the transmitter but
perfectly known at the receiver. Since the channel is described by a non-ergodic random
process, we dene the instantaneous channel capacity as the mutual information conditioned
on the channel responses. The instantaneous channel capacity is a random variable.
For each realization of the randomchannel frequency response, the instantaneous channel
capacity for i-th user is given by
C
i
=
1
K
K
k=1
log
2
_
det
_
I
M
r
+ SNR H
k
i

_
H
k
i
_
H
__
, i = 1, 2, . . . , N (50)
where I
M
r
is the identity matrix of size M
r
, H
k
is an M
r
M
t
channel matrix and SNR is
the signal-to-noise ratio per receive antenna.
8.1 Max Total Capacity Scheduler
The rst scheduler is greedy one which is based on the max sumcapacity of the user channel.
Based on the water lling, the available power of the Node B is allocated to the two eigen-
modes, and then the sum capacity is calculated. The user with the maximum sum capacity
is scheduled to transmit in the next TTI. This max Capacity scheduler provides maximum
123
system capacity at the expense of fairness, because all the resource may be allocated to a
single user which has always the best channel conditions. The capacity of multiuser diversity
is given by
C = max
i =1,...,N
{C
i
} (51)
8.2 Round Robin Scheduler
The Round Robin (RR) scheduler provides a fair sharing of resources (frames) at the expense
of systemthroughput. The user is scheduled to transmit in turn, in which the channel capacity
of user is not considered. The system total capacity is given by
C =
1
N
N
i =1
C
i
(52)
8.3 Proportional Fairness Scheduler
The proportional fairness scheduler is a tradeoff between the throughput and the fairness. An
ideal scheduling interval is assumed and scheduling is performed on a frame by frame basis.
The user with the largest metric value as follow is scheduled to transmit
w
i
=
c
i
c
i
, i = 1, 2, . . . , N (53)
c
i
is the user transmission capability, calculated as Eq. 50. If the current user transmits data,
the average throughput of user i is updated as
c
i
= c
i
(1 ) + c
i
, i = 1, 2, . . . , N (54)
Otherwise
c
i
= c
i
, i = 1, 2, . . . , N (55)
Here, the forgetting factor , is a positive constant but less than 1. Thus, the system total
capacity is given by
C =
N
i =1
w
i
C
i
(56)
9 Numerical Evaluation
In this section, some representative numerical results were presented to evaluate system per-
formances in terms of systemcapacities with multiuser diversity, throughput and complexity,
and system bit error ratios (BER) when link adaptation was assumed for the proposed multi-
user MIMO OFDM system schemes with TDD/TDMA as access modes. In order to conduct
comparisons among different 4G system schemes, three typical implementation schemes of
multiuser MIMOOFDMwith TDMA, CDMAand OFDMA, i.e., TDD/TDMA4G, DoCoMo
MIMO VSF-OFCDM and FuTURE B3G TDD, were tested in the same simulation congu-
rations, which was given by Table3. Furthermore, this kind of test results could reect their
123
Table 3 System conguration
parameter
System parameters Values
Bandwidth 20MHz
Carrier frequency 5GHz
Number of subcarriers 1,024
Subcarrier spacing 19.5kHz
OFDM symbol duration 64us (51.2 + 12.8: effective
symbol+guard interval)
Antennas conguration 4 2 (Base stations: 4, Mobile
stations: 2)
Vehicle velocity 120km/h
MIMO channel model 3GPP Vehicle A channel,
uncorrelated MIMO
Doppler frequency 556Hz
Channel estimation algorithm Time domain pilots +FFT-based
performances respectively, as their performance metrics were normalized to their system
bandwidth in following experiments.
9.1 System Capacity with Multiuser Diversity
Assume that the states of spatial MIMOchannels were only known at transmitters, normalized
system capacity respected to system bandwidth, was used to evaluate system performance
under the cases of multiuser scenarios. When the max total capacity scheduler as shown
above were used for multiple user schedules, the three typical multiuser MIMO OFDM
system schemes, i.e., TDD/TDMA 4G, DoCoMo MIMO VSF-OFCDM and FuTURE B3G
TDD, were evaluated in terms of system total capacity with 32 users.
The numerical simulation results were achieved by the common system congurations as
shown in Table3, while their physical frame structure are kept different. For multiple user
scenarios, multiuser diversity gain can be achieved by exploiting the independent frequency
and spatial selective fading one another. For the proposed TDD/TDMA 4G schemes, TDMA
was implemented by assign the whole timeslot to only one user during one schedule period.
However, more multiuser diversity gains can be obtained by other access modes, such as
OFDMA, CDMA or OFCDM. As indicated by Fig. 11, much larger system capacity was
obtained by DoCoMo MIMO VSF-OFCDM system, when compared with other two multi-
user MIMO OFDM system schemes. However, at the cost of system complexity, the system
capacity of FuTURE B3GTDDwith OFDMAwas only little larger than that of TDD/TDMA
4G schemes.
9.2 Throughput and Complexity
According to the common system congurations in Table3, the bit error rate (BER) perfor-
mances of uncoded TDD/TDMA 4G, DoCoMo MIMO VSF-OFCDM, and FuTURE B3G
TDD, were evaluated in uncorrelated MIMOchannel scenarios with 3GPPVehicle Achannel
proles, where their corresponding radio frame structures were also implemented as shown
in Sect. 3. Assuming perfect channel knowledge had been estimated and complete system
123
Fig. 11 System multiuser
diversity capacity normalized to
system bandwidth for for uplink
multiuser MIMO OFDM systems
with typical TDMA, OFCDM,
and OFDMA as access modes,
i.e., TDD/TDMA 4G, DoCoMo
MIMO VSF-OFCDM, FuTURE
B3G TDD, when the max total
capacity scheduler as shown in
Sect. 8 was used with 32 users
schedules
0 2 4 6 8 10 12 14 16 18 20
4
6
8
10
12
14
16
18
20
22
24
SNR (dB)
C
a
p
a
c
i
t
y

(
b
i
t
s
/
s
/
H
z
)
TDD/TDMA 4G
FuTURE B3G TDD with OFDMA
DoCoMo MIMO VSF-OFCDM with CDMA
synchronizations were achieved, the typical modulations such as quarter phase shift keying
(QPSK) and binary phase shift keying (BPSK), were used respectively to test the system
BERs. Here, the two-dimension spreading in DoCoMo MIMO VSF-OFCDM was only con-
ducted in time domain with spreading factor 32, and the spreading codes were obtained by
Walsh code generators.
Furthermore, the MUDs based on successive interference cancellation (SIC) or parallel
interference cancellation (PIC), were used for uplinks and downlinks in DoCoMo MIMO
VSF-OFCDM systems. To alleviate the complexity, the suboptimal subcarrier allocation cri-
teria [60], namely, the Product-criterion and the Sum-criterion were adopted for FuTURE
B3G TDD schemes. The computation complexity of the suboptimal approaches grows only
linearly with the number of users and the number of subcarriers.
When the round robin scheduler was used for multiple users scheduling schemes, the
simulated BERs results of for uplinks at base stations, were shown by Figs. 12, and 13 for
the modulations of BPSK and QPSK, respectively. Moreover, Figs. 14 and 15 displayed the
simulated BERs results for downlinks at terminals. As illustrated by these simulated results,
without multiuser interference, FuTURE B3G TDD and TDD/TDMA 4G have better perfor-
mance than DoCoMo MIMO VSF-OFCDM. At any time, there was only one user that could
have access to base stations, TDD/TDMA 4G systems could achieve to best performance.
Furthermore, at high SNR, TDD/TDMA 4G could obtain about 1dB signal noise rate gain,
when compared with DoCoMo MIMO VSF-OFCDM.
Subsequently, we also evaluated the system complexity in terms of system simulation
times for uplinks, which were described by Fig. 16. Clearly, as for DoCoMo MIMO VSF-
OFCDM, the complexity of receivers as base stations increases with proportion to the number
of users, while that of TDD/TDMA 4G and FuTURE B3G TDD system are kept unchanged
when the number of users increased. This could owe to the increase of multiuser signal
interference in the scenarios of DoCoMo MIMO VSF-OFCDM, which lead to more iterative
operations to cancel multiuser interferences. The similar phenomenon could also be observed
at terminals when a larger number of users existed.
Now, let us check the throughputs achieved by the three typical multiuser MIMO OFDM
systemschemes for B3Gmobile communications, when QPSKwas used in these simulations.
The throughputs of TDD/TDMA 4G, DoCoMo MIMO VSF-OFCDM and FuTURE B3G
123
Fig. 12 System BER
performance for uplink multiuser
MIMO OFDM systems with
typical TDMA, OFCDM, and
OFDMA as access modes, i.e.,
TDD/TDMA 4G, DoCoMo
B3G TDD, when BPSK was used
for 32 users with 2 4 antennas
congurations at terminals and
base stations, respectively
0 2 4 6 8 10 12 14 16
10
-5
10
-4
10
-3
10
-2
10
-1
SNR (dB)
B
i
t

E
r
r
o
r

R
a
t
e
s
DoCoMo MIMO VSF-OFCDM
FuTURE B3G TDD
TDD/TDMA 4G
Fig. 13 System BER
performance for uplink multiuser
MIMO OFDM systems with
typical TDMA, OFCDM, and
OFDMA as access modes, i.e.,
TDD/TDMA 4G, DoCoMo
B3G TDD, when QPSK was used
0 2 4 6 8 10 12 14 16
10
-5
10
-4
10
-3
10
-2
10
-1
10
0
SNR (dB)
B
i
t

E
r
r
o
r

R
a
t
e
s
FuTURE B3G TDD
TDD/TDMA 4G
TDD, can reach to about 45, 56, and 52Mbps, respectively, and their corresponding spectrum
efciency were 2.29, 2.85, and 1.97bits/s/Hz. When 16-QAMmodulation was adopted, their
spectrumefciency were 4.58, 5.69, and 3.93bits/s/Hz. The spectrumefciency of DoCoMo
MIMO VSF-OFCDM was inferior to that of FuTURE B3G TDD and TDD/TDMA 4G, as
the spreading in time-frequency domains increased the time and frequency diversity gains at
cost of system resource overheads. This results indicated that the proposed multiuser MIMO
OFDM system schemes with TDD/TDMA, i.e., TDD/TDMA 4G, can achieve comparable
system performance and throughputs with low complexity and radio resource overhead to
that of DoCoMo MIMO VSF-OFCDM and FuTURE B3G TDD.
9.3 Eigenmode Transmission Coupled with Spacetime Codes
Under spatially uncorrelated ITU vehicular A channels with Doppler frequencies of 200Hz,
we evaluate the system capacities and throughputs with and without considering spacetime
123
Fig. 14 System BER
performance for downlink
B3G TDD, when BPSK was used
0 2 4 6 8 10 12 14
10
-5
10
-4
10
-3
10
-2
10
-1
SNR (dB)
B
i
t

E
r
r
o
r

R
a
t
e
s
FuTURE B3G TDD
TDD/TDMA 4G
Fig. 15 System BER
performance for downlink
B3G TDD, when QPSK was used
0 2 4 6 8 10 12 14 16
10
-5
10
-4
10
-3
10
-2
10
-1
10
0
SNR (dB)
B
i
t

E
r
r
o
r

R
a
t
e
s
FuTURE B3G TDD
TDD/TDMA 4G
codes, respectively. By the reason of terseness, the eigenmodes obtained for the two scenarios
are called spacetime eigenmodes and carrier eigenmodes, respectively. At transmitter, the
water-lling power allocation algorithm [76] is executed to adaptively adjust the transmit
powers for all the eigenmodes according to their fading coefcients.
Figure17 shows the systemcapacities for different signal noise ratios (SNR) when space
time codes are Alamouti Code, Space-Time Block Code (STBC) X
c
3
[80] and STBC X
h
3
[80]
with code rates of 1, 0.5, and 0.75, respectively. According to Fig. 18, the code rates of space
time codes have significant effects on the system capacity when the spacetime eigenmodes
are constructed, i.e., the smaller the code rates, the larger the capacity difference between
carrier eigenmodes and spacetime eigenmodes. As the results pointed out in Sect. 7, this
phenomenon can owe to the increase of spacetime diversity gains with the decrease of code
rates, which lead to the reduction of data symbol transmit rates. At the same time, the scales
of system capacities for the carrier eigenmodes and the spacetime eigenmodes are eval-
uated by twenty time numerical simulation under the uncorrelated ITU indoor, pedestrian
123
5 10 15 20 25 30
0
0.5
1
1.5
2
2.5
3
3.5
Number of Users
C
o
m
p
l
e
x
i
t
y

i
n

t
e
r
m
s

o
f

s
i
m
u
l
a
t
i
o
n

t
i
m
e
s

(
s
)
FuTURE B3G TDD
TDD/TDMA 4G
Fig. 16 System complexity in terms of simulated times for typical multiuser MIMO OFDM systems with
typical TDMA, OFCDM, and OFDMA as access modes, i.e., TDD/TDMA 4G, DoCoMo MIMO VSF-
OFCDM, FuTURE B3G TDD, when QPSK was used for 32 users with 2 4 antennas congurations at
terminals and base stations, respectively
0 5 10 15 20 25
5
10
15
20
25
30
SNR (dB)
C
a
p
a
c
i
t
y

(
b
i
t
s
/
s
/
H
z
)
Alamouti Code r = 1 for carrier eignmodes
Alamouti Code r = 1 for space-time eignmodes
STBC X(h,3) r = 0.75 for carrier eignmodes
STBC X(h,3) r = 0.75 for space-time eignmodes
STBC X(c,3) r = 0.5 for carrier eignmodes
STBC X(c,3) r = 0.5 for space-time eignmodes
Fig. 17 Capacity curves of the proposed TDD/TDMA 4G systems when the carrier eigenmodes and space
time eigenmodes are conducted for the spacetime codes with different code rates, under spatially uncorrelated
ITU vehicular A channels with Doppler frequencies of 200Hz
and vehicular A channel scenarios, respectively. Then, these scale factors are averaged out
to 1.9526, 4.4807, and 3.5509, when Alamouti Code, SpaceTime Block Code (STBC)X
c
3
and STBC X
h
3
are considered, respectively. However, this doesnt mean the throughputs of
carrier eigenmodes are larger than that of spacetime eigenmodes, as showed in the following
simulation results.
Furthermore, whenspacetime codes are Alamouti Code, SpaceTime BlockCode (STBC)
X
c
3
and STBC X
h
3
with code rates of 1, 0.5, and 0.75, respectively, the throughputs for dif-
ferent signal noise ratios (SNR) are given in Fig. 18, where the modulation order of data
123
Fig. 18 Throughput curves of
MIMO OFDM systems when the
carrier eigenmodes and
spacetime eigenmodes are
conducted for the spacetime
codes with different code rates,
where different powers are
allocated to different eigenmodes
according to water-lling scheme
with given target BER 10
6
0 5 10 15 20 25 30
0
1
2
3
4
5
6
7
8
9
SNR (dB)
T
h
r
o
u
g
h
p
u
t

(
b
i
t
s
/
s
/
H
z
l
)
Alamouti Code r = 1 for carrier eignmodes
Alamouti Code r = 1 for space-time eignmodes
STBC X(c,3), r = 0.5 for carrier eignmodes
STBC X(c,3), r = 0.5 for space-time eignmodes
STBC X(h,3), r = 0.75 for space-time eignmodes
STBC X(h,3), r = 0.75 for carrier eignmodes
symbols in carrier eigenmodes is xed unchanged in a spacetime codeword. However, the
adaptive modulation is only performed on the data symbols of spacetime codes, for the
case of spacetime eigenmodesother than carrier eigenmodes, as the data symbols carried
by spacetime codes in carrier eigenmodes are transported by multiple carrier eigenmodes,
simultaneously. Due to adaptive modulation of data symbols for spacetime eigenmodes,
the larger throughputs are achieved than that of carrier eigenmodes, as showed in Fig. 18,
while the throughputs also increase with the code rate of spacetime codes, at the SNRabove
15dB. What is more, the ratios between the numbers of carrier eigenmodes and spacetime
eigenmodes are 1, 3, and 2 for Alamouti Code, SpaceTime Block Code (STBC)X
c
3
and
STBCX
h
3
, respectively. Consequently, the link adaptation technique with a few eigenmodes
can be implemented effectively in spacetime eigenmodes.
9.4 Performance with Link Adaptation
In order to evaluate performance of TDD/TDMA 4G systems with link adaptation, classical
water-lling scheme [77], greedy scheme [81], equal power allocation [83] and the scheme
given in this paper are numerically simulated. When the SNR at receiver is lower than 15dB,
the modied water-lling power allocation algorithm can achieve better performance than
that of classical water-lling scheme and equal power allocation schemes, but inferior to that
of greedy power allocation scheme. However, different from greedy scheme, the modied
water-lling power allocation method is conducted in only two steps.
Subsequently, according to CSI at transmitter, transmit power is rstly adaptively allo-
cated among different eigenmodes as detailed in Sect. 7, then adaptive modulation and coding
(AMC) is performed to t for current channel states for given special BERrequirements. The
four different power allocation strategies as showed above are used to conduct adaptive power
allocation. Figure19 shows the system spectrum efciency achieved by different power allo-
cation schemes, and the spectrum efciency of modied water-lling scheme is inferior to
that of other three schemes at high SNR, as great diversity gain can be achieved under the
case of TDD/TDMA 4G systems. The greedy scheme can obtain the best results, while the
classical water-lling and equal power allocation scheme obtain the same results. Although
123
Fig. 19 Spectrum efciency of
TDD/TDDMA 4G system with
the improved water-lling power
allocation scheme, classical
water-lling, greedy scheme,
equal power allocation schemes,
when the carrier eigenmodes and
codes
0 5 10 15 20 25 30
0
2
4
6
8
10
12
14
SNR of every Receive Anntena (dB)
S
p
e
c
t
r
a
l

E
f
f
i
c
e
n
c
y

(
b
i
t
s
/
s
/
H
z
)
Cacapcity
Water-Filling Power Allocation
Euqal Power Allocation
Greedy Power Allocation
Modified Water-Filling Power Allocation
Fig. 20 System BER of
TDD/TDMA 4G systems, when
the carrier eigenmodes and
codes, and different powers are
allocated to the improved
water-lling power allocation
scheme, classical water-lling,
greedy scheme, equal power
allocation schemes with given
target BER < 10
3
0 5 10 15 20 25 30
10
-3
10
-2
10
-1
SNR (dB)
B
E
R
Water-Filling Power Allocation
Equal Power Allocation
Greedy Power Allocation
Modified Water-Filling Power Allocation
the modied water-lling power allocation scheme can not achieve the best results, its simple
implementation can win its application in TDD/TDMA 4G systems.
Finally, as showed in Fig. 20, the corresponding BERresults of above systemconguration
with requirement of BER < 10
3
, is given by simulating the TDD/TDMA link performance
through Matlab 7.0 simulink blocksets.
10 Conclusions
The combination of MIMO and OFDM has emerged as a promising solution for future
high-rate wireless communication systems. Based on the state-of-the-art review of MIMO
and OFDM technologies, we further discussed the specic limitations of existing techniques
designed for multiuser MIMOOFDMsystems in broadband wireless mobile channel scenar-
ios, i.e., bad performance and extreme complexity of multiuser detectors for rank-decient
123
multiuser MIMOOFDMsystems with CDMAas access modes, extreme challenges of spatial
MIMO channel estimators in rank-decient MIMO OFDM systems, and exponential growth
complexity of optimal sub-carrier allocations for OFDMA-based MIMO OFDM systems.
Furthermore, in fast doubly selective fading mobile channel scenarios, these issues will pose
great challenges to multiuser MIMO OFDM systems.
Up to now, several typical multiuser MIMO OFDM systems for next generation mobile
communications with OFDMA and CDMA as access modes, i.e., FuTURE B3G TDD and
DoCoMo MIMO VSF-OFCDM, were given in recent literatures. However, many different
eld tests were only conducted in the scenarios similar to that of wireless local networks, and
few test results in fast doubly selective fading mobile channel scenarios. Herein, aiming at
the internal specication limitations of these typical next generation mobile communication
schemes, we proposed the multiuser MIMO OFDM systems with TDD/TDMA as access
methods for next generation mobile communication candidates.
With TDD/TDMA, many intractable issues could be avoided or alleviated, such as multi-
user interferences, channel estimation overhead with larger number users, optimal sub-carrier
allocations for OFDMA-based schemes. In this paper, the proposed TDD/TDMA 4G sys-
tems were dedicately designed for fast mobile channel environments. Furthermore, we also
displayed the design of Stainer channel training sequence for rank-decient MIMO OFDM
systems. With eigenmodes with spacetime codes, system performances of TDD/TDMA 4G
systems were analyzed in terms of the pairwise error probability and system capacity with
multiuser diversity under different schedulers.
Acknowledgments The authors would like to express their thanks to the reviewers for their helpful and
insightful comments and suggestions that improved the quality of this paper. This work was supported in
part by grants from the National High Technology Research and Development Program (863) project of
China under grant No.2006AA01Z258, a grant fromNational Nature Science Foundations (NSF) China under
contract 60602034, and partly by Huawei, TD-Tech, LGE and Samsung.
References
1. Hanzo, L., Mnster, M., Choi, B. J., &Keller, T. (2003). OFDMand MC-CDMAfor broadband multi-user
communications, WLANs and broadcasting. Piscataway, NJ: IEEE Press/Wiley.
2. Holsinger, J. L. (1964). Digital communication over xed time-continuous channels with memorywith
special application to telephone channels. Cambridge, MA: MIT-Lincoln Lab, Tech. Rep. 366.
3. Ciof, J. M. (1991). A multicarrier primer, ANSI T1E1.4/91-157.
4. ANSI Committee T1-Telecommunications. (1994). A technical report on high-bit-rate digital subscriber
lines (HDSL). Tech. Rep. 28.
5. ANSI Committee T1-Telecommunications. (1998).Very-high-speed digital subscriber lines: System
requirements, ANSI T1E1.4 VDSL SR: 98-043R5.
6. ETSI-TM. (1998). Access transmission systems on metallic access cables; very high speed digital sub-
scriber line (VDSL); part 1: Functional requirements, ETSI TS 101 270-1 V1.1.2.
7. ETSI ETS. (1995). Digital Audio Broadcasting (DAB): DAB to mobile, portable and xed receivers. ETSI
ETS 300 401 ed.1.
8. ETSI ETS. (1997). Digital Video Broadcasting (DVB): Framing structure, channel coding and modulation
for Digital Terrestrial Television (DVB-T), ETSI ETS 300 744 ed.1.
9. ETSI ETS. (2004). Digital Video Broadcasting (DVB): Transmission System for Handheld Terminals
(DVB-H). ETSI EN 302 304 V1.1.1.
10. ETSI ETS. (1996). Radio Equipment and Systems (RES): High Performance Radio Local Area Network
(HIPERLAN) Type 1; Functional Specication. ETSI ETS 300 652 ed.1.
11. ETSI ETS. (1998). Broadband Radio Access Networks (BRAN): Inventory of Broadband Radio Technol-
ogies and Techniques, ETSI TR 101 173 V1.1.1.
12. IEEE. (1999). IEEE Standard 802.11a: Wireless LANMediumAccess Control (MAC) and Physical Layer
(PHY) Specications: High-Speed Physical Layer in the 5GHz Band.
123
13. IEEE. (2003). IEEE Standard 802.11g: Wireless LANMediumAccess Control (MAC) and Physical Layer
(PHY) Specications.
14. IEEE. (2004). IEEE Candidate Standard 802.11n: Wireless LAN Medium Access Control (MAC) and
Physical Layer (PHY) Specications.
15. IEEE. (2004). IEEE Standard 802.16: Air Interface for Fixed Broadband Wireless Access Systems.
16. Koffman, I., & Roman, V. (2002). Broadband wireless access solutions based on OFDM access in IEEE
802.16. IEEE Communications Magazine, 40(4), 96103. doi:10.1109/35.995857.
17. May, T., Rohling, H., & Engels, V. (1998). Performance analysis of Viterbi decoding for 64-DAPSK and
64-QAM modulated OFDM signals. IEEE Transactions on Communications, 46(2), 182190. doi:10.
1109/26.659477.
18. Peled, A., & Ruiz, A. (1980). Frequency domain data transmission using reduced computational com-
plexity algorithms. In IEEE 1980 International Conference on Acoustics, Speech, and Signal Processing
(ICASSP 80), Denver, CO, Apr.1980.
19. Zhou, Y., Ng, T.-S., Wang, J., Higuchi, K., & Sawahashi, M. (2008). OFCDM: A promising broadband
wireless access technique. IEEE Communications Magazine, 46(3), 3949. doi:10.1109/MCOM.2008.
4463770.
20. Zhou, Y. (2004). Effect of fast fading on hybrid detection in VSF-OFCDM systems. In 2004 IEEE Inter-
national Conference on Communications, Paris, France, June 2004. doi:10.1109/ICC.2004.1313155.
21. Kishiyama, Y., Maeda, N., Higuchi, K., Atarashi, H., & Sawahashi, M. (2003). Experiments on through-
put performance above 100-Mbps in forward link for VSF-OFCDM broadband wireless access. In IEEE
58th vehicular technology conference (VTC 2003-Fall), Orlando, Florida, USA, October 2003. doi:10.
1109/VETECF.2003.1285348.
22. Raleigh, G. G., & Ciof, J. M. (1998). Spatio-temporal coding for wireless communication. IEEE
Transactions on Communications, 46(3), 357366. doi:10.1109/26.662641.
23. Hoadley, J. (2005). Building future networks with MIMO and OFDM. Telephonyonline.com. Available
at: http://telephonyonline.com/wireless/technology/mimo_ofdm_091905/.
24. Airgo Networks. Available at: http://www.airgonetworks.com/.
25. Blcskei, H., Gesbert, D., & Paulraj, A. J. (2002). On the capacity of OFDM-based spatial multiplexing
systems. IEEE Transactions on Communications, 50(2), 225234. doi:10.1109/26.983319.
26. Blum, R. S., Li, Y., Winters, J. H., & Yan Q. (2001). Improved spacetime coding for MIMO-OFDM
wireless communications. IEEE Transactions on Communications, 49(11), 18731878. doi:10.1109/26.
966049.
27. Moon, J. H., You, Y. H., Jeon, W. G., Kwon, K. W., & Song, H. K. (2003). Peak-to-average power
control for multiple-antenna HIPERLAN/2 and IEEE802.11a systems. IEEE Transactions on Consumer
Electronics, 49(4), 10781083. doi:10.1109/TCE.2003.1261199.
28. Li, Y. (2002). Simplied channel estimation for OFDM systems with multiple transmit antennas. IEEE
Transactions on Wireless Communications, 1(1), 6775. doi:10.1109/7693.975446.
29. Li, Y., Winters, J. H., & Sollenberger, N. R. (2002). MIMO-OFDM for wireless communications: Signal
detection with enhanced channel estimation. IEEE Transactions on Communications, 50(9), 14711477.
doi:10.1109/TCOMM.2002.802566.
30. Paulraj, A. J., Gore, D. A., Nabar, R. U., & Blcskei, H. (2004). An overview of MIMO communica-
tionsVA key to gigabit wireless. Proceedings of the IEEE, 92(2), 198218. doi:10.1109/JPROC.2003.
821915.
31. Dubuc, C., Starks, D., Creasy, T., & Hou, Y. (2004). A MIMO-OFDM prototype for next-generation
wireless WANs. IEEE Communications Magazine, 42(12), 8287. doi:10.1109/MCOM.2004.1367559.
32. Xia, B., Wang, J., & Sawahashi, M. (2005). Performance comparison of optimum and MMSE receivers
with imperfect channel estimation for VSF-OFCDM systems. IEEE Transactions on Wireless Communi-
cations, 4(6), 30513062. doi:10.1109/TWC.2005.857998.
33. Kishiyama, Y., Maeda, N., Higuchi, K., et al. (2004). Transmission performance analysis of VSF-OFCDM
broadband packet wireless access based on eld experiments in 100-MHz forward link. In 2004 IEEE
60th Vehicular Technology Conference (VTC2004-Fall), Los Angeles, CA, September 2004. doi:10.1109/
VETECF.2004.1404680.
34. Quek, T. Q. S., Maeda, N., Atarashi, H., &Sawahashi, M. (2004). Analysis on tradeoff between frequency
diversity and inter-code interference considering fading correlation in forward link for VSF-OFCDM
wireless access. In 2004 IEEE 60th Vehicular Technology Conference (VTC2004-Fall), Los Angeles,
CA, September 2004. doi:10.1109/VETECF.2004.1400146.
35. Zhang, P., Tao, X., Zhang, J., et al. (2005). A vision from the future: Beyond 3G TDD. IEEE Communi-
cations Magazine, 43(1), 3844. doi:10.1109/MCOM.2005.1381873.
123
36. Liu, G., Liu, X., Tian, W., et al. (2005). Capacities of two uplink speech schemes for FuTURE B3G TDD
system in multi-cell scenario. In 2005 IEEE 62th Vehicular Technology Conference (VTC2005-Fall),
Dallas, Texas, USA, September 2005. doi:10.1109/VETECF.2005.1558189.
37. Yin, C., Zhao, X., Hou, X., et al. (2005). A simulation study on channel estimation for MIMO-OFDM
based beyond 3G mobile systems. The Journal of China universities of Posts and Telecommunica, 12(3),
711. doi:cnki:ISSN:1005-8885.0.2005-03-003.
38. Tao, X., Xu, J., Xu, X., et al. (2005). Group Cell FuTURE B3G TDD System. In IEEE 2005 16th Inter-
national Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC 2005), Berlin,
Germany, September 2005. doi:10.1109/PIMRC.2005.1651585.
39. Zheng, K., Huang, L., Wang, W., &Yang, G. (2005). TD-CDM-OFDM: Evolution of TD-SCDMAtoward
4G. IEEE Communications Magazine, 43(1), 4552. doi:10.1109/MCOM.2005.1381874.
40. Yang, Y., & Li, F. (2006). Evolution of TD-SCDMA toward TD-CDM-OFDM. Communications World
Weekly, 6(3), 3536. doi:cnki:ISSN:1009-1564.0.2006-03-028.
41. Yang, Y., & Li, F. (2006). TD-SCDMA Column TD-CDM-OFDM: The next generation TD-SCDMA.
Modern Science & Technology of Telecommunications, 28(3), 5153, 69. doi:cnki:ISSN:1002-5316.0.
2006-03-019.
42. Verdu, S. (1998). Multiuser detection. Cambridge, U.K.: Cambridge University Press.
43. Fincke, U., & Pohst, M. (1985). Improved methods for calculating vectors of short length in a lattice,
including a complexity analysis. Mathematics of Computation, 44(170), 463471.
44. Viterbo, E., &Boutros, J. (1999). Auniversal lattice code decoder for fading channels. IEEE Transactions
on Information Theory, 45(5), 16391642. doi:10.1109/18.771234.
45. Akhtman, J., & Hanzo, L. (2005). Reduced-complexity maximum-likelihood detection in multiple-
antenna-aided multicarrier systems. In 2005 5th International Workshop on Multi-Carrier Spread Spec-
trum Communications, Oberpfaffenhofen, Germany, September 2005.
46. Alias, M. Y., Samingan, A. K., Chen, S., & Hanzo, L. (2003). Multiple antenna aided OFDM employ-
ing minimum bit error rate multiuser detection. Electronics Letters, 39(24), 17691770. doi:10.1049/el:
20031105.
47. Kim, K. J., Yue, J., Iltis, R. A., &Gibson, J. D. (2005). AQRD-M/Kalman lter-based detection and chan-
nel estimation algorithm for MIMO-OFDM systems. IEEE Transactions on Wireless Communications,
4(2), 710721. doi:10.1109/TWC.2004.842951.
48. Necker, M. C., &Stber, G. L. (2004). Totally blind channel estimation for OFDMon fast varying mobile
radio channels. IEEE Transactions on Wireless Communications, 3(5), 15141525. doi:10.1109/TWC.
2004.833508.
49. Li, Y., Seshadri, N., & Ariyavisitakul, S. (1999). Channel estimation for OFDM systems with transmit-
ter diversity in mobile wireless channels. IEEE Journal on Selected Areas in Communications, 17(3),
461471. doi:10.1109/49.753731.
50. Minn, H., Kim, D. I., & Bhargava, V. K. (2002). A reduced complexity channel estimation for OFDM
systems with transmit diversity in mobile wireless channels. IEEE Transactions on Communications,
50(5), 799807. doi:10.1109/TCOMM.2002.1006561.
51. Thoen, S., Deneire, L., Perre, L. V. D., Engels, M., & Man, H. D. (2003). Constrained least squares
detector for OFDM/SDMA-based wireless networks. IEEE Transactions on Wireless Communications,
2(1), 129140. doi:10.1109/TWC.2002.806377.
52. Kim, K. J., Yue, J., Iltis, R. A., &Gibson, J. D. (2005). AQRD-M/Kalman lter-based detection and chan-
nel estimation algorithm for MIMO-OFDM systems. IEEE Transactions on Wireless Communications,
4(2), 710721. doi:10.1109/TWC.2004.842951.
53. Zeng, Y., & Ng, T. S. (2004). A semi-blind channel estimation method for multiuser multiantenna OFDM
systems. IEEE Transactions on Signal Processing, 52(5), 14191429. doi:10.1109/TSP.2004.826183.
54. Wang, Z., Han, Z., & Liu, K. J. R. (2005). A MIMO-OFDM channel estimation approach using time
of arrivals. IEEE Transactions on Wireless Communications, 4(3), 12071213. doi:10.1109/TWC.2005.
847112.
55. Cui, T., & Tellambura, C. (2004). Joint channel estimation and data detection for OFDM systems via
sphere decoding. In IEEE 2004 Global Telecommunications Conference (GLOBECOM 04), Dallas, TX,
November 29December 3, 2004. doi:10.1109/GLOCOM.2004.1379051.
56. IEEE Std. 802.16. (2001). IEEE Standard for local and metropolitan area networks part 16: Air interface
for xed broadband wireless access systems.
57. Tse, D. (1997). Optimal power allocation over parallel Gaussian broadcast channels. In 1997 IEEE Inter-
national Symposium on Information Theory, Ulm Germany, June 1997. doi:10.1109/ISIT.1997.612942.
58. Knopp, R., & Humblet, P. A. (1995). Information capacity and power control in single-cell multiuser
communications. In 1995 IEEE International Conference on Communications, Seattle, WA, June 1995.
doi:10.1109/ICC.1995.525188.
123
59. Pottie, G. J. (1995). Systemdesign choices in personal communications. IEEEPersonal Communications,
2(5), 5067. doi:10.1109/98.468362.
60. Kivanc, D., Li, G., & Liu, H. (2003). Computationally efcient bandwidth allocation and power con-
trol for OFDMA. IEEE Transactions on Wireless Communications, 2(6), 11501158. doi:10.1109/TWC.
2003.819016.
61. User Equipment (UE) radio transmission and reception (TDD), 3GPP TS 25.102.720. Available at: http://
www.3gpp.org/ftp/Specs/archive/25_series/25.102/25102-720.zip,2006-7-6.
62. Rappaport, T. S. (2002). Wireless communications principles and practice (2nd ed.). Upper Saddle River,
NJ: Prentice Hall PTR.
63. OFDM System Design Example:Indoor Wireless LAN. Available at: http://ee.eng.usf.edu/gradcourses/
EE-seminar/presentations/nezami-2.pdf,2006-8-8.
64. Channel models for xed wireless applications. Available at: http://www.ieee802.org/16/tga/docs/
80216a-03_01.pdf,2006/4/25.
65. Method and Principle of Uplink Synchronization. Available at: http://www.3gpp.org/ftp/tsg_ran/WG1_
RL1/TSGR1_05/Docs/Pdf/r1-99624.pdf,2006/5/18.
66. 3rd Generation Partnership Project; Technical Specication Group Radio Access Network;Physical chan-
nels and mapping of transport channels onto physical channels (TDD) (Release 7), 3GPPTS25.221 V7.0.0
(2006-03).
67. Schmidl, T.M., & Cox, D.C. (1997). Robust frequency and timing synchronization for OFDM. IEEE
Transactions on Communications, 45(12), 16131621. doi:10.1109/26.650240.
68. Ogawa, Y., Nishio, K., Nishimura, T., & Ohgane, T. (2003). A MIMO-OFDM system for high-speed
transmission. In 2003 IEEE 58th Vehicular Technology Conference (VTC 2003-Fall), Orlando, Florida,
October 2003.
69. Steiner, B., &Jung, P. (1994). Optimumand suboptimumchannel estimation for uplink of CDMAmobile
radio systems with joint detection. European Transacations on Telecommunication Related Technologies,
5(1), 3949.
70. Steiner, B., & Baier, P. W. (1993). Low cost channel estimation in the uplink receiver of CDMA mobile
radio systems. Frequenz, 47(6), 292298.
71. Proakis, J. G. (1995). Digital communications (3rd ed.). New York: McGraw-Hill.
72. Stuber, G. L., Barry, J. R., McLaughlin, S. W., et al. (2004). Broadband MIMO-OFDM wireless commu-
nications. IEEE Proceedings, 92(2), 271294. doi:10.1109/JPROC.2003.821912.
73. Yang, S., & Zhao, Y. (2004). Channel estimation method for 802.11a WLAN with multiple-antenna. In
10th Asia-Pacic Conference on Communications and 5th International Symposium on Multi-Dimen-
sional Mobile Communications, Pekino University, Beijing, China, 29 August1 September 2004.
74. Ogawa, Y., Nishio, K., Nishimura, T., et al. (2004). Channel and frequency offset estimation for a MIMO-
OFDM system. In 2004 IEEE 60th Vehicular Technology Conference (VTC2004-Fall), Los Angeles,
CA, September 2004. doi:10.1109/VETECF.2004.1400278.
75. Li, Y., & Wang, H. (2003). Channel estimation for MIMO-OFDM wireless communications. In IEEE
14th Proceedings on Personal, Indoor and Mobile Radio Communications (PIMRC2003), Beijing, China,
September 2003. doi:10.1109/PIMRC.2003.1259276.
76. Telatar, E. (1999). Capacity of multi-antenna Gaussian channels. European Transactions on Telecommu-
nications, 10(6), 585595.
77. Nanda, S., Walton, R., Ketchum, J., et al. (2005). A high-performance MIMO OFDM wireless LAN.
IEEE Communications Magazine, 43(2), 101109. doi:10.1109/MCOM.2005.1391508.
78. Willink, T. J. (2005). MIMO OFDM for broadband xed wireless access. IEE Proceedings Communica-
tions, 152(1), 7581. doi:10.1049/ip-com:20040969.
79. Stuber, G. L., Barry, J. R., McLaughlin, S. W., et al. (2004). Broadband MIMO-OFDM wireless commu-
nications. Proceedings of the IEEE, 92(2), 271294. doi:10.1109/JPROC.2003.821912.
80. Ng, K.-W., Cheng, R. S., & Murch, R. D. (2002). Iterative bit & power allocation for V-BLAST based
OFDMMIMOsystemin frequency selective fading channel. In 2002 IEEEWireless Communications and
Networking Conference (WCNC2002), Orlando,USA, March 2002. doi:10.1109/WCNC.2002.993505.
81. Codreanu, M., Tujkovic, D., & Latva-aho, M. (2005). Adaptive MIMO-OFDM systems with channel
state information at TX side. In 2005 IEEE International Conference on Communications (ICC 2005),
Seoul, Korea, May 2005. doi:10.1109/ICC.2005.1494829.
82. Lai, Q., Yin, J., Lin, F., &Yu, H. (2005). Performance of adaptive bit and power allocation MIMO-OFDM
system based on greedy algorithm. In 2005 International Conference on Wireless Communications,
Networking and Mobile Computing (WiMob2005), Montreal, Canada, August, 2005. doi:10.1109/
WCNM.2005.1543975.
123
83. Diaz, J., Bar-Ness, Y., &Lee, Y. H. (2006). Anewapproach to joint AMCand power allocation for MIMO-
OFDM. In 2006 International Conference on Internet and Web Applications and Services/Advanced Inter-
national Conference on Telecommunications (AICT-ICIW06), Guadeloupe, French Caribbean, February
2006. doi:10.1109/AICT-ICIW.2006.19.
Author Biographies
Lu Zhaogan received the B.S. and M.S. degrees, from Jinlin Univer-
sity in 2000 and 2003, respectively. He is currently pursuing the Ph.D.
degree in the Dept. of Information and Information Engineering, Xian
Jiaotong University, China. He is author or co-author of 10 publications.
His research interests include wireless communications, multipleinput-
multiple-output (MIMO) systems, spacetime coding, and error control
coding techniques.
Rao Yuan received the M.S. degrees and Ph.D. degrees, from North-
western Ploytechnical University in 1999 and Xian Jiaotong University
in 2005, respectively. He went on to work at Tsinghua University and
UFIDA Software Co. Ltd., where he was a postdoctor researcher on
RFID and Wireless network application until 2007. He started work as
a vice professor in mobile communication and distributed computing at
Xian Jiaotong University in the spring of 2008. He is author or co-author
of 38 publications. His current research interests include digital mobile
communications, distributed computing and RFID, etc.
Zhang Taiyi received the B.S. and M.S. degrees, from Xian Jiaotong
University in 1967 and 1981, respectively. He went on to work at Xian
Optics andPrecisionMechanics, Academia Sinica, where he was a senior
researcher on image processing and communication system until 1998.
He started work as a professor in mobile communication and WLAN
at Xian Jiaotong University in the spring of 1998. He is author or co-
author of 106 publications. His current research interests include digital
mobile communications, pattern recognition, and image processing.
123
Wang Liejun received the B.S. and M.S. degrees, from XinJiang Uni-
versity in 1998 and 2003, respectively. He is currently pursuing the Ph.D.
degree in the Dept. of Information and Information Engineering, Xian
Jiaotong University, China. He is author or co-author of seven publica-
tions. His current research interests include digital wireless communi-
cations, OFDM systems, and signal detection. He is a student member
of IEICE.
123

Multiuser MIMO OFDM Based TDD TDMA For Next Generation Wireless Communication Systems

Transféré par

Informations du document

Titre original

Copyright

Formats disponibles

Partager ce document

Partager ou intégrer le document

Options de partage

Avez-vous trouvé ce document utile ?

Ce contenu est-il inapproprié ?

Droits d'auteur :

Formats disponibles

Multiuser MIMO OFDM Based TDD TDMA For Next Generation Wireless Communication Systems

Transféré par

Droits d'auteur :

Formats disponibles

Wireless Pers Commun (2010) 52:289324

H [1, 1] (k) H [1, 2] (k) H [1, M

H, i.e., the corresponding fading coefcients of those orthogonal eigenmodes.

Vous aimerez peut-être aussi