ADAPTIVE MODULATION IN TIME AND SPACE FOR SPACE TIME CODES Bagawan S. Nugroho Wichita State University, Department of Electrical and Computer Engineering Wichita, KS 67260-0044 and Hyuck M. Kwon Wichita State University, Department of Electrical and Computer Engineering Wichita, KS 67260-0044 channel status. However, an adaptive STC trellis structure was not presented, and all the TX element branches still employed the same modulation since STBC was studied instead of STC.

ABSTRACT Existing space time codes (STC) for multi-input and multioutput (MIMO) systems employ fixed modulation in time and the same modulation in space at all transmit (TX) antenna elements. Even existing adaptive modulation schemes use the same modulation in space at all TX elements. However, in practice, the fading channel coefficients are typically independent in both time and space. This is the motivation for this study, and the objective of this paper is to present a novel and simple STC trellis structure so that STC MIMO systems can employ adaptive modulation in both time and space at each TX element. The goal of our study is an improved spectral efficiency in bits/s/Hz. As typical adaptive modulation schemes, this paper assumes that channel state information (CSI) is available at each TX element. But, this paper considers a simple case, i.e., “good,” “fair” or “bad” CSI, the corresponding modulation like 8PSK, QPSK or BPSK, and two TX and one receive (RX) element systems. Then, this paper verifies through simulation that the proposed scheme can improve spectral efficiency.1

In practice, the fading channel paths from different TX to RX antenna elements are typically independent in both time and space. Employing adaptive modulation at each TX element may allow higher spectral efficiency in bits/s/Hz than the conventional STC MIMO and the existing adaptive modulation systems. The objective of this paper is to propose such an adaptive modulation scheme for STC. The combination of adaptive modulation and STC is a relatively new research area. This paper will present a novel adaptive STC trellis structure for MIMO systems so that adaptive modulation can be employed at each TX element. Simulation results will show significant improvement of the proposed adaptive STC over the conventional non-adaptive STC with fixed modulation. Section II will present a general system model. Section III provides a novel code construction method for the STC with adaptive modulation. Section IV discusses simulation results. Finally section V concludes the paper.

INTRODUCTION

SYSTEM MODEL

Tarokh et al. in [1] presented trellis design criteria for space time codes (STC) in multiple -input multiple -output (MIMO) systems. The STC assumes that only the receiver knows the fading channel coefficients between transmit (TX) and receive (RX) antenna elements. So, all TX elements employ the same modulation in time and space, regardless of channel status. Goldsmith and Chua [2] studied coded adaptive modulation schemes for use with fading channel, but only a single TX element was considered. Also, Hanzo et al. in [3] considered adaptive modulation in time with space time block codes (STBC) where both the TX and RX have knowledge of fading channel coefficients, and the modulation depends on the

Figure 1 shows a block diagram of the proposed adaptive STC system with two TX antenna elements and one RX antenna element. Modulators 1 and 2 may have different type of modulations while the conventional STC in [1] employs the same type of modulation. So, the STC trellis structure in [1] cannot be directly applied to the adaptive modulation in this paper. Suboptimum trellis structures will be presented for the adaptive STC in the next section. It is not an easy task to find optimum trellis structures [1, 7]. Modulators 1 and 2 may select the type of modulations for the next frame interval, depending on their individual channel states. For simplicity, this paper assumes that the possible modulations are binary phase shift keying (BPSK), quadrature phase shift keying (QPSK), and 8PSK. Also, this paper considers only an eight state STC. We cannot employ a four state STC because an 8PSK

1

This material is based upon work supported by the U. S. Army Research Laboratory and the U. S. Army Research Office under grant number DAAD19-01-10537.

1 of 6

symbol takes three input bits per symbol and requires at least eight states in the trellis structures. We can generalize the concept and theme in this paper to cases of higher modulation and a higher number of states.

the use of two thresholds and two TX elements. Thus, the RX can send the CSI, consisting of four bits, to the TX elements. Then, each TX element determines the modulation type, using the received CSI bits.

