74 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 50, NO. 1, JANUARY 2002 LDPC-Based Space–Time Coded OFDM Systems Over Correlated Fading Channels: Performance Analysis and Receiver Design Ben Lu, Student Member, IEEE, Xiaodong Wang, Member, IEEE, and Krishna R. Narayanan, Member, IEEE Abstract—We consider a space–time coded (STC) orthogonal frequency-division multiplexing (OFDM) system with multiple transmitter and receiver antennas over correlated frequency- and time-selective fading channels. It is shown that the product of the time-selectivity order and the frequency-selectivity order is a key parameter to characterize the outage capacity of the correlated fading channel. It is also observed that STCs with large effective lengths and ideal built-in interleavers are more effective in exploiting the natural diversity in multiple-antenna correlated fading channels. We then propose a low-density parity-check (LDPC)-code-based STC-OFDM system. Compared with the conventional space–time trellis code (STTC), the LDPC-based STC can significantly improve the system performance by ex- ploiting both the spatial diversity and the selective-fading diversity in wireless channels. Compared with the recently proposed turbo-code-based STC scheme, LDPC-based STC exhibits lower receiver complexity and more flexible scalability. We also consider receiver design for LDPC-based STC-OFDM systems in unknown fast fading channels and propose a novel turbo receiver employing a maximum a posteriori expectation-maximization (MAP-EM) demodulator and a soft LDPC decoder, which can significantly reduce the error floor in fast fading channels with a modest com- putational complexity. With such a turbo receiver, the proposed LDPC-based STC-OFDM system is a promising solution to highly efficient data transmission over selective-fading mobile wireless channels. Index Terms—Correlated fading, iterative receiver, low-den- sity parity-check (LDPC) codes, multiple antennas, orthogonal frequency-division multiplexing (OFDM), space–time code (STC). I. INTRODUCTION A considerable amount of recent research has addressed the design and implementation of space–time coded (STC) systems for wireless flat-fading channels, e.g., [1]–[3]. The STC Paper approved by R. Raheli, the Editor for Detection, Equalization, and Coding of the IEEE Communications Society. Manuscript received September 25, 2000; revised May 28, 2001. The work of X. Wang and B. Lu was supported in part by the National Science Foundation under Grant CAREER CCR–9875314 and CCR–9980599. The work of K.R. Narayanan was sup- ported in part by the National Science Foundation under Grant CCR–0073506 and an ATP grant from the Texas higher education coordination board. This paper was presented in part at the 2001 IEEE International Symposium on Information Theory, Washington, DC, June 2001. B. Lu and K. R. Narayanan are with the Department of Electrical Engi- neering, Texas A&M University, College Station, TX 77843 USA (e-mail: benlu@ee.tamu.edu; krishna@ee.tamu.edu). X. Wang was with the Department of Electrical Engineering, Texas A&M University, College Station, TX 77843 USA. He is now with the Department of Electrical Engineering, Columbia University, New York, NY 10027 USA. Publisher Item Identifier S 0090-6778(02)00521-4. systems integrate the techniques of antenna array spatial diver- sity and channel coding and can provide significant capacity gains in wireless channels. However, many wireless channels are frequency-selective in nature, for which the STC design problem becomes a complicated issue. On the other hand, the orthogonal frequency-division multiplexing (OFDM) technique transforms a frequency-selective fading channel into parallel correlated flat-fading channels. Hence, in the presence of fre- quency selectivity, it is natural to consider STC in the OFDM context. The first STC-OFDM system was proposed in [4]. In this paper, we provide system performance analysis and receiver design for a new STC-OFDM system over correlated frequency- and time-selective fading channels. We first analyze the STC-OFDM system performance in correlated fading channels in terms of channel capacity and pairwise error probability (PEP). In [5], information-theoretic aspects of a two-ray propagation fading channel are studied. More recently, in [6] and [7], the channel capacity of a mul- tiple-antenna system in fading channels is investigated, and in [8] the limiting performance of a multiple-antenna system in block-fading channels is studied, under the assumption that the fading channels are uncorrelated and the channel state information (CSI) is known to both the transmitter and the receiver. Here, we analyze the channel capacity of a mul- tiple-antenna OFDM system over correlated frequency- and time-selective fading channels, assuming that the CSI is known only to the receiver. As a promising coding scheme to approach the channel capacity, STC is employed as the channel code in this system. The pairwise error probability (PEP) analysis of the STC-OFDM system is also given, which follows the analysis for coded modulation systems [1], [9], [10]. Moreover, based on the analysis of the channel capacity and the PEP, some STC design principles for the system under consideration are suggested. Since the STC based on the state-of-the-art low-density parity-check (LDPC) codes [11]–[13] turns out to be a good candidate to meet these design principles, we then propose an LDPC-based STC-OFDM system and develop a turbo receiver for this system. (Note that the design issues of STC in broad-band OFDM systems have been independently addressed in [14].) With ideal CSI, the iterative receiver based on the turbo prin- ciple [15] is shown to be able to provide the near-maximum- likelihood performance in STC systems [16], [17]. When the CSI is not available, a receiver structure consisting of a decision- 0090–6778/02$17.00 ? 2002 IEEE LU et al.: LDPC-BASED SPACE–TIME CODED OFDM SYSTEMS OVER CORRELATED FADING CHANNELS 75 Fig. 1. System description of a multiple-antenna STC-OFDM system over correlated fading channels. Each STC code word spans 75 subcarriers and 80 time slots in the system; at a particular subcarrier and at a particular time slot, STC symbols are transmitted from 78 transmitter antennas and received by 77 receiver antennas. directed least-square estimator and a data detector is introduced in [18]. For the system considered here, the receiver in [18] per- forms well at low to medium Doppler frequencies, but exhibits an irreducible high error floor in fast fading channels. A receiver employing the expectation-maximization (EM) algorithm has recently been proposed for STC systems [19], [20], which ex- hibits a good performance, but, on the other hand, its complexity is relatively high for the LDPC-based STC-OFDM systems. Here, we develop a novel turbo receiver structure employing a maximum a posteriori expectation-maximization (MAP-EM) demodulator and a soft LDPC decoder, which can significantly reduce the error floor in fast fading channels with a modest com- putational complexity. (A similar iterative receiver structure is developed for static MIMO channels in [21].) The rest of this paper is organized as follows. In Section II, a multiple-antenna STC-OFDM system over correlated fre- quency- and time-selective fading channels is described. In Section III, the outage capacity of this system is analyzed. In Section IV, the PEP analysis is given. Based on the analysis in Sections III and IV, in Section V, an LDPC-based STC is proposed for the OFDM system under consideration. In Section VI, a novel turbo receiver is developed. In Section VII, computer simulation results are given. Section VIII contains the conclusion. II. SYSTEM MODEL We consider an STC-OFDM system with subcarriers, transmitter antennas, and receiver antennas, signaling through frequency- and time-selective fading channels, as illustrated in Fig. 1. Each STC code word spans adjacent OFDM words, and each OFDM word consists of ( ) STC symbols, transmitted simultaneously during one time slot. Each STC symbol is transmitted at a particular OFDM subcarrier and a particular transmitter antenna. It is assumed that the fading process remains static during each OFDM word (one time slot) but varies from one OFDM word to another, and the fading processes associated with different transmitter-receiver antenna pairs are uncorrelated. (However, as will be shown below, in a typical OFDM system, for a particular transmitter–receiver antenna pair, the fading processes are correlated in both frequency and time.) At the receiver, the signals are received from receiver antennas. After matched filtering and sampling, the discrete Fourier transform (DFT) is applied to the received discrete-time signal to obtain 0 1 1 (1) where is the matrix of complex channel fre- quency responses at the th subcarrier and at the th time slot, which is explained below, and are re- spectively the transmitted signals and the received signals at the th subcarrier and at the th time slot, and is the ambient noise, which is circularly symmetric complex Gaussian with unit variance. Consider the channel response between the th transmitter an- tenna and the th receiver antenna. Following [22], the time-do- main channel impulse response can be modeled as a tapped- delay line. With only the nonzero taps considered, it can be ex- pressed as (2) where is the Dirac delta function, denotes the number of nonzero taps, and is the complex amplitude of the th nonzero tap, whose delay is , where is an integer and is the tone spacing of the OFDM system. In mobile channels, for the particular ( )th antenna pair, the time-variant tap coefficients can be modeled as wide-sense stationary random processes with uncorrelated scattering (WSSUS) and with band-limited Doppler power spectrum [22]. For the signal model in (1), we only need to consider the time responses of within the time interval 0 , where is the total time duration of one OFDM word plus its cyclic extension and is the total time involved in transmitting adjacent OFDM words. Following [23], for the particular th tap of the ( )th antenna pair, the dimension of the band- and time-limited random process 0 (defined as the number of significant eigenvalues in the Karhunen–Loeve expansion of this random 76 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 50, NO. 1, JANUARY 2002 process), is approximately equal to 2 1 , where is the maximum Doppler frequency. Hence, ignoring the edge effects, the time response of can be expressed in terms of the Fourier expansion as (3) where is a set of independent circularly symmetric complex Gaussian random variables, indexed by . For OFDM systems with proper cyclic extension and sample timing, with tolerable leakage, the channel frequency response between the th transmitter antenna and the th receiver antenna at the th time slot and at the th subcarrier, which is exactly the ( )th element of in (1), can be expressed as [24] (4) where is the -sized vector containing the time responses of all the nonzero taps; contains the corresponding DFT coefficients. Using (3), can be simplified as (5) where is an -sized vector, and contains the corresponding inverse DFT coefficients. Substituting (5) into (4), we obtain with (6) From (6), it is seen that, due to the close spacing of OFDM sub- carriers and the limited Doppler frequency, for a specific an- tenna pair ( ), the channel responses are dif- ferent transformations [specified by and ] of the same random vector and hence they are correlated in both frequency and time. III. CHANNEL CAPACITY In this section, we consider the channel capacity of the system described above. Assuming that the channel state information (CSI) is only known at the receiver and the transmitter power is constrained as , the in- stantaneous channel capacity of this system, which is defined as the mutual information conditioned on the correlated fading channel values , is computed as [5], [8] bit/s/Hz (7) where and is the th nonzero eigenvalue of the nonnegative definite Hermitian matrix . The maximization of is achieved when consists of independent circularly symmetric complex Gaussian random variables with identical variances [5], [8]. (When the CSI is known to both the transmitter and the receiver, the instantaneous channel capacity is maximized by “water-filling” [25].) The ergodic channel capacity is defined as . In the system considered, the concept of ergodic channel capacity is of less interest, because the fading processes are not ergodic due to the limited number of antennas and the limited and . Since is a random variable, whose statistics are jointly determined by ( ) and the characteristics of correlated fading channels, we turn to another important concept—outage capacity, which is closely related to the code word error prob- ability, as averaged over the random coding ensemble and over all channel realizations [8]. The outage probability is defined as the probability that the channel cannot support a given informa- tion rate (8) Since it is difficult to get an analytical expression for (8), we resort to Monte Carlo integration for its numerical evaluation. A. Numerical Results In this subsection, we give some numerical results of the outage probability in (8) obtained by Monte Carlo integration. For simplicity, we assume that all elements in have the same variances. Define the selective-fading diversity order as the product of the number of nonzero delay taps and the di- mension of Doppler fading process , i.e., . The fol- lowing observations can be made from the numerical evalua- tions of (8). 1) From Figs. 2 and 3, it is seen that at a practical outage probability (e.g., 1 ), for fixed ( ), the highest achievable information rate increases as the selective-fading diversity order increases, but the increase slows down as becomes larger. Eventually, as , the highest achievable information rate converges to the ergodic capacity. [Note that the ergodic capacity is the area above each curve in the figure as .] 2) Fig. 3 compares the impacts of the frequency-selectivity order and the time-selectivity order on the outage capacity. It shows that the frequency selectivity and the time selectivity are essentially equivalent in terms of their LU et al.: LDPC-BASED SPACE–TIME CODED OFDM SYSTEMS OVER CORRELATED FADING CHANNELS 77 Fig. 2. Outage probability versus information rate in a correlated fading OFDM system with 77 61 1, 75 61 256, 80 61 1, SNR61 20 dB, where dashed lines represent the system with one transmitter antenna (78 61 1) and solid lines represent the system with four transmitter antennas (78 61 4). The vertical dash–dotted line represents the AWGN channel capacity (when SNR61 20 dB). The fading channels are frequency-selective and time-nonselective with 76 61 1597661 76 61 1021592593596103. Fig. 3. Outage probability versus information rate in a correlated fading OFDM system with 78 61 2, 77 61 1, 75 61 256, 80 61 10, SNR61 20 dB. Dashed lines represent the frequency-selective and time-nonselective channels with 76 61 1, 76 61 76 61 10225965910103. Dotted lines represent the frequency- and time-selective channels with 76 61 2, 76 61 5076 61 10225965910103. Note that, for the same 76, the dashed lines and the dotted lines overlap each other, which shows the equivalent impacts of the frequency- and time-selective fading on the outage probability. impacts on the outage capacity. In other words, the selec- tive-fading diversity order ultimately affects the outage capacity. 3) From Fig. 2, it is seen that, as the area above each curve, the ergodic channel capacity is irrelevant of the selec- tive-fading diversity order (which is the key parameter in determining the correlation characteristics of the fading channels) and it is determined only by the spatial diversity order ( ) and the transmitted signal power [6], [7]. Moreover, it is seen that both the outage capacity and the ergodic capacity can be increased by fixing the number of receiver antennas and only increasing transmitter an- 78 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 50, NO. 1, JANUARY 2002 tennas (or vice versa), (e.g., by fixing 1 and let , the ergodic capacity converges to the capacity of AWGN channels [26]). In summary, we have seen the different impacts of two di- versity resources—the spatial diversity and the selective-fading diversity—on the channel capacity of a multiple-antenna cor- related fading OFDM system. Increasing the spatial diversity order (i.e., ) can always bring capacity (outage capacity and/or ergodic capacity) increase at the expense of extra phys- ical costs. By contrast, the selective-fading diversity is a free re- source, but its effect on improving the channel capacity becomes less as becomes larger. Since both diversity resources can im- prove the capacity of a multiple-antenna OFDM system, it is crucial to have an efficient channel coding scheme, which can take advantage of all available diversity resources of the system. IV. PAIRWISE ERROR PROBABILITY In the previous section, the potential information rate of a multiple-antenna OFDM system in correlated fading channels is studied. In order to obtain more insights on coding design, in this section, we analyze the pairwise error probability (PEP) of this system with coded modulation. With perfect CSI at the receiver, the maximum likelihood (ML) decision rule of the signal model (1) is given by (9) where the minimization is over all possible STC codeword . Assuming equal transmitted power at all trans- mitter antennas, using the Chernoff bound, the PEP of trans- mitting and deciding in favor of another codeword at the decoder is upper bounded by (10) where is the total signal power transmitted from all trans- mitted antennas (recall that the noise at each receiver antenna is assumed to have unit variance). Using (4)–(6), is given by (11)–(13), shown at the bottom of the page. In (12), ( ) is a rank-one matrix, which equals to a zero matrix if the entries of codewords and corresponding to the th subcarrier and the th time slot are the same. Let denote the number of instances when ; similarly, as in [10], , which is the minimum over every two possible codeword pair, is called the effective length of the code. Denoting , it is easily seen that . Since and vary with different multipath delay profiles and Doppler power spectrum shapes, the matrix is also variant with different channel environments. However, it is observed that is a nonnegative definite Hermitian matrix; by an eigendecomposition, it can be written as (14) where is a unitary matrix and 0 0 , with being the positive eigenvalues of . Moreover, as assumed in Section III, all the ( ) elements of are (11) with (12) (13) LU et al.: LDPC-BASED SPACE–TIME CODED OFDM SYSTEMS OVER CORRELATED FADING CHANNELS 79 i.i.d. (independent and identically distributed) circularly sym- metric complex Gaussian with zero-means. Then (10) can be rewritten as 8 (15) where is the th element of . Since is unitary, are also i.i.d. circularly symmetric complex Gaussian with zero-means and their magnitudes are i.i.d. Rayleigh distributed. By averaging the conditional PEP in (15) over the Rayleigh probability density function (pdf), the PEP of a multiple-antenna STC-OFDM system over correlated fading channels is finally written as (16) It is seen from (16) that the highest possible diversity order the STC-OFDM system can provide is ( ), i.e., the product of the number of transmitter antennas, the number of receiver an- tennas, and the number of selective-fading diversity order in the channels. In other words, the attractiveness of the STC-OFDM system lies in its ability to exploit all the available diversity re- sources. However, note that, although in the analysis of PEP the three parameters ( ) appear equivalent in improving the system performance, they actually play different roles from the capacity viewpoint, as indicated in Section III. V. LDPC-BASED STC-OFDM SYSTEM In this section, we consider coding design for STC-OFDM systems. As in Section II, we assume that the CSI is known only at the receiver. A. Coding Design Principles The PEP analysis of a general STC-OFDM system in Sec- tion IV, as well as the channel capacity analysis in Section III, sheds some lights on the STC coding design problem. 1) The dominant exponent in the PEP (16) that is related to the structure of the code is , the rank of the matrix . Recall that , in order to achieve the maximum diversity ( ), it is necessary that , i.e., the effective length of the code must be larger than the dimension of matrix in (12). Since is associated with the channel characteristic, which is not known to the transmitter (or the STC encoder) in advance, it is preferable to have an STC code with a large effective length. 2) Another factor in the PEP is , the product of eigenvalues of matrix . Since changes with different channel setups, the optimal design of is not fea- sible. However, as observed in [1], the space–time trellis codes (STTCs) with higher state numbers (and essen- tially larger effective length) have better performance, which suggests that increasing the effective length of the STC beyond the minimum requirement (e.g., , in our system) may help to improve the factor . 3) Also as seen from (7), to achieve the channel capacity, all the ( ) transmitted STC symbols are required to be independent. Therefore, after introducing the coding con- straints to the coded symbols, an interleaver is needed to scramble the coded symbols in order to satisfy the inde- pendence condition. From the standpoint of PEP analysis, such an interleaver helps to improve the factor as well. In summary, in the system considered here, because of the di- verse fading profiles of the wireless channels and the assump- tion that the CSI is known only at the receiver, the systematic coding design (e.g., by computer search) is less helpful; instead, two general principles should be met in choosing STC codes in order to robustly exploit the rich diversity resources in this system, namely, large effective length and ideal interleaving. STTCs have been proposed for multiple-antenna systems over flat-fading channels [1]. However, the complexity of the STTC increases dramatically as the effective length increases and therefore it may not be a good candidate for the OFDM system considered here. Another family of STCs is turbo-code based STCs [27], [28], but their decoding complexity is high and they are not flexible in terms of scalability (e.g., when employed in systems with different requirements of the infor- mation rate). Here, we propose a new STC scheme: low-density parity-check (LDPC)-based STC. B. LDPC-Based STC First proposed by Gallager in 1962 [11] and recently reex- amined in [12], [13] and [29], low-density parity-check (LDPC) codes have been shown to be a very promising coding technique for approaching the channel capacity in AWGN channels. For example, a carefully constructed rate 1 2 irregular LDPC code with long block length has a bit error probability of 10 at just 0.04 dB away from Shannon capacity of AWGN channels [30]. An LDPC code is a linear block code characterized by a very sparse parity-check matrix, as seen in Fig. 4. The parity check matrix of an ( ) LDPC code of rate is an matrix, which has ones in each column and ones in each row. Apart from these constraints, the ones are placed at random in the parity check matrix. When the number of ones in every column is the same, the code is known as a regular LDPC code; otherwise, it is called irregular LDPC code. In contrast to , the generator matrix is dense. Consequently, the number of bit operations required to encoder is which is larger than that for other linear codes. Similar to turbo codes, LDPC codes can be efficiently decoded by a suboptimal iterative belief propagation algorithm which is explained in detail in [11]. At the end of each iteration, the parity check is performed. If the parity check is correct, the decoding is terminated; otherwise, the decoding continues until it reaches the maximum number of iterations (e.g., 30). 80 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 50, NO. 1, JANUARY 2002 Fig. 4. Example of a parity-check matrix 80 for an 401105910759116591064161402059 559 359 441 regular LDPC code with code rate 1614, block length 110 61 20, column weight 116 61 3, and row weight 106 61 4. Fig. 5. Transmitter structure of an LDPC-based STC-OFDM system with multiple antennas. The LDPC codes have the following advantages for the STC-OFDM system considered here. 1) the LDPC decoder usually has a lower computational complexity than the turbo-code decoder. In addition to this, since the decoding complexity of each iteration in an LDPC decoder is much less than a turbo-code decoder, a finer resolution in the per- formance-complexity tradeoff can be obtained by varying the maximum number of iterations. Moreover, the decoding of LDPC is highly parallelizable. 2) The minimum distance of binary LDPC codes increases linearly with the block length with probability close to 1 [11]. 3) It is easier to design a competitive LDPC code with any block-length and any code rate, which makes it easier for the LDPC-based STC to scale according to different system requirements (e.g., different number of antennas or different information rate). 4) LDPC codes do not typically show an error floor, which is suitable for short-frame applications. 5) Due to the random generation of parity-check matrix (or equivalently the encoder matrix), the coded bits have been effectively interleaved; therefore, no extra interleaver is needed. The transmitter structure of an LDPC-based STC-OFDM system is illustrated in Fig. 5. Denote the set of all possible STC symbols, which is up to a constant of the traditional constellation, e.g., MPSK or MQAM (recall that the additive noise is assumed to have unit variance). The ( ) information bits are first encoded by a rate 1 LDPC encoder into ( ) coded bits and then the binary LDPC coded bits are modulated into ( ) STC symbols by an MPSK (or MQAM) modulator. These ( ) STC symbols, which correspond to an STC code word, are split into streams; the ( ) STC symbols of each stream are transmitted from one particular transmitter antenna at subcarriers and over adjacent OFDM slots. Note that, in such a bit-interleaved coded-modulation system proposed above, the built-in random interleaver of the LDPC codes is also helpful to minimize the loss in the effective length between the binary LDPC code bits and the modulated STC code symbols, which is caused by the MPSK (or MQAM) modulation. As an example, consider a regular binary LDPC code with column weight 3, rate 1 2 and block-length 1024, the minimum distance is around 100 [11]. The STC based on this LDPC code is configured with a QPSK modulator and two transmitter antennas, therefore the effective length of this LDPC-based STC is at least 25, which is more than enough to satisfy the minimum effective length requirement for a two transmitter antenna ( 2) OFDM system in a six-tap ( 6) frequency-selective fading channel. Together with its built-in random interleaver, this LDPC code can well satisfy the two coding design principles mentioned earlier and therefore is an empirically good STC for the OFDM system considered in this paper. Since the minimum distance of binary LDPC codes in- crease linearly with the block length, further performance im- provement is possible by increasing the block length. Note that, we do not claim the optimality of the proposed LDPC-based STC; but rather, we argue that with its low decoding complexity, flexible scalability and high performance, the LDPC-based STC is a promising coding technique for reliable high-speed data communication in multiple-antenna OFDM systems with fre- quency- and time-selective fading. C. Data Burst Structure As in a typical data communication scenario, communication is carried out in a burst manner. A data burst is illustrated in Fig. 6. It spans ( 1) OFDM words, with the first OFDM word containing known pilot symbols. The remaining ( ) OFDM words contain STC code words. VI. TURBO RECEIVER In this section, we consider receiver design for the proposed LDPC-based STC-OFDM system. Even with ideal CSI, the op- LU et al.: LDPC-BASED SPACE–TIME CODED OFDM SYSTEMS OVER CORRELATED FADING CHANNELS 81 Fig. 6. OFDM time slots allocation in data burst transmission. A data burst consists of (8011343 1) OFDM words, with the first OFDM word containing known pilot symbols. The remaining (80113) OFDM words contain 113 STC code words. Fig. 7. The turbo receiver structure, which employs a MAP-EM demodulator and a soft LDPC decoder, for multiple-antenna LDPC-based STC-OFDM systems in unknown fading channels. timal decoding algorithm for this system has an exponential complexity. Hence the near-optimal turbo receiver based on the turbo principle [15] becomes attractive. As a standard proce- dure, such as in [16], in order to demodulate each STC code word, the turbo receiver consists of two stages, the soft demod- ulator and the soft LDPC decoder and the so-called “extrinsic” information is iteratively exchanged between these two stages to successively improve the receiver performance. However, in practice, the CSI must be estimated by the re- ceiver. In the rest of this section, we develop a novel turbo re- ceiver for unknown fast fading channels. A. Receiver Structure The proposed turbo receiver for the LDPC-based STC- OFDM system is illustrated in Fig. 7. It consists of a soft maximum a posteriori expectation-maximization (MAP-EM) demodulator and a soft LDPC decoder, both of which are iterative devices themselves. The soft MAP-EM demodulator takes as input the FFT of the received signals from receiver antennas and the extrinsic log likelihood ratios (LLRs) of the LDPC coded bits [cf. (26)] (which is fed back by the soft LDPC decoder). It computes as output the extrinsic a posteriori LLRs of the LDPC coded bits [cf. (26)]. (As an important issue in the EM algorithm, the initialization of the MAP-EM demodulator will be specifically discussed later in this section.) The soft LDPC decoder takes as input the LLRs of the LDPC coded bits from the MAP-EM demodulator and computes as output the extrinsic LLRs of the LDPC coded bits, as well as the hard decisions of the information bits at the last turbo iteration. It is assumed that the STC words in a data burst are independently encoded. Therefore, each STC word (consisting of OFDM words) is decoded independently by turbo processing. We next describe each component of the receiver in Fig. 7. B. MAP-EM Demodulator 2For notational simplicity, here we consider an LDPC-based STC- OFDM system with two transmitter antennas and one receiver antenna. The results can be easily extended to a system with transmitter antennas and receiver antennas. Note that, for the purpose of performance analysis, the de- fined in (4) only contains the time responses of nonzero taps; whereas for the purpose of receiver design, especially when the CSI is not available, the needs to be redefined to contain the time responses of all the taps within the maximum mul- tipath spread. That is, , with 1 and being the maximum multipath spread; and is correspondingly redefined as . The received signal during one data burst can be written as 82 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 50, NO. 1, JANUARY 2002 with (17) where and are -sized vectors which contain respec- tively the received signals and the ambient Gaussian noise at all subcarriers and at the th time slot; the diagonal elements of are the STC symbols transmitted from the th trans- mitter antenna and at the th time slot. Without CSI, the maximum a posteriori (MAP) detection problem is written as 1 2 (18) (Recall that 0 contains pilot symbols.) The optimal solution to (18) is of prohibitive complexity. We next propose to use the expectation-maximization (EM) algorithm [31] to solve (18). The basic idea of the MAP-EM algorithm is to solve (18) iteratively according to the following two steps (for notational convenience, we temporarily drop the time index , with the understanding that the MAP-EM algorithm discussed below is applied to each OFDM word in the data burst): E-step: Compute (19) M-step: Solve (20) where denotes hard decisions of the data symbols at the th EM iteration and represents the a priori probability of , which is fed back by the LDPC decoder from the previous turbo iteration. It is known that the likelihood function is nondecreasing and under regularity conditions the EM algo- rithm converges to a local stationary point [32]. In the E-step, the expectation is taken with respect to the “hidden” channel response conditioned on and .It is easily seen that, conditioned on and , is complex Gaussian distributed as with (21) where and denote respectively the covariance ma- trix of the ambient white Gaussian noise and channel responses . According to the assumptions in Section II, both of them are diagonal matrices as and , where is the average power of the th tap related with the th transmitter antenna; 0 if the channel response at this tap is zero. Assuming that is known (or measured with the aid of pilot symbols), is defined as the pseudo inverse of as 1 0 0 0 1 1 2 (22) Using (17) and (21), is computed as shown in (23), at the bottom of the next page, where denotes the ( )th element of the matrix . Next, based on (23), the M-step proceeds as follows: (24) or (25) where (24) follows from the assumption that contains inde- pendent symbols. It is seen from (25) that the M-step can be decoupled into independent minimization problems, each of which can be solved by enumeration over all possible (recall that denotes the set of all STC symbols). Hence, the total complexity of the maximization step is . Note that, unlike in [19], here the maximization in the M-step is car- ried out without taking the LDPC coding constraints into con- siderations, i.e., the symbols in are treated as uncoded sym- bols. The LDPC coding structure is exploited by the turbo iter- ation as well as the LDPC decoder. Within each turbo iteration, the above E-step and M-step are iterated times. At the end of the th EM iteration, the ex- trinsic a posteriori LLRs of the LDPC code bits are computed and then fed to the soft LDPC decoder. At each OFDM sub- carrier, two transmitter antennas transmit two STC symbols, which correspond to (2 ) LDPC code bits. Based on (25), after EM iterations, the extrinsic a posteriori LLR of the th ( 1 2 ) LDPC code bit at the th subcarrier is computed at the output of the MAP-EM demodulator as follows: LU et al.: LDPC-BASED SPACE–TIME CODED OFDM SYSTEMS OVER CORRELATED FADING CHANNELS 83 (26) where is the set of for which the th LDPC coded bit is “ ” and is similarly defined. The extrinsic a priori LLRs are provided by the soft LDPC decoder at the previous turbo iteration (where denotes the previous turbo it- eration; at the first turbo iteration, 0). Finally, the extrinsic a posteriori LLRs are sent to the soft LDPC decoder, which in turn iteratively computes the ex- trinsic LLRs and then feeds them back to the MAP-EM demodulator and thus completes one turbo iteration. At the end of the last turbo iteration, hard decisions of the infor- mation bits are output by the LDPC decoder. For details of the soft LDPC decoder, see [11]. C. Initialization of MAP-EM Demodulator The performance of the MAP-EM demodulator (and hence the overall receiver) is closely related to the quality of the initial value of [cf. (19)]. At each turbo iteration, needs to be specified to initialize the MAP-EM demodulator. Except for the first turbo iteration, is simply taken as given by (24) from the previous turbo iteration. We next discuss the procedure for computing at the first turbo iteration. The initial estimate of is based on the method pro- posed in [33] and [34], which makes use of pilot symbols and decision-feedback as well as spatial and temporal filtering for channel estimates. The procedure is listed in Table I. In Table I, - denotes either the least-square estimator (LSE) or the minimum mean-square-error estimator (MMSE) as LSE: - MMSE: - (27) where represents either the pilot symbols or provided by the MAP-EM demodulator. Comparing these two estimators, the LSE does not need any statistical information of , but the MMSE offers better performance in terms of mean-square-error (MSE). Hence, in the pilot slot, the LSE is used to estimate chan- nels and to measure , and in the rest of data slots the MMSE is used. In Table I, - denotes the temporal filter, which is used to further exploit the time-domain correlation of the channel - (28) where 1 is computed from ( ) [cf. Table I]; denotes the coefficients of an -length ( ) temporal filter, which can be obtained by solving the Wiener equation or from the robust design as in [33] and [34]. From the above discussions, it is seen that the compu- tation involved in initializing mainly consists of the ML detection of in ( ) and the estimation of in ( ). In general, for an STC-OFDM system with parameters ( ), the total complexity in initializing is . with (23) 84 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 50, NO. 1, JANUARY 2002 TABLE I PROCEDURE FOR COMPUTING 88 9111293 FOR THE MAP-EM DEMODULATOR (AT THE FIRST TURBO ITERATION) VII. SIMULATION RESULTS In this section, we provide computer simulation results to illustrate the performance of the proposed LDPC-based STC-OFDM system in frequency- and time-selective fading channels. The characteristics of the fading channels are described in Section II. (Specifically, the correlated fading processes are generated by using the methods in [35].) In the following simulations, the available bandwidth is 1 MHz and is divided into six subcarriers. These correspond to a subcarrier symbol rate of 3.9 KHz and OFDM word duration of 256 s. In each OFDM word, a guard interval of 40 s is added to combat the effect of inter-symbol interference, hence 296 s. For all simulations, two information bits are transmitted from six subcarriers at each OFDM slot, therefore the information rate is 2 1.73 bits/sec/Hz. Unless otherwise specified, all the LDPC codes used in simulations are regular LDPC codes with column weight 3 in the parity-check matrices and with appropriate block lengths and code rates. The modulator uses QPSK constellation. Simulation results are shown in terms of the OFDM word-error rate (WER) versus the SNR . A. Performance With Ideal CSI Figs. 8 and 9 show the performance of multiple-antenna ( transmitter antennas and one receiver antenna) LDPC-based STC-OFDM systems by using turbo detection and decoding with ideal CSI. Performance is compared for systems with different fading profiles and different numbers of transmitter antennas. Namely, denotes a channel with a single tap at 0 s, denotes a channel with two equal-power taps at 0 s and 5 s, denotes a channel with two equal-power taps at 0 s and 40 s, and denotes a channel with six equal-power taps equally spaced from 0 sto40 s. Suffix denotes a system with two transmitter antennas ( 2) and similarly denotes ; suffix denotes that each STC code word spans one OFDM slot ( 1) and similarly denotes and . Unless otherwise specified, all the STC-OFDM systems are assumed to use two transmitter antennas ( 2) and each STC code word spans one OFDM slot ( 1). First, Fig. 8 shows the performance of the LDPC-based STC-OFDM system in frequency-selective and time-nonselec- tive channels. The dash–dot curves represent the performance after the first turbo iteration, and the solid curves represent the performance after the fifth iteration. It is seen that the receiver performance is significantly improved through turbo iterations. During each turbo iteration, in the LDPC decoder, the maximum number of iterations is 30, and, as observed in simulations, the average number of iterations needed in LDPC decoding is less than 10 when WER is less than 10 . Com- pared with the conventional trellis-based STC-OFDM system (see [4, Figs. 2–7]), the LDPC-based STC-OFDM system significantly improves performance, (e.g., there is around 5 dB performance improvement in channels and even more improvement in channels). Compared with an enhanced 256-state trellis-based STC-OFDM system [36], the LDPC-based STC-OFDM system has lower decoding complexity but still has about 1–2-dB performance improve- ment in all these channels. Moreover, due to the inherent interleaving in LDPC encoder, the proposed LDPC-based STC narrows the performance difference between and channels (essentially the outage capacity of these two channels are same). As the selective-fading diversity order increases from to , LDPC-based STC can efficiently take advantage of the available diversity resources and hence can significantly improve the system performance. Moreover, in a highly frequency-selective channel , the LDPC-based STC performs only 3.0 dB away from the outage capacity of this channel (at a high information rate of 1.73 bit/s/Hz) at WER of 2 10 . Next, Fig. 9 shows the performance of the LDPC-based STC-OFDM system in frequency- and time-selective ( 1) fading channels. The maximum Doppler frequency is 200 Hz (i.e., the normalized Doppler frequency is 0.059). Again, it is seen that the performance of the system improves as the selective-fading diversity order (including both the frequency-selectivity and time-selectivity) increases. Finally, Fig. 8 also compares the performance of LDPC-based STC-OFDM systems with same multipath delay profiles ( ) but with a different number of transmitter antennas ( 2or 3). Since has larger outage capacity than , it is seen that at medium to high SNRs starts to perform better than with a steeper slope, which shows that the LDPC-based STC can be flexiblely scaled according to a dif- ferent number of transmitter antennas and can still improve the performance by exploiting the increased spatial diversity, espe- cially at low WER (which is attractive in data communication applications). B. Performance With Unknown CSI In the following simulations, the receiver performance with unknown CSI is shown. The system transmits in a burst manner as illustrated in Fig. 6. Each data burst includes 10 OFDM words LU et al.: LDPC-BASED SPACE–TIME CODED OFDM SYSTEMS OVER CORRELATED FADING CHANNELS 85 Fig. 8. WER of an LDPC-based STC-OFDM system with multiple antennas (78 61 1022593103597761 1) in frequency-selective and time-nonselective fading channels, with ideal CSI. Fig. 9. WER of an LDPC-based STC-OFDM system with multiple antennas (78 61 2597761 1) in frequency-selective and time-selective fading channels, with ideal CSI. ( 9 1); the first OFDM word contains the pilot sym- bols and the other nine OFDM words contain the information data symbols. Simulations are carried out in two-tap (two equal- power taps at 0 s and 1 s) frequency- and time-selective fading channels. The maximum Doppler frequency of fading channels is 50 Hz or 150 Hz (with normalized Doppler fre- quencies 0.015 and 0.044, respectively). Note that in Figs. 10 and11 the energy consumption of transmitting pilot symbols is not taken into account in computing SNRs. The turbo receiver performance of a regular LDPC-based STC-OFDM system is shown in Fig. 10, whereas that of an ir- regular LDPC-based STC-OFDM system is shown in Fig. 11 (The average column weight in the parity-check matrix of the ir- regular LDPC code is 2.30). denotes the turbo receiver as simulated in Section VII-A, except that the perfect CSI is re- placed by the pilot/decision-directed channel estimates as pro- posed in [18], and denotes the turbo receiver with the MAP-EM demodulator as proposed in Section VI. The temporal 86 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 50, NO. 1, JANUARY 2002 Fig. 10. WER of a regular LDPC-based STC-OFDM system with multiple antennas (78 61 2597761 1) in two-tap (7661 2) frequency-selective fading channels, without CSI. Fig. 11. WER of an irregular LDPC-based STC-OFDM system with multiple antennas (78 61 2597761 1) in two-tap (7661 2) frequency-selective fading channels, without CSI. filter parameters are taken from [33]. The performance of these two receiver structures are compared when using either the reg- ular LDPC codes or the irregular LDPC codes. From the simu- lations, it is seen that with ideal CSI the receiver performance is close between the regular LDPC-based STC-OFDM system and the irregular LDPC-based STC-OFDM system. When the CSI is not available, the proposed receiver significantly re- duces the error floor. Moreover, it is observed that, by using the irregular LDPC codes, both the receiver and the receiver improve their performance and the receiver can even approach the receiver performance with ideal CSI in low to medium SNRs. Although we believe that the reason for the better performance of irregular LDPC-based STC than regular LDPC-based STC in the presence of nonideal CSI is due to the better performance of the irregular LDPC codes at low SNRs, a full explanation for this behavior is beyond the scope of this paper. In simulations, the turbo receiver takes three turbo iterations; and at each turbo iteration, the MAP-EM de- modulator takes three EM iterations. At the cost of 10% pilot insertion and a modest complexity, the proposed turbo receiver with the MAP-EM demodulator is shown to be a promising re- ceiver technique, especially in fast fading applications. LU et al.: LDPC-BASED SPACE–TIME CODED OFDM SYSTEMS OVER CORRELATED FADING CHANNELS 87 VIII. CONCLUSION In this paper, we have considered the STC-OFDM system with multiple transmitter and receiver antennas over correlated frequency- and time-selective fading channels. By analyzing the channel capacity and the pairwise error probability, we have identified the different roles of the spatial diversity and the selective-fading diversity in improving the channel capacity and have shown that the selective-fading diversity order (defined as the product of time-selectivity order and frequency-selectivity order) is a key parameter to characterize the outage capacity of correlated fading channels. Moreover, it is observed that the STCs with large effective lengths and ideal built-in interleavers are more effective in exploiting the natural diversity in multiple-antenna correlated fading channels. We have then proposed a state-of-the-art LDPC-based STC-OFDM system. Compared with the conventional space-time trellis code (STTC), LDPC-based STC can significantly improve the system performance by efficiently exploiting both the spatial diversity and selective-fading diversity in wireless channels. Compared with the recently proposed turbo-code-based STC scheme, LDPC-based STC exhibits lower receiver complexity and more flexible scalability. From computer simulations, it is seen that the proposed LDPC-based STC-OFDM system can efficiently exploit the spatial diversity and the selective-fading diversity available in practical wireless channels. In particular, in a six-tap frequency-selective fading channel, its performance is 3.0 dB away from the outage channel capacity of this channel at a high information rate of 1.73 bit/s/Hz and at a practical block length ( 1024). As a further step to bring the proposed LDPC-based STC-OFDM system into practice, we have con- sidered the receiver design when the channel state information (CSI) is not available and developed a novel turbo receiver which employs a MAP-EM demodulator and a soft LDPC decoder. Simulations show that the proposed turbo receiver can significantly reduce the error floor in fast fading channels. In particular, with the irregular LDPC, the turbo receiver performs close to the receiver performance with ideal CSI in medium fading channels (with normalized Doppler frequency 0.015) and is less than 2 dB away from the receiver performance with ideal CSI in fast fading channels (with normalized Doppler frequency 0.044), at the cost of 10% insertion of pilot symbols and a modest computational complexity. In conclusion, with such a powerful turbo receiver, the proposed LDPC-based STC-OFDM is a promising technique for highly efficient data transmission over selective-fading mobile wireless channels. ACKNOWLEDGMENT The authors would like to thank Y. Li for his help on the OFDM system simulation and J. Li for her work on the LDPC code construction. REFERENCES [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. Inform. Theory, vol. 44, pp. 744–765, Mar. 1998. [2] V. Tarokh, H. Jafarkhani, and A. R. Calderbank, “Space-time block coding for wireless communications: performance results,” IEEE J. Select. Areas Commun., vol. 17, pp. 451–460, Mar. 1999. [3] V. Tarokh, A. Naguib, N. Seshadri, and A. R. Calderbank, “Combined array processing and space-time coding,” IEEE Trans. Inform. Theory, vol. 45, pp. 1121–1128, May 1999. [4] D. Agrawal, V. Tarokh, A. Naguib, and N. Seshadri, “Space-time coded OFDM for high data-rate wireless communication over wideband chan- nels,” in IEEE Vehicular Technology Conf. 1998 VTC’98, May 1998. [5] L. H. Ozarow, S. Shamai, and A. D. Wyner, “Information theoretic con- siderations for cellular mobile radio,” IEEE Trans. Veh. Technol., vol. 43, pp. 359–378, May 1994. [6] I. E. Telatar, “Capacity of multi-antenna Gaussian channels,” Eur. Trans. Telecommun., vol. 10, pp. 585–595, Nov./Dec. 1999. [7] G. J. Foschini and M. J. Gans, “On limits of wireless communications in a fading environment when using multiple antennas,” Wireless Personal Commun., vol. 6, pp. 311–335, Mar. 1998. [8] E. Biglieri, G. Caire, and G. Taricco, “Limiting performance of block- fading channels with multiple antennas,” IEEE Trans. Inform. Theory, vol. 47, p. 12731289, May 2001. [9] D. Divsalar and M. K. Simon, “The design of trellis coded MPSK for fading channels: Performance criteria,” IEEE Trans. Commun., vol. 36, pp. 1004–1012, Sept. 1988. [10] C. Schlegel and D. J. Costello, “Bandwidth efficient coding for fading channels: Code construction and performance analysis,” IEEE J. Select. Areas Commun., vol. 7, pp. 1356–1368, Dec. 1989. [11] R. G. Gallager, “Low density parity check codes,” IRE Trans. Inform. Theory, vol. 8, pp. 21–28, 1962. [12] D. J. C. MacKay and R. M. Neal, “Near shannon limit performance of low density parity check codes,” Electron. Lett., vol. 33, pp. 457–458, Mar. 1997. [13] T. J. Richardson, M. A. Shokrollahi, and R. L. Urbanke, “Design of capacity-approaching irregular low-density parity-check codes,” IEEE Trans. Inform. Theory, vol. 47, pp. 619–637, Feb. 2001. [14] H. Bolcskei and A. J. Paulraj, “Space-frequency coded broadband OFDM systems,” in Wireless Communications and Networking Conf., 2000 WCNC, 2000, pp. 1–6. [15] J. Hagenauer, “The turbo principle: Tutorial introduction and state of the art,” in Proc. Int. Symp. on Turbo Codes and Related Topics, Brest, France, Sept. 1997. [16] G. Bauch, “Concatenation of space-time block codes and ’Turbo’-TCM,” in Proc. 1999 Int. Conf. on Communications. ICC’99, Vancouver, BC, Canada, June 1999. [17] B. Lu and X. Wang, “Iterative receivers for multiuser space-time coding systems,” IEEE J. Select. Areas Commun., vol. 18, pp. 2322–2335, Nov. 2000. [18] Y. Li, N. Seshadri, and S. Ariyavisitakul, “Channel estimation for OFDM systems with transmitter diversity in mobile wireless channels,” IEEE J. Select. Areas Commun., vol. 17, pp. 461–471, Mar. 1999. [19] C. Cozzo and B. L. Hughes, “Joint detection and estimation in space-time coding and modulation,” in Thirty-Third Asilomar Conf. on Signals, Systems & Computers, Sydney, Australia, Oct. 1999, pp. 613–617. [20] Y. Li, C. N. Georghiades, and G. Huang, “EM-based sequence estima- tion for space-time coded systems,” in IEEE Int. Symp. on Information Theory, Sorrento, Italy, June 2000. [21] C. Lamy, F. Boixadera, and J. Boutros, “Iterative APP decoding and channel estimation for multiple-input multiple-output channels,” IEEE Trans. Commun., submitted for publication. [22] J. Proakis, Digital Communications, 3rd ed. New York: McGraw-Hill, 1995. [23] S. G. Wilson, Digital Modulation and Coding. New York: Prentice- Hall, 1996. [24] J.-J. van de Beek, O. Edfors, M. Sandell, S. K. Wilson, and P. O. Bor- jesson, “On channel estimation in OFDM systems,” in IEEE Vehicular Technology Conf. 1995 VTC’95, Chicago, IL, July 1995. [25] E. Biglieri, J. Proakis, and S. Shamai, “Fading channels: Information- theoretic and communication aspects,” IEEE Trans. Inform. Theory, vol. 44, pp. 2619–2692, Oct. 1998. [26] A. Narula, M. D. Trott, and G. W. Wornell, “Performance limits of coded diversity methods for transmitter antenna arrays,” IEEE Trans. Inform. Theory, vol. 45, pp. 2418–2433, Nov. 1999. [27] A. Stefanov and T. M. Duman, “Turbo coded modulation for wireless communications with antenna diversity,” in IEEE Vehicular Technology Conf., 1999 VTC’99, Sept. 1999. [28] Y. Liu and M. P. Fitz, “Space-time turbo codes,” in Proc. 37th Annual Allerton Conf., Monticello, IL, Sept. 1999. 88 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 50, NO. 1, JANUARY 2002 [29] D. J. C. MacKay, “Gallager Codes—Recent Results,”, http://wol.ra.phy.cam.ac.uk/mackay. [30] S.-Y. Chung, G. D. Forney, T. J. Richardson, and R. Urbanke, “On the de- sign of low-density parity-check codes within 0.0045 dB of the shannon limit,” IEEE Commun. Lett., vol. 52, pp. 58–60, Feb. 2001. [31] C. N. Georghiades and J. C. Han, “Sequence estimation in the presence of random parameters via the EM algorithm,” IEEE Trans. Commun., vol. 45, pp. 300–308, Mar. 1997. [32] G. J. McLachlan and T. Krishnan, The EM Algorithm and Exten- sions. New York, NY: Wiley, 1997. [33] Y. Li, L. J. Cimini, and N. R. Sollenberger, “Robust channel estimation for OFDM systems with rapid dispersive fading channels,” IEEE Trans. Commun., vol. 46, pp. 902–915, July 1998. [34] Y. Li and N. R. Sollenberger, “Adaptive antenna arrays for OFDM sys- tems with cochannel interference,” IEEE Trans. Commun., vol. 47, pp. 217–229, Feb. 1999. [35] P. Hoeher, “A statistical discrete-time model for the WSSUS multipath channel,” IEEE Trans. Veh. Technol., vol. 41, pp. 461–468, Nov. 1992. [36] B. Lu and X. Wang, “Space-time code design in OFDM systems,” in IEEE Globecom Conf., 2000, Nov. 2000. Ben Lu received the B.E. and M.S. degree in elec- trical engineering from Southeast University, Nan- jing, China, in 1994 and 1997, respectively. From 1994 to 1997, he was a Research Assistant with National Mobile Communication Laboratory at Southeast University, Nanjing, China. From 1997 to 1998, he was a member of CDMA Research Department at Zhongxing Telecommunication Company, Shanghai, China. Since 1999, he has been a Research Assistant with the Department of Elec- trical Engineering, Texas A&M University, College Station. His general research interests include advanced signal processing and channel coding for wireless communication systems. Xiaodong Wang (S’98–M’98) received the B.S. degree in electrical engineering and applied math- ematics (with the highest honor) from Shangai Jiao Tong University, Shangai, China, in 1992, the M.S. degree in electrical and computer enigneering from Purdue University, West Lafayette, IN, in 1995, and the Ph.D. degree in electrical engineering from Princeton University, Princeton, NJ, in 1998. From July1998 to December 2001, he was with the Department of Electrical Engineering, Texas A&M University, College Station, as an Assistant Professor. His research interests fall in the genral areas of computing, signal processing, and communications. He has worked in the areas of digital communications, digital signal processing, parallel and distributed computing, nanoelectronics, and quantum computing. His current research interests include multiuser com- munications. He has worked in the areas of digital communications. He worked at AT&T Labs–Research, Red Bank, NJ, during the summer of 1997. In January 2002, he joined the Department of Electrical Engineering, Columbia University, New York, NY, as an Assistant Professor. Dr. Wang is a member of the American Associtaion for the Advanement of Science. He is the recipient of the 1999 NSF CAREER Award. He is also the recipient of the 2001 IEEE Information Theory Society and Communications Society Joint Paper Award. He currently serves as an Associate Editor for the IEEE TRANSACTIONS ON COMMUNICATIONS and for the IEEE TRANSACTIONS ON SIGNAL PROCESSING. Krishna R. Narayanan received the Ph.D. degree in electrical engineering from the Georgia Institute of Technology, Atlanta, in 1998. Since then, he has been an Assistant Professor in the Electrical Engineering Department at Texas A&M University, College Station. His research interests are in coding modulation and receiver design for wireless communications and digital magnetic recording. Prof. Narayanan is the recipient of the NSF CA- REER Award in 2001. He currently serves on the ed- itorial board of the IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS.