<?xml version="1.0" encoding="utf-8" standalone="no"?>
<!DOCTYPE document PUBLIC "-//CNX//DTD CNXML 0.5 plus MathML//EN" "http://cnx.rice.edu/cnxml/0.5/DTD/cnxml_mathml.dtd">
<document xmlns="http://cnx.rice.edu/cnxml" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:bib="http://bibtexml.sf.net/" id="m0007">

  <name xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Linear and Time-Invariant Systems</name>

<metadata xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">
  <md:version xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">2.5</md:version>
  <md:created xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">2000/06/26</md:created>
  <md:revised xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">2004/08/10 08:44:48.265 GMT-5</md:revised>
  <md:authorlist xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">
      <md:author xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" id="dhj">
      <md:firstname xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Don</md:firstname>
      
      <md:surname xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Johnson</md:surname>
      <md:email xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">dhj@rice.edu</md:email>
    </md:author>
  </md:authorlist>

  <md:maintainerlist xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">
    <md:maintainer xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" id="dhj">
      <md:firstname xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Don</md:firstname>
      
      <md:surname xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Johnson</md:surname>
      <md:email xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">dhj@rice.edu</md:email>
    </md:maintainer>
    <md:maintainer xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" id="rha">
      <md:firstname xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Roy</md:firstname>
      
      <md:surname xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Ha</md:surname>
      <md:email xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">rha@rice.edu</md:email>
    </md:maintainer>
  </md:maintainerlist>
  
  <md:keywordlist xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">
    <md:keyword xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">linear</md:keyword>
    <md:keyword xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">time-invariant</md:keyword>
  </md:keywordlist>

  <md:abstract xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Linear time-invariant (LTI) systems are the most important class of systems in communications. They ensure that a system acting on a signal can be modeled by the system acting individually on the component parts of the signal and summed.</md:abstract>
</metadata>
<content xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">


  <para xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" id="para1"> 
    A signal's complexity is not related to how wiggly it is. Rather, a signal 
    expert looks for ways of decomposing a given signal into a  <emphasis xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">sum of 
    simpler signals</emphasis>, which we term the <term xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">signal decomposition</term>. 
    Though we will never compute a signal's complexity, it essentially equals the 
    number of terms in its decomposition. In writing a signal as a sum of component 
    signals, we can change the component signal's gain by multiplying it by a constant 
    and by delaying it. More complicated decompositions could contain derivatives 
    or integrals of simple signals. In short, signal decomposition amounts to 
    thinking of the signal as the output of a linear system having simple signals as 
    its inputs. We would build such a system, but envisioning the signal's components
    helps understand the signal's structure. Furthermore, you can readily compute a
    linear system's output to an input decomposed as a superposition of simple signals.
  </para>

  <example xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" id="ex1">  
    <para xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" id="paraex1">
      As an example of signal complexity, we can express the pulse  
      <m:math>
	<m:apply>
	  <m:ci type="fn">
	    <m:msub>
	      <m:mi>p</m:mi>
	      <m:mi>Δ</m:mi>
	    </m:msub>
	  </m:ci>
	  <m:ci>t</m:ci>
	</m:apply>
      </m:math>
      as a sum of delayed unit steps.  
      <equation xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" id="eq1"> 
	<m:math>
	  <m:apply>
	    <m:eq/>
	      <m:apply>
		<m:ci type="fn">
		  <m:msub>
		    <m:mi>p</m:mi>
		    <m:mi>Δ</m:mi>
		  </m:msub>
		</m:ci>
		<m:ci>t</m:ci>
	      </m:apply>
	      <m:apply>
		<m:minus/>
		<m:apply>
		    <m:ci type="fn">u</m:ci>
		  <m:ci>t</m:ci>
		</m:apply>
		<m:apply>
		    <m:ci type="fn">u</m:ci>
		  <m:apply>

		      <m:minus/>
			<m:ci>t</m:ci>
			<m:ci>Δ</m:ci>
		  </m:apply>
		</m:apply>

	      </m:apply>
	  </m:apply>
	</m:math>
      </equation>

      Thus, the pulse is a more complex signal than the step. Be that as it may,
      the pulse is very useful to us.
    </para>
  </example>


  <exercise xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" id="swsuper">
    <problem xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">
      <para xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" id="swsupera">
        Express a square wave having period   
        <m:math>
  	  <m:ci>T</m:ci>
        </m:math> and amplitude
        <m:math>
	  <m:ci>A</m:ci>
        </m:math>
        as a superposition of delayed and amplitude-scaled pulses.
      </para>
    </problem>

    <solution xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">
      <para xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" id="swsuperb">
        <m:math>
  	  <m:apply>
	    <m:eq/>
	      <m:apply>
	        <m:ci type="fn">sq</m:ci>
	        <m:ci>t</m:ci>
	      </m:apply>
	      <m:apply>
	        <m:sum/>
	        <m:bvar>
	   	  <m:ci>n</m:ci>
	        </m:bvar>
	        <m:lowlimit>
		  <m:apply>
		    <m:minus/>
		    <m:infinity/>
		  </m:apply>
		  </m:lowlimit>
	        <m:uplimit>
		  <m:infinity/>
	        </m:uplimit>
	         <m:apply>
		  <m:times/>
		  <m:apply>
		    <m:power/>
		      <m:apply>
		        <m:minus/>
		  	  <m:cn>1</m:cn>
		      </m:apply>
		      <m:ci>n</m:ci>
		  </m:apply>
		  <m:ci>A</m:ci>
		  <m:ci>
		    <m:msub>
		      <m:mi>p</m:mi>
		      <m:mi>T/2</m:mi>
		    </m:msub>
		  </m:ci>
		  <m:apply>
		    <m:minus/>
		      <m:ci>t</m:ci>
		      <m:apply>
		        <m:times/>
		  	  <m:ci>n</m:ci>
			  <m:apply>
			    <m:divide/>
			    <m:ci>T</m:ci>
			    <m:cn>2</m:cn>
			  </m:apply>
		      </m:apply>
		    </m:apply>
	        </m:apply>
	      </m:apply>
	  </m:apply>
        </m:math>
      </para>
    </solution>
  </exercise>

  <para xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" id="para2"> 
    Because the sinusoid is a superposition of two complex exponentials, the 
    sinusoid is more complex. We could not prevent ourselves from the pun in 
    this statement. Clearly, the word "complex" is used in two different ways 
    here. The complex exponential can also be written (using <cnxn xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" document="m0004" target="3" strength="5">Euler's relation</cnxn>) as a sum of a sine and a 
    cosine. We will discover that virtually every signal can be decomposed into a
    sum of complex exponentials, and that this decomposition is  <emphasis xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">very 
    </emphasis>useful. Thus, the complex exponential is more fundamental, and 
    Euler's relation does not adequately reveal its complexity.
  </para>

</content>
</document>