This paper assumes a quasi-static channel as did the previous STC studies [1], i.e., the channel coefficients are constant during a frame interval but vary in frame. Each TX element in the proposed adaptive STC modulation system requires only channel state information (CSI), e.g., “good,” “fair” or “bad” CSI, at a given frame interval instead of the exact fading channel coefficients. These CSI can be fed back into the TX from the RX in a duplex link. For example, if a frame consists of 15 slots as the ones in a W-CDMA system [4], then the receiver can estimate CSI every slot by using the pilot symbols in the current frame and reporting the CSI to the TX elements every slot. The TX elements can use the CSI received during the 15th slot of the current frame for the next frame adaptive modulation in a quasi-static channel.

Table 1. Nine possible cases of (I1 , I2 ), and corresponding modulation types.

Case 1 Case 2 Case 3 Case 4

Two modulated symbols, which are from modulators 1 and 2 in Figure 1, are transmitted simultaneously at the same transmission symbol period T, regardless of the modulation type. We also assume that the transmitted symbol has an average symbol energy of Es =1, being independent of modulations. The received signal at the RX antenna element is the sum of the two transmitted symbols corrupted by Rayleigh fading and additive white Gaussian noise (AWGN). We use Jakes’ flat fading channel model for simulation [5]. The fading coefficients h i , i=1,2, are sampled from two independent Jakes fading simulators at the beginning of each frame to represent the fading coefficients from transmit antenna i to the receive antenna. The received signal can be written as

Case 5

rt =

n= 2

∑ hici, t i =1

Es + υt

Case 6 Case 7 Case 8 Case 9

TX1 ’s modulation type associated with I1 =|h 1 |2 Es /N0 I1 < Th 1 BPSK I1 < Th 1 BPSK I1 < Th 1 BPSK Th 1 ≤ I1 < Th2 QPSK Th 1 ≤ I1 < Th 2 QPSK Th 1 ≤ I1 < Th 2 QPSK I1 ≥ Th 2 8PSK I1 ≥ Th 2 8PSK I1 ≥ Th 2 8PSK

TX2 ’s modulation type associated with I2 =|h 2 |2 Es /N0 I2 < Th 1 BPSK Th 1 ≤ I2 < Th2 QPSK I2 ≥ Th2 8PSK I2 < Th 1 BPSK Th 1 ≤ I2 < Th2 QPSK I2 ≥ Th 2 8PSK I2 < Th 1 BPSK Th 1 ≤ I2 < Th2 QPSK I2 ≥ Th 2 8PSK

(1)

For brevity of notation, let I1 =|h 1 |2 Es /N0 and I2 =|h2 |2 Es /N0 . Table 1 lists all nine possible cases of modulation types. For simplicity we assume perfect channel estimation for demodulation at the RX. CODE TRELLIS CONSTRUCTION

where ci,t is the base-band STC complex symbol representation transmitted from antenna i at time t with unit average energy Es , and ?t is a complex AWGN with zero mean and variance N0 /2 per dimension including interference. The received symbol energy-to-noise density ratio |h i |2 Es /N0 is measured and compared with preset thresholds Th 1 and Th 2. These thresholds can be predetermined by observing the three spectral efficiency curves versus ES /N0 for the non-adaptive STCs with the fixed BPSK, QPSK and 8PSK modulations. See Figure 9. It is not an easy task to find the optimum threshold values. In this paper we use suboptimum threshold values, e.g., Th 1 = 7 dB and Th2 = 12 dB by observing Figure 9. Nine cases of the adaptive STC modulations are possible due to

The minimum number of states in the STC trellis structure could be 8, 4, or 2 when 8PSK, QPSK, and BPSK modulations are used, respectively [1]. A universal trellis structure for all types of modulation is desirable in the adaptive modulation, and thus we employ an 8-state code trellis structure for 8PSK, QPSK and BPSK. The complexities for 8-state BPSK, QPSK, and 8PSK are 8, 16, and 21.33, respectively [3, pp. 603]. The code trellis constructions are dependent on the nine possible cases in Table 1. For Cases 1, 5, and 9, we may use the best code trellis structure reported in the non-adaptive STC [1] since both h 1 and h 2 channels are in the same state which means that both TX elements can use the same modulation.

2 of 6

