<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article  PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article"><front><journal-meta><journal-id journal-id-type="publisher-id">IJCNS</journal-id><journal-title-group><journal-title>International Journal of Communications, Network and System Sciences</journal-title></journal-title-group><issn pub-type="epub">1913-3715</issn><publisher><publisher-name>Scientific Research Publishing</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.4236/ijcns.2012.54028</article-id><article-id pub-id-type="publisher-id">IJCNS-18521</article-id><article-categories><subj-group subj-group-type="heading"><subject>Articles</subject></subj-group><subj-group subj-group-type="Discipline-v2"><subject>Computer Science&amp;Communications</subject></subj-group></article-categories><title-group><article-title>
 
 
  An Efficient Space-Time Coding Scheme for Time Dispersive MIMO Channels
 
</article-title></title-group><contrib-group><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>alim</surname><given-names>Abdelkareem Alkhawaldeh</given-names></name><xref ref-type="aff" rid="aff1"><sub>1</sub></xref><xref ref-type="corresp" rid="cor1"><sup>*</sup></xref></contrib></contrib-group><aff id="aff1"><label>1</label><addr-line>Electrical Engineering Department, Faculty of Engineering Technology, Albalqa Applied University, Amman, Jordan</addr-line></aff><author-notes><corresp id="cor1">* E-mail:<email>skhawaldeh@yahoo.com</email></corresp></author-notes><pub-date pub-type="epub"><day>18</day><month>04</month><year>2012</year></pub-date><volume>05</volume><issue>04</issue><fpage>218</fpage><lpage>221</lpage><history><date date-type="received"><day>January</day>	<month>24,</month>	<year>2012</year></date><date date-type="rev-recd"><day>February</day>	<month>14,</month>	<year>2012</year>	</date><date date-type="accepted"><day>March</day>	<month>12,</month>	<year>2012</year></date></history><permissions><copyright-statement>&#169; Copyright  2014 by authors and Scientific Research Publishing Inc. </copyright-statement><copyright-year>2014</copyright-year><license><license-p>This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/</license-p></license></permissions><abstract><p>
 
 
  In this paper, we introduce an efficient space-time coding scheme for time dispersive Multiple-Input Multiple-Output (MIMO) channels. Channel layering and Orthogonal Frequency Division Multiplexing (OFDM) technique are used in the proposed scheme. The proposed scheme is based on maximizing the distance between any two codewords. This is done by inserting an optimized phase shifts between the symbols in the same layer and between different layers. This way leads to the increase of the achieved diversity and coding gains. As a result, the performance of the system will be improved. Simulation results show the efficiency of the proposed scheme compared to the conventional schemes.
 
