<?xml version="1.0" encoding="UTF-8"?>
<!-- generator="wordpress/2.0.3" -->
<rss version="2.0" 
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	>

<channel>
	<title>The WindoWSIL</title>
	<link>http://windowsil.org</link>
	<description>Your window into the Wireless Systems Innovation Laboratory</description>
	<pubDate>Mon, 22 Feb 2010 20:48:28 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.0.3</generator>
	<language>en</language>
			<item>
		<title>Machine Learning: The Solution to Link Adaptation Woes</title>
		<link>http://windowsil.org/2010/02/22/machine-learning-the-solution-to-link-adaptation-woes/</link>
		<comments>http://windowsil.org/2010/02/22/machine-learning-the-solution-to-link-adaptation-woes/#comments</comments>
		<pubDate>Mon, 22 Feb 2010 20:48:28 +0000</pubDate>
		<dc:creator>Bob Daniels</dc:creator>
		
	<category>WSIL News &amp; Views</category>
	<category>Wireless Research</category>
		<guid isPermaLink="false">http://windowsil.org/2010/02/22/machine-learning-the-solution-to-link-adaptation-woes/</guid>
		<description><![CDATA[In this post I want to discuss the deficiencies of practical link adaptation in current wireless systems and how algorithms that exploit machine learning will be the solution to all of these problems.  First, a little background on link adaptation.  
The quality of the medium through which communication occurs, i.e., the wireless channel, [...]]]></description>
			<content:encoded><![CDATA[<p>In this post I want to discuss the deficiencies of practical link adaptation in current wireless systems and how algorithms that exploit machine learning will be the solution to all of these problems.  First, a little background on <a href="http://en.wikipedia.org/wiki/Link_adaptation">link adaptation</a>.  </p>
<p>The quality of the medium through which communication occurs, i.e., the wireless channel, is constantly changing.  Consider the following figure, courtesy of the Laboratory for Information Technology at Aachen University, which shows the channel quality of a cellular network throughout a rural town in Germany (green=good, red=bad).  <a href="http://www.ti.rwth-aachen.de/research/networkplanning/data/FuchserdeCl.jpg"><img align="right" src="http://windowsil.org/wp-content/uploads/2010/02/city_path_loss.thumbnail.jpg" alt="City Path Loss" /></a>  Reality is actually much worse than this since the channel also fluctuates due to <a href="http://cnx.org/content/m15530/latest/">small scale fading</a>.  </p>
<p>Digital communication parameters used to construct wireless waveforms (e.g., <a href="http://en.wikipedia.org/wiki/QAM">QAM</a> order, <a href="http://en.wikipedia.org/wiki/Forward_error_correction">FEC rate</a>, the number of <a href="http://en.wikipedia.org/wiki/Spatial_multiplexing">spatial streams</a>, etc.) observe a tradeoff between reliability, e.g., the probability of a dropped call in a voice network, and data rate in terms of the wireless channel quality.  Consequently, modern wireless networks get the most &#8220;bang for their buck'&#8217; in today&#8217;s spectrum limited wireless market through link adaptation where link adaptation is the process of selecting digital communication parameters based on real-time channel quality measurements.  Link adaptation allows for joint optimization of reliability and data rate tailored to each application.</p>
<p>Most published research makes link adaptation seem like a straightforward problem.</p>
<ol>
<li>Measure the wireless channel.
<li>Extract a link quality metric from the wireless channel.
<li>Map the link quality metric to digital communication parameters using a look-up-table or rate/reliability formulas.
</ol>
<p>Look-up-tables/formulas are created offline through analysis, simulations, or measurements.  When I attempted to do this on our IEEE 802.11n prototype, Hydra, I found out that link adaptation in practice can be very difficult. Here are a few of the lessons I learned.</p>
<ul>
<li><em>System nonlinearities make look-up-tables created through analysis or simulations inaccurate.</em>
<li><em>Non-Gaussian noise make look-up-tables created through analysis or simulations inaccurate.</em>
<li><em>Channel estimation error must be accounted for.</em>
<li><em>Look-up-tables based on actual over-the-air measurements result in the most accurate adaptation.</em>
<li><em>Look-up-tables based on actual over-the-air measurements for one device may result in inaccurate adaptation if placed on a different wireless device.</em>
</ul>
<p>After my initial testing I was concerned that it might be difficult to use our prototype, even with significant amplifier backoff to design/evaluate practical link adaptation algorithms.  Apparently, however, commercial systems suffer from the same issues.  For example, <a href="http://pdos.lcs.mit.edu/~rtm/papers/p442-aguayo.pdf">the Roofnet project found that the SNR link quality metric did not consistently reflect the expected reliability of the associated digital communication parameters, even when interference/collisions are not an issue</a>.</p>
<p>Another large problem we discovered is that good link quality metrics for MIMO-OFDM systems just weren&#8217;t available.  It turns out that analyzing the error rate of practical MIMO-OFDM links is very difficult.  Consequently, finding a good, single-dimensional (which is required for look-up-tables) link quality metric that modeled the spatial and frequency selective effects of the channel was also very difficult.</p>
<p>So what do we do?  The linear, time-invariant models we have used to create link adaptation rate/reliability expressions or to run link simulations (which may then result in look-up-tables) do not reflect the actual system.  One approach is to make our analysis model more complex to include nonlinear and non-Gaussian noise effects.  This seemed like a difficult undertaking.  Analysis was already difficult with our simplistic linear, time-invariant system and additive Gaussian noise.  Using a more complex system model would only lead to more design time for engineers.  Moreover, even if we are able to find a good link quality metric, it will likely be multi-dimensional, and look-up-tables aren&#8217;t easily created in this case.  All of this lead us (Professor Heath and I) to machine learning.  </p>
<p>Machine learning algorithms allow systems (in our case the link adaptation algorithm) to learn behavior solely from data observations.  Hence, as long as we were able to define an accurate link quality metric and pose the problem correctly, machine learning should be able to discover the relationship between the link quality metric and the reliability of the link.  First, we created the multi-dimensional ordered SNR link quality metric based on our new expression of packet error rate in MIMO-OFDM systems.  Then, with the help of Professor Caramanis, we validated the efficacy of classification algorithms that exploited this new link quality metric for link adaptation.  However, all this work was done using system models.  To compensate for unique hardware nonidealities, we needed an online algorithm that tuned link adaptation to each transmit/receive device pair.  Consequently, Professor Heath and I designed online classifiers that harness training information <em>on-the-fly</em>.  These algorithms constantly observe packets transmitted over channels and improve the link adaptation classifier in real time based on these observations. </p>
<p>For example, see the following figure which shows a plot of throughput and packet error rate for offline and online machine learning in a static wireless channel with our wireless prototype and a packet error rate reliability constraint of 10%.  <a href="http://windowsil.org/wp-content/uploads/2010/02/static_channel_la.png"><img align="left" src="http://windowsil.org/wp-content/uploads/2010/02/static_channel_la.thumbnail.png" alt="City Path Loss" /></a>  The offline algorithm is not able to tune itself to the unique hardware characteristics of the transmit/receive pair, resulting in lost rate/reliability.  The online algorithm, however, discovers the correct digital communication parameters in real-time.  There have been other rate adaptation algorithms, notably auto-rate fallback (ARF), which adapt online.  Unfortunately, they don&#8217;t take advantage of explicit link quality metrics and so cannot adapt well in dynamic channel conditions (see following figure). <a href="http://windowsil.org/wp-content/uploads/2010/02/dynamic_channel_la.png"><img align=right src=http://windowsil.org/wp-content/uploads/2010/02/dynamic_channel_la.thumbnail.png></a> </p>
<p>The best part of our online learning algorithms for link adaptation is simplicity.  The algorithms are installed and we&#8217;re done.  No complex analysis of the reliability curves.  No calibration algorithms to determine amplifier backoff.  Additionally, our recent results with support vector machines also show that online learning can be implemented with low memory/processing complexity.</p>
<p>For More Information:</p>
<p>R. C. Daniels and R. W. Heath, Jr., &#8220;Online Adaptive Modulation and Coding with Support Vector Machines,&#8221; <i>to appear in</i> Proceedings of the IEEE European Wireless Conference, Lucca, Italy, April  2010.</p>
<p>R. C. Daniels and R. W. Heath, Jr, &#8220;<a href="http://www.ece.utexas.edu/%7Erdaniels/conf6.htm">An Online Learning Framework for Link Adaptation in Wireless Networks</a>,&#8221; Proceedings of the Information Theory and Applications Workshop, San Diego, CA, February, 2009. </p>
<p>R. C. Daniels, C. M. Caramanis, and R. W. Heath, Jr, &#8220;<a href="http://www.ece.utexas.edu/%7Erdaniels/jour2.htm">Adaptation in Convolutionally-Coded MIMO-OFDM Wireless Systems through Supervised Learning and SNR Ordering</a>,&#8221; IEEE Transactions on Vehicular Technology, January, 2010.</p>
]]></content:encoded>
			<wfw:commentRSS>http://windowsil.org/2010/02/22/machine-learning-the-solution-to-link-adaptation-woes/feed/</wfw:commentRSS>
		</item>
		<item>
		<title>EE Wins the Nobel Prize for Physics</title>
		<link>http://windowsil.org/2009/10/07/ee-wins-the-nobel-prize-for-physics/</link>
		<comments>http://windowsil.org/2009/10/07/ee-wins-the-nobel-prize-for-physics/#comments</comments>
		<pubDate>Wed, 07 Oct 2009 09:49:56 +0000</pubDate>
		<dc:creator>Steven Peters</dc:creator>
		
	<category>Miscellaneous</category>
		<guid isPermaLink="false">http://windowsil.org/2009/10/07/ee-wins-the-nobel-prize-for-physics/</guid>
		<description><![CDATA[Charles K. Kao, who got his PhD in Electrical Engineering from Imperial College London, and founded the Electrical Engineering Department at Chinese University of Hong Kong, was just awarded the Nobel Prize in Physics for his pioneering work on fiber optic communications.
This is really amazing to me, a trained engineer winning this award.  Yes, [...]]]></description>
			<content:encoded><![CDATA[<p>Charles K. Kao, who got his PhD in Electrical Engineering from Imperial College London, and founded the Electrical Engineering Department at Chinese University of Hong Kong, was just awarded the Nobel Prize in Physics for his pioneering work on fiber optic communications.</p>
<p>This is really amazing to me, a trained engineer winning this award.  Yes, John Bardeen won two of these, but he was really trained as a physicist.  I&#8217;m willing to bet money that physicists don&#8217;t like this decision.
</p>
]]></content:encoded>
			<wfw:commentRSS>http://windowsil.org/2009/10/07/ee-wins-the-nobel-prize-for-physics/feed/</wfw:commentRSS>
		</item>
		<item>
		<title>Sanity Checks for Complex Proofs</title>
		<link>http://windowsil.org/2009/08/13/sanity-checks-for-complex-proofs/</link>
		<comments>http://windowsil.org/2009/08/13/sanity-checks-for-complex-proofs/#comments</comments>
		<pubDate>Thu, 13 Aug 2009 19:33:34 +0000</pubDate>
		<dc:creator>Robert Heath</dc:creator>
		
	<category>Miscellaneous</category>
		<guid isPermaLink="false">http://windowsil.org/2009/08/13/sanity-checks-for-complex-proofs/</guid>
		<description><![CDATA[I ran into this article today: Ten Signs a Claimed Mathematical Breakthrough is Wrong. While the author is writing from the perspective of quantum mechanics, I think we can extend many of the sanity checks to problems in communication theory and signal processing as well.
I really like the first point: &#8220;the authors don&#8217;t use TeX&#8221;. [...]]]></description>
			<content:encoded><![CDATA[<p>I ran into this article today: <a href="http://scottaaronson.com/blog/?p=304">Ten Signs a Claimed Mathematical Breakthrough is Wrong</a>. While the author is writing from the perspective of quantum mechanics, I think we can extend many of the sanity checks to problems in communication theory and signal processing as well.</p>
<p>I really like the first point: &#8220;the authors don&#8217;t use TeX&#8221;. I don&#8217;t know why but there seems to be such a correlation but I have seen this time and again.
</p>
]]></content:encoded>
			<wfw:commentRSS>http://windowsil.org/2009/08/13/sanity-checks-for-complex-proofs/feed/</wfw:commentRSS>
		</item>
		<item>
		<title>Inventor of frequency hopping</title>
		<link>http://windowsil.org/2008/12/07/inventor-of-frequency-hopping/</link>
		<comments>http://windowsil.org/2008/12/07/inventor-of-frequency-hopping/#comments</comments>
		<pubDate>Sun, 07 Dec 2008 23:34:53 +0000</pubDate>
		<dc:creator>Takao Inoue</dc:creator>
		
	<category>Miscellaneous</category>
		<guid isPermaLink="false">http://windowsil.org/2008/12/07/inventor-of-frequency-hopping/</guid>
		<description><![CDATA[A very interesting play, perhaps most amusing for wireless engineers, centered around the story of frequency hopping.
http://www.sciam.com/article.cfm?id=hedy-lamarr-not-just-a-pr
I like how they use the music analogy. Perhaps the first hopping algorithm was something like &#8220;Scott Joplin&#8217;s Entertainer&#8221; since Bach would be easily recognized by the Germans.

]]></description>
			<content:encoded><![CDATA[<p>A very interesting play, perhaps most amusing for wireless engineers, centered around the story of frequency hopping.<br />
<a title="Scientiic American Article on Frequency Hopping" href="http://www.sciam.com/article.cfm?id=hedy-lamarr-not-just-a-pr">http://www.sciam.com/article.cfm?id=hedy-lamarr-not-just-a-pr</a></p>
<p>I like how they use the music analogy. Perhaps the first hopping algorithm was something like &#8220;Scott Joplin&#8217;s Entertainer&#8221; since Bach would be easily recognized by the Germans.
</p>
]]></content:encoded>
			<wfw:commentRSS>http://windowsil.org/2008/12/07/inventor-of-frequency-hopping/feed/</wfw:commentRSS>
		</item>
		<item>
		<title>High SNR distribution of eigen-values of a Wishart Matrix</title>
		<link>http://windowsil.org/2008/11/12/high-snr-distribution-of-eigen-values-of-a-wishart-matrix/</link>
		<comments>http://windowsil.org/2008/11/12/high-snr-distribution-of-eigen-values-of-a-wishart-matrix/#comments</comments>
		<pubDate>Wed, 12 Nov 2008 20:32:11 +0000</pubDate>
		<dc:creator>Rahul Vaze</dc:creator>
		
	<category>Miscellaneous</category>
		<guid isPermaLink="false">http://windowsil.org/2008/11/12/high-snr-distribution-of-eigen-values-of-a-wishart-matrix/</guid>
		<description><![CDATA[Today I came across a nice result on the distribution of eigen values of matrix , where the entries of  are i.i.d. Gaussian distributed. The result says that the  eigen value  (in the decreasing order) of  has the following distribution,  for small .
Its quite useful for analysing many MIMO techniques, [...]]]></description>
			<content:encoded><![CDATA[<p>Today I came across a nice result on the distribution of eigen values of matrix <img src='http://windowsil.org/latexrender/pictures/c283e21362fcf390256289d6accd8330.gif' title='$HH^{\dag}$' alt='$HH^{\dag}$' align=absmiddle>, where the entries of <img src='http://windowsil.org/latexrender/pictures/f4664a6546352bc7f649389bb63a6c0b.gif' title='$H \in {\mathcal C}^{m\times n}$' alt='$H \in {\mathcal C}^{m\times n}$' align=absmiddle> are i.i.d. Gaussian distributed. The result says that the <img src='http://windowsil.org/latexrender/pictures/448aa5c656d95a0430b90ac5ded7840c.gif' title='$k^{th}$' alt='$k^{th}$' align=absmiddle> eigen value <img src='http://windowsil.org/latexrender/pictures/0c99b2af0fc5f8b1a39c8902837934f4.gif' title='$\lambda_k$' alt='$\lambda_k$' align=absmiddle> (in the decreasing order) of <img src='http://windowsil.org/latexrender/pictures/c283e21362fcf390256289d6accd8330.gif' title='$HH^{\dag}$' alt='$HH^{\dag}$' align=absmiddle> has the following distribution, <img src='http://windowsil.org/latexrender/pictures/e9629cc7f87d7e3982d74760a64a0153.gif' title='$P(\lambda_k\le x) = x^{(m-k+1)(n-k+1)},$' alt='$P(\lambda_k\le x) = x^{(m-k+1)(n-k+1)},$' align=absmiddle> for small <img src='http://windowsil.org/latexrender/pictures/332cc365a4987aacce0ead01b8bdcc0b.gif' title='$x$' alt='$x$' align=absmiddle>.<br />
Its quite useful for analysing many MIMO techniques, such as MRC, MRT.<br />
The reference is a recent IT Paper: http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=4544985&amp;isnumber=4544949</p>
]]></content:encoded>
			<wfw:commentRSS>http://windowsil.org/2008/11/12/high-snr-distribution-of-eigen-values-of-a-wishart-matrix/feed/</wfw:commentRSS>
		</item>
		<item>
		<title>Finding a Good Research Topic</title>
		<link>http://windowsil.org/2008/09/22/finding-a-good-research-topic/</link>
		<comments>http://windowsil.org/2008/09/22/finding-a-good-research-topic/#comments</comments>
		<pubDate>Mon, 22 Sep 2008 22:54:00 +0000</pubDate>
		<dc:creator>Caleb Lo</dc:creator>
		
	<category>Miscellaneous</category>
	<category>Reference</category>
		<guid isPermaLink="false">http://windowsil.org/2008/09/22/finding-a-good-research-topic/</guid>
		<description><![CDATA[A student from China recently asked me about how I got interested in relay selection and started obtaining (publishable) results.  Since I have some free time on my hands now, I figured I&#8217;d share some thoughts on this topic.
I actually don&#8217;t think that the way I got interested in relay selection was the ideal [...]]]></description>
			<content:encoded><![CDATA[<p>A student from China recently asked me about how I got interested in relay selection and started obtaining (publishable) results.  Since I have some free time on my hands now, I figured I&#8217;d share some thoughts on this topic.</p>
<p>I actually don&#8217;t think that the way I got interested in relay selection was the ideal strategy in terms of &#8220;finding a good research topic.&#8221;  Instead, I&#8217;ll discuss what I think is a better way of &#8220;finding a good research topic.&#8221;  Note that the following is especially relevant for graduate students researching wireless communications (for the obvious reasons).</p>
<p>It&#8217;s fairly common for a new graduate student to be overwhelmed by the plethora of potential research topics.  When I was starting work on my masters degree, I wanted to do research involving some aspect of wireless networks, since I felt (wrongly, as it turned out) that all of the good point-to-point problems had already been solved.  During the summer of 2004, I worked on beamforming for MIMO ad hoc networks, but that ended up being a major dead end.  On a related note, I recently perused my research notebook and found that during January 2006, I was interested in cooperative diversity for OFDM networks (my, how things have changed).</p>
<p>This brings up the key question: how should a new graduate student sort through the morass of potential research topics and come up with a good one?  I&#8217;ll discuss two potential answers.</p>
<p>One approach is to have your advisor answer this question for you, assuming that you have an advisor.  In general, you can assume that your advisor has a strong grasp of the current state of research in wireless communications.  This knowledge can help him/her determine a topic for you that is 1) interesting, so you won&#8217;t be bored stiff for approximately 5 years and 2) worthy of a Ph.D. dissertation, so you will have made a fundamental contribution of some sort by the time you graduate.</p>
<p>The second approach, which I highly recommend, is to take the initiative.  To start off, you should do a significant amount of reading.  Survey articles in journals such as the <a href="http://www.comsoc.org/dl/commag/">IEEE Communications Magazine</a> and the <a href="http://apollo.ee.columbia.edu/spm/">IEEE Signal Processing Magazine</a> can be valuable starting points for the interested yet relatively inexperienced grad student.</p>
<p>A particularly well-written survey article can provide the reader with a good grasp of &#8220;what&#8217;s been done&#8221; on a topic such as &#8220;OFDMA power allocation for relay-based networks&#8221; and suggest various open problems that are both interesting and important.  When reading through these survey articles, one should also scan the list of references to learn about the key papers (and researchers, so you can bookmark their home pages) in a particular area.</p>
<p>It&#8217;s then important to read through these key papers to grasp the nuances of the topic that you&#8217;re learning about and ask yourself tough questions along the way.  For example, do you understand the (technical) paper that you&#8217;re reading?  Can you justify all of the authors&#8217; assumptions?  Can you re-derive every expression (especially the proofs of key theorems) in the paper?  I should note that sometimes papers contain typos/gross errors, so you shouldn&#8217;t automatically trust everything you read.</p>
<p>If you want to answer these questions in the affirmative, this is a great opportunity for building your technical background.  For example, let&#8217;s say that the authors are studying a MIMO wireless system and assume that a two-ring scattering model is being employed.  If you don&#8217;t know what a two-ring scattering model is, you should obtain a copy of a MIMO textbook such as <a href="http://www.amazon.com/Introduction-Space-Time-Wireless-Communications-Arogyaswami/dp/0521065933/ref=sr_1_1?ie=UTF8&amp;s=books&amp;qid=1222046806&amp;sr=1-1">this one</a> by Paulraj et al. and learn more about channel modeling.</p>
<p>Also, let&#8217;s say that you&#8217;re reading through <a href="http://web.mit.edu/~6.962/www/www_fall_2000/everest/guptakumar.pdf">this famous paper</a> by Gupta and Kumar, and you&#8217;re having trouble deriving some (or all, as this paper is actually quite tricky to understand) of the key results.  In this case, you might want to strengthen your graph theory background by taking an appropriate class, such as <a href="http://www.cs.utexas.edu/~diz/388C/">this one</a> at UT-Austin.  You might also want to improve your knowledge of random geometry, and you can check your university library for a helpful book such as <a href="http://www.amazon.com/Random-Graphs-B%C3%A9la-Bollob%C3%A1s/dp/0521809207/ref=pd_bbs_sr_2?ie=UTF8&amp;s=books&amp;qid=1222123459&amp;sr=1-2">this one</a> by Bollobas for more coverage of this advanced topic.</p>
<p>As you read through the key technical papers in the area that you&#8217;re learning about, you should think of additional open problems and ask yourself more tough questions.  For example, you can ponder something like, &#8220;the authors&#8217; assumption of a zero-error feedback channel seems a bit restrictive.  From my other reading it&#8217;s clear that introducing a channel estimation error at the transmitter would better model a practical system.  Maybe I can&#8217;t obtain an exact expression for the sum capacity given channel estimation errors, since that seems quite complicated, but can I obtain relatively tight bounds?&#8221;</p>
<p>Regardless of the approach that you take in terms of finding a good research topic, it&#8217;s crucial that you interact with your advisor during this process.  Your advisor, who has worked in either the general area that you&#8217;re considering or a related area, can help you determine if the open problem you&#8217;re considering is either trivial, worthy of multiple dissertations, or actually reasonable for a dissertation.  Note that by adopting the second approach I discussed above, your ability to have meaningful dialogue with your advisor during this process is enhanced.  In particular, you can evaluate your advisor&#8217;s suggestions and converge on a reasonable topic more quickly; this is especially important if your advisor has not worked in the general area that you&#8217;re considering.</p>
<p>That&#8217;s all I had to say on this subject, at least for now.  I welcome comments, especially from my group-mates on this issue of &#8220;finding a good research topic.&#8221;
</p>
]]></content:encoded>
			<wfw:commentRSS>http://windowsil.org/2008/09/22/finding-a-good-research-topic/feed/</wfw:commentRSS>
		</item>
		<item>
		<title>WSIL Team Wins Contest</title>
		<link>http://windowsil.org/2008/09/22/wsil-team-wins-contest/</link>
		<comments>http://windowsil.org/2008/09/22/wsil-team-wins-contest/#comments</comments>
		<pubDate>Mon, 22 Sep 2008 22:12:36 +0000</pubDate>
		<dc:creator>Steven Peters</dc:creator>
		
	<category>WSIL News &amp; Views</category>
		<guid isPermaLink="false">http://windowsil.org/2008/09/22/wsil-team-wins-contest/</guid>
		<description><![CDATA[San Francisco was the site of the 2008 WiNTECH Workshop, which held a contest between teams presenting demonstrations of their research prototypes.  The theme of the contest was &#8220;The Next Big Thing in Wireless&#8221;, and consisted of teams building real wireless systems and giving a live demonstration of their capabilities.  

The winning team [...]]]></description>
			<content:encoded><![CDATA[<p>San Francisco was the site of the 2008 WiNTECH Workshop, which held a contest between teams presenting demonstrations of their research prototypes.  The theme of the contest was &#8220;The Next Big Thing in Wireless&#8221;, and consisted of teams building real wireless systems and giving a live demonstration of their capabilities.  </p>
<p><a href="http://windowsil.org/wp-content/uploads/2008/09/wintech_winners.jpg"><img src="http://windowsil.org/wp-content/uploads/2008/09/wintech_winners.thumbnail.jpg" align="right" alt="From left, Ketan Mandke, Robert Daniels, contest judge Dennis McCain, Steven Peters, and Prof. Robert Heath, Jr." /></a></p>
<p>The winning team consisted of <a href="http://users.ece.utexas.edu/~rdaniels/">Robert C. Daniels</a>, <a href="http://users.ece.utexas.edu/~mandke/">Ketan Mandke</a>, <a href="http://users.ece.utexas.edu/~peters/">Steven W. Peters</a>, <a href="http://users.ece.utexas.edu/~nettles/">Prof. Scott M. Nettles</a>, and <a href="http://users.ece.utexas.edu/~rheath/">Prof. Robert W. Heath, Jr.</a>, and their winning presentation was called &#8220;Machine Learning for Physical Layer Link Adaptation in Multiple-Antenna Wireless Networks&#8221;.  Daniels and Peters are graduate students in the <a href="http://users.ece.utexas.edu/~rheath/students/wsil.php">WSIL</a>, which is directed by Prof. Heath.  The demo consisted of using simple machine learning techniques to do adaptation in wireless devices using a custom-built IEEE 802.11n physical layer (PHY).  Because this PHY uses coded MIMO-OFDM, adaptation is a difficult prospect.  The team successfully demonstrated that the devices were learning the channel with no pre-existing knowledge, and could easily adapt to changing conditions.  They used the <a href="http://hydra.ece.utexas.edu/">Hydra prototype</a>, which is in continuous development, as the foundation for the demo.</p>
<p>The winning students received a $2500 cash prize kindly donated by the sponsors, ViaSat, Nokia Siemens Networks, The Center for Multimedia Communication, and BBN Technologies.  </p>
<p>The work was sponsored in part by NSF and DARPA ITMANET.
</p>
]]></content:encoded>
			<wfw:commentRSS>http://windowsil.org/2008/09/22/wsil-team-wins-contest/feed/</wfw:commentRSS>
		</item>
		<item>
		<title>LTE abbreviations - Take Your Pick!!</title>
		<link>http://windowsil.org/2008/07/18/lte-abbreviation-take-your-pick/</link>
		<comments>http://windowsil.org/2008/07/18/lte-abbreviation-take-your-pick/#comments</comments>
		<pubDate>Fri, 18 Jul 2008 06:43:26 +0000</pubDate>
		<dc:creator>Insoo Hwang</dc:creator>
		
	<category>Miscellaneous</category>
		<guid isPermaLink="false">http://windowsil.org/2008/07/18/lte-abbreviation-take-your-pick/</guid>
		<description><![CDATA[Light up Turn on Engage
Laptop and Terminal Euphoria
Linking The Earth
Linking Telephony Everywhere
Luscious Telephony Experience
Limitless Technology for Everyone
Limited Time Enigma
Laugh Track Escapade
Lightning-fast Transfer of Everything
Let&#8217;s Turnaround East
Late Troublesome Expensive
Look, Talk, and Enjoy
Live Telecommunication Environment
Leading Telecommunication Excellence
Loads of Traffic for Everyone
Live connection To Everyone
Live communication To Everyone
Lifeline To Everyone
Let&#8217;s Take it Easy
Life Time Eternal
Love Thy Enemy
Link Technology [...]]]></description>
			<content:encoded><![CDATA[<p>Light up Turn on Engage<br />
Laptop and Terminal Euphoria<br />
Linking The Earth<br />
Linking Telephony Everywhere<br />
Luscious Telephony Experience<br />
Limitless Technology for Everyone<br />
Limited Time Enigma<br />
Laugh Track Escapade<br />
Lightning-fast Transfer of Everything<br />
Let&#8217;s Turnaround East<br />
Late Troublesome Expensive<br />
Look, Talk, and Enjoy<br />
Live Telecommunication Environment<br />
Leading Telecommunication Excellence<br />
Loads of Traffic for Everyone<br />
Live connection To Everyone<br />
Live communication To Everyone<br />
Lifeline To Everyone<br />
Let&#8217;s Take it Easy<br />
Life Time Eternal<br />
Love Thy Enemy<br />
Link Technology Enhancement<br />
Legacy Terminal Equipment</p>
<p>- from LTE / LTE-A TSG RAN mailing list</p>
<p>Some people also say &#8220;Long Term Employment&#8221; or &#8220;Life Time Employment.&#8221; :)<br />
But my pick is &#8220;Love Thy Enemy.&#8221; How about you?</p>
]]></content:encoded>
			<wfw:commentRSS>http://windowsil.org/2008/07/18/lte-abbreviation-take-your-pick/feed/</wfw:commentRSS>
		</item>
		<item>
		<title>Spring 2008 Roundup</title>
		<link>http://windowsil.org/2008/05/03/spring-2008-roundup/</link>
		<comments>http://windowsil.org/2008/05/03/spring-2008-roundup/#comments</comments>
		<pubDate>Sun, 04 May 2008 00:13:29 +0000</pubDate>
		<dc:creator>Steven Peters</dc:creator>
		
	<category>Miscellaneous</category>
		<guid isPermaLink="false">http://windowsil.org/2008/05/03/spring-2008-roundup/</guid>
		<description><![CDATA[Although there is still a week of finals, the semester is basically finished.  This has been my most eventful semester, personally, but how did the WSIL fare?  Let&#8217;s take a look.
First and foremost, our dear Kaibin Huang just successfully defended his dissertation and is on his way to a post-doc at Hong Kong [...]]]></description>
			<content:encoded><![CDATA[<p>Although there is still a week of finals, the semester is basically finished.  This has been my most eventful semester, personally, but how did the WSIL fare?  Let&#8217;s take a look.</p>
<p>First and foremost, our dear <a href="http://users.ece.utexas.edu/~khuang/">Kaibin Huang</a> just successfully defended his dissertation and is on his way to a post-doc at <a href="http://www.ust.hk/eng/index.htm">Hong Kong University of Science and Technology</a>.  Not only that, but he was awarded the <a href="http://wncg.ece.utexas.edu">WNCG</a> Student Leadership award.  A WSIL member has won this award two of the past three years.</p>
<p>Along the same lines, <a href="http://users.ece.utexas.edu/~inoue">Takao Inoue</a> is now a Ph.D. Candidate.  He joins Chan-Byoung Chae and Caleb Lo as the next in line to graduate.</p>
<p>We also welcomed the well-known <a href="http://www.eurecom.fr/~kountour/">Dr. Marios Kountouris</a> as a post-doctoral researcher.  </p>
<p>In addition, we had eight journal papers published:</p>
<ul>
<li>R. C. Daniels R. W. Heath, Jr., &#8220;60 GHz Wireless Communications: Emerging Requirements and Design Recommendations,'&#8217; IEEE Vehicular Technology Magazine, vol. 2, no. 3, pp. 41-50, Sept. 2007. <a href="http://ieeexplore.ieee.org/search/srchabstract.jsp?arnumber=4457895&#038;isnumber=4457829&#038;punumber=10209&#038;k2dockey=4457895@ieeejrns">[IEEE Xplore]</a></li>
<li>J. G. Andrews, W. Choi,  and  R. W. Heath, Jr., &#8220;Overcoming interference in spatial multiplexing MIMO cellular networks,'&#8217; IEEE Wireless Communications, vol. 14, no. 6, pp. 95-104, Dec. 2007.  <a href="http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4407216&#038;arnumber=4407232&#038;count=16&#038;index=15">[IEEE Xplore]</a></li>
<li>W. Choi, A. Forenza, J. G. Andrews,  and  R. W. Heath, Jr., &#8220;Opportunistic space division multiple access with beam selection,'&#8217; IEEE Trans. on Communications, vol. 55, no. 12, pp. 2371-2380, Dec. 2007. <a href="http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4395261&#038;arnumber=4395263&#038;count=30&#038;index=20">[IEEE Xplore]</a></li>
<li>K. Huang, R. W. Heath, Jr.,  and  J. G. Andrews, &#8220;Uplink SDMA with Limited Feedback: Throughput Scaling,'&#8217; EURASIP Journal on Advances in Signal Processing, special issue on MIMO Transmission with Limited Feedback, vol. 2008, Article ID 479357, 17 pages, doi:10.1155/2008/479357, 2008. <a href="http://www.hindawi.com/GetArticle.aspx?doi=10.1155/2008/479357">[EURASIP Website]</a></li>
<li>B. Mondal and  R. W. Heath, Jr., &#8220;A Diversity Guarantee and SNR Performance for Quantized Precoded MIMO Systems,'&#8217; EURASIP Journal on Advances in Signal Processing, special issue on MIMO Transmission with Limited Feedback, vol. 2008, Article ID 594928, 15 pages, doi:10.1155/2008/594928, 2008. <a href="http://www.hindawi.com/GetArticle.aspx?doi=10.1155/2008/594928">[EURASIP Website]</a></li>
<li>Kyung Seung Ahn, R. W. Heath, Jr., and H. K. Baik, &#8220;Shannon Capacity and Symbol Error Rate of Space-Time Block Codes in MIMO Rayleigh Channels with Channel Estimation Error,'&#8217; IEEE Trans. on Wireless Communications, vol. 7, no. 1, pp. 324-333, Jan. 2008. <a href="http://ieeexplore.ieee.org/search/srchabstract.jsp?arnumber=4432275&#038;isnumber=4432233&#038;punumber=7693&#038;k2dockey=4432275@ieeejrns">[IEEE Xplore]</a></li>
<li>C. B. Chae, T. Tang, R. W. Heath, Jr.,  and  S. Cho, &#8220;MIMO Relaying with Linear Processing for Multiuser Transmission in Fixed Relay Networks,'&#8217; IEEE Trans. on Signal Processing, vol. 56, no. 2, pp. 727-738, Feb. 2008. <a href="http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4432769&#038;arnumber=4400829&#038;count=45&#038;index=25">[IEEE Xplore]</a></li>
<li>D. Piazza, N. J. Kirsch, A. Forenza, R. W. Heath, Jr., and K. R. Dandekar, &#8220;Design and Evaluation of a Reconfigurable Antenna Array for MIMO Systems,'&#8217;  IEEE Trans. on Antennas and Propagation, vol. 56,  no. 3,  pp. 869-881, Mar. 2008. <a href="http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4463877&#038;arnumber=4463909&#038;count=44&#038;index=30">[IEEE Xplore]</a></li>
</ul>
<p>In addition, our fearless leader <a href="http://users.ece.utexas.edu/~rheath/">Prof. Heath</a>, along with <a href="http://users.ece.utexas.edu/~jandrews/">Prof. Andrews</a>, won the WNCG Spring 2008 Bocce Ball tournament.  </p>
<p>And finally, a long semester of ups and downs concludes with a nice week in the U.S. Virgin Islands for the <a href="http://www.ieee-ctw.org">IEEE Communication Theory Workshop</a>, with Prof. Heath as General Chair.</p>
<p>Please add more here if I forgot something.
</p>
]]></content:encoded>
			<wfw:commentRSS>http://windowsil.org/2008/05/03/spring-2008-roundup/feed/</wfw:commentRSS>
		</item>
		<item>
		<title>One &#8220;disadvantage&#8221; of getting a PhD in the U.S.</title>
		<link>http://windowsil.org/2008/04/03/one-disadvantage-of-getting-a-phd-in-the-us/</link>
		<comments>http://windowsil.org/2008/04/03/one-disadvantage-of-getting-a-phd-in-the-us/#comments</comments>
		<pubDate>Thu, 03 Apr 2008 15:25:45 +0000</pubDate>
		<dc:creator>kientruong</dc:creator>
		
	<category>Miscellaneous</category>
		<guid isPermaLink="false">http://windowsil.org/2008/04/03/one-disadvantage-of-getting-a-phd-in-the-us/</guid>
		<description><![CDATA[For U.S. PhD-degree holders, don&#8217;t use the title &#8220;Dr.&#8221; in your business cards when you visit Germany. If not, you may face a year behind bars.
 News from Washington Post
Note: this news was not posted on April 1st.

]]></description>
			<content:encoded><![CDATA[<p>For U.S. PhD-degree holders, don&#8217;t use the title &#8220;Dr.&#8221; in your business cards when you visit Germany. If not, you may face a year behind bars.</p>
<p><a href="http://www.washingtonpost.com/wp-dyn/content/article/2008/03/13/AR2008031304353.html"> News from Washington Post</a></p>
<p>Note: this news was not posted on April 1st.
</p>
]]></content:encoded>
			<wfw:commentRSS>http://windowsil.org/2008/04/03/one-disadvantage-of-getting-a-phd-in-the-us/feed/</wfw:commentRSS>
		</item>
		<item>
		<title>AMD Design Contest</title>
		<link>http://windowsil.org/2008/03/24/amd-design-contest/</link>
		<comments>http://windowsil.org/2008/03/24/amd-design-contest/#comments</comments>
		<pubDate>Mon, 24 Mar 2008 16:27:37 +0000</pubDate>
		<dc:creator>Rahul Vaze</dc:creator>
		
	<category>Miscellaneous</category>
		<guid isPermaLink="false">http://windowsil.org/2008/03/24/amd-design-contest/</guid>
		<description><![CDATA[Many of you might know that over the weekend there was a AMD design contest. I was under the impression that such contests are coding heavy and it goes without saying that a potential turnoff for me. Thanks to my roommate, however, my impression changed significantly and I found out that majority of the problems [...]]]></description>
			<content:encoded><![CDATA[<p>Many of you might know that over the weekend there was a AMD design contest. I was under the impression that such contests are coding heavy and it goes without saying that a potential turnoff for me. Thanks to my roommate, however, my impression changed significantly and I found out that majority of the problems were basically algorithmic puzzles. More importantly it turned out that once you found out the trick involved, the coding required was minimal.<br />
I will give an example shortly. There are offcourse some problems on compiler design and related areas on which we have minimal knowledge. So to form an ideal team for these contests a partner majoring in CE/CS is a must.<br />
Over the weekend me and my roommate (major CE) were able to solve 4 and half problems out of 5. Unfortunately, we were not able to submit our solution to the contest, since my roommate had to fly out of town and due to my &#8220;extraordinary&#8221; coding skills.<br />
I am writing this post in hope that next year we would see someone from WNCG and especially from WSIL appearing on the LCD TV on the first floor as the winner of such a contest.</p>
<p>Example problem: Let z, l and m be a natural numbers, l less than m. Let p be a prime which appers in the prime factorization of z, e.g. 2 and 3 appear in the prime factorization of 24. The problem is to find out the number of natural numbers between l and m (including l and m) that have p ones in their binary representation.
</p>
]]></content:encoded>
			<wfw:commentRSS>http://windowsil.org/2008/03/24/amd-design-contest/feed/</wfw:commentRSS>
		</item>
		<item>
		<title>60 GHz Wireless Communications</title>
		<link>http://windowsil.org/2008/03/13/60-ghz-wireless-communications/</link>
		<comments>http://windowsil.org/2008/03/13/60-ghz-wireless-communications/#comments</comments>
		<pubDate>Thu, 13 Mar 2008 09:30:24 +0000</pubDate>
		<dc:creator>Bob Daniels</dc:creator>
		
	<category>WSIL News &amp; Views</category>
	<category>WSIL Publications</category>
		<guid isPermaLink="false">http://windowsil.org/2008/03/13/60-ghz-wireless-communications/</guid>
		<description><![CDATA[It has been some time since my last post.  For a while (before many of the current members were even in the WSIL) I was one of the few posting, so I&#8217;m glad to see that the WindoWSIL has really taken off in terms of group participation and readership.  Recently, my 60 GHz [...]]]></description>
			<content:encoded><![CDATA[<p>It has been some time since my last post.  For a while (before many of the current members were even in the WSIL) I was one of the few posting, so I&#8217;m glad to see that the WindoWSIL has really taken off in terms of group participation and readership.  Recently, my 60 GHz Wireless Communications (60G) tutorial paper <a href="http://www.ieeexplore.ieee.org/xpl/freeabs_all.jsp?isnumber=4457829&#038;arnumber=4457895&#038;count=19&#038;index=9">appeared in IEEE Vehicular Technology Magazine</a>, so I thought as an appropriate companion I would write an informal post for the interested reader.</p>
<p><b>What makes 60G so interesting for research?</b><br />
In my opinion there are two primary reasons that 60 GHz has received so much attention recently.</p>
<ol>
<li>There is <em>7 GHz of unlicensed (free) bandwidth available</em> in the United States alone!  <a href=http://windowsil.org/wp-content/uploads/2008/03/60Greg.png><img id="image229" src="http://windowsil.org/wp-content/uploads/2008/03/60Greg.thumbnail.png" alt="60 GHz Bandwidth Regulation" align="left"></a>  Additionally, there is around 5 GHz of unlicensed bandwidth common to Europe, most of Asia, Australia, and North America.  This amount of bandwidth is unparalleled at traditional frequencies such as 900 MHz, 1800 MHz, 2450 MHz, and 5000 MHz.  62 MHz of licensed spectrum around the 700 MHz carrier frequency was recently auctioned in the United States <a href="http://www.dailywireless.org/2008/03/04/700mhz-auction-ending-this-week/">netting a total of around 20 billions of dollars</a>.  Obviously bandwidth is precious, and when 7 GHz is available, people pay attention.
<li>The 60G carrier frequency in fundamentally range limited and presents significant challenges in antenna design, analog circuits, digital processing, and higher (cross) layer design.  For this reason the 7 GHz of bandwidth is still relatively unused even though it was opened up over 5 years ago.  If operating at 60G was just a matter of ramping up the carrier frequency of current systems, there might not be so much buzz (or money) in 60G research.  As communication engineers, we should be licking our chops, because it gives us some unsolved problems we can sink our teeth into.  Next, I will elaborate on some of the limitations and design challenges that make 60G so interesting.
</ol>
<p><b>60G Challenges</b><br />
The most obvious limitation of 60G to an engineer is the carrier frequency itself.  Physics (via the <a href="http://www.rfcafe.com/references/electrical/path_loss.htm">Friis free space propagation formula</a>) dictates that we lose 20 dB in received power every time we multiply the carrier frequency by 10.  That means if I have two systems, one operating at 6 GHz and one operating at 60 GHz, I would have to transmit 20 dB more power in the 60 GHz system to achieve the same performance in a vacuum.  Of course we don&#8217;t live in a vacuum, and that brings us to two more limitations at 60 GHz: reduced propagation through materials and increased Doppler effects. The ability of electromagnetic waves to penetrate solid objects is a function of the carrier frequency.  Measurements have shown that propagation through objects is reduced at 60 GHz, limiting the ability of non-line-of-sight communication.  Doppler frequency, which results from mobility of objects around communication devices, is proportional to the carrier frequency.  Since the carrier frequency is significantly larger than traditional systems, we will experience much larger Doppler frequencies, which may complicate feedback, channel estimation, and higher layer design.  <a href=http://windowsil.org/wp-content/uploads/2008/03/atm_absorption.gif><img id="image231" src="http://windowsil.org/wp-content/uploads/2008/03/atm_absorption.thumbnail.gif" alt="Atmospheric Absorption" align="right"></a>Finally, and perhaps the limitation that encouraged national entities to remove licensing restrictions, 60 GHz wireless transmissions experience Oxygen absorption effects.  It turns out that Oxygen resonates at 60 GHz, providing 10-20 dB of signal attenuation per kilometer (see image at right sourced from <a href="http://www.marcus-spectrum.com/MMW.htm">Marcus Spectrum Solutions</a>).</p>
<p>From a design perspective, the fundamental limitations of the wireless channel are not the only difficulties. 60G antenna design is unique since the antenna dimensions are reduced.  Therefore, antenna fabrication will require more expensive milling technology, especially for planar antenna arrays.  RF circuits at 60 GHz may also have to discard simplifying lumped element assumptions as wavelengths approach device dimensions.  Analog circuit design is complicated for many other reasons including reduced amplifier gain characteristics, reduced power output capabilities for transistors, amplification of frequency instability (phase noise).  In general this leads to increased cost in engineering design or the technology implemented.</p>
<p><b>Current Activity</b><br />
After the laundry list of limitations and design obstacles presented above you might be thinking to yourself &#8220;there&#8217;s no point in trying&#8221; or &#8220;it will never work.&#8221;  Thankfully, that&#8217;s not the consensus of the wireless market.  We have seen significant activity in industry recently to try and bring 60 GHz to the consumer in the near future.  IEEE 802.16d, the precursor to WiMax, actually considered using frequencies up to 66 GHz.  Unfortunately, it quickly became apparent that the above challenges were too much for mobile broadband devices that need to communicate over kilometer distances.  As a consequence, all the wireless devices to appear in the near future are targeted for indoor, short range communications.  <a href="http://www.ieee802.org/15/pub/TG3c.html">IEEE 802.15.3c</a> is currently constructing a standard for operating wireless personal area networks at 60 GHz.  The 3c working group has formally accepted a proposal, an important first step towards actual standardization.  15.3c devices should be seen as a replacement for UWB, which will eventually replace Bluetooth.  While, 802.15.3c is addressing a host of applications for high throughput communications, WirelessHD has a single focus.  <a href=http://www.wirelesshd.org>WirelessHD</a> is a consortium of companies that have banded together to create 60G technology for high definiton wireless video streaming.  Here is a nice overview of <a href="http://www.wirelesshd.org/WirelessHD_Full_Overview_071009.pdf">their OFDM-based standard</a> as well as a <a href="http://www.youtube.com/v/pthcqKYWiYI&#038;hl=en">video summary</a> of a CES 2008 presentation.  In the past wireless video streaming was subject to low performance lossy compression or high cost lossless compression.  Because of the 60 GHz bandwidth available the wireless industry is hoping to provide low cost, high performance uncompressed video streaming.  With 60 GHz it is only a matter of time before all peripheral devices on a personal computer are cable-less and all the wires in your home entertainment center are gone (except for power cables of course).  For completeness I want to also mention that <a href="http://www.ecma-international.org/">ECMA</a> has thrown their hat into the ring and are <a href="http://www.ecma-international.org/memento/TC48-M.htm">in the process of building a 60 GHz standard</a>.  Since this is the same standardization body that brought us the <a href="http://wimedia.org/en/index.asp">WiMedia Multiband OFDM standard for UWB</a>, I can only expect they see 60 GHz as an extension for higher rates.  In that sense IEEE 802.15.3c and the ECMA standard will be directly competing; whether the two can coexist is unknown at this point.</p>
<p><b>Design Ideas</b><br />
If you&#8217;d like to know more about how to design the physical layer in view of these challenges or a look at developing technologies that may change the landscape of 60G, please refer to the aforementioned IEEE reference or its <a href="http://users.ece.utexas.edu/~rdaniels/jour0.htm">preprint here</a>.  I think there is copious room for physical layer or higher layer design suggestions that take advantage of 60 GHz with consideration of its challenges.  Along with the 60G challenges, we also experience unique advantages such as reduced size constraints on antenna arrays and improved security of communication signals.  I&#8217;m more than willing to hear your ideas so please contact me with any additional questions.
</p>
]]></content:encoded>
			<wfw:commentRSS>http://windowsil.org/2008/03/13/60-ghz-wireless-communications/feed/</wfw:commentRSS>
		</item>
		<item>
		<title>IEEE 802.16j Draft 3 in balloting</title>
		<link>http://windowsil.org/2008/03/01/ieee-80216j-draft-3-in-balloting/</link>
		<comments>http://windowsil.org/2008/03/01/ieee-80216j-draft-3-in-balloting/#comments</comments>
		<pubDate>Sun, 02 Mar 2008 00:43:35 +0000</pubDate>
		<dc:creator>Steven Peters</dc:creator>
		
	<category>Miscellaneous</category>
		<guid isPermaLink="false">http://windowsil.org/2008/03/01/ieee-80216j-draft-3-in-balloting/</guid>
		<description><![CDATA[Draft 3 of IEEE 802.16j has been finished and letter ballot voting has begun. Voting closes March 15th. While Draft 2 officially passed letter ballot, resolutions to comments made with &#8220;Disapprove&#8221; votes need to be made before moving on in the process. The official announcement is available online, and you can monitor voting progress as [...]]]></description>
			<content:encoded><![CDATA[<p>Draft 3 of <a href="http://users.ece.utexas.edu/~rheath/papers/2008/ComMag/">IEEE 802.16j</a> has been finished and letter ballot voting has begun. Voting closes March 15th. While Draft 2 officially passed letter ballot, resolutions to comments made with &#8220;Disapprove&#8221; votes need to be made before moving on in the process. <a href="http://ieee802.org/16/docs/08/80216-08_007.pdf">The official announcement is available online</a>, and you can <a href="http://dot16.org/ballot28/results28.shtml">monitor voting progress</a> as well. The document is not available for free to the public, but in due time it will be <a href="http://ieee802.org/16/pubs/80216j.html">available for purchase</a>.
</p>
]]></content:encoded>
			<wfw:commentRSS>http://windowsil.org/2008/03/01/ieee-80216j-draft-3-in-balloting/feed/</wfw:commentRSS>
		</item>
		<item>
		<title>Overview of MIMO Broadcast Channel Capacity Results</title>
		<link>http://windowsil.org/2008/02/12/overwiew-of-mimo-broadcast-channel-capacity-result/</link>
		<comments>http://windowsil.org/2008/02/12/overwiew-of-mimo-broadcast-channel-capacity-result/#comments</comments>
		<pubDate>Tue, 12 Feb 2008 20:46:11 +0000</pubDate>
		<dc:creator>Rahul Vaze</dc:creator>
		
	<category>Miscellaneous</category>
		<guid isPermaLink="false">http://windowsil.org/2008/02/12/overwiew-of-mimo-broadcast-channel-capacity-result/</guid>
		<description><![CDATA[The broadcast channel is a communication channel with a single transmitter that transmits independent information to multiple receivers. In information theory, capacity of a communication channel is defined as the maximum rate of information that can be transmitted from the transmitter to the receiver reliably. By reliable transmission we mean that the information can be [...]]]></description>
			<content:encoded><![CDATA[<p>The broadcast channel is a communication channel with a single transmitter that transmits independent information to multiple receivers. In information theory, capacity of a communication channel is defined as the maximum rate of information that can be transmitted from the transmitter to the receiver reliably. By reliable transmission we mean that the information can be decoded at the receiver with arbitrarily small probability of error. Let us assume that the broadcast channel has <img src='http://windowsil.org/latexrender/pictures/f9c4988898e7f532b9f826a75014ed3c.gif' title='$N$' alt='$N$' align=absmiddle> receivers, then a rate vector <img src='http://windowsil.org/latexrender/pictures/bd3bc224c57f6561118b879ecc2a6301.gif' title='${\bf R} = [R_1, R_2, \ldots, R_N]$' alt='${\bf R} = [R_1, R_2, \ldots, R_N]$' align=absmiddle> is said to be achievable on the broadcast channel if information can be transmitted reliably at rate <img src='http://windowsil.org/latexrender/pictures/258dc3944f419c93dcf855739b15eb51.gif' title='$R_n$' alt='$R_n$' align=absmiddle> from the transmitter to the receiver <img src='http://windowsil.org/latexrender/pictures/55a049b8f161ae7cfeb0197d75aff967.gif' title='$n$' alt='$n$' align=absmiddle>,<img src='http://windowsil.org/latexrender/pictures/26f7d0172466ea8262f1f996086a8c1e.gif' title='$n=1,2,\ldots, N$' alt='$n=1,2,\ldots, N$' align=absmiddle>, simultaneously. The capacity of broadcast channel is defined as the convex hull of all achievable rate vectors. Finding the capacity of a general broadcast capacity has been a long standing open problem in information theory. In this article we will discuss the multiple input multiple output broadcast channel (MIMO-BC) whose capacity region has been found recently by Weingarten et. al.</p>
<p>The MIMO-BC model is as follows. A transmitter with <img src='http://windowsil.org/latexrender/pictures/94f19ee28014814bfdb82451d32d2f42.gif' title='$M_t$' alt='$M_t$' align=absmiddle> antennas wants to transmit independent information to <img src='http://windowsil.org/latexrender/pictures/f9c4988898e7f532b9f826a75014ed3c.gif' title='$N$' alt='$N$' align=absmiddle>receivers, where <img src='http://windowsil.org/latexrender/pictures/ae7647a25a2e7d1d8719abc7aa16dc35.gif' title='$n^{th}$' alt='$n^{th}$' align=absmiddle> receiver is equipped with <img src='http://windowsil.org/latexrender/pictures/4a176068c236ba5e0674a93d35294db2.gif' title='$M_n$' alt='$M_n$' align=absmiddle> antennas <img src='http://windowsil.org/latexrender/pictures/a5b2786bd05de414767c86eb15234b5f.gif' title='$n=1,2,\ldots,N$' alt='$n=1,2,\ldots,N$' align=absmiddle>. Let <img src='http://windowsil.org/latexrender/pictures/3fe67913aae19ad1394f78addba4e6a7.gif' title='${\bf x}$' alt='${\bf x}$' align=absmiddle> be the signal transmitted by the transmitter, then the received signal <img src='http://windowsil.org/latexrender/pictures/197d853e7cb7ae7f77b3310fc078774a.gif' title='${\bf y}_n$' alt='${\bf y}_n$' align=absmiddle>received by receiver <img src='http://windowsil.org/latexrender/pictures/55a049b8f161ae7cfeb0197d75aff967.gif' title='$n$' alt='$n$' align=absmiddle> is given by <img src='http://windowsil.org/latexrender/pictures/3dc6d0819d1470031d4660b271993574.gif' title='\[{\bf y}_n = H_n{\bf x} + {\bf v}_n,\]' alt='\[{\bf y}_n = H_n{\bf x} + {\bf v}_n,\]' align=absmiddle> where <img src='http://windowsil.org/latexrender/pictures/f7b409f9967f1de85ee740bebe5d41ab.gif' title='$H_n$' alt='$H_n$' align=absmiddle> is a <img src='http://windowsil.org/latexrender/pictures/aa503887e6bb6fbbf4b0eaef266fd2ef.gif' title='$M_n\times M_t$' alt='$M_n\times M_t$' align=absmiddle> channel matrix and <img src='http://windowsil.org/latexrender/pictures/49ccffcdfb9e4eebc74d715cfc090ba6.gif' title='${\bf v}_n$' alt='${\bf v}_n$' align=absmiddle> is the additive white Gaussian noise (AWGN) with covariance matrix <img src='http://windowsil.org/latexrender/pictures/6bdbe8fbcae3bea2b4d8fdc913bda622.gif' title='${\bf N}_n, \ n=1,2,\ldots,N$' alt='${\bf N}_n, \ n=1,2,\ldots,N$' align=absmiddle>.</p>
<p>For MIMO-BC, several transmission strategies have been proposed in literature, for example, superposition coding and dirty paper coding. In superposition coding, if <img src='http://windowsil.org/latexrender/pictures/586b683bdf37efae16a2bcb9bf7050de.gif' title='${\bf x}_n$' alt='${\bf x}_n$' align=absmiddle> is the signal for receiver <img src='http://windowsil.org/latexrender/pictures/55a049b8f161ae7cfeb0197d75aff967.gif' title='$n$' alt='$n$' align=absmiddle> then <img src='http://windowsil.org/latexrender/pictures/a36b415381c2df3c379b05f7c538059c.gif' title='${\bf x}= \sum_{n=1}^N {\bf x}_n$' alt='${\bf x}= \sum_{n=1}^N {\bf x}_n$' align=absmiddle> is transmitted by the transmitter. Dirty paper coding (DPC) is a technique developed by Costa for single input single output (SISO) AWGN channels when there is an interference signal present at the receiver together with AWGN.  We assume the interference signal is known non causally at the transmitter. In this setting Costa showed that the capacity is <img src='http://windowsil.org/latexrender/pictures/5fb7831a39e0a2b75e3f2f84f71fe20a.gif' title='$\frac{1}{2}\log(1+SNR)$' alt='$\frac{1}{2}\log(1+SNR)$' align=absmiddle> which is exactly equal to the capacity of AWGN channel without any interference. Thus, DPC is shown to completely eliminate the effect of interference. Using DPC for the MIMO BC, if the signal for the first receiver is <img src='http://windowsil.org/latexrender/pictures/bf69bee3fcd72a80ac5c76b7402673dd.gif' title='${\bf x}_1$' alt='${\bf x}_1$' align=absmiddle>, then the signal <img src='http://windowsil.org/latexrender/pictures/bb614c728907afabedb4db300decc7a9.gif' title='${\bf x}_2$' alt='${\bf x}_2$' align=absmiddle> for receiver <img src='http://windowsil.org/latexrender/pictures/76c5792347bb90ef71cfbace628572cf.gif' title='$2$' alt='$2$' align=absmiddle> is generated using <img src='http://windowsil.org/latexrender/pictures/bf69bee3fcd72a80ac5c76b7402673dd.gif' title='${\bf x}_1$' alt='${\bf x}_1$' align=absmiddle> as the interference signal. Similarly, the signal <img src='http://windowsil.org/latexrender/pictures/586b683bdf37efae16a2bcb9bf7050de.gif' title='${\bf x}_n$' alt='${\bf x}_n$' align=absmiddle> for the receiver <img src='http://windowsil.org/latexrender/pictures/55a049b8f161ae7cfeb0197d75aff967.gif' title='$n$' alt='$n$' align=absmiddle> is generated using <img src='http://windowsil.org/latexrender/pictures/ad072fe7a7f5319f4c0cb482b912649d.gif' title='${\bf x}_1,\ldots,{\bf x}_{n-1}$' alt='${\bf x}_1,\ldots,{\bf x}_{n-1}$' align=absmiddle> as the interference signals and <img src='http://windowsil.org/latexrender/pictures/24f14ae9e784750bfee01da0d754ad1e.gif' title='${\bf x} = \sum_{n=1}^N{\bf x}_n$' alt='${\bf x} = \sum_{n=1}^N{\bf x}_n$' align=absmiddle> is transmitted from the transmitter. From now on we consider <img src='http://windowsil.org/latexrender/pictures/224e6819744eb493dfcc2829e9ab013e.gif' title='$N=2$' alt='$N=2$' align=absmiddle> in this article for simplicity. With <img src='http://windowsil.org/latexrender/pictures/224e6819744eb493dfcc2829e9ab013e.gif' title='$N=2$' alt='$N=2$' align=absmiddle>,the rates <img src='http://windowsil.org/latexrender/pictures/4e1dcfc6c3009ba241e86add0e87a9d1.gif' title='$R_1$' alt='$R_1$' align=absmiddle> and <img src='http://windowsil.org/latexrender/pictures/05f4ca837f07995f711e9df7b84e1c07.gif' title='$R_2$' alt='$R_2$' align=absmiddle>, simultaneously achievable for receiver <img src='http://windowsil.org/latexrender/pictures/034d0a6be0424bffe9a6e7ac9236c0f5.gif' title='$1$' alt='$1$' align=absmiddle>and <img src='http://windowsil.org/latexrender/pictures/76c5792347bb90ef71cfbace628572cf.gif' title='$2$' alt='$2$' align=absmiddle>, are given by <img src='http://windowsil.org/latexrender/pictures/d231b48745808e6900b2b7cef9bff54d.gif' title='\[R_1^{DPC} = \frac{1}{2}\log\frac{\det\left({\bf S}_1+ {\bf S}_2 + {\bf N}_1\right)}{\det\left({\bf S}_2+{\bf N}_1\right)}\]' alt='\[R_1^{DPC} = \frac{1}{2}\log\frac{\det\left({\bf S}_1+ {\bf S}_2 + {\bf N}_1\right)}{\det\left({\bf S}_2+{\bf N}_1\right)}\]' align=absmiddle> and <img src='http://windowsil.org/latexrender/pictures/439320c9f3e1132578ecfaea9d24fa59.gif' title='\[R_2^{DPC} = \frac{1}{2}\log\frac{\det\left({\bf S}_2 + {\bf N}_2\right)} {\det\left({\bf N}_2\right)},\]' alt='\[R_2^{DPC} = \frac{1}{2}\log\frac{\det\left({\bf S}_2 + {\bf N}_2\right)} {\det\left({\bf N}_2\right)},\]' align=absmiddle> where <img src='http://windowsil.org/latexrender/pictures/857360c857ac251b46c759804ece34d6.gif' title='${\bf S}_n$' alt='${\bf S}_n$' align=absmiddle> is the covariance matrix of <img src='http://windowsil.org/latexrender/pictures/586b683bdf37efae16a2bcb9bf7050de.gif' title='${\bf x}_n$' alt='${\bf x}_n$' align=absmiddle>. Changing the order of coding, i.e. first generating <img src='http://windowsil.org/latexrender/pictures/bb614c728907afabedb4db300decc7a9.gif' title='${\bf x}_2$' alt='${\bf x}_2$' align=absmiddle> and depending on <img src='http://windowsil.org/latexrender/pictures/bb614c728907afabedb4db300decc7a9.gif' title='${\bf x}_2$' alt='${\bf x}_2$' align=absmiddle> generating <img src='http://windowsil.org/latexrender/pictures/bf69bee3fcd72a80ac5c76b7402673dd.gif' title='${\bf x}_1$' alt='${\bf x}_1$' align=absmiddle>, <img src='http://windowsil.org/latexrender/pictures/3bbf2faa4f6d254df3cf1b10049f875f.gif' title='\[R_1^{DPC} = \frac{1}{2}\log\frac{\det\left({\bf S}_1 + {\bf N}_1\right)}{\det\left({\bf N}_1\right)}\]' alt='\[R_1^{DPC} = \frac{1}{2}\log\frac{\det\left({\bf S}_1 + {\bf N}_1\right)}{\det\left({\bf N}_1\right)}\]' align=absmiddle> and <img src='http://windowsil.org/latexrender/pictures/916d11f440683b3dcc4808c18fb34666.gif' title='\[R_2^{DPC} = \frac{1}{2}\log\frac{\det\left({\bf S}_1+ {\bf S}_2 + {\bf N}_2\right)}{\det\left({\bf S}_1+{\bf N}_2\right)}.\]' alt='\[R_2^{DPC} = \frac{1}{2}\log\frac{\det\left({\bf S}_1+ {\bf S}_2 + {\bf N}_2\right)}{\det\left({\bf S}_1+{\bf N}_2\right)}.\]' align=absmiddle> We denote the convex hull of all rate vectors achievable with DPC as <img src='http://windowsil.org/latexrender/pictures/0cecd5df2445e405d82cef363859e209.gif' title='$R^{DPC}$' alt='$R^{DPC}$' align=absmiddle>.</p>
<p>As shown above, finding the achievable rate region of MIMO-BC is easy using different transmission strategies but proving that they are capacity achieving, i.e. rate more than the rate achieved by a particular transmission strategy is not achievable with reliable transmission constraint, is quite difficult. Weingarten et.al. solved this problem in their paper and showed that rates achieved with DPC are optimal for MIMO-BC.</p>
<p>Here we present the argument for symmetric MIMO Broadcast channels from Weingarten et. al.&#8217;s paper, where the number of antennas at the transmitter and each receiver are equal. We also only consider two receivers here for simplicity, the general case follows similarly. As before let the received signal at receiver <img src='http://windowsil.org/latexrender/pictures/55a049b8f161ae7cfeb0197d75aff967.gif' title='$n$' alt='$n$' align=absmiddle> be <img src='http://windowsil.org/latexrender/pictures/e3414cc9bd074b219a3ccfac17f44ac7.gif' title='$Y_n$' alt='$Y_n$' align=absmiddle>, where <img src='http://windowsil.org/latexrender/pictures/8357ddee5a7849d18c5943276714697d.gif' title='\[{\bf y}_n = {\bf H}_n{\bf x}_n + {\bf v}_n, \ n=1,2.\]' alt='\[{\bf y}_n = {\bf H}_n{\bf x}_n + {\bf v}_n, \ n=1,2.\]' align=absmiddle> Since we are assuming <img src='http://windowsil.org/latexrender/pictures/9a951d0cd1ec171bb4d5afa832562a84.gif' title='${\bf H}_n$' alt='${\bf H}_n$' align=absmiddle> to be a square matrix, without loss we can multiply the received signal by <img src='http://windowsil.org/latexrender/pictures/28429abcf42cc35771ee4babbb425bfa.gif' title='${\bf H}_n^{-1}$' alt='${\bf H}_n^{-1}$' align=absmiddle> without changing the capacity. Note that <img src='http://windowsil.org/latexrender/pictures/9a951d0cd1ec171bb4d5afa832562a84.gif' title='${\bf H}_n$' alt='${\bf H}_n$' align=absmiddle> is invertible with probability <img src='http://windowsil.org/latexrender/pictures/034d0a6be0424bffe9a6e7ac9236c0f5.gif' title='$1$' alt='$1$' align=absmiddle>. This is formally defined as aligned MIMO BC (AMIMO-BC) with <img src='http://windowsil.org/latexrender/pictures/41d56e0472684582a2f72d21c7a50874.gif' title='\[{\bf y}_n = {\bf x}_n + {\bf v}_n, \ n=1,2.\]' alt='\[{\bf y}_n = {\bf x}_n + {\bf v}_n, \ n=1,2.\]' align=absmiddle> Then a transformation of AMIMO-BC is considered, called degraded and aligned MIMO BC (DAMIMO-BC), where <img src='http://windowsil.org/latexrender/pictures/1b4465292912001d0491981856889816.gif' title='\[{\bf y}_n = {\bf H}_n{\bf x}_n + {\bf v}^{*}_n, \ n=1,2.\]' alt='\[{\bf y}_n = {\bf H}_n{\bf x}_n + {\bf v}^{*}_n, \ n=1,2.\]' align=absmiddle> with <img src='http://windowsil.org/latexrender/pictures/218df61d36f8d37f702f22444555f59c.gif' title='$cov ({\bf v}^{*}_1) \le cov({\bf v}^{*}_2)$' alt='$cov ({\bf v}^{*}_1) \le cov({\bf v}^{*}_2)$' align=absmiddle>, <img src='http://windowsil.org/latexrender/pictures/cbdca47285969a646a7adef816ee11db.gif' title='$cov(.)$' alt='$cov(.)$' align=absmiddle> denotes the covariance matrix. For any two matrices, <img src='http://windowsil.org/latexrender/pictures/6d49d0df0ca9a7b425864483b691b122.gif' title='${\bf A}, {\bf B}$' alt='${\bf A}, {\bf B}$' align=absmiddle>,by <img src='http://windowsil.org/latexrender/pictures/63dfbdc5b55cb43c0106ad401eb68c93.gif' title='${\bf A} \le {\bf B}$' alt='${\bf A} \le {\bf B}$' align=absmiddle> we mean <img src='http://windowsil.org/latexrender/pictures/3dfc59a34b0bdb4712edd78cf6073758.gif' title='${\bf A} -{\bf B}$' alt='${\bf A} -{\bf B}$' align=absmiddle> is a negative semidefinite matrix. It is easy to see that DAMIMO-BC is a degraded BC channel, i.e. one receiver receives less noisy signal than the other. For the degraded BC it is known that superposition coding is optimal, however, it is not known whether Gaussian signaling is optimal or not.</p>
<p><img src='http://windowsil.org/latexrender/pictures/1d1260c01284f8aec3a0e5c8e0a99281.gif' title='{\it Remark:}' alt='{\it Remark:}' align=absmiddle> For a single input single output degraded BC (SISO-DBC), where the transmitter and each receiver has a single antenna, Bergmans showed that Gaussian signaling is optimal, however, the proof of Bergmans does not extend to the DAMIMO-BC case.</p>
<p>The optimality of Gaussian signalling is shown as follows. Let <img src='http://windowsil.org/latexrender/pictures/220f5efdb090453941bcd00d24219f8c.gif' title='$R^{G}$' alt='$R^{G}$' align=absmiddle> be the set of all achievable rate vectors <img src='http://windowsil.org/latexrender/pictures/57074a7cfedb9c1cc0a60b44e813db88.gif' title='$\{R_1^G, R_2^G\}$' alt='$\{R_1^G, R_2^G\}$' align=absmiddle> with Gaussian superposition coding for DAMIO-BC and let <img src='http://windowsil.org/latexrender/pictures/b12da80e3d04eaead82b4fb62a165899.gif' title='${\bf B}_1$' alt='${\bf B}_1$' align=absmiddle> and <img src='http://windowsil.org/latexrender/pictures/901f26f4fb3d2885813334c06dc73f27.gif' title='${\bf B}_2$' alt='${\bf B}_2$' align=absmiddle> be the input covariance matrices achieving <img src='http://windowsil.org/latexrender/pictures/dff15d2c6415e0b96cc709626efada42.gif' title='$R_1^G$' alt='$R_1^G$' align=absmiddle> and <img src='http://windowsil.org/latexrender/pictures/b7b6a209cadeeb2a83585186a3ebcca7.gif' title='$R_2^G$' alt='$R_2^G$' align=absmiddle>. To show that any rate vector which does not belong to <img src='http://windowsil.org/latexrender/pictures/861f06c70c735efbd1bb9ae4cdac5721.gif' title='$R^G$' alt='$R^G$' align=absmiddle> is not achievable, an enhanced DAMIMO-BC is introduced, which is defined as <img src='http://windowsil.org/latexrender/pictures/c87dd9d726392c3ff8868b2f862e5a20.gif' title='\[{\bf y}_n = {\bf x}_n + {\hat {\bf v}}_n, \ n=1,2.\]' alt='\[{\bf y}_n = {\bf x}_n + {\hat {\bf v}}_n, \ n=1,2.\]' align=absmiddle> where <img src='http://windowsil.org/latexrender/pictures/db13b5f096f8748b416db46f7bbf44e4.gif' title='\[cov({\hat {\bf v}}_1) \le cov({\bf v}^{*}_1), cov({\hat {\bf v}}_1) + cov({\hat {\bf v}}_2) \le cov({\bf v}^{*}_1) + cov({\bf v}^{*}_2).\]' alt='\[cov({\hat {\bf v}}_1) \le cov({\bf v}^{*}_1), cov({\hat {\bf v}}_1) + cov({\hat {\bf v}}_2) \le cov({\bf v}^{*}_1) + cov({\bf v}^{*}_2).\]' align=absmiddle> Clearly, any rate vector achievable on DAMIMO-BC is also achievable on the enhanced DAMIMO-BC, thus the capacity region of DAMIMO-BC is contained inside the capacity region of enhanced DAMIMO-BC.</p>
<p>Next, it is shown that for any DAMIMO-BC there exits an enhanced DAMIMO-BC such that the following properties hold<br />
1. Proportionality: There exits <img src='http://windowsil.org/latexrender/pictures/8116099ebb86418717b5d8230bf84434.gif' title='$\alpha_1 \ge 0$' alt='$\alpha_1 \ge 0$' align=absmiddle>, such that <img src='http://windowsil.org/latexrender/pictures/1f40c6624992a5093cb654b9216fcbb0.gif' title='\[\alpha_1\left(B_1 + cov({\hat {\bf v}}_1)\right) = cov({\hat {\bf v}}_{2}).\]' alt='\[\alpha_1\left(B_1 + cov({\hat {\bf v}}_1)\right) = cov({\hat {\bf v}}_{2}).\]' align=absmiddle><br />
2. Rate Preservation: The rate vector <img src='http://windowsil.org/latexrender/pictures/3a8e0391034f29d8760b3351134838e1.gif' title='$(R_1, R_2)$' alt='$(R_1, R_2)$' align=absmiddle> achievable on enhanced DAMIMO-BC with Gaussian signaling is equal to rate vector <img src='http://windowsil.org/latexrender/pictures/182b20325cde6e52bca8eb3a03388b50.gif' title='$(R_1^G,R_2^G)$' alt='$(R_1^G,R_2^G)$' align=absmiddle> obtained with Gaussian signaling for DAMIMO-BC.<br />
Then using the proportionality and rate preservation properties, it is shown that any rate vector which does not belong to <img src='http://windowsil.org/latexrender/pictures/861f06c70c735efbd1bb9ae4cdac5721.gif' title='$R^G$' alt='$R^G$' align=absmiddle> is not achievable on the enhanced DAMIMO-BC, using Bergmans proof for SISODBC. An important point to note here is that the Bergmans proof works<br />
because of the proportionality property, which is hard to show for DAMIMO-BC. Since the capacity region of DAMIMO-BC is contained inside the capacity region of enhanced DAMIMO-BC, it follows that any rate vector which does not belong to <img src='http://windowsil.org/latexrender/pictures/861f06c70c735efbd1bb9ae4cdac5721.gif' title='$R^G$' alt='$R^G$' align=absmiddle> is not achievable and thus Gaussian signaling is optimal.</p>
<p>Coming back to the original AMIMO-BC, to show that DPC is optimal, the authors show that any rate vector which lies outside the region <img src='http://windowsil.org/latexrender/pictures/0cecd5df2445e405d82cef363859e209.gif' title='$R^{DPC}$' alt='$R^{DPC}$' align=absmiddle> also lies outside the capacity region. Toward that end, it is shown that for any vector <img src='http://windowsil.org/latexrender/pictures/ae920e366ec10aec22dc42f80cf5c34d.gif' title='${\bf R}$' alt='${\bf R}$' align=absmiddle> which lies outside the region <img src='http://windowsil.org/latexrender/pictures/0cecd5df2445e405d82cef363859e209.gif' title='$R^{DPC}$' alt='$R^{DPC}$' align=absmiddle> there exists an enhanced DAMIMO-BC whose capacity region contains the capacity region of AMIMO-BC, but does not contain <img src='http://windowsil.org/latexrender/pictures/ae920e366ec10aec22dc42f80cf5c34d.gif' title='${\bf R}$' alt='${\bf R}$' align=absmiddle>. Recall that we found out the capacity region of enhanced DAMIMO-BC and showed that Gaussian signaling is optimal, thus it follows that any rate vector <img src='http://windowsil.org/latexrender/pictures/ae920e366ec10aec22dc42f80cf5c34d.gif' title='${\bf R}$' alt='${\bf R}$' align=absmiddle> which lies outside the region <img src='http://windowsil.org/latexrender/pictures/0cecd5df2445e405d82cef363859e209.gif' title='$R^{DPC}$' alt='$R^{DPC}$' align=absmiddle> also lies outside of the capacity region of AMIMO-BC and we conclude that DPC is the optimal transmission strategy.
</p>
]]></content:encoded>
			<wfw:commentRSS>http://windowsil.org/2008/02/12/overwiew-of-mimo-broadcast-channel-capacity-result/feed/</wfw:commentRSS>
		</item>
		<item>
		<title>Write a good paper or file a good patent? Or both?</title>
		<link>http://windowsil.org/2008/02/07/write-a-good-paper-or-file-a-good-patent-or-both/</link>
		<comments>http://windowsil.org/2008/02/07/write-a-good-paper-or-file-a-good-patent-or-both/#comments</comments>
		<pubDate>Thu, 07 Feb 2008 05:37:21 +0000</pubDate>
		<dc:creator>Insoo Hwang</dc:creator>
		
	<category>Miscellaneous</category>
		<guid isPermaLink="false">http://windowsil.org/2008/02/07/write-a-good-paper-or-file-a-good-patent-or-both/</guid>
		<description><![CDATA[As a grad student and possibly a system engineer in the near future, I have been thinking about the importance between the two: writing a good paper or filing a good patent? If you are capable of doing both, what is your choice?
Writing a patent is quite different from writing a paper. A good paper [...]]]></description>
			<content:encoded><![CDATA[<p>As a grad student and possibly a system engineer in the near future, I have been thinking about the importance between the two: writing a good paper or filing a good patent? If you are capable of doing both, what is your choice?</p>
<p>Writing a patent is quite different from writing a paper. A good paper should have a clear derivation of a good algorithm that has never been proven before. It should be academically challenging, mathematically tractable &amp; reversible and conceptually innovative. A good example is Teletar’s MIMO capacity paper, Zheng &amp; Tse&#8217;s D-MG tradeoff paper and the GLP paper by Dr. Love and Dr. Heath.</p>
<p>A good patent, however, is quite different. A good patent should have broad (as broad as possible) claims which are important in implementing and making real systems / devices. It focuses on new concepts, new methods and new apparatus that have never been claimed before. A good example of it is a series of handover patents by Qualcomm. Qualcomm’s MAHO (mobile assisted handover) patent and so called “501” (soft handover) patents has the following first claims:<br />
&#8212;&#8212;&#8211;<br />
[MAHO] 1. A method of mobile assisted handoff in a cellular communication system comprising a plurality of mobile stations and a land system and a plurality of cells, comprising the steps of:<br />
assigning a mobile station a list of cells to measure, wherein said list is divided into two sections, a steady section and an alternating section;<br />
measuring quality level of each assigned cell;<br />
reporting said quality levels to said land system;<br />
transferring a cell from the alternating section of the list to the steady section of the list when said cell has a quality level higher than one of the cells in the steady section, wherein the cell with the lowest quality level in the steady section is transferred to said alternating section; and<br />
changing said cells listed in said alternating section every predetermined period of time.<br />
<a href="http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO1&amp;Sect2=HITOFF&amp;d=PALL&amp;p=1&amp;u=%2Fnetahtml%2FPTO%2Fsrchnum.htm&amp;r=1&amp;f=G&amp;l=50&amp;s1=5701585.PN.&amp;OS=PN/5701585&amp;RS=PN/5701585">[link]<br />
</a></p>
<p>[501] 1. In a cellular telephone system in which a mobile system user and another system user communicate user information signals therebetween via at least one of a plurality of geographically separated cell-sites each defining a respective geographic service area, a system for directing communications between said mobile system user and said another system user via said at least one of said plurality of cell-sites as said mobile system user changes cell-site service areas, comprising:<br />
means for, while said mobile system user is in a service area of one cell-site and communicating user information signals with said another system user via said one cell-site, determining a transition of said mobile system user from said one cell-site service area to a service area of another cell-site, and for providing a handoff request identifying said another cell-site;<br />
means responsive to said handoff request for coupling a communication of said user information signals between said mobile system user and said another system user via said another cell-site while said mobile system user and said another system user continue in communication of said user information signals via said one cell-site such that said mobile system user and said another system user concurrently communicate said user information signals through said one cell-site and said another cell-site; and<br />
means responsive to said coupling of communication of said user information signals between said mobile system user and said another system user via said another cell-site for terminating said communication of said user information signals between said mobile system user and said another system user via said one cell-site with said communication of said user information signals continuing between said mobile system user and said another system user via said another cell-site.<br />
<a href="http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO1&amp;Sect2=HITOFF&amp;d=PALL&amp;p=1&amp;u=%2Fnetahtml%2FPTO%2Fsrchnum.htm&amp;r=1&amp;f=G&amp;l=50&amp;s1=5101501.PN.&amp;OS=PN/5101501&amp;RS=PN/5101501">[link]<br />
</a><br />
&#8212;&#8212;&#8211;<br />
As you see, MAHO and ‘501’ patents contain almost every possible method for the soft handover (SO) and mobile assisted handover (MAHO). It means that if you build a system with handover algorithms at cell edge, you have to design a system without SO and MAHO, to avoid those patents. You can’t either receive two pilot sequences from two base stations simultaneously, or compare the signal strength at the mobile side between the two. Then, what can you do? Will you pay millions of dollars to the legal owner of it, or try not to use both SO and MAHO?</p>
<p>This is the main reason why the WiMAX system uses only hard handover (HO) and why the cell edge performance of that system doesn’t quite good. Another bad new is that even SO and MAHO was flied in 1992 and 1994 respectively (the patent right is valid for 15 years) there are tons of patents which covers another aspect of SO and MAHO. It will be the same in CDMA, LDPC, and probably MIMO.</p>
<p>As explained above, a well-written patent influence on the whole system design. In addition, it presents a huge amount of money to the legal owner (usually a company) and to the inventor (as some form of incentives). For example, Samsung pays about several hundred million dollars to Qualcomm as the CDMA patent right PER YEAR. And when they make a cell phone, they must use Qualcomm’s MSM chip and pay 5.25% - 5.75% of whole retail price as a royalty. Samsung makes at least 100 million cellphones per year.. imagine the amount of money that the CDMA patent makes. Yes, it is quite huge, and a little part of it (which is given to the inventor) is also huge.</p>
<p>The reason that I am writing this article is not to debase the importance of writing a good paper. I think it is one of the most important things to do as a grad student. (Especially the best paper award is a life-long honor. Isn’t it, Kaibin, Ramya, Chan-Byoung?) But it could be better, if you think about filing a patent for your brilliant idea BEFORE you submit it as a paper. (Usually if a thing is already presented and published before, it can’t be the claim of a patent.) You could be a millionaire, or if not so, there is nothing to lose.</p>
<p>I think a good patent may not guarantees a good paper. But a good paper may guarantees a good patent, because the patent can scale down the novel idea in the paper into a practical method and apparatus. One good example is the Alamouti Code. S. Alamouti and V. Tarokh have filed a patent (US 6185258) in Sep. 16, 1997, just before they submit the famous Alamoti code paper.<br />
&#8212;&#8212;&#8211;<br />
[Alamoti] 1. An arrangement comprising:<br />
a coder responsive to incoming symbols, forming a set of channel symbols that incorporate redundancy, where the coder employs replications and, at least for some of the channel symbols, forms a negative of an incoming symbol, forms a complex conjugate of an incoming symbol, or forms a negative complex conjugate of an incoming symbol; and<br />
an output stage that applies said channel symbols to at least one transmitter antenna to form at least two distinct channels over a transmission medium.<br />
<a href="http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO1&amp;Sect2=HITOFF&amp;d=PALL&amp;p=1&amp;u=%2Fnetahtml%2FPTO%2Fsrchnum.htm&amp;r=1&amp;f=G&amp;l=50&amp;s1=6185258.PN.&amp;OS=PN/6185258&amp;RS=PN/6185258">[link]<br />
</a><br />
&#8212;&#8212;&#8211;</p>
<p>As you see in the first claim above, technically any diversity based STBC may infringe their right. It is really terrifying. And it is more terrifying if I can find a patent that has a claim like this: “a device that uses multiple transmit antennas and multiple receive antennas for communication.” It will be all MIMO companies’ nightmare.
</p>
]]></content:encoded>
			<wfw:commentRSS>http://windowsil.org/2008/02/07/write-a-good-paper-or-file-a-good-patent-or-both/feed/</wfw:commentRSS>
		</item>
		<item>
		<title>The Gold Prize</title>
		<link>http://windowsil.org/2008/02/04/the-gold-prize/</link>
		<comments>http://windowsil.org/2008/02/04/the-gold-prize/#comments</comments>
		<pubDate>Mon, 04 Feb 2008 22:36:11 +0000</pubDate>
		<dc:creator>Chan-Byoung Chae</dc:creator>
		
	<category>Miscellaneous</category>
		<guid isPermaLink="false">http://windowsil.org/2008/02/04/the-gold-prize/</guid>
		<description><![CDATA[As you may know, I was out of town last week and got back to Austin last Saturday. I&#8217;m rather inclined to doubt it but I was awarded the Gold Prize in the 2007 humantech paper contest sponsored by Samsung.
The contest receives about 900 submissions every year in fields like including signal processing, analog circuit [...]]]></description>
			<content:encoded><![CDATA[<p>As you may know, I was out of town last week and got back to Austin last Saturday. I&#8217;m rather inclined to doubt it but I was awarded the Gold Prize in the 2007 humantech paper contest sponsored by Samsung.</p>
<p>The contest receives about 900 submissions every year in fields like including signal processing, analog circuit design, communications and networking, computer science, computer engineering, mechanical engineering, material science and process, physical devices, and physical science. Only six students are awarded the Gold prize annually, and thirty four graduate students share the Silver, Bronze and honor prizes.  There was only one Gold prize winner in the communications &amp; networking area in the last five years.</p>
<p>I&#8217;ve never been awarded this kind of big prize in my life. Anyway, I will treat you guys soon.
</p>
]]></content:encoded>
			<wfw:commentRSS>http://windowsil.org/2008/02/04/the-gold-prize/feed/</wfw:commentRSS>
		</item>
		<item>
		<title>V2V Communications in Japan</title>
		<link>http://windowsil.org/2008/02/04/v2v-communications-in-japan/</link>
		<comments>http://windowsil.org/2008/02/04/v2v-communications-in-japan/#comments</comments>
		<pubDate>Mon, 04 Feb 2008 21:15:10 +0000</pubDate>
		<dc:creator>Takao Inoue</dc:creator>
		
	<category>Miscellaneous</category>
		<guid isPermaLink="false">http://windowsil.org/2008/02/04/v2v-communications-in-japan/</guid>
		<description><![CDATA[Recently, there has been increased discussion on Vehicle-to-Vehicle (V2V) communications. I find this area to be interesting and challenging to the wireless engineer because it opens a completely new field for radio environment, demands, application, etc. (Yes, systems like trunked radio has been around for few decades but I assume we&#8217;re talking more than a [...]]]></description>
			<content:encoded><![CDATA[<p>Recently, there has been increased discussion on Vehicle-to-Vehicle (V2V) communications. I find this area to be interesting and challenging to the wireless engineer because it opens a completely new field for radio environment, demands, application, etc. (Yes, systems like trunked radio has been around for few decades but I assume we&#8217;re talking more than a simple FM system.) Since vehicles are central to our lives, especially in the US, this is probably the best place for applications to emerge. Being a gearhead certainly adds to my interest.</p>
<p>I cannot say that I fully follow the V2V activities, but the following news caught my attention which seems to indicate that there is a strong movement towards V2V communication and ITS in Japan.</p>
<p>On Feb. 4, 2008, Denso announced the beginning of Vehicle-to-Vehicle communication tests on public roads in Japan (see <a href="http://www.denso.co.jp/en/newsreleases/080204-01.html">press release here</a>). It uses 669 - 679 MHz UHF and 5.8GHz band <a title="DSRC" href="http://en.wikipedia.org/wiki/Dedicated_Short_Range_Communications">DSRC.</a> The V2V communication is apparently part of the Japanese Ministry of Internal Affairs and Communications&#8217; initiative &#8220;Ubiquitous ITS&#8221;, which includes digital video broadcast (or VICS, vehicle information and communication system), 60-76GHz mm-wave sensor application, cellular service, short range applications (expressway tollgates, DSRC, wireless service transaction, etc).</p>
<p>The reason for using 669-679MHz above is only to avoid interference with the TV broadcast in the 700MHz band, of which 715-725MHz is expected to open for ITS use in 2011 when the analog TV broadcast goes off air in the 700MHz band.</p>
<p>Some interesting areas of ITS are identified here at the <a title="ITS Japan Website" href="http://www.its-jp.org/english/about_e/develop.htm">ITS Japan website</a>.Traditional wireless systems (cellular, WiFi, etc) has always had a  clear demand: cellular service to provide bidirectional voice services, and WiFi to provide fast download and so-so upload.  For ITS, at least to me, it is not clear what kind of data traffics are needed, that is to say, what type of wireless technologies should be used to support the service. Look at it another way, this area is wide open with possible applications, technologies to support it, and perhaps new business models.</p>
<p>So I thought it would be interesting to throw out a question: What can we do in ITS?</p>
<p>Does MIMO enable certain applications? Or will new applications drive towards new technology?</p>
<p>Some links for further reading:</p>
<ul>
<li><a title="US DoT ITS" href="http://www.its.dot.gov/">US DoT ITS page</a></li>
<li><a title="ITS of America" href="http://www.itsa.org/">ITS of America</a></li>
<li><a title="ITS Japan" href="http://www.its-jp.org/english/">ITS Japan</a></li>
<li><a title="ERTICO" href="http://www.ertico.com/en/home.htm">ERTICO: ITS Europe</a></li>
</ul>
]]></content:encoded>
			<wfw:commentRSS>http://windowsil.org/2008/02/04/v2v-communications-in-japan/feed/</wfw:commentRSS>
		</item>
		<item>
		<title>Automated Theorem Prover</title>
		<link>http://windowsil.org/2008/01/31/automated-theorem-prover/</link>
		<comments>http://windowsil.org/2008/01/31/automated-theorem-prover/#comments</comments>
		<pubDate>Thu, 31 Jan 2008 17:57:34 +0000</pubDate>
		<dc:creator>Rahul Vaze</dc:creator>
		
	<category>Miscellaneous</category>
		<guid isPermaLink="false">http://windowsil.org/2008/01/31/automated-theorem-prover/</guid>
		<description><![CDATA[Ever wondered what does it take to construct a proof for a theorem, in my mind a lot of hard work, mathematical ability and sometimes stroke of luck.  However things are generally not that simple, at times figuring out a proof can drive you nuts, make you crazy, especially if the statement of theorem [...]]]></description>
			<content:encoded><![CDATA[<p>Ever wondered what does it take to construct a proof for a theorem, in my mind a lot of hard work, mathematical ability and sometimes stroke of luck.  However things are generally not that simple, at times figuring out a proof can drive you nuts, make you crazy, especially if the statement of theorem looks obvious.  To relieve us from the misery of figuring out a proof people are developing automated theorem provers and in future we might just have to type in some equations into a software and boom it gives a proof out.</p>
<p>For a preliminary solver, check out <a href="http://golem.ph.utexas.edu/category/2007/04/automated_theorem_proving.html">this link</a>.</p>
]]></content:encoded>
			<wfw:commentRSS>http://windowsil.org/2008/01/31/automated-theorem-prover/feed/</wfw:commentRSS>
		</item>
		<item>
		<title>Part I : Introduction to antenna design in cellular systems</title>
		<link>http://windowsil.org/2008/01/22/antenna-design-in-cellular-systems/</link>
		<comments>http://windowsil.org/2008/01/22/antenna-design-in-cellular-systems/#comments</comments>
		<pubDate>Wed, 23 Jan 2008 04:12:34 +0000</pubDate>
		<dc:creator>Ramya Bhagavatula</dc:creator>
		
	<category>Miscellaneous</category>
		<guid isPermaLink="false">http://windowsil.org/2008/01/22/antenna-design-in-cellular-systems/</guid>
		<description><![CDATA[I have received a lot of questions on MIMO antenna design and how it applies to cellular systems. I hope this (long overdue) blog post helps motivate the need for antenna design in cellular systems and answer some common questions regarding the challenges faced by antenna designers. The details of antenna design, especially for base [...]]]></description>
			<content:encoded><![CDATA[<p>I have received a lot of questions on MIMO antenna design and how it applies to cellular systems. I hope this (long overdue) blog post helps motivate the need for antenna design in cellular systems and answer some common questions regarding the challenges faced by antenna designers. The details of antenna design, especially for base stations, will be discussed in a future blog post.<br />
So here goes &#8230;.</p>
<p>&#8216;Antenna design for cellular systems&#8217; is a very broad and generic term. I would like to point out here that antenna design requirements and capabilities for base stations and mobile terminals are very different. Let us start with the requirements of a base station antenna. First of all, it needs to be directional, i.e. the antenna should have a high gain in the direction facing cellular sector being illuminated, as shown in Fig. 1(a). Secondly, the major beam of the antenna should not be parallel to the ground. It should be tilted down slightly to ensure that the users on the ground get coverage (see Fig. 1(b)). The third requirement deals with the space occupied by a base station antenna. It is widely assumed that we can afford to have more antenna elements, larger inter-element spacing between the elements, and broadly speaking, larger antenna elements as compared to the receiver (mobile terminal). However, this is not completely true. As cellular service providers and base station antenna manufacturers will tell you, it is very expensive to mount antennas on towers, rooftops, etc. The cost can range from anything between $500 - $3000 a month. Sometimes, the charge is on the basis of the sq. footage or antenna units mounted. Hence, the all-so-common assumption of having any number of antenna elements on the base station side, separated by large inter-element spacings is actually quite impractical. This is where antenna design comes into picture. Our aim is to try and design base station antennas that satisfy all the above mentioned requirements, while ensuring that performance is not affected. When we say performance, we mean the average data rates obtained in the cell and the outage probabilities that a base station antenna design will yield.</p>
<p><img alt="fig1" src="http://windowsil.org/wp-content/uploads/2008/01/fig1.PNG" /><br />
Fig 1: Directional base station antennas.</p>
<p>Now we come to the part where MIMO fits into all this. Current (single antenna) cellular technologies like CDMA, GSM, EDGE etc. cannot support the growing number of cellular service users, coupled with the large demand for high data rate applications. Cellular service providers are now looking to MIMO as a solution to meet this demand for high data rates. The inclusion of MIMO in standards like WiMAX and 3GPP-LTE has increased pressure on the cellular service providers to make the shift (and make it soon). The only problem that the providers have with making this shift is that it might require that the transceivers at the base stations be upgraded to support MIMO. It is not clear if the base station antennas should be changed or if the existing setup will suffice for MIMO as well. We in WSIL are currently investigating if the existing base station antenna designs will work well for MIMO. This will make the transition for cellular service providers a whole lot easier.</p>
<p>Coming now to the mobile terminals. These devices, as we well know, are placed and held at random orientations. This implies that the antenna used should be such that it can receive (and transmit) equally well in all directions. This is the first requirement for antennas for a mobile terminal. Note that omnidirectional antennas generally do not perform as well as directional antennas, making this a challenge for the antenna designer. The second requirement for the mobile terminal antenna is that it should occupy as little space as possible. This is where low profile microstrip (patch) antennas, planar inverted-F antennas (PIFAs), etc. come into picture. Note that these are embedded antennas, whereas the earlier models of cell phones used whip, retractables, etc. The third requirement is that the cell phone antenna should be able to support a large number of functions apart from just supporting phone calls, like FM or bluetooth, for example. This requires that the antenna used should be a multi-band antenna supporting all the frequencies needed or that we use different antennas for each frequency. It is obvious that the single antenna is a much better option, both in terms of cost and space occupied. Designing multi-band antennas is a challenge for the designer if the number of bands to be supported is greater than two. The larger the number of frequencies required, the greater the difficulty in design. </p>
<p>I will conclude with a brief statement on why cellular antenna design is important. An antenna designer spends a lot of time and effort trying to optimize antenna parameters like cross-pol pattern discrimination, the port-to-port isolation, etc. These parameters need to be optimized by (in some cases) minutely tweaking the physical structure of the antenna. This process can at times take days to accomplish. By using effective antenna design techniques, we can optimize these parameters using simulations and can give a conservative estimate beyond which the performance will not be affected. This in turn, saves time and effort (and money!).</p>
<p>That&#8217;s it for now. I will post another blog on some details of antenna design and, in particular, the work we do in WSIL on this topic.
</p>
]]></content:encoded>
			<wfw:commentRSS>http://windowsil.org/2008/01/22/antenna-design-in-cellular-systems/feed/</wfw:commentRSS>
		</item>
		<item>
		<title>Food for the Eyes</title>
		<link>http://windowsil.org/2008/01/22/food-for-the-eyes/</link>
		<comments>http://windowsil.org/2008/01/22/food-for-the-eyes/#comments</comments>
		<pubDate>Wed, 23 Jan 2008 02:13:30 +0000</pubDate>
		<dc:creator>Takao Inoue</dc:creator>
		
	<category>Miscellaneous</category>
		<guid isPermaLink="false">http://windowsil.org/2008/01/22/food-for-the-eyes/</guid>
		<description><![CDATA[Slightly off topic&#8230; I came across this news today. A cool application of MEMS sure to fire up some imagination or vision!?
The news article here

We&#8217;ve all seen something similar in some SciFi movie. Imagine the things you can do. Connect wirelessly to display information about your location within your vision, a cheat sheet display for [...]]]></description>
			<content:encoded><![CDATA[<p>Slightly off topic&#8230; I came across this news today. A cool application of MEMS sure to fire up some imagination or vision!?</p>
<p><a title="The news article" href="http://uwnews.washington.edu/ni/article.asp?articleID=39094">The news article here<br />
</a></p>
<p>We&#8217;ve all seen something similar in some SciFi movie. Imagine the things you can do. Connect wirelessly to display information about your location within your vision, a cheat sheet display for your next big talk, etc&#8230;</p>
<p>Unfortunately, it appears that there is no clean way to feed power and information signal to it other having a wire dangling from your eyes (ouch!). Maybe a RFID-like passive display could be of immediate use.</p>
<p>To give a MIMO flavor, maybe some form of MIMO visual communication is possible&#8230;
</p>
]]></content:encoded>
			<wfw:commentRSS>http://windowsil.org/2008/01/22/food-for-the-eyes/feed/</wfw:commentRSS>
		</item>
	</channel>
</rss>