Table 2. Output symbols of the adaptive STC encoders for the nine cases. STC trellis structure

Case 1

(x

k 1

Case 2

(x

, x2k = {a k −1 (1,0)}mod(2) + {a k (0,1)}mod(2)

k 1

, x k2 = {a k −1 (1,0)}mod(2) + {a k − 2 (0,2) + bk ( 0, 2) + a k ( 0,1)}mod(4)

Case 3

(x

k 1

Case 4

(x

, x2k = {bk −1 (1,0)}mod(2) + {d k (0,4) + bk ( 0, 2) + a k (0,1)} mod(8)

k 1

, x2k = {a k − 2 (2,0) + bk ( 2, 0) + a k (1, 0)} mod(4) + {a k −1 ( 0,1)}mod(2)

Case 5

(x , x ) = {a

Case 6

(x

k 1

Case 7

(x

, x2k = {bk −1 ( 2,0) + ak −1 (1, 0)} mod(4) + {d k (0,4) + bk ( 0, 2) + a k (0,1)} mod(8)

k 1

Case 8

(x

, x2k = {d k ( 4,0) + bk ( 2,0) + ak (1,0)} mod(8) + {bk −1 (0,1)} mod(2)

k 1

, x2k = {d k ( 4,0) + bk ( 2,0) + ak (1,0)} mod(8) + {bk −1 (0,2) + ak −1 ( 0,1)} mod(4)

(BPSK,BPSK)

(BPSK,QPSK)

(BPSK,8PSK)

(QPSK,BPSK)

(QPSK,QPSK)

(QPSK,8PSK)

(8PSK,BPSK)

(8PSK,QPSK)

Case 9

(8PSK,8PSK)

outputs of the STC encoder are the constellation points out of {0,1}, {0,1,2,3}, and {0,1,2,3,4,5,6,7} for BPSK, QPSK, and 8PSK, respectively. Figure 3 shows the signal constellations for BPSK, QPSK, and 8PSK modulations used in this paper. The one bit at any BPSK constellation point is equal to one bit out of two bits at the corresponding QPSK constellation point. Similarly, the two bits at any QPSK constellation point are equal to two bits out of three bits at the corresponding 8PSK constellation point. This fact can allow us to use an 8-state STC trellis structure for all types of modulation and simplify our decoding process.

k 1

)

) )

k − 2 ( 2, 0) + b k −1 ( 2,0 ) + a k −1 (1,0 )}mod(4) + {ak − 2 (0,2) + bk ( 0, 2) + ak ( 0,1)} mod(4)

k 2

) ) )

(x , x ) = {d k 1

In the following, we explain in detail the rationales for how we have designed the adaptive STC encoders specified in Table 2 or Figure 2 for each case: 1. Cases 5 and 9: Use the best non-adaptive encoders reported in [1]. 2. Case 1: Apply modulo (2) operation to both symbols of Case 5 since both symbols x1 k and x2 k of Case 1 are BPSK modulated. 3. Case 6: Use x2 k of Case 9 for x2 k of Case 6 since both are 8PSK modulated. Apply modulo (4) operation for x2 k of Case 9 to generate x1 k of Case 6 since it is QPSK modulated. Then, it is one bit delayed since the TX1 element carries the least significant bit (LSB) while the TX2 delivers the most significant bit (MSB). 4. Case 8: Use x2 k of Case 6 for x1 k of Case 8, and use x1 k of Case 6 for x2 k of Case 8 since Case 8 is the reverse of Case 6. 5. Case 2: Use x2 k of Case 5 for x2 k of Case 2 since both symbols x2 k of Cases 2 and 5 are 4PSK modulated. Apply modulo (2) operation to x1 k of Case 5 for x1 k of Case 2 since it is BPSK modulated. 6. Case 4: Use x2 k of Case 2 for x1 k of Case 4, and use x1 k of Case 2 for x2 k of Case 4 since Case 4 is the reverse of Case 2. 7. Case 3: Use x2 k of Case 9 for x2 k of Case 3 since both symbols x2 k of Cases 3 and 9 are 8PSK modulated. Apply modulo (2) operation to x1 k of Case 9 for x1 k of Case 3 since it is BPSK modulated. We can use bk-1 for ak-1 or vice versa since they produce the same minimum distance in the trellis. 8. Case 7: Use x2 k of Case 3 for x1 k of Case 7, and use x1 k of Case 3 for x2 k of Case 7 since Case 7 is the reverse of Case 3.

)

k 2

}mod(8)