</p></abstract><kwd-group><kwd>OFDM; Fading; Space-Time Coding; Diversity; MIMO</kwd></kwd-group></article-meta></front><body><sec id="s1"><title>1. Introduction</title><p>MIMO systems have taken a great deal of research interest. This technology leads to a significant improvement in the performance and bandwidth efficiency of the wireless system. The increase of the performance is due to that MIMO system provides space diversity which plays important role to combat the time-varying multipath fading caused by wireless channels. The improvement in the bandwidth efficiency is due to that the channel capacity of the MIMO system is equal to that of the Single-Input Single-Output (SISO) system times the number of transmit or receive antennas, which is smallest [1,2].</p><p>A number of space-time trellis codes have been proposed for narrow and wide band channels [3,4]. These codes suffer from decoding complexity especially when the number of antennas increases. To decrease the decoding complexity, space-time block codes have been presented for narrow and wide band channels [5-8]. A disadvantage of these codes is the degradation of the performance compared to space-time trellis codes. In recent years, there is a big demand on the multi-rate wireless services. Therefore, a number of multi-rate spacetime coding schemes have been proposed [9-13]. A prominent drawback of these codes is that distance between some codewords is very small which yields to a significant degradation in the performance.</p><p>To overcome this problem, in this paper, we propose a two-layer space-time coding scheme for time dispersive MIMO system. The idea behind the proposed scheme is that the minimum distance between any two codewords is maximized which leads to the improvement in the diversity and coding gains. As a result, the performance of our scheme increases compared to the conventional schemes. Simulation results are provided to show the significant improvement in the performance achieved by this scheme.</p><p>In Section 2, we describe the system model of OFDM space-time coding system with two transmit and two receive antennas. The proposed coding scheme is presented in Section 3. We introduce and discuss simulation results in Section 4 to show the validity and efficiency of the proposed scheme. Finally, conclusions are presented in Section 5.</p></sec><sec id="s2"><title>2. System Model</title><p>Consider a wireless communication system equipped with two transmit and two receive antennas under the assumption of quasi-static fading channels. At a given time k, signal u<sub>i</sub>(k) is transmitted from antenna i, whereas signal y<sub>j</sub>(k) is received at antenna j. Let h<sub>ji</sub>(l) be the gain of the l<sup>th</sup> resolvable path from transmit antenna i to receive antenna j. Under the assumption of quasi-static fading, h<sub>ji</sub>(l) will be constant over the duration of a frame but different from frame to frame. Furthermore, the path gains are assumed to be&#160; samples of zero-mean complex Gaussian random variables that are mutually independent, i.e.,<img src="4-9701527\aaabee3d-ca4b-4dab-90d8-fbea81d699ef.jpg" />.</p><p>If there are L resolvable paths for each channel, the received signal y due to K transmitted signals from each transmit antenna can be written as</p><disp-formula id="scirp.18521-formula103385"><label>(1)</label><graphic position="anchor" xlink:href="4-9701527\0b393393-d24d-4c53-9f8d-d8973e0a6bcb.jpg"  xlink:type="simple"/></disp-formula><p>where n is the complex white Gaussian noise with zero mean and variance N<sub>o</sub>I and the channel matrix H with dimensions <img src="4-9701527\b899e88a-346c-40bc-a4fd-42aca6248e88.jpg" /> is given by</p><disp-formula id="scirp.18521-formula103386"><label>(2)</label><graphic position="anchor" xlink:href="4-9701527\7424cff7-8fe9-405f-ad56-0eea6fb573f0.jpg"  xlink:type="simple"/></disp-formula><p>with</p><disp-formula id="scirp.18521-formula103387"><label>(3)</label><graphic position="anchor" xlink:href="4-9701527\2e45ef92-60e5-48db-896d-b9033b50126e.jpg"  xlink:type="simple"/></disp-formula><p>Since the space-time codes introduced in [<xref ref-type="bibr" rid="scirp.18521-ref9">9</xref>] were designed for flat fading channels, they cannot be directly employed for frequency-selective channels (L &gt; 1). One way to extend the space-time codes to frequency-selective channels is through the use of OFDM. OFDM technique mathematically changes the slow frequency selective fading channel to multi flat fading channels. <xref ref-type="fig" rid="fig1">Figure 1</xref> shows a baseband representation of the conventional</p><p>two-layer Linear Dispersion Codes (LDC) [<xref ref-type="bibr" rid="scirp.18521-ref9">9</xref>] combined with OFDM system. In this system, by adding a cyclic prefix (CP) to each frame of the signal at the transmitter and removing it at the receiver, the channel matrix becomes block circulant. Then OFDM technique is employed to transform the frequency-selective fading channel into a set of parallel flat sub-channels so that the space-time codes in [<xref ref-type="bibr" rid="scirp.18521-ref9">9</xref>] can be used.</p><p>However, Hassibi scheme [<xref ref-type="bibr" rid="scirp.18521-ref9">9</xref>] does not fully exploit the frequency diversity introduced by the existence of multiple resolvable paths. Also, it does not achieve maximized coding gain. Although, the space time coding scheme proposed by Xiaoli Ma [<xref ref-type="bibr" rid="scirp.18521-ref10">10</xref>] achieves full diversity order but the minimum distance between any two codewords is not maximized which leads to significant degradation in the coding gain. Therefore, in the next section we present a new space-time coding scheme combined with OFDM for wide band wireless systems that maximizes both the diversity order and coding gain.</p></sec><sec id="s3"><title>3. Proposed Space-Time Coding Scheme for Time Dispersive MIMO Channels</title><p>In this section, we propose an efficient space-time coding scheme with two layers for time dispersive MIMO channels. The encoding of our scheme is applied block by block. Each block has TN symbol. The input block to the two-layer space-time encoder is v =<img src="4-9701527\93239c3c-7c8c-48b6-97ea-292fe9dfc4b3.jpg" />. This block is divided into 2 layers and each layer contains <img src="4-9701527\fd0a86b0-7d1a-474a-a80f-c9e66026f104.jpg" />where<img src="4-9701527\cbd4932f-dd34-4071-bb0b-581a82437823.jpg" />. The space-time encoder constructs the codeword matrix U by inserting phase shifts between the symbols in the same layers and between the two layers as follows:</p><disp-formula id="scirp.18521-formula103388"><label>(4)</label><graphic position="anchor" xlink:href="4-9701527\a68ef1ad-7480-4c7b-a853-8d37a7848533.jpg"  xlink:type="simple"/></disp-formula><p>In (4), the column vectors <img src="4-9701527\4862b9c9-a657-41eb-8f22-d2ec292e3e44.jpg" /> are given by</p><disp-formula id="scirp.18521-formula103389"><label>(5)</label><graphic position="anchor" xlink:href="4-9701527\5f1c569b-c9f7-4933-83d7-4411a502a3da.jpg"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.18521-formula103390"><label>(6)</label><graphic position="anchor" xlink:href="4-9701527\dd135324-af52-429e-baa0-523c9aaa23b6.jpg"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.18521-formula103391"><label>(7)</label><graphic position="anchor" xlink:href="4-9701527\2e8ae0ee-4add-4470-912a-0ead1eaa78dc.jpg"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.18521-formula103392"><label>(8)</label><graphic position="anchor" xlink:href="4-9701527\939187f8-94b6-4098-bd64-05f87bb8c723.jpg"  xlink:type="simple"/></disp-formula><p>where the frames <img src="4-9701527\83002115-c72f-4c5c-9e68-d32f516e27d5.jpg" /> are column vectors each has K symbols from vector v and <img src="4-9701527\b53d1fb6-94fd-46b3-bc4b-55468abfafe7.jpg" />.</p><p>To maximize coding gain with full diversity order we have to maximize the minimum Euclidean distance between any two codewords<img src="4-9701527\151e14b1-5d2e-4316-ae34-24c978afd453.jpg" />. This can be done as follows. The root of the determinant of matrix <img src="4-9701527\6f5f7ed0-ee12-4bdb-9b33-93c140555710.jpg" /> is the product of 2 distances <img src="4-9701527\e51480ce-0d78-4a04-a8aa-e8597cb7e80a.jpg" /> and <img src="4-9701527\df9ef165-760e-40fa-9f73-8daa3ec05475.jpg" /> and it is given by</p><disp-formula id="scirp.18521-formula103393"><label>(9)</label><graphic position="anchor" xlink:href="4-9701527\098b9e09-4923-46bc-be50-f1286f794640.jpg"  xlink:type="simple"/></disp-formula><p>Note that, for the codeword pairs that differ at only one diagonal in the codeword matrices, the pairwise coding gain is<img src="4-9701527\29cd6a2a-222b-4f59-b4a3-23dd7475b00f.jpg" />. Then the two angles <img src="4-9701527\e55a9d41-b931-48c5-bc7b-cf016bbfc12d.jpg" /> and <img src="4-9701527\3d596f4d-5a30-49eb-901c-9864b7a67217.jpg" /> are chosen to maximize the minimum distance between any two codeword matrices which leads to maximize the coding gain <img src="4-9701527\29202873-362e-4646-b53d-2e2198092bd3.jpg" /> with full diversity order.</p><disp-formula id="scirp.18521-formula103394"><label>(10)</label><graphic position="anchor" xlink:href="4-9701527\6a1b832a-528b-4b8d-bb67-4120f7bc015f.jpg"  xlink:type="simple"/></disp-formula><p>After applying the K-point Inverse Discrete Fourier Transform (IDFT) to each frame, the resultant codeword matrix S can be written as</p><disp-formula id="scirp.18521-formula103395"><label>(11)</label><graphic position="anchor" xlink:href="4-9701527\5b399308-5fee-4a2f-8fa1-899de4852ab3.jpg"  xlink:type="simple"/></disp-formula><p>where F is the K-point DFT matrix and −1 denotes matrix inverse. As can be noted the codeword matrix S contains N OFDM frames on each antenna branch. A cyclic prefix of length (L − 1) is added to each OFDM frame.</p><p>At the receiver, after removing the first L − 1 samples for each OFDM frame that corresponds to the cyclic prefix, K-point FFT is applied to each OFDM frame. This results in received signal matrix as</p><disp-formula id="scirp.18521-formula103396"><label>(12)</label><graphic position="anchor" xlink:href="4-9701527\d52d2906-5652-464b-a808-5ce28d5a183c.jpg"  xlink:type="simple"/></disp-formula><p>with</p><disp-formula id="scirp.18521-formula103397"><label>(13)</label><graphic position="anchor" xlink:href="4-9701527\f69a1e73-70e5-49ca-a765-cabd941f53e9.jpg"  xlink:type="simple"/></disp-formula><p>and <img src="4-9701527\337dd205-4b43-4453-8cbe-309219b81bdc.jpg" /> is <img src="4-9701527\53515c68-3849-4f93-a7f7-4fc7602ed3a3.jpg" /> circulant matrix given as</p><disp-formula id="scirp.18521-formula103398"><label>(14)</label><graphic position="anchor" xlink:href="4-9701527\888ab059-87f9-4b97-b2f2-b168ee785d52.jpg"  xlink:type="simple"/></disp-formula><p>The received matrix Y can be written as</p><disp-formula id="scirp.18521-formula103399"><label>(15)</label><graphic position="anchor" xlink:href="4-9701527\4181adf2-7d4f-468b-a7d4-23104fcfd3e3.jpg"  xlink:type="simple"/></disp-formula><p>where <img src="4-9701527\8b767e57-893d-40d0-baea-d1c2023d1468.jpg" /> is the additive complex Gaussian noise matrix with i.i.d entries, i.e., <img src="4-9701527\f6cfceff-b302-4334-9e9a-ded7d1b6de86.jpg" />and <img src="4-9701527\632f0ee4-aa66-4c91-8fc1-134266ef1677.jpg" /> is a diagonal matrix whose diagonal elements are the DFT coefficients of the vector <img src="4-9701527\4aa038fd-5e41-4f58-8f78-24407939377f.jpg" />. The above received matrix are sent to the optimum detector where the maximum likelihood decision rule is applied.</p></sec><sec id="s4"><title>4. Simulation Results</title><p>In this section, we provide simulation results to compare the proposed scheme with the conventional schemes done by Hassibi [<xref ref-type="bibr" rid="scirp.18521-ref9">9</xref>] and Ma [<xref ref-type="bibr" rid="scirp.18521-ref10">10</xref>] in terms of performance. The channel model described in Section 2 with three equal-gain resolvable paths (L = 3) was used. Two transmit and two receive antennas were assumed. In all the schemes, two layers are employed with BPSK modulation and each OFDM frame has 32 symbols. For BPSK modulation, the optimized angles α and β that maximizes the coding gain with full diversity were found to be<img src="4-9701527\b30a0892-7a96-4a7b-9bb5-c2efec766e73.jpg" />. It was mentioned before that Ma’s scheme has full diversity and not maximized coding gain whereas Hassibi’s scheme has not full diversity nor maximized coding gains. The decoding complexity of all schemes are comparable.</p><p><xref ref-type="fig" rid="fig2">Figure 2</xref> shows the Bit Error Rate (BER) as a function of Signal-to-Noise Ratio (SNR). It is seen that, at BER =<img src="4-9701527\60abdbb3-9e23-425f-bf4a-48cdbc5ddb90.jpg" />, a performance gain of approximately 5.7 dB is achieved for the proposed scheme over Hassibi’s scheme and 3.9 dB over Ma’s scheme. This result can be explained because Ma’s scheme maximizes the diversity gain and preserves channel capacity but does not necessarily guarantee high coding gain which affects the performance of the system as discussed before. Although Hassibi scheme preserves channel capacity, it does not guarantee good performance since the diversity and cod-</p><p>ing gains were not explicitly optimized. As mentioned before, our proposed scheme preserves the channel capacity and maximizes both the diversity and coding gains.</p></sec><sec id="s5"><title>5. Conclusion</title><p>In this paper, we have introduced a new OFDM spacetime coding scheme for quasi-static time dispersive MIMO channels. Due to the insertion of optimized phase shifts between the symbols in the same layers and between the two layers, the diversity and coding gains are maximized without loss of the capacity. This leads to improvement in the performance of the proposed scheme compared to the other conventional schemes. Simulation results have demonstrated to show the validity and effectiveness of the proposed scheme compared to others.</p></sec><sec id="s6"><title>REFERENCES</title></sec></body><back><ref-list><title>References</title><ref id="scirp.18521-ref1"><label>1</label><mixed-citation publication-type="other" xlink:type="simple">I. E. Telatar, “Capacity of Multi-Antenna Gaussian Channels,” European Transaction on Telecommunications, Vol. 10, No. 6, 1999, pp. 585-595.  
doi:10.1002/ett.4460100604</mixed-citation></ref><ref id="scirp.18521-ref2"><label>2</label><mixed-citation publication-type="other" xlink:type="simple">G. J. Foshini and M. J. Gans, “On the Limits of Wireless Communications in a Fading Environment When Using Multiple Antennas,” Wireless Personal Communications, Vol. 6, No. 3, 1998, pp. 311-335.  
doi:10.1023/A:1008889222784</mixed-citation></ref><ref id="scirp.18521-ref3"><label>3</label><mixed-citation publication-type="other" xlink:type="simple">V. Tarokh, N. Seshadri and R. Calderbank, “Space-Time Codes for High Data Rate Wireless Communication: Performance Criterion and Code Construction,” IEEE Transaction on Information Theory, Vol. 44, No. 2, 1998, pp. 744-765. doi:10.1109/18.661517</mixed-citation></ref><ref id="scirp.18521-ref4"><label>4</label><mixed-citation publication-type="other" xlink:type="simple">D. Agrawal, V. Tarokh, A. Naguib and N. Sheshadri, “Space-Time Coded OFDM for High Data-Rate Wireless Communication over Wideband Channels,” IEEE Vehicular Technology Conference, Vol. 3, Ottawa, 18-21 May 1998, pp. 2232-2236.</mixed-citation></ref><ref id="scirp.18521-ref5"><label>5</label><mixed-citation publication-type="other" xlink:type="simple">S. M. Alamouti, “A Simple Transmit Diversity Technique for Wireless Communications,” IEEE Journal on Selected Areas in Communications, Vol. 16, No. 8, 1998, pp. 1451-1458. doi:10.1109/49.730453</mixed-citation></ref><ref id="scirp.18521-ref6"><label>6</label><mixed-citation publication-type="other" xlink:type="simple">V. Tarokh, H. Jafarkhani and A. R. Calderbank, “SpaceTime Block Codes from Orthogonal Designs,” IEEE Transactions on Information Theory, Vol. 45, No. 5, 1999, pp. 1456-1467. doi:10.1109/18.771146</mixed-citation></ref><ref id="scirp.18521-ref7"><label>7</label><mixed-citation publication-type="other" xlink:type="simple">S. Mudulodu and A. Paulraj, “A Transmit Diversity Scheme for Frequency-Selective Fading Channels,” IEEE Global Telecommunications Conference, Vol. 2, San Francisco, 27 November-1 December 2000, pp. 1089-1093.</mixed-citation></ref><ref id="scirp.18521-ref8"><label>8</label><mixed-citation publication-type="other" xlink:type="simple">S. Alkhawaldeh and Y. R. Shayan, “An Extended SpaceTime Transmit Diversity Scheme for Frequency Selective Fading Channels,” IEEE CCECE Conference, Montreal, 12-15 May 2003, pp. 1663-1666.</mixed-citation></ref><ref id="scirp.18521-ref9"><label>9</label><mixed-citation publication-type="other" xlink:type="simple">B. Hassibi and B. M. Hochwald, “High-Rate Codes that Are Linear in Space and Time,” IEEE Transactions on Information Theory, Vol. 48, No. 7, 2002, pp. 1804-1824.  
doi:10.1109/TIT.2002.1013127</mixed-citation></ref><ref id="scirp.18521-ref10"><label>10</label><mixed-citation publication-type="other" xlink:type="simple">X. Ma and G. B. Giannakis, “Full-Diversity Full-Rate Complex-Field Space-Time Coding,” IEEE Transactions on Signal Processing, Vol. 51, No. 11, 2003, pp. 29172930.</mixed-citation></ref><ref id="scirp.18521-ref11"><label>11</label><mixed-citation publication-type="other" xlink:type="simple">R. W. Heath Jr. and A. J. Paulraj, “Linear Dispersion Codes for MIMO Systems Based on Frame Theory,” IEEE Transactions on Signal Processing, Vol. 50, No. 10, 2002, pp. 2429-2441. doi:10.1109/TSP.2002.803325</mixed-citation></ref><ref id="scirp.18521-ref12"><label>12</label><mixed-citation publication-type="other" xlink:type="simple">M. O. Damen, N. C. Beaulieu and J.-C. Belfiore, “A Number Theory Based Dual Transmit Antennas Space-Time Code,” IEEE GLOBECOM Conference, San Antonio, 2529 November 2001, pp. 485-489.</mixed-citation></ref><ref id="scirp.18521-ref13"><label>13</label><mixed-citation publication-type="other" xlink:type="simple">M. O. Damen, A. Tewfik and J.-C. Belfiore, “A Construction of a Space-Time Code Based on Number Theory,” IEEE Transactions on Information Theory, Vol. 48, No. 3, 2002, pp. 753-760. doi:10.1109/18.986032</mixed-citation></ref></ref-list></back></article>