k −1 ( 4,0 ) + bk −1 (2 ,0 ) + a k −1 (5, 0)

+ {dk (0,4) + bk ( 0, 2) + ak ( 0,1)}mod(8)

Table 2 lists the code trellis structure for all cases. We employ the same notations used in [1] to observe clearly the differences between the adaptive STC encoders in this paper and the non-adaptive STC encoders in [1]. Figure 2(a) shows the corresponding adaptive STC encoders for Cases 2 and 4. Figure 2(b) shows the corresponding adaptive STC encoders for Cases 3 and 7, and Figure 2(c) for Cases 6 and 8. The STC encoders take one, two, and three binary information bits of 0 and 1 at time k to generate BPSK, QPSK and 8PSK symbols for each TX antenna element. The (a k), (ak,bk) and (ak,bk,dk) denote these information bits, respectively. Symbols x1 k and x2 k are generated by using the encoders specified in Figure 2 or Table 2 and are transmitted over the first and second antenna element at time k, respectively, ( k − 1)T ≤ t < kT . The addition in Table 2 is performed in Z2 , Z4, and Z8 , the ring of integers modulo 2, 4, and 8, for BPSK, QPSK, and 8PSK symbol respectively. The

3 of 6

Figure 4 shows the corresponding adaptive 8 state-BPSK STC trellis structure, while the 8-state STC trellis structure for QPSK and 8PSK can be found in [1, pp 752]. Figure 5 shows the adaptive STC trellis structure for Case 2 with the 8-state BPSK modulation for the current state and the QPSK modulation for the next state. The same STC trellis structure shown in Figure 5 can be used for

Case 4. Figure 6 shows the adaptive STC trellis structure for Cases 3 and 7, and Figure 7 shows the structure for Cases 6 and 8.

Spectral Efficiency (bits/s/Hz ) =

Since the receiver has generated the CSI, the corresponding modulation type and trellis structure are known to the receiver. Thus, the transmitted bits can be decoded, using the maximum likelihood (ML) principle. The Viterbi algorithm can be applied to select the best path with the minimum accumulation metric at the final stage in a frame. To do this, the decoder computes branch metrics for all branches merging into the same state by using

1 (1− FER )  2 (1 − FER )  3 (1 − FER )  R (1 − FER )

bk ( x1k , xk2 ) = rk − h1x1k − h2 xk2

2

for nonadaptive STC with fixed BPSK - Case 1 for nonadaptive STC with fixed QPSK - Case 5 for nonadaptive STC with fixed 8PSK - Case 9 for adaptive STC - Other cases

(3)

where R varies between 1 and 3, depending on the CSI.

(2)

Figure 9 shows the spectral efficiency in bits/s/Hz versus Es /N0 for the proposed adaptive STC (circles), the nonadaptive STC of 8 states with fixed BPSK modulation (triangles), QPSK (diamonds) and 8PSK (squares). It is observed that the spectral efficiency curve of the nonadaptive STC with fixed BPSK crosses that of the nonadaptive STC with fixed QPSK at near Es /N0 = 5 dB, and the QPSK with 8PSK crosses at near Es /N0 = 11 dB. We found through simulation that the optimum value for Th 1 is near 7 dB, and the value for Th 2 is near 12 dB. It is observed that our proposed adaptive STC achieves the best spectral efficiency for all Es /N0 . At low Es /N0 = 2 dB, the spectral efficiency of the adaptive STC is 0.5 (bits/s/Hz). This is equal to that of the non-adaptive STC with fixed BPSK, but it is about 2.5 higher and infinite times better than that of non-adaptive STC with fixed QPSK and 8PSK, respectively. At high Es /N0 = 20 dB, the spectral efficiency of the adaptive STC is 3 (bits/s/Hz). This is equal to that of the non-adaptive STC with fixed 8PSK, but it is about 1.5 times higher than that of nonadaptive STC with fixed QPSK. At medium Es /N0 =11 dB, the spectral efficiency of the adaptive STC is 2.2 (bits/s/Hz) which is 1.25 times higher than those of the non-adaptive STC with fixed QPSK or 8PSK which are about 1.76 (bits/s/Hz). Thus, at medium Es /N0 =11 dB, the adaptive STC can be 25% better in spectral efficiency than both the non-adaptive STCs of 8 states with fixed BPSK, QPSK and 8PSK modulations.

and keeps only the survivor branch, causing the minimum accumulation metric at given time k and each state. SIMULATION AND RESULTS In this paper, each frame consists of 130 symbol transmissions at each TX antenna. Symbols are from the BPSK, QPSK and 8PSK modulators, depending on the CSI at each antenna. Thus, the rate of input bits to the STC encoder should be variable, due to the adaptive modulation at each antenna. The minimum rate is set to 130 kbits/s when both TX elements use BPSK for Case 1, and the maximum rate would be 390 kbits/s when one or both TX elements employ 8PSK for Cases 3, 6, 7, 8 and 9. Two independent Jakes’ fading coefficients are generated and multiplied to the symbols from transmit antenna 1 and 2, respectively. And an AWGN is added at the receiver. Figure 8 shows frame error rate (FER) versus Es /N0 under the fading environment for the proposed adaptive STC of 8 states (the circles). Figure 8 also shows FER results for the conventional non-adaptive STC of eight states with fixed BPSK (the triangles), QPSK (the diamonds), and 8PSK modulation (the squares) for comparisons. Bitenergy-to-noise-density ratio Eb /N0 is equal to Es /N0 minus 3 dB and 4.7 dB for QPSK and 8PSK, respectively. As expected, the FER of the proposed adaptive STC is between those of 8PSK and BPSK. When the SNR is as low as 2 dB, the FER of the adaptive STC is close to that of the non-adaptive STC of eight states with fixed BPSK modulation. This is reasonable since both TX1 and TX2 elements in the adaptive STC will employ BPSK modulations at such a low SNR.

CONCLUSION

The spectral efficiency in bits/s/Hz at a given Es /N0 can be obtained as [6]:

This paper presented a novel STC trellis structure for adaptation in both time and space so that adaptive modulation can be employed at each transmit antenna element. Then, this paper considered a simple feedback CSI like “good,” “fair” or “bad” for each TX element. Finally, this paper presented simulation spectral efficiency results in bits/s/Hz, using BPSK, QPSK, and 8PSK modulations and eight state STC trellis structures. It was observed that our proposed adaptive STC achieves better spectral efficiency for all Es /N0 than the conventional nonadaptive STC with fixed modulations.

4 of 6

REFERENCES

D

bk

[1]. V. Tarokh, N. Seshadri, and A. R. Calderbank, "Space-Time Codes for High Data Rate Wireless Communication: Performance Criterion and Code Construction," IEEE Trans. Inf. Theory, vol. 44, pp. 744-765, March 1998. [2]. A. J. Goldsmith and S-G. Chua, “Adaptive Coded Modulation for Fading Channels,” IEEE Trans. on Comm., vol. 46, no. 5, pp. 595-602, May 1998. [3]. L. Hanzo, C. H. Wong, and M. S. Yee, Adaptive Wireless Transceivers, Wiley, West Sussex, England, 2002. [4]. Third Generation Partnership Project, “Spreading and Modulation (FDD),” 3GPP Technical Specification, TS25.213, v3.2.0, March 2000. [5]. William C. Jakes, Microwave Mobile Communication, Piscataway, NJ: IEEE Press, 1974. [6]. S. Catreux, V. Erceg, D. Gesbert, and R. W. Heath, Jr., "Adaptive Modulation and MIMO Coding for Broadband Wireless Data Networks," IEEE Comm. Mag., vol. 40, issue 6, pp. 108-115, June 2002. [7]. S. Bäro, G. Bauch, and A. Hansmann, “Improved Codes for Space-Time Trellis-Coded Modulation,” IEEE Commun. Lett., vol. 4, pp. 20-22, Jan. 2000.

1

2 1

ak

Modulator 1

h1

STC Decoder/ RX

+ Modulator 2

h2

+

x2 k

modulo (8)

(b) bk

D

2

ak

D

1

+

x1 k

modulo (4)

4

dk

2 1

+

x2 k

modulo (8)

(c)

Figure 2. Adaptive STC encoders for Cases (a) 2 and 4, (b) 3 and 7, (c) 6 and 8.

1 (1)

STC Encoder/ TX

x1 k

4

dk

1 (01)

Source

modulo (2)

0 (0)

2 (010)

4 0 (00) (100)

2 (10)

3 (11) (b)

(a)

3 (011)

5 (101)

1 (001) 0 (000)

6 (110) (c)

7 (111)

Sink

Figure 3. Signal conste llations of (a) BPSK, (b) QPSK and (c) 8PSK modulations used in this paper.

νt CSI Estimator

BPSK

Figure 1. A general block diagram of an adaptive STC under fading environment.

BPSK

00 01 10 11

ak

D

1

modulo (2)

x1 k

00 01 10 11

D

01 00

2 2

bk

1

+

x2 k

11 10 01 00

modulo (4)

11 10

(a)

Figure 4. Eight state trellis diagram for a non-adaptive STC where both TX1 and TX2 antenna elements transmit BPSK symbols.

5 of 6

BPSK

QPSK

1.00E+00

00 01 02 03 10 11 12 13 Frame Error Rate

1.00E-01

00 01 02 03 10 11 12 13 02 03 00 01

1.00E-02

8 states, 8-PSK, 3 b/s/Hz

1.00E-03

8 states, QPSK, 2 b/s/Hz 8 states, BPSK, 1 b/s/Hz

12 13 10 11

8 states, adaptive 1.00E-04

02 03 00 01

0

2

4

6

8

10

12

14

16

18

20

Es /N0 (dB)

12 13 10 11

Figure 8. Frame error rate versus Es /N0 under fading environment for the adaptive and non-adaptive STC.

Figure 5. Eight state trellis diagram for an adaptive STC where TX1 and TX2 antenna elements transmit BPSK and QPSK symbols, respectively. BPSK

8PSK 3.50

00 01 02 03 04 05 06 07

3.00 Spectral Efficiency (b/s/Hz)

00 01 02 03 04 05 06 07

10 11 12 13 14 15 16 17 10 11 12 13 14 15 16 17 00 01 02 03 04 05 06 07 00 01 02 03 04 05 06 07

8-PSK QPSK BPSK Adaptive

2.50

2.00

1.50

1.00 0.50

10 11 12 13 14 15 16 17

0.00 0

2

4

6

8

10

12

14

16

18

20

Es /N0 (dB)

10 11 12 13 14 15 16 17

Figure 6. Eight state trellis diagram for an adaptive STC where TX1 and TX2 antenna elements transmit BPSK and 8PSK symbols, respectively. QPSK

Figure 9. Spectral efficiency versus Es /N0 under fading environment for the adaptive and non-adaptive STC.

8PSK

00 01 02 03 04 05 06 07 10 11 12 13 14 15 16 17 20 21 22 23 24 25 26 27 30 31 32 33 34 35 36 37 00 01 02 03 04 05 06 07 10 11 12 13 14 15 16 17 20 21 22 23 24 25 26 27 30 31 32 33 34 35 36 37

Figure 7. Eight state trellis diagram for an adaptive STC where TX1 and TX2 antenna elements transmit QPSK and 8PSK symbols, respectively.

6 of 6

adaptive modulation in time and space for space time ...

For Cases 1, 5, and 9, we may use the best code ... Cases 5 and 9: Use the best non-adaptive encoders ..... Broadband Wireless Data Networks," IEEE Comm.

245KB Sizes 1 Downloads 204 Views

Recommend Documents

Communicating in time and space
control flows as well as data and metadata (and process data) flows and .... Conceptual models and object graphs are wellknown and powerful tools for defining ...

Combining Similarity in Time and Space for ... - Semantic Scholar
Eindhoven University of Technology, PO Box 513, NL 5600 MB Eindhoven, the Netherlands ... Keywords: concept drift; gradual drift; online learning; instance se- .... space distances become comparable across different datasets. For training set selecti

Combining Similarity in Time and Space for Training ...
shows the best accuracy in the peer group on the real and artificial drifting data. ... advantage under gradual drift scenarios in small and moderate size data ..... In Figure 9 we visualize all the datasets on time against distance in space axes.

Gravity in Complex Hermitian Space-Time
Oct 9, 2006 - The Hermitian symmetry of the metric gµν is given by. gµν (x) = gνµ (x), .... The Hermitian manifold M of complex dimensions d is defined as a.

Space-Time Video Montage - CiteSeerX
Microsoft Research Asia†. Beijing , P.R.China. {yasumat,xitang}@microsoft.com ... This paper addresses the problem of automatically syn-. *This work was done while the first author was visiting Microsoft Re- ..... 3 shows four frames from the origi

Apparatus and methods for providing efficient space-time structures for ...
Sep 8, 2009 - implemented as part of a wireless Local Area Network (LAN) or Metropolitan ...... computer-readable storage medium having a computer pro.

Apparatus and methods for providing efficient space-time structures for ...
Sep 8, 2009 - “Channel Estimation for OFDM Systems With Transmitter Diversity in Mobile Wireless .... transmission line capacity) as used in SISO OFDM systems. .... telephone system, or another type of radio or microwave frequency ...

Space and time aliasing structure in monthly mean polar-orbiting ...
analysis in a given domain, and ε be the spatial root mean square (rms) ... same spatial domain. ...... observations will be available in the near future (e.g., ERS1.

Combining Time and Space Similarity for Small Size ...
http://www.ics.uci.edu/∼mlearn/MLRepository.html, 2007. 2. C. G. Atkeson ... In 17th Brazilian Symposium on AI, LNCS, pages 286–295, 2004. 7. V. Ganti, J.

Space Time Vortex Theory.pdf
Space Time Vortex Theory.pdf. Space Time Vortex Theory.pdf. Open. Extract. Open with. Sign In. Main menu. Displaying Space Time Vortex Theory.pdf.

Space-Time Video Montage
but uses an arbitrary space-time volume that is extracted as ... streams have been divided into a set of meaningful and ... erate a summary video. ... Figure 2. Overview of the space-time video montage. 2. Overview of .... stage. 3.1. Finding informa

PdF Air Light Time Space
... parents Harald Dahl and … Gmail is email that s intuitive efficient and useful 15 ... Wheaton EXPLO Focus EXPLO Business of Entertainment EXPLO …Latest ... Industry Security Hardware Apple and WindowsAttempts to bring new voices ...

Feynman, Space-Time Approach to Quantum Electrodynamics.pdf ...
Page 1 of 21. Page 1 of 21. Page 2 of 21. Page 2 of 21. Page 3 of 21. Page 3 of 21. Feynman, Space-Time Approach to Quantum Electrodynamics.pdf. Feynman, Space-Time Approach to Quantum Electrodynamics.pdf. Open. Extract. Open with. Sign In. Main menu

Multigrid Methods with Space-Time Concurrency - Computation
Key words. multigrid methods; space-time discretizations; parallel-in-time ... computing leading towards computers with more, but not faster, processors induce ...... inverse bandwidth cost, i.e., the cost per amount of data sent, and γ is the flop 

Power control with space time transmit diversity
Dec 31, 1998 - “Space-Time Codes for High Data Rate Wireless Communication. Performace .... exploit advantages of closed-loop power control with path.

Power control with space time transmit diversity
Dec 31, 1998 - second signals. A control circuit (430) is coupled to receive the output signal and a reference signal. The control circuit is. (56). References Cited arranged to produce a control signal at a second time in response to a comparison of

Space Time Vortex Theory.pdf
Whoops! There was a problem loading more pages. Retrying... Whoops! There was a problem previewing this document. Retrying... Download. Connect more ...

Multigrid methods with space-time concurrency - Computation
resources than standard space-parallel methods with se- quential time stepping. ...... Friedhoff, S., MacLachlan, S.: A generalized predictive analysis tool for ...