<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Technick.net</title><link>https://technick.net/</link><description>Recent content on Technick.net</description><generator>Hugo</generator><language>en-gb</language><lastBuildDate>Tue, 09 May 2017 00:00:00 +0000</lastBuildDate><atom:link href="https://technick.net/index.xml" rel="self" type="application/rss+xml"/><item><title>Guides</title><link>https://technick.net/guides/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/</guid><description/></item><item><title>Search</title><link>https://technick.net/search/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/search/</guid><description/></item><item><title>Tools</title><link>https://technick.net/tools/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/tools/</guid><description/></item><item><title>Legal</title><link>https://technick.net/legal/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://technick.net/legal/</guid><description>&lt;h2&gt;Disclaimer&lt;/h2&gt;&#10;&#10;&lt;p&gt;&lt;strong&gt;Please be aware that any information you find on this website may be inaccurate, misleading or out of date.&lt;/strong&gt;&lt;/p&gt;&#10;&#10;&lt;p&gt;Some information on Technick.net may create a risk for readers who choose to apply or use it in their own activities, or who promote it for use by third parties. None of the authors or contributors connected with Technick.net can be held responsible, in any way whatsoever, for your use of the information contained in or linked from these pages.&lt;/p&gt;</description></item><item><title>JSON Editor</title><link>https://technick.net/tools/json-editor/</link><pubDate>Tue, 09 May 2017 00:00:00 +0000</pubDate><guid>https://technick.net/tools/json-editor/</guid><description>&lt;link href="https://netdna.bootstrapcdn.com/bootstrap/3.0.3/css/bootstrap.min.css" rel="stylesheet" type="text/css" /&gt;&#10;&lt;link href="https://cdnjs.cloudflare.com/ajax/libs/font-awesome/3.2.1/css/font-awesome.css" rel="stylesheet" type="text/css" /&gt;&#10;&lt;link href="https://technick.net/css/jsoneditor.css" rel="stylesheet" type="text/css" /&gt;&#10;&lt;script type="text/javascript" src="https://technick.net/js/jsoneditor.js"&gt;&lt;/script&gt;&#10;&lt;div&gt;&#10;&lt;div class="row"&gt;&#10;&lt;div class="span8 col-md-8 columns eight large-8"&gt;&#10;&lt;h1&gt;JSON Editor&lt;/h1&gt;&#10;&lt;div&gt;&#10;&lt;div class="fileUpload btn btn-primary"&gt;&#10;&lt;span&gt;Load JSON Schema&lt;/span&gt;&#10;&lt;input id="schemaFile" type="file" class="upload" title="Load the JSON schema file" /&gt;&#10;&lt;/div&gt;&#10;&lt;textarea id="schema" style="display:none;"&gt;&lt;/textarea&gt;&#10;&lt;/div&gt;&#10;&lt;div id="editor"&gt;&lt;/div&gt;&#10;&lt;/div&gt;&#10;&lt;div id="result" class="span4 col-md-4 columns four large-4"&gt;&#10;&lt;h2&gt;Validation&lt;/h2&gt;&#10;&lt;p&gt;This will update whenever the form changes to show validation errors if there are any.&lt;/p&gt;&#10;&lt;div&gt;&lt;pre id="validate"&gt;&lt;/pre&gt;&lt;/div&gt;&#10;&lt;h2&gt;JSON Output&lt;/h2&gt;&#10;&lt;p&gt;You can also make changes directly to the JSON here.&lt;/p&gt;&#10;&lt;div&gt;&#10;&lt;div class="fileUpload btn btn-primary"&gt;&#10;&lt;span&gt;Load&lt;/span&gt;&#10;&lt;input id="jsonFile" type="file" class="upload" title="Load the configuration file" /&gt;&#10;&lt;/div&gt;&#10;&lt;button id="save" type="button" value="save" class="btn btn-primary" title="Save the configuration file"&gt;Save&lt;/button&gt;&#10;&lt;/div&gt;&#10;&lt;textarea id="output"&gt;&lt;/textarea&gt;&#10;&lt;/div&gt;&#10;&lt;/div&gt;&#10;&lt;/div&gt;&#10;&lt;script type="text/javascript" src="https://technick.net/js/jsedit.js"&gt;&lt;/script&gt;</description></item><item><title>AWG to Metric Converter</title><link>https://technick.net/tools/awg-to-metric-converter/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/tools/awg-to-metric-converter/</guid><description>&lt;form action="" method="get" name="awgform" id="awgform"&gt;&#10;&#9;&lt;table class="toolform" border="0" cellspacing="1" cellpadding="1"&gt;&#10;&#9;&#9;&lt;tr&gt;&#10;&#9;&#9;&#9;&lt;td align="right"&gt;AWG&lt;/td&gt;&#10;&#9;&#9;&#9;&lt;td&gt;&lt;input type="text" name="awg" size="20" /&gt;&lt;/td&gt;&#10;&#9;&#9;&lt;/tr&gt;&#10;&#9;&#9;&lt;tr&gt;&#10;&#9;&#9;&#9;&lt;td align="right"&gt;Temperature&lt;/td&gt;&#10;&#9;&#9;&#9;&lt;td&gt;&lt;input type="text" name="temperature" value="20" size="20" /&gt; [&amp;ordm;C]&lt;/td&gt;&#10;&#9;&#9;&lt;/tr&gt;&#10;&#9;&#9;&lt;tr&gt;&#10;&#9;&#9;&#9;&lt;td align="right"&gt;Material&lt;/td&gt;&#10;&#9;&#9;&#9;&lt;td&gt;&#10;&#9;&#9;&#9;&#9;&lt;select name="material" id="material" size="1"&gt;&#10;&#9;&#9;&#9;&#9;&#9;&lt;option value="Aluminium"&gt;Aluminium&lt;/option&gt;&#10;&#9;&#9;&#9;&#9;&#9;&lt;option value="Carbon"&gt;Carbon&lt;/option&gt;&#10;&#9;&#9;&#9;&#9;&#9;&lt;option value="Constantan"&gt;Constantan&lt;/option&gt;&#10;&#9;&#9;&#9;&#9;&#9;&lt;option value="Copper" selected="selected"&gt;Copper&lt;/option&gt;&#10;&#9;&#9;&#9;&#9;&#9;&lt;option value="Germanium"&gt;Germanium&lt;/option&gt;&#10;&#9;&#9;&#9;&#9;&#9;&lt;option value="Gold"&gt;Gold&lt;/option&gt;&#10;&#9;&#9;&#9;&#9;&#9;&lt;option value="Iron"&gt;Iron&lt;/option&gt;&#10;&#9;&#9;&#9;&#9;&#9;&lt;option value="Lead"&gt;Lead&lt;/option&gt;&#10;&#9;&#9;&#9;&#9;&#9;&lt;option value="Manganin"&gt;Manganin&lt;/option&gt;&#10;&#9;&#9;&#9;&#9;&#9;&lt;option value="Mercury"&gt;Mercury&lt;/option&gt;&#10;&#9;&#9;&#9;&#9;&#9;&lt;option value="Nichrome"&gt;Nichrome&lt;/option&gt;&#10;&#9;&#9;&#9;&#9;&#9;&lt;option value="Platinum"&gt;Platinum&lt;/option&gt;&#10;&#9;&#9;&#9;&#9;&#9;&lt;option value="Silicon"&gt;Silicon&lt;/option&gt;&#10;&#9;&#9;&#9;&#9;&#9;&lt;option value="Silver"&gt;Silver&lt;/option&gt;&#10;&#9;&#9;&#9;&#9;&#9;&lt;option value="Tin"&gt;Tin&lt;/option&gt;&#10;&#9;&#9;&#9;&#9;&#9;&lt;option value="Tungsten"&gt;Tungsten&lt;/option&gt;&#10;&#9;&#9;&#9;&#9;&lt;/select&gt;&#10;&#9;&#9;&#9;&lt;/td&gt;&#10;&#9;&#9;&lt;/tr&gt;&#10;&#9;&#9;&lt;tr&gt;&#10;&#9;&#9;&#9;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&#10;&#9;&#9;&#9;&lt;td&gt;&lt;br /&gt;&lt;b&gt;OUTPUT&lt;/b&gt;&lt;/td&gt;&#10;&#9;&#9;&lt;/tr&gt;&#10;&#9;&#9;&lt;tr&gt;&#10;&#9;&#9;&#9;&lt;td align="right"&gt;Copper Diameter&lt;/td&gt;&#10;&#9;&#9;&#9;&lt;td&gt;&lt;input type="text" name="diameter" size="20" readonly="readonly" /&gt; [mm]&lt;/td&gt;&#10;&#9;&#9;&lt;/tr&gt;&#10;&#9;&#9;&lt;tr&gt;&#10;&#9;&#9;&#9;&lt;td align="right"&gt;Copper Area&lt;/td&gt;&#10;&#9;&#9;&#9;&lt;td&gt;&lt;input type="text" name="area" size="20" readonly="readonly" /&gt; [mm&amp;sup2;]&lt;/td&gt;&#10;&#9;&#9;&lt;/tr&gt;&#10;&#9;&#9;&lt;tr&gt;&#10;&#9;&#9;&#9;&lt;td align="right"&gt;Resistance&lt;/td&gt;&#10;&#9;&#9;&#9;&lt;td&gt;&lt;input type="text" name="resistance" size="20" readonly="readonly" /&gt; [Ohm/m]&lt;/td&gt;&#10;&#9;&#9;&lt;/tr&gt;&#10;&#9;&#9;&lt;tr&gt;&#10;&#9;&#9;&#9;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&#10;&#9;&#9;&#9;&lt;td colspan="3"&gt;&#10;&#9;&#9;&#9;&#9;&lt;input name="Calculate" type="button" value="Calculate" onclick="CalculateAWG()" /&gt;&#10;&#9;&#9;&#9;&#9;&lt;input name="Reset" type="reset" value="Clear" /&gt;&#10;&#9;&#9;&#9;&lt;/td&gt;&#10;&#9;&#9;&lt;/tr&gt;&#10;&#9;&lt;/table&gt;&#10;&lt;/form&gt;&#10;&lt;p&gt;&lt;b&gt;Reference and sources:&lt;/b&gt;&lt;/p&gt;&#10;&lt;ul class="sources"&gt;&#10;&#9;&lt;li&gt;&lt;a href="http://www.geocities.com/CapeCanaveral/Lab/9643" target="_blank"&gt;Wire Parameter Calculator by Brad Suppanz&lt;/a&gt;&lt;/li&gt;&#10;&#9;&lt;li&gt;Temperature Coefficients of Resistivity&lt;/li&gt;&#10;&#9;&lt;li&gt;&lt;a href="http://en.wikipedia.org/wiki/Electrical_resistivity" target="_blank"&gt;Wikipedia: Resistivity&lt;/a&gt;&lt;/li&gt;&#10;&#9;&lt;li&gt;&lt;a href="http://en.wikipedia.org/wiki/American_wire_gauge"&gt;Wikipedia: American wire gauge&lt;/a&gt;&lt;/li&gt;&#10;&#9;&lt;li&gt;American Wire Gauge (AWG) &amp; Metric Wire Gauge Wire Sizes&lt;/li&gt;&#10;&#9;&lt;li&gt;Van den Hul: AWG to Metric Conversion Chart&lt;/li&gt;&#10;&lt;/ul&gt;&#10;&lt;script src="https://technick.net/js/awgcalc.js" type="text/javascript"&gt;&lt;/script&gt;</description></item><item><title>Electronics</title><link>https://technick.net/guides/electronics/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/</guid><description/></item><item><title>Hardware</title><link>https://technick.net/guides/hardware/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/</guid><description/></item><item><title>Inductance Calculator</title><link>https://technick.net/tools/inductance-calculator/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/tools/inductance-calculator/</guid><description>&lt;p&gt;&lt;b&gt;Select the box with the geometry that you would like to calculate.&lt;/b&gt;&lt;/p&gt;&#10;&lt;p&gt;&lt;table class="toolform" border="1" cellspacing="1" cellpadding="4"&gt;&lt;tr&gt;&lt;th colspan="5" bgcolor="#dbe7ff"&gt;Round-Wire geometries (loops of wire with various shapes)&lt;/th&gt;&lt;/tr&gt;&lt;tr&gt;&#10;&lt;td width="110px" align="center" valign="top"&gt;&lt;a href="https://technick.net/tools/inductance-calculator/circular-loop/"&gt;&lt;font size="1"&gt;Circular Loop&lt;/font&gt;&lt;br /&gt;&#10;&lt;br /&gt;&#10;&lt;img src="https://technick.net/img/util_inductance/util_inductance_circle.gif" width="100" height="100" border="0" alt="Circular Loop" /&gt;&lt;/a&gt;&lt;/td&gt;&#10;&lt;td width="110px" align="center" valign="top"&gt;&lt;a href="https://technick.net/tools/inductance-calculator/rectangular-loop"&gt;&lt;font size="1"&gt;Rectangular Loop&lt;/font&gt;&lt;br /&gt;&#10;&lt;br /&gt;&#10;&lt;img src="https://technick.net/img/util_inductance/util_inductance_rectangle.gif" width="100" height="67" border="0" alt="Rectangular Loop" /&gt;&lt;/a&gt;&lt;/td&gt;&#10;&lt;td width="110px" align="center" valign="top"&gt;&lt;a href="https://technick.net/tools/inductance-calculator/square-loop"&gt;&lt;font size="1"&gt;Square Loop&lt;/font&gt;&lt;br /&gt;&#10;&lt;br /&gt;&#10;&lt;img src="https://technick.net/img/util_inductance/util_inductance_square.gif" width="100" height="100" border="0" alt="Square Loop" /&gt;&lt;/a&gt;&lt;/td&gt;&#10;&lt;td width="110px" align="center" valign="top"&gt;&lt;a href="https://technick.net/tools/inductance-calculator/triangle-eq-loop"&gt;&lt;font size="1"&gt;Equilateral Triangle Loop&lt;/font&gt;&lt;br /&gt;&#10;&lt;br /&gt;&#10;&lt;img src="https://technick.net/img/util_inductance/util_inductance_triangle_eq.gif" width="100" height="92" border="0" alt="Equilateral Triangle Loop" /&gt;&lt;/a&gt;&lt;/td&gt;&#10;&lt;td width="110px" align="center" valign="top"&gt;&lt;a href="https://technick.net/tools/inductance-calculator/triangle-is-loop"&gt;&lt;font size="1"&gt;Isosceles Triangle Loop&lt;/font&gt;&lt;br /&gt;&#10;&lt;br /&gt;&#10;&lt;img src="https://technick.net/img/util_inductance/util_inductance_triangle_is.gif" width="70" height="100" border="0" alt="Isosceles Triangle Loop" /&gt;&lt;/a&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/p&gt;&#10;&lt;p&gt;&lt;table class="toolform" border="1" cellspacing="1" cellpadding="4"&gt;&lt;tr&gt;&lt;th colspan="5" bgcolor="#dbe7ff"&gt;Transmission Line geometries (cross sections)&lt;br /&gt;&#10;&lt;small&gt;the values calculated are the inductance per unit length&lt;/small&gt;&lt;/th&gt;&lt;/tr&gt;&lt;tr&gt;&#10;&lt;td width="110px" align="center" valign="top"&gt;&lt;a href="https://technick.net/tools/inductance-calculator/twin-lead"&gt;&lt;font size="1"&gt;Twin Lead&lt;/font&gt;&lt;br /&gt;&#10;&lt;br /&gt;&#10;&lt;img src="https://technick.net/img/util_inductance/util_inductance_wire_2.gif" width="100" height="46" border="0" alt="Twin Lead" /&gt;&lt;/a&gt;&lt;/td&gt;&#10;&lt;td width="110px" align="center" valign="top"&gt;&lt;a href="https://technick.net/tools/inductance-calculator/round-wire-over-ground-plane"&gt;&lt;font size="1"&gt;Round Wire over&lt;br /&gt;&#10; a Ground Plane &lt;/font&gt;&lt;br /&gt;&#10;&lt;br /&gt;&#10;&lt;img src="https://technick.net/img/util_inductance/util_inductance_wire_g.gif" width="100" height="100" border="0" alt="Round Wire over a Ground Plane " /&gt;&lt;/a&gt;&lt;/td&gt;&#10;&lt;td width="110px" align="center" valign="top"&gt;&lt;a href="https://technick.net/tools/inductance-calculator/vertically-spaced-traces"&gt;&lt;font size="1"&gt;Vertically Spaced Traces &lt;/font&gt;&lt;br /&gt;&#10;&lt;br /&gt;&#10;&lt;img src="https://technick.net/img/util_inductance/util_inductance_trace_v.gif" width="100" height="60" border="0" alt="Two Vertically Spaced Traces " /&gt;&lt;/a&gt;&lt;/td&gt;&#10;&lt;td width="110px" align="center" valign="top"&gt;&lt;a href="https://technick.net/tools/inductance-calculator/wide-trace-over-ground-plane"&gt;&lt;font size="1"&gt;Wide Trace over&lt;br /&gt;&#10; a Ground Plane &lt;/font&gt;&lt;br /&gt;&#10;&lt;br /&gt;&#10;&lt;img src="https://technick.net/img/util_inductance/util_inductance_trace_g.gif" width="100" height="75" border="0" alt="Wide Trace over Ground Plane " /&gt;&lt;/a&gt;&lt;/td&gt;&#10;&lt;td width="110px" align="center" valign="top"&gt;&lt;a href="https://technick.net/tools/inductance-calculator/coplanar-traces"&gt;&lt;font size="1"&gt;Coplanar Traces &lt;/font&gt;&lt;br /&gt;&#10;&lt;br /&gt;&#10;&lt;img src="https://technick.net/img/util_inductance/util_inductance_trace_h.gif" width="100" height="42" border="0" alt="Coplanar Traces " /&gt;&lt;/a&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/p&gt;</description></item><item><title>Morse Code Converter</title><link>https://technick.net/tools/morse-code-converter/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/tools/morse-code-converter/</guid><description>&lt;form name="morseform" id="morseform" method="GET"&gt;&lt;table class="toolform" border="0" cellspacing="0" cellpadding="0"&gt;&lt;tr&gt;&lt;th&gt;Alphanumeric&lt;/th&gt;&lt;th&gt;Morse Code&lt;/th&gt;&lt;/tr&gt;&lt;tr align="center"&gt;&lt;td&gt;&lt;textarea rows="5" cols="20" name="alphanumtxt" wrap="virtual"&gt;&lt;/textarea&gt;&lt;/td&gt;&lt;td&gt;&lt;textarea rows="5" cols="20" name="morsetxt" wrap="virtual"&gt;&lt;/textarea&gt;&lt;/td&gt;&lt;/tr&gt;&lt;tr align="center"&gt;&lt;td colspan="2"&gt;&lt;input name="Convert" type="button" value="Convert to Morse -&amp;gt;" onclick="Alpha2Morse()" /&gt;&lt;input name="Reset" type="Reset" value="Clear" /&gt;&lt;input name="Convert" type="button" value="&amp;lt;- Convert to Alpha" onclick="Morse2Alpha()" /&gt;&lt;/td&gt;&lt;/tr&gt;&lt;tr align="center"&gt;&lt;th colspan="2"&gt;&lt;br /&gt;Spelling&lt;/th&gt;&lt;/tr&gt;&lt;tr align="center"&gt;&lt;td colspan="2"&gt;&lt;textarea rows="4" cols="40" name="spelltxt" wrap="virtual"&gt;&lt;/textarea&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/form&gt;&#10;&lt;script language="JavaScript" src="https://technick.net/js/morseconv.js" type="text/javascript"&gt;&lt;/script&gt;</description></item><item><title>PCB Impedance and Capacitance Calculator</title><link>https://technick.net/tools/impedance-calculator/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/tools/impedance-calculator/</guid><description>&lt;p&gt;&lt;table class="toolform" border="1" cellspacing="1" cellpadding="4"&gt;&#10;&lt;tr&gt;&#10;&lt;th colspan="5" bgcolor="#dbe7ff"&gt;Select the box with the geometry that you would like to calculate.&lt;/th&gt;&lt;/tr&gt;&#10;&lt;tr&gt;&#10;&lt;td width="110px" align="center" valign="top"&gt;&lt;a href="https://technick.net/tools/impedance-calculator/microstrip"&gt;&lt;font size="1"&gt;Microstrip&lt;/font&gt;&lt;br /&gt;&#10;&lt;br /&gt;&#10;&lt;img src="https://technick.net/img/util_pcb_imp/util_pcb_imp_microstrip.gif" width="100" height="63" border="0" alt="Microstrip" /&gt;&lt;/a&gt;&lt;/td&gt;&#10;&lt;td width="110px" align="center" valign="top"&gt;&lt;a href="https://technick.net/tools/impedance-calculator/microstrip-embed"&gt;&lt;font size="1"&gt;Embedded Microstrip&lt;/font&gt;&lt;br /&gt;&#10;&lt;br /&gt;&#10;&lt;img src="https://technick.net/img/util_pcb_imp/util_pcb_imp_microstrip_embed.gif" width="100" height="73" border="0" alt="Embedded Microstrip" /&gt;&lt;/a&gt;&lt;/td&gt;&#10;&lt;td width="110px" align="center" valign="top"&gt;&lt;a href="https://technick.net/tools/impedance-calculator/stripline"&gt;&lt;font size="1"&gt;Stripline&lt;/font&gt;&lt;br /&gt;&#10;&lt;br /&gt;&#10;&lt;img src="https://technick.net/img/util_pcb_imp/util_pcb_imp_stripline.gif" width="100" height="78" border="0" alt="Stripline" /&gt;&lt;/a&gt;&lt;/td&gt;&#10;&lt;td width="110px" align="center" valign="top"&gt;&lt;a href="https://technick.net/tools/impedance-calculator/stripline-dual"&gt;&lt;font size="1"&gt;Dual Stripline&lt;/font&gt;&lt;br /&gt;&#10;&lt;br /&gt;&#10;&lt;img src="https://technick.net/img/util_pcb_imp/util_pcb_imp_stripline_dual.gif" width="100" height="100" border="0" alt="Dual Stripline" /&gt;&lt;/a&gt;&lt;/td&gt;&lt;/tr&gt;&#10;&lt;tr&gt;&#10;&lt;td width="110px" align="center" valign="top"&gt;&lt;a href="https://technick.net/tools/impedance-calculator/stripline-asym"&gt;&lt;font size="1"&gt;Asymmetric Stripline&lt;/font&gt;&lt;br /&gt;&#10;&lt;br /&gt;&#10;&lt;img src="https://technick.net/img/util_pcb_imp/util_pcb_imp_stripline_asym.gif" width="100" height="100" border="0" alt="Asymmetric Stripline" /&gt;&lt;/a&gt;&lt;/td&gt;&#10;&lt;td width="110px" align="center" valign="top"&gt;&lt;a href="https://technick.net/tools/impedance-calculator/microstrip-diff"&gt;&lt;font size="1"&gt;Differential Impedance of Microstrip&lt;/font&gt;&lt;br /&gt;&#10;&lt;br /&gt;&#10;&lt;img src="https://technick.net/img/util_pcb_imp/util_pcb_imp_microstrip_diff.gif" width="100" height="63" border="0" alt="Differential Impedance of Microstrip" /&gt;&lt;/a&gt;&lt;/td&gt;&#10;&lt;td width="110px" align="center" valign="top"&gt;&lt;a href="https://technick.net/tools/impedance-calculator/stripline-diff"&gt;&lt;font size="1"&gt;Differential Impedance of Stripline&lt;/font&gt;&lt;br /&gt;&#10;&lt;br /&gt;&#10;&lt;img src="https://technick.net/img/util_pcb_imp/util_pcb_imp_stripline_diff.gif" width="100" height="63" border="0" alt="Differential Impedance of Stripline" /&gt;&lt;/a&gt;&lt;/td&gt;&#10;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/p&gt;&lt;p&gt;THESE FORMULAS ARE APPROXIMATIONS!&lt;br /&gt;&#10;They should not be used when a high degree of accuracy is required.&lt;br /&gt;&#10;The approximate formulas are provided along with restrictions on the relative size of the various parameters.&lt;br /&gt;&#10;&lt;br /&gt;&#10;All the units are in SI (Iternational System):&lt;ul&gt;&lt;li&gt;[m] = meter&lt;/li&gt;&lt;li&gt;[s] = second&lt;/li&gt;&lt;li&gt;[H] = Henry&lt;/li&gt;&lt;li&gt;[F] = Farad&lt;/li&gt;&lt;/ul&gt;&lt;/p&gt;</description></item><item><title>Software</title><link>https://technick.net/guides/software/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/software/</guid><description/></item><item><title>Theory</title><link>https://technick.net/guides/theory/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/</guid><description/></item><item><title>Software Metrics</title><link>https://technick.net/guides/software/software_metrics/</link><pubDate>Tue, 23 Dec 2014 00:00:00 +0000</pubDate><guid>https://technick.net/guides/software/software_metrics/</guid><description>&lt;h2 id="introduction"&gt;Introduction&lt;/h2&gt;&#10;&lt;p&gt;Quantitative measurements are essential in all sciences, including computer science, as we can&amp;rsquo;t optimise what we can&amp;rsquo;t measure.&lt;/p&gt;&#10;&lt;p&gt;In this context the term &amp;ldquo;metric&amp;rdquo; and &amp;ldquo;measure&amp;rdquo; will be often used as synonymous, even if by definition metrics are functions, while measurements are the numbers obtained by the application of metrics.&lt;/p&gt;&#10;&lt;p&gt;Software metrics are used to record events taking place in the execution of a software program in order to obtain objective, reproducible and quantifiable measurements. These measures provide an audit trail that have numerous valuable applications, including understanding the activity, quality assurance testing, software debugging, software performance optimisation, cost estimation, budget planning, etc.&lt;/p&gt;</description></item><item><title>Software Naming</title><link>https://technick.net/guides/software/software_naming/</link><pubDate>Wed, 19 Nov 2014 00:00:00 +0000</pubDate><guid>https://technick.net/guides/software/software_naming/</guid><description>&lt;h2 id="introduction"&gt;Introduction&lt;/h2&gt;&#10;&lt;p&gt;Choosing a good name for a software project is a critical task, as it will be referenced multiple times in building pipelines, configurations, logs, documentation, deployment packages, software dependencies, emails, discussions, and early morning support calls.&lt;/p&gt;&#10;&lt;p&gt;To avoid common issues related to software names it is important to follow a convention that minimise incompatibilities between technologies, platforms and usage case scenarios.&lt;/p&gt;&#10;&lt;p&gt;Here is proposed a convention that works well in the aforementioned multiple situations.&lt;/p&gt;</description></item><item><title>Simple API JSON Response Format</title><link>https://technick.net/guides/software/software_json_api_format/</link><pubDate>Fri, 17 Oct 2014 00:00:00 +0000</pubDate><guid>https://technick.net/guides/software/software_json_api_format/</guid><description>&lt;h2 id="introduction"&gt;Introduction&lt;/h2&gt;&#10;&lt;p&gt;The &lt;em&gt;JavaScript Object Notation&lt;/em&gt; (&lt;a href="http://www.json.org"&gt;JSON&lt;/a&gt;) format is a widely adopted standard to deliver &lt;abbr title="HyperText Transfer Protocol"&gt;HTTP&lt;/abbr&gt; RESTful &lt;abbr title="Application Programming Interface"&gt;API&lt;/abbr&gt; responses. This mostly because of the following properties:&lt;/p&gt;&#10;&lt;ul&gt;&#10;&lt;li&gt;It is a standard &lt;a href="https://en.wikipedia.org/wiki/Open_format"&gt;open&lt;/a&gt; lightweight data-interchange format;&lt;/li&gt;&#10;&lt;li&gt;Along with &lt;abbr title="Extensible Markup Language"&gt;XML&lt;/abbr&gt; is the main format for data interchange used on the modern web;&lt;/li&gt;&#10;&lt;li&gt;It is easy for humans to read and write;&lt;/li&gt;&#10;&lt;li&gt;It is easy for machines to parse and generate;&lt;/li&gt;&#10;&lt;li&gt;Supports all the basic data types (numbers, strings, boolean, arrays and hashes);&lt;/li&gt;&#10;&lt;li&gt;It is developer-friendly, as it can be generated and parsed from almost any programming languages;&lt;/li&gt;&#10;&lt;li&gt;Popular databases (e.g. &lt;a href="https://www.mongodb.com/json-and-bson"&gt;MongoDB&lt;/a&gt;, &lt;a href="https://dev.mysql.com/doc/refman/5.7/en/json.html"&gt;MySQL&lt;/a&gt;, &lt;a href="https://www.postgresql.org/docs/9.5/static/datatype-json.html"&gt;PostgreSQL&lt;/a&gt;) can store the &lt;abbr title="JavaScript Object Notation"&gt;JSON&lt;/abbr&gt; format natively.&lt;/li&gt;&#10;&lt;/ul&gt;&#10;&lt;p&gt;Following a shared convention promotes reuse and helps increasing the productivity by leaving more time to focus on the actual development task. However, while there are many common patterns for structuring JSON-based HTTP/REST API responses, there is no consistency in things like naming or types of responses.&lt;/p&gt;</description></item><item><title>Software Configuration</title><link>https://technick.net/guides/software/software_configuration/</link><pubDate>Sat, 13 Sep 2014 00:00:00 +0000</pubDate><guid>https://technick.net/guides/software/software_configuration/</guid><description>&lt;h2 id="introduction"&gt;Introduction&lt;/h2&gt;&#10;&lt;p&gt;In this context for &amp;ldquo;configuration&amp;rdquo; we consider the set of initial parameter settings that are read at run-time by computer programs.&lt;/p&gt;&#10;&lt;p&gt;Traditionally the configuration data has been provided mostly in plain-text format but in recent years structured standards have gained more traction. This mostly because in modern distributed environments the configurations are often provided via a &lt;em&gt;Configuration Management System (&lt;abbr title="Content Management System"&gt;CMS&lt;/abbr&gt;)&lt;/em&gt;, transmitted via network and consumed by multiple applications, or multiple instances of the same application. Additionally, some of the configuration parameters are often automatically determined by the CMS instead of being manually entered by humans.&lt;/p&gt;</description></item><item><title>Software Logging Format</title><link>https://technick.net/guides/software/software_logging_format/</link><pubDate>Mon, 11 Aug 2014 00:00:00 +0000</pubDate><guid>https://technick.net/guides/software/software_logging_format/</guid><description>&lt;h2 id="introduction"&gt;Introduction&lt;/h2&gt;&#10;&lt;p&gt;Logs are used to record events taking place in the execution of a software program in order to provide an audit trail that can be used to understand the activity and diagnose problems.&lt;/p&gt;&#10;&lt;p&gt;In modern distributed environments the logs produced by multiple applications, or multiple instances of the same application, are often collected and processed in a single place. A typical stack involves the use of &lt;em&gt;Elasticsearch&lt;/em&gt;, &lt;em&gt;Logstash&lt;/em&gt; and &lt;em&gt;Kibana&lt;/em&gt; (&lt;em&gt;ELK&lt;/em&gt;).&#10;In this environments the first level consumer of the log messages is not anymore a human but a machine. This mostly because humans cannot process information in the massive flows that are created by concurrent and distributed systems.&#10;This poses new challenges when using traditional plain-text log formats designed for human consumption:&lt;/p&gt;</description></item><item><title>Build Software with Docker</title><link>https://technick.net/guides/software/software_docker_build/</link><pubDate>Mon, 07 Jul 2014 00:00:00 +0000</pubDate><guid>https://technick.net/guides/software/software_docker_build/</guid><description>&lt;h2 id="introduction"&gt;Introduction&lt;/h2&gt;&#10;&lt;p&gt;Two of the major requirements for a Continuous Integration/Delivery system (CI/CD) are:&lt;/p&gt;&#10;&lt;ul&gt;&#10;&lt;li&gt;&lt;strong&gt;Isolation&lt;/strong&gt;: the ability to run a well isolated environment from other builds executed on the same infrastructure;&lt;/li&gt;&#10;&lt;li&gt;&lt;strong&gt;Reproducibility&lt;/strong&gt; : the ability to reproduce the build environment from a pre-defined setup.&lt;/li&gt;&#10;&lt;/ul&gt;&#10;&lt;p&gt;These requirements also apply to local development environments, ensuring developers the ability of consistently reproduce building and testing processes.&lt;/p&gt;&#10;&lt;p&gt;A great way to bootstrap reproducible and isolated environments is using &lt;strong&gt;&lt;a href="https://www.docker.com/"&gt;Docker&lt;/a&gt; containers&lt;/strong&gt;.&lt;/p&gt;</description></item><item><title>Software Automation</title><link>https://technick.net/guides/software/software_automation/</link><pubDate>Thu, 05 Jun 2014 00:00:00 +0000</pubDate><guid>https://technick.net/guides/software/software_automation/</guid><description>&lt;h2 id="introduction"&gt;Introduction&lt;/h2&gt;&#10;&lt;p&gt;The software &lt;em&gt;development and deployment cycle&lt;/em&gt; usually involves numerous and tedious steps other than just &amp;ldquo;coding&amp;rdquo;. These steps often includes: &lt;em&gt;download dependencies, build with different options, run various static analysis tools to check if the project meets the minimum predefined set of quality metrics, execute unit tests and check code coverage, execute functional and other types of tests, generate documentation, packaging, etc.&lt;/em&gt;&lt;/p&gt;&#10;&lt;p&gt;The ability to run all the development steps easily and frequently in a consistent and automatic way is important to minimize human errors, improve the software quality and speeds up the whole development cycle.&lt;/p&gt;</description></item><item><title>Software Structure</title><link>https://technick.net/guides/software/software_structure/</link><pubDate>Sat, 03 May 2014 00:00:00 +0000</pubDate><guid>https://technick.net/guides/software/software_structure/</guid><description>&lt;p&gt;This document illustrates a portable directory structure for software projects to promote reusability and simplify the development cycle.&lt;/p&gt;&#10;&lt;p&gt;The software development and deployment cycle usually involves numerous and tedious steps other than just &amp;quot;coding&amp;quot;. Some steps can be automated by &lt;em&gt;Integration&lt;/em&gt; or &lt;em&gt;Continuous Delivery&lt;/em&gt; systems (&lt;em&gt;CI/CD&lt;/em&gt;), others needs to be performed frequently on the development machine before committing the code. Common development steps often includes: download dependencies, run various static analysis tools to check if the project meets the minimum predefined set of quality metrics, execute unit tests and check code coverage, execute functional and integration tests, check or generate documentation, etc.&lt;/p&gt;</description></item><item><title>Software Versioning</title><link>https://technick.net/guides/software/software_versioning/</link><pubDate>Wed, 02 Apr 2014 00:00:00 +0000</pubDate><guid>https://technick.net/guides/software/software_versioning/</guid><description>&lt;p&gt;This document illustrates a strategy used for versioning software projects that is portable across different languages and technologies.&lt;/p&gt;&#10;&lt;p&gt;Having a universal way of versioning software development projects is a good thing to help us keep track of what&amp;#39;s going on.&lt;/p&gt;&#10;&lt;p&gt;From Wikipedia (&lt;a href="https://en.wikipedia.org/wiki/Software_versioning"&gt;https://en.wikipedia.org/wiki/Software_versioning&lt;/a&gt;): &amp;quot;&lt;em&gt;Software versioning is the process of assigning either unique version names or unique version numbers to unique states of computer software. [...] Modern computer software is often tracked using two different software versioning schemes: an internal version number that may be incremented many times in a single day, such as a revision control number, and a released version that typically changes far less often, such as semantic versioning or a project code name.&lt;/em&gt;&amp;quot;&lt;/p&gt;</description></item><item><title>Formatting bytes in a spreadsheet cell</title><link>https://technick.net/guides/software/spreadsheet_byte_format/</link><pubDate>Sat, 01 Mar 2014 00:00:00 +0000</pubDate><guid>https://technick.net/guides/software/spreadsheet_byte_format/</guid><description>&lt;p&gt;The following is a cell function that can be used with a spreadsheet application (e.g. &lt;em&gt;MS Excel&lt;em&gt; or &lt;em&gt;LibreOffice Calc&lt;/em&gt;) to format a cell number using byte multiples.&lt;/p&gt;&#10;&lt;p&gt;The example below uses the content of the cell &lt;strong&gt;A1&lt;/strong&gt; as input.&lt;/p&gt;&#10;&lt;p&gt;For an explanation of IEC Prefixes for binary multiples please consult the guide: &lt;a href="https://technick.net/guides/theory/tables_prefix/"&gt;Multiples and Submultiples Prefixes Tables&lt;/a&gt;.&lt;/p&gt;&#10;&lt;p&gt;&lt;code&gt;&lt;pre&gt;&#10;=IF((A1&amp;gt;=POWER(2,80)),&#10;CONCATENATE(TEXT((A1/POWER(2,80)),&amp;quot;##0.00&amp;quot;), &amp;quot; YiB&amp;quot;),&#10;IF((A1&amp;gt;=POWER(2,70)),&#10;CONCATENATE(TEXT((A1/POWER(2,70)),&amp;quot;##0.00&amp;quot;), &amp;quot; ZiB&amp;quot;),&#10;IF((A1&amp;gt;=POWER(2,60)),&#10;CONCATENATE(TEXT((A1/POWER(2,60)),&amp;quot;##0.00&amp;quot;), &amp;quot; EiB&amp;quot;),&#10;IF((A1&amp;gt;=POWER(2,50)),&#10;CONCATENATE(TEXT((A1/POWER(2,50)),&amp;quot;##0.00&amp;quot;), &amp;quot; PiB&amp;quot;),&#10;IF((A1&amp;gt;=POWER(2,40)),&#10;CONCATENATE(TEXT((A1/POWER(2,40)),&amp;quot;##0.00&amp;quot;), &amp;quot; TiB&amp;quot;),&#10;IF((A1&amp;gt;=POWER(2,30)),&#10;CONCATENATE(TEXT((A1/POWER(2,30)),&amp;quot;##0.00&amp;quot;), &amp;quot; GiB&amp;quot;),&#10;IF((A1&amp;gt;=POWER(2,20)),&#10;CONCATENATE(TEXT((A1/POWER(2,20)),&amp;quot;##0.00&amp;quot;), &amp;quot; MiB&amp;quot;),&#10;IF((A1&amp;gt;=POWER(2,10)),&#10;CONCATENATE(TEXT((A1/POWER(2,10)),&amp;quot;##0.00&amp;quot;), &amp;quot; KiB&amp;quot;),&#10;CONCATENATE(TEXT((A1),&amp;quot;##0.00&amp;quot;), &amp;quot; B&amp;quot;)&#10;)&#10;)&#10;)&#10;)&#10;)&#10;)&#10;)&#10;)&#10;&lt;/pre&gt;&lt;/code&gt;&lt;/p&gt;</description></item><item><title>Ammonium Persulfate: Etchant for copper-plated PC Boards</title><link>https://technick.net/guides/electronics/ammonium_persulfate/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/ammonium_persulfate/</guid><description>&lt;hr /&gt;&lt;p&gt;&lt;b&gt;AMMONIUM PERSULFATE – (NH&lt;sub&gt;4&lt;/sub&gt;)&lt;sub&gt;2&lt;/sub&gt;S&lt;sub&gt;2&lt;/sub&gt;O&lt;sub&gt;8&lt;/sub&gt;&lt;br /&gt;(ammonium peroxydisulfate; peroxydisulfuric acid, diammonium salt)&lt;/b&gt;&lt;/p&gt;&lt;p&gt;&lt;b&gt;Description:&lt;/b&gt;&lt;/p&gt; &lt;ul&gt; &lt;li&gt;Colorless to light straw crystals or powder. Odorless. &#10; &lt;/li&gt;&lt;li&gt;Strong oxidizer. &#10; &lt;/li&gt;&lt;li&gt;Hazard classes: 5.1 oxidizer; 6.3 acute health hazard. &#10; &lt;/li&gt;&lt;li&gt;CAS No.: 7727-54-0 &#10; &lt;/li&gt;&lt;li&gt;UN-NA No.: 1444 &lt;/li&gt; &lt;/ul&gt;&lt;p&gt;&lt;b&gt;NFPA 704 Placarding Information:&lt;/b&gt;&lt;/p&gt; &lt;ul&gt; &lt;li&gt;Health – 2 &#10; &lt;/li&gt;&lt;li&gt;Flammability – 0 &#10; &lt;/li&gt;&lt;li&gt;Reactivity – 1 &#10; &lt;/li&gt;&lt;li&gt;Special Notice – OX &lt;/li&gt; &lt;/ul&gt;&lt;p&gt;&lt;b&gt;Uses:&lt;/b&gt;&lt;/p&gt; &lt;ul&gt; &lt;li&gt;Oxidizer and bleaching agent. &#10; &lt;/li&gt;&lt;li&gt;Used in photography; electroplating; preserving food; depolorizing batteries; and washing infected yeast. &#10; &lt;/li&gt;&lt;li&gt;Etchant for printed circuit boards and copper. &#10; &lt;/li&gt;&lt;li&gt;In the manufacture of other persulfates, deodorizing and bleaching oils, and aniline dyes. &lt;/li&gt; &lt;/ul&gt; &lt;p&gt;&lt;b&gt;Reactivity and Fire Risk:&lt;/b&gt;&lt;/p&gt;</description></item><item><title>ASCII Table</title><link>https://technick.net/guides/software/ascii_table/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/software/ascii_table/</guid><description>&lt;hr /&gt;&lt;p&gt;&lt;b&gt;ASCII = American Standard Code for Information Interchange&lt;/b&gt;&lt;/p&gt;&lt;table border="1" cellpadding="1" cellspacing="1"&gt;&lt;tr align="middle" bgcolor="#0080C0" style="color: #FFFFFF"&gt;&lt;th&gt;Dec&lt;/th&gt;&lt;th&gt;Hex&lt;/th&gt;&lt;th&gt;Char&lt;/th&gt;&lt;th&gt;Description&lt;/th&gt;&lt;th bgcolor="#FFFFC0"&gt;&amp;nbsp;&lt;/th&gt;&lt;th&gt;Dec&lt;/th&gt;&lt;th&gt;Hex&lt;/th&gt;&lt;th&gt;Char&lt;/th&gt;&lt;th bgcolor="#FFFFC0"&gt;&amp;nbsp;&lt;/th&gt;&lt;th&gt;Dec&lt;/th&gt;&lt;th&gt;Hex&lt;/th&gt;&lt;th&gt;Char&lt;/th&gt;&lt;th bgcolor="#FFFFC0"&gt;&amp;nbsp;&lt;/th&gt;&lt;th&gt;Dec&lt;/th&gt;&lt;th&gt;Hex&lt;/th&gt;&lt;th&gt;Char&lt;/th&gt;&lt;/tr&gt;&lt;tr bgcolor="#FFFFC0"&gt;&lt;td&gt;0&lt;/td&gt;&lt;td&gt;0&lt;/td&gt;&lt;td&gt;NUL&lt;/td&gt;&lt;td&gt;null&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;32&lt;/td&gt;&lt;td&gt;20&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;64&lt;/td&gt;&lt;td&gt;40&lt;/td&gt;&lt;td&gt;@&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;96&lt;/td&gt;&lt;td&gt;60&lt;/td&gt;&lt;td&gt;`&lt;/td&gt;&lt;/tr&gt;&lt;tr bgcolor="#FFFFC0"&gt;&lt;td&gt;1&lt;/td&gt;&lt;td&gt;1&lt;/td&gt;&lt;td&gt;SOH&lt;/td&gt;&lt;td&gt;start of heading&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;33&lt;/td&gt;&lt;td&gt;21&lt;/td&gt;&lt;td&gt;!&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;65&lt;/td&gt;&lt;td&gt;41&lt;/td&gt;&lt;td&gt;A&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;97&lt;/td&gt;&lt;td&gt;61&lt;/td&gt;&lt;td&gt;a&lt;/td&gt;&lt;/tr&gt;&lt;tr bgcolor="#FFFFC0"&gt;&lt;td&gt;2&lt;/td&gt;&lt;td&gt;2&lt;/td&gt;&lt;td&gt;STX&lt;/td&gt;&lt;td&gt;start of text&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;34&lt;/td&gt;&lt;td&gt;22&lt;/td&gt;&lt;td&gt;"&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;66&lt;/td&gt;&lt;td&gt;42&lt;/td&gt;&lt;td&gt;B&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;98&lt;/td&gt;&lt;td&gt;62&lt;/td&gt;&lt;td&gt;b&lt;/td&gt;&lt;/tr&gt;&lt;tr bgcolor="#FFFFC0"&gt;&lt;td&gt;3&lt;/td&gt;&lt;td&gt;3&lt;/td&gt;&lt;td&gt;ETX&lt;/td&gt;&lt;td&gt;end of text&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;35&lt;/td&gt;&lt;td&gt;23&lt;/td&gt;&lt;td&gt;#&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;67&lt;/td&gt;&lt;td&gt;43&lt;/td&gt;&lt;td&gt;C&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;99&lt;/td&gt;&lt;td&gt;63&lt;/td&gt;&lt;td&gt;c&lt;/td&gt;&lt;/tr&gt;&lt;tr bgcolor="#FFFFC0"&gt;&lt;td&gt;4&lt;/td&gt;&lt;td&gt;4&lt;/td&gt;&lt;td&gt;EOT&lt;/td&gt;&lt;td&gt;end of transmission&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;36&lt;/td&gt;&lt;td&gt;24&lt;/td&gt;&lt;td&gt;$&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;68&lt;/td&gt;&lt;td&gt;44&lt;/td&gt;&lt;td&gt;D&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;100&lt;/td&gt;&lt;td&gt;64&lt;/td&gt;&lt;td&gt;d&lt;/td&gt;&lt;/tr&gt;&lt;tr bgcolor="#FFFFC0"&gt;&lt;td&gt;5&lt;/td&gt;&lt;td&gt;5&lt;/td&gt;&lt;td&gt;ENQ&lt;/td&gt;&lt;td&gt;enquiry&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;37&lt;/td&gt;&lt;td&gt;25&lt;/td&gt;&lt;td&gt;%&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;69&lt;/td&gt;&lt;td&gt;45&lt;/td&gt;&lt;td&gt;E&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;101&lt;/td&gt;&lt;td&gt;65&lt;/td&gt;&lt;td&gt;e&lt;/td&gt;&lt;/tr&gt;&lt;tr bgcolor="#FFFFC0"&gt;&lt;td&gt;6&lt;/td&gt;&lt;td&gt;6&lt;/td&gt;&lt;td&gt;ACK&lt;/td&gt;&lt;td&gt;acknowledge&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;38&lt;/td&gt;&lt;td&gt;26&lt;/td&gt;&lt;td&gt;&amp;amp;&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;70&lt;/td&gt;&lt;td&gt;46&lt;/td&gt;&lt;td&gt;F&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;102&lt;/td&gt;&lt;td&gt;66&lt;/td&gt;&lt;td&gt;f&lt;/td&gt;&lt;/tr&gt;&lt;tr bgcolor="#FFFFC0"&gt;&lt;td&gt;7&lt;/td&gt;&lt;td&gt;7&lt;/td&gt;&lt;td&gt;BEL&lt;/td&gt;&lt;td&gt;bell&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;39&lt;/td&gt;&lt;td&gt;27&lt;/td&gt;&lt;td&gt;'&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;71&lt;/td&gt;&lt;td&gt;47&lt;/td&gt;&lt;td&gt;G&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;103&lt;/td&gt;&lt;td&gt;67&lt;/td&gt;&lt;td&gt;g&lt;/td&gt;&lt;/tr&gt;&lt;tr bgcolor="#FFFFC0"&gt;&lt;td&gt;8&lt;/td&gt;&lt;td&gt;8&lt;/td&gt;&lt;td&gt;BS&lt;/td&gt;&lt;td&gt;backspace&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;40&lt;/td&gt;&lt;td&gt;28&lt;/td&gt;&lt;td&gt;(&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;72&lt;/td&gt;&lt;td&gt;48&lt;/td&gt;&lt;td&gt;H&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;104&lt;/td&gt;&lt;td&gt;68&lt;/td&gt;&lt;td&gt;h&lt;/td&gt;&lt;/tr&gt;&lt;tr bgcolor="#FFFFC0"&gt;&lt;td&gt;9&lt;/td&gt;&lt;td&gt;9&lt;/td&gt;&lt;td&gt;TAB&lt;/td&gt;&lt;td&gt;horizontal tab&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;41&lt;/td&gt;&lt;td&gt;29&lt;/td&gt;&lt;td&gt;)&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;73&lt;/td&gt;&lt;td&gt;49&lt;/td&gt;&lt;td&gt;I&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;105&lt;/td&gt;&lt;td&gt;69&lt;/td&gt;&lt;td&gt;i&lt;/td&gt;&lt;/tr&gt;&lt;tr bgcolor="#FFFFC0"&gt;&lt;td&gt;10&lt;/td&gt;&lt;td&gt;A&lt;/td&gt;&lt;td&gt;LF&lt;/td&gt;&lt;td&gt;NL line feed, new line&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;42&lt;/td&gt;&lt;td&gt;2A&lt;/td&gt;&lt;td&gt;*&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;74&lt;/td&gt;&lt;td&gt;4A&lt;/td&gt;&lt;td&gt;J&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;106&lt;/td&gt;&lt;td&gt;6A&lt;/td&gt;&lt;td&gt;j&lt;/td&gt;&lt;/tr&gt;&lt;tr bgcolor="#FFFFC0"&gt;&lt;td&gt;11&lt;/td&gt;&lt;td&gt;B&lt;/td&gt;&lt;td&gt;VT&lt;/td&gt;&lt;td&gt;vertical tab&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;43&lt;/td&gt;&lt;td&gt;2B&lt;/td&gt;&lt;td&gt;+&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;75&lt;/td&gt;&lt;td&gt;4B&lt;/td&gt;&lt;td&gt;K&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;107&lt;/td&gt;&lt;td&gt;6B&lt;/td&gt;&lt;td&gt;k&lt;/td&gt;&lt;/tr&gt;&lt;tr bgcolor="#FFFFC0"&gt;&lt;td&gt;12&lt;/td&gt;&lt;td&gt;C&lt;/td&gt;&lt;td&gt;FF&lt;/td&gt;&lt;td&gt;NP form feed, new page&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;44&lt;/td&gt;&lt;td&gt;2C&lt;/td&gt;&lt;td&gt;,&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;76&lt;/td&gt;&lt;td&gt;4C&lt;/td&gt;&lt;td&gt;L&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;108&lt;/td&gt;&lt;td&gt;6C&lt;/td&gt;&lt;td&gt;l&lt;/td&gt;&lt;/tr&gt;&lt;tr bgcolor="#FFFFC0"&gt;&lt;td&gt;13&lt;/td&gt;&lt;td&gt;D&lt;/td&gt;&lt;td&gt;CR&lt;/td&gt;&lt;td&gt;carriage return&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;45&lt;/td&gt;&lt;td&gt;2D&lt;/td&gt;&lt;td&gt;-&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;77&lt;/td&gt;&lt;td&gt;4D&lt;/td&gt;&lt;td&gt;M&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;109&lt;/td&gt;&lt;td&gt;6D&lt;/td&gt;&lt;td&gt;m&lt;/td&gt;&lt;/tr&gt;&lt;tr bgcolor="#FFFFC0"&gt;&lt;td&gt;14&lt;/td&gt;&lt;td&gt;E&lt;/td&gt;&lt;td&gt;SO&lt;/td&gt;&lt;td&gt;shift out&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;46&lt;/td&gt;&lt;td&gt;2E&lt;/td&gt;&lt;td&gt;.&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;78&lt;/td&gt;&lt;td&gt;4E&lt;/td&gt;&lt;td&gt;N&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;110&lt;/td&gt;&lt;td&gt;6E&lt;/td&gt;&lt;td&gt;n&lt;/td&gt;&lt;/tr&gt;&lt;tr bgcolor="#FFFFC0"&gt;&lt;td&gt;15&lt;/td&gt;&lt;td&gt;F&lt;/td&gt;&lt;td&gt;SI&lt;/td&gt;&lt;td&gt;shift in&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;47&lt;/td&gt;&lt;td&gt;2F&lt;/td&gt;&lt;td&gt;/&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;79&lt;/td&gt;&lt;td&gt;4F&lt;/td&gt;&lt;td&gt;O&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;111&lt;/td&gt;&lt;td&gt;6F&lt;/td&gt;&lt;td&gt;o&lt;/td&gt;&lt;/tr&gt;&lt;tr bgcolor="#FFFFC0"&gt;&lt;td&gt;16&lt;/td&gt;&lt;td&gt;10&lt;/td&gt;&lt;td&gt;DLE&lt;/td&gt;&lt;td&gt;data link escape&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;48&lt;/td&gt;&lt;td&gt;30&lt;/td&gt;&lt;td&gt;0&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;80&lt;/td&gt;&lt;td&gt;50&lt;/td&gt;&lt;td&gt;P&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;112&lt;/td&gt;&lt;td&gt;70&lt;/td&gt;&lt;td&gt;p&lt;/td&gt;&lt;/tr&gt;&lt;tr bgcolor="#FFFFC0"&gt;&lt;td&gt;17&lt;/td&gt;&lt;td&gt;11&lt;/td&gt;&lt;td&gt;DC1&lt;/td&gt;&lt;td&gt;device control 1&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;49&lt;/td&gt;&lt;td&gt;31&lt;/td&gt;&lt;td&gt;1&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;81&lt;/td&gt;&lt;td&gt;51&lt;/td&gt;&lt;td&gt;Q&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;113&lt;/td&gt;&lt;td&gt;71&lt;/td&gt;&lt;td&gt;q&lt;/td&gt;&lt;/tr&gt;&lt;tr bgcolor="#FFFFC0"&gt;&lt;td&gt;18&lt;/td&gt;&lt;td&gt;12&lt;/td&gt;&lt;td&gt;DC2&lt;/td&gt;&lt;td&gt;device control 2&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;50&lt;/td&gt;&lt;td&gt;32&lt;/td&gt;&lt;td&gt;2&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;82&lt;/td&gt;&lt;td&gt;52&lt;/td&gt;&lt;td&gt;R&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;114&lt;/td&gt;&lt;td&gt;72&lt;/td&gt;&lt;td&gt;r&lt;/td&gt;&lt;/tr&gt;&lt;tr bgcolor="#FFFFC0"&gt;&lt;td&gt;19&lt;/td&gt;&lt;td&gt;13&lt;/td&gt;&lt;td&gt;DC3&lt;/td&gt;&lt;td&gt;device control 3&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;51&lt;/td&gt;&lt;td&gt;33&lt;/td&gt;&lt;td&gt;3&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;83&lt;/td&gt;&lt;td&gt;53&lt;/td&gt;&lt;td&gt;S&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;115&lt;/td&gt;&lt;td&gt;73&lt;/td&gt;&lt;td&gt;s&lt;/td&gt;&lt;/tr&gt;&lt;tr bgcolor="#FFFFC0"&gt;&lt;td&gt;20&lt;/td&gt;&lt;td&gt;14&lt;/td&gt;&lt;td&gt;DC4&lt;/td&gt;&lt;td&gt;device control 4&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;52&lt;/td&gt;&lt;td&gt;34&lt;/td&gt;&lt;td&gt;4&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;84&lt;/td&gt;&lt;td&gt;54&lt;/td&gt;&lt;td&gt;T&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;116&lt;/td&gt;&lt;td&gt;74&lt;/td&gt;&lt;td&gt;t&lt;/td&gt;&lt;/tr&gt;&lt;tr bgcolor="#FFFFC0"&gt;&lt;td&gt;21&lt;/td&gt;&lt;td&gt;15&lt;/td&gt;&lt;td&gt;NAK&lt;/td&gt;&lt;td&gt;negative acknowledge&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;53&lt;/td&gt;&lt;td&gt;35&lt;/td&gt;&lt;td&gt;5&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;85&lt;/td&gt;&lt;td&gt;55&lt;/td&gt;&lt;td&gt;U&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;117&lt;/td&gt;&lt;td&gt;75&lt;/td&gt;&lt;td&gt;u&lt;/td&gt;&lt;/tr&gt;&lt;tr bgcolor="#FFFFC0"&gt;&lt;td&gt;22&lt;/td&gt;&lt;td&gt;16&lt;/td&gt;&lt;td&gt;SYN&lt;/td&gt;&lt;td&gt;synchronous idle&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;54&lt;/td&gt;&lt;td&gt;36&lt;/td&gt;&lt;td&gt;6&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;86&lt;/td&gt;&lt;td&gt;56&lt;/td&gt;&lt;td&gt;V&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;118&lt;/td&gt;&lt;td&gt;76&lt;/td&gt;&lt;td&gt;v&lt;/td&gt;&lt;/tr&gt;&lt;tr bgcolor="#FFFFC0"&gt;&lt;td&gt;23&lt;/td&gt;&lt;td&gt;17&lt;/td&gt;&lt;td&gt;ETB&lt;/td&gt;&lt;td&gt;end of transmission block&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;55&lt;/td&gt;&lt;td&gt;37&lt;/td&gt;&lt;td&gt;7&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;87&lt;/td&gt;&lt;td&gt;57&lt;/td&gt;&lt;td&gt;W&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;119&lt;/td&gt;&lt;td&gt;77&lt;/td&gt;&lt;td&gt;w&lt;/td&gt;&lt;/tr&gt;&lt;tr bgcolor="#FFFFC0"&gt;&lt;td&gt;24&lt;/td&gt;&lt;td&gt;18&lt;/td&gt;&lt;td&gt;CAN&lt;/td&gt;&lt;td&gt;cancel&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;56&lt;/td&gt;&lt;td&gt;38&lt;/td&gt;&lt;td&gt;8&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;88&lt;/td&gt;&lt;td&gt;58&lt;/td&gt;&lt;td&gt;X&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;120&lt;/td&gt;&lt;td&gt;78&lt;/td&gt;&lt;td&gt;x&lt;/td&gt;&lt;/tr&gt;&lt;tr bgcolor="#FFFFC0"&gt;&lt;td&gt;25&lt;/td&gt;&lt;td&gt;19&lt;/td&gt;&lt;td&gt;EM&lt;/td&gt;&lt;td&gt;end of medium&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;57&lt;/td&gt;&lt;td&gt;39&lt;/td&gt;&lt;td&gt;9&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;89&lt;/td&gt;&lt;td&gt;59&lt;/td&gt;&lt;td&gt;Y&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;121&lt;/td&gt;&lt;td&gt;79&lt;/td&gt;&lt;td&gt;y&lt;/td&gt;&lt;/tr&gt;&lt;tr bgcolor="#FFFFC0"&gt;&lt;td&gt;26&lt;/td&gt;&lt;td&gt;1A&lt;/td&gt;&lt;td&gt;SUB&lt;/td&gt;&lt;td&gt;substitute&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;58&lt;/td&gt;&lt;td&gt;3A&lt;/td&gt;&lt;td&gt;:&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;90&lt;/td&gt;&lt;td&gt;5A&lt;/td&gt;&lt;td&gt;Z&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;122&lt;/td&gt;&lt;td&gt;7A&lt;/td&gt;&lt;td&gt;z&lt;/td&gt;&lt;/tr&gt;&lt;tr bgcolor="#FFFFC0"&gt;&lt;td&gt;27&lt;/td&gt;&lt;td&gt;1B&lt;/td&gt;&lt;td&gt;ESC&lt;/td&gt;&lt;td&gt;escape&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;59&lt;/td&gt;&lt;td&gt;3B&lt;/td&gt;&lt;td&gt;;&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;91&lt;/td&gt;&lt;td&gt;5B&lt;/td&gt;&lt;td&gt;[&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;123&lt;/td&gt;&lt;td&gt;7B&lt;/td&gt;&lt;td&gt;{&lt;/td&gt;&lt;/tr&gt;&lt;tr bgcolor="#FFFFC0"&gt;&lt;td&gt;28&lt;/td&gt;&lt;td&gt;1C&lt;/td&gt;&lt;td&gt;FS&lt;/td&gt;&lt;td&gt;file separator&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;60&lt;/td&gt;&lt;td&gt;3C&lt;/td&gt;&lt;td&gt;&amp;lt;&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;92&lt;/td&gt;&lt;td&gt;5C&lt;/td&gt;&lt;td&gt;\&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;124&lt;/td&gt;&lt;td&gt;7C&lt;/td&gt;&lt;td&gt;|&lt;/td&gt;&lt;/tr&gt;&lt;tr bgcolor="#FFFFC0"&gt;&lt;td&gt;29&lt;/td&gt;&lt;td&gt;1D&lt;/td&gt;&lt;td&gt;GS&lt;/td&gt;&lt;td&gt;group separator&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;61&lt;/td&gt;&lt;td&gt;3D&lt;/td&gt;&lt;td&gt;=&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;93&lt;/td&gt;&lt;td&gt;5D&lt;/td&gt;&lt;td&gt;]&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;125&lt;/td&gt;&lt;td&gt;7D&lt;/td&gt;&lt;td&gt;}&lt;/td&gt;&lt;/tr&gt;&lt;tr bgcolor="#FFFFC0"&gt;&lt;td&gt;30&lt;/td&gt;&lt;td&gt;1E&lt;/td&gt;&lt;td&gt;RS&lt;/td&gt;&lt;td&gt;record separator&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;62&lt;/td&gt;&lt;td&gt;3E&lt;/td&gt;&lt;td&gt;&amp;gt;&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;94&lt;/td&gt;&lt;td&gt;5E&lt;/td&gt;&lt;td&gt;^&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;126&lt;/td&gt;&lt;td&gt;7E&lt;/td&gt;&lt;td&gt;~&lt;/td&gt;&lt;/tr&gt;&lt;tr bgcolor="#FFFFC0"&gt;&lt;td&gt;31&lt;/td&gt;&lt;td&gt;1F&lt;/td&gt;&lt;td&gt;US&lt;/td&gt;&lt;td&gt;unit separator&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;63&lt;/td&gt;&lt;td&gt;3F&lt;/td&gt;&lt;td&gt;?&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;95&lt;/td&gt;&lt;td&gt;5F&lt;/td&gt;&lt;td&gt;_&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;127&lt;/td&gt;&lt;td&gt;7F&lt;/td&gt;&lt;td&gt;DEL&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;br /&gt;&lt;br /&gt;</description></item><item><title>AWG to Metric Conversion Chart</title><link>https://technick.net/guides/electronics/awg_to_metric/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/awg_to_metric/</guid><description>&lt;hr /&gt;&lt;blockquote&gt;&lt;p&gt;&lt;b&gt;Reference and Sources:&lt;/b&gt;&lt;ul class="sources"&gt;&#10;&lt;li&gt;&lt;a href="http://en.wikipedia.org/wiki/American_wire_gauge"&gt;Wikipedia: American wire gauge&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;American Wire Gauge (AWG) &amp; Metric Wire Gauge Wire Sizes&lt;/li&gt;&#10;&lt;li&gt;Van den Hul: AWG to Metric Conversion Chart&lt;/li&gt;&#10;&lt;/ul&gt;&lt;/p&gt;&lt;p&gt;This table gives closest equivalent size cross references between metric and&#10;American wire sizes. In Europe, wire sizes are expressed in cross sectional&#10;area in mm&amp;sup2; and also as the number of strands of wires of a diameter&#10;expressed in mm. For example 7/0.2 means 7 strands of wire each 0.2mm diameter.&#10;This example has a cross sectional area of 0.22mm&amp;sup2;. In America, the&#10;commonest system is the AWG numbering scheme, where the numbers are applied not&#10;only to individual strands but also to equivalent size bunches of smaller&#10;strands. For example 24AWG could be made of 1 strands of 24AWG wire (1/24) or 7&#10;strands of 32 AWG wire (7/32).&lt;br /&gt;&#10;&lt;br /&gt;&#10;See also: &lt;a href="https://technick.net/tools/awg-to-metric-converter"&gt;AWG to metric Parameter Calculator&lt;/a&gt;.&lt;/p&gt;</description></item><item><title>Basic Soldering Guide</title><link>https://technick.net/guides/electronics/how_to_solder/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/how_to_solder/</guid><description>&lt;table border="0" width="600"&gt; &lt;tr&gt; &lt;td colspan="3" height="10" width="596"&gt; &lt;p align="center"&gt;&lt;font face="Arial" size="2"&gt; &lt;a href="#types"&gt;Types of Iron&lt;/a&gt; | &#10; &lt;a href="#howsol"&gt;How to Solder&lt;/a&gt; | &#10; &lt;a href="#howdesol"&gt;How to Desolder&lt;/a&gt; | &#10; &lt;a href="#suma"&gt;Summary&lt;/a&gt; | &#10; &lt;a href="#trouble"&gt;Trouble Shooting Guide&lt;/a&gt; | &#10; &lt;a href="#firstaid"&gt;First Aid&lt;/a&gt;&lt;br /&gt; &lt;a href="#pictures"&gt;Photo Gallery&lt;/a&gt; | &#10; &lt;a href="#contact"&gt;Contacting the Author&lt;/a&gt; | &#10; &lt;a href="#copyrite"&gt;Copyright &amp;amp; Disclaimer&lt;/a&gt; | &#10; &lt;/font&gt;&lt;/p&gt;&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &lt;td colspan="3" height="10" width="596"&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td height="10"&gt;&lt;font color="#000080" face="Arial" size="2"&gt;This written &#10; guide will help beginners and novices to obtain effective results when &#10; soldering electronic components. If you have little or no experience of &#10; using a soldering iron, then we recommend that you practice your soldering &#10; technique on some fresh surplus components and clean stripboard &#10; (protoboard), before experimenting with a proper constructional project. &#10; This will help you to avoid the risk of disappointment when you start to &#10; assemble your first prototypes. If you've never soldered before, then read &#10; on!&lt;/font&gt;&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &lt;td colspan="3" height="10" width="596"&gt; &lt;hr /&gt; &lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td colspan="3" height="10" width="596"&gt;&lt;a name="types"&gt;&lt;/a&gt;&lt;font size="+2"&gt;&lt;b&gt; Types of Iron&lt;/b&gt;&lt;/font&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td colspan="3" height="10" width="596"&gt;&lt;font color="#008080" face="Arial" size="2"&gt;Topics in this section include: Voltage, Wattage, Temperature &#10; Control, Soldering Stations, Anti-Static Protection, Bits (Tips), Spare &#10; Parts, and Gas-Powered Irons.&lt;/font&gt; &lt;p&gt;&lt;font color="#800000" face="Arial" size="2"&gt;The most fundamental skill needed &#10; to assemble any electronic project is that of soldering. It takes some &#10; practice to make the perfect joint, but, like riding a bicycle, once &#10; learned is never forgotten! The idea is simple: to join electrical parts &#10; together to form an electrical connection, using a molten mixture of lead &#10; and tin (solder) with a soldering iron. A large range of soldering irons &#10; is available -- which one is suitable for you depends on your budget and &#10; how serious your interest in electronics is.&lt;br /&gt;&lt;br /&gt;Electronics catalogues &#10; often include a selection of well-known brands of soldering iron. &#10; Excellent British-made ones include the universally popular Antex, Adcola &#10; and Litesold makes. Other popular brands include those made by Weller and &#10; Ungar. A very basic mains electric soldering iron can cost from under 5 UK &#10; Pounds (8 US Dollars), but you can expect a reasonable model to be &#10; approximately 10 to 12 UKP (16 to 20 US Dollars), and it's quite possible &#10; to spend into three figures on a "soldering station" if you're really &#10; serious! You can check suppliers' catalogues for some typical types of &#10; iron. Certain factors you need to bear in mind &#10; include:&lt;br /&gt;&lt;br /&gt;&lt;/font&gt;&lt;font color="#000000" face="Arial" size="2"&gt;&lt;strong&gt;Voltage:&lt;/strong&gt;&lt;/font&gt;&lt;font color="#800000" face="Arial" size="2"&gt; Most irons run from the mains at 240V (110V in the US). However, &#10; low voltage types (e.g.&lt;br /&gt;12V or 24V) generally form part of a "soldering &#10; station," and are designed to be used with a special controller made by &#10; the same manufacturer.&lt;br /&gt;&lt;br /&gt;&lt;/font&gt;&lt;font color="#000000" face="Arial" size="2"&gt;&lt;strong&gt;Wattage:&lt;/strong&gt;&lt;/font&gt;&lt;font color="#800000" face="Arial" size="2"&gt; Typically, soldering irons may have a power rating of between &#10; 15-25 watts or so, which is fine for most work. A higher wattage does not &#10; mean that the iron runs hotter -- it simply means that there is more power &#10; in reserve for coping with larger joints. This also depends partly on the &#10; design of the "bit" (the tip of the iron). Consider a higher wattage iron &#10; simply as being more "unstoppable" when it comes to heavier-duty work, &#10; because it won't cool down so quickly.&lt;br /&gt;&lt;br /&gt;&lt;/font&gt;&lt;font color="#000000" face="Arial" size="2"&gt;&lt;strong&gt;Temperature Control:&lt;/strong&gt;&lt;/font&gt;&lt;font color="#800000" face="Arial" size="2"&gt; The simplest and cheapest types don't &#10; have any form of temperature regulation. Simply plug them in and switch &#10; them on! Thermal regulation is "designed in" (by physics, not &#10; electronics!). These irons may be described as "thermally balanced" so &#10; that they have some degree of temperature "matching," but their output &#10; will otherwise not be controlled. Unregulated irons form an ideal general &#10; purpose iron for most users, and they generally cope well with printed &#10; circuit board soldering and general interwiring. Most of these "miniature" &#10; types of iron will be of little use when attempting to solder large joints &#10; (e.g. very large terminals or very thick wires) because the component &#10; being soldered will "sink" heat away from the tip of the iron, cooling it &#10; down too much. (This is where a higher wattage comes in useful.)&lt;br /&gt;&lt;br /&gt;A &#10; proper temperature-controlled iron will be quite a lot more expensive -- &#10; retailing at say 40 UKP (60 USD) or more. This type of iron will have some &#10; form of built-in thermostatic control, to ensure that the temperature of &#10; the bit (the tip of the iron) is maintained at a fixed level (within &#10; limits). This is desirable, especially during more frequent use, since it &#10; helps to ensure that the temperature does not "overshoot" in between &#10; times, and also guarantees that the output will be relatively stable. Some &#10; irons have a bimetallic strip thermostat built into the handle which gives &#10; an audible "click" in use: other types use all-electronic controllers, and &#10; some may be adjustable using a screwdriver.&lt;br /&gt;&lt;br /&gt;Yet more expensive &#10; still, soldering stations cost from 70 UKP (115 USD) upwards (the iron &#10; may&lt;br /&gt;be sold separately, so you can pick the type you prefer). Soldering &#10; stations consist of a complete bench-top control unit into which a special &#10; low-voltage soldering iron is plugged. Some versions might have a built-in &#10; digital temperature readout, and will have a control knob to enable you to &#10; vary the setting. The temperature could be boosted for soldering larger &#10; joints, for example, or for using higher melting-point solders (e.g. &#10; silver solder). These are designed for the most discerning users, or for &#10; continuous production line and professional use. The best stations have &#10; irons which are well balanced, with comfort-grip handles which remain cool &#10; all day. A thermocouple will be built into the tip or shaft, which &#10; monitors temperature.&lt;br /&gt;&lt;br /&gt;&lt;/font&gt;&lt;font color="#000000" face="Arial" size="2"&gt;&lt;strong&gt;Anti-Static Protection:&lt;/strong&gt;&lt;/font&gt;&lt;font color="#800000" face="Arial" size="2"&gt; If you're interested in soldering a lot of &#10; static-sensitive parts (e.g. CMOS chips or MOSFET transistors), more &#10; advanced and expensive soldering iron stations use &#10; static-dissipative&lt;br /&gt;materials in their construction to ensure that &#10; static does not build up on the iron itself. You may see these listed as &#10; "ESD safe" (electrostatic discharge proof). The cheapest irons won't &#10; necessarily be ESD-safe but never the less will still probably perform &#10; perfectly well in most hobby or educational applications if you take the &#10; usual anti-static precautions when handling the components. The tip would &#10; need to be well earthed (grounded) in these &#10; circumstances.&lt;br /&gt;&lt;br /&gt;&lt;/font&gt;&lt;font color="#000000" face="Arial" size="2"&gt;&lt;strong&gt;Bits:&lt;/strong&gt;&lt;/font&gt;&lt;font color="#800000" face="Arial" size="2"&gt; &#10; It's useful to have a small selection of manufacturer's bits (soldering &#10; iron tips) available with different diameters or shapes, which can be &#10; changed depending on the type of work in hand. You'll probably find that &#10; you become accustomed to, and work best with, a particular shape of tip. &#10; Often, tips are iron-coated to preserve their life, or they may be &#10; bright-plated instead. Copper tips are seldom seen these &#10; days.&lt;br /&gt;&lt;br /&gt;&lt;/font&gt;&lt;font color="#000000" face="Arial" size="2"&gt;&lt;strong&gt;Spare &#10; Parts:&lt;/strong&gt;&lt;/font&gt;&lt;font color="#800000" face="Arial" size="2"&gt; it's nice to &#10; know that spare parts may be available, so if the element blows, you don't &#10; need to replace the entire iron. This is especially so with expensive &#10; irons. Check through some of the larger mail-order &#10; catalogues.&lt;br /&gt;&lt;br /&gt;&lt;/font&gt;&lt;font color="#000000" face="Arial" size="2"&gt;&lt;strong&gt;Gas-Powered Irons:&lt;/strong&gt;&lt;/font&gt;&lt;font color="#800000" face="Arial" size="2"&gt; You will occasionally see gas-powered soldering irons &#10; which use butane rather than the mains electrical supply to operate. They &#10; have a catalytic element which, once warmed up, continues to glow hot when &#10; gas passes over them. Service engineers use them for working on repairs &#10; where there may be no power available, or where a joint is tricky to reach &#10; with a normal iron, so they are really for occasional "on the spot" use &#10; for quick repairs, rather than for mainstream construction or assembly &#10; work. &lt;/font&gt;&lt;/p&gt; &lt;p&gt;&lt;font color="#000000" face="Arial" size="2"&gt;&lt;strong&gt;And &#10; Finally:&lt;/strong&gt;&lt;/font&gt;&lt;font color="#800000" face="Arial" size="2"&gt; A solder &#10; gun is a pistol-shaped iron, typically running at 100W or more, and is &#10; completely unsuitable for soldering modern electronic components: they're &#10; too hot, heavy and unwieldy for micro-electronics use. Plumbing, &#10; maybe..!&lt;br /&gt;&lt;br /&gt;Soldering irons are best used along with a heat-resistant &#10; bench-type holder, so that the hot iron can be safely parked in between &#10; use. Soldering stations already have this feature, otherwise a separate &#10; soldering iron stand is essential, preferably one with a holder for &#10; tip-cleaning sponges. Now let's look at how to use soldering irons &#10; properly, and how to put things right when a joint goes wrong &#10; ......&lt;/font&gt;&lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td colspan="3" height="10" width="596"&gt; &lt;hr /&gt; &lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td colspan="3" height="10" width="596"&gt;&lt;a name="howsol"&gt;&lt;/a&gt;&lt;font size="+2"&gt;&lt;b&gt; How to Solder&lt;/b&gt;&lt;/font&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td colspan="3" height="10" width="596"&gt;&lt;font color="#008080" face="Arial" size="2"&gt;Topics in this section include: Quick Summary Guide, Cleanliness of &#10; Components, Temperature, Time, and Amount.&lt;/font&gt; &lt;p&gt;&lt;font color="#000000" face="Arial" size="2"&gt;&lt;strong&gt;Quick Summary Guide: &#10; &lt;/strong&gt;&lt;/font&gt;&lt;font color="#800000" face="Arial" size="2"&gt;Turning to the &#10; actual techniques of soldering, firstly it's best to secure the work &#10; somehow so that it doesn't move during soldering and affect your accuracy. &#10; In the case of a printed circuit board, various holding frames are fairly &#10; popular especially with densely populated boards. The idea with a holding &#10; frame is to insert all the parts on one side (this may be referred to as &#10; "stuffing" or "populating" the board), hold them in place with a special &#10; foam pad to prevent them from falling out, turn the board over, and then &#10; snip off the wires with cutters before making the joints. The frame saves &#10; an awful lot of turning the board over and back again, especially with &#10; large boards. Other parts could be held firm in a modeller's small vice, &#10; for example.&lt;br /&gt;&lt;br /&gt;Solder joints may need to possess some degree of &#10; mechanical strength in some cases, especially with wires soldered to, say, &#10; potentiometer or switch tags, and this means that the wire should be &#10; looped through the tag and secured before solder is applied. The down side &#10; is that it is more difficult to desolder the joint (see later) and remove &#10; the wire afterwards, if required. Otherwise, in the case of an ordinary &#10; circuit board, components' wires are bent to fit through the board, &#10; inserted flush against the board's surface, splayed outwards a little so &#10; that the part grips the board, and then soldered. &lt;br /&gt;&lt;br /&gt;In my view -- &#10; opinions vary -- it's generally better to snip the surplus wires leads off &#10; first, to make the joint more accessible and avoid applying a mechanical &#10; shock to the printed circuit board (PCB) joint. However, in the case &#10; of&lt;br /&gt;semiconductors, I often tend to leave the snipping until after the &#10; joint has been made, since the excess wire will help to sink away some of &#10; the heat from the semiconductor junction. Integrated circuits can either &#10; be soldered directly into place if you are confident enough, or better, &#10; use a dual-in-line socket to prevent heat damage. The chip can then be &#10; swapped out if needed.&lt;br /&gt;&lt;br /&gt;Parts which become hot in operation (e.g. &#10; some resistors), are raised above the board slightly to allow air to &#10; circulate. Some components, especially large electrolytic capacitors, may &#10; require a mounting clip to be screwed down to the board first, otherwise &#10; the part may eventually break off due to vibration.&lt;br /&gt;&lt;br /&gt;The perfectly &#10; soldered joint will be nice and shiny looking, and will prove reliable in &#10; service. I would say that the key factors affecting the quality of the &#10; joint are:&lt;/font&gt;&lt;/p&gt; &lt;blockquote&gt; &lt;p&gt;&lt;font color="#008080" face="Arial" size="2"&gt;o) Cleanliness&lt;br /&gt;o) &#10; Temperature&lt;br /&gt;o) Duration&lt;br /&gt;o) Adequate solder &#10; coverage&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt; &lt;p&gt;&lt;font color="#800000" face="Arial" size="2"&gt;A little effort spent now in &#10; soldering the perfect joint may save you -- or somebody else -- a &#10; considerable amount of time in troubleshooting a defective joint in the &#10; future. The basic principles are as follows.&lt;br /&gt;&lt;br /&gt;&lt;/font&gt;&lt;font color="#000000" face="Arial" size="2"&gt;&lt;strong&gt;Really Clean:&lt;/strong&gt;&lt;/font&gt;&lt;font color="#800000" face="Arial" size="2"&gt; Firstly, and without exception, all parts &#10; -- including the iron tip itself -- must be clean and free from &#10; contamination. Solder just will not "take" to dirty parts! Old components &#10; or copper board can be notoriously difficult to solder, because of the &#10; layer of oxidation which builds up on the surface of the leads. This &#10; repels the molten solder and this will soon be evident because the solder &#10; will "bead" into globules, going everywhere except where you need it. Dirt &#10; is the enemy of a good quality soldered joint!&lt;br /&gt;&lt;br /&gt;Hence, it is an &#10; absolute necessity to ensure that parts are free from grease, oxidation &#10; and other contamination. In the case of old resistors or capacitors, for &#10; example, where the leads have started to oxidise, use a small hand-held &#10; file or perhaps scrape a knife blade or rub a fine emery cloth over them &#10; to reveal fresh metal underneath. Stripboard and copper printed circuit &#10; board will generally oxidise after a few months, especially if it has been &#10; fingerprinted, and the copper strips can be cleaned using an abrasive &#10; rubber block, like an aggressive eraser, to reveal fresh shiny copper &#10; underneath.&lt;br /&gt;&lt;br /&gt;Also available is a fibre-glass filament brush, which &#10; is used propelling-pencil-like to remove any surface contamination. These &#10; tend to produce tiny particles which are highly irritating to skin, so &#10; avoid accidental contact with any debris. Afterwards, a wipe with a rag &#10; soaked in cleaning solvent will remove most grease marks and fingerprints. &#10; After preparing the surfaces, avoid touching the parts afterwards if at &#10; all possible.&lt;br /&gt;&lt;br /&gt;Another side effect of having dirty surfaces is the &#10; tendency for people to want to apply more heat in an attempt to "force the &#10; solder to take." This will often do more harm than good because it may not &#10; be possible to burn off any contaminants anyway, and the component may be &#10; overheated. In the case of semiconductors, temperature is quite critical &#10; and they may be harmed by applying such excessive heat.&lt;br /&gt;&lt;br /&gt;Before &#10; using the iron to make a joint, it should be "tinned" (coated with solder) &#10; by applying a few millimetres of solder, then wiped on a damp sponge &#10; preparing it for use: you should always do this&lt;br /&gt;immediately with a new &#10; bit, anyway. Personally, I always re-apply a very small amount of solder &#10; again, mainly to improve the thermal contact between the iron and the &#10; joint, so that the solder will flow more quickly and easily. It's &#10; sometimes better to tin larger parts as well before making the joint &#10; itself, but it isn't generally necessary with PCB work. A worthwhile product is Weller's &lt;em&gt;Tip &#10; Tinner &amp;amp; Cleaner&lt;/em&gt;, a small 15 gram tinlet of paste onto which you &#10; dab a hot iron -- the product cleans and&lt;br /&gt;tins the iron ready for use. &#10; An equivalent is Adcola Tip-Save.&lt;br /&gt;&lt;br /&gt;Normal electronics grade solder &#10; is usually 60% lead - 40% tin, and it contains cores of "flux," which &#10; helps the molten solder to flow more easily over the joint. Flux removes &#10; oxides which arise during&lt;br /&gt;heating, and is seen as a brown fluid &#10; bubbling away on the joint. Acid fluxes (e.g. as used by plumbers) must &#10; never be applied. Other solders are available for specialist work, &#10; including aluminium and silver-solder. Different solder diameters are &#10; produced, too; 20-22 SWG (19-21 AWG) is 0.91-0.71mm diameter and is fine &#10; for most work. Choose 18 SWG (16 AWG) for larger joints requiring more &#10; solder.&lt;br /&gt;&lt;br /&gt;&lt;/font&gt;&lt;font color="#000000" face="Arial" size="2"&gt;&lt;strong&gt;Temperature:&lt;/strong&gt;&lt;/font&gt;&lt;font color="#800000" face="Arial" size="2"&gt; Another step to successful soldering is to ensure that the &#10; temperature of all the parts is raised to roughly the same level before &#10; applying solder. Imagine, for instance, trying to solder a resistor into &#10; place on a printed circuit board: it's far better to heat both the copper &#10; PCB and the resistor lead at the same time before applying solder, so that &#10; the solder will flow much more readily over the joint. Heating one part &#10; but not the other is far less satisfactory joint, so strive to ensure that &#10; the iron is in contact with all the components first, before touching the &#10; solder to it. The melting point of most solder is in the region of 188&amp;deg;C &#10; (370&amp;deg;F) and the iron tip temperature is typically 330&amp;deg;C to 350&amp;deg;C (626&amp;deg;F to &#10; 662&amp;deg;F).&lt;br /&gt;&lt;br /&gt;&lt;/font&gt;&lt;font color="#000000" face="Arial" size="2"&gt;&lt;strong&gt;Now is &#10; the time:&lt;/strong&gt;&lt;/font&gt;&lt;font color="#800000" face="Arial" size="2"&gt; Next, the &#10; joint should be heated with the bit for just the right amount of time -- &#10; during which a short length of solder is applied to the joint. Do not use &#10; the iron to carry molten solder over to the joint! Excessive time will &#10; damage the component and perhaps the circuit board copper foil too! Heat &#10; the joint with the tip of the iron, then continue heating whilst applying &#10; solder, then remove the iron and allow the joint to cool. This should take &#10; only a few seconds, with experience. The heating period depends on the &#10; temperature of your iron and size of the joint -- and larger parts need &#10; more heat than smaller ones -- but some parts (semiconductor diodes, &#10; transistors and integrated circuits), are sensitive to heat and should not &#10; be heated for more than a few seconds. Novices sometimes buy a small &#10; clip-on heat-shunt, which resembles a pair of aluminium tweezers. In the &#10; case of, say, a transistor, the shunt is attached to one of the leads near &#10; to the transistor's body. Any excess heat then diverts up the heat shunt &#10; instead of into the transistor junction, thereby saving the device&lt;br /&gt;from &#10; over-heating. Beginners find them reassuring until they've gained more &#10; experience.&lt;br /&gt;&lt;br /&gt;&lt;/font&gt;&lt;font color="#000000" face="Arial" size="2"&gt;&lt;strong&gt;Solder Coverage:&lt;/strong&gt;&lt;/font&gt;&lt;font color="#800000" face="Arial" size="2"&gt; The final key to a successful solder joint is to apply &#10; an appropriate amount of solder. Too much solder is an unnecessary waste &#10; and may cause short circuits with adjacent joints. Too little and it may &#10; not support the component properly, or may not fully form a working joint. &#10; How much to apply, only really comes with practice. A few millimetres &#10; only, is enough for an "average" PCB joint, (if there is such a &#10; thing).&lt;/font&gt;&lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td colspan="3" height="10" width="596"&gt; &lt;hr /&gt; &lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td colspan="3" height="10" width="596"&gt;&lt;a name="howdesol"&gt;&lt;/a&gt;&lt;font size="+2"&gt;&lt;b&gt; How to Desolder&lt;/b&gt;&lt;/font&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td colspan="3" height="10" width="596"&gt;&lt;font color="#800000" face="Arial" size="2"&gt;A &#10; soldered joint which is improperly made will be electrically "noisy," &#10; unreliable, and is likely to get worse over time. It may even not have &#10; made any electrical connection at all, or could work initially and then &#10; cause the equipment to fail at a later date! It can be hard to judge the &#10; quality of a solder joint purely by appearances, because you cannot say &#10; how the joint actually formed on the inside, but by following the &#10; guidelines there is no reason why you should not obtain perfect &#10; results.&lt;br /&gt;&lt;br /&gt;A joint which is poorly formed is often called a "dry &#10; joint." Such a joint usually results from dirt or grease preventing the &#10; solder from melting onto the parts properly, and is often noticeable &#10; because of the tendency of the solder not to "spread," but to form beads &#10; or globules instead, perhaps partially. Alternatively, if it seems to take &#10; an inordinately long time for the solder to spread, this is another sign &#10; of possible dirt and that the joint may potentially be a dry &#10; one.&lt;br /&gt;&lt;br /&gt;There will undoubtedly come a time when you need to remove the &#10; solder from a joint: possibly to replace a faulty component or fix a dry &#10; joint. The usual way is to use a desoldering pump which works like a small &#10; spring-loaded bicycle pump, only in reverse! (More demanding users using &#10; CMOS devices might need a pump which is ESD safe.) A spring-loaded plunger &#10; is released at the push of a button and the molten solder is then drawn up &#10; into the pump. It may take one or two attempts to clean up a joint this &#10; way, but a small desoldering pump is an invaluable tool especially for PCB &#10; work.&lt;br /&gt;&lt;br /&gt;Sometimes, it's effective to actually add more solder and &#10; then desolder the whole lot with a pump, if the solder is particularly &#10; awkward to remove. Care is needed, though, to ensure that the boards and &#10; parts are not damaged by excessive heat; the pumps themselves have a &#10; P.T.F.E. nozzle which is heat proof but may need replacing &#10; occasionally.&lt;br /&gt;&lt;br /&gt;An excellent alternative to a pump is to use &#10; desoldering braid, including the famous American "Soder-Wick" (sic) or &#10; Adcola "TISA-Wick" which are packaged in small dispenser reels. This &#10; product is a specially treated fine copper braid which draws molten solder &#10; up into the braid where it solidifies. The best way is to use the tip of &#10; the hot iron to press a short length of braid down onto the joint to be &#10; desoldered. The iron will subsequently melt the solder, which will be &#10; drawn up into the braid. Take extreme care to ensure that you don't allow &#10; the solder to cool with the braid adhering to the work, or you run the &#10; risk of damaging PCB copper tracks when you attempt to pull the braid off &#10; the joint.&lt;br /&gt;&lt;br /&gt;I recommend buying a small reel of de-soldering braid, &#10; especially for larger or difficult joints which would take several &#10; attempts with a pump. It is surprisingly effective, especially on &#10; difficult joints where a desoldering pump may prove a &#10; struggle.&lt;/font&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td colspan="3" height="10" width="596"&gt; &lt;hr /&gt; &lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td colspan="3" height="10" width="596"&gt;&lt;a name="suma"&gt;&lt;/a&gt;&lt;font size="+2"&gt;&lt;b&gt; Summary&lt;/b&gt;&lt;/font&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td colspan="3" height="10" width="596"&gt;&lt;font color="#800000" face="Arial" size="2"&gt;Here's a summary of how to make the perfect solder joint:&lt;/font&gt; &lt;ol&gt; &lt;li&gt; &lt;p align="left"&gt;&lt;font color="#008080" face="Arial" size="2"&gt;All parts must be &#10; clean and free from dirt and grease.&lt;/font&gt;&lt;/p&gt; &lt;/li&gt;&lt;li&gt; &lt;p align="left"&gt;&lt;font color="#008080" face="Arial" size="2"&gt;Try to secure the &#10; work firmly.&lt;/font&gt;&lt;/p&gt; &lt;/li&gt;&lt;li&gt; &lt;p align="left"&gt;&lt;font color="#008080" face="Arial" size="2"&gt;"Tin" the iron tip &#10; with a small amount of solder. Do this immediately, with new tips being &#10; used for the first time.&lt;/font&gt;&lt;/p&gt; &lt;/li&gt;&lt;li&gt; &lt;p align="left"&gt;&lt;font color="#008080" face="Arial" size="2"&gt;Clean the tip of the &#10; hot soldering iron on a damp sponge (many people then add a tiny amount &#10; of fresh solder to the cleansed tip).&lt;/font&gt;&lt;/p&gt; &lt;/li&gt;&lt;li&gt; &lt;p align="left"&gt;&lt;font color="#008080" face="Arial" size="2"&gt;Heat all parts of &#10; the joint with the iron for under a second or so.&lt;/font&gt;&lt;/p&gt; &lt;/li&gt;&lt;li&gt; &lt;p align="left"&gt;&lt;font color="#008080" face="Arial" size="2"&gt;Continue heating, &#10; then apply sufficient solder only, to form an adequate joint.&lt;/font&gt;&lt;/p&gt; &lt;/li&gt;&lt;li&gt; &lt;p align="left"&gt;&lt;font color="#008080" face="Arial" size="2"&gt;Remove and return &#10; the iron safely to its stand.&lt;/font&gt;&lt;/p&gt; &lt;/li&gt;&lt;li&gt; &lt;p align="left"&gt;&lt;font color="#008080" face="Arial" size="2"&gt;It only takes two or &#10; three seconds at most, to solder the average PCB joint.&lt;/font&gt;&lt;/p&gt; &lt;/li&gt;&lt;li&gt; &lt;p align="left"&gt;&lt;font color="#008080" face="Arial" size="2"&gt;Do not move parts &#10; until the solder has cooled. &lt;/font&gt;&lt;/p&gt;&lt;/li&gt;&lt;/ol&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td colspan="3" height="10" width="596"&gt; &lt;hr /&gt; &lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td colspan="3" height="10" width="596"&gt;&lt;a name="trouble"&gt;&lt;/a&gt;&lt;font size="+2"&gt;&lt;b&gt; Troubleshooting Guide&lt;/b&gt;&lt;/font&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td colspan="3" height="10" width="596"&gt;&lt;font color="#000000" face="Arial" size="2"&gt;&lt;strong&gt;The solder won't "take":&lt;/strong&gt;&lt;/font&gt;&lt;font color="#800000" face="Arial" size="2"&gt; If grease or dirt are present, desolder and clean up &#10; the parts. Or, the material may simply not be suitable for soldering with &#10; lead/tin solder.&lt;/font&gt; &lt;p&gt;&lt;font color="#000000" face="Arial" size="2"&gt;&lt;strong&gt;The joint is crystalline &#10; or grainy-looking:&lt;/strong&gt;&lt;/font&gt;&lt;font color="#800000" face="Arial" size="2"&gt; &#10; The parts forming the joint may have been moved before being allowed to &#10; cool, or the joint was not heated adequately (too small an iron or too &#10; large a joint).&lt;/font&gt;&lt;/p&gt; &lt;p&gt;&lt;font color="#000000" face="Arial" size="2"&gt;&lt;strong&gt;The solder joint forms a &#10; "spike":&lt;/strong&gt;&lt;/font&gt;&lt;font color="#800000" face="Arial" size="2"&gt; The joint &#10; was probably overheated, burning away the flux.&lt;/font&gt;&lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td colspan="3" height="10" width="596"&gt; &lt;hr /&gt; &lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td colspan="3" height="10" width="596"&gt;&lt;a name="firstaid"&gt;&lt;/a&gt;&lt;font size="+2"&gt;&lt;b&gt; First Aid&lt;/b&gt;&lt;/font&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td colspan="3" height="10" width="596"&gt; &lt;p align="left"&gt;&lt;font color="#800000" face="Arial" size="2"&gt;If you are unlucky &#10; enough to receive burns which require treatment, here's what to &#10; do:&lt;/font&gt;&lt;/p&gt; &lt;ol&gt; &lt;li&gt;&lt;font color="#008080" face="Arial" size="2"&gt;Immediately cool the affected &#10; area with cold running water, ice, or even frozen peas, for ten &#10; minutes.&lt;/font&gt; &#10; &lt;/li&gt;&lt;li&gt;&lt;font color="#008080" face="Arial" size="2"&gt;Remove any rings etc. before &#10; swelling starts.&lt;/font&gt; &#10; &lt;/li&gt;&lt;li&gt;&lt;font color="#008080" face="Arial" size="2"&gt;Apply a sterile dressing to &#10; protect against infection. &lt;/font&gt; &lt;/li&gt;&lt;li&gt;&lt;font color="#008080" face="Arial" size="2"&gt;Do not apply lotions, &#10; ointments etc., nor prick any blisters which form later.&lt;/font&gt; &#10; &lt;/li&gt;&lt;li&gt;&lt;font color="#008080" face="Arial" size="2"&gt;Seek professional medical &#10; advice where necessary.&lt;/font&gt;&lt;font color="#800000" face="Arial" size="2"&gt;&lt;br /&gt;&lt;/font&gt;&lt;/li&gt;&lt;/ol&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td colspan="3" height="10" width="596"&gt; &lt;hr /&gt; &lt;/td&gt;&lt;/tr&gt; &lt;/table&gt;</description></item><item><title>Basics of Electrostatic Discharge (ESD)</title><link>https://technick.net/guides/electronics/esd/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/esd/</guid><description/></item><item><title>Batteries in a Portable World 2nd Ed.</title><link>https://technick.net/guides/electronics/bpw/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/</guid><description/></item><item><title>Controlling Electrical Hazards</title><link>https://technick.net/guides/electronics/electric_hazards/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/electric_hazards/</guid><description>&lt;hr /&gt; &lt;p&gt;This article provides an overview of basic electrical safety for &#10;individuals with little or limited training or familiarity with electrical &#10;hazards. The concepts and principles presented will help further an &#10;understanding of OSHA's electrical safety standards for general industry, Title &#10;29 Code of Federal Regulations (CFR), Part 1910.302, Sub-part S-Design Safety &#10;Standards for Electrical Systems, and 1910.331 Electrical Safety-Related Work &#10;Practices Standard (1990).&lt;/p&gt;&lt;br /&gt;&#10;&lt;!-- -------------------------------------------------------- --&gt;&lt;a name="menu"&gt;&lt;/a&gt;&lt;font size="+1"&gt;&lt;u&gt;&lt;b&gt;Contents / Menu&lt;/b&gt;&lt;/u&gt; &lt;/font&gt;&lt;p&gt;&lt;b&gt;&lt;nobr&gt;&lt;a href="#intro"&gt; Introduction&lt;/a&gt;&lt;/nobr&gt;&lt;br /&gt;&#10;&lt;nobr&gt;&lt;a href="#acts"&gt; How Electricity Acts?&lt;/a&gt;&lt;/nobr&gt;&lt;br /&gt;&#10;&lt;nobr&gt;&lt;a href="#occur"&gt; How Shocks Occur?&lt;/a&gt;&lt;/nobr&gt;&lt;br /&gt;&#10;&lt;nobr&gt;&lt;a href="#shock"&gt; Severity of the Shock&lt;/a&gt;&lt;/nobr&gt;&lt;br /&gt;&#10;&lt;nobr&gt;&lt;a href="#burns"&gt; Burns and Other Injuries&lt;/a&gt;&lt;/nobr&gt;&lt;br /&gt;&#10;&lt;nobr&gt;&lt;a href="#prevent"&gt; Preventing Electrical Hazards&lt;/a&gt;&lt;/nobr&gt;&lt;br /&gt;&#10;&lt;font size="1"&gt;(&lt;nobr&gt;&lt;a href="#prev_insul"&gt; Insulation,&lt;/a&gt;&lt;/nobr&gt;&amp;nbsp;&lt;nobr&gt;&lt;a href="#prev_guard"&gt; Guarding,&lt;/a&gt;&lt;/nobr&gt;&amp;nbsp;&lt;nobr&gt;&lt;a href="#prev_ground"&gt; Grounding,&lt;/a&gt;&lt;/nobr&gt;&amp;nbsp;&lt;nobr&gt;&lt;a href="#prev_cpd"&gt; Circuit Protection Devices,&lt;/a&gt;&lt;/nobr&gt;&amp;nbsp;&lt;nobr&gt;&lt;a href="#prev_swp"&gt; Safe Work Practices,&lt;/a&gt;&lt;/nobr&gt;&amp;nbsp;&lt;nobr&gt;&lt;a href="#prev_training"&gt; Training,&lt;/a&gt;&lt;/nobr&gt;&amp;nbsp;&lt;nobr&gt;&lt;a href="#prev_ol"&gt; Overhead Lines&lt;/a&gt; )&lt;/nobr&gt;&amp;nbsp;&lt;/font&gt;&lt;br /&gt;&#10;&lt;nobr&gt;&lt;a href="#concl"&gt; Conclusion&lt;/a&gt;&lt;/nobr&gt;&lt;br /&gt;&#10;&lt;/b&gt;&lt;/p&gt;</description></item><item><title>Definitions of the SI base and derived units</title><link>https://technick.net/guides/theory/si_units/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/si_units/</guid><description>&lt;hr /&gt;(&lt;a href="#SIbase"&gt;Definitions of the SI base units&lt;/a&gt;, &lt;a href="#SIderived"&gt;SI derived units&lt;/a&gt;, &lt;a href="#otherunits"&gt;Other not SI units&lt;/a&gt;)&lt;br /&gt;&lt;p&gt;The International System of Units, universally abbreviated SI (from the French Le Syst&amp;egrave;me International d'Unit&amp;eacute;s), is the modern metric system of measurement. The SI was established in 1960 by the 11th General Conference on Weights and Measures (CGPM, Conf&amp;eacute;rence G&amp;eacute;n&amp;eacute;rale des Poids et Mesures). The CGPM is the international authority that ensures wide dissemination of the SI and modifies the SI as necessary to reflect the latest advances in science and technology. &lt;/p&gt;</description></item><item><title>Dielectric Constants of Material</title><link>https://technick.net/guides/electronics/dielectric_constants/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/dielectric_constants/</guid><description>&lt;blockquote&gt;&lt;p&gt;&lt;b&gt;Reference and Sources:&lt;/b&gt;&lt;ul class="sources"&gt;&lt;li&gt;Zed Z. Chang&lt;/li&gt;&lt;/ul&gt;&lt;/p&gt;&lt;table border="2" cellspacing="1" cellpadding="1"&gt;&lt;tr&gt;&lt;th&gt;Material&lt;/th&gt;&lt;th&gt;Min.&lt;/th&gt;&lt;th&gt;Max.&lt;/th&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Air&lt;/td&gt;&lt;td&gt;1&lt;/td&gt;&lt;td&gt;1&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Amber&lt;/td&gt;&lt;td&gt;2.6&lt;/td&gt;&lt;td&gt;2.7&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Asbestos fiber&lt;/td&gt;&lt;td&gt;3.1&lt;/td&gt;&lt;td&gt;4.8&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Bakelite&lt;/td&gt;&lt;td&gt;5&lt;/td&gt;&lt;td&gt;22&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Barium Titanate&lt;/td&gt;&lt;td&gt;100&lt;/td&gt;&lt;td&gt;1250&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Beeswax&lt;/td&gt;&lt;td&gt;2.4&lt;/td&gt;&lt;td&gt;2.8&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Cambric&lt;/td&gt;&lt;td&gt;4&lt;/td&gt;&lt;td&gt;4&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Carbon Tetrachloride&lt;/td&gt;&lt;td&gt;2.17&lt;/td&gt;&lt;td&gt;2.17&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Celluloid&lt;/td&gt;&lt;td&gt;4&lt;/td&gt;&lt;td&gt;4&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Cellulose Acetate&lt;/td&gt;&lt;td&gt;2.9&lt;/td&gt;&lt;td&gt;4.5&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Durite&lt;/td&gt;&lt;td&gt;4.7&lt;/td&gt;&lt;td&gt;5.1&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Ebonite&lt;/td&gt;&lt;td&gt;2.7&lt;/td&gt;&lt;td&gt;2.7&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Epoxy Resin&lt;/td&gt;&lt;td&gt;3.4&lt;/td&gt;&lt;td&gt;3.7&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Ethyl Alcohol&lt;/td&gt;&lt;td&gt;6.5&lt;/td&gt;&lt;td&gt;25&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Fiber&lt;/td&gt;&lt;td&gt;5&lt;/td&gt;&lt;td&gt;5&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Formica&lt;/td&gt;&lt;td&gt;3.6&lt;/td&gt;&lt;td&gt;6&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Glass&lt;/td&gt;&lt;td&gt;3.8&lt;/td&gt;&lt;td&gt;14.5&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Glass Pyrex&lt;/td&gt;&lt;td&gt;4.6&lt;/td&gt;&lt;td&gt;5&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Gutta Percha&lt;/td&gt;&lt;td&gt;2.4&lt;/td&gt;&lt;td&gt;2.6&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Isolantite&lt;/td&gt;&lt;td&gt;6.1&lt;/td&gt;&lt;td&gt;6.1&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Kevlar&lt;/td&gt;&lt;td&gt;3.5&lt;/td&gt;&lt;td&gt;4.5&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Lucite&lt;/td&gt;&lt;td&gt;2.5&lt;/td&gt;&lt;td&gt;2.5&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Mica&lt;/td&gt;&lt;td&gt;4&lt;/td&gt;&lt;td&gt;9&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Micarta&lt;/td&gt;&lt;td&gt;3.2&lt;/td&gt;&lt;td&gt;5.5&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Mycalex&lt;/td&gt;&lt;td&gt;7.3&lt;/td&gt;&lt;td&gt;9.3&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Neoprene&lt;/td&gt;&lt;td&gt;4&lt;/td&gt;&lt;td&gt;6.7&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Nylon&lt;/td&gt;&lt;td&gt;3.4&lt;/td&gt;&lt;td&gt;22.4&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Paper&lt;/td&gt;&lt;td&gt;1.5&lt;/td&gt;&lt;td&gt;3&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Paraffin&lt;/td&gt;&lt;td&gt;2&lt;/td&gt;&lt;td&gt;3&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Plexiglass&lt;/td&gt;&lt;td&gt;2.6&lt;/td&gt;&lt;td&gt;3.5&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Polycarbonate&lt;/td&gt;&lt;td&gt;2.9&lt;/td&gt;&lt;td&gt;3.2&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Polyethylene&lt;/td&gt;&lt;td&gt;2.5&lt;/td&gt;&lt;td&gt;2.5&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Polyimide&lt;/td&gt;&lt;td&gt;3.4&lt;/td&gt;&lt;td&gt;3.5&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Polystyrene&lt;/td&gt;&lt;td&gt;2.4&lt;/td&gt;&lt;td&gt;3&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Porcelain&lt;/td&gt;&lt;td&gt;5&lt;/td&gt;&lt;td&gt;6.5&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Quartz&lt;/td&gt;&lt;td&gt;5&lt;/td&gt;&lt;td&gt;5&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Rubber&lt;/td&gt;&lt;td&gt;2&lt;/td&gt;&lt;td&gt;4&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Ruby Mica&lt;/td&gt;&lt;td&gt;5.4&lt;/td&gt;&lt;td&gt;5.4&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Selenium&lt;/td&gt;&lt;td&gt;6&lt;/td&gt;&lt;td&gt;6&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Shellac&lt;/td&gt;&lt;td&gt;2.9&lt;/td&gt;&lt;td&gt;3.9&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Silicone&lt;/td&gt;&lt;td&gt;3.2&lt;/td&gt;&lt;td&gt;4.7&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Slate&lt;/td&gt;&lt;td&gt;7&lt;/td&gt;&lt;td&gt;7&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Soil dry&lt;/td&gt;&lt;td&gt;2.4&lt;/td&gt;&lt;td&gt;2.9&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Steatite&lt;/td&gt;&lt;td&gt;5.2&lt;/td&gt;&lt;td&gt;6.3&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Styrofoam&lt;/td&gt;&lt;td&gt;1.03&lt;/td&gt;&lt;td&gt;1.03&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Teflon&lt;/td&gt;&lt;td&gt;2.1&lt;/td&gt;&lt;td&gt; 2.1&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Titanium Dioxide&lt;/td&gt;&lt;td&gt;100&lt;/td&gt;&lt;td&gt;100&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Vaseline&lt;/td&gt;&lt;td&gt;2.16&lt;/td&gt;&lt;td&gt;2.16&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Vinylite&lt;/td&gt;&lt;td&gt;2.7&lt;/td&gt;&lt;td&gt;7.5&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Water distilled&lt;/td&gt;&lt;td&gt;34&lt;/td&gt;&lt;td&gt;78&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Waxes, Mineral&lt;/td&gt;&lt;td&gt;2.2&lt;/td&gt;&lt;td&gt;2.3&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Wood dry&lt;/td&gt;&lt;td&gt;1.4&lt;/td&gt;&lt;td&gt;2.9&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/blockquote&gt;&lt;br /&gt;&lt;br /&gt;</description></item><item><title>Digital Audio Resampling</title><link>https://technick.net/guides/theory/dar/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dar/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/resample/"&gt;The Digital Audio Resampling Home Page&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, Copyright &amp;#169; &lt;i&gt;2016-05-17&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;</description></item><item><title>Elementary Digital Filter Theory</title><link>https://technick.net/guides/theory/edft/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/edft/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/filters/"&gt;Introduction to Digital Filters with Audio Applications&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, Copyright &amp;#169; &lt;i&gt;2017-11-26&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;</description></item><item><title>Ferric Chloride Solution: Etchant for copper-plated PC Boards</title><link>https://technick.net/guides/electronics/fecl/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/fecl/</guid><description>&lt;hr /&gt;&lt;pre&gt;&#10;Ferric Chloride CAS #7705-08-0&#10;Green-black solution in water with a mild acid-like odor.&#10;May cause eye and skin burns. May be harmful if swallowed. Ingestion&#10;may cause rapid heartbeat, low blood pressure, shock, and possible coma.&#10;May cause kidney and liver damage. Inhalation of vapor may cause severe&#10;respiratory tract irritation. Substance has caused adverse reproductive&#10;effects in animals.&#10;Target Organs: Kidneys, liver, cardiovascular system.&#10;Adverse Health Effects&#10; If in Eyes: May cause eye burns. Contact produces irritation, tearing,&#10; and burning pain.&#10; If on Skin: May be absorbed through the skin. May cause severe&#10; irritation and possible burns.&#10; If Swallowed: May cause irritation of the digestive tract. May cause&#10; liver and kidney damage. Causes severe pain, nausea, vomiting,&#10; diarrhea, and shock. May cause severe irritation of the mouth and&#10; throat. May cause low blood pressure, rapid heartbeat, skin&#10; discoloration, and possible coma.&#10; If Inhaled: Vapor may cause severe respiratory tract irritation.&#10; Prolonged or repeated exposure may cause adverse reproductive effects.&#10; Repeated exposure may increase an increased body load of iron.&#10;FIRST AID MEASURES:&#10; Eyes: Immediately flush eyes with plenty of water for at least 15&#10; minutes, occasionally lifting the upper and lower lids. Get medical&#10; aid immediately. Do NOT allow victim to rub or keep eyes closed.&#10; Skin: Immediately flush skin with plenty of soap and water for at&#10; least 15 minutes while removing contaminated clothing and shoes.&#10; Get medical aid if irritation develops or persists.&#10; Ingestion: If victim is conscious and alert, give 2-4 cupfuls of milk&#10; or water. Get medical aid immediately.&#10; Inhalation: Remove from exposure to fresh air immediately. If not breathing,&#10; give artificial respiration. If breathing is difficult, give oxygen.&#10; Get medical aid.&#10; Notes to Physician:&#10; Treat symptomatically and supportively.&#10; The use of an iron chelator should be determined only by qualified&#10; medical personnel.&#10; Handling:&#10; Wash thoroughly after handling.&#10; Remove contaminated clothing and wash before reuse.&#10; Use with adequate ventilation.&#10; Do not get in eyes, on skin, or on clothing.&#10; Do not ingest or inhale.&#10; Storage:&#10; Do not store in direct sunlight.&#10; Store in a cool, dry, well-ventilated area away from incompatible&#10; substances.&#10; OSHA Vacated PELs:&#10; Ferric Chloride: No OSHA Vacated PELs are listed for this chemical.&#10;&lt;p&gt;Physical State: Liquid&#10;Appearance: Green-black solution.&#10;Odor: Mild acid-like.&#10;pH: 2.0 (0.1M sol.)&#10;Vapor Pressure: Not available.&#10;Vapor Density: Not available.&#10;Evaporation Rate: Not available.&#10;Viscosity: Not available.&#10;Boiling Point: 212 degrees F&#10;Freezing/Melting Point: Not available.&#10;Decomposition Temperature: Not available.&#10;Solubility: Soluble in water.&#10;Specific Gravity/Density: 1.4 (water=1)&#10;Molecular Formula: FeCl3&#10;Molecular Weight: 162.206&#10;Chemical Stability: Stable under normal temperatures and pressures.&#10;Incompatible with Alkalis, allyl chloride, ethylene oxide, nylon,&#10;oxidizers, potassium, sodium. Corrosive to most metals.&#10;Hazardous Decomposition Products: Hydrogen chloride, chlorine.&#10;Hazardous Polymerization: None reported.&#10;LD50/LC50:&#10;CAS# 7732-18-5: Oral, rat: LD50 = &amp;gt;90 mL/kg.&#10;CAS# 7732-18-5: Oral, rat: LD50 = &amp;gt;90 mL/kg.&#10;Carcinogenicity: Not listed by ACGIH, IARC, NIOSH, NTP, or OSHA.&#10;Epidemiology: No information available.&#10;Teratogenicity: No information available.&#10;Reproductive Effects: Fertility: Pre-implantation mortality,&#10;intravaginal-rat TDLo=29mg/kg.&#10;Paternal Effects: Spermatogenesis and Testes/sperm duct/epididymis,&#10;intratesticular-rat TDLo=12976ug/kg.&#10;Neurotoxicity: No information available.&#10;Mutagenicity: No information available.&#10;Other Studies: None.&#10;Ecotoxicity:&#10;Daphnia (fresh water) TLm=15ppm/96H&#10;Mosquito fish TLm=74ppm/96H&#10;Minnow TLm=540ppm/1.5H&#10;Environmental Fate: No information available.&#10;Dispose of in a manner consistent with federal, state, and local regulations.&#10;RCRA D-Series Maximum Concentration of Contaminants: Not listed.&#10;RCRA D-Series Chronic Toxicity Reference Levels: Not listed.&#10;RCRA F-Series: Not listed.&#10;RCRA P-Series: Not listed.&#10;RCRA U-Series: Not listed.&#10;Not listed as a material banned from land disposal according to RCRA.&#10;Transportation Information:&#10;Shipping Name: FERRIC CHLORIDE SOLUTION&#10;Hazard Class: 8(9.2)&#10;UN Number: UN2582&#10;TSCA: CAS# 7705-08-0 is listed on the TSCA inventory.&#10;Not listed on the Health &amp;amp; Safety Reporting List.&#10;Not listed under TSCA Section 12b.&#10;Does not have a SNUR under TSCA.&#10;CERCLA/SARA: Section 302 (RQ) NONE&#10;Section 302 (TPQ) NONE&#10;Section 313 Not reportable under Section 313.&#10;Clean Air Act:&#10;This material does not contain any hazardous air pollutants.&#10;This material does not contain any Class 1 Ozone depletors.&#10;This material does not contain any Class 2 Ozone depletors.&#10;Clean Water Act:&#10;CAS# 7705-08-0 is listed as a Hazardous Substance under the CWA.&#10;Not are listed as Priority Pollutants under the CWA.&#10;Not listed as Toxic Pollutants under the CWA.&#10;OSHA: Not are considered highly hazardous by OSHA.&#10;Ferric Chloride can be found on the following state right to know&#10;lists: New Jersey, Pennsylvania, Massachusetts.&#10;Not present on state lists from CA, PA, MN, MA, FL, or NJ.&#10;California No Significant Risk Level: Not listed.&#10;Canada&#10;CAS# 7705-08-0 is listed on Canada&amp;rsquo;s DSL/NDSL List.&#10;CAS# 7705-08-0 is not listed on Canada&amp;rsquo;s Ingredient Disclosure List.&#10;European Labeling in Accordance with EC Directives&#10;Hazard Symbols: Not available.&#10;Risk Phrases: Not available.&#10;Safety Phrases: Not available.&#10;Exposure Limits:&#10;OEL-DENMARK:TWA 1 mg(Fe)/m3 JANUARY 1993. OEL-FINLAND:TWA 1&#10;mg(Fe)/m3 JANUARY 1993. OEL-THE NETHERLANDS:TWA 1 mg(Fe)/m3&#10;JANUARY 1993. OEL-SWITZERLAND:TWA 1 mg(Fe)/m3 JANUARY 1993.&#10;OEL-UNITED KINGDOM:TWA 1 mg(Fe)/m3;STEL 2 mg(Fe)/m3 JANUARY&#10;1993. OEL IN BULGARIA, COLOMBIA, JORDAN, KOREA check ACGIH TLV.&#10;OEL IN NEW ZEALAND, SINGAPORE, VIETNAM check ACGI TLV&lt;/pre&gt;&lt;br /&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/pcb"&gt;&lt;svg width="1.2em" height="1.2em" viewBox="0 0 320 512" fill="currentColor" aria-hidden="true" focusable="false" style="vertical-align:middle"&gt;&lt;path d="M9.4 233.4c-12.5 12.5-12.5 32.8 0 45.3l192 192c12.5 12.5 32.8 12.5 45.3 0s12.5-32.8 0-45.3L77.3 256 246.6 86.6c12.5-12.5 12.5-32.8 0-45.3s-32.8-12.5-45.3 0l-192 192z"/&gt;&lt;/svg&gt;&lt;b&gt; Back to PCBs Fabrication Methods Guide&lt;/b&gt;&lt;/a&gt;&lt;br /&gt;&lt;/p&gt;</description></item><item><title>Inductance of Circular Loop</title><link>https://technick.net/tools/inductance-calculator/circular-loop/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/tools/inductance-calculator/circular-loop/</guid><description>&lt;blockquote&gt;Loop of wire with circular shape&lt;br /&gt;&lt;table class="toolform" border="0" cellspacing="10" cellpadding="2"&gt;&lt;tr&gt;&lt;td align="left" valign="top"&gt;&lt;img src="https://technick.net/img/util_inductance/util_inductance_circle.gif" width="100" height="100" border="0" alt="Circular Loop" /&gt;&lt;/td&gt;&lt;td align="left" valign="top"&gt;&lt;form action="" method="get" name="inductanceform" id="inductanceform"&gt;&lt;table class="toolform" border="0" cellspacing="0" cellpadding="0"&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;N&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="A" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[&amp;nbsp;]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;number of turns&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;R&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="B" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;radius of the circle&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;a&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="C" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;wire radius&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;&amp;micro;&lt;sub&gt;r&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="D" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[&amp;nbsp;]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;relative permeability of the medium&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;font color="#800000"&gt;&lt;b&gt;L&lt;/b&gt;&lt;/font&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="L" size="20" readonly="readonly" /&gt;&lt;/td&gt;&lt;td&gt;&lt;font color="#800000"&gt;&lt;b&gt;[H]&lt;/b&gt;&lt;/font&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;Inductance&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;td colspan="3"&gt;&lt;input name="Calculate" type="button" value="Calculate" onclick="LCircularLoop()" /&gt; &lt;input name="Reset" type="Reset" value="Clear" /&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/form&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;p&gt;&lt;b&gt;NOTE:&lt;/b&gt; numbers are in scientific notation (e.g.: 1.427e-9 H = 1.1427&amp;middot;10&lt;sup&gt;-9&lt;/sup&gt; H = 1.427 nH)&lt;/p&gt;&lt;p&gt;&lt;img width="198" height="42" src="https://technick.net/img/util_inductance/util_inductance_circle_formula.gif" border="0" alt="Formula" /&gt;&lt;/p&gt;&lt;/blockquote&gt;&#10;&lt;script language="JavaScript" src="https://technick.net/js/inductancecalc.js" type="text/javascript"&gt;&lt;/script&gt;</description></item><item><title>Inductance of Coplanar Traces</title><link>https://technick.net/tools/inductance-calculator/coplanar-traces/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/tools/inductance-calculator/coplanar-traces/</guid><description>&lt;blockquote&gt;Cross section of Coplanar Traces transmission line&lt;br /&gt;&lt;table class="toolform" border="0" cellspacing="10" cellpadding="2"&gt;&lt;tr&gt;&lt;td align="left" valign="top"&gt;&lt;img src="https://technick.net/img/util_inductance/util_inductance_trace_h.gif" width="100" height="42" border="0" alt="Coplanar Traces" /&gt;&lt;/td&gt;&lt;td align="left" valign="top"&gt;&lt;form action="" method="get" name="inductanceform" id="inductanceform"&gt;&lt;table class="toolform" border="0" cellspacing="0" cellpadding="0"&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;w&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="A" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;width of the traces&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;d&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="B" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;center-to-center distance&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;t&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="C" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;thickness of the traces&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;&amp;micro;&lt;sub&gt;r&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="D" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[&amp;nbsp;]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;relative permeability of the medium&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;font color="#800000"&gt;&lt;b&gt;L/l&lt;/b&gt;&lt;/font&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="L" size="20" readonly="readonly" /&gt;&lt;/td&gt;&lt;td&gt;&lt;font color="#800000"&gt;&lt;b&gt;[H/m]&lt;/b&gt;&lt;/font&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;Inductance per unit length&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;td colspan="3"&gt;&lt;input name="Calculate" type="button" value="Calculate" onclick="LTraceH()" /&gt; &lt;input name="Reset" type="Reset" value="Clear" /&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/form&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;p&gt;&lt;b&gt;NOTE:&lt;/b&gt; numbers are in scientific notation (e.g.: 1.427e-9 H = 1.1427&amp;middot;10&lt;sup&gt;-9&lt;/sup&gt; H = 1.427 nH)&lt;/p&gt;&lt;p&gt;&lt;img src="https://technick.net/img/util_inductance/util_inductance_trace_h_formula.gif" width="392" height="52" border="0" alt="Formula" /&gt;&lt;br /&gt;&lt;br /&gt;&lt;font size="1"&gt;See also notes on &lt;a href="https://technick.net/tools/inductance-calculator"&gt;Inductance Calculations&lt;/a&gt; page.&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;&#10;&lt;script language="JavaScript" src="https://technick.net/js/inductancecalc.js" type="text/javascript"&gt;&lt;/script&gt;</description></item><item><title>Inductance of Equilateral Triangle Loop</title><link>https://technick.net/tools/inductance-calculator/triangle-eq-loop/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/tools/inductance-calculator/triangle-eq-loop/</guid><description>&lt;blockquote&gt;Loop of wire with Equilateral Triangle shape&lt;br /&gt;&lt;table class="toolform" border="0" cellspacing="10" cellpadding="2"&gt;&lt;tr&gt;&lt;td align="left" valign="top"&gt;&lt;img src="https://technick.net/img/util_inductance/util_inductance_triangle_eq.gif" width="100" height="92" border="0" alt="Equilateral Triangle Loop" /&gt;&lt;/td&gt;&lt;td align="left" valign="top"&gt;&lt;form action="" method="get" name="inductanceform" id="inductanceform"&gt;&lt;table class="toolform" border="0" cellspacing="0" cellpadding="0"&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;N&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="A" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[&amp;nbsp;]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;number of turns&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;s&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="B" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;length of one side&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;a&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="C" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;wire radius&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;&amp;micro;&lt;sub&gt;r&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="D" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[&amp;nbsp;]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;relative permeability of the medium&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;font color="#800000"&gt;&lt;b&gt;L&lt;/b&gt;&lt;/font&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="L" size="20" readonly="readonly" /&gt;&lt;/td&gt;&lt;td&gt;&lt;font color="#800000"&gt;&lt;b&gt;[H]&lt;/b&gt;&lt;/font&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;Inductance&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;td colspan="3"&gt;&lt;input name="Calculate" type="button" value="Calculate" onclick="LTriangleEqLoop()" /&gt; &lt;input name="Reset" type="Reset" value="Clear" /&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/form&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;p&gt;&lt;b&gt;NOTE:&lt;/b&gt; numbers are in scientific notation (e.g.: 1.427e-9 H = 1.1427&amp;middot;10&lt;sup&gt;-9&lt;/sup&gt; H = 1.427 nH)&lt;/p&gt;&lt;p&gt;&lt;img width="261" height="42" src="https://technick.net/img/util_inductance/util_inductance_triangle_eq_formula.gif" border="0" alt="Formula" /&gt;&lt;br /&gt;&lt;br /&gt;&lt;font size="1"&gt;See also notes on &lt;a href="https://technick.net/tools/inductance-calculator"&gt;Inductance Calculations&lt;/a&gt; page.&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;&#10;&lt;script language="JavaScript" src="https://technick.net/js/inductancecalc.js" type="text/javascript"&gt;&#10;&lt;/script&gt;</description></item><item><title>Inductance of Isosceles Triangle Loop</title><link>https://technick.net/tools/inductance-calculator/triangle-is-loop/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/tools/inductance-calculator/triangle-is-loop/</guid><description>&lt;blockquote&gt;Loop of wire with Isosceles Triangle shape&lt;br /&gt;&lt;table class="toolform" border="0" cellspacing="10" cellpadding="2"&gt;&lt;tr&gt;&lt;td align="left" valign="top"&gt;&lt;img src="https://technick.net/img/util_inductance/util_inductance_triangle_is.gif" width="70" height="100" border="0" alt="Isosceles Triangle Loop" /&gt;&lt;/td&gt;&lt;td align="left" valign="top"&gt;&lt;form action="" method="get" name="inductanceform" id="inductanceform"&gt;&lt;table class="toolform" border="0" cellspacing="0" cellpadding="0"&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;N&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="A" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[&amp;nbsp;]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;number of turns&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;b&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="B" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;length of the base&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;c&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="C" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;length of the equal sides&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;a&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="D" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;wire radius&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;&amp;micro;&lt;sub&gt;r&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="E" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[&amp;nbsp;]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;relative permeability of the medium&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;font color="#800000"&gt;&lt;b&gt;L&lt;/b&gt;&lt;/font&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="L" size="20" readonly="readonly" /&gt;&lt;/td&gt;&lt;td&gt;&lt;font color="#800000"&gt;&lt;b&gt;[H]&lt;/b&gt;&lt;/font&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;Inductance&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;td colspan="3"&gt;&lt;input name="Calculate" type="button" value="Calculate" onclick="LTriangleIsLoop()" /&gt; &lt;input name="reset" type="reset" value="Clear" /&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/form&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;p&gt;&lt;b&gt;NOTE:&lt;/b&gt; numbers are in scientific notation (e.g.: 1.427e-9 H = 1.1427&amp;middot;10&lt;sup&gt;-9&lt;/sup&gt; H = 1.427 nH)&lt;/p&gt;&lt;p&gt;&lt;img width="715" height="49" src="https://technick.net/img/util_inductance/util_inductance_triangle_is_formula.gif" border="0" alt="Formula" /&gt;&lt;br /&gt;&lt;br /&gt;&lt;font size="1"&gt;See also notes on &lt;a href="https://technick.net/tools/inductance-calculator"&gt;Inductance Calculations&lt;/a&gt; page.&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;&#10;&lt;script language="JavaScript" src="https://technick.net/js/inductancecalc.js" type="text/javascript"&gt;&lt;/script&gt;</description></item><item><title>Inductance of Rectangular Loop</title><link>https://technick.net/tools/inductance-calculator/rectangular-loop/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/tools/inductance-calculator/rectangular-loop/</guid><description>&lt;blockquote&gt;Loop of wire with rectangular shape&lt;br /&gt;&lt;table class="toolform" border="0" cellspacing="10" cellpadding="2"&gt;&lt;tr&gt;&lt;td align="left" valign="top"&gt;&lt;img src="https://technick.net/img/util_inductance/util_inductance_rectangle.gif" width="100" height="67" border="0" alt="Rectangular Loop" /&gt;&lt;/td&gt;&lt;td align="left" valign="top"&gt;&lt;form action="" method="get" name="inductanceform" id="inductanceform"&gt;&lt;table class="toolform" border="0" cellspacing="0" cellpadding="0"&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;N&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="A" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[&amp;nbsp;]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;number of turns&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;w&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="B" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;width of the rectangle&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;h&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="C" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;height of the rectangle&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;a&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="D" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;wire radius&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;&amp;micro;&lt;sub&gt;r&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="E" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[&amp;nbsp;]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;relative permeability of the medium&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;font color="#800000"&gt;&lt;b&gt;L&lt;/b&gt;&lt;/font&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="L" size="20" readonly="readonly" /&gt;&lt;/td&gt;&lt;td&gt;&lt;font color="#800000"&gt;&lt;b&gt;[H]&lt;/b&gt;&lt;/font&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;Inductance&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;td colspan="3"&gt;&lt;input name="Calculate" type="button" value="Calculate" onclick="LRectangularLoop()" /&gt; &lt;input name="Reset" type="Reset" value="Clear" /&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/form&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;p&gt;&lt;b&gt;NOTE:&lt;/b&gt; numbers are in scientific notation (e.g.: 1.427e-9 H = 1.1427&amp;middot;10&lt;sup&gt;-9&lt;/sup&gt; H = 1.427 nH)&lt;/p&gt;&lt;p&gt;&lt;img width="733" height="53" src="https://technick.net/img/util_inductance/util_inductance_rectangle_formula.gif" border="0" alt="Formula" /&gt;&lt;br /&gt;&lt;br /&gt;&lt;font size="1"&gt;See also notes on &lt;a href="https://technick.net/tools/inductance-calculator"&gt;Inductance Calculations&lt;/a&gt; page.&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;&#10;&lt;script language="JavaScript" src="https://technick.net/js/inductancecalc.js" type="text/javascript"&gt;&lt;/script&gt;</description></item><item><title>Inductance of Round Wire over a Ground Plane</title><link>https://technick.net/tools/inductance-calculator/round-wire-over-ground-plane/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/tools/inductance-calculator/round-wire-over-ground-plane/</guid><description>&lt;blockquote&gt;Cross section of Round Wire transmission line over a Ground Plane&lt;br /&gt;&lt;table class="toolform" border="0" cellspacing="10" cellpadding="2"&gt;&lt;tr&gt;&lt;td align="left" valign="top"&gt;&lt;img src="https://technick.net/img/util_inductance/util_inductance_wire_g.gif" width="100" height="100" border="0" alt="Round Wire over a Ground Plane" /&gt;&lt;/td&gt;&lt;td align="left" valign="top"&gt;&lt;form action="" method="get" name="inductanceform" id="inductanceform"&gt;&lt;table class="toolform" border="0" cellspacing="0" cellpadding="0"&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;h&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="A" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;height of center from ground plane&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;a&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="B" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;wire radius&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;&amp;micro;&lt;sub&gt;r&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="C" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[&amp;nbsp;]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;relative permeability of the medium&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;font color="#800000"&gt;&lt;b&gt;L/l&lt;/b&gt;&lt;/font&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="L" size="20" readonly="readonly" /&gt;&lt;/td&gt;&lt;td&gt;&lt;font color="#800000"&gt;&lt;b&gt;[H/m]&lt;/b&gt;&lt;/font&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;Inductance per unit length&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;td colspan="3"&gt;&lt;input name="Calculate" type="button" value="Calculate" onclick="LWireG()" /&gt; &lt;input name="Reset" type="Reset" value="Clear" /&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/form&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;p&gt;&lt;b&gt;NOTE:&lt;/b&gt; numbers are in scientific notation (e.g.: 1.427e-9 H = 1.1427&amp;middot;10&lt;sup&gt;-9&lt;/sup&gt; H = 1.427 nH)&lt;/p&gt;&lt;p&gt;&lt;img src="https://technick.net/img/util_inductance/util_inductance_wire_g_formula.gif" width="342" height="52" border="0" alt="Formula" /&gt;&lt;br /&gt;&lt;br /&gt;&lt;font size="1"&gt;See also notes on &lt;a href="https://technick.net/tools/inductance-calculator"&gt;Inductance Calculations&lt;/a&gt; page.&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;&#10;&lt;script language="JavaScript" src="https://technick.net/js/inductancecalc.js" type="text/javascript"&gt;&lt;/script&gt;</description></item><item><title>Inductance of Square Loop</title><link>https://technick.net/tools/inductance-calculator/square-loop/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/tools/inductance-calculator/square-loop/</guid><description>&lt;blockquote&gt;Loop of wire with square shape&lt;br /&gt;&lt;table class="toolform" border="0" cellspacing="10" cellpadding="2"&gt;&lt;tr&gt;&lt;td align="left" valign="top"&gt;&lt;img src="https://technick.net/img/util_inductance/util_inductance_square.gif" width="100" height="100" border="0" alt="Square Loop" /&gt;&lt;/td&gt;&lt;td align="left" valign="top"&gt;&lt;form action="" method="get" name="inductanceform" id="inductanceform"&gt;&lt;table class="toolform" border="0" cellspacing="0" cellpadding="0"&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;N&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="A" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[&amp;nbsp;]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;number of turns&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;w&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="B" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;width of the rectangle&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;a&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="C" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;wire radius&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;&amp;micro;&lt;sub&gt;r&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="D" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[&amp;nbsp;]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;relative permeability of the medium&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;font color="#800000"&gt;&lt;b&gt;L&lt;/b&gt;&lt;/font&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="L" size="20" readonly="readonly" /&gt;&lt;/td&gt;&lt;td&gt;&lt;font color="#800000"&gt;&lt;b&gt;[H]&lt;/b&gt;&lt;/font&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;Inductance&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;td colspan="3"&gt;&lt;input name="Calculate" type="button" value="Calculate" onclick="LSquareLoop()" /&gt; &lt;input name="Reset" type="Reset" value="Clear" /&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/form&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;p&gt;&lt;b&gt;NOTE:&lt;/b&gt; numbers are in scientific notation (e.g.: 1.427e-9 H = 1.1427&amp;middot;10&lt;sup&gt;-9&lt;/sup&gt; H = 1.427 nH)&lt;/p&gt;&lt;p&gt;&lt;img width="258" height="42" src="https://technick.net/img/util_inductance/util_inductance_square_formula.gif" border="0" alt="Formula" /&gt;&lt;br /&gt;&lt;br /&gt;&lt;font size="1"&gt;See also notes on &lt;a href="https://technick.net/tools/inductance-calculator"&gt;Inductance Calculations&lt;/a&gt; page.&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;&#10;&lt;script language="JavaScript" src="https://technick.net/js/inductancecalc.js" type="text/javascript"&gt;&lt;/script&gt;</description></item><item><title>Inductance of Twin Lead</title><link>https://technick.net/tools/inductance-calculator/twin-lead/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/tools/inductance-calculator/twin-lead/</guid><description>&lt;blockquote&gt;Cross section of Twin Lead transmission line&lt;br /&gt;&lt;table class="toolform" border="0" cellspacing="10" cellpadding="2"&gt;&lt;tr&gt;&lt;td align="left" valign="top"&gt;&lt;img src="https://technick.net/img/util_inductance/util_inductance_wire_2.gif" width="100" height="46" border="0" alt="Twin Lead" /&gt;&lt;/td&gt;&lt;td align="left" valign="top"&gt;&lt;form action="" method="get" name="inductanceform" id="inductanceform"&gt;&lt;table class="toolform" border="0" cellspacing="0" cellpadding="0"&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;d&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="A" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;distance from center to center&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;a&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="B" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;wire radius&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;&amp;micro;&lt;sub&gt;r&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="C" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[&amp;nbsp;]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;relative permeability of the medium&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;font color="#800000"&gt;&lt;b&gt;L/l&lt;/b&gt;&lt;/font&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="L" size="20" readonly="readonly" /&gt;&lt;/td&gt;&lt;td&gt;&lt;font color="#800000"&gt;&lt;b&gt;[H/m]&lt;/b&gt;&lt;/font&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;Inductance per unit length&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;td colspan="3"&gt;&lt;input name="Calculate" type="button" value="Calculate" onclick="LTwinLead()" /&gt; &lt;input name="Reset" type="Reset" value="Clear" /&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/form&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;p&gt;&lt;b&gt;NOTE:&lt;/b&gt; numbers are in scientific notation (e.g.: 1.427e-9 H = 1.1427&amp;middot;10&lt;sup&gt;-9&lt;/sup&gt; H = 1.427 nH)&lt;/p&gt;&lt;p&gt;&lt;img src="https://technick.net/img/util_inductance/util_inductance_wire_2_formula.gif" width="342" height="52" border="0" alt="Formula" /&gt;&lt;br /&gt;&lt;br /&gt;&lt;font size="1"&gt;See also notes on &lt;a href="https://technick.net/tools/inductance-calculator"&gt;Inductance Calculations&lt;/a&gt; page.&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;&#10;&lt;script language="JavaScript" src="https://technick.net/js/inductancecalc.js" type="text/javascript"&gt;&lt;/script&gt;</description></item><item><title>Inductance of Vertically Spaced Traces</title><link>https://technick.net/tools/inductance-calculator/vertically-spaced-traces/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/tools/inductance-calculator/vertically-spaced-traces/</guid><description>&lt;blockquote&gt;Cross section of Vertically Spaced Traces transmission line&lt;br /&gt;&lt;table class="toolform" border="0" cellspacing="10" cellpadding="2"&gt;&lt;tr&gt;&lt;td align="left" valign="top"&gt;&lt;img src="https://technick.net/img/util_inductance/util_inductance_trace_v.gif" width="100" height="60" border="0" alt="Vertically Spaced Traces" /&gt;&lt;/td&gt;&lt;td align="left" valign="top"&gt;&lt;form action="" method="get" name="inductanceform" id="inductanceform"&gt;&lt;table class="toolform" border="0" cellspacing="0" cellpadding="0"&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;w&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="A" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;width of the traces&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;h&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="B" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;center-to-center spacing of traces&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;t&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="C" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;thickness of the traces&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;&amp;micro;&lt;sub&gt;r&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="D" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[&amp;nbsp;]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;relative permeability of the medium&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;font color="#800000"&gt;&lt;b&gt;L/l&lt;/b&gt;&lt;/font&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="L" size="20" readonly="readonly" /&gt;&lt;/td&gt;&lt;td&gt;&lt;font color="#800000"&gt;&lt;b&gt;[H/m]&lt;/b&gt;&lt;/font&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;Inductance per unit length&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;td colspan="3"&gt;&lt;input name="Calculate" type="button" value="Calculate" onclick="LTraceV()" /&gt; &lt;input name="Reset" type="Reset" value="Clear" /&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/form&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;p&gt;&lt;b&gt;NOTE:&lt;/b&gt; numbers are in scientific notation (e.g.: 1.427e-9 H = 1.1427&amp;middot;10&lt;sup&gt;-9&lt;/sup&gt; H = 1.427 nH)&lt;/p&gt;&lt;p&gt;&lt;img src="https://technick.net/img/util_inductance/util_inductance_trace_v_formula.gif" width="316" height="51" border="0" alt="Formula" /&gt;&lt;br /&gt;&lt;br /&gt;&lt;font size="1"&gt;See also notes on &lt;a href="https://technick.net/tools/inductance-calculator"&gt;Inductance Calculations&lt;/a&gt; page.&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;&#10;&lt;script language="JavaScript" src="https://technick.net/js/inductancecalc.js" type="text/javascript"&gt;&lt;/script&gt;</description></item><item><title>Inductance of Wide Trace over a Ground Plane</title><link>https://technick.net/tools/inductance-calculator/wide-trace-over-ground-plane/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/tools/inductance-calculator/wide-trace-over-ground-plane/</guid><description>&lt;blockquote&gt;Cross section of Wide Trace transmission line over a Ground Plane&lt;br /&gt;&lt;table class="toolform" border="0" cellspacing="10" cellpadding="2"&gt;&lt;tr&gt;&lt;td align="left" valign="top"&gt;&lt;img src="https://technick.net/img/util_inductance/util_inductance_trace_g.gif" width="100" height="75" border="0" alt="Cross section of Wide Trace transmission line over a Ground Plane" /&gt;&lt;/td&gt;&lt;td align="left" valign="top"&gt;&lt;form action="" method="get" name="inductanceform" id="inductanceform"&gt;&lt;table class="toolform" border="0" cellspacing="0" cellpadding="0"&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;w&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="A" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;width of the trace&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;h&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="B" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;height of the trace above ground&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;t&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="C" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;thickness of the trace&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;&amp;micro;&lt;sub&gt;r&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="D" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[&amp;nbsp;]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;relative permeability of the medium&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;font color="#800000"&gt;&lt;b&gt;L/l&lt;/b&gt;&lt;/font&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="L" size="20" readonly="readonly" /&gt;&lt;/td&gt;&lt;td&gt;&lt;font color="#800000"&gt;&lt;b&gt;[H/m]&lt;/b&gt;&lt;/font&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;Inductance per unit length&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;td colspan="3"&gt;&lt;input name="Calculate" type="button" value="Calculate" onclick="LTraceG()" /&gt; &lt;input name="Reset" type="Reset" value="Clear" /&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/form&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;p&gt;&lt;b&gt;NOTE:&lt;/b&gt; numbers are in scientific notation (e.g.: 1.427e-9 H = 1.1427&amp;middot;10&lt;sup&gt;-9&lt;/sup&gt; H = 1.427 nH)&lt;/p&gt;&lt;p&gt;&lt;img src="https://technick.net/img/util_inductance/util_inductance_trace_g_formula.gif" width="316" height="51" border="0" alt="Formula" /&gt;&lt;br /&gt;&lt;br /&gt;&lt;font size="1"&gt;See also notes on &lt;a href="https://technick.net/tools/inductance-calculator"&gt;Inductance Calculations&lt;/a&gt; page.&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Mathematics of the Discrete Fourier Transform (DFT)</title><link>https://technick.net/guides/theory/dft/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;</description></item><item><title>Mouse Cleaning</title><link>https://technick.net/guides/hardware/mouse_cleaning/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/mouse_cleaning/</guid><description>&lt;p style="float:right;"&gt;&#10;&lt;img src="https://technick.net/img/guide_mc/guide_mc_001.jpg" width="150" height="121" border="0" alt="" /&gt;&#10;&lt;img src="https://technick.net/img/guide_mc/guide_mc_003.jpg" width="100" height="72" border="0" alt="" /&gt;&#10;&lt;img src="https://technick.net/img/guide_mc/guide_mc_002.jpg" width="50" height="139" border="0" alt="" /&gt;&#10;&lt;img src="https://technick.net/img/guide_mc/guide_mc_004.jpg" width="100" height="67" border="0" alt="" /&gt;&#10;&lt;img src="https://technick.net/img/guide_mc/guide_mc_005.jpg" width="150" height="100" border="0" alt="" /&gt;&#10;&lt;img src="https://technick.net/img/guide_mc/guide_mc_006.jpg" width="150" height="100" border="0" alt="" /&gt;&#10;&lt;img src="https://technick.net/img/guide_mc/guide_mc_007.jpg" width="150" height="100" border="0" alt="" /&gt;&#10;&lt;img src="https://technick.net/img/guide_mc/guide_mc_010.jpg" width="150" height="100" border="0" alt="" /&gt;&#10;&lt;img src="https://technick.net/img/guide_mc/guide_mc_011.jpg" width="150" height="100" border="0" alt="" /&gt;&#10;&lt;img src="https://technick.net/img/guide_mc/guide_mc_012.jpg" width="150" height="100" border="0" alt="" /&gt;&#10;&lt;img src="https://technick.net/img/guide_mc/guide_mc_015.jpg" width="150" height="100" border="0" alt="" /&gt;&#10;&lt;img src="https://technick.net/img/guide_mc/guide_mc_013.jpg" width="150" height="100" border="0" alt="" /&gt;&#10;&lt;img src="https://technick.net/img/guide_mc/guide_mc_008.jpg" width="150" height="100" border="0" alt="" /&gt;&#10;&lt;img src="https://technick.net/img/guide_mc/guide_mc_009.jpg" width="150" height="100" border="0" alt="" /&gt;&#10;&lt;img src="https://technick.net/img/guide_mc/guide_mc_014.jpg" width="150" height="100" border="0" alt="" /&gt;&#10;&lt;/p&gt;&#10;&lt;p&gt;When you run your mouse over the desktop it picks up all kinds of debris, gunk, and goo that can get drawn up into the insides of the mouse and cause it to stop working well.&lt;br /&gt;&#10;If you find that the pointer on the screen doesn't move smoothly or that the trackball inside the mouse doesn't move freely, you should clean the mouse.&lt;br /&gt;&#10;&lt;br /&gt;&#10;You could go to a computer store and buy one of those fancy mouse-cleaning kits, but, in my opinion, there really isn't any need. You're going to be able to clean it as well as anything using these inexpensive items:&lt;br /&gt;&#10;&lt;br /&gt;&#10;&lt;ul&gt;&lt;li&gt;Few clean cotton swabs.&lt;/li&gt;&lt;li&gt;Denatured alcohol. (I recommend denatured alcohol over rubbing alcohol, which has glycerine in it and can leave some slippery residue behind).&lt;/li&gt;&lt;li&gt;Water.&lt;/li&gt;&lt;li&gt;Mild soap.&lt;/li&gt;&lt;li&gt;A clean, soft, lint-free cloth (100% cotton works best).&lt;/li&gt;&lt;li&gt;An old toothbrush.&lt;/li&gt;&lt;/ul&gt;&lt;font size="+1"&gt;&lt;b&gt;To clean your mouse, follow these steps:&lt;/b&gt;&lt;/font&gt;&lt;br /&gt;&#10;&lt;br /&gt;&#10;&lt;b&gt;1.&lt;/b&gt; Shut down and turn off your computer.&lt;br /&gt;&#10;&lt;br /&gt;&#10;&lt;b&gt;2.&lt;/b&gt; Disconnect the mouse cable from the computer.&lt;br /&gt;&#10;&lt;br /&gt;&#10;&lt;b&gt;3.&lt;/b&gt; Remove the trackball&lt;br /&gt;&#10;&lt;br /&gt;&#10;&lt;ul&gt;&lt;b&gt;3.1&lt;/b&gt; Turn your mouse upside down.&lt;br /&gt;&#10;&lt;b&gt;3.2&lt;/b&gt; Unlock the disk that's holding the trackball in place by either rotate counter-clockwise or slide in one direction.&lt;br /&gt;&#10;&lt;b&gt;3.3&lt;/b&gt; Turn the mouse right side up with one hand and catch the ring and trackball with your other hand. Give it a shake if they don't dislodge themselves.&lt;br /&gt;&#10;&lt;/ul&gt;&lt;b&gt;4.&lt;/b&gt; Wash the trackball and the retainer ring with warm soapy water using an old toothbrush. Rub the trackball thoroughly to remove any oily build-up.&lt;br /&gt;&#10;&lt;br /&gt;&#10;&lt;b&gt;5.&lt;/b&gt; Dry the trackball and the retainer ring thoroughly with a clean lint-free cloth.&lt;br /&gt;&#10;&lt;br /&gt;&#10;&lt;b&gt;6.&lt;/b&gt; Set the trackball and the retainer ring aside.&lt;br /&gt;&#10;&lt;br /&gt;&#10;&lt;b&gt;7.&lt;/b&gt; Moisten a lint-free cloth with denatured alcohol and gently rub the mouse back surface and trackball compartment. Blow into the trackball compartment to remove any dust or lint from inside.&lt;br /&gt;&#10;&lt;br /&gt;&#10;&lt;b&gt;8.&lt;/b&gt; Take a close look at the three rollers inside the mouse. You'll probably see lines of dirt that have accumulated over many months or even years of usage. These lines of dirt build up and cause jerky or erratic mouse movements. Clean the three small rollers inside the mouse with a cotton swab moistened with denatured alcohol. The cotton should be just a little damp. Rotate the rollers to clean all around them. Work the tip along each roller side to side until the line of dirt disappears. If there is a build-up of material on the rollers which the cotton swab does not remove, you can use your fingernail or a tweezer to gently remove the material.&lt;br /&gt;&#10;&lt;b&gt;WARNING:&lt;/b&gt; The rollers must remain smooth so be very careful not to gouge them with anything!&lt;br /&gt;&#10;&lt;br /&gt;&#10;&lt;b&gt;9.&lt;/b&gt; When it's clean, let it dry out for a moment or two.&lt;br /&gt;&#10;&lt;br /&gt;&#10;&lt;b&gt;10.&lt;/b&gt; Put the trackball back into the mouse and close the mouse trackball cover with a clockwise motion.&lt;br /&gt;&#10;&lt;br /&gt;&#10;&lt;b&gt;11.&lt;/b&gt; Reconnect the mouse cable to the computer.&lt;br /&gt;&#10;&lt;br /&gt;&#10;&lt;b&gt;12.&lt;/b&gt; Restart your computer and test mouse's movement.&lt;br /&gt;&#10;&lt;br /&gt;&#10;&lt;b&gt;13.&lt;/b&gt; Your mouse should be as good as new.&lt;br /&gt;&#10;&lt;br /&gt;&#10;&lt;br /&gt;&#10;&lt;b&gt;NOTE:&lt;/b&gt; Always use a clean mouse pad, free from dust, when moving your mouse.&lt;/p&gt;</description></item><item><title>Multiples and Submultiples Prefixes Tables</title><link>https://technick.net/guides/theory/tables_prefix/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/tables_prefix/</guid><description>&lt;hr /&gt;&lt;b&gt;(&lt;a href="#Siprefix"&gt;SI Prefixes Table&lt;/a&gt;, &lt;a href="#IECprefix"&gt;IEC Prefixes for binary multiples&lt;/a&gt;)&lt;/b&gt;&lt;a name="SIprefix"&gt;&lt;/a&gt; &lt;p&gt;&lt;/p&gt;&lt;font size="+2"&gt;&lt;b&gt; SI Prefixes Table&lt;/b&gt;&lt;/font&gt;&lt;br /&gt;The International System of Units, universally abbreviated SI (from the French Le Syst&amp;egrave;me International d'Unit&amp;eacute;s), is the modern metric system of measurement.&lt;br /&gt;The 20 SI prefixes used to form decimal multiples and submultiples of SI units are:&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;table border="4" cellpadding="3" cellspacing="1"&gt;&lt;tr align="middle" bgcolor="#0080C0" style="color: #FFFFFF"&gt;&lt;th&gt;Symbol&lt;/th&gt;&lt;th&gt;Name&lt;/th&gt;&lt;th&gt;Factor&lt;/th&gt;&lt;th bgcolor="#FFFFC0"&gt;&lt;/th&gt;&lt;th&gt;Symbol&lt;/th&gt;&lt;th&gt;Name&lt;/th&gt;&lt;th&gt;Factor&lt;/th&gt;&lt;/tr&gt;&lt;tr align="middle" bgcolor="#FFFFC0"&gt;&lt;td&gt;Y&lt;/td&gt;&lt;td&gt;yotta&lt;/td&gt;&lt;td&gt;10&lt;sup&gt;24&lt;/sup&gt;&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;y&lt;/td&gt;&lt;td&gt;yokto&lt;/td&gt;&lt;td&gt;10&lt;sup&gt;-24&lt;/sup&gt;&lt;/td&gt;&lt;/tr&gt;&lt;tr align="middle" bgcolor="#FFFFC0"&gt;&lt;td&gt;Z&lt;/td&gt;&lt;td&gt;zetta&lt;/td&gt;&lt;td&gt;10&lt;sup&gt;21&lt;/sup&gt;&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;z&lt;/td&gt;&lt;td&gt;zepto&lt;/td&gt;&lt;td&gt;10&lt;sup&gt;-21&lt;/sup&gt;&lt;/td&gt;&lt;/tr&gt;&lt;tr align="middle" bgcolor="#FFFFC0"&gt;&lt;td&gt;E&lt;/td&gt;&lt;td&gt;exa&lt;/td&gt;&lt;td&gt;10&lt;sup&gt;18&lt;/sup&gt;&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;a&lt;/td&gt;&lt;td&gt;atto&lt;/td&gt;&lt;td&gt;10&lt;sup&gt;-18&lt;/sup&gt;&lt;/td&gt;&lt;/tr&gt;&lt;tr align="middle" bgcolor="#FFFFC0"&gt;&lt;td&gt;P&lt;/td&gt;&lt;td&gt;peta&lt;/td&gt;&lt;td&gt;10&lt;sup&gt;15&lt;/sup&gt;&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;f&lt;/td&gt;&lt;td&gt;femto&lt;/td&gt;&lt;td&gt;10&lt;sup&gt;-15&lt;/sup&gt;&lt;/td&gt;&lt;/tr&gt;&lt;tr align="middle" bgcolor="#FFFFC0"&gt;&lt;td&gt;T&lt;/td&gt;&lt;td&gt;tera&lt;/td&gt;&lt;td&gt;10&lt;sup&gt;12&lt;/sup&gt;&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;p&lt;/td&gt;&lt;td&gt;pico&lt;/td&gt;&lt;td&gt;10&lt;sup&gt;-12&lt;/sup&gt;&lt;/td&gt;&lt;/tr&gt;&lt;tr align="middle" bgcolor="#FFFFC0"&gt;&lt;td&gt;G&lt;/td&gt;&lt;td&gt;giga&lt;/td&gt;&lt;td&gt;10&lt;sup&gt;9&lt;/sup&gt;&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;n&lt;/td&gt;&lt;td&gt;nano&lt;/td&gt;&lt;td&gt;10&lt;sup&gt;-9&lt;/sup&gt;&lt;/td&gt;&lt;/tr&gt;&lt;tr align="middle" bgcolor="#FFFFC0"&gt;&lt;td&gt;M&lt;/td&gt;&lt;td&gt;mega&lt;/td&gt;&lt;td&gt;10&lt;sup&gt;6&lt;/sup&gt;&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;&amp;micro; &lt;/td&gt;&lt;td&gt;micro&lt;/td&gt;&lt;td&gt;10&lt;sup&gt;-6&lt;/sup&gt;&lt;/td&gt;&lt;/tr&gt;&lt;tr align="middle" bgcolor="#FFFFC0"&gt;&lt;td&gt;k&lt;/td&gt;&lt;td&gt;kilo&lt;/td&gt;&lt;td&gt;10&lt;sup&gt;3&lt;/sup&gt;&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;m&lt;/td&gt;&lt;td&gt;milli&lt;/td&gt;&lt;td&gt;10&lt;sup&gt;-3&lt;/sup&gt;&lt;/td&gt;&lt;/tr&gt;&lt;tr align="middle" bgcolor="#FFFFC0"&gt;&lt;td&gt;h&lt;/td&gt;&lt;td&gt;hecto&lt;/td&gt;&lt;td&gt;10&lt;sup&gt;2&lt;/sup&gt;&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;c&lt;/td&gt;&lt;td&gt;centi&lt;/td&gt;&lt;td&gt;10&lt;sup&gt;-2&lt;/sup&gt;&lt;/td&gt;&lt;/tr&gt;&lt;tr align="middle" bgcolor="#FFFFC0"&gt;&lt;td&gt;da&lt;/td&gt;&lt;td&gt;deka&lt;/td&gt;&lt;td&gt;10&lt;sup&gt;1&lt;/sup&gt;&lt;/td&gt;&lt;td&gt;&lt;/td&gt;&lt;td&gt;d&lt;/td&gt;&lt;td&gt;deci&lt;/td&gt;&lt;td&gt;10&lt;sup&gt;-1&lt;/sup&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;It is important to note that the kilogram is the only SI unit with a prefix as part of its name and symbol. Because multiple prefixes may not be used, in the case of the kilogram the prefix names of Table are used with the unit name "gram" and the prefix symbols are used with the unit symbol "g." With this exception, any SI prefix may be used with any SI unit, including the degree Celsius and its symbol &amp;deg;C.&lt;/p&gt;</description></item><item><title>Networking</title><link>https://technick.net/guides/hardware/net/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/net/</guid><description/></item><item><title>On Cables and Connections</title><link>https://technick.net/guides/electronics/cabling/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/cabling/</guid><description>&lt;blockquote&gt;&lt;table align="center"&gt;&lt;tr&gt;&lt;td bgcolor="#ffffcc"&gt;&lt;font size="1"&gt;The original &lt;i&gt;On Cables and Connections - A discussion by Dr. J. Kramer&lt;/i&gt; is Copyright &amp;copy; &lt;a href="http://www.kramerelectronics.com" target="_blank"&gt;KRAMER ELECTRONICS LTD. (www.kramerelectronics.com)&lt;/a&gt;. &#10;All rights reserved. No part of this publication may be reproduced, transmitted, transcribed, stored in a retrieval system or translated into any language or computer language in any form or by any means without written permission of &lt;a href="http://www.kramerelectronics.com" target="_blank"&gt;KRAMER ELECTRONICS LTD.&lt;/a&gt; Sapir Center, Building 5, Jerusalem 95461, Israel - TEL:(972-2)-6524715, FAX:(972-2)-6535369 - Email: &lt;a href="mailto:kramerel@netvision.net.il"&gt;kramerel@netvision.net.il&lt;/a&gt; &#10;This is a personalized version reproduced by permission.&lt;/font&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;p&gt;&lt;ul&gt;&lt;li&gt;&lt;a href="#intro"&gt;Introduction&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href="#rules"&gt;Rules-of-thumb to prevent cable problems&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href="#lengthquality"&gt;Cable length and quality&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href="#solvingproblems"&gt;Solving cable related problems&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href="#longdistance"&gt;When longer distances are needed&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a href="#lineamplifiers"&gt;Line Amplifiers&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href="#twistedpair"&gt;The twisted-pair solution&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href="#fiberoptic"&gt;The fiber-optic solution&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href="#rf"&gt;The RF solution&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a href="#audiowiresproblems"&gt;Problems related to audio wires&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a href="#highcapacitance"&gt;Dealing with high capacitance audio wires&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href="#noisepickup"&gt;Dealing with noise pickup&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href="#signalloss"&gt;Signal loss and deterioration due to cable impedance&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href="#qualitydegradation"&gt;Dealing with amplifier output quality degradation due to cable resistance&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a href="#finalword"&gt;A final word&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/p&gt;&lt;a name="intro"&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;h3&gt;Introduction&lt;/h3&gt;&lt;p&gt;We are frequently asked - "what length of cable can I use for a specific&#10;application?" Seemingly a simple question, but the answer is quite complicated.&lt;br /&gt;&lt;br /&gt;Basically, cables connecting different types of equipment should ideally behave as&#10;"shorts", meaning that the output from the receiving device should be as if it is&#10;connected directly to the transmitting device. Unfortunately, they don't. Connecting&#10;cables have their own characteristics, which they impose on the signals they carry. An&#10;ideal cable should behave as an ideal "transmission line", having no effect on the&#10;signal. Nevertheless, cables behave otherwise.&lt;br /&gt;&lt;br /&gt;Two major factors play an important role in signal deterioration due to poor cables:&lt;ol&gt;&lt;li&gt;First, cables do not behave as ideal transmission lines with known impedance&#10;due to flaws in cable design and production. Sometimes the impedance of the cable&#10;is simply not as stated on the cable.&lt;/li&gt;&lt;li&gt;Second, due to imperfection in cable design, stray (parasite) capacitance and&#10;inductance appear along the cable and they have an adverse effect on signal quality.&lt;/li&gt;&lt;/ol&gt;The longer the cables used the more adverse effects they have on the signals being&#10;transmitted. Better cables alleviate this problem. A very popular cable used for video is&#10;"RG-59" type. For short distances - a meter or two - this cable is fine, and the signals,&#10;which emerge, look as if they were connected directly by an ideal short. At composite&#10;video frequencies, up to 10 MHz, the high frequency loss of this cable is about 3 dB&#10;after 100 meters. Therefore, deterioration is not apparent even at 20 meters. However,&#10;at 300 MHz, (the frequencies encountered in high-resolution or digital video) the loss&#10;at 100 meters is close to 20 dB, which is disastrous to the signal. When using SDI&#10;(Serial Digital) signals, at 270 Mbits/sec, a loss of 40 dB may occur at 300 meters.&#10;This represents a signal deterioration of 99% (down to 1% of the original signal!)&lt;/p&gt;&lt;a name="rules"&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;h3&gt;Rules-of-thumb to prevent cable problems:&lt;/h3&gt;&lt;p&gt;&lt;ul&gt;&lt;li&gt;Use the best cables you can afford.&lt;/li&gt;&lt;li&gt;Use the shortest cables possible.&lt;/li&gt;&lt;li&gt;Check that impedance of the cable really matches your application.&lt;/li&gt;&lt;li&gt;Check the connectors on the cables. Poor quality connectors may have worse effects than the cables themselves.&lt;/li&gt;&lt;li&gt;Use appropriate amplifiers if needed.&lt;/li&gt;&lt;li&gt;Keep cables away from sources of interference - electric motors, mains cables, transmitters, triac operated equipment (light dimmers) etc.&lt;/li&gt;&lt;/ul&gt;&lt;/p&gt;&lt;a name="lengthquality"&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;h3&gt;Cable length and quality:&lt;/h3&gt;&lt;p&gt;&lt;ul&gt;&lt;li&gt;For composite video, PAL or NTSC, RG-59 cable can be used for distances of&#10;up to 20 meters between the video source and the acceptor. No signal deterioration&#10;should show on the screen. For longer distances, up to 30 meters, use RG-11 type&#10;cable. For still longer distances, better cables should be used, such as Belden 8281&#10;or Belden 1694A (which are also suitable for SDI signals). Those cables extend the&#10;range by 50% and more.&lt;/li&gt;&lt;li&gt;For s-Video (Y/C, Super-VHS and Hi-8), standard, inexpensive cables allow&#10;operating distances of 5-7 meters. Very little deterioration is apparent. At this&#10;distance lower quality cables would show color "smear" and blurred images. Better&#10;than standard quality cables will show no deterioration whatsoever. The quality of&#10;the s-Video connector, often overlooked, plays a very important role in final signal&#10;quality.&lt;/li&gt;&lt;li&gt;Analog component video signals - whether Y, R-Y and B-Y or RGB should be&#10;treated very carefully. If the origin of the component video signal is a VCR or a&#10;camera, in order to maintain good quality (especially for the "Y" signal), RG-59&#10;cables are suitable for up to 10 meters. For longer distances, up to 20-25 meters, a&#10;better cable should be used - either RG-11 or an appropriate Belden cable (see&#10;above). Component signals such as RGB signals from computer graphics sources&#10;should be treated as computer sources (see below.).&lt;/li&gt;&lt;li&gt;Computer graphics cards generating VGA, Super-VGA or XGA signals need a&#10;different approach, depending on resolution. Standard, commonly available VGA&#10;cables are suitable for 640x480 resolution at distances of up to 1.5 meters. At&#10;800x600, such cables are suitable for distances of not more than 80 centimeters.&#10;They are not suitable for use at higher resolutions.&#10;Special VGA/XGA cables should be used for resolutions of 1024x768 and above.&#10;The best quality cables of the packed-in-one-sleeve type are suitable for up to 10&#10;meters, albeit with some apparent deterioration.&#10;When computer graphics or other high frequency component signals are used, the&#10;compound output should be transmitted over coax cables which are divided into&#10;individual, separately sleeved lines, of one of the types mentioned above. For &#10;VGA/XGA signals, 5 cables are needed for setups of Red, Green, Blue, Horizontal&#10;Sync and Vertical Sync, and four cables are needed for setups with Red, Green,&#10;Blue and Composite Sync. Three cables are needed for setups either with Red,&#10;Blue, Green+Sync or when the composite sync signal is superimposed on all&#10;signals (Red Green and Blue).&lt;/li&gt;&lt;/ul&gt;&lt;/p&gt;&lt;a name="solvingproblems"&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;h3&gt;Solving cable related problems&lt;/h3&gt;&lt;p&gt;The problems cable generate that can be completely or partially solved divide into&#10;several categories:&lt;ul&gt;&lt;li&gt;General signal loss and attenuation due to incorrect impedance characteristics. If&#10;you feed a long cable with 1-Volt composite video, you may find on the far end&#10;only about 0.9 Volts.&lt;/li&gt;&lt;li&gt;High frequency losses due to the wrong capacitance and inductance. Such high&#10;frequency loss in video shows up as loss of color, from color smears to up to full&#10;color loss, loss of picture resolution and loss of fine details.&lt;/li&gt;&lt;li&gt;Standing wave and reflection effects due to impedance mismatch between circuit&#10;and cable. The visible result of this problem is the "ringing" effect, where ghost&#10;lines appear on vertical image transitions, thus upsetting image integrity.&lt;/li&gt;&lt;/ul&gt;&lt;/p&gt;&lt;a name="longdistance"&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;h3&gt;When longer distances are needed&lt;/h3&gt;&lt;p&gt;As we have seen, cable lengths impose limitations in all formats. The available&#10;solutions are as follows, assuming that the best cables and connectors are used:&lt;ul&gt;&lt;li&gt;Use line amplifiers to extend the range.&lt;/li&gt;&lt;li&gt;Use twisted pair transmitters and receivers for longer ranges.&lt;/li&gt;&lt;li&gt;Use fiber-optic transceivers to extend the range even further.&lt;/li&gt;&lt;li&gt;Use RF transmission (microwave or HF) or satellite uplink for very long distances.&lt;/li&gt;&lt;/ul&gt;&lt;/p&gt;&lt;a name="lineamplifiers"&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;h4&gt;Line Amplifiers&lt;/h4&gt;&lt;p&gt;Line amplifiers overcome the following shortcomings of long cable installations:&lt;ul&gt;&lt;li&gt;Loss of overall signal level.&lt;/li&gt;&lt;li&gt;Loss of high frequency signals due to stray capacitance and inductance.&lt;/li&gt;&lt;li&gt;Mismatch of cable impedance.&lt;/li&gt;&lt;/ul&gt;Line amplifiers should be installed as close as possible to the video source to achieve&#10;the best signal to noise ratio.&lt;br /&gt;Line amplifiers are equipped with several controls or trimmer adjustments to control&#10;signal level. Some are for boosting and compensating for overall signal loss. Others&#10;control high frequency losses, and are called EQ (Cable Equalization) or HF (High&#10;Frequency) controls. EQ controls apply a variable, frequency dependent amplification&#10;to the signal, to "straighten" the tilted frequency response curve of the cable. In this&#10;way, the distortions of the cable can be eliminated.&lt;br /&gt;Line amplifiers cure source impedance mismatch by driving the cable with an accurate&#10;impedance drive.&lt;br /&gt;&lt;br /&gt;Line amplifiers differ in their functions, depending on their use:&lt;ul&gt;&lt;li&gt;Line amplifiers for composite video have simple controls, as mentioned above.&lt;/li&gt;&lt;li&gt;Line amplifiers for S-Video (Y/C) have separate controls for Y and C.&#10;Sometimes Y/C line amplifiers have additional controls such as Chroma phase&#10;control.&lt;/li&gt;&lt;li&gt;Line amplifiers for twisted-pair setups have simple controls similar to those for&#10;composite.&lt;/li&gt;&lt;li&gt;Line amplifiers for component video, RGB or VGA/XGA signals are more&#10;complicated. For example, in the case of VGA/XGA, one control must adjust three&#10;different signals.&lt;/li&gt;&lt;li&gt;Line amplifiers for SDI (Serial Digital) video have two-correction circuitry&#10;built-in: cable compensation and reclocking. Digital signals, besides being&#10;attenuated, become jittery when using long cables and the reclocking circuitry&#10;time-base corrects them.&lt;/li&gt;&lt;/ul&gt;With a reasonable quality line amplifier, effective operation range may be multiplied&#10;by a factor of from 2-10, depending on the format and cable used. It is not uncommon&#10;to find installations with video lines running 300 meter, using high quality cables and&#10;one or more line amplifiers inserted in series.&lt;br /&gt;Line amplifiers may be cascaded. Inserting a line amplifier every 80 meters in a&#10;composite video setup is quite common. In component or Y/C setups, line amplifiers&#10;should be inserted closer together, 40 meters or so, though good cables must be used.&#10;To transmit high resolution computer graphics signals over long distances, the best&#10;way is to split the compound VGA/XGA cable to RGB coax cables, as explained&#10;above, and use coax line amplifiers. If this is not possible, bear in mind that a line&#10;amplifier should be inserted in the signal path every 10 meters maximum, and this only&#10;when very high quality cable is used.&lt;br /&gt;&lt;br /&gt;When long distance line-amplification is used, ground-related problems such as hum&#10;and ground loops often arise. This is due to different ground potentials between the&#10;local and remote locations. Ground isolation and differential amplification is often&#10;needed to cure the ground-related problems.&lt;/p&gt;&lt;a name="twistedpair"&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;h4&gt;The twisted-pair solution&lt;/h4&gt;&lt;p&gt;Twisted pair may be the most appropriate solution to transmit composite video signals&#10;over long distances, of 100 meters up to 1km. Such a system includes a twisted pair&#10;video or AV transmitter which converts video into a twisted-pair, differential input,&#10;balanced format. On the receiving end, a twisted-pair receiver converts the twisted pair&#10;signal back to a standard video signal.&lt;br /&gt;&lt;br /&gt;Any type of twisted pair or dual-wire cables can be used because, in most cases, the&#10;transmitter can force the impedance of the twisted-pair cable to match that of the&#10;transmitter. However, the twisted pair solution is dependent on wire quality. Low&#10;quality twisted pair wires, which have high capacitance or are over-shielded, limit the&#10;effective range of the system. Twisted-pair is also less prone to ground related&#10;problems.&lt;br /&gt;&lt;br /&gt;Twisted pair setups linking distances of 500 meters between source and acceptor are&#10;quite common. Line amplifiers specially designed for twisted pair applications extend&#10;the range of operation. The rule of thumb is that when a system performs well at 500&#10;meters, a line amplifier inserted at that point effectively doubles the operating distance.&lt;br /&gt;&lt;br /&gt;Twisted pair works well for composite video where bandwidths approach 5 MHz. A&#10;good quality, color-rich signal is obtained on the far end. This system is not suitable&#10;for Y/C, Component video or VGA signals, due to the high-frequency nature of those&#10;signals.&lt;/p&gt;&lt;a name="fiberoptic"&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;h4&gt;The fiber-optic solution&lt;/h4&gt;&lt;p&gt;For operating distances of over 1km, fiber optic is recommended. It converts electric&#10;signals to beams of light, and transmits them over an optic fiber. The beam of light is&#10;usually infrared and can have different wavelengths. A fiber optic system includes a&#10;transmitter and a receiver. The transmitter converts the electric signal to a light beam,&#10;and the receiver converts the light beam back into an electric, such as video, signal.&lt;br /&gt;&lt;br /&gt;There are two types of optic fiber, multi-mode and single-mode. Using multi-mode&#10;systems with transmitter, optic fiber and receiver, the useful distance for analog&#10;composite video is up to 5km. Using single-mode, this range may be extended to up to&#10;25km. For still longer distances, special transmitting elements create an intense laser&#10;beam which can be carried by the appropriate optic fiber for 50km or more. Line&#10;amplifiers may be used with fiber optics as well, but they are far more complicated.&lt;/p&gt;&lt;a name="rf"&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;h4&gt;The RF solution&lt;/h4&gt;&lt;p&gt;Microwave transmitter / receivers, or satellite communication transceiving systems can&#10;extend the range of transmission to many kilometers, but this is different technology&#10;and will therefore not be discussed here.&lt;/p&gt;&lt;a name="audiowiresproblems"&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;h3&gt;Problems related to audio wires&lt;/h3&gt;&lt;p&gt;As mentioned above, transmitting audio signals over long distances can also create a&#10;host of problems. The audio system may transmit low power signals (line, Mic or&#10;balanced) or high power signals, such as those used in standard loudspeakers. Audio&#10;cabling system and design is far less sensitive to impedance matching problems than it&#10;is in video.&lt;br /&gt;&lt;br /&gt;The main difficulties in audio cabling are as follows:&lt;ul&gt;&lt;li&gt;High capacitance audio cables can overload the driving amplifier, and thereby&#10;cause instability and oscillations.&lt;/li&gt;&lt;li&gt;Audio cables may pick up noise and interference which will result in poor signal&#10;quality and bad signal to noise ratio.&lt;/li&gt;&lt;li&gt;Cable impedance problems cause signal loss and deterioration.&lt;/li&gt;&lt;li&gt;Cable resistance and the loss of the high dumping factor of the amplifier can degrade the amplifier's output quality.&lt;/li&gt;&lt;/ul&gt;All these problems can be solved satisfactorily.&lt;/p&gt;&lt;a name="highcapacitance"&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;h4&gt;Dealing with high capacitance audio wires&lt;/h4&gt;&lt;p&gt;High capacitance audio wires may create signal deterioration and instability in the&#10;output amplifier stage. To avoid these problems, the output amplifier stages should use&#10;stable amplifier chips, with appropriate output resistors isolating the amplifier from the&#10;adverse effect of the cable.&lt;br /&gt;&lt;br /&gt;The load on the cable should be high (low impedance) and the driving amplifier should&#10;be able to "pump" current into the cable. The printed circuit board design around the&#10;amplifier should eliminate PCB induced instability.&lt;/p&gt;&lt;a name="noisepickup"&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;h4&gt;Dealing with noise pickup&lt;/h4&gt;&lt;p&gt;Electric noise may be picked up by long wires, thereby causing audio signal quality to&#10;deteriorate. The problem is more severe when low-level signals such as microphone&#10;generated signals are involved.&lt;br /&gt;&lt;br /&gt;There are two solutions to this problem:&lt;ul&gt;&lt;li&gt;One solution is to use good quality cables with proper shielding. The shielding&#10;substantially reduces noise pickup. This solution for line-level signals is&#10;appropriate for up to 10 meters, provided the cables are not adjacent to electric&#10;noise sources (see above).&lt;/li&gt;&lt;li&gt;The other solution, commonly used in broadcast applications, is to use a&#10;balanced-wire system. A typical system uses a three-wire assembly - two wires&#10;carry the signal in opposite polarities, and the third is the ground-reference and/or&#10;shield wire. This way a very clean signal is obtained at output, though at the cost of&#10;more complicated electronic circuitry. When using the balanced-wire system, the&#10;line level signal's range may be effectively extended by up to 100 meters, again,&#10;provided the cables are not adjacent to electric noise sources (see above).&lt;/li&gt;&lt;/ul&gt;Microphone level signals of a few milli-volts are more sensitive to external&#10;interference. The effective range of low level microphone signals in a balanced-wire&#10;system is 10-15 meters (ten times better than when using simple, unbalanced shielded&#10;wires).&lt;br /&gt;A very common trick is used nowadays in order to improve signal to noise ratio. The&#10;signal level is elevated in order to elevate the signal to noise ratio. This trick is based&#10;on the assumption that interference is constant. In the past, audio/video signal levels of&#10;1 Volt were normal. Today, signal levels of 6-30 Volts, travelling on balanced audio&#10;wire systems, are very common.&lt;/p&gt;&lt;a name="signalloss"&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;h4&gt;Signal loss and deterioration due to cable impedance&lt;/h4&gt;&lt;p&gt;Cables impose specific impedance in a signal path. Sometimes, the resistance part of&#10;this compound impedance is too large and creates a voltage divider with the load&#10;impedance. The result is signal level deterioration. Active amplifying circuitry&#10;compensates for signal level changes where signal gain, either at the receiver end or,&#10;preferably, at the transmitter end, can be fine-tuned by the user, using internal or&#10;external controls. In some cases, some specific frequency bands within the audio signal&#10;spectrum are attenuated due to cable capacitance. It is usually the high frequency range&#10;which is effected. To overcome this problem, a tone-effecting amplifier or an audio&#10;equalizer should be inserted in the signal path.&lt;/p&gt;&lt;a name="qualitydegradation"&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;h4&gt;Dealing with amplifier output quality degradation due to cable resistance&lt;/h4&gt;&lt;p&gt;In an amplifier-loudspeaker system, the cables leading to the amplifier, if not heavy&#10;enough, create a voltage divider with the resistance of the loudspeaker reducing signal&#10;level. This problem can be dealt with by using the volume control of the amplifier. A&#10;much worse problem is the depreciation of the amplifier's dumping factor due to cable&#10;resistance. This results in lower quality and "muddiness" in the sound. Using&#10;heavy-conductor, low capacitance wires overcomes this problem.&lt;/p&gt;&lt;a name="finalword"&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;h3&gt;A final word&lt;/h3&gt;&lt;p&gt;Cables and long distance operation can be problematic, but understanding the nature of&#10;the problems, accurately identifying one's needs and using the tips above will help in&#10;getting a good job done, even from a remote location.&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Passive Components Codes Guide</title><link>https://technick.net/guides/electronics/res_cap_codes/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/res_cap_codes/</guid><description>&lt;p&gt;&lt;a name="rc_codes"&gt;&lt;/a&gt; &lt;small&gt;&lt;b&gt;Codes for Resistors, Capacitors, Inductors, Termistors NTC and PTC, Varistors VDR.&lt;/b&gt;&lt;/small&gt;&lt;br /&gt;&lt;hr /&gt;&#10;&lt;a href="#pictures"&gt; Pictures&lt;/a&gt;&lt;br /&gt; &lt;a href="#color"&gt; Color Code&lt;/a&gt;&lt;br /&gt; &lt;a href="#alphanumeric"&gt; Alpha-Numeric Code&lt;/a&gt;&lt;br /&gt; &lt;a href="#oneletter"&gt; One Letter Code&lt;/a&gt;&lt;br /&gt;&lt;a name="pictures"&gt;&lt;/a&gt;&lt;p&gt;&lt;/p&gt;&lt;font size="+2"&gt;&lt;b&gt; Pictures&lt;/b&gt;&lt;/font&gt;&lt;br /&gt;&lt;p&gt;&lt;b&gt; Resistors&lt;/b&gt;&lt;br /&gt;&lt;img src="https://technick.net/img/guide_rcc/guide_rcc_resistor_color.gif" width="163" height="50" border="0" alt="Resistor" /&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt; 5 Band Ceramic Capacitors&lt;/b&gt;&lt;br /&gt;&lt;img src="https://technick.net/img/guide_rcc/guide_rcc_cap_5ban.gif" alt="5 Band Ceramic Capacitors" width="252" height="50" /&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt; Radial or Ayial Lead Ceramic Capacitors (6 Dot or Band System)&lt;/b&gt;&lt;br /&gt;&lt;img src="https://technick.net/img/guide_rcc/guide_rcc_cap_6d0b.gif" alt="Radial or Ayial Lead Ceramic Capacitors (6 Dot or Band System)" width="250" height="100" /&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt; Ceramic Disk Capacitors&lt;/b&gt;&lt;br /&gt;&lt;img src="https://technick.net/img/guide_rcc/guide_rcc_cap_cdc.gif" alt="Ceramic Disk Capacitors" width="270" height="150" /&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt; Ceramic Feed Through Capacitors&lt;/b&gt;&lt;br /&gt;&lt;img src="https://technick.net/img/guide_rcc/guide_rcc_cap_cftc.gif" alt="Ceramic Feed Through Capacitors" width="147" height="150" /&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt; Dipped Tantalum Capacitors&lt;/b&gt;&lt;br /&gt;&lt;img src="https://technick.net/img/guide_rcc/guide_rcc_cap_dtc.gif" alt="Dipped Tantalum Capacitors" width="119" height="150" /&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt; Film Type Capacitors&lt;/b&gt;&lt;br /&gt;&lt;img src="https://technick.net/img/guide_rcc/guide_rcc_cap_ftc.gif" alt="Film Type Capacitors" width="205" height="150" /&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt; 5 Dot or Band Ceramic Capacitors (one wide band)&lt;/b&gt;&lt;br /&gt;&lt;img src="https://technick.net/img/guide_rcc/guide_rcc_cap_owb.gif" alt="5 Dot or Band Ceramic Capacitors (one wide band)" width="190" height="70" /&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt; Postage Stamp Mica Capacitors&lt;/b&gt;&lt;br /&gt;&lt;img src="https://technick.net/img/guide_rcc/guide_rcc_cap_psmc.gif" alt="Postage Stamp Mica Capacitors" width="188" height="300" /&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt; Standard Button Mica Capacitors&lt;/b&gt;&lt;br /&gt;&lt;img src="https://technick.net/img/guide_rcc/guide_rcc_cap_sbm.gif" alt="Standard Button Mica Capacitors" width="132" height="150" /&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt; Polistirene Capacitors&lt;/b&gt;&lt;br /&gt;&lt;img src="https://technick.net/img/guide_rcc/guide_rcc_cap_pol.gif" alt="Polistirene Capacitors" width="78" height="150" /&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt; Electrolitic Tantalum Capacitors (4 colors code)&lt;/b&gt;&lt;br /&gt;&lt;img src="https://technick.net/img/guide_rcc/guide_rcc_cap_elta.gif" alt="Electrolitic Tantalum Capacitors (4 colors code)" width="69" height="130" /&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt; Electrolitic Tantalum Capacitors (3 colors code)&lt;/b&gt;&lt;br /&gt;&lt;img src="https://technick.net/img/guide_rcc/guide_rcc_cap_et3.gif" alt="Electrolitic Tantalum Capacitors (3 colors code)" width="69" height="130" /&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt; Ceramic Capacitors Class II&lt;/b&gt;&lt;br /&gt;&lt;img src="https://technick.net/img/guide_rcc/guide_rcc_cap_cc2.gif" alt="Ceramic Capacitors Class II" width="74" height="91" /&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt; Ceramic Capacitors Class I&lt;/b&gt;&lt;br /&gt;&lt;img src="https://technick.net/img/guide_rcc/guide_rcc_cap_cc1.gif" alt="Ceramic Capacitors Class I" width="71" height="124" /&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt; Ceramic Capacitors Pin-up&lt;/b&gt;&lt;br /&gt;&lt;img src="https://technick.net/img/guide_rcc/guide_rcc_cap_cpu.gif" alt="Ceramic Capacitors Pin-up" width="55" height="133" /&gt;&lt;br /&gt;&lt;br /&gt;&lt;/p&gt;&lt;hr /&gt;&lt;a name="color"&gt;&lt;/a&gt;&lt;/p&gt;</description></item><item><title>PCB Impedance and Capacitance of Asymmetric Stripline</title><link>https://technick.net/tools/impedance-calculator/stripline-asym/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/tools/impedance-calculator/stripline-asym/</guid><description>&lt;blockquote&gt;&lt;br /&gt;&lt;img src="https://technick.net/img/util_pcb_imp/util_pcb_imp_stripline_asym.gif" width="100" height="100" border="0" alt="Asymmetric Stripline" /&gt;&lt;form action="" method="get" name="pcbimpform" id="pcbimpform"&gt;&lt;table class="toolform" border="0" cellspacing="0" cellpadding="0"&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;W&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="W" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;width of the trace&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;H&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="H" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;height of trace above return plane&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;H1&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="H1" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;height of trace above return plane&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;T&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="T" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;trace thickness&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;E&lt;sub&gt;r&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="ER" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[&amp;nbsp;]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;&lt;a href="https://technick.net/guides/electronics/dielectric_constants"&gt;relative permittivity of the dielectric&lt;/a&gt;&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;td colspan="3"&gt;&lt;br /&gt;Are there distributed capacitive loads on this trace?&lt;br /&gt;&lt;input type="radio" name="cload" value="No" checked="checked" /&gt;&lt;b&gt;No&lt;/b&gt;&lt;input type="radio" name="cload" value="Yes" /&gt;&lt;b&gt;Yes&lt;/b&gt;&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;L&lt;sub&gt;a&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="La" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;average length of the traces attaching the loads&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;C&lt;sub&gt;a&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="Ca" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[pF]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;average load capacitance&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;th&gt;&lt;br /&gt;OUTPUT&lt;/th&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;Z&lt;sub&gt;0&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="Z0" size="20" readonly="readonly" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[Ohm]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;characteristic impedance&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;C&lt;sub&gt;0&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="C0" size="20" readonly="readonly" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[F/m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;capacitance per unit length&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;t&lt;sub&gt;pd&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="TPD" size="20" readonly="readonly" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[s/m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;propagation delay&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;L&lt;sub&gt;0&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="L0" size="20" readonly="readonly" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[H/m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;inductance per unit length&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;Z&lt;sub&gt;c&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="ZC" size="20" readonly="readonly" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[Ohm]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;effective characteristic impedance&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;t'&lt;sub&gt;pd&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="TPD1" size="20" readonly="readonly" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[s/m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;effective propagation delay&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;td colspan="3"&gt;&lt;input name="Calculate" type="button" value="Calculate" onclick="AsymStripline()" /&gt; &lt;input name="Reset" type="Reset" value="Clear" /&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/form&gt;&lt;p&gt;&lt;b&gt;NOTE:&lt;/b&gt; numbers are in scientific notation (e.g.: 1.427e-9 s/m = 1.1427&amp;middot;10&lt;sup&gt;-9&lt;/sup&gt; s/m = 1.427 ns/m)&lt;br /&gt;&lt;br /&gt;&lt;b&gt;CONDITIONS:&lt;/b&gt; (0.1 &amp;lt; W/H &amp;lt; 2.0); ( T/H &amp;lt; 0.25);&lt;/p&gt;&lt;p&gt;&lt;h3&gt;Formulas:&lt;/h3&gt;&lt;img src="https://technick.net/img/util_pcb_imp/util_pcb_imp_stripline_asym_formula.gif" width="376" height="131" border="0" alt="Formula" /&gt;&lt;br /&gt;&lt;br /&gt;&lt;img src="https://technick.net/img/util_pcb_imp/util_pcb_imp_l0_formula.gif" width="70" height="20" border="0" alt="" /&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Capacitive Load Modify:&lt;/b&gt;&lt;br /&gt;&lt;br /&gt;&lt;img src="https://technick.net/img/util_pcb_imp/util_pcb_imp_capload_formula.gif" width="345" height="50" border="0" alt="Formulas for: Capacitive Load Modify" /&gt;&lt;br /&gt;&lt;font size="1"&gt;See also notes on &lt;a href="https://technick.net/tools/impedance-calculator"&gt;PCB Impedance and Capacitance Calculator&lt;/a&gt; page.&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>PCB Impedance and Capacitance of Differential Microstrip</title><link>https://technick.net/tools/impedance-calculator/microstrip-diff/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/tools/impedance-calculator/microstrip-diff/</guid><description>&lt;blockquote&gt;&lt;br /&gt;&lt;img src="https://technick.net/img/util_pcb_imp/util_pcb_imp_microstrip_diff.gif" width="100" height="63" border="0" alt="Differential Microstrip" /&gt;&lt;form action="" method="get" name="pcbimpform" id="pcbimpform"&gt;&lt;table class="toolform" border="0" cellspacing="0" cellpadding="0"&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;Z&lt;sub&gt;0&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="Z0" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[Ohm]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;characteristic impedance&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;H&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="H" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;height of trace above return plane&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;S&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="S" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;space between traces&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;th&gt;&lt;br /&gt;OUTPUT&lt;/th&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;Z&lt;sub&gt;d&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="ZD" size="20" readonly="readonly" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[Ohm]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;differential impedance&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;td colspan="3"&gt;&lt;input name="Calculate" type="button" value="Calculate" onclick="DiffMicrostrip()" /&gt; &lt;input name="Reset" type="Reset" value="Clear" /&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/form&gt;&lt;p&gt;&lt;b&gt;NOTE:&lt;/b&gt; numbers are in scientific notation (e.g.: 1.427e-9 s/m = 1.1427&amp;middot;10&lt;sup&gt;-9&lt;/sup&gt; s/m = 1.427 ns/m)&lt;/p&gt;&lt;p&gt;&lt;h3&gt;Formulas:&lt;/h3&gt;&lt;img src="https://technick.net/img/util_pcb_imp/util_pcb_imp_microstrip_diff_formula.gif" width="243" height="50" border="0" alt="Formula" /&gt;&lt;br /&gt;&lt;br /&gt;&lt;font size="1"&gt;See also notes on &lt;a href="https://technick.net/tools/impedance-calculator"&gt;PCB Impedance and Capacitance Calculator&lt;/a&gt; page.&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;&#10;&lt;script language="JavaScript" src="https://technick.net/js/pcbimpcalc.js" type="text/javascript"&gt;&lt;/script&gt;</description></item><item><title>PCB Impedance and Capacitance of Differential Stripline</title><link>https://technick.net/tools/impedance-calculator/stripline-diff/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/tools/impedance-calculator/stripline-diff/</guid><description>&lt;blockquote&gt;&lt;br /&gt;&lt;img src="https://technick.net/img/util_pcb_imp/util_pcb_imp_stripline_diff.gif" width="100" height="63" border="0" alt="Differential Stipline" /&gt;&lt;form action="" method="get" name="pcbimpform" id="pcbimpform"&gt;&lt;table class="toolform" border="0" cellspacing="0" cellpadding="0"&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;Z&lt;sub&gt;0&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="Z0" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[Ohm]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;characteristic impedance&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;H&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="H" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;height of trace above return plane&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;S&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="S" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;space between traces&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;th&gt;&lt;br /&gt;OUTPUT&lt;/th&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;Z&lt;sub&gt;d&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="ZD" size="20" readonly="readonly" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[Ohm]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;differential impedance&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;td colspan="3"&gt;&lt;input name="Calculate" type="button" value="Calculate" onclick="DiffStripline()" /&gt; &lt;input name="Reset" type="Reset" value="Clear" /&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/form&gt;&lt;p&gt;&lt;b&gt;NOTE:&lt;/b&gt; numbers are in scientific notation (e.g.: 1.427e-9 s/m = 1.1427&amp;middot;10&lt;sup&gt;-9&lt;/sup&gt; s/m = 1.427 ns/m)&lt;/p&gt;&lt;p&gt;&lt;h3&gt;Formulas:&lt;/h3&gt;&lt;img src="https://technick.net/img/util_pcb_imp/util_pcb_imp_stripline_diff_formula.gif" width="245" height="50" border="0" alt="Formula" /&gt;&lt;br /&gt;&lt;br /&gt;&lt;font size="1"&gt;See also notes on &lt;a href="https://technick.net/tools/impedance-calculator"&gt;PCB Impedance and Capacitance Calculator&lt;/a&gt; page.&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;&#10;&lt;script language="JavaScript" src="https://technick.net/js/pcbimpcalc.js" type="text/javascript"&gt;&lt;/script&gt;</description></item><item><title>PCB Impedance and Capacitance of Dual Stripline</title><link>https://technick.net/tools/impedance-calculator/stripline-dual/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/tools/impedance-calculator/stripline-dual/</guid><description>&lt;blockquote&gt;&lt;br /&gt;&lt;img src="https://technick.net/img/util_pcb_imp/util_pcb_imp_stripline_dual.gif" width="100" height="100" border="0" alt="Dual Stripline" /&gt;&lt;form action="" method="get" name="pcbimpform" id="pcbimpform"&gt;&lt;table class="toolform" border="0" cellspacing="0" cellpadding="0"&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;W&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="W" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;width of the trace&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;H&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="H" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;height of trace above return plane&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;T&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="T" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;trace thickness&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;C&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="C" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;distance between the differential stripline pair&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;E&lt;sub&gt;r&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="ER" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[&amp;nbsp;]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;&lt;a href="https://technick.net/guides/electronics/dielectric_constants"&gt;relative permittivity of the dielectric&lt;/a&gt;&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;td colspan="3"&gt;&lt;br /&gt;Are there distributed capacitive loads on this trace?&lt;br /&gt;&lt;input type="radio" name="cload" value="No" checked="checked" /&gt;&lt;b&gt;No&lt;/b&gt;&lt;input type="radio" name="cload" value="Yes" /&gt;&lt;b&gt;Yes&lt;/b&gt;&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;L&lt;sub&gt;a&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="La" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;average length of the traces attaching the loads&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;C&lt;sub&gt;a&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="Ca" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[pF]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;average load capacitance&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;th&gt;&lt;br /&gt;OUTPUT&lt;/th&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;Z&lt;sub&gt;0&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="Z0" size="20" readonly="readonly" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[Ohm]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;characteristic impedance&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;C&lt;sub&gt;0&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="C0" size="20" readonly="readonly" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[F/m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;capacitance per unit length&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;t&lt;sub&gt;pd&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="TPD" size="20" readonly="readonly" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[s/m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;propagation delay&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;L&lt;sub&gt;0&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="L0" size="20" readonly="readonly" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[H/m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;inductance per unit length&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;Z&lt;sub&gt;c&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="ZC" size="20" readonly="readonly" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[Ohm]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;effective characteristic impedance&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;t'&lt;sub&gt;pd&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="TPD1" size="20" readonly="readonly" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[s/m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;effective propagation delay&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;td colspan="3"&gt;&lt;input name="Calculate" type="button" value="Calculate" onclick="DualStripline()" /&gt; &lt;input name="Reset" type="Reset" value="Clear" /&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/form&gt;&lt;p&gt;&lt;b&gt;NOTE:&lt;/b&gt; numbers are in scientific notation (e.g.: 1.427e-9 s/m = 1.1427&amp;middot;10&lt;sup&gt;-9&lt;/sup&gt; s/m = 1.427 ns/m)&lt;br /&gt;&lt;br /&gt;&lt;b&gt;CONDITIONS:&lt;/b&gt; (0.1 &amp;lt; W/H &amp;lt; 2.0); ( T/H &amp;lt; 0.25);&lt;/p&gt;&lt;p&gt;&lt;h3&gt;Formulas:&lt;/h3&gt;&lt;img src="https://technick.net/img/util_pcb_imp/util_pcb_imp_stripline_dual_formula.gif" width="380" height="127" border="0" alt="Formula" /&gt;&lt;br /&gt;&lt;br /&gt;&lt;img src="https://technick.net/img/util_pcb_imp/util_pcb_imp_l0_formula.gif" width="70" height="20" border="0" alt="" /&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Capacitive Load Modify:&lt;/b&gt;&lt;br /&gt;&lt;br /&gt;&lt;img src="https://technick.net/img/util_pcb_imp/util_pcb_imp_capload_formula.gif" width="345" height="50" border="0" alt="Formulas for: Capacitive Load Modify" /&gt;&lt;br /&gt;&lt;font size="1"&gt;See also notes on &lt;a href="https://technick.net/tools/impedance-calculator"&gt;PCB Impedance and Capacitance Calculator&lt;/a&gt; page.&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>PCB Impedance and Capacitance of Embedded Microstrip</title><link>https://technick.net/tools/impedance-calculator/microstrip-embed/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/tools/impedance-calculator/microstrip-embed/</guid><description>&lt;blockquote&gt;&lt;br /&gt;&lt;img src="https://technick.net/img/util_pcb_imp/util_pcb_imp_microstrip_embed.gif" width="100" height="73" border="0" alt="Embedded Microstrip" /&gt;&lt;form action="" method="get" name="pcbimpform" id="pcbimpform"&gt;&lt;table class="toolform" border="0" cellspacing="0" cellpadding="0"&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;W&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="W" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;width of the trace&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;H&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="H" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;height of trace above return plane&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;H1&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="H1" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;height of dielectric above return plane&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;T&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="T" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;trace thickness&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;E&lt;sub&gt;r&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="ER" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[&amp;nbsp;]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;&lt;a href="https://technick.net/guides/electronics/dielectric_constants"&gt;relative permittivity of the dielectric&lt;/a&gt;&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;td colspan="3"&gt;&lt;br /&gt;Are there distributed capacitive loads on this trace?&lt;br /&gt;&lt;input type="radio" name="cload" value="No" checked="checked" /&gt;&lt;b&gt;No&lt;/b&gt;&lt;input type="radio" name="cload" value="Yes" /&gt;&lt;b&gt;Yes&lt;/b&gt;&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;L&lt;sub&gt;a&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="La" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;average length of the traces attaching the loads&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;C&lt;sub&gt;a&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="Ca" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[pF]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;average load capacitance&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;th&gt;&lt;br /&gt;OUTPUT&lt;/th&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;Z&lt;sub&gt;0&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="Z0" size="20" readonly="readonly" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[Ohm]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;characteristic impedance&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;C&lt;sub&gt;0&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="C0" size="20" readonly="readonly" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[F/m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;capacitance per unit length&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;t&lt;sub&gt;pd&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="TPD" size="20" readonly="readonly" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[s/m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;propagation delay&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;L&lt;sub&gt;0&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="L0" size="20" readonly="readonly" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[H/m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;inductance per unit length&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;Z&lt;sub&gt;c&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="ZC" size="20" readonly="readonly" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[Ohm]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;effective characteristic impedance&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;t'&lt;sub&gt;pd&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="TPD1" size="20" readonly="readonly" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[s/m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;effective propagation delay&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;td colspan="3"&gt;&lt;input name="Calculate" type="button" value="Calculate" onclick="EmbeddedMicrostrip()" /&gt; &lt;input name="Reset" type="Reset" value="Clear" /&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/form&gt;&lt;p&gt;&lt;b&gt;NOTE:&lt;/b&gt; numbers are in scientific notation (e.g.: 1.427e-9 s/m = 1.1427&amp;middot;10&lt;sup&gt;-9&lt;/sup&gt; s/m = 1.427 ns/m)&lt;br /&gt;&lt;br /&gt;&lt;b&gt;CONDITIONS:&lt;/b&gt; ( H1 &amp;gt; 1.2 H);&lt;/p&gt;&lt;p&gt;&lt;h3&gt;Formulas:&lt;/h3&gt;&lt;img src="https://technick.net/img/util_pcb_imp/util_pcb_imp_microstrip_embed_formula.gif" width="243" height="178" border="0" alt="Formula" /&gt;&lt;br /&gt;&lt;br /&gt;&lt;img src="https://technick.net/img/util_pcb_imp/util_pcb_imp_l0_formula.gif" width="70" height="20" border="0" alt="" /&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Capacitive Load Modify:&lt;/b&gt;&lt;br /&gt;&lt;br /&gt;&lt;img src="https://technick.net/img/util_pcb_imp/util_pcb_imp_capload_formula.gif" width="345" height="50" border="0" alt="Formulas for: Capacitive Load Modify" /&gt;&lt;br /&gt;&lt;font size="1"&gt;See also notes on &lt;a href="https://technick.net/tools/impedance-calculator"&gt;PCB Impedance and Capacitance Calculator&lt;/a&gt; page.&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>PCB Impedance and Capacitance of Microstrip</title><link>https://technick.net/tools/impedance-calculator/microstrip/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/tools/impedance-calculator/microstrip/</guid><description>&lt;blockquote&gt;&lt;br /&gt;&lt;img src="https://technick.net/img/util_pcb_imp/util_pcb_imp_microstrip.gif" width="100" height="63" border="0" alt="Microstrip" /&gt;&lt;form action="" method="get" name="pcbimpform" id="pcbimpform"&gt;&lt;table class="toolform" border="0" cellspacing="0" cellpadding="0"&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;W&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="W" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;width of the trace&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;H&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="H" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;height of dielectric above return plane&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;T&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="T" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;trace thickness&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;E&lt;sub&gt;r&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="ER" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[&amp;nbsp;]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;&lt;a href="https://technick.net/guides/electronics/dielectric_constants"&gt;relative permittivity of the dielectric&lt;/a&gt;&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;td colspan="3"&gt;&lt;br /&gt;Are there distributed capacitive loads on this trace?&lt;br /&gt;&lt;input type="radio" name="cload" value="No" checked="checked" /&gt;&lt;b&gt;No&lt;/b&gt;&lt;input type="radio" name="cload" value="Yes" /&gt;&lt;b&gt;Yes&lt;/b&gt;&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;L&lt;sub&gt;a&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="La" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;average length of the traces attaching the loads&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;C&lt;sub&gt;a&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="Ca" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[pF]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;average load capacitance&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;th&gt;&lt;br /&gt;OUTPUT&lt;/th&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;Z&lt;sub&gt;0&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="Z0" size="20" readonly="readonly" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[Ohm]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;characteristic impedance&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;C&lt;sub&gt;0&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="C0" size="20" readonly="readonly" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[F/m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;capacitance per unit length&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;t&lt;sub&gt;pd&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="TPD" size="20" readonly="readonly" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[s/m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;propagation delay&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;L&lt;sub&gt;0&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="L0" size="20" readonly="readonly" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[H/m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;inductance per unit length&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;Z&lt;sub&gt;c&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="ZC" size="20" readonly="readonly" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[Ohm]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;effective characteristic impedance&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;t'&lt;sub&gt;pd&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="TPD1" size="20" readonly="readonly" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[s/m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;effective propagation delay&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;td colspan="3"&gt;&lt;input name="Calculate" type="button" value="Calculate" onclick="Microstrip()" /&gt; &lt;input name="Reset" type="Reset" value="Clear" /&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/form&gt;&lt;p&gt;&lt;b&gt;NOTE:&lt;/b&gt; numbers are in scientific notation (e.g.: 1.427e-9 s/m = 1.1427&amp;middot;10&lt;sup&gt;-9&lt;/sup&gt; s/m = 1.427 ns/m)&lt;br /&gt;&lt;br /&gt;&lt;b&gt;CONDITIONS:&lt;/b&gt; ( 0.1 &amp;lt; W/H &amp;lt; 3.0);&lt;/p&gt;&lt;p&gt;&lt;h3&gt;Formulas:&lt;/h3&gt;&lt;img src="https://technick.net/img/util_pcb_imp/util_pcb_imp_microstrip_formula.gif" width="238" height="129" border="0" alt="Formula" /&gt;&lt;br /&gt;&lt;br /&gt;&lt;img src="https://technick.net/img/util_pcb_imp/util_pcb_imp_l0_formula.gif" width="70" height="20" border="0" alt="" /&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Capacitive Load Modify:&lt;/b&gt;&lt;br /&gt;&lt;br /&gt;&lt;img src="https://technick.net/img/util_pcb_imp/util_pcb_imp_capload_formula.gif" width="345" height="50" border="0" alt="Formulas for: Capacitive Load Modify" /&gt;&lt;br /&gt;&lt;font size="1"&gt;See also notes on &lt;a href="https://technick.net/tools/impedance-calculator"&gt;PCB Impedance and Capacitance Calculator&lt;/a&gt; page.&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>PCB Impedance and Capacitance of Stripline</title><link>https://technick.net/tools/impedance-calculator/stripline/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/tools/impedance-calculator/stripline/</guid><description>&lt;blockquote&gt;&lt;br /&gt;&lt;img src="https://technick.net/img/util_pcb_imp/util_pcb_imp_stripline.gif" width="100" height="78" border="0" alt="Stripline" /&gt;&lt;form action="" method="get" name="pcbimpform" id="pcbimpform"&gt;&lt;table class="toolform" border="0" cellspacing="0" cellpadding="0"&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;W&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="W" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;width of the trace&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;H&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="H" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;height of trace above return plane&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;T&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="T" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;trace thickness&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;E&lt;sub&gt;r&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="ER" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[&amp;nbsp;]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;&lt;a href="https://technick.net/guides/electronics/dielectric_constants"&gt;relative permittivity of the dielectric&lt;/a&gt;&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;td colspan="3"&gt;&lt;br /&gt;Are there distributed capacitive loads on this trace?&lt;br /&gt;&lt;input type="radio" name="cload" value="No" checked="checked" /&gt;&lt;b&gt;No&lt;/b&gt;&lt;input type="radio" name="cload" value="Yes" /&gt;&lt;b&gt;Yes&lt;/b&gt;&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;L&lt;sub&gt;a&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="La" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;average length of the traces attaching the loads&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;C&lt;sub&gt;a&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="Ca" size="20" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[pF]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;average load capacitance&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;th&gt;&lt;br /&gt;OUTPUT&lt;/th&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;Z&lt;sub&gt;0&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="Z0" size="20" readonly="readonly" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[Ohm]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;characteristic impedance&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;C&lt;sub&gt;0&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="C0" size="20" readonly="readonly" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[F/m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;capacitance per unit length&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;t&lt;sub&gt;pd&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="TPD" size="20" readonly="readonly" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[s/m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;propagation delay&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;L&lt;sub&gt;0&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="L0" size="20" readonly="readonly" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[H/m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;inductance per unit length&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;Z&lt;sub&gt;c&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="ZC" size="20" readonly="readonly" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[Ohm]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;effective characteristic impedance&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;t'&lt;sub&gt;pd&lt;/sub&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;input type="text" name="TPD1" size="20" readonly="readonly" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;[s/m]&lt;/b&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;effective propagation delay&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;td colspan="3"&gt;&lt;input name="Calculate" type="button" value="Calculate" onclick="Stripline()" /&gt; &lt;input name="Reset" type="Reset" value="Clear" /&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/form&gt;&lt;p&gt;&lt;b&gt;NOTE:&lt;/b&gt; numbers are in scientific notation (e.g.: 1.427e-9 s/m = 1.1427&amp;middot;10&lt;sup&gt;-9&lt;/sup&gt; s/m = 1.427 ns/m)&lt;br /&gt;&lt;br /&gt;&lt;b&gt;CONDITIONS:&lt;/b&gt; (0.1 &amp;lt; W/H &amp;lt; 2.0); ( T/H &amp;lt; 0.25);&lt;/p&gt;&lt;p&gt;&lt;h3&gt;Formulas:&lt;/h3&gt;&lt;img src="https://technick.net/img/util_pcb_imp/util_pcb_imp_stripline_formula.gif" width="213" height="130" border="0" alt="Formula" /&gt;&lt;br /&gt;&lt;br /&gt;&lt;img src="https://technick.net/img/util_pcb_imp/util_pcb_imp_l0_formula.gif" width="70" height="20" border="0" alt="" /&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Capacitive Load Modify:&lt;/b&gt;&lt;br /&gt;&lt;br /&gt;&lt;img src="https://technick.net/img/util_pcb_imp/util_pcb_imp_capload_formula.gif" width="345" height="50" border="0" alt="Formulas for: Capacitive Load Modify" /&gt;&lt;br /&gt;&lt;font size="1"&gt;See also notes on &lt;a href="https://technick.net/tools/impedance-calculator"&gt;PCB Impedance and Capacitance Calculator&lt;/a&gt; page.&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>PCBs Fabrication Methods</title><link>https://technick.net/guides/electronics/pcb/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/pcb/</guid><description>&lt;p&gt;&lt;a name="toppcb"&gt;&lt;/a&gt;&lt;hr /&gt;&lt;p&gt;&lt;/p&gt;&#10;&lt;p&gt;&lt;img src="https://technick.net/img/guide_pcb/guide_pcb_pcb.jpg" alt="PCB (Printed Circuit Board)" width="188" height="155" border="0" /&gt;&lt;br /&gt;&#10;&lt;b&gt;Printed Circuit Board&lt;/b&gt; (PCB) is a mechanical assembly consisting of layers of fiberglass sheet laminated with etched copper patterns. It is used to mount electronic parts in a rigid manner suitable for packaging. Also known as a Printed Wiring Board (PWB).&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;center&gt;&lt;font size="3"&gt;&lt;b&gt;&lt;nobr&gt;&lt;a href="#1"&gt; [Project]&lt;/a&gt;&lt;/nobr&gt; &lt;nobr&gt;&lt;a href="#2"&gt; [Different methods to make PCBs]&lt;/a&gt;&lt;/nobr&gt; &lt;nobr&gt;&lt;a href="#3"&gt; [Final work]&lt;/a&gt;&lt;/nobr&gt; &lt;nobr&gt;&lt;a href="#4"&gt; [Bibliography/Reference]&lt;/a&gt;&lt;/nobr&gt; &lt;/b&gt;&lt;/font&gt;&lt;/center&gt;&lt;/p&gt;&lt;br /&gt;&lt;!-- -------------------------------------------------------- --&gt;&lt;p&gt;&lt;/p&gt;&lt;a name="1"&gt;&lt;/a&gt;&lt;font size="+2"&gt;&lt;u&gt;&lt;b&gt;Project&lt;/b&gt;&lt;/u&gt; &lt;/font&gt;&lt;br /&gt;&lt;font size="1"&gt;&lt;nobr&gt;&lt;a href="#1.1"&gt; [Electric Scheme]&lt;/a&gt;&lt;/nobr&gt;&lt;nobr&gt;&lt;a href="#1.2"&gt; [Part List - Bill of Materials]&lt;/a&gt;&lt;/nobr&gt;&lt;nobr&gt;&lt;a href="#1.3"&gt; [Choose components from Data Sheets]&lt;/a&gt;&lt;/nobr&gt;&lt;nobr&gt;&lt;a href="#1.4"&gt; [Choose Board type and dimension]&lt;/a&gt;&lt;/nobr&gt;&lt;nobr&gt;&lt;a href="#1.5"&gt; [Draw the PCB layout]&lt;/a&gt;&lt;/nobr&gt;&lt;nobr&gt;&lt;a href="#1.6"&gt; [Draw Fabrication scheme]&lt;/a&gt;&lt;/nobr&gt;&lt;nobr&gt;&lt;a href="#1.7"&gt; [Draw Assembly scheme]&lt;/a&gt;&lt;/nobr&gt;&lt;/font&gt;&lt;!-- -------------------------------------------------------- --&gt;&lt;/p&gt;</description></item><item><title>POST Beep Codes</title><link>https://technick.net/guides/hardware/beep_codes/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/beep_codes/</guid><description>&lt;hr /&gt;&lt;p&gt;When you turn the computer on, it performs &lt;b&gt;Power On System Test (POST)&lt;/b&gt;, during which it checks and initializes the system's internal components.&lt;br /&gt;If a serious error occurs, the computer does not display a message but emits a series of long and short beeps instead.&lt;br /&gt;Beeps are your computer's way of letting you know what's going on when the video signal is not working.&lt;br /&gt;These codes are built in to the BIOS of the PC.&lt;br /&gt;There is no official standard for these codes due to the many brands of BIOS that are out there.&lt;br /&gt;&lt;br /&gt;To decode the meaning of your computer POST beep codes you must consult the manual of your motherboard.&lt;br /&gt;If you don't have a motherboard manual or if it's incomplete you must search on the site of your computer manufacturer.&lt;br /&gt;Another way is take off the computer case and look for BIOS manufacturer (just see if it says "AMI" or "Phoenix" ...).&lt;br /&gt;For more information about BIOS and how to identify it please check this site: &lt;a href="http://www.ping.be/bios" target="_blank"&gt;Wim's BIOS Page - Everything you want to know about BIOS&lt;/a&gt;.&lt;br /&gt;Once you have determined your BIOS make, consult the following tables to see what's wrong with your computer.&lt;br /&gt;&lt;/p&gt;</description></item><item><title>RAID Technology</title><link>https://technick.net/guides/hardware/raid/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/raid/</guid><description>&lt;p&gt;&lt;b&gt;Reference and Sources:&lt;/b&gt;&lt;ul class="sources"&gt;&lt;li&gt;The most part of text in this guide has been taken from copyrighted document of &lt;a href="http://www.adaptec.com" target="_blank"&gt;Adaptec, Inc.&lt;/a&gt; on site (&lt;a href="http://www.adaptec.com" target="_blank"&gt;www.adaptec.com&lt;/a&gt;)&lt;/li&gt;&lt;li&gt;&lt;a href="http://www.psidisk.com" target="_blank"&gt;Perceptive Solutions, Inc.&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/p&gt;&lt;p&gt;&lt;b&gt;RAID&lt;/b&gt; stands for &lt;b&gt;R&lt;/b&gt;edundant &lt;b&gt;A&lt;/b&gt;rray of &lt;b&gt;I&lt;/b&gt;nexpensive (or sometimes "Independent") &lt;b&gt;D&lt;/b&gt;isks.&lt;br /&gt;&lt;br /&gt;RAID is a method of combining several hard disk drives into one logical unit (two or more disks grouped together to appear as a single device to the host system). &#10;RAID technology was developed to address the fault-tolerance and performance limitations of conventional disk storage. It can offer fault tolerance and higher throughput levels than a single hard drive or group of independent hard drives. &#10;While arrays were once considered complex and relatively specialized storage solutions, today they are easy to use and essential for a broad spectrum of client/server applications.&lt;/p&gt;</description></item><item><title>SCSI Technology</title><link>https://technick.net/guides/hardware/scsi/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/scsi/</guid><description>&lt;blockquote&gt;&lt;p&gt;&lt;b&gt;SCSI&lt;/b&gt; stands for &lt;b&gt;S&lt;/b&gt;mall &lt;b&gt;C&lt;/b&gt;omputer &lt;b&gt;S&lt;/b&gt;ystem &lt;b&gt;I&lt;/b&gt;nterface.&lt;br /&gt;A standard for high-speed connections to peripherals.&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;font size="1"&gt;&lt;nobr&gt;&lt;a href="#reference"&gt;[Source and Reference]&lt;/a&gt;&lt;/nobr&gt; &lt;nobr&gt;&lt;a href="#history"&gt;[History]&lt;/a&gt;&lt;/nobr&gt; &lt;nobr&gt;&lt;a href="#usage"&gt;[Usage]&lt;/a&gt;&lt;/nobr&gt; &lt;nobr&gt;&lt;a href="#harddrives"&gt;[SCSI Hard Drives]&lt;/a&gt;&lt;/nobr&gt; &lt;nobr&gt;&lt;a href="#applescsi"&gt;[APPLE SCSI]&lt;/a&gt;&lt;/nobr&gt; &lt;nobr&gt;&lt;a href="#hardware"&gt;[Hardware]&lt;/a&gt;&lt;/nobr&gt; &lt;nobr&gt;&lt;a href="#singledifferential"&gt;[Single Ended or Differential]&lt;/a&gt;&lt;/nobr&gt; &lt;nobr&gt;&lt;a href="#cabling"&gt;[Cabling]&lt;/a&gt;&lt;/nobr&gt; &lt;nobr&gt;&lt;a href="#termination"&gt;[SCSI Termination]&lt;/a&gt;&lt;/nobr&gt;&lt;nobr&gt;&lt;a href="#scsiconnectors"&gt;[SCSI Connectors]&lt;/a&gt;&lt;/nobr&gt; &lt;/font&gt;&lt;/p&gt;&lt;p&gt;&lt;a name="referrence"&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;h3&gt;Source and Reference&lt;/h3&gt;&lt;ul&gt;&lt;li&gt;&lt;a href="http://www.scsifaq.org" target="_blank"&gt;comp.periphs.scsi FAQ&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href="http://www.t10.org" target="_blank"&gt;ANSI T10 Technical Commitee Archive (SCSI draft spec's)&lt;/a&gt;&lt;/li&gt;&lt;li&gt;SCSI Trade Association&lt;/li&gt;&lt;li&gt;&lt;a href="http://www.adaptec.com" target="_blank"&gt;Adaptec, Inc.&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href="http://www.scsi.org" target="_blank"&gt;Gary Field's SCSI Info Central&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/p&gt;&lt;a name="history"&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;h3&gt;History&lt;/h3&gt;&lt;p&gt;SCSI has it's roots in the mainframe world, but it's first implementation in the &#10;PC world came soon after the first PC. Shugart Associates devised an interface &#10;that they designated the SASI, or "Shugart Associates Standard Interface" They &#10;proposed that SASI be adopted by ANSI for small computers, but during the work &#10;required for ratification, they discovered the process would take too much &#10;effort, and that the IPI groups were already well into their effort. (which had &#10;many features the same as SASI) A decision was made to take features of both &#10;interfaces, and put forth a new specification for a new interface, SCSI was &#10;born, and ratified in 1986 by ANSI. Since then, many have said that the &#10;original spec. was not tight enough, and that it allowed Manufacturers to make &#10;drives that met the ANSI spec., but would not talk to each other. Recently, the &#10;ANSI SCSI committee has proposed newer, tighter, more extended specs., for &#10;SCSI-2, and now SCSI-3. &lt;/p&gt;</description></item><item><title>SODIUM METASILICATE, PENTAHYDRATE</title><link>https://technick.net/guides/electronics/sodium_metasilicate/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/sodium_metasilicate/</guid><description>&lt;blockquote&gt;&lt;p&gt;&lt;b&gt;Reference and Sources:&lt;/b&gt;&lt;ul class="sources"&gt;&lt;li&gt;&lt;a href="http://www.us.rhodia.com" target="_blank"&gt;Rhodia&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;h3&gt;1. PRODUCT DESCRIPTION&lt;/h3&gt;&lt;b&gt;Chemical Name or Synonym:&lt;/b&gt; DISODIUM TRIOXOSILICATE, PENTAHYDRATE ; CRYSTAMET&lt;br /&gt;&lt;b&gt;Molecular Formula:&lt;/b&gt; Na&lt;sub&gt;2&lt;/sub&gt;SiO&lt;sub&gt;3&lt;sup&gt;.&lt;/sup&gt;&lt;/sub&gt;nH&lt;sub&gt;2&lt;/sub&gt;O n=5 &lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;h3&gt;2. COMPOSITION/INFORMATION ON INGREDIENTS&lt;/h3&gt;&lt;table border="1" cellspacing="2" cellpadding="2"&gt; &lt;tr&gt; &lt;td align="left"&gt;&lt;b&gt;Component&lt;/b&gt;&lt;/td&gt; &lt;td align="middle"&gt;&lt;b&gt;CAS &#10; Reg Number&lt;/b&gt;&lt;/td&gt; &lt;td align="middle"&gt;&lt;b&gt;OSHA&lt;br /&gt;Hazard&lt;/b&gt;&lt;/td&gt; &lt;td align="middle"&gt;&lt;b&gt;Percentage&lt;/b&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td align="left"&gt;SODIUM &#10; METASILICATE &lt;/td&gt; &lt;td align="middle"&gt;6834-92-0 &lt;/td&gt; &lt;td align="middle"&gt;Y &#10; &lt;/td&gt; &lt;td align="middle"&gt;100 &#10; &lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;h3&gt;3. HAZARDS IDENTIFICATION&lt;/h3&gt;&lt;b&gt;A. &#10;EMERGENCY OVERVIEW: &lt;/b&gt;&lt;br /&gt;&lt;b&gt;Physical &#10;Appearance and Odor: &lt;/b&gt;&lt;br /&gt;white granules &#10;solid, odorless. &lt;br /&gt;&lt;b&gt;Warning Statements: &lt;/b&gt;&lt;br /&gt;DANGER! CAUSES SEVERE BURNS. &lt;br /&gt;&lt;br /&gt;&lt;b&gt;B. POTENTIAL HEALTH EFFECTS: &lt;/b&gt;&lt;br /&gt;&lt;b&gt;Acute Eye: &lt;/b&gt;&lt;br /&gt;Corrosive. Causes burns, irritation. &lt;br /&gt;&lt;b&gt;Acute Skin: &lt;/b&gt;&lt;br /&gt;Corrosive. Causes burns. &lt;br /&gt;&lt;b&gt;Acute Inhalation: &lt;/b&gt;&lt;br /&gt;May cause &#10;upper respiratory tract irritation, dizziness, headache, shortness of breath, &#10;chest pain, muscle weakness, nausea, vomiting, serious damage to lung tissue and &#10;respiratory tract. &lt;br /&gt;&lt;b&gt;Acute Ingestion: &lt;/b&gt;&lt;br /&gt;Causes nausea, vomiting, abdominal pain, &#10;chest pain, burns to mouth and esophagus. &lt;br /&gt;&lt;b&gt;Chronic Effects: &lt;/b&gt;&lt;br /&gt;This product &#10;does not contain any ingredient designated by IARC, NTP, ACGIH or OSHA as &#10;probable or suspected human carcinogens.&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;h3&gt;4. FIRST AID MEASURES&lt;/h3&gt;&lt;b&gt;FIRST AID &#10;MEASURES FOR ACCIDENTAL: &lt;/b&gt;&lt;br /&gt;&lt;b&gt;Eye &#10;Exposure: &lt;/b&gt;&lt;br /&gt;Hold eyelids open and flush &#10;with a steady, gentle stream of water for at least 15 minutes. Seek immediate &#10;medical attention, preferably with an ophthalmologist. If the physician is not &#10;immediately available, eye irrigation should be continued for an additional 15 &#10;minutes. If it is necessary to transport the patient to a physician and the eye &#10;needs to be bandaged, use a dry sterile cloth pad and cover both eyes. &lt;br /&gt;&lt;b&gt;Skin Exposure: &lt;/b&gt;&lt;br /&gt;In case of contact, immediately wash with plenty of soap and &#10;water for at least 15 minutes. Seek medical attention. Remove contaminated &#10;clothing and shoes while washing. Clean contaminated clothing and shoes before &#10;re-use or discard if they cannot be thoroughly cleaned. &lt;br /&gt;&lt;b&gt;Inhalation: &lt;/b&gt;&lt;br /&gt;Remove &#10;victim from immediate source of exposure and assure that the victim is &#10;breathing. If breathing is difficult, administer oxygen, if available. If victim &#10;is not breathing, administer CPR (cardio-pulmonary resuscitation). Seek medical &#10;attention. &lt;br /&gt;&lt;b&gt;Ingestion: &lt;/b&gt;&lt;br /&gt;If victim is conscious and alert, give &#10;2-3 glasses of water to drink and do not induce vomiting. Seek immediate medical &#10;attention. Do not leave victim unattended. To prevent aspiration of swallowed &#10;product, lay victim on side with head lower than waist. Vomiting may occur &#10;spontaneously. If vomiting occurs and the victim is conscious, give water to &#10;further dilute the chemical. &lt;br /&gt;&lt;br /&gt;&lt;b&gt;MEDICAL &#10;CONDITIONS POSSIBLY AGGRAVATED BY EXPOSURE: &lt;/b&gt;&lt;br /&gt;Inhalation of product may aggravate existing chronic respiratory &#10;problems such as asthma, emphysema or bronchitis. Skin contact may aggravate &#10;existing skin disease. &lt;br /&gt;&lt;br /&gt;&lt;b&gt;NOTES TO &#10;PHYSICIAN: &lt;/b&gt;&lt;br /&gt;All treatments should be &#10;based on observed signs and symptoms of distress in the patient. Consideration &#10;should be given to the possibility that overexposure to materials other than &#10;this product may have occurred. &lt;br /&gt;Treat symptomatically. No specific &#10;antidote available.&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;h3&gt;5. FIRE FIGHTING MEASURES&lt;/h3&gt;&lt;b&gt;FIRE HAZARD &#10;DATA: &lt;/b&gt;&lt;br /&gt;&lt;b&gt;Flash Point: &lt;/b&gt;&lt;br /&gt;Not Applicable &lt;br /&gt;&lt;b&gt;Extinguishing Media: &lt;/b&gt;&lt;br /&gt;Not combustible. Use extinguishing method suitable for surrounding fire. &lt;br /&gt;&lt;b&gt;Special Fire Fighting Procedures: &lt;/b&gt;&lt;br /&gt;Firefighters should wear NIOSH/MSHA &#10;approved self-contained breathing apparatus and full protective clothing. Dike &#10;area to prevent runoff and contamination of water sources. Dispose of fire &#10;control water later. &lt;br /&gt;&lt;b&gt;Unusual Fire and &#10;Explosion Hazards: &lt;/b&gt;&lt;br /&gt;Not combustible. &lt;br /&gt;&lt;b&gt;Hazardous Decomposition Materials &#10;(Under Fire Conditions): &lt;/b&gt;&lt;br /&gt;none known &lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;h3&gt;6. ACCIDENTAL RELEASE MEASURES&lt;/h3&gt;&lt;b&gt;Evacuation &#10;Procedures and Safety: &lt;/b&gt;&lt;br /&gt;Wear appropriate &#10;protective gear for the situation. See Personal Protection information in &#10;Section 8. &lt;br /&gt;&lt;b&gt;Containment of Spill: &lt;/b&gt;&lt;br /&gt;Follow procedure described below under &#10;Cleanup and Disposal of Spill. &lt;br /&gt;&lt;b&gt;Cleanup and Disposal of Spill: &lt;/b&gt;&lt;br /&gt;Shovel up into an appropriate closed container (see Section 7: Handling &#10;and Storage). Avoid creation of dusty conditions. Decontaminate tools and &#10;equipment following cleanup. &lt;br /&gt;&lt;b&gt;Environmental and Regulatory Reporting: &lt;/b&gt;&lt;br /&gt;If spilled on the ground, the affected area should be scraped clean and &#10;placed in a appropriate container for disposal. Prevent material from entering &#10;public sewer system or any waterways. Large spills should be handled according &#10;to a predetermined plan. For assistance in developing a plan contact the &#10;Technical Service Department using the Product Information phone number in &#10;Section 1.&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;h3&gt;7. HANDLING AND STORAGE&lt;/h3&gt;&lt;b&gt;Minimum/Maximum Storage Temperatures: &lt;/b&gt;&lt;br /&gt;Not Available &lt;br /&gt;&lt;b&gt;Handling: &lt;/b&gt;&lt;br /&gt;Do not get on skin or in eyes. Do not &#10;breathe dusts. Do not ingest. &lt;br /&gt;&lt;b&gt;Storage: &lt;/b&gt;&lt;br /&gt;Store in tightly closed &#10;containers. Store in an area that is cool, dry, well-ventilated, away from &#10;foodstuffs or animal feed.&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;h3&gt;8. EXPOSURE CONTROLS/PERSONAL PROTECTION&lt;/h3&gt;&lt;b&gt;Introductory Remarks: &lt;/b&gt;&lt;br /&gt;These &#10;recommendations provide general guidance for handling this product. Because &#10;specific work environments and material handling practices vary, safety &#10;procedures should be developed for each intended application. While developing &#10;safe handling procedures, do not overlook the need to clean equipment and piping &#10;systems for maintenance and repairs. Waste resulting from these procedures &#10;should be handled in accordance with Section 13: Disposal Considerations. &lt;br /&gt;Assistance with selection, use and maintenance of worker protection &#10;equipment is generally available from equipment manufacturers. &lt;br /&gt;&lt;b&gt;Exposure Guidelines: &lt;/b&gt;&lt;br /&gt;Exposure limits represent regulated or &#10;recommended worker breathing zone concentrations measured by validated sampling &#10;and analytical methods, meeting the regulatory requirements. The following &#10;limits apply to this material, where, if indicated, S=skin and C=ceiling limit: &lt;br /&gt;&lt;table border="1" cellspacing="2" cellpadding="2"&gt; &#10; &lt;tr&gt; &lt;td align="left" colspan="4"&gt;&lt;b&gt;PARTICULATES NOT OTHERWISE REGULATED RESPIRABLE FRACTION &#10; &lt;/b&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td align="middle"&gt;&lt;b&gt;&amp;nbsp;&lt;/b&gt;&lt;/td&gt; &lt;td align="middle"&gt;&lt;b&gt;Notes&lt;/b&gt;&lt;/td&gt; &lt;td align="middle"&gt;&lt;b&gt;TWA&lt;/b&gt;&lt;/td&gt; &lt;td align="middle"&gt;&lt;b&gt;STEL&lt;/b&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td align="middle"&gt;OSHA &#10; &lt;/td&gt; &lt;td align="middle"&gt;&lt;/td&gt; &lt;td align="middle"&gt;5 &#10; mg/cu m &lt;/td&gt; &lt;td align="middle"&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;br /&gt;&lt;table border="1" cellspacing="2" cellpadding="2"&gt; &#10; &lt;tr&gt; &lt;td align="left" colspan="4"&gt;&lt;b&gt;PARTICULATES NOT OTHERWISE REGULATED TOTAL DUST &#10; &lt;/b&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td align="middle"&gt;&lt;b&gt;&amp;nbsp;&lt;/b&gt;&lt;/td&gt; &lt;td align="middle"&gt;&lt;b&gt;Notes&lt;/b&gt;&lt;/td&gt; &lt;td align="middle"&gt;&lt;b&gt;TWA&lt;/b&gt;&lt;/td&gt; &lt;td align="middle"&gt;&lt;b&gt;STEL&lt;/b&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td align="middle"&gt;OSHA &#10; &lt;/td&gt; &lt;td align="middle"&gt;&lt;/td&gt; &lt;td align="middle"&gt;15 &#10; mg/cu m &lt;/td&gt; &lt;td align="middle"&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;br /&gt;&lt;b&gt;Engineering Controls: &lt;/b&gt;&lt;br /&gt;Where &#10;engineering controls are indicated by use conditions or a potential for &#10;excessive exposure exists, the following traditional exposure control techniques &#10;may be used to effectively minimize employee exposures: local exhaust &#10;ventilation at the point of generation. &lt;br /&gt;&lt;b&gt;Respiratory Protection: &lt;/b&gt;&lt;br /&gt;When &#10;respirators are required, select NIOSH/MSHA approved equipment based on actual &#10;or potential airborne concentrations and in accordance with the appropriate &#10;regulatory standards and/or industrial recommendations. &lt;br /&gt;&lt;b&gt;Eye/Face Protection: &lt;/b&gt;&lt;br /&gt;Eye and face protection requirements will vary dependent upon work &#10;environment conditions and material handling practices. Appropriate ANSI Z87 &#10;approved equipment should be selected for the particular use intended for this &#10;material. &lt;br /&gt;Eye contact should be prevented through use of chemical safety &#10;glasses with side shields or splash proof goggles. An emergency eye wash must be &#10;readily accessible to the work area. Face contact should be prevented through &#10;use of a face shield. &lt;br /&gt;&lt;b&gt;Skin &#10;Protection: &lt;/b&gt;&lt;br /&gt;Skin contact should be &#10;prevented through use of suitable protective clothing, gloves and footwear, &#10;selected with regard for use conditions and exposure potential. Consideration &#10;must be given both to durability as well as permeation resistance. &lt;br /&gt;&lt;b&gt;Work Practice Controls: &lt;/b&gt;&lt;br /&gt;Personal hygiene is an important work &#10;practice exposure control measure and the following general measures should be &#10;taken when working with or handling this material: &lt;table cellspacing="2" cellpadding="0" border="0"&gt; &#10; &lt;tr&gt; &lt;td valign="top" align="middle"&gt;(1) &lt;/td&gt; &lt;td align="left"&gt;Do not &#10; store, use, and/or consume foods, beverages, tobacco products, or &#10; cosmetics in areas where this material is stored. &lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td valign="top" align="middle"&gt;(2) &lt;/td&gt; &lt;td align="left"&gt;Wash &#10; hands and face carefully before eating, drinking, using tobacco, applying &#10; cosmetics, or using the toilet. &lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td valign="top" align="middle"&gt;(3) &lt;/td&gt; &lt;td align="left"&gt;Wash &#10; exposed skin promptly to remove accidental splashes of contact with this &#10; material. &lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;h3&gt;9. PHYSICAL AND CHEMICAL PROPERTIES&lt;/h3&gt;Physical and &#10;Chemical properties here represent typical properties of this product. Contact &#10;the business area using the Product Information phone number in Section 1 for &#10;its exact specifications. &lt;br /&gt;&lt;b&gt;Physical &#10;Appearance: &lt;/b&gt;&lt;br /&gt;white granules solid. &lt;br /&gt;&lt;b&gt;Odor: &lt;/b&gt;&lt;br /&gt;odorless. &lt;br /&gt;&lt;b&gt;pH: &lt;/b&gt;&lt;br /&gt;12.4 at 1 wt/wt%. &lt;br /&gt;&lt;b&gt;Specific Gravity: &lt;/b&gt;&lt;br /&gt;Not Available &lt;br /&gt;&lt;b&gt;Water Solubility: &lt;/b&gt;&lt;br /&gt;soluble 61 wt/wt% at 30 C (86 F). &lt;br /&gt;&lt;b&gt;Melting Point Range: &lt;/b&gt;&lt;br /&gt;72 C (162 &#10;F) &lt;br /&gt;&lt;b&gt;Boiling Point Range: &lt;/b&gt;&lt;br /&gt;Not Available &lt;br /&gt;&lt;b&gt;Vapor Pressure: &lt;/b&gt;&lt;br /&gt;Not &#10;Available &lt;br /&gt;&lt;b&gt;Vapor Density: &lt;/b&gt;&lt;br /&gt;Not Available &lt;br /&gt;&lt;b&gt;Molecular Weight: &lt;/b&gt;&lt;br /&gt;212.14&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;h3&gt;10. STABILITY AND REACTIVITY&lt;/h3&gt;Chemical &#10;Stability: &lt;br /&gt;This material is stable under &#10;normal handling and storage conditions described in Section 7. &lt;br /&gt;&lt;b&gt;Conditions To Be Avoided: &lt;/b&gt;&lt;br /&gt;moisture &lt;br /&gt;&lt;b&gt;Materials/Chemicals To Be Avoided: &lt;/b&gt;&lt;br /&gt;aluminum &lt;br /&gt;fluorine &lt;br /&gt;zinc &lt;br /&gt;acids &lt;br /&gt;&lt;b&gt;The Following Hazardous Decomposition &#10;Products Might Be Expected: &lt;/b&gt;&lt;br /&gt;&lt;b&gt;Decomposition Type: thermal &lt;/b&gt;&lt;br /&gt;none &#10;known &lt;br /&gt;&lt;b&gt;Hazardous Polymerization Will &#10;Not Occur. &lt;/b&gt;&lt;br /&gt;Avoid The Following To &#10;Inhibit Hazardous Polymerization: not applicable &lt;br /&gt;&lt;b&gt;Avoid The Following To Inhibit Hazardous Polymerization: &lt;/b&gt;&lt;br /&gt;not applicable&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;h3&gt;11. TOXICOLOGICAL INFORMATION&lt;/h3&gt;Acute Eye &#10;Irritation: &lt;br /&gt;&lt;table border="1" cellspacing="2" cellpadding="2"&gt; &#10; &lt;tr&gt; &lt;td align="left"&gt;&amp;nbsp;&lt;/td&gt; &lt;td align="left"&gt;&lt;b&gt;Toxicological Information and Interpretation &lt;/b&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td align="left"&gt;&amp;nbsp;&lt;/td&gt; &lt;td align="left"&gt;eye - &#10; eye irritation, 0.1 ml, rabbit. Corrosive. &lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;br /&gt;&lt;b&gt;Acute Skin &#10;Irritation: &lt;/b&gt;&lt;br /&gt;&lt;table border="1" cellspacing="2" cellpadding="2"&gt; &#10; &lt;tr&gt; &lt;td align="left"&gt;&amp;nbsp;&lt;/td&gt; &lt;td align="left"&gt;&lt;b&gt;Toxicological Information and Interpretation &lt;/b&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td align="left"&gt;&amp;nbsp;&lt;/td&gt; &lt;td align="left"&gt;skin - &#10; skin irritation, rabbit. &lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td align="left"&gt;&amp;nbsp;&lt;/td&gt; &lt;td align="left"&gt;Non-irritating. Dry skin. (At 4 hours.). &lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td align="left"&gt;&amp;nbsp;&lt;/td&gt; &lt;td align="left"&gt;skin - &#10; skin irritation, rabbit. Corrosive. Moist skin. (At 4 hours.). &#10; &lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;br /&gt;&lt;b&gt;Acute Dermal &#10;Toxicity: &lt;/b&gt;&lt;br /&gt;No test data found for &#10;product. &lt;br /&gt;&lt;b&gt;Acute Respiratory &#10;Irritation: &lt;/b&gt;&lt;br /&gt;No test data found for &#10;product. &lt;br /&gt;&lt;b&gt;Acute Inhalation Toxicity: &lt;/b&gt;&lt;br /&gt;No test data found for product. &lt;br /&gt;&lt;b&gt;Acute Oral Toxicity: &lt;/b&gt;&lt;br /&gt;&lt;table border="1" cellspacing="2" cellpadding="2"&gt; &#10; &lt;tr&gt; &lt;td align="left"&gt;&amp;nbsp;&lt;/td&gt; &lt;td align="left"&gt;&lt;b&gt;Toxicological Information and Interpretation &lt;/b&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td align="left"&gt;&amp;nbsp;&lt;/td&gt; &lt;td align="left"&gt;LD50 - &#10; lethal dose 50% of test species, 847 mg/kg, rat. &lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;br /&gt;&lt;b&gt;Chronic &#10;Toxicity: &lt;/b&gt;&lt;br /&gt;This product does not contain &#10;any substances that are considered by OSHA, NTP, IARC or ACGIH to be "probable" &#10;or "suspected" human carcinogens. &lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;h3&gt;12. ECOLOGICAL INFORMATION&lt;/h3&gt;Ecotoxicological Information: &lt;br /&gt;No &#10;data found for product. &lt;br /&gt;&lt;b&gt;Chemical Fate &#10;Information: &lt;/b&gt;&lt;br /&gt;No data found for product. &lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;h3&gt;13. DISPOSAL CONSIDERATIONS&lt;/h3&gt;Chemical additions, &#10;processing or otherwise altering this material may make the waste management &#10;information presented in this MSDS incomplete, inaccurate or otherwise &#10;inappropriate. Please be advised that state and local requirements for waste &#10;disposal may be more restrictive or otherwise different from federal laws and &#10;regulations. Consult state and local regulations regarding the proper disposal &#10;of this material. &lt;br /&gt;&lt;b&gt;EPA Hazardous Waste &#10;- NO &lt;/b&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;h3&gt;14. TRANSPORTATION INFORMATION&lt;/h3&gt;Transportation Status: IMPORTANT! Statements below provide additional &lt;br /&gt;data on listed DOT classification. The &#10;listed Transportation Classification does not address regulatory variations due &#10;to changes in package size, mode of shipment or other regulatory descriptors. &lt;br /&gt;&lt;b&gt;US Department of Transportation &lt;/b&gt;&lt;br /&gt;Hazard Class..... 8 &lt;br /&gt;Shipping Name: &lt;br /&gt;DISODIUM TRIOXOSILICATE &lt;br /&gt;ID Number....... UN3253 &lt;br /&gt;Packing Group.... &#10;III &lt;br /&gt;Labels........... CORROSIVE &lt;br /&gt;Emergency Guide #.... 154 &lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;h3&gt;15. REGULATORY INFORMATION&lt;/h3&gt;&lt;b&gt;Inventory &#10;Status &lt;/b&gt;&lt;br /&gt;&lt;table border="1" cellspacing="2" cellpadding="2"&gt; &#10; &lt;tr&gt; &lt;td align="left"&gt;&lt;b&gt;Inventory&lt;/b&gt;&lt;/td&gt; &lt;td align="middle"&gt;&lt;b&gt;Status&lt;/b&gt;&lt;/td&gt; &lt;td align="middle"&gt;&lt;b&gt;&amp;nbsp;&lt;/b&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td align="left"&gt;UNITED &#10; STATES (TSCA) &lt;/td&gt; &lt;td align="middle"&gt;Y &#10; &lt;/td&gt; &lt;td align="middle"&gt;&amp;nbsp; &#10; &lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td align="left"&gt;CANADA &#10; (DSL) &lt;/td&gt; &lt;td align="middle"&gt;Y &#10; &lt;/td&gt; &lt;td align="middle"&gt;&amp;nbsp; &#10; &lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td align="left"&gt;EUROPE &#10; (EINECS/ELINCS) &lt;/td&gt; &lt;td align="middle"&gt;Y &#10; &lt;/td&gt; &lt;td align="middle"&gt;&amp;nbsp; &#10; &lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td align="left"&gt;AUSTRALIA (AICS) &lt;/td&gt; &lt;td align="middle"&gt;Y &#10; &lt;/td&gt; &lt;td align="middle"&gt;&amp;nbsp; &#10; &lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td align="left"&gt;JAPAN &#10; (MITI) &lt;/td&gt; &lt;td align="middle"&gt;Y &#10; &lt;/td&gt; &lt;td align="middle"&gt;&amp;nbsp; &#10; &lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td align="left"&gt;SOUTH &#10; KOREA (KECL) &lt;/td&gt; &lt;td align="middle"&gt;Y &#10; &lt;/td&gt; &lt;td align="middle"&gt;&amp;nbsp; &#10; &lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td align="left" colspan="3"&gt;&amp;nbsp; &lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td align="left" colspan="3"&gt;Y = All ingredients are on the inventory. &lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td align="left" colspan="3"&gt;E = All ingredients are on the inventory or exempt from listing. &#10; &lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td align="left" colspan="3"&gt;P = One or more ingredients fall under the polymer exemption or &#10; are on the no longer polymer list. All other ingredients are on the &#10; inventory or exempt from listing. &lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td align="left" colspan="3"&gt;N = Not determined or one or more ingredients are not on the &#10; inventory and are not exempt from listing. &lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;br /&gt;&lt;b&gt;FEDERAL &#10;REGULATIONS &lt;/b&gt;&lt;br /&gt;&lt;b&gt;Inventory Issues: &lt;/b&gt;&lt;br /&gt;The hydrated components of this product &#10;are listed on the TSCA Inventory under their parent anhydrous compounds. &lt;br /&gt;&lt;b&gt;SARA Title III Hazard Classes: &lt;/b&gt;&lt;br /&gt;&lt;table cellspacing="2" cellpadding="0" border="0"&gt; &#10; &lt;tr&gt; &lt;td align="left"&gt;Fire &#10; Hazard &lt;/td&gt; &lt;td align="left"&gt;- NO &#10; &lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td align="left"&gt;Reactive &#10; Hazard &lt;/td&gt; &lt;td align="left"&gt;- NO &#10; &lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td align="left"&gt;Release &#10; of Pressure &lt;/td&gt; &lt;td align="left"&gt;- NO &#10; &lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td align="left"&gt;Acute &#10; Health Hazard &lt;/td&gt; &lt;td align="left"&gt;- YES &#10; &lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td align="left"&gt;Chronic &#10; Health Hazard &lt;/td&gt; &lt;td align="left"&gt;- NO &#10; &lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;br /&gt;&lt;b&gt;STATE &#10;REGULATIONS: &lt;/b&gt;&lt;br /&gt;This product does not &#10;contain any components that are regulated under California Proposition 65. &lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;h3&gt;16. OTHER INFORMATION&lt;/h3&gt;&lt;b&gt;National &#10;Fire Protection Association Hazard Ratings--NFPA(R): &lt;/b&gt;&lt;br /&gt;&lt;table cellspacing="2" cellpadding="0" border="0"&gt; &#10; &lt;tr&gt; &lt;td align="middle"&gt;&lt;b&gt;3 &#10; &lt;/b&gt;&lt;/td&gt; &lt;td align="left"&gt;Health &#10; Hazard Rating--Serious &lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td align="middle"&gt;&lt;b&gt;0 &#10; &lt;/b&gt;&lt;/td&gt; &lt;td align="left"&gt;Flammability Rating--Minimal &lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td align="middle"&gt;&lt;b&gt;0 &#10; &lt;/b&gt;&lt;/td&gt; &lt;td align="left"&gt;Instability Rating--Minimal &lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;br /&gt;&lt;b&gt;National Paint &#10;&amp;amp; Coating Hazardous Materials Identification System--HMIS(R): &lt;/b&gt;&lt;br /&gt;&lt;table cellspacing="2" cellpadding="0" border="0"&gt; &#10; &lt;tr&gt; &lt;td align="middle"&gt;&lt;b&gt;3 &#10; &lt;/b&gt;&lt;/td&gt; &lt;td align="left"&gt;Health &#10; Hazard Rating--Serious &lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td align="middle"&gt;&lt;b&gt;0 &#10; &lt;/b&gt;&lt;/td&gt; &lt;td align="left"&gt;Flammability Rating--Minimal &lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td align="middle"&gt;&lt;b&gt;0 &#10; &lt;/b&gt;&lt;/td&gt; &lt;td align="left"&gt;Reactivity Rating--Minimal &lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;br /&gt;&lt;b&gt;Reason for Revisions: &lt;/b&gt;&lt;br /&gt;Change and/or addition made to Section 11. &lt;br /&gt;&lt;b&gt;Key Legend Information: &lt;/b&gt;&lt;br /&gt;ACGIH - American Conference of Governmental Industrial Hygienists &lt;br /&gt;OSHA - Occupational Safety and Health Administration &lt;br /&gt;TLV - Threshold &#10;Limit Value &lt;br /&gt;PEL - Permissable Exposure Limit &lt;br /&gt;TWA - Time Weighted Average &lt;br /&gt;STEL - Short Term Exposure Limit &lt;br /&gt;NTP - National Toxicology Program &lt;br /&gt;IARC - International Agency for Research on Cancer &lt;br /&gt;ND - Not determined &lt;br /&gt;RPI - Rhone-Poulenc Established Exposure Limits &lt;br /&gt;&lt;b&gt;Disclaimer: &lt;/b&gt;&lt;br /&gt;The &#10;information herein is given in good faith but no warranty, expressed or implied, &#10;is made.&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Standard Certification Marks</title><link>https://technick.net/guides/electronics/safetymarks/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/safetymarks/</guid><description>&lt;blockquote&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;font size="1"&gt;&lt;nobr&gt;&lt;a href="#vde"&gt;[VDE Testing and Certification Institute]&lt;/a&gt;&lt;/nobr&gt; &lt;nobr&gt;&lt;a href="#ul"&gt;[Underwriters Laboratories Inc.]&lt;/a&gt;&lt;/nobr&gt; &lt;nobr&gt;&lt;a href="#csa"&gt;[CSA International]&lt;/a&gt;&lt;/nobr&gt; &lt;nobr&gt;&lt;a href="#nemko"&gt;[NEMKO]&lt;/a&gt;&lt;/nobr&gt; &lt;nobr&gt;&lt;a href="#demko"&gt;[DEMKO]&lt;/a&gt;&lt;/nobr&gt; &lt;nobr&gt;&lt;a href="#fimko"&gt;[FIMKO]&lt;/a&gt;&lt;/nobr&gt; &lt;nobr&gt;&lt;a href="#semko"&gt;[SEMKO]&lt;/a&gt;&lt;/nobr&gt; &lt;nobr&gt;&lt;a href="#various"&gt;[VARIOUS]&lt;/a&gt;&lt;/nobr&gt; &lt;/font&gt;&lt;/p&gt;&lt;a name="vde"&gt;&lt;/a&gt;&lt;p&gt;&lt;table border="2" cellspacing="2" cellpadding="2"&gt;&lt;tr bgcolor="#FFFF80"&gt;&lt;th colspan="2"&gt;&lt;font size="4"&gt;&lt;a href="http://www.vde.de" target="_blank"&gt;VDE Testing and Certification Institute&lt;/a&gt;&lt;/font&gt;&lt;/th&gt;&lt;/tr&gt;&lt;tr&gt;&lt;th&gt;Mark&lt;/th&gt;&lt;th&gt;Description&lt;/th&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="center"&gt;&lt;img src="https://technick.net/img/guide_safetymarks/vde_drei.gif" width="59" height="47" border="0" alt="" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;VDE Mark for appliances as technical equipment according to the Appliance Safety Law (GSG), for Medical Device Law (MPG), components and installation materials.&lt;/b&gt;The VDE Mark indicates conformity with the VDE standards or European or internationally harmonized standards resp. and confirms compliance with protective requirements of the applicable EC Directive(s). The VDE Mark is a symbol for electrical, mechanical, thermal, toxic, radiological and other hazards.&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="center"&gt;&lt;img src="https://technick.net/img/guide_safetymarks/vde_gs.gif" width="116" height="47" border="0" alt="" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;For appliances as technical equipment according to the GSG.&lt;/b&gt;For ready-to-use equipment, the licence holder may chose to affix the VDE Mark or the VDE GS Mark.&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="center"&gt;&lt;img src="https://technick.net/img/guide_safetymarks/vde_enec.gif" width="141" height="47" border="0" alt="" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;For products certified on the basis of harmonized certification agreements.&lt;/b&gt;Testing is based on harmonized European standards listed in the &lt;a href="http://www.enec.com" target="_blank"&gt;ENEC&lt;/a&gt; Agreement. Products (at present luminaires and related components, energy saving lamps, IT equipment, transformers, switches for appliances, electrical controls, certain types of capacitors and EMI suppression components) tested to tested to the listed standards may be marked with the ENEC Mark of the VDE. The approval of any other body participating in the ENEC Agreement is not required. &lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="center"&gt;&lt;img src="https://technick.net/img/guide_safetymarks/vde_emv.gif" width="50" height="57" border="0" alt="" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;For appliances in compliance with standards for electromagnetic compatibility.&lt;/b&gt;The VDE EMC Mark expresses the conformity of a product with applicable standards for electromagnetic compatibility. The reliable function of the product in its electromagnetic environment is also included. The requirements for granting this mark comprise automatically and without restriction the compliance with applicable standards. &lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="center"&gt;&lt;img src="https://technick.net/img/guide_safetymarks/vde_kab.gif" width="109" height="20" border="0" alt="" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;For cables, insulated cords, installation conduits and ducts, the VDE Cable Mark is applicable.&lt;/b&gt;&lt;br /&gt;&lt;br /&gt;&lt;img src="https://technick.net/img/guide_safetymarks/vde_kabel1.gif" width="210" height="8" border="0" alt="" /&gt;&lt;br /&gt;For cables and cords, the VDE Identification Thread may be used. &lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="center"&gt;&lt;img src="https://technick.net/img/guide_safetymarks/vde_har.gif" width="230" height="20" border="0" alt="" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;VDE-HARmonization Marking&lt;/b&gt;&lt;br /&gt;&lt;br /&gt;&lt;img src="https://technick.net/img/guide_safetymarks/vde_kabel2.gif" width="300" height="10" border="0" alt="" /&gt;&lt;br /&gt;&lt;b&gt;The VDE HARmonization Marking or VDE HARmonization Thread resp. for cables and insulated cords according to harmonized certification procedures.&lt;/b&gt;Testing is based on the Harmonization Documents (HD) listed in the HAR Agreement. Products (harmonized power cables) tested and found in compliance with with the requirements of the mentioned standards may be marked with the VDE HARmonization Marking. Further information is available from the Laboratory for Cables and Cords, Materials and Special Tests. &lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="center"&gt;&lt;img src="https://technick.net/img/guide_safetymarks/vde_kom.gif" width="63" height="41" border="0" alt="" /&gt;&lt;/td&gt;&lt;td&gt;The &lt;b&gt;VDE Component Mark&lt;/b&gt; may be used for electronic components.&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="center"&gt;&lt;img src="https://technick.net/img/guide_safetymarks/vde_cecc.gif" width="46" height="45" border="0" alt="" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;The CECC Mark for electronic components according to CECC Specifications.&lt;/b&gt;For electronic components according to CECC Specifications (CECC: CENELEC Electronic Components Committee) the CECC Mark may be used. &lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="center"&gt;&lt;img src="https://technick.net/img/guide_safetymarks/vde_reg.gif" width="104" height="41" border="0" alt="" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;VDE-Reg.-Nr. XXXXX&lt;/b&gt;&lt;br /&gt;&lt;b&gt;VDE-Reg.-Nr. (VDE Certificate of Conformity in conjunction with factory surveillance)&lt;/b&gt;This mark is used in two cases: firstly, for products in compliance with applicable clauses of VDE standards in the absence of a fully applicable VDE standard, and secondly, if a product, e.g. a sub-assembly, requires the fulfillment of additional conditions when incorporated into complete equipment. For cables and insulated cords, the VDE-Reg.-Nr. or the relevant mark resp. is applicable in absence of special regulations for products which were tested on the basis other standards. Special constructions and all variations of non-harmonized cables and insulated cords belong to this category of products. &lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/p&gt;</description></item><item><title>Standard Resistors Values</title><link>https://technick.net/guides/electronics/standard_resistors_table/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/standard_resistors_table/</guid><description>&lt;hr /&gt;&lt;blockquote&gt;&lt;p&gt;&lt;b&gt;Reference and Sources:&lt;/b&gt;&lt;ul class="sources"&gt;&lt;li&gt;Manuale di elettronica e telecomunicazioni - Giuseppe Biondo, Enrico Sacchi. Vol.II - IX-40&lt;/li&gt;&lt;li&gt;http://users.eecs.ukans.edu/~kuku/Standard_Resistors.php&lt;/li&gt;&lt;/ul&gt;&lt;/p&gt;&lt;p&gt;The technical specifications for a resistor are:&lt;ul&gt;&lt;li&gt;nominal resistance value [Ohm]&lt;/li&gt;&lt;li&gt;tolerance [%] (indicate the maximum difference (+/-) between nominal and real resistance value)&lt;/li&gt;&lt;li&gt;nominal dissipable power [W]&lt;/li&gt;&lt;li&gt;power-temperature diagrams&lt;/li&gt;&lt;li&gt;temperature coefficient&lt;/li&gt;&lt;li&gt;nominal maximum voltage [V]&lt;/li&gt;&lt;li&gt;noise tension&lt;/li&gt;&lt;li&gt;tension coefficient&lt;/li&gt;&lt;li&gt;resistance-frequency characteristic&lt;/li&gt;&lt;/ul&gt;the first three are always indicated.&lt;/p&gt;&lt;p&gt;The succession of nominal resistance values fit a geometric progression:&lt;br /&gt;&lt;b&gt;N = 10&lt;sup&gt;((n-1)/k)&lt;/sup&gt;&lt;/b&gt;&lt;br /&gt;where: &lt;b&gt;N&lt;/b&gt; is the nominal resistance value at &lt;b&gt;n&lt;/b&gt; position;&lt;br /&gt;&lt;b&gt;k&lt;/b&gt; is a coefficient related to tolerance in this way:&lt;table border="1" cellpadding="1" cellspacing="1"&gt;&lt;tr&gt;&lt;th&gt;Tolerance [%]&lt;/th&gt;&lt;th&gt;k&lt;/th&gt;&lt;th&gt;Series Name&lt;/th&gt;&lt;/tr&gt;&lt;tr align="center"&gt;&lt;td&gt;20&lt;/td&gt;&lt;td&gt;6&lt;/td&gt;&lt;td&gt;E6&lt;/td&gt;&lt;/tr&gt;&lt;tr align="center"&gt;&lt;td&gt;10&lt;/td&gt;&lt;td&gt;12&lt;/td&gt;&lt;td&gt;E12&lt;/td&gt;&lt;/tr&gt;&lt;tr align="center"&gt;&lt;td&gt;5&lt;/td&gt;&lt;td&gt;24&lt;/td&gt;&lt;td&gt;E24&lt;/td&gt;&lt;/tr&gt;&lt;tr align="center"&gt;&lt;td&gt;2&lt;/td&gt;&lt;td&gt;48&lt;/td&gt;&lt;td&gt;E48&lt;/td&gt;&lt;/tr&gt;&lt;tr align="center"&gt;&lt;td&gt;1&lt;/td&gt;&lt;td&gt;96&lt;/td&gt;&lt;td&gt;E96&lt;/td&gt;&lt;/tr&gt;&lt;tr align="center"&gt;&lt;td&gt;0.5&lt;/td&gt;&lt;td&gt;192&lt;/td&gt;&lt;td&gt;E192&lt;/td&gt;&lt;/tr&gt;&lt;tr align="center"&gt;&lt;td&gt;0.25&lt;/td&gt;&lt;td&gt;192&lt;/td&gt;&lt;td&gt;E192&lt;/td&gt;&lt;/tr&gt;&lt;tr align="center"&gt;&lt;td&gt;0.1&lt;/td&gt;&lt;td&gt;192&lt;/td&gt;&lt;td&gt;E192&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/p&gt;</description></item><item><title>Stripline Impedance</title><link>https://technick.net/guides/electronics/stripline_impedances/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/stripline_impedances/</guid><description>&lt;p&gt;This guide was written by Nathan Towne (2009-09)&lt;br /&gt;&lt;img width="322" height="36" src="https://technick.net/img/guide_stripimp/email.png" /&gt;&lt;br /&gt;&lt;/p&gt;&#10;&lt;h3&gt;Introduction&lt;/h3&gt;&#10;&lt;p&gt;There are quite a few calculators for microstrip and stripline, and commercial products that do the same. But I was looking for a method of constructing a balun of controlled and fairly low impedances, which requires broadside-coupled stripline, where the widths of the traces mostly control the even (common-mode) impedance, and the spacing the odd (differential) impedance. I had in mind using copper tape for the traces and ground planes, polystyrene sheets for dielectric between the traces and the ground plane, and polyethylene or polystyrene sheets setting the spacing between the traces. The problem I encountered is the apparent dearth of information on the impedances of broadside-coupled stripline.&lt;/p&gt;&lt;p&gt;I ended up calculating those impedances using the Superfish/Poisson finite-element codes available from the Accelerator Code group at Los Alamos National Laboratory. The codes are used to calculate the capacitances of the even and odd modes by applying the appropriate boundary condition of each in a Laplace boundary-value calculation. The formula&lt;/p&gt;&#10;&lt;blockquote&gt;&lt;img width="70" height="44" src="https://technick.net/img/guide_stripimp/ImpedanceFormula.png" /&gt;&lt;/blockquote&gt;&#10;&lt;p&gt;where where &amp;#956; and &amp;#949; are the permeability and permittivity of the medium, respectively, and C includes the dielectric constant, is then applied to each mode's capacitance in turn.&lt;/p&gt;&#10;&lt;p&gt;This note gives the results of those calculations.&lt;/p&gt;&#10;&lt;img width="335" height="365" src="https://technick.net/img/guide_stripimp/TwinLeadTermination.png" style="float: right;" /&gt;&#10;&lt;p&gt;First a note about the meaning of the impedances, since there can be a factor of two between definitions. The figure to the right showing the simultaneous matched termination of the even and odd modes of a twin-lead transmission line shows how the even- and odd-mode impedances &lt;i&gt;Z&lt;sub&gt;even&lt;/sub&gt;&lt;/i&gt; and &lt;i&gt;Z&lt;sub&gt;odd&lt;/sub&gt;&lt;/i&gt; are to be interpreted, where &lt;i&gt;Z&lt;sub&gt;odd&lt;/sub&gt;&lt;sup&gt;*&lt;/sup&gt;&lt;/i&gt; in parallel with &lt;i&gt;Z&lt;sub&gt;even&lt;/sub&gt;&lt;/i&gt; is &lt;i&gt;Z&lt;sub&gt;odd&lt;/sub&gt;&lt;/i&gt;:&lt;/p&gt;</description></item><item><title>The Ultimate Memory Guide v.6</title><link>https://technick.net/guides/hardware/umg/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/umg/</guid><description/></item><item><title>0. Introduction to Static Electricity</title><link>https://technick.net/guides/electronics/esd/000/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/esd/000/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/electronics/esd/001"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;Introduction to Static Electricity&lt;/h3&gt;&lt;p&gt;In ordinary &#10;circumstances, static electricity and ESD are little more than an annoyance. &#10;However, in an increasingly technological age, the familiar static shock we &#10;receive when walking across a carpet can be costly or dangerous.&lt;/p&gt;&lt;p&gt;This same static discharge can ignite flammable mixtures and damage &#10;electronic components. Static electricity can attract contaminants in clean &#10;environments or cause products to stick together.&lt;/p&gt;&lt;p&gt;The cost of ESD-damaged electronic devices alone ranges from only a few cents &#10;for a simple diode to several hundred dollars for complex hybrids. Loss of &#10;production time in web processing industries due to static attraction is &#10;significant. When associated costs of repair and rework, shipping, labor, and &#10;overhead are included, clearly the opportunities exist for significant &#10;improvements in reducing losses to ESD and static electricity.&lt;/p&gt;&lt;h3&gt;Index&lt;/h3&gt;&lt;ul&gt; &lt;li&gt;&lt;a href="https://technick.net/guides/electronics/esd/001"&gt;1. An Introduction to ESD&lt;/a&gt; &#10; &lt;/li&gt;&lt;li&gt;&lt;a href="https://technick.net/guides/electronics/esd/002"&gt;2. Principles of ESD Control&lt;/a&gt; &#10; &lt;/li&gt;&lt;li&gt;&lt;a href="https://technick.net/guides/electronics/esd/003"&gt;3. An Overview of ESD Control Procedures and Materials&lt;/a&gt; &#10; &lt;/li&gt;&lt;li&gt;&lt;a href="https://technick.net/guides/electronics/esd/004"&gt;4. Auditing and Training&lt;/a&gt; &#10; &lt;/li&gt;&lt;li&gt;&lt;a href="https://technick.net/guides/electronics/esd/005"&gt;5. Device Sensitivity and Testing&lt;/a&gt; &#10; &lt;/li&gt;&lt;li&gt;&lt;a href="https://technick.net/guides/electronics/esd/006"&gt;6. ESD Standards&lt;/a&gt; &#10; &lt;/li&gt;&lt;li&gt;&lt;a href="https://technick.net/guides/electronics/esd/007"&gt;7. Bibliography&lt;/a&gt; &#10; &lt;/li&gt;&lt;/ul&gt; &lt;hr /&gt;&lt;h3&gt;Links to Other ESD Resources&lt;/h3&gt;&lt;font size="1"&gt;&lt;p&gt;&lt;b&gt;Associations&lt;br /&gt;&lt;/b&gt;Arizona ESD &#10;Association&lt;br /&gt;&lt;a href="http://www.eia.org/" target="_blank"&gt;Electronic Industries &#10;Alliance&lt;/a&gt;&lt;br /&gt;&lt;a href="http://www.electrostatics.org/" target="_blank"&gt;Electrostatics Society &#10;of America&lt;/a&gt; &lt;br /&gt;&lt;a href="http://www.idema.org/" target="_blank"&gt;IDEMA &lt;/a&gt;&lt;br /&gt;Institute of &#10;Electrostatics - Japan&lt;br /&gt;&lt;a href="http://www.iest.org/" target="_blank"&gt;Institute of &#10;Environmental Sciences and Technology&lt;/a&gt;&lt;br /&gt;&lt;a href="http://www.ipc.org/" target="_blank"&gt;IPC - &#10;Association Connecting Electronic Industries&lt;/a&gt; &lt;br /&gt;&lt;a href="http://www.jedec.org/" target="_blank"&gt;JEDEC&lt;/a&gt;&lt;br /&gt;Midwest Chapter, ESD Association &lt;br /&gt;&lt;a href="http://www.narte.org/" target="_blank"&gt;National Association of Radio and &#10;Telecommunications Engineers (NARTE)&lt;/a&gt;&lt;br /&gt;Northeast Chapter, ESD &#10;Association&lt;br /&gt;&lt;a href="http://www.smta.org/" target="_blank"&gt;Surface Mount Technology &#10;Association &lt;/a&gt;&lt;/p&gt;&lt;p&gt;&lt;b&gt;Publications&lt;br /&gt;&lt;/b&gt;&lt;a href="http://www.cassembly.com/" target="_blank"&gt;Circuits &#10;Assembly&lt;/a&gt;&lt;br /&gt;Compliance &#10;Engineering&lt;br /&gt;&lt;a href="http://www.esdjournal.com/" target="_blank"&gt;ESD Journal&lt;/a&gt;&lt;br /&gt;&lt;a href="http://www.evaluationengineering.com/" target="_blank"&gt;Evaluation Engineering&lt;/a&gt;&lt;br /&gt;Test and Measurement &#10;World&lt;br /&gt;&lt;a href="http://www.testandmeasurement.com/" target="_blank"&gt;Test and Measurement &#10;Online&lt;/a&gt; &amp;nbsp;&lt;/p&gt;&lt;p&gt;&lt;b&gt;Standards&lt;br /&gt;&lt;/b&gt;&lt;a href="http://www.ansi.org/" target="_blank"&gt;American National &#10;Standards Institute&lt;/a&gt;&lt;br /&gt;&lt;a href="http://www.astm.org/" target="_blank"&gt;American Society for &#10;Testing and Materials (ASTM)&lt;/a&gt;&lt;br /&gt;&lt;a href="http://www.bsi.org.uk/" target="_blank"&gt;British &#10;Standards Institution&lt;/a&gt;&lt;br /&gt;&lt;a href="http://www.din.de/" target="_blank"&gt;DIN (Deutsches &#10;Institut fur Normung&lt;/a&gt;)&lt;br /&gt;&lt;a href="http://www.eia.org/" target="_blank"&gt;Electronic Industries &#10;Alliance&lt;/a&gt; &lt;br /&gt;&lt;a href="http://www.idema.org/" target="_blank"&gt;IDEMA &lt;/a&gt;&lt;br /&gt;&lt;a href="http://www.ipc.org/" target="_blank"&gt;IPC - Association Connecting Electronic &#10;Industries&lt;/a&gt; &lt;br /&gt;&lt;a href="http://www.ieee.org/" target="_blank"&gt;IEEE&lt;/a&gt;&lt;br /&gt;&lt;a href="http://www.iec.ch/" target="_blank"&gt;International Electrotechnical Commission &#10;(IEC)&lt;/a&gt;&lt;br /&gt;&lt;a href="http://www.jedec.org/" target="_blank"&gt;JEDEC&lt;/a&gt;&lt;/p&gt;&lt;/font&gt;&lt;/blockquote&gt;</description></item><item><title>0. Table of Contents</title><link>https://technick.net/guides/hardware/umg/00_toc/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/umg/00_toc/</guid><description>&lt;table border="0" cellspacing="4" cellpadding="4"&gt;&lt;tr valign="top"&gt;&lt;td&gt;&lt;a href="http://www.kingston.com" target="_blank"&gt;&lt;img src="https://technick.net/img/guide_umg/guide_umg_logo_01.jpg" width="200" height="78" border="0" alt="www.kingston.com" /&gt;&lt;/a&gt;&lt;/td&gt;&lt;td bgcolor="#DBE7FF"&gt;This is an original HTML version of THE ULTIMATE MEMORY GUIDE&lt;sup&gt;&lt;font size="-1"&gt;TM&lt;/font&gt;&lt;/sup&gt; reproduced by permission.&#10;&amp;copy;2000 &lt;a href="http://www.kingston.com" target="_blank"&gt;Kingston Technology Company&lt;/a&gt;, Inc. All rights reserved.&#10;All trademarks and registered trademarks are the property of their respective owners.&#10;PowerPC is a trademark of &lt;a href="http://www.ibm.com" target="_blank"&gt;International Business Machines Corporation&lt;/a&gt;, used under license therefrom.&#10;Windows is a trademark of &lt;a href="http://www.microsoft.com" target="_blank"&gt;Microsoft Corporation&lt;/a&gt;. &#10;All other trademarks and registered trademarks are the property of their respective owners.&#10;This publication may contain typographical errors or technical inaccuracies.&#10;Any errors will be periodically corrected in future updates of this publication. &lt;a href="http://www.kingston.com" target="_blank"&gt;Kingston Technology&lt;/a&gt; reserves the right to make changes to text and/or illustrations in this document at any time.&#10;This publication is the sole property of &lt;a href="http://www.kingston.com" target="_blank"&gt;Kingston Technology&lt;/a&gt; and may not be copied or modified in part or in whole without the express permission of &lt;a href="http://www.kingston.com" target="_blank"&gt;Kingston Technology&lt;/a&gt;.&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="#TOC"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/01_000"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;</description></item><item><title>00. About the Author</title><link>https://technick.net/guides/electronics/bpw/00_aboutauthor/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/00_aboutauthor/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;About the Author&lt;/h3&gt;&lt;p&gt; &lt;h1&gt;&lt;font face="Arial, Helvetica, sans-serif"&gt;&lt;img src="https://technick.net/img/guide_bpw2/Isidor-pic2.jpg" width="155" height="302" align="right" alt="Isidor Buchmann, founder and CEO of Cadex Electronics Inc." border="0" /&gt;&lt;/font&gt;&lt;/h1&gt; &lt;/p&gt;&lt;p&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;A versatile &#10; inventor, researcher and writer, Mr. Isidor Buchmann is the &#10; president, founder and CEO of Cadex Electronics Inc., located &#10; in Richmond (Vancouver), Canada.&lt;/font&gt;&lt;/p&gt; &lt;p&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;Fascinated &#10; by electronics during his high school years, Mr. Buchmann &#10; took to inventing at an early age, designing a fuel-powered &#10; engine that was based on continuous combustion. His drawings &#10; and theory of operation were reviewed by Felix Wankel, inventor &#10; of the Wankel Rotary Engine, who kindly replied that while &#10; the design was indeed unique and original, manufacturing would &#10; be too expensive to be commercially viable. Further to his &#10; credit, Mr. Buchmann invented a broadcast radio that ran on &#10; no power — it required only an antenna and a ground connection &#10; (it didn’t even use a battery). Mr. Buchmann sold several &#10; of these radio receivers to his family and colleagues and &#10; later set up a workshop in the attic where he restored and &#10; resold old radios. After high school, a four-year apprenticeship &#10; as a Radio Technician brought him practical experience in &#10; a workshop environment as well as academic theory. Finally, &#10; his experience with radio communications in the Swiss army &#10; led to his decision to make electronics his life's work.&lt;/font&gt;&lt;/p&gt; &lt;p&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;Realizing &#10; that conservative Switzerland would not satisfy his entrepreneurial &#10; spirit, Mr. Buchmann emigrated to Canada in 1966, eventually &#10; finding employment in the radio communications department &#10; at General Electric. There he realized that a major problem &#10; with two-way radios was the battery's short life and, as part &#10; of his job, tested a wide variety.Chapter 18: Beginnings and &#10; Horizons of customer batteries that came in. In his spare &#10; time at home, he continued to research and develop electronic &#10; devices in his spare time, developing a battery analyzer that &#10; featured a ‘recondition’ program which restored weakened nickel &#10; cadmium batteries.&lt;/font&gt;&lt;/p&gt; &lt;p&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;To prevent &#10; a conflict of interest with his employer, Mr. Buchmann quit &#10; his job with GE and started Cadex. The first battery analyzer, &#10; the Cadex 450, was introduced in 1981 but failed to achieve &#10; the anticipated market acceptance. Still in his spare time, &#10; Mr. Buchmann designed the modular Cadex 550 battery analyzer. &#10; This model sold reasonably well at first but it soon became &#10; evident that manufacturing methods needed to be improved to &#10; make it cost effective.&lt;/font&gt;&lt;/p&gt; &lt;p&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;In 1984, &#10; Cadex moved from a small room in Mr. Buchmann's residence &#10; to rented facilities. With increased overhead costs, a staff &#10; to maintain and sluggish sales, cash flow became tight. Bank &#10; loans for start-up companies, especially high-tech firms, &#10; were almost non-existent at the time, so Mr. Buchmann worked &#10; from home during the day looking after his growing children &#10; and spent time in the office during the evening. Happily, &#10; the company survived the slump and managed to add a number &#10; of new products. Profitability returned and the staff grew.&lt;/font&gt;&lt;/p&gt; &lt;p&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;Knowing &#10; that the wealth of an organization is in human resources, &#10; Isidor resolved to provide an environment that was conducive &#10; to attracting good people with skills that complemented his &#10; own strengths and weaknesses. Spacious new headquarters in &#10; a park-like setting overlooking the scenic Fraser River add &#10; to a pleasant working experience. Under Mr. Buchmann’s leadership, &#10; new and innovative products were developed that generated &#10; rapid growth and created global recognition of Cadex.&lt;/font&gt;&lt;/p&gt; &lt;p&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;Today, &#10; Cadex is a world leader in the design and manufacture of battery &#10; analyzers and chargers.&lt;/font&gt;&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>00. Author's Note</title><link>https://technick.net/guides/electronics/bpw/00_authorsnote/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/00_authorsnote/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/00_part1"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_intro"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;Author's Note&lt;/h3&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;Battery user groups have asked me to write an edited version &#10; of &lt;i&gt;Batteries in a Portable World&lt;/i&gt;. The first edition &#10; was published in 1997. Much has changed since then. &lt;/p&gt; &lt;p&gt;My very first publication in book form was entitled &#10; &lt;i&gt;Strengthening the Weakest Link&lt;/i&gt;. It was, in part, a &#10; collection of battery articles which I had written. These &#10; articles had been published in various trade magazines and &#10; gained the interest of many readers. This goes back to the &#10; late 1980s and the material covered topics such as the memory &#10; effect of NiCd batteries and how to restore them.&lt;/p&gt; &lt;p&gt;In the early 1990s, attention moved to the nickel-metal &#10; hydride (NiMH) and the articles compared the classic nickel &#10; cadmium (NiCd) with the NiMH, the new kid on the block. In &#10; terms of longevity and ruggedness, the NiMH did not perform &#10; so well when placed against the NiCd and I was rather blunt &#10; about it. Over the years, however, the NiMH improved and today &#10; this chemistry performs well for mobile phones and other applications.&lt;/p&gt; &lt;p&gt;Then came the lithium-ion (Liion), followed &#10; by the lithium-ion polymer (Liion polymer). Each of &#10; these new systems, as introduced, claimed better performance, &#10; freedom from the memory effect and longer runtimes than the &#10; dated NiCd. In many cases, the statements made by the manufacturers &#10; about improvements were true, but not all users were convinced.&lt;/p&gt; &lt;p&gt;The second edition of &lt;i&gt;Batteries in a Portable &#10; World&lt;/i&gt; has grown to more than three times the size of the &#10; previous version. It describes the battery in a broader scope &#10; and includes the latest technologies, such as battery quick &#10; test. &lt;/p&gt; &lt;p&gt;Some new articles have also been woven in and &#10; some redundancies cannot be fully avoided. Much of this fresh &#10; material has been published in trade magazines, both in North &#10; America and abroad.&lt;/p&gt; &lt;p&gt;In the battery field, there is no black and &#10; white, but many shades of gray. In fact, the battery behaves &#10; much like a human being. It is mystical, unexplainable and &#10; can never be fully understood. For some users, the battery &#10; causes no problems at all, for others it is nothing but a &#10; problem. Perhaps a comparison can be made with the aspirin. &#10; For some, it works to remedy a headache, for others the headache &#10; gets worse. And no one knows exactly&amp;nbsp;why.&lt;/p&gt; &lt;p&gt;&lt;i&gt;Batteries in a Portable World &lt;/i&gt;is written &#10; for the non-engineer. It addresses the use of the battery &#10; in the hands of the general public, far removed from the protected &#10; test lab environment of the manufacturer. Some information &#10; contained in this book was obtained through tests performed &#10; in Cadex laboratories; other knowledge was gathered by simply &#10; talking to diverse groups of battery users. Not all views &#10; and opinions expressed in the book are based on scientific &#10; facts. Rather, they follow opinions of the general public, &#10; who use batteries. Some difference of opinion with the reader &#10; cannot be avoided. I will accept the blame for any discrepancies, &#10; if justified.&lt;/p&gt; &lt;p&gt;Readers of the previous edition have commented &#10; that I favor the NiCd over the NiMH. Perhaps this observation &#10; is valid and I have taken note. Having been active in the &#10; mobile radio industry for many years, much emphasis was placed &#10; on the longevity of a battery, a quality that is true of the &#10; NiCd. Today’s battery has almost become a disposable item. &#10; This is especially true in the vast mobile phone market where &#10; small size and high energy density take precedence over longevity.&lt;/p&gt; &lt;p&gt;Manufacturers are very much in tune with customers’ &#10; demands and deliver on maximum runtime and small size. These &#10; attributes are truly visible at the sales counter and catch &#10; the eye of the vigilant buyer. What is less evident is the &#10; shorter service life. However, with rapidly changing technology, &#10; portable equipment is often obsolete by the time the battery &#10; is worn out. No longer do we need to pamper a battery like &#10; a Stradivarius violin that is being handed down from generation &#10; to generation. With mobile phones, for example, upgrading &#10; to a new handset may be cheaper than purchasing a replacement &#10; battery. Small size and reasonable runtime are key issues &#10; that drive the consumer market today. Longevity often comes &#10; second or&amp;nbsp;third.&lt;/p&gt; &lt;p&gt;In the industrial market such as public safety, &#10; biomedical, aviation and defense, requirements are different. &#10; Longevity is given preference over small size. To suit particular &#10; applications, battery manufacturers are able to adjust the &#10; amount of chemicals and active materials that go into a cell. &#10; This fine-tuning is done on nickel-based as well as lead and &#10; lithium-based batteries.&lt;/p&gt; &lt;p&gt;In a nutshell, the user is given the choice &#10; of long runtime, small size or high cycle count. No one single &#10; battery can possess all these attributes. Battery technology &#10; is truly a compromise.&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>00. Frequently Asked Questions about Batteries (FAQ)</title><link>https://technick.net/guides/electronics/bpw/00_faq/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/00_faq/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;Frequently Asked Questions about Batteries (FAQ)&lt;/h3&gt;&lt;p&gt; &lt;!-- #EndEditable --&gt; &lt;td width="100%" valign="top"&gt; &lt;!-- #BeginEditable "maintextarea" --&gt; &#10; &lt;table width="100%" border="0" cellspacing="0" cellpadding="15"&gt; &lt;tr&gt; &#10; &lt;td&gt; &#10; &lt;p&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;&lt;b&gt;Which &#10; battery chemistry is best suited for my application?&lt;/b&gt;&lt;/font&gt;&lt;br /&gt; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;b&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c02_01"&gt;Chapter &#10; 2:&lt;/a&gt;&lt;/font&gt;&lt;/b&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt; &#10; Battery Chemistries&lt;br /&gt; &lt;b&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c06_01"&gt;Chapter 6:&lt;/a&gt; &lt;/b&gt;The Secrets &#10; of Battery Runtime, Increasing Internal Resistance&lt;br /&gt; &lt;b&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c08_01"&gt;Chapter 8:&lt;/a&gt;&lt;/b&gt;&lt;a href="11.pdf"&gt; &#10; &lt;/a&gt;Choosing the Right Battery&lt;br /&gt; &lt;b&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c09_01"&gt;Chapter 9:&lt;/a&gt;&lt;/b&gt; Internal &#10; Battery Resistance&lt;br /&gt; &lt;b&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c15_01"&gt;Chapter 15:&lt;/a&gt;&lt;/b&gt; Caring &#10; for Your Batteries from Birth to Retirement &lt;/font&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/p&gt;&lt;p&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;&lt;b&gt;Is &#10; the lithium polymer superior to other systems?&lt;br /&gt; &lt;/b&gt;&lt;/font&gt; &#10; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;b&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c02_01"&gt;Chapter &#10; 2:&lt;/a&gt;&lt;/font&gt;&lt;/b&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt; &#10; Battery Chemistries, The Lithium Polymer Battery&lt;/font&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/p&gt;&lt;p&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;&lt;b&gt;What &#10; do I need to know about chargers?&lt;/b&gt;&lt;/font&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;&lt;/font&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;&lt;br /&gt; &lt;/font&gt; &#10; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;b&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c04_01"&gt;Chapter &#10; 4:&lt;/a&gt;&lt;/font&gt;&lt;/b&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt; &#10; Proper Charge Methods&lt;/font&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/p&gt;&lt;p&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;&lt;b&gt;How &#10; deeply can I discharge a battery?&lt;/b&gt;&lt;/font&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;&lt;/font&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;&lt;br /&gt; &lt;/font&gt; &#10; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;b&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c05_01"&gt;Chapter &#10; 5:&lt;/a&gt;&lt;/font&gt;&lt;/b&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt; &#10; Discharge Methods&lt;/font&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/p&gt;&lt;p&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;&lt;b&gt;What &#10; should I know about temperature extremes?&lt;/b&gt;&lt;/font&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;&lt;/font&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;&lt;br /&gt; &lt;/font&gt; &#10; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;b&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c04_01"&gt;Chapter &#10; 4:&lt;/a&gt;&lt;/font&gt;&lt;/b&gt;&lt;a href="7.pdf"&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt; &#10; &lt;/font&gt;&lt;/a&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;Proper &#10; Charge Methods, Charging at High and Low Temperatures&lt;br /&gt; &lt;b&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c05_01"&gt;Chapter 5:&lt;/a&gt;&lt;/b&gt; Discharge &#10; Methods &lt;/font&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/p&gt;&lt;p&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;&lt;b&gt;Is &#10; the ‘smart’ battery a help or deterrent?&lt;/b&gt;&lt;/font&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;&lt;/font&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;&lt;br /&gt; &lt;/font&gt; &#10; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;b&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c07_01"&gt;Chapter &#10; 7:&lt;/a&gt;&lt;/font&gt;&lt;/b&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt; &#10; The ‘Smart’ Battery&lt;/font&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/p&gt;&lt;p&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;&lt;b&gt;What &#10; causes a battery to fail?&lt;/b&gt;&lt;/font&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;&lt;/font&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;&lt;br /&gt; &lt;/font&gt; &#10; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;b&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c06_01"&gt;Chapter &#10; 6:&lt;/a&gt;&lt;/font&gt;&lt;/b&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt; &#10; The Secrets of Battery Runtime&lt;br /&gt; &lt;b&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c10_01"&gt;Chapter 10:&lt;/a&gt;&lt;/b&gt; Getting &#10; the Most from your Batteries &lt;/font&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/p&gt;&lt;p&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;&lt;b&gt;Does &#10; a new battery always perform flawlessly?&lt;/b&gt;&lt;/font&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;&lt;/font&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;&lt;br /&gt; &lt;/font&gt; &#10; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;b&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c12_01"&gt;Chapter &#10; 12:&lt;/a&gt;&lt;/font&gt;&lt;/b&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt; &#10; Battery Maintenance Equipment, Battery Analyzers&lt;br /&gt; &lt;b&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c15_01"&gt;Chapter 15:&lt;/a&gt;&lt;/b&gt; Caring &#10; for Your Batteries from Birth to Retirement, Priming&lt;br /&gt; &lt;b&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c16_01"&gt;Chapter 16:&lt;/a&gt;&lt;/b&gt; Practical &#10; Battery Tips, Battery Analyzers for Critical Missions &#10; &lt;/font&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/p&gt;&lt;p&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;&lt;b&gt;Do &#10; I need to discharge a battery before charging it?&lt;/b&gt;&lt;/font&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;&lt;/font&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;&lt;br /&gt; &lt;/font&gt; &#10; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;b&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c10_01"&gt;Chapter &#10; 10:&lt;/a&gt;&lt;/font&gt;&lt;/b&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt; &#10; Getting the Most from your Batteries, How to Restore and &#10; Prolong Nickel-based Batteries&lt;/font&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/p&gt;&lt;p&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;&lt;b&gt;How &#10; does a battery analyzer improve battery reliability?&lt;/b&gt;&lt;br /&gt; &lt;/font&gt; &#10; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;b&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c11_01"&gt;Chapter &#10; 11:&lt;/a&gt;&lt;/font&gt;&lt;/b&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt; &#10; Maintaining Fleet Batteries&lt;br /&gt; &lt;b&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c12_01"&gt;Chapter 12:&lt;/a&gt;&lt;/b&gt; Battery &#10; Maintenance Equipment&lt;br /&gt; &lt;b&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c15_01"&gt;Chapter 15:&lt;/a&gt;&lt;/b&gt; Caring &#10; for Your Batteries from Birth to Retirement, The Million &#10; Dollar Battery Problem &lt;/font&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/p&gt;&lt;p&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;&lt;b&gt;Can &#10; I restore weak batteries and how well do they perform?&lt;/b&gt;&lt;/font&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;&lt;br /&gt; &lt;/font&gt; &#10; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;b&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c10_01"&gt;Chapter &#10; 10:&lt;/a&gt;&lt;/font&gt;&lt;/b&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt; &#10; Getting the Most from your Batteries, Battery Recovery &#10; Rate&lt;/font&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/p&gt;&lt;p&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;&lt;b&gt;How &#10; accurate is battery quick testing?&lt;/b&gt;&lt;/font&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;&lt;/font&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;&lt;br /&gt; &lt;/font&gt; &#10; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;b&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c13_01"&gt;Chapter &#10; 13:&lt;/a&gt;&lt;/font&gt;&lt;/b&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt; &#10; Making Battery Quick-Test Feasible&lt;/font&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/p&gt;&lt;p&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;&lt;b&gt;How &#10; do I store a battery?&lt;/b&gt;&lt;/font&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;&lt;/font&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;&lt;br /&gt; &lt;/font&gt; &#10; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;b&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c15_01"&gt;Chapter &#10; 15:&lt;/a&gt; &lt;/font&gt;&lt;/b&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;Caring &#10; for Your Batteries from Birth to Retirement, Storage&lt;/font&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/p&gt;&lt;p&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;&lt;b&gt;How &#10; do I recycle a battery?&lt;/b&gt;&lt;/font&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;&lt;/font&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;&lt;br /&gt; &lt;/font&gt; &#10; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0"&gt; &lt;tr&gt; &#10; &lt;td&gt; &#10; &lt;p&gt;&lt;b&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c15_01"&gt;Chapter &#10; 15:&lt;/a&gt;&lt;/font&gt;&lt;/b&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt; &#10; Caring for Your Batteries from Birth to Retirement, &#10; Battery Recycling&lt;/font&gt;&lt;/p&gt; &lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/p&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>00. Introduction</title><link>https://technick.net/guides/electronics/bpw/00_intro/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/00_intro/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/00_authorsnote"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c01_01"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;Introduction&lt;/h3&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;During the last few decades, rechargeable batteries have &#10; made only moderate improvements in terms of higher capacity &#10; and smaller size. Compared with the vast advancements in areas &#10; such as microelectronics, the lack of progress in battery &#10; technology is apparent. Consider a computer memory core of &#10; the sixties and compare it with a modern microchip of the &#10; same byte count. What once measured a cubic foot now sits &#10; in a tiny chip. A comparable size reduction would literally &#10; shrink a heavy-duty car battery to the size of a coin. Since &#10; batteries are still based on an electrochemical process, a &#10; car battery the size of a coin may not be possible using our &#10; current techniques. &lt;/p&gt; &lt;p&gt;Research has brought about a variety of battery &#10; chemistries, each offering distinct advantages but none providing &#10; a fully satisfactory solution. With today’s increased selection, &#10; however, better choices can be applied to suit a specific &#10; user application.&lt;/p&gt; &lt;p&gt;The consumer market, for example, demands high &#10; energy densities and small sizes. This is done to maintain &#10; adequate runtime on portable devices that are becoming increasingly &#10; more powerful and power hungry. Relentless downsizing of portable &#10; equipment has pressured manufacturers to invent smaller batteries. &#10; This, however, must be done without sacrificing runtimes. &#10; By packing more energy into a pack, other qualities are often &#10; compromised. One of these is longevity.&lt;/p&gt; &lt;p&gt;Long service life and predictable low internal &#10; resistance are found in the NiCd family. However, this chemistry &#10; is being replaced, where applicable, with systems that provide &#10; longer runtimes. In addition, negative publicity about the &#10; memory phenomenon and concerns of toxicity in disposal are &#10; causing equipment manufacturers to seek alternatives.&lt;/p&gt; &lt;p&gt;Once hailed as a superior battery system, the &#10; NiMH has also failed to provide the universal battery solution &#10; for the twenty-first century. Shorter than expected service &#10; life remains a major complaint.&lt;/p&gt; &lt;p&gt;The lithium-based battery may be the best choice, &#10; especially for the fast-moving commercial market. Maintenance-free &#10; and dependable, Li-ion is the preferred choice for many &#10; because it offers small size and long runtime. But this battery &#10; system is not without problems. A relatively rapid aging process, &#10; even if the battery is not in use, limits the life to between &#10; two and three years. In addition, a current-limiting safety &#10; circuit limits the discharge current, rendering the Li-ion &#10; unsuitable for applications requiring a heavy load. The Li-ion &#10; polymer exhibits similar characteristics to the Li-ion. &#10; No major breakthrough has been achieved with this system. &#10; It does offer a very slim form factor but this quality is &#10; attained in exchange for slightly less energy density.&lt;/p&gt; &lt;p&gt;With rapid developments in technology occurring &#10; today, battery systems that use neither nickel, lead nor lithium &#10; may soon become viable. Fuel cells, which enable uninterrupted &#10; operation by drawing on a continuous supply of fuel, may solve &#10; the portable energy needs in the future. Instead of a charger, &#10; the user carries a bottle of liquid energy. Such a battery &#10; would truly change the way we live and work.&lt;/p&gt; &lt;p&gt;This book addresses the most commonly used consumer and industrial &#10; batteries, which are NiCd, NiMH, Lead Acid, and Li-ion/polymer. &#10; It also includes the reusable alkaline for comparison. The &#10; absence of other rechargeable battery systems is done for &#10; reasons of clarity. Some weird and wonderful new battery inventions &#10; may only live in experimental labs. Others may be used for &#10; specialty applications, such as military and aerospace. Since &#10; this book addresses the non-engineer, it is the author’s wish &#10; to keep the matter as simple as possible.&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>00. Links</title><link>https://technick.net/guides/electronics/bpw/00_links/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/00_links/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;Links&lt;/h3&gt;&lt;p&gt; &lt;!-- #EndEditable --&gt; &lt;td width="100%" valign="top"&gt; &lt;!-- #BeginEditable "maintextarea" --&gt; &#10; &lt;table width="100%" border="0" cellspacing="0" cellpadding="15"&gt; &lt;tr&gt; &#10; &lt;td&gt; &#10; &lt;h4&gt;General Links &lt;/h4&gt; &lt;ul&gt; &lt;li&gt;Elsevier &#10; Science, Journal of Power Sources&lt;/li&gt; &lt;li&gt;Energizer &#10; Battery Home Page&lt;/li&gt; &lt;li&gt;Electrochemistry &#10; Refresher&lt;/li&gt; &lt;li&gt;Online &#10; battery simulator&lt;/li&gt; &lt;li&gt;Canadian &#10; power technologies VRLA information&lt;/li&gt; &lt;li&gt;ThermoAnalystics &#10; Inc.&lt;/li&gt; &lt;li&gt;Battery &#10; Review &lt;/li&gt; &lt;li&gt;Huret Associates, Inc.&lt;/li&gt; &lt;/ul&gt; &lt;h4&gt;Manufacturers&lt;/h4&gt; &lt;ul&gt; &lt;li&gt;&lt;a href="http://www.cadex.com" target="_blank" class="table-larger"&gt;www.cadex.com&lt;/a&gt;&lt;/li&gt; &lt;li&gt;www.polystor.com/technology.php&lt;/li&gt; &lt;li&gt;&lt;a href="http://www.molienergy.com/products.html" target="_blank"&gt;www.molienergy.com/products.php&lt;/a&gt;&lt;/li&gt; &lt;li&gt;&lt;a href="http://www.sanyobatteries.net/NEWprodsIND.html" target="_blank"&gt;www.sanyobatteries.net/NEWprodsIND.html&lt;/a&gt;&lt;/li&gt; &lt;/ul&gt; &lt;/td&gt; &lt;/tr&gt; &lt;/table&gt;&lt;/td&gt;&lt;/p&gt;&lt;/blockquote&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;/font&gt;&lt;/p&gt;</description></item><item><title>00. Order Batteries in a Portable World</title><link>https://technick.net/guides/electronics/bpw/00_orderbook/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/00_orderbook/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;Order Batteries in a Portable World&lt;/h3&gt;&lt;p&gt; &lt;h1&gt;&lt;font face="Arial, Helvetica, sans-serif"&gt;&lt;img src="https://technick.net/img/guide_bpw2/book-cover.jpg" width="200" height="188" align="right" vspace="5" hspace="5" border="0" alt="" /&gt;&lt;/font&gt;&lt;/h1&gt; &lt;/p&gt;&lt;p&gt;A paperback book of Batteries in a Portable World can be &#10; purchased on this site.&lt;/p&gt; &lt;p&gt;The 300-page book is easy and entertaining to read; it makes &#10; minimal use of technical jargon. &lt;/p&gt; &lt;p&gt;The well-organized layout helps you find information quickly. &#10; The book is&lt;br /&gt; especially helpful to the busy professional who needs a crash &#10; course in&lt;br /&gt; understanding this marvelous power source, the battery.&lt;/p&gt; &lt;p&gt;You can order the book in 3 ways:&lt;/p&gt; &lt;ol&gt; &lt;li&gt;&lt;a href="http://www.buchmann.ca/orderform-print.asp" target="_blank"&gt;Print the order form&lt;/a&gt; &#10; and mail or fax it to us. If faxed, payment must be made &#10; by credit card. If mailed, you can alternatively pay by &#10; check.&lt;/li&gt; &lt;li&gt; Coming soon: Fill out and send our secure on-line order &#10; form. Payment by credit card is required.&lt;/li&gt; &lt;li&gt;Order by phone: 604-231-7777&lt;/li&gt; &lt;/ol&gt;&lt;/blockquote&gt;</description></item><item><title>00. Part Four – Beyond Batteries</title><link>https://technick.net/guides/electronics/bpw/00_part4/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/00_part4/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c17_06"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c18_01"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;Part Four – Beyond Batteries&lt;/h3&gt;&lt;p&gt;&lt;blockquote&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c18_01"&gt;Chapter 18: Beginnings and Horizons&lt;/a&gt;&lt;/b&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c18_01"&gt;18.1 About the Author&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c18_02"&gt;18.2 About Cadex&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c18_03"&gt;18.3 Working with Natural Beauty&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c18_03"&gt;18.4 Customer Comments&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c18_04"&gt;18.5 Cadex Products&lt;/a&gt;&lt;br /&gt;&lt;/blockquote&gt;&lt;/p&gt;&lt;/blockquote&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c17_06"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c18_01"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;</description></item><item><title>00. Part One - Battery Basics Everyone Should Know</title><link>https://technick.net/guides/electronics/bpw/00_part1/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/00_part1/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_authorsnote"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;Part One - Battery Basics Everyone Should Know&lt;/h3&gt;&lt;p&gt;&lt;blockquote&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/electronics/bpw/00_authorsnote"&gt;Author's Note&lt;/a&gt;&lt;/b&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/electronics/bpw/00_intro"&gt;Introduction&lt;/a&gt;&lt;/b&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c01_01"&gt;Chapter 1: When was the battery invented?&lt;/a&gt;&lt;/b&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c02_01"&gt;Chapter 2: Battery Chemistries&lt;/a&gt;&lt;/b&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c02_02"&gt;2.1 Chemistry Comparison&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c02_03"&gt;2.2 The Nickel Cadmium (NiCd) Battery&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c02_04"&gt;2.3 The Nickel-Metal Hydride (NiMH) Battery&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c02_05"&gt;2.4 The Lead Acid Battery&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c02_06"&gt;2.5 The Lithium Ion Battery&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c02_08"&gt;2.6 The Lithium Polymer Battery&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c02_09"&gt;2.7 Reusable Alkaline Batteries&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c02_09"&gt;2.8 The Supercapacitor&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c03_01"&gt;Chapter 3: The Battery Pack&lt;/a&gt;&lt;/b&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c03_01"&gt;3.1 The Cylindrical Cell&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c03_02"&gt;3.2 The Button Cell&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c03_02"&gt;3.3 The prismatic Cell&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c03_03"&gt;3.4 The Pouch Cell&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c03_04"&gt;3.5 Series and Parallel Configurations&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c03_05"&gt;3.6 Protection Circuits&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c04_01"&gt;Chapter 4: Proper Charge Methods&lt;/a&gt;&lt;/b&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c04_01"&gt;4.1 All About Chargers&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c04_03"&gt;4.2 Charging the Nickel Cadmium Battery&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c04_05"&gt;4.3 Charging the Nickel-Metal Hydride Battery&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c04_06"&gt;4.4 Charging the Lead Acid Battery&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c04_08"&gt;4.5 Charging the Lithium Ion Battery&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c04_09"&gt;4.6 Charging the Lithium Polymer Battery&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c04_09"&gt;4.7 Charging at High and Low Temperatures&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c04_10"&gt;4.8 Ultra-fast Chargers&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c04_10"&gt;4.9 Charge IC Chips&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c05_01"&gt;Chapter 5: Discharge Methods&lt;/a&gt;&lt;/b&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c05_01"&gt;5.1 C-rate&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c05_02"&gt;5.2 Depth of Discharge&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c05_05"&gt;5.3 Pulse Discharge&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c05_06"&gt;5.4 Discharging at High and Low Temperature&lt;/a&gt;&lt;br /&gt;&lt;/blockquote&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>00. Part Three – Knowing Your Battery</title><link>https://technick.net/guides/electronics/bpw/00_part3/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/00_part3/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c13_05"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c14_01"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;Part Three – Knowing Your Battery&lt;/h3&gt;&lt;p&gt;&lt;blockquote&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c14_01"&gt;Chapter 14: Non-Correctable Battery Problems&lt;/a&gt;&lt;/b&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c14_02"&gt;14.1 High Self-discharge&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c14_02"&gt;14.2 Low Capacity Cells&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c14_03"&gt;14.3 Cell Mismatch&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c14_03"&gt;14.4 Shorted Cells Loss of Electrolyte&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c15_01"&gt;Chapter 15: Caring for Your Batteries from Birth to Retirement&lt;/a&gt;&lt;/b&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c15_02"&gt;15.1 Storage&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c15_03"&gt;15.2 Priming&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c15_04"&gt;15.3 The Million Dollar Battery Problem&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c15_05"&gt;15.4 To the Service Counter, and No Further&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c15_06"&gt;15.5 The Quick Fix&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c15_07"&gt;15.6 Battery Warranty&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c15_08"&gt;15.7 Battery Recycling&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c16_01"&gt;Chapter 16: Practical Battery Tips&lt;/a&gt;&lt;/b&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c16_01"&gt;16.1 Personal Field Observations&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c16_02"&gt;16.2 The Correct Battery for the Job&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c16_03"&gt;16.3 Battery Analyzers for Critical Missions&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c17_01"&gt;Chapter 17: Did you know . . . ?&lt;/a&gt;&lt;/b&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c17_02"&gt;17.1 The Cost of Mobile Power&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c17_03"&gt;17.2 The Fuel Cell&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c17_06"&gt;17.3 The Electric Vehicle&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c17_06"&gt;17.4 Strengthening the Weakest Link&lt;/a&gt;&lt;br /&gt;&lt;/blockquote&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>00. Part Two – You and the Battery</title><link>https://technick.net/guides/electronics/bpw/00_part2/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/00_part2/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c05_06"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c06_01"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;Part Two – You and the Battery&lt;/h3&gt;&lt;p&gt;&lt;blockquote&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c06_01"&gt;Chapter 6: The Secrets of Battery Runtime&lt;/a&gt;&lt;/b&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c06_01"&gt;6.1 Declining Capacity&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c06_03"&gt;6.2 Increasing Internal Resistance&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c06_04"&gt;6.3 Elevated Self-Discharge&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c06_04"&gt;6.4 Premature Voltage Cut-off&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c07_01"&gt;Chapter 7: The ‘Smart’ Battery&lt;/a&gt;&lt;/b&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c07_01"&gt;7.1 The Single Wire Bus&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c07_02"&gt;7.2 The SMBus&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c07_05"&gt;7.3 The State-of-Charge Indicator&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c07_05"&gt;7.4 The Tri-State Fuel Gauge&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c07_06"&gt;7.5 The Target Capacity Selector&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c07_07"&gt;7.6 Fuel Gauges for Large Batteries&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c08_01"&gt;Chapter 8: Choosing the Right Battery&lt;/a&gt;&lt;/b&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c08_01"&gt;8.1 What’s the best battery for mobile phones?&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c08_02"&gt;8.2 What’s the best battery for two-way radios?&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c08_02"&gt;8.3 What’s the best battery forlaptops?&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c08_03"&gt;8.4 Selecting a Lasting Battery&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c09_01"&gt;Chapter 9: Internal Battery Resistance&lt;/a&gt;&lt;/b&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c09_01"&gt;9.1 Why do seemingly good batteries fail on digital equipment?&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c09_02"&gt;9.2 How is the internal battery resistance measured?&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c09_03"&gt;9.3 What’s the difference between internal resistance and impedance?&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c10_01"&gt;Chapter 10: Getting the Most from your Batteries&lt;/a&gt;&lt;/b&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c10_01"&gt;10.1 Memory: myth or fact?&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c10_02"&gt;10.2 How to Restore and Prolong Nickel-based Batteries&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c10_04"&gt;10.3 The Effect of Zapping&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c10_05"&gt;10.4 How to Restore and Prolong Sealed Lead Acid Batteries&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c10_06"&gt;10.5 How to Prolong Lithium-based Batteries&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c10_07"&gt;10.6 Battery Recovery Rate&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c11_01"&gt;Chapter 11: Maintaining Fleet Batteries&lt;/a&gt;&lt;/b&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c11_02"&gt;11.1 The ‘Green Light’ Lies&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c11_03"&gt;11.2 Battery Maintenance, a Function of Quality Control&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c11_03"&gt;11.3 Battery Maintenance Made Simple&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c11_03"&gt;11.4 Battery Maintenance as a Business&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c12_01"&gt;Chapter 12: Battery Maintenance Equipment&lt;/a&gt;&lt;/b&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c12_01"&gt;12.1 Conditioning Chargers&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c12_02"&gt;12.2 Battery Analyzers&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c12_04"&gt;12.3 Battery Analyzers for Maintenance-Free Batteries&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c12_04"&gt;12.4 Battery throughput&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c12_05"&gt;12.5 Battery Maintenance Software&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c13_01"&gt;Chapter 13: Making Battery Quick-Test Feasible&lt;/a&gt;&lt;/b&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c13_01"&gt;13.1 Battery Specific Quick Testing&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c13_02"&gt;13.2 Three-Point Quick Test&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c13_03"&gt;13.3 The Evolving Battery&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c13_03"&gt;13.4 The Cadex Quicktest Method&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c13_04"&gt;13.5 How does the Cadex Quicktest work?&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c13_04"&gt;13.6 Battery Testing and the Internet&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c13_05"&gt;13.7 Electrochemical Impedance Spectroscopy&lt;/a&gt;&lt;br /&gt;&lt;/blockquote&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>00. Table Of Content</title><link>https://technick.net/guides/theory/dar/000/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dar/000/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/resample/"&gt;The Digital Audio Resampling Home Page&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, Copyright &amp;#169; &lt;i&gt;2016-05-17&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dar/001"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p align="center"&gt;&lt;img width="211" height="80" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img3.gif" alt="\" esizebox="" n="" ncludegraphics="" ps="" incsum="" ps="" /&gt;&lt;/p&gt; &lt;h3&gt;Table Of Content&lt;/h3&gt;&lt;p&gt;&lt;!--Table of Child-Links--&gt;&lt;a name="CHILD_LINKS"&gt;&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html24" href="https://technick.net/guides/theory/dar/001"&gt;What is Bandlimited Interpolation?&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html25" href="https://technick.net/guides/theory/dar/002"&gt;Available Software&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html26" href="https://technick.net/guides/theory/dar/003"&gt;Theory of Operation&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html27" href="https://technick.net/guides/theory/dar/004"&gt;Abstract&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html28" href="https://technick.net/guides/theory/dar/005"&gt;Introduction&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html29" href="https://technick.net/guides/theory/dar/006"&gt;Theory of Ideal Bandlimited Interpolation&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html30" href="https://technick.net/guides/theory/dar/007"&gt;From Theory to Practice&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html31" href="https://technick.net/guides/theory/dar/008"&gt;Implementation&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html32" href="https://technick.net/guides/theory/dar/009"&gt;Quantization Issues&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html33" href="https://technick.net/guides/theory/dar/010"&gt;Choice of Table Size&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html34" href="https://technick.net/guides/theory/dar/011"&gt;Choice of Interpolation Resolution&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html35" href="https://technick.net/guides/theory/dar/012"&gt;Conclusions&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html36" href="https://technick.net/guides/theory/dar/013"&gt;Appendix A: Exact Sinc-Interpolation of Sampled Periodic Signals&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html37" href="https://technick.net/guides/theory/dar/014"&gt;Appendix B: Relation between Sinc and Lagrange Interpolation&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html38" href="https://technick.net/guides/theory/dar/015"&gt;Bibliography&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html39" href="https://technick.net/guides/theory/dar/016"&gt;About this document ...&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;!--End of Table of Child-Links--&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>00. Table Of Content</title><link>https://technick.net/guides/theory/edft/000/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/edft/000/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/filters/"&gt;Introduction to Digital Filters with Audio Applications&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, Copyright &amp;#169; &lt;i&gt;2017-11-26&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/edft/022"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/001"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;Table Of Content&lt;/h3&gt;&lt;!--Table of Child-Links--&gt;&lt;a name="CHILD_LINKS"&gt;&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html14" href="https://technick.net/guides/theory/edft/001"&gt;Positive Real Functions&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html15" href="https://technick.net/guides/theory/edft/002"&gt;Relation to Stochastic Processes&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html16" href="https://technick.net/guides/theory/edft/003"&gt;Relation to Schur Functions&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html17" href="https://technick.net/guides/theory/edft/004"&gt;Relation to functions positive real in the right-half plane&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html18" href="https://technick.net/guides/theory/edft/005"&gt;Special cases and examples&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html19" href="https://technick.net/guides/theory/edft/006"&gt;Minimum Phase (MP) polynomials in &lt;img width="14" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img1.gif" alt="$z$" /&gt;&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html20" href="https://technick.net/guides/theory/edft/007"&gt;Conjectured Properties&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html21" href="https://technick.net/guides/theory/edft/008"&gt;Introduction to Digital Filter Theory&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html22" href="https://technick.net/guides/theory/edft/009"&gt;Linearity and Time-Invariance&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html23" href="https://technick.net/guides/theory/edft/010"&gt;Difference Equation&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html24" href="https://technick.net/guides/theory/edft/011"&gt;Convolution Representation&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html25" href="https://technick.net/guides/theory/edft/012"&gt;Frequency Response&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html26" href="https://technick.net/guides/theory/edft/013"&gt;Phase Delay and Group Delay&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html27" href="https://technick.net/guides/theory/edft/014"&gt;Vector Space Concepts&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html28" href="https://technick.net/guides/theory/edft/015"&gt;Specific Norms&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html29" href="https://technick.net/guides/theory/edft/016"&gt;Concavity (Convexity)&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html30" href="https://technick.net/guides/theory/edft/017"&gt;Concave Norms&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html31" href="https://technick.net/guides/theory/edft/018"&gt;Gradient Descent&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html32" href="https://technick.net/guides/theory/edft/019"&gt;Taylor's Theorem&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html33" href="https://technick.net/guides/theory/edft/020"&gt;Newton's Method&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html34" href="https://technick.net/guides/theory/edft/021"&gt;Maxims of Signal Processing&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html35" href="https://technick.net/guides/theory/edft/022"&gt;Index&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html36" href="https://technick.net/guides/theory/edft/023"&gt;Bibliography&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html37" href="https://technick.net/guides/theory/edft/024"&gt;About this document ...&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;!--End of Table of Child-Links--&gt;&lt;/blockquote&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/edft/022"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/001"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;</description></item><item><title>00. TOC</title><link>https://technick.net/guides/electronics/bpw/00_toc/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/00_toc/</guid><description>&lt;table border="0" cellspacing="4" cellpadding="4"&gt;&lt;tr valign="top"&gt;&lt;td&gt;&lt;img src="https://technick.net/img/guide_bpw2/ad1.gif" width="115" height="115" border="0" alt="" /&gt;&lt;/td&gt;&lt;td&gt;&lt;b&gt;&lt;a href="#TOC"&gt;Table&amp;nbsp;of&amp;nbsp;Contents&lt;/a&gt;&lt;/b&gt;&lt;br /&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/electronics/bpw/00_faq"&gt;Battery FAQ&lt;/a&gt;&lt;/b&gt;&lt;br /&gt;&lt;b&gt;&lt;a href="http://www.buchmann.ca/newarticles.asp" target="_blank"&gt;New Articles&lt;/a&gt;&lt;/b&gt;&lt;br /&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/electronics/bpw/00_aboutauthor"&gt;About&amp;nbsp;the&amp;nbsp;Author&lt;/a&gt;&lt;/b&gt;&lt;br /&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/electronics/bpw/00_orderbook"&gt;Order Book&lt;/a&gt;&lt;/b&gt;&lt;br /&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/electronics/bpw/00_links"&gt;Links&lt;/a&gt;&lt;/b&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/electronics/bpw/00_part1"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/td&gt;&lt;td&gt;The battery has become our steady travel companion - it helps call a friend; it expands our workplace beyond four walls; and it supports critical missions for people in need.&lt;br /&gt;&lt;br /&gt;Performance specifications for batteries and chargers are often based on ideal conditions.&lt;br /&gt;&lt;br /&gt;Manufacturers carry out battery tests on brand new equipment within protected environments. In Batteries in a Portable World, Mr. Buchmann observes the battery as used by consumers in everyday life.&lt;br /&gt;&lt;br /&gt;The battery handbook addresses the strengths and limitations of the modern battery. It illustrates which battery chemistry is most appropriate for each application. You will learn about charger technology, battery maintenance to prolong battery life and methods to restore weak batteries with a battery analyzer. &lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;br /&gt;&lt;br /&gt;&lt;blockquote&gt;&lt;p&gt;&lt;a name="TOC"&gt;&lt;/a&gt;&lt;h3&gt;Table of Contents&lt;/h3&gt;&lt;/p&gt;</description></item><item><title>01. Positive Real Functions</title><link>https://technick.net/guides/theory/edft/001/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/edft/001/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/filters/"&gt;Introduction to Digital Filters with Audio Applications&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, Copyright &amp;#169; &lt;i&gt;2017-11-26&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/edft/000"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/000"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/022"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/002"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;Positive Real Functions&lt;/h3&gt;&lt;p&gt;Any passive driving-point &lt;a href="https://ccrma.stanford.edu/~jos//book2000/Impedance.html" target="_blank"&gt;impedance&lt;/a&gt;, such as the impedance of a violin&#10;bridge, is &lt;a href="https://technick.net/guides/theory/edft/001"&gt;positive real&lt;/a&gt;. &lt;a href="https://technick.net/guides/theory/edft/001"&gt;Positive real functions&lt;/a&gt; have been studied&#10;extensively in the continuous-time case in the context of&lt;i&gt;network synthesis&lt;/i&gt; [&lt;a href="https://technick.net/guides/theory/edft/023#Brune"&gt;Brune&amp;nbsp;1931&lt;/a&gt;,&lt;a href="https://technick.net/guides/theory/edft/023#VV"&gt;Van Valkenburg&amp;nbsp;1960&lt;/a&gt;]. Very little, however, seems&#10;to be available in the discrete time case. The purpose of this&#10;home page is to collect some facts about positive real transfer&#10;functions for discrete-time linear systems.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;A complex valued function of a complex variable &lt;img width="40" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img2.gif" alt="$f(z)$" /&gt; is said to be&lt;i&gt;positive real&lt;/i&gt;&lt;a name="2116"&gt;&lt;/a&gt; (PR) if&lt;ol&gt;&lt;li&gt;&lt;!-- MATH&#10; $z\ real\,\Rightarrow f(z)\ real$&#10; --&gt;&lt;img width="162" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img3.gif" alt="$z real \" ightarrow="" real="" /&gt;&lt;/li&gt;&lt;li&gt;&lt;!-- MATH&#10; $\left|z\right|\geq 1\Rightarrow \mbox{re}\left\{f(z)\right\}\geq 0$&#10; --&gt;&lt;img width="196" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img4.gif" alt="$\" eft\vert="" ight\vert\geq="" ightarrow="" box="" e="" eft\="" z="" ight\="" eq="" /&gt;&lt;a name="def:PR"&gt;&lt;/a&gt;&lt;/li&gt;&lt;/ol&gt;&lt;/p&gt;&lt;p&gt;We now specialize to the subset of functions &lt;img width="40" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img2.gif" alt="$f(z)$" /&gt; representable as a&#10;ratio of finite-order polynomials in &lt;img width="14" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img1.gif" alt="$z$" /&gt;. This class of ``rational''&#10;functions is the set of all transfer functions of finite-order&#10;time-invariant linear systems, and we write &lt;img width="46" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img5.gif" alt="$H(z)$" /&gt; to denote a member&#10;of this class. We use the convention that &lt;a href="https://technick.net/guides/theory/edft/010#2327"&gt;stable&lt;/a&gt;, minimum phase&#10;systems are analytic and nonzero in the strict outer&#10;disk.&lt;a name="tex2html6" href="https://technick.net/guides/theory/edft/025#foot5368"&gt;&lt;sup&gt;1&lt;/sup&gt;&lt;/a&gt;*The strict &lt;i&gt;outer disk&lt;/i&gt;&lt;a name="2121"&gt;&lt;/a&gt; is defined as the region&#10;&lt;!-- MATH&#10; $\left|z\right|&gt;1$&#10; --&gt;&lt;img width="59" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img6.gif" alt="$\" eft\vert="" ight\vert="" t="" /&gt; in the extended &lt;a href="http://mathworld.wolfram.com/ComplexPlane.html" target="_blank"&gt;complex plane&lt;/a&gt;. Condition (1) implies that&#10;for &lt;img width="46" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img5.gif" alt="$H(z)$" /&gt; to be PR, the polynomial coefficients must be real, and&#10;therefore complex poles and zeros must exist in conjugate pairs. We&#10;assume from this point on that &lt;img width="80" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img7.gif" alt="$H(z)\" eq="" /&gt; satisfies (1). From (2) we&#10;derive the facts below.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Theorem. &lt;a name="thm:Tang"&gt;&lt;/a&gt;&lt;/b&gt; A real rational function &lt;img width="46" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img5.gif" alt="$H(z)$" /&gt; is PR iff &lt;!-- MATH&#10; $\left|z\right|\geq 1 \Rightarrow \left|\angle{H(z)}\right|\leq \frac{\pi}{2}$&#10; --&gt;&lt;img width="189" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img8.gif" alt="$\" eft\vert="" ight\vert\geq="" ightarrow="" eft\vert\angle="" z="" ight\vert\leq="" rac="" i="" /&gt;.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Proof. &lt;/b&gt;Expressing &lt;img width="46" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img5.gif" alt="$H(z)$" /&gt; in polar form gives&lt;br /&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray}&#10;\mbox{re}\left\{H(z)\right\}&#10;&#9;&amp;=&amp;Re\{\left|H(z)\right|e^{j\angle{H(z)}}\} &#10;&#9;&#9;= \left|H(z)\right|\cos(\angle{H(z)}) \\&#10;&#9; &amp;\geq 0, \quad \forall \quad \left|\angle{H(z)}\right|\leq &#10;&#9; \frac{\pi}{2},&#10;\end{eqnarray}&#10; --&gt;&lt;table align="CENTER" cellpadding="0" width="100%"&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&lt;img width="91" height="41" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img9.gif" alt="$\" isplaystyle="" box="" e="" eft\="" z="" ight\="" /&gt;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="21" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img10.gif" alt="$\" extstyle="$" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="363" height="53" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img11.gif" alt="$\" isplaystyle="" left\vert="" right\vert="" angle="" z="" eft\vert="" right\vert\cos="" ngle="" z="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(1)&lt;/td&gt;&lt;/tr&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&amp;nbsp;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="219" height="41" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img12.gif" alt="$\" extstyle="" eq="" uad="" orall="" uad="" eft\vert\angle="" z="" ight\vert\leq="" rac="" i="" /&gt;&lt;/td&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(2)&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;since the zeros of &lt;img width="46" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img5.gif" alt="$H(z)$" /&gt; are isolated.&lt;img width="19" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img13.gif" alt="$\" ox="" /&gt;&lt;p&gt;&lt;b&gt;Theorem. &lt;a name="thm:Tinv"&gt;&lt;/a&gt;&lt;/b&gt; &lt;img width="46" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img5.gif" alt="$H(z)$" /&gt; is PR iff &lt;img width="64" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img14.gif" alt="$1/H(z)$" /&gt; is PR.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Proof. &lt;/b&gt;Assuming &lt;img width="46" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img5.gif" alt="$H(z)$" /&gt; is PR, we have by Thm.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/edft/001#thm:Tang"&gt;1&lt;/a&gt;),&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\left|\angle{H^{-1}(z)}\right| = \left|-\angle{H(z)}\right| = \left|\angle{H(z)}\right| \leq \frac{\pi}{2},\quad \left|z\right|\geq 1.&#10;\end{displaymath}&#10; --&gt;&lt;img width="436" height="46" border="0" src="https://technick.net/img/guide_edft/guide_edft_img15.gif" alt="\" egin="" isplaymath="" eft\vert\angle="" z="" ight\vert="\left\vert-\angle{H..." t\vert="" eq="" rac="" i="" uad="" eft\vert="" ight\vert\geq="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;img width="19" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img13.gif" alt="$\" ox="" /&gt;&lt;p&gt;&lt;b&gt;Theorem. &lt;a name="thm:Tanal"&gt;&lt;/a&gt;&lt;/b&gt; A PR function &lt;img width="46" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img5.gif" alt="$H(z)$" /&gt; is analytic and nonzero in the strict outer disk.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Proof. &lt;/b&gt;(By contradiction)&lt;/p&gt;&lt;p&gt;Without loss of generality, we treat only &lt;img width="29" height="20" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img16.gif" alt="$n^{th}$" /&gt; order polynomials &lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\alpha_0z^n + \alpha_1z^{n-1} + \cdots + \alpha_{n-1}z + \alpha_n&#10;\end{displaymath}&#10; --&gt;&lt;img width="304" height="36" border="0" src="https://technick.net/img/guide_edft/guide_edft_img17.gif" alt="\" egin="" isplaymath="" lpha="" n="" lpha="" n-1="" dots="" lpha="" z="" lpha="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;which are nondegenerate in the sense that&#10;&lt;!-- MATH&#10; $\alpha_0,\alpha_n\neq 0$&#10; --&gt;&lt;img width="88" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img18.gif" alt="$\" lpha="" lpha="" neq="" /&gt;. Since facts about &lt;img width="65" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img19.gif" alt="$\" lpha="" z="" /&gt; are readily&#10;deduced from facts about &lt;img width="46" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img5.gif" alt="$H(z)$" /&gt;, we set &lt;img width="59" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img20.gif" alt="$\" lpha="" /&gt; at no great loss.&lt;p&gt;&lt;/p&gt;&lt;p&gt;The general (normalized) &lt;a href="https://technick.net/guides/theory/edft/010"&gt;causal&lt;/a&gt;, finite-order, linear,&#10;time-invariant transfer function may be written&lt;br /&gt;&lt;div align="CENTER"&gt;&lt;a name="eq:Hrep"&gt;&lt;/a&gt;&lt;!-- MATH&#10; \begin{eqnarray}&#10;H(z)&amp;=&amp;z^{-\nu}\frac{b(z)}{a(z)}\\&#10; &amp;=&amp;z^{-\nu}\frac{1 + b_1 z^{-1} + \cdots + b_M z^{-M} }{&#10; 1 + a_1 z^{-1} + \cdots + a_N z^{-N} }\\&#10; &amp;=&amp;z^{-\nu}\frac{ \prod_{i=1}^M (1 - q_i z^{-1}) }{&#10; \prod_{i=1}^N (1 - p_i z^{-1}) }\\&#10; &amp;=&amp;z^{-\nu}\sum_{i=1}^{N_d} \sum_{j=1}^{\mu_i} \frac{z\,K_{i,j} }{ (z-p_i)^j}&#10;&#9;, \qquad \nu\geq 0,&#10;\end{eqnarray}&#10; --&gt;&lt;table align="CENTER" cellpadding="0" width="100%"&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&lt;img width="51" height="41" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img21.gif" alt="$\" isplaystyle="" /&gt;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="21" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img10.gif" alt="$\" extstyle="$" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="78" height="69" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img22.gif" alt="$\" isplaystyle="" u="" rac="" b="" a="a" z="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(3)&lt;/td&gt;&lt;/tr&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&amp;nbsp;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="21" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img10.gif" alt="$\" extstyle="$" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="264" height="72" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img23.gif" alt="$\" isplaystyle="" u="" rac="" b="" cdots="" b="" m="" a="" cdots="" a="" n="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(4)&lt;/td&gt;&lt;/tr&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&amp;nbsp;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="21" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img10.gif" alt="$\" extstyle="$" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="181" height="74" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img24.gif" alt="$\" isplaystyle="" u="" rac="" rod="" m="" q="" i="" rod="" n="" p="" i="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(5)&lt;/td&gt;&lt;/tr&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&amp;nbsp;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="21" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img10.gif" alt="$\" extstyle="$" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="285" height="79" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img25.gif" alt="$\" isplaystyle="" u="" um="" n="" d="" sum="" mu="" i="" frac="" i="i" j="" p="" i="" qquad="" u\geq="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(6)&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;where &lt;img width="27" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img26.gif" alt="$N_d$" /&gt; is the number of distinct poles, each of multiplicity &lt;img width="21" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img27.gif" alt="$\" u="u" i="i" /&gt;,and &lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\sum_{i=1}^{N_d}\mu_i = \max\{N,M\}.&#10;\end{displaymath}&#10; --&gt;&lt;img width="187" height="65" border="0" src="https://technick.net/img/guide_edft/guide_edft_img28.gif" alt="\" egin="" isplaymath="" um="" n="" d="" mu="" i="" ax\="" m\="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;Suppose there is a pole of multiplicity &lt;img width="21" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img29.gif" alt="$m$" /&gt; outside the unit circle.&#10;Without loss of generality, we may set &lt;img width="65" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img30.gif" alt="$\" u="u" m="" /&gt;, and &lt;!-- MATH&#10; $p_1 = R\,e^{j\phi}$&#10; --&gt;&lt;img width="88" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img31.gif" alt="$p_1 = R e^{j\" hi="" /&gt;with &lt;img width="54" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img32.gif" alt="$R&amp;gt;1$" /&gt;. Then for &lt;img width="14" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img1.gif" alt="$z$" /&gt; near &lt;img width="22" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img33.gif" alt="$p_1$" /&gt;, we have&lt;br /&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray}&#10;z^\nu H(z) &amp;=&amp;\frac{ z\,K_{1,m} }{ (z-R\,e^{j\phi})^m} + &#10;&#9;\frac{ z\,K_{1,m-1} }{ (z-R\,e^{j\phi})^{m-1}} + \cdots\\&#10; &amp; \approx \frac{z\, K_{1,m} }{ (z-R\,e^{j\phi})^m}.&#10;\end{eqnarray}&#10; --&gt;&lt;table align="CENTER" cellpadding="0" width="100%"&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&lt;img width="70" height="41" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img34.gif" alt="$\" isplaystyle="" u="" /&gt;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="21" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img10.gif" alt="$\" extstyle="$" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="332" height="66" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img35.gif" alt="$\" isplaystyle="" rac="" m="" r="" phi="" frac="" m-1="" r="" phi="" cdots="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(7)&lt;/td&gt;&lt;/tr&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&amp;nbsp;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="116" height="49" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img36.gif" alt="$\" extstyle="" pprox="" rac="" m="" r="" phi="" /&gt;&lt;/td&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(8)&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;Consider the circular neighborhood of radius &lt;img width="14" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img37.gif" alt="$\" ho="" /&gt; described by&#10;&lt;!-- MATH&#10; $z=R\,e^{j\phi}+ \rho\,e^{j\psi},\;-\pi\leq \psi&lt;\pi$&#10; --&gt;&lt;img width="256" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img38.gif" alt="$z=R e^{j\" hi="" ho="" psi="" i\leq="" si="" t="" i="" /&gt;. Since &lt;img width="54" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img32.gif" alt="$R&amp;gt;1$" /&gt; we may&#10;choose &lt;img width="87" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img39.gif" alt="$\" ho="" t="" /&gt; so that all points &lt;img width="14" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img1.gif" alt="$z$" /&gt; in this neighborhood lie&#10;outside the unit circle. If we write the residue of the factor&#10;&lt;!-- MATH&#10; $(z-R\,e^{j\phi})^m$&#10; --&gt;&lt;img width="106" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img40.gif" alt="$(z-R e^{j\" hi="" /&gt; in polar form as &lt;!-- MATH&#10; $K_{1,m}=C\,e^{j\xi}$&#10; --&gt;&lt;img width="109" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img41.gif" alt="$K_{1,m}=C e^{j\" i="i" /&gt;, then we have,&#10;for sufficiently small &lt;img width="14" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img37.gif" alt="$\" ho="" /&gt;,&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;z^\nu H(z) \approx \frac{K_{1,m}R\,e^{j\phi}}{ (z-R\,e^{j\phi})^m}&#10;= \frac{K_{1,m}R\,e^{j\phi}}{ \rho^m\,e^{jm\psi}}&#10;= \frac{C\,R}{ \rho^m}\, e^{j(\phi + \xi - m\psi)}.&#10;\end{displaymath}&#10; --&gt;&lt;a name="eq:ODlim"&gt;&lt;/a&gt;&lt;a name="eq:ODlim"&gt;&lt;/a&gt;&lt;img width="497" height="59" border="0" src="https://technick.net/img/guide_edft/guide_edft_img42.gif" alt="\" egin="" isplaymath="" nu="" approx="" rac="" m="" j\phi="" r="" ph="" m\psi="" rac="" rho="" e="" phi="" i="" psi="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Therefore, approaching the pole &lt;img width="46" height="20" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img43.gif" alt="$R e^{j\" hi="" /&gt; at an angle &lt;img width="18" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img44.gif" alt="$\" si="" /&gt; gives&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\lim_{\rho\to 0}\left|\angle{H(R\,e^{j\phi}+\rho\,e^{j\psi})}\right| = \left|\phi(1-\nu) + \xi - m\psi \right|,&#10;&#9;\qquad -\pi \leq \psi &lt;\pi&#10;\end{displaymath}&#10; --&gt;&lt;img width="579" height="48" border="0" src="https://technick.net/img/guide_edft/guide_edft_img45.gif" alt="\" egin="" isplaymath="" im="" ho\to="" eft\vert\angle="" r="" phi="" ho="" p="" u="" i="" psi="" ight\vert="" quad="" i="" eq="" si="" t="" i="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;which cannot be confined to satisfy Thm.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/edft/001#thm:Tang"&gt;1&lt;/a&gt;) regardless of the value of&#10;the residue angle &lt;img width="14" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img46.gif" alt="$\" i="i" /&gt;, or the pole angle &lt;img width="16" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img47.gif" alt="$\" hi="" /&gt; (&lt;img width="21" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img29.gif" alt="$m$" /&gt; cannot be zero by&#10;hypothesis).&#10;We thus conclude that a PR function &lt;img width="46" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img5.gif" alt="$H(z)$" /&gt; can have no poles in the outer disk.&#10;By Thm.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/edft/001#thm:Tinv"&gt;1&lt;/a&gt;), we conclude that positive real functions must be minimum phase.&lt;img width="19" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img13.gif" alt="$\" ox="" /&gt;&lt;p&gt;&lt;b&gt;Corollary. &lt;/b&gt;In equation Eq.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/edft/001#eq:Hrep"&gt;6&lt;/a&gt;), &lt;img width="50" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img48.gif" alt="$\" u="0$" /&gt;.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Proof. &lt;/b&gt;If &lt;img width="50" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img49.gif" alt="$\" u="u" gt="" /&gt;, then there are &lt;img width="15" height="16" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img50.gif" alt="$\" u="u" /&gt; poles at &#10;infinity. As &lt;!-- MATH&#10; $\left|z\right|\to \infty$&#10; --&gt;&lt;img width="74" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img51.gif" alt="$\" eft\vert="" ight\vert\to="" nfty="" /&gt;, &#10;&lt;!-- MATH&#10; $H(z)\to z^{-\nu} \Rightarrow \left|\angle{H(z)}\right| \to &#10;\left|\nu\angle{z}\right|$&#10; --&gt;&lt;img width="266" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img52.gif" alt="$H(z)\" o="" u="" ightarrow="" eft\vert\angle="" z="" ight\vert="" o="" eft\vert\nu\angle="" right\vert="" /&gt;, we must have &lt;img width="50" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img48.gif" alt="$\" u="0$" /&gt;.&lt;img width="19" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img13.gif" alt="$\" ox="" /&gt;&lt;/p&gt;&lt;p&gt;&lt;b&gt;Corollary. &lt;/b&gt;The log-magnitude of a PR function has zero mean on the unit circle.&lt;/p&gt;&lt;p&gt;This is a general property of stable, minimum-phase transfer functions&#10;which follows immediately from the &lt;i&gt;argument principle&lt;/i&gt; [&lt;a href="https://technick.net/guides/theory/edft/023#MG"&gt;Markel and Gray&amp;nbsp;1976&lt;/a&gt;,&lt;a href="https://technick.net/guides/theory/edft/023#Nehari"&gt;Nehari&amp;nbsp;1952&lt;/a&gt;].&lt;/p&gt;&lt;p&gt;&lt;b&gt;Corollary. &lt;/b&gt;A rational PR function has an equal number of poles and zeros&#10; all of which are in the unit disk.&lt;/p&gt;&lt;p&gt;This really a convention for numbering poles and zeros. In Eq.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/edft/001#eq:Hrep"&gt;6&lt;/a&gt;),&#10; we have &lt;img width="50" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img48.gif" alt="$\" u="0$" /&gt;, and all poles and zeros inside the unit disk. Now, if&#10; &lt;img width="67" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img53.gif" alt="$M&amp;gt;N$" /&gt; then we have &lt;img width="65" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img54.gif" alt="$M-N$" /&gt; extra poles at &lt;img width="49" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img55.gif" alt="$z=0$" /&gt; induced by the numerator.&#10; If &lt;img width="67" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img56.gif" alt="$M&amp;lt;N$" /&gt;, then &lt;img width="65" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img57.gif" alt="$N-M$" /&gt; zeros at the origin appear from the denominator.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Corollary. &lt;/b&gt;Every pole on the unit circle &#10;&#9;of a positive real function must be simple with a &#10;&#9;real and positive residue.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Proof. &lt;/b&gt;We repeat the previous argument using a semicircular neighborhood of&#10;&#9;radius &lt;img width="14" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img37.gif" alt="$\" ho="" /&gt; about the point &lt;!-- MATH&#10; $p_1 = e^{j\phi}$&#10; --&gt;&lt;img width="71" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img58.gif" alt="$p_1 = e^{j\" hi="" /&gt; to obtain&#10; &lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\lim_{\rho\to 0}\left|\angle{H(e^{j\phi} + \rho e^{j\psi})}\right| &#10;&#9;= \left|\phi + \xi - m\psi \right|,\qquad &#10; \phi-\frac{\pi}{2} \leq \psi\leq \phi + \frac{\pi}{2}.&#10;\end{displaymath}&#10; --&gt;&lt;a name="eq:UClim"&gt;&lt;/a&gt;&lt;a name="eq:UClim"&gt;&lt;/a&gt;&lt;img width="564" height="48" border="0" src="https://technick.net/img/guide_edft/guide_edft_img59.gif" alt="\" egin="" isplaymath="" im="" ho\to="" eft\vert\angle="" e="" phi="" ho="" ps="" uad="" hi-\frac="" i="" eq="" si\leq="" hi="" rac="" i="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;In order to have &lt;!-- MATH&#10; $\left|\angle{H(z)}\right|\leq \pi/2$&#10; --&gt;&lt;img width="122" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img60.gif" alt="$\" eft\vert\angle="" z="" ight\vert\leq="" i="" /&gt; near this pole, &#10;&#9;it is necessary that &lt;img width="56" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img61.gif" alt="$m=1$" /&gt; and &lt;img width="48" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img62.gif" alt="$\" i="0$" /&gt;.&lt;img width="19" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img13.gif" alt="$\" ox="" /&gt;&lt;p&gt;&lt;b&gt;Corollary. &lt;/b&gt;If &lt;img width="46" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img5.gif" alt="$H(z)$" /&gt; is PR with a zero at &lt;!-- MATH&#10; $z=q_1=e^{j\phi}$&#10; --&gt;&lt;img width="104" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img63.gif" alt="$z=q_1=e^{j\" hi="" /&gt;, then&#10; &lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;H^\prime(z) \isdef \frac{H(z)}{ (1-q_1 z^{-1})}&#10;\end{displaymath}&#10; --&gt;&lt;img width="181" height="57" border="0" src="https://technick.net/img/guide_edft/guide_edft_img64.gif" alt="\" egin="" isplaymath="" prime="" isdef="" rac="" z="" q="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;must satisfy&lt;p&gt;&lt;br /&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray}&#10;H^\prime(q_1) &amp;\neq&amp; 0 \\&#10; \angle{H^\prime(q_1)}&amp;=&amp; 0 .&#10;\end{eqnarray}&#10; --&gt;&lt;table align="CENTER" cellpadding="0" width="100%"&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&lt;img width="63" height="42" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img65.gif" alt="$\" isplaystyle="" rime="" q="" /&gt;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="21" height="38" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img66.gif" alt="$\" extstyle="" eq="" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="16" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img67.gif" alt="$\" isplaystyle="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(9)&lt;/td&gt;&lt;/tr&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&lt;img width="74" height="42" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img68.gif" alt="$\" isplaystyle="" ngle="" prime="" q="" /&gt;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="21" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img10.gif" alt="$\" extstyle="$" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="21" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img69.gif" alt="$\" isplaystyle="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(10)&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;b&gt;Proof. &lt;/b&gt;We may repeat the above for &lt;img width="64" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img14.gif" alt="$1/H(z)$" /&gt;.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Theorem. &lt;/b&gt;Every PR function &lt;img width="46" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img5.gif" alt="$H(z)$" /&gt; has a causal inverse &lt;img width="14" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img1.gif" alt="$z$" /&gt;-transform &lt;img width="41" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img70.gif" alt="$h(n)$" /&gt;.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Proof. &lt;/b&gt;This follows immediately from analyticity in the outer disk &#10; [&lt;a href="https://technick.net/guides/theory/edft/023#Papoulis"&gt;Papoulis&amp;nbsp;1977&lt;/a&gt;, pp.&amp;nbsp;30-36]&#10; However, we may give a more concrete proof as follows.&#10; Suppose &lt;img width="41" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img70.gif" alt="$h(n)$" /&gt; is non-causal. Then there exists &lt;img width="50" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img71.gif" alt="$k&amp;gt;0$" /&gt; such that &lt;img width="90" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img72.gif" alt="$h(-k)\" eq="" /&gt;.&#10; We have,&#10; &lt;br /&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray}&#10;H(z)\;&amp;\isdef &amp; \sum_{n=-\infty }^\infty h(n)\,z^{-n}\\&#10;&#9;&amp;=&amp; h(-k)z^k + \sum_{n \neq -k} h(n)\,z^{-n}.&#10;\end{eqnarray}&#10; --&gt;&lt;table align="CENTER" cellpadding="0" width="100%"&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&lt;img width="56" height="41" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img73.gif" alt="$\" isplaystyle="" /&gt;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="21" height="49" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img74.gif" alt="$\" extstyle="" sdef="" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="132" height="70" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img75.gif" alt="$\" isplaystyle="" um="" infty="" nfty="" z="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(11)&lt;/td&gt;&lt;/tr&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&amp;nbsp;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="21" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img10.gif" alt="$\" extstyle="$" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="232" height="61" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img76.gif" alt="$\" isplaystyle="" z="" sum="" neq="" h="" z="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(12)&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;Hence, &lt;img width="46" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img5.gif" alt="$H(z)$" /&gt; has at least one pole at infinity and cannot be PR by Thm.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/edft/001#thm:Tanal"&gt;1&lt;/a&gt;).&#10; Note that this pole at infinity cannot be cancelled since otherwise&#10; &lt;br /&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray}&#10;&amp;&amp; h(-k)z^k = \sum_{l\neq -k}\alpha(l)\,z^{-l}\\&#10; &amp;&amp;\Rightarrow h(-k)\delta(n+k) = \sum_{m\neq -k}\alpha(m)\,\delta(m-n)\\&#10; &amp;&amp;\Rightarrow h(-k) = 0&#10;\end{eqnarray}&#10; --&gt;&lt;table align="CENTER" cellpadding="0" width="100%"&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="215" height="61" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img77.gif" alt="$\" isplaystyle="" z="" sum="" l\neq="" alpha="" z="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(13)&lt;/td&gt;&lt;/tr&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="372" height="61" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img78.gif" alt="$\" isplaystyle="" ightarrow="" delta="" k="" um="" neq="" alpha="" delta="" n="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(14)&lt;/td&gt;&lt;/tr&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="126" height="41" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img79.gif" alt="$\" isplaystyle="" ightarrow="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(15)&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;which contradicts the hypothesis that &lt;img width="41" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img70.gif" alt="$h(n)$" /&gt; is non-causal.&lt;img width="19" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img13.gif" alt="$\" ox="" /&gt;&lt;p&gt;&lt;b&gt;Theorem. &lt;/b&gt; &lt;img width="46" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img5.gif" alt="$H(z)$" /&gt; is PR iff it is analytic for &lt;!-- MATH&#10; $\left|z\right|&gt;1$&#10; --&gt;&lt;img width="59" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img6.gif" alt="$\" eft\vert="" ight\vert="" t="" /&gt;, poles on the &#10; unit circle are simple with real and positive residues, and&#10; &lt;!-- MATH&#10; $Re\{H(e^{j\theta})\}\geq 0$&#10; --&gt;&lt;img width="136" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img80.gif" alt="$Re\" h="" j\theta="" eq="" /&gt; for &lt;!-- MATH&#10; $0\leq \theta\leq \pi$&#10; --&gt;&lt;img width="85" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img81.gif" alt="$0\" eq="" heta\leq="" i="" /&gt;.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Proof. &lt;/b&gt;If &lt;img width="46" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img5.gif" alt="$H(z)$" /&gt; is positive real, the conditions stated hold by virtue &#10;of Thm.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/edft/001#thm:Tanal"&gt;1&lt;/a&gt;) and the definition of positive real.&lt;/p&gt;&lt;p&gt;To prove the converse, we first show nonnegativity on the upper&#10;semicircle implies nonnegativity over the entire circle. &#10; &lt;br /&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray}&#10;\mbox{re}\left\{H(e^{j\theta})\right\} &amp;\geq&amp; 0,&#9;\qquad 0 \leq \theta \leq \pi \\&#10; \Rightarrow \mbox{re}\left\{H(e^{-j\theta})\right\} &amp;\isdef &amp; \mbox{re}\left\{\sum_{n=-\infty }^\infty h(n)e^{jn\theta}\right\}\\&#10;&#9;&#9;&#9; &amp;=&amp;\sum_{n=-\infty }^\infty h(n)\cos(n\theta)\\&#10;&#9;&#9;&#9; &amp;=&amp;\mbox{re}\left\{H(e^{j\theta})\right\}\\&#10;&#9;&#9;&#9; &amp;\geq 0,&#9;\qquad 0 \leq \theta \leq \pi \\&#10; \Rightarrow \mbox{re}\left\{H(e^{j\theta})\right\}&amp;\geq 0,&#9;\qquad -\pi&lt;\theta\leq \pi.&#10;\end{eqnarray}&#10; --&gt;&lt;table align="CENTER" cellpadding="0" width="100%"&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&lt;img width="108" height="51" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img82.gif" alt="$\" isplaystyle="" box="" e="" eft\="" e="" theta="" ight\="" /&gt;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="22" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img83.gif" alt="$\" extstyle="" eq="" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="155" height="38" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img84.gif" alt="$\" isplaystyle="" quad="" eq="" heta="" eq="" i="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(16)&lt;/td&gt;&lt;/tr&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&lt;img width="147" height="51" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img85.gif" alt="$\" isplaystyle="" ightarrow="" box="" e="" eft\="" e="" theta="" ight\="" /&gt;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="21" height="49" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img74.gif" alt="$\" extstyle="" sdef="" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="178" height="72" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img86.gif" alt="$\" isplaystyle="" box="" e="" eft\="" um="" infty="" nfty="" e="" n\theta="" ight\="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(17)&lt;/td&gt;&lt;/tr&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&amp;nbsp;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="21" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img10.gif" alt="$\" extstyle="$" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="166" height="70" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img87.gif" alt="$\" isplaystyle="" um="" infty="" nfty="" cos="" theta="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(18)&lt;/td&gt;&lt;/tr&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&amp;nbsp;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="21" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img10.gif" alt="$\" extstyle="$" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="108" height="51" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img82.gif" alt="$\" isplaystyle="" box="" e="" eft\="" e="" theta="" ight\="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(19)&lt;/td&gt;&lt;/tr&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&amp;nbsp;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="178" height="38" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img88.gif" alt="$\" extstyle="" eq="" quad="" eq="" heta="" eq="" i="" /&gt;&lt;/td&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(20)&lt;/td&gt;&lt;/tr&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&lt;img width="135" height="51" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img89.gif" alt="$\" isplaystyle="" ightarrow="" box="" e="" eft\="" e="" theta="" ight\="" /&gt;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="202" height="38" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img90.gif" alt="$\" extstyle="" eq="" quad="" i="" t="" heta\leq="" i="" /&gt;&lt;/td&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(21)&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;Alternatively, we might simply state that&lt;img width="41" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img70.gif" alt="$h(n)$" /&gt; real &lt;!-- MATH&#10; $\Rightarrow \mbox{re}\left\{H(e^{j\theta})\right\}$&#10; --&gt;&lt;img width="122" height="46" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img91.gif" alt="$\" ightarrow="" box="" e="" eft\="" e="" theta="" ight\="" /&gt; even in &lt;img width="14" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img92.gif" alt="$\" heta="" /&gt;.&lt;p&gt;Next, since the function &lt;img width="21" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img93.gif" alt="$e^z$" /&gt; is analytic everywhere except at&lt;img width="58" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img94.gif" alt="$z=\" nfty="" /&gt;, it follows that &lt;!-- MATH&#10; $f(z)=e^{-H(z)}$&#10; --&gt;&lt;img width="115" height="41" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img95.gif" alt="$f(z)=e^{-H(z)}$" /&gt; is analytic wherever&lt;img width="46" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img5.gif" alt="$H(z)$" /&gt; is finite. There are no poles of &lt;img width="46" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img5.gif" alt="$H(z)$" /&gt; outside the unit&#10;circle due to the analyticity assumption, and poles on the unit circle&#10;have real and positive residues. Referring again to the limiting form&#10;Eq.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/edft/001#eq:ODlim"&gt;1&lt;/a&gt;) of &lt;img width="46" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img5.gif" alt="$H(z)$" /&gt; near a pole on the unit circle at &lt;img width="28" height="20" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img96.gif" alt="$e^{j\" hi="" /&gt;,&#10;we see that&#10; &lt;br /&gt;&lt;div align="CENTER"&gt;&lt;a name="eq:angle"&gt;&lt;/a&gt;&lt;!-- MATH&#10; \begin{eqnarray}&#10;H(e^{j\phi} + \rho\,e^{j\psi}) &amp;&amp; \to_{{\rho \to 0}} \frac{C}{ \rho}\, e^{j(\phi - \psi)},&#10;&#9;\qquad \phi- \frac{\pi}{2} \leq \psi\leq \phi + \frac{\pi}{2}\\&#10; &amp;\isdef &amp; \;\; \frac{C}{ \rho}\,e^{j\theta},&#10;&#9;\qquad \theta \isdef \phi - \psi,&#10;&#9;\quad - \frac{\pi}{ 2} \leq \theta \leq \frac{\pi}{ 2} \\&#10;\Rightarrow \quad f(z) &amp;&amp; \to_{{\rho \to 0}} e^{- \frac{C}{ \rho}\, e^{j\theta}} \\&#10;&#9;&amp; = &amp; e^{- \frac{C}{ \rho}\, \cos\theta} e^{-j \frac{C}{ \rho}\,\sin\theta}\\&#10;&#9;&amp;&amp; \to_{{\rho \to 0}} 0&#10;\end{eqnarray}&#10; --&gt;&lt;table align="CENTER" cellpadding="0" width="100%"&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&lt;img width="133" height="46" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img97.gif" alt="$\" isplaystyle="" j\phi="" ho="" psi="" /&gt;&lt;/td&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="377" height="66" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img98.gif" alt="$\" isplaystyle="" o="" ho="" o="" rac="" rho="" j="" hi="" si="" quad="" hi-="" rac="" i="" eq="" si\leq="" hi="" rac="" i="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(22)&lt;/td&gt;&lt;/tr&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&amp;nbsp;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="21" height="49" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img74.gif" alt="$\" extstyle="" sdef="" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="353" height="66" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img99.gif" alt="$\" isplaystyle="" rac="" rho="" j\theta="" quad="" heta="" sdef="" hi="" si="" uad="" rac="" i="" eq="" heta="" eq="" rac="" i="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(23)&lt;/td&gt;&lt;/tr&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&lt;img width="92" height="41" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img100.gif" alt="$\" isplaystyle="" ightarrow="" uad="" /&gt;&lt;/td&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="122" height="55" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img101.gif" alt="$\" isplaystyle="" o="" ho="" o="" frac="" rho="" j\theta="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(24)&lt;/td&gt;&lt;/tr&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&amp;nbsp;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="21" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img10.gif" alt="$\" extstyle="$" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="153" height="55" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img102.gif" alt="$\" isplaystyle="" rac="" rho="" os\theta="" j="" rac="" rho="" in\theta="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(25)&lt;/td&gt;&lt;/tr&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="74" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img103.gif" alt="$\" isplaystyle="" o="" ho="" o="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(26)&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;since the residue &lt;img width="20" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img104.gif" alt="$C$" /&gt; is positive, and the net angle &lt;img width="14" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img92.gif" alt="$\" heta="" /&gt; does not&#10;exceed &lt;img width="50" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img105.gif" alt="$\" m\pi="" /&gt;. From Eq.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/edft/001#eq:angle"&gt;26&lt;/a&gt;) we can state that for points&lt;img width="37" height="36" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img106.gif" alt="$z,z^\" rime="" /&gt; with modulus &lt;img width="34" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img107.gif" alt="$\" eq="" /&gt;, we have For all &lt;img width="47" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img108.gif" alt="$\" psilon="" t="" /&gt;, there&#10;exists &lt;img width="48" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img109.gif" alt="$\" elta="" t="" /&gt; such that &lt;!-- MATH&#10; $\left|z-z^\prime \right|&lt;\delta \;\Rightarrow \;&#10;\left|f(z)-f(z^\prime )\right|&lt;\epsilon$&#10; --&gt;&lt;img width="279" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img110.gif" alt="$\" eft\vert="" prime="" ight\vert="" t="" elta="" ightarrow="" eft\vert="" f="" prime="" ight\vert="" t="" psilon="" /&gt;. Thus &lt;img width="40" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img2.gif" alt="$f(z)$" /&gt; is analytic in the strict&#10;outer disk, and continuous up to the unit circle which forms its&#10;boundary. By the maximum modulus theorem [&lt;a href="https://technick.net/guides/theory/edft/023#Churchill"&gt;Churchill&amp;nbsp;1960&lt;/a&gt;],&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\sup_{\left|z\right|\geq 1} \left|f(z)\right| \isdef \sup_{\left|z\right|\geq 1} \left|e^{-H(z)}\right| = &#10;\sup_{\left|z\right|\geq 1} e^{-\mbox{re}\left\{H(z)\right\}} = \inf_{\left|z\right|\geq 1} \mbox{re}\left\{H(z)\right\}&#10;\end{displaymath}&#10; --&gt;&lt;img width="523" height="54" border="0" src="https://technick.net/img/guide_edft/guide_edft_img111.gif" alt="\" egin="" isplaymath="" up="sup" left\vert="" ight\vert\geq="" eft\vert="" right\v="" left\vert="" ight\vert\geq="" box="" e="" eft\="" z="" ight\="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;occurs on the unit circle. Consequently,&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\inf_{-\pi&lt;\theta\leq \pi}\mbox{re}\left\{H(e^{j\theta})\right\}\geq 0&#10;\quad\Rightarrow \quad\inf_{\left|z\right|\geq 1}\mbox{re}\left\{H(z)\right\}\geq 0&#10;\quad\Rightarrow \quad H(z)\;PR\,.&#10;\end{displaymath}&#10; --&gt;&lt;img width="606" height="50" border="0" src="https://technick.net/img/guide_edft/guide_edft_img112.gif" alt="\" egin="" isplaymath="" nf="" i="" t="" heta\leq="" i="" box="" e="" eft\="" e="" theta="" ig="" left\="" z="" ight\="" eq="" uad\rightarrow="" uad="" pr="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;For example, if a transfer function is known to be asymptotically stable,&#10;then a &lt;a href="https://technick.net/guides/theory/edft/012"&gt;frequency response&lt;/a&gt; with nonnegative real part&#10;implies that the transfer function is positive real.&lt;/p&gt;&lt;p&gt;Note that consideration of &lt;img width="64" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img14.gif" alt="$1/H(z)$" /&gt; leads to analogous necessary and sufficient&#10;conditions for &lt;img width="46" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img5.gif" alt="$H(z)$" /&gt; to be positive real in terms of its&#10;zeros instead of poles.&lt;img width="19" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img13.gif" alt="$\" ox="" /&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>01. What is Bandlimited Interpolation?</title><link>https://technick.net/guides/theory/dar/001/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dar/001/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/resample/"&gt;The Digital Audio Resampling Home Page&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, Copyright &amp;#169; &lt;i&gt;2016-05-17&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dar/000"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dar/000"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dar/002"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;What is Bandlimited Interpolation?&lt;/h3&gt;&lt;p&gt;&lt;i&gt;&lt;a href="https://technick.net/guides/theory/dar/000"&gt;Bandlimited interpolation&lt;/a&gt;&lt;/i&gt; of discrete-time signals is a basic&#10;tool having extensive application in &lt;a href="http://www.dsptutor.freeuk.com/" target="_blank"&gt;digital signal processing&lt;/a&gt;. In&#10;general, the problem is to correctly compute signal values at&#10;arbitrary continuous times from a set of discrete-time samples of the&#10;signal &lt;a href="https://ccrma.stanford.edu/~jos//log/Logarithms.html" target="_blank"&gt;amplitude&lt;/a&gt;. In other words, we must be able to interpolate the&#10;signal between samples. Since the original signal is always assumed&#10;to be &lt;i&gt;bandlimited &lt;/i&gt;to half the &lt;a href="https://ccrma.stanford.edu/~jos//st/Shannon_s_Sampling_Theorem.html" target="_blank"&gt;sampling rate&lt;/a&gt;, (otherwisealiasing distortion would occur upon sampling), &lt;i&gt;&lt;a href="https://ccrma.stanford.edu/~jos//st/Shannon_s_Sampling_Theorem.html" target="_blank"&gt;Shannon's&#10;sampling theorem&lt;/a&gt;&lt;/i&gt; tells us the signal can be exactly and uniquely&#10;reconstructed for all time from its samples by bandlimited&#10;interpolation.&lt;/p&gt;&lt;p&gt;There are many methods for interpolating discrete points. For example,&lt;i&gt;&lt;a href="https://ccrma.stanford.edu/~jos//Interpolation/Lagrange_Interpolation.html" target="_blank"&gt;Lagrange interpolation&lt;/a&gt;&lt;/i&gt; is the classical technique of finding an&#10;order &lt;img width="22" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img4.gif" alt="$N$" /&gt; polynomial which passes through &lt;img width="54" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img5.gif" alt="$N+1$" /&gt; given points. &lt;/p&gt;&lt;p&gt;The technique known as &lt;i&gt;cubic splines&lt;/i&gt; fits a third-order&#10;polynomial through two points so as to achieve a certain slope at one&#10;of the points. (This allows for a smooth chain of third-order&#10;polynomial passing through a set of points.)&lt;/p&gt;&lt;p&gt;You may also have heard of &lt;i&gt;Bezier splines&lt;/i&gt; which interpolate a&#10;set of points using smooth curves which don't necessarily pass through&#10;the points. (Bezier curves are commonly used in graphics and drawing&#10;programs, such as Adobe Illustrator.)&lt;/p&gt;&lt;p&gt;The above methods are suitable for graphics and other uses, but they&#10;are not ideal for digital audio. In digital audio, what matters is&#10;the &lt;i&gt;audibility&lt;/i&gt; of interpolation error between samples. Since&#10;Shannon's sampling theorem says that it is possible to restore an&#10;audio signal &lt;i&gt;exactly&lt;/i&gt; from its samples, it makes sense that the&#10;best digital audio interpolators would be based on that theory. Such&#10;``ideal'' interpolation is called &lt;i&gt;bandlimited interpolation&lt;/i&gt;.&lt;/p&gt;&lt;p&gt;A bandlimited interpolation algorithm designed along these lines is&#10;described in the &lt;a name="tex2html2" href="https://technick.net/guides/theory/dar/003"&gt;theory of operation&#10;tutorial&lt;/a&gt;.&#10;There is also &lt;a name="tex2html3" href="https://technick.net/guides/theory/dar/002"&gt;open-source&#10;software&lt;/a&gt;available in the C programming language.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>01. When was the battery invented?</title><link>https://technick.net/guides/electronics/bpw/c01_01/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c01_01/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/00_intro"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c01_02"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;1. When was the battery invented?&lt;/h3&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;One of the most remarkable and novel discoveries in the last &#10; 400 years has been electricity. One may ask, “Has electricity &#10; been around that long?” The answer is yes, and perhaps much &#10; longer. But the practical use of electricity has only been &#10; at our disposal since the mid-to late 1800s, and in a limited &#10; way at first. At the world exposition in Paris in 1900, for &#10; example, one of the main attractions was an electrically lit &#10; bridge over the river Seine. &lt;/p&gt; &lt;p&gt;The earliest method of generating electricity occurred by &#10; creating a static charge. In 1660, Otto von Guericke constructed &#10; the first electrical machine that consisted of a large sulphur &#10; globe which, when rubbed and turned, attracted feathers and &#10; small pieces of paper. Guericke was able to prove that the &#10; sparks generated were truly electrical. &lt;/p&gt; &lt;p&gt;The first suggested use of static electricity was the so-called &#10; “electric pistol”. Invented by Alessandro Volta (1745-1827), &#10; an electrical wire was placed in a jar filled with methane &#10; gas. By sending an electrical spark through the wire, the &#10; jar would explode. &lt;/p&gt; &lt;p&gt;Volta then thought of using this invention to provide long &#10; distance communications, albeit only addressing one Boolean &#10; bit. An iron wire supported by wooden poles was to be strung &#10; from Como to Milan, Italy. At the receiving end, the wire &#10; would terminate in a jar filled with methane gas. On command, &#10; an electrical spark is sent by wire that would detonate the &#10; electric pistol to signal a coded event. This communications &#10; link was never&amp;nbsp;built.&lt;/p&gt; &lt;p&gt;&lt;img width="250" height="293" src="https://technick.net/img/guide_bpw2/c01_01.jpg" v:shapes="_x0000_i1026" border="0" alt="Alessandro Volta" /&gt;&lt;/p&gt; &lt;p&gt;&lt;a name="_Toc502116678"&gt;&lt;/a&gt;&lt;a name="_Toc507815229"&gt;&lt;span class="caption"&gt;Figure&amp;nbsp;&lt;/span&gt;&lt;/a&gt;&lt;span class="caption"&gt;1-1:&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; &#10; Alessandro Volta, inventor of the electric battery.&lt;/span&gt;&lt;br /&gt; &lt;span class="caption-sub"&gt;Volta’s discovery of the decomposition &#10; of water by an electrical current laid the foundation of electrochemistry. &#10; &amp;copy;Cadex Electronics&amp;nbsp;Inc.&lt;/span&gt;&lt;/p&gt; &lt;p&gt;In 1791, while working at Bologna University, Luigi Galvani &#10; discovered that the muscle of a frog contracted when touched &#10; by a metallic object. This phenomenon became known as animal &#10; electricity — a misnomer, as the theory was later disproven. &#10; Prompted by these experiments, Volta initiated a series of &#10; experiments using zinc, lead, tin or iron as positive plates. &#10; Copper, silver, gold or graphite were used as negative plates.&lt;/p&gt; &lt;p&gt;Volta discovered in 1800 that a continuous flow of electrical &#10; force was generated when using certain fluids as conductors &#10; to promote a chemical reaction between the metals or electrodes. &#10; This led to the invention of the first voltaic cell, better &#10; know as the battery. Volta discovered further that the voltage &#10; would increase when voltaic cells were stacked on top of each&amp;nbsp;other.&lt;/p&gt; &lt;p&gt;&lt;img width="336" height="412" src="https://technick.net/img/guide_bpw2/c01_02.jpg" alt="5.0.3" border="0" /&gt;&lt;/p&gt; &lt;p&gt;&lt;a name="_Toc502116679"&gt;&lt;/a&gt;&lt;a name="_Toc507815230"&gt;&lt;span class="caption"&gt;Figure&amp;nbsp;&lt;/span&gt;&lt;/a&gt;&lt;span class="caption"&gt;1-2: &#10; Four variations of Volta’s electric battery.&lt;br /&gt; &lt;/span&gt;&lt;span class="caption-sub"&gt;Silver and zinc disks are &#10; separated with moist paper. &amp;copy;Cadex Electronics Inc.&lt;/span&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>01. When was the battery invented? 2</title><link>https://technick.net/guides/electronics/bpw/c01_02/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c01_02/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c01_01"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c01_03"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;In the same year, Volta released his discovery of a continuous &#10; source of electricity to the Royal Society of London. No longer &#10; were experiments limited to a brief display of sparks that &#10; lasted a fraction of a second. A seemingly endless stream &#10; of electric current was now available. &lt;/p&gt; &lt;p&gt;France was one of the first nations to officially recognize &#10; Volta’s discoveries. At the time, France was approaching the &#10; height of scientific advancements and new ideas were welcomed &#10; with open arms to support the political agenda. By invitation, &#10; Volta addressed the Institute of France in a series of lectures &#10; at which Napoleon Bonaparte was present as a member of the &#10; Institute.&lt;/p&gt; &lt;p&gt;&lt;img width="288" height="272" src="https://technick.net/img/guide_bpw2/c01_03.jpg" alt="5.0.3" border="0" /&gt;&lt;/p&gt; &lt;p class="caption"&gt;Figure 1-3: Volta’s experimentations at the &#10; French National Institute.&lt;br /&gt; &lt;span class="caption-sub"&gt;Volta’s discoveries so impressed &#10; the world that in November 1800, he was invited by the French &#10; National Institute to lectures in which Napoleon Bonaparte &#10; participated. Later, Napoleon himself helped with the experiments, &#10; drawing sparks from the battery, melting a steel wire, discharging &#10; an electric pistol and decomposing water into its elements. &#10; &amp;copy;Cadex Electronics&amp;nbsp;Inc.&lt;/span&gt;&lt;/p&gt; &lt;p&gt;New discoveries were made when Sir Humphry Davy, inventor &#10; of the miner’s safety lamp, installed the largest and most &#10; powerful electric battery in the vaults of the Royal Institution &#10; of London. He connected the battery to charcoal electrodes &#10; and produced the first electric light. As reported by witnesses, &#10; his voltaic arc lamp produced “the most brilliant ascending &#10; arch of light ever seen.”&lt;/p&gt; &lt;p&gt;Davy's most important investigations were devoted to electrochemistry. &#10; Following Galvani's experiments and the discovery of the voltaic &#10; cell, interest in galvanic electricity had become widespread. &#10; Davy began to test the chemical effects of electricity in &#10; 1800. He soon found that by passing electrical current through &#10; some substances, these substances decomposed, a process later &#10; called electrolysis. The generated voltage was directly related &#10; to the reactivity of the electrolyte with the metal. Evidently, &#10; Davy understood that the actions of electrolysis and the voltaic &#10; cell were the same.&lt;/p&gt; &lt;p&gt;In 1802, Dr. William Cruickshank designed the first electric &#10; battery capable of mass production. Cruickshank had arranged &#10; square sheets of copper, which he soldered at their ends, &#10; together with sheets of zinc of equal size. These sheets were &#10; placed into a long rectangular wooden box that was sealed &#10; with cement. Grooves in the box held the metal plates in position. &#10; The box was then filled with an electrolyte of brine, or watered &#10; down acid.&lt;/p&gt; &lt;p&gt;The third method of generating electricity was discovered &#10; relatively late — electricity through magnetism. In 1820, &#10; Andr&amp;eacute;-Marie Amp&amp;egrave;re (1775-1836) had noticed that wires carrying &#10; an electric current were at times attracted to one another &#10; while at other times they were repelled.&lt;/p&gt; &lt;p&gt;In 1831, Michael Faraday (1791-1867) demonstrated how a copper &#10; disc was able to provide a constant flow of electricity when &#10; revolved in a strong magnetic field. Faraday, assisting Davy &#10; and his research team, succeeded in generating an endless &#10; electrical force as long as the movement between a coil and &#10; magnet continued. The electric generator was invented. This &#10; process was then reversed and the electric motor was discovered. &#10; Shortly thereafter, transformers were developed that could &#10; convert electricity to a desired voltage. In 1833, Faraday &#10; established the foundation of electrochemistry with Faraday's &#10; Law, which describes the amount of reduction that occurs in &#10; an electrolytic cell.&lt;/p&gt; &lt;p&gt;In 1836, John F. Daniell, an English chemist, developed an &#10; improved battery which produced a steadier current than Volta's &#10; device. Until then, all batteries had been composed of primary &#10; cells, meaning that they could not be recharged. In 1859, &#10; the French physician Gaston Plat&amp;eacute; invented the first rechargeable &#10; battery. This secondary battery was based on lead acid chemistry, &#10; a system that is still used&amp;nbsp;today.&lt;/p&gt; &lt;p&gt;&lt;img width="250" height="332" src="https://technick.net/img/guide_bpw2/c01_04.jpg" alt="5.0.3" border="0" /&gt;&lt;/p&gt; &lt;p class="caption"&gt;Figure 1-4: Cruickshank and the first flooded &#10; battery.&lt;br /&gt; &lt;span class="caption-sub"&gt;William Cruickshank, an English &#10; chemist, built a battery of electric cells by joining zinc &#10; and copper plates in a wooden box filled with electrolyte. &#10; This flooded design had the advantage of not drying out with &#10; use and provided more energy than Volta’s disc arrangement. &#10; &amp;copy;Cadex Electronics&amp;nbsp;Inc.&lt;/span&gt;&lt;/p&gt; &lt;p&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>01. When was the battery invented? 3</title><link>https://technick.net/guides/electronics/bpw/c01_03/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c01_03/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c01_02"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c02_01"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;&lt;font face="Arial, Helvetica, sans-serif" size="2"&gt;Toward &#10; the end of the 1800s, giant generators and transformers were &#10; built. Transmission lines were installed and electricity was &#10; made available to humanity to produce light, heat and movement. &#10; In the early twentieth century, the use of electricity was &#10; further refined. The invention of the vacuum tube enabled &#10; generating controlled signals, amplifications and sound. Soon &#10; thereafter, radio was invented, which made wireless communication &#10; possible.&lt;/font&gt;&lt;/p&gt; &lt;p&gt;In 1899, Waldmar Jungner from Sweden invented the nickel-cadmium &#10; battery, which used nickel for the positive electrode and &#10; cadmium for the negative. Two years later, Edison produced &#10; an alternative design by replacing cadmium with iron. Due &#10; to high material costs compared to dry cells or lead acid &#10; storage batteries, the practical applications of the nickel-cadmium &#10; and nickel-iron batteries were limited.&lt;/p&gt; &lt;p&gt;It was not until Shlecht and Ackermann invented the sintered &#10; pole plate in 1932 that large improvements were achieved. &#10; These advancements were reflected in higher load currents &#10; and improved longevity. The sealed nickel-cadmium battery, &#10; as we know it toady, became only available when Neumann succeeded &#10; in completely sealing the cell in 1947.&lt;/p&gt; &lt;p&gt;From the early days on, humanity became dependent on electricity, &#10; a product without which our technological advancements would &#10; not have been possible. With the increased need for mobility, &#10; people moved to portable power storage — first for wheeled &#10; applications, then for portable and finally wearable use. &#10; As awkward and unreliable as the early batteries may have &#10; been, our descendants may one day look at today’s technology &#10; in a similar way to how we view our predecessors’ clumsy experiments &#10; of 100&amp;nbsp;years&amp;nbsp;ago.&lt;br /&gt; &lt;br /&gt; &lt;/p&gt; &lt;table border="0" cellspacing="0" cellpadding="2"&gt; &lt;tr&gt; &#10; &lt;td width="100%" colspan="3" valign="top"&gt; &#10; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="100%" colspan="3" valign="top" bgcolor="#E6E6E6"&gt; &#10; &lt;p align="center"&gt;&lt;b&gt;History of &#10; Battery Development&lt;/b&gt;&lt;/p&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="100%" colspan="3" valign="top"&gt; &#10; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="13%" valign="top" bgcolor="white" class="table-bolder"&gt; &#10; 1600 &lt;/td&gt; &lt;td width="35%" valign="top" bgcolor="white"&gt; Gilbert (England)&lt;/td&gt; &lt;td width="50%" valign="top" bgcolor="white"&gt; Establishment &#10; electrochemistry study&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="13%" valign="top" bgcolor="#F3F3F3" class="table-bolder"&gt; &#10; 1791 &lt;/td&gt; &lt;td width="35%" valign="top" bgcolor="#F3F3F3"&gt; Galvani &#10; (Italy) &lt;/td&gt; &lt;td width="50%" valign="top" bgcolor="#F3F3F3"&gt; Discovery &#10; of ‘animal electricity’&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="13%" valign="top" bgcolor="white"&gt;&lt;span class="table-bolder"&gt;1800&lt;/span&gt;&lt;/td&gt; &lt;td width="35%" valign="top" bgcolor="white"&gt;Volta (Italy)&lt;/td&gt; &lt;td width="50%" valign="top" bgcolor="white"&gt;Invention of &#10; the voltaic cell&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="13%" valign="top" bgcolor="white"&gt;&lt;span class="table-bolder"&gt;1802&lt;/span&gt;&lt;/td&gt; &lt;td width="35%" valign="top" bgcolor="white"&gt;Cruickshank &#10; (England)&lt;/td&gt; &lt;td width="50%" valign="top" bgcolor="white"&gt;First electric &#10; battery capable of mass production&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="13%" valign="top" bgcolor="white"&gt;&lt;span class="table-bolder"&gt;1820&lt;/span&gt;&lt;/td&gt; &lt;td width="35%" valign="top" bgcolor="white"&gt;Amp&amp;egrave;re (France)&lt;/td&gt; &lt;td width="50%" valign="top" bgcolor="white"&gt;Electricity &#10; through magnetism&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="13%" valign="top" bgcolor="white"&gt;&lt;span class="table-bolder"&gt;1833&lt;/span&gt;&lt;/td&gt; &lt;td width="35%" valign="top" bgcolor="white"&gt;Faraday (England)&lt;/td&gt; &lt;td width="50%" valign="top" bgcolor="white"&gt;Announcement &#10; of Faraday’s Law&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="13%" valign="top" bgcolor="white"&gt;&lt;span class="table-bolder"&gt;1836&lt;/span&gt;&lt;/td&gt; &lt;td width="35%" valign="top" bgcolor="white"&gt;Daniell (England)&lt;/td&gt; &lt;td width="50%" valign="top" bgcolor="white"&gt;Invention of &#10; the Daniell cell&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="13%" valign="top" bgcolor="white"&gt;&lt;span class="table-bolder"&gt;1859&lt;/span&gt;&lt;/td&gt; &lt;td width="35%" valign="top" bgcolor="white"&gt;Plant&amp;eacute; (France)&lt;/td&gt; &lt;td width="50%" valign="top" bgcolor="white"&gt;Invention of &#10; the lead acid battery&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="13%" valign="top" bgcolor="white"&gt;&lt;span class="table-bolder"&gt;1868&lt;/span&gt;&lt;/td&gt; &lt;td width="35%" valign="top" bgcolor="white"&gt;Leclanch&amp;eacute; (France)&lt;/td&gt; &lt;td width="50%" valign="top" bgcolor="white"&gt;Invention of &#10; the Leclanch&amp;eacute; cell&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="13%" valign="top" bgcolor="white"&gt;&lt;span class="table-bolder"&gt;1888&lt;/span&gt;&lt;/td&gt; &lt;td width="35%" valign="top" bgcolor="white"&gt;Gassner (USA)&lt;/td&gt; &lt;td width="50%" valign="top" bgcolor="white"&gt;Completion &#10; of the dry cell&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="13%" valign="top" bgcolor="white"&gt;&lt;span class="table-bolder"&gt;1899&lt;/span&gt;&lt;/td&gt; &lt;td width="35%" valign="top" bgcolor="white"&gt;Jungner (Sweden)&lt;/td&gt; &lt;td width="50%" valign="top" bgcolor="white"&gt;Invention of &#10; the nickel-cadmium battery&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="13%" valign="top" bgcolor="#F3F3F3"&gt;&lt;span class="table-bolder"&gt;1901&lt;/span&gt;&lt;/td&gt; &lt;td width="35%" valign="top" bgcolor="#F3F3F3"&gt;Edison (USA)&lt;/td&gt; &lt;td width="50%" valign="top" bgcolor="#F3F3F3"&gt;Invention &#10; of the nickel-iron battery&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="13%" valign="top" bgcolor="#F3F3F3"&gt;&lt;span class="table-bolder"&gt;1932&lt;/span&gt;&lt;/td&gt; &lt;td width="35%" valign="top" bgcolor="#F3F3F3"&gt;Shlecht &amp;amp; &#10; Ackermann (Germany)&lt;/td&gt; &lt;td width="50%" valign="top" bgcolor="#F3F3F3"&gt;Invention &#10; of the sintered pole plate&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="13%" valign="top" bgcolor="#F3F3F3"&gt;&lt;span class="table-bolder"&gt;1947&lt;/span&gt;&lt;/td&gt; &lt;td width="35%" valign="top" bgcolor="#F3F3F3"&gt;Neumann (France)&lt;/td&gt; &lt;td width="50%" valign="top" bgcolor="#F3F3F3"&gt;Successfully &#10; sealing the nickel-cadmium battery&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="13%" valign="top" bgcolor="#F3F3F3"&gt;&lt;span class="table-bolder"&gt;Mid &#10; 1960&lt;/span&gt;&lt;/td&gt; &lt;td width="35%" valign="top" bgcolor="#F3F3F3"&gt;Union Carbide &#10; (USA)&lt;/td&gt; &lt;td width="50%" valign="top" bgcolor="#F3F3F3"&gt;Development &#10; of primary alkaline battery&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="13%" valign="top" bgcolor="#F3F3F3"&gt;&lt;span class="table-bolder"&gt;Mid &#10; 1970&lt;/span&gt;&lt;/td&gt; &lt;td width="35%" valign="top" bgcolor="#F3F3F3"&gt;&amp;nbsp;&lt;/td&gt; &lt;td width="50%" valign="top" bgcolor="#F3F3F3"&gt;Development &#10; of valve regulated lead acid battery&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="13%" valign="top" bgcolor="#F3F3F3"&gt;&lt;span class="table-bolder"&gt;1990&lt;/span&gt;&lt;/td&gt; &lt;td width="35%" valign="top" bgcolor="#F3F3F3"&gt;&amp;nbsp;&lt;/td&gt; &lt;td width="50%" valign="top" bgcolor="#F3F3F3"&gt;Commercialization &#10; nickel-metal hydride battery&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="13%" valign="top" bgcolor="#F3F3F3"&gt;&lt;span class="table-bolder"&gt;1992&lt;/span&gt;&lt;/td&gt; &lt;td width="35%" valign="top" bgcolor="#F3F3F3"&gt;Kordesch &#10; (Canada)&lt;/td&gt; &lt;td width="50%" valign="top" bgcolor="#F3F3F3"&gt;Commercialization &#10; reusable alkaline battery&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="13%" valign="top" bgcolor="#F3F3F3"&gt;&lt;span class="table-bolder"&gt;1999&lt;/span&gt;&lt;/td&gt; &lt;td width="35%" valign="top" bgcolor="#F3F3F3"&gt;&amp;nbsp;&lt;/td&gt; &lt;td width="50%" valign="top" bgcolor="#F3F3F3"&gt;Commercialization &#10; lithium-ion polymer&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="13%" valign="top" bgcolor="white" class="table-bolder"&gt; &#10; 2001&lt;/td&gt; &lt;td width="35%" valign="top" bgcolor="white"&gt;&amp;nbsp; &lt;/td&gt; &lt;td width="50%" valign="top" bgcolor="white"&gt; Anticipated &#10; volume production of proton exchange membrane fuel cell&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="13%" valign="top" bgcolor="white"&gt;&lt;/td&gt; &lt;td width="35%" valign="top" bgcolor="white"&gt;&amp;nbsp;&lt;/td&gt; &lt;td width="50%" valign="top" bgcolor="white"&gt;&amp;nbsp;&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td colspan="3" valign="top" bgcolor="white"&gt; &#10; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;p class="caption"&gt;Figure 1-5: History of battery development.&lt;br /&gt; &lt;span class="caption-sub"&gt;The battery may be much older. It &#10; is believed that the Parthians who ruled Baghdad (ca.&amp;nbsp;250 &#10; bc) used batteries to electroplate silver. The Egyptians are &#10; said to have electroplated antimony onto copper over 4300&amp;nbsp;years&amp;nbsp;ago.&lt;/span&gt;&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>02. Available Software</title><link>https://technick.net/guides/theory/dar/002/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dar/002/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/resample/"&gt;The Digital Audio Resampling Home Page&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, Copyright &amp;#169; &lt;i&gt;2016-05-17&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dar/001"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dar/000"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dar/003"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;Available Software&lt;/h3&gt;&lt;ul&gt;&lt;li&gt;resample-1.5.tar.gz(51 Kbytes) (v1.5 released on 10/07/99) &lt;br /&gt;The &lt;a href="https://technick.net/guides/theory/dar/000"&gt;resample&lt;/a&gt; software package contains free &lt;a href="https://technick.net/guides/theory/dar/000"&gt;sampling-rate conversion&lt;/a&gt; and &lt;a href="https://ccrma.stanford.edu/~jos//WinFlt/Problem_Statement.html" target="_blank"&gt;filter design&lt;/a&gt; utilities written in C, including a stand-alone&#10; command-line sampling-rate conversion utility called&#10; resample. The package compiles readily under Linux and most other&#10; UNIX operating systems.&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html5" href="https://ccrma.stanford.edu/~jos//resample/resample-n.m.README" target="_blank"&gt;README file for resample software &#10;&#9;&#9;package&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html6" href="ftp://ccrma-ftp.stanford.edu/pub/Lisp/sndlib.tar.gz"&gt;sndlib-7&#10;&#9; (required)&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html7" href="https://ccrma.stanford.edu/~jos//resample/resample-1.2.tar.gz"&gt;Older Version for NeXT Computers&#10;&#9;&#9;(49 Kbytes)&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html8" href="http://osalp.sourceforge.net/" target="_blank"&gt;Open Source &#10;&#9;Audio Library Project (OSALP)&lt;/a&gt;&lt;br /&gt;OSALP contains a C++ class (GNU LGPL) based on the above resample software. &lt;p&gt;&lt;/p&gt;&lt;/li&gt;&lt;/ul&gt;&lt;p&gt;To receive upgrade notifications, report bugs, or contribute&#10;enhancements, send email to&lt;a name="tex2html9" href="mailto:jos@ccrma.stanford.edu"&gt;jos@ccrma.stanford.edu&lt;/a&gt;.&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>02. Battery Chemistries</title><link>https://technick.net/guides/electronics/bpw/c02_01/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c02_01/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c01_03"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c02_02"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;2. Battery Chemistries&lt;/h3&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;Battery novices often argue that advanced battery systems &#10; are now available that offer very high energy densities, deliver &#10; 1000&amp;nbsp;charge/discharge cycles and are paper thin. These &#10; attributes are indeed achievable — unfortunately not in the &#10; same battery pack. A given battery may be designed for small &#10; size and long runtime, but this pack would have a limited &#10; cycle life. Another battery may be built for durability, but &#10; it would be big and bulky. A third pack may have high energy &#10; density and long durability, but would be too expensive for &#10; the commercial consumer.&lt;/p&gt; &lt;p&gt;Battery manufacturers are well aware of customer needs and &#10; have responded by offering battery packs that best suit the &#10; specific application. The mobile phone industry is an example &#10; of this clever adaptation. For this market, the emphasis is &#10; placed on small size and high energy density. Longevity comes &#10; in second.&lt;/p&gt; &lt;p&gt;The mention of NiMH on a battery pack does not automatically &#10; guarantee high energy density. A prismatic NiMH battery for &#10; a mobile phone, for example, is made for slim geometry and &#10; may only have an energy density of 60Wh/kg. The cycle count &#10; for this battery would be limited to around 300. In comparison, &#10; a cylindrical NiMH offers energy densities of 80Wh/kg and &#10; higher. Still, the cycle count of this battery will be moderate &#10; to low. High durability NiMH batteries, which are intended &#10; for industrial use and the electric vehicle enduring 1000&amp;nbsp;discharges &#10; to 80&amp;nbsp;percent depth-of discharge, are packaged in large &#10; cylindrical cells. The energy density on these cells is a &#10; modest 70Wh/kg.&lt;/p&gt; &lt;p&gt;Similarly, Li-ion batteries for defense applications &#10; are being produced that far exceed the energy density of the &#10; commercial equivalent. Unfortunately, these super-high capacity &#10; Li-ion batteries are deemed unsafe in the hands of the &#10; public. Neither would the general public be able to afford &#10; to buy them.&lt;/p&gt; &lt;p&gt;When energy densities and cycle life are mentioned, this &#10; book refers to a middle-of-the-road commercial battery that &#10; offers a reasonable compromise in size, energy density, cycle &#10; life and price. The book excludes miracle batteries that only &#10; live in controlled environments.&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>02. Battery Chemistries</title><link>https://technick.net/guides/electronics/bpw/c02_10/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c02_10/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c02_09"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c03_01"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;2.8 The Supercapacitor&lt;/h4&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;The supercapacitor resembles a regular capacitor with the &#10; exception that it offers very high capacitance in a small &#10; size. Energy storage is by means of static charge. Applying a &#10; voltage differential on the positive and negative plates &#10; charges the supercapacitor. This concept is similar to an &#10; electrical charge that builds up when walking on a carpet. &#10; Touching an object at ground potential releases the energy. &#10; The supercapacitor concept has been around for a number of &#10; years and has found many niche applications.&lt;br /&gt;&lt;/p&gt;</description></item><item><title>02. Battery Chemistries 2</title><link>https://technick.net/guides/electronics/bpw/c02_02/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c02_02/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c02_01"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c02_03"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;2.1 Chemistry Comparison&lt;/h4&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;Let's examine the advantages and limitations of today’s popular &#10; battery systems. Batteries are scrutinized not only in terms &#10; of energy density&amp;nbsp;but service life, load characteristics, &#10; maintenance requirements, self-discharge and operational costs. &#10; Since NiCd remains a standard against which other batteries &#10; are compared, let’s evaluate alternative chemistries against &#10; this classic battery type.&lt;/p&gt; &lt;p&gt;&lt;b&gt;Nickel Cadmium&lt;/b&gt; (NiCd) — mature and well understood &#10; but relatively low in energy density. The NiCd is used where &#10; long life, high discharge rate and economical price are important. &#10; Main applications are two-way radios, biomedical equipment, &#10; professional video cameras and power tools. The NiCd contains &#10; toxic metals and is not environmentally friendly.&lt;/p&gt; &lt;p&gt;&lt;b&gt;Nickel-Metal Hydride &lt;/b&gt;(NiMH) — has a higher energy &#10; density&amp;nbsp;compared to the NiCd at the expense of reduced cycle &#10; life. NiMH contains no toxic metals. Applications include &#10; mobile phones and laptop computers.&lt;/p&gt; &lt;p&gt;&lt;b&gt;Lead Acid &lt;/b&gt;— most economical for larger power applications &#10; where weight is of little concern. The lead acid battery is &#10; the preferred choice for hospital equipment, wheelchairs, &#10; emergency lighting and UPS systems.&lt;/p&gt; &lt;p&gt;&lt;b&gt;Lithium Ion&lt;/b&gt; (Li-ion) — fastest growing battery system. &#10; Li-ion is used where high-energy density&amp;nbsp;and light weight &#10; is of prime importance. The Li-ion is more expensive than &#10; other systems and must follow strict guidelines to assure &#10; safety. Applications include notebook computers and cellular &#10; phones.&lt;/p&gt; &lt;p&gt;&lt;b&gt;Lithium Ion Polymer&lt;/b&gt; (Li-ion polymer) — a potentially &#10; lower cost version of the Li-ion. This chemistry is similar &#10; to the Li-ion in terms of energy density. It enables very &#10; slim geometry and allows simplified packaging. Main applications &#10; are mobile phones.&lt;/p&gt; &lt;p&gt;&lt;b&gt;Reusable Alkaline&lt;/b&gt; — replaces disposable household &#10; batteries; suitable for low-power applications. Its limited &#10; cycle life is compensated by low self-discharge, making this &#10; battery ideal for portable entertainment devices and flashlights.&lt;/p&gt; &lt;p&gt;Figure&amp;nbsp;2-1 compares the characteristics of the six most &#10; commonly used rechargeable battery systems in terms of energy &#10; density, cycle life, exercise requirements and cost. The figures &#10; are based on average ratings of commercially available batteries &#10; at the time of publication. Exotic batteries with above average &#10; ratings are not included.&lt;br /&gt; &lt;br /&gt; &lt;/p&gt; &lt;table border="0" cellspacing="0" cellpadding="3" width="100%" bordercolor="#CCCCCC"&gt; &lt;tr&gt; &#10; &lt;td colspan="7" valign="top"&gt; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;thead&gt; &#10; &lt;tr&gt; &#10; &lt;td width="23%" valign="top" bgcolor="#E6E6E6"&gt;&amp;nbsp; &lt;/td&gt; &lt;td width="12%" valign="top" bgcolor="#E6E6E6"&gt; &lt;b&gt;&lt;span class="table-bolder"&gt;NiCd&lt;/span&gt;&lt;/b&gt;&lt;/td&gt; &lt;td width="12%" valign="top" bgcolor="#E6E6E6"&gt; &lt;b class="table-bolder"&gt;NiMH&lt;/b&gt;&lt;/td&gt; &lt;td width="11%" valign="top" bgcolor="#E6E6E6"&gt; &lt;b class="table-bolder"&gt;Lead &#10; Acid&lt;/b&gt;&lt;/td&gt; &lt;td width="12%" valign="top" bgcolor="#E6E6E6"&gt; &lt;b class="table-bolder"&gt;Li-ion&lt;/b&gt;&lt;/td&gt; &lt;td width="12%" valign="top" bgcolor="#E6E6E6"&gt; &lt;b class="table-bolder"&gt;Li-ion &#10; polymer&lt;/b&gt;&lt;/td&gt; &lt;td width="14%" valign="top" bgcolor="#E6E6E6"&gt; &lt;b class="table-bolder"&gt;Reusable&lt;br /&gt; Alkaline&lt;/b&gt;&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td colspan="7" valign="top"&gt; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;/thead&gt; &#10; &lt;tr&gt; &#10; &lt;td width="23%" valign="top"&gt; &lt;span class="table-bolder"&gt;Gravimetric &#10; Energy Density&lt;/span&gt; (Wh/kg) &lt;/td&gt; &lt;td width="12%" valign="top"&gt; 45-80&lt;/td&gt; &lt;td width="12%" valign="top"&gt; 60-120&lt;/td&gt; &lt;td width="11%" valign="top"&gt; 30-50&lt;/td&gt; &lt;td width="12%" valign="top"&gt; 110-160&lt;/td&gt; &lt;td width="12%" valign="top"&gt; 100-130&lt;/td&gt; &lt;td width="14%" valign="top"&gt; 80 (initial)&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="23%" valign="top" bgcolor="#f3f3f3"&gt; &lt;b class="table-bolder"&gt;Internal &#10; Resistance&lt;/b&gt; &lt;br /&gt; (includes peripheral circuits) in mW&lt;/td&gt; &lt;td width="12%" valign="top" bgcolor="#f3f3f3"&gt; 100 to 200&lt;sup&gt;1&lt;/sup&gt;&lt;br /&gt; 6V pack&lt;/td&gt; &lt;td width="12%" valign="top" bgcolor="#f3f3f3"&gt; 200 to 300&lt;sup&gt;1&lt;/sup&gt;&lt;br /&gt; 6V pack&lt;/td&gt; &lt;td width="11%" valign="top" bgcolor="#f3f3f3"&gt; &amp;lt;100&lt;sup&gt;1&lt;/sup&gt;&lt;br /&gt; 12V pack&lt;/td&gt; &lt;td width="12%" valign="top" bgcolor="#f3f3f3"&gt; 150 to 250&lt;sup&gt;1&lt;/sup&gt;&lt;br /&gt; 7.2V pack&lt;/td&gt; &lt;td width="12%" valign="top" bgcolor="#f3f3f3"&gt; 200 to 300&lt;sup&gt;1&lt;/sup&gt;&lt;br /&gt; 7.2V pack&lt;/td&gt; &lt;td width="14%" valign="top" bgcolor="#f3f3f3"&gt; 200 to 2000&lt;sup&gt;1&lt;/sup&gt;&lt;br /&gt; 6V pack&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="23%" valign="top"&gt; &lt;b class="table-bolder"&gt;Cycle &#10; Life&lt;/b&gt; (to 80% of initial capacity)&lt;/td&gt; &lt;td width="12%" valign="top"&gt; 1500&lt;sup&gt;2&lt;/sup&gt;&lt;/td&gt; &lt;td width="12%" valign="top"&gt; 300 to 500&lt;sup&gt;2,3&lt;/sup&gt;&lt;/td&gt; &lt;td width="11%" valign="top"&gt; 200 to &lt;br /&gt; 300&lt;sup&gt;2&lt;/sup&gt;&lt;/td&gt; &lt;td width="12%" valign="top"&gt; 500 to 1000&lt;sup&gt;3&lt;/sup&gt;&lt;/td&gt; &lt;td width="12%" valign="top"&gt; 300 to &lt;br /&gt; 500&lt;/td&gt; &lt;td width="14%" valign="top"&gt; 50&lt;sup&gt;3&lt;/sup&gt; &lt;br /&gt; (to 50%)&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="23%" valign="top" bgcolor="#f3f3f3"&gt; &lt;b class="table-bolder"&gt;Fast &#10; Charge Time&lt;/b&gt;&lt;/td&gt; &lt;td width="12%" valign="top" bgcolor="#f3f3f3"&gt; 1h typical&lt;/td&gt; &lt;td width="12%" valign="top" bgcolor="#f3f3f3"&gt; 2-4h&lt;/td&gt; &lt;td width="11%" valign="top" bgcolor="#f3f3f3"&gt; 8-16h&lt;/td&gt; &lt;td width="12%" valign="top" bgcolor="#f3f3f3"&gt; 2-4h&lt;/td&gt; &lt;td width="12%" valign="top" bgcolor="#f3f3f3"&gt; 2-4h&lt;/td&gt; &lt;td width="14%" valign="top" bgcolor="#f3f3f3"&gt; 2-3h&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="23%" valign="top"&gt; &lt;b class="table-bolder"&gt;Overcharge &#10; Tolerance&lt;/b&gt;&lt;/td&gt; &lt;td width="12%" valign="top"&gt; moderate&lt;/td&gt; &lt;td width="12%" valign="top"&gt; low&lt;/td&gt; &lt;td width="11%" valign="top"&gt; high&lt;/td&gt; &lt;td width="12%" valign="top"&gt; very low&lt;/td&gt; &lt;td width="12%" valign="top"&gt; low&lt;/td&gt; &lt;td width="14%" valign="top"&gt; moderate&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="23%" valign="top" bgcolor="#f3f3f3"&gt; &lt;b class="table-bolder"&gt;Self-discharge &#10; / Month&lt;/b&gt; (room temperature)&lt;/td&gt; &lt;td width="12%" valign="top" bgcolor="#f3f3f3"&gt; 20%&lt;sup&gt;4&lt;/sup&gt;&lt;/td&gt; &lt;td width="12%" valign="top" bgcolor="#f3f3f3"&gt; 30%&lt;sup&gt;4&lt;/sup&gt;&lt;/td&gt; &lt;td width="11%" valign="top" bgcolor="#f3f3f3"&gt; 5%&lt;/td&gt; &lt;td width="12%" valign="top" bgcolor="#f3f3f3"&gt; 10%&lt;sup&gt;5&lt;/sup&gt;&lt;/td&gt; &lt;td width="12%" valign="top" bgcolor="#f3f3f3"&gt; ~10%&lt;sup&gt;5&lt;/sup&gt;&lt;/td&gt; &lt;td width="14%" valign="top" bgcolor="#f3f3f3"&gt; 0.3%&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="23%" valign="top"&gt; &lt;b class="table-bolder"&gt;Cell &#10; Voltage&lt;/b&gt; (nominal)&lt;/td&gt; &lt;td width="12%" valign="top"&gt; 1.25V&lt;sup&gt;6&lt;/sup&gt;&lt;/td&gt; &lt;td width="12%" valign="top"&gt; 1.25V&lt;sup&gt;6&lt;/sup&gt;&lt;/td&gt; &lt;td width="11%" valign="top"&gt; 2V&lt;/td&gt; &lt;td width="12%" valign="top"&gt; 3.6V&lt;/td&gt; &lt;td width="12%" valign="top"&gt; 3.6V&lt;/td&gt; &lt;td width="14%" valign="top"&gt; 1.5V&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="23%" valign="top" bgcolor="#f3f3f3"&gt; &lt;b&gt;&lt;span class="table-bolder"&gt;Load &#10; Current&lt;/span&gt;&lt;br /&gt; &lt;/b&gt;-&amp;nbsp;&amp;nbsp;&amp;nbsp; peak&lt;br /&gt; -&amp;nbsp;&amp;nbsp;&amp;nbsp; best result&lt;/td&gt; &lt;td width="12%" valign="top" bgcolor="#f3f3f3"&gt; &lt;br /&gt; 20C&lt;br /&gt; 1C&lt;/td&gt; &lt;td width="12%" valign="top" bgcolor="#f3f3f3"&gt; &lt;br /&gt; 5C&lt;br /&gt; 0.5C or lower&lt;/td&gt; &lt;td width="11%" valign="top" bgcolor="#f3f3f3"&gt; &lt;br /&gt; 5C&lt;sup&gt;7 &lt;br /&gt; &lt;/sup&gt;0.2C&lt;/td&gt; &lt;td width="12%" valign="top" bgcolor="#f3f3f3"&gt; &lt;br /&gt; &amp;gt;2C&lt;br /&gt; 1C or lower&lt;/td&gt; &lt;td width="12%" valign="top" bgcolor="#f3f3f3"&gt; &lt;br /&gt; &amp;gt;2C&lt;br /&gt; 1C or lower&lt;/td&gt; &lt;td width="14%" valign="top" bgcolor="#f3f3f3"&gt; &lt;br /&gt; 0.5C&lt;br /&gt; 0.2C or lower&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="23%" valign="top"&gt; &lt;b class="table-bolder"&gt;Operating &#10; Temperature&lt;/b&gt; (discharge only)&lt;/td&gt; &lt;td width="12%" valign="top"&gt; -40 to &lt;br /&gt; 60&amp;deg;C&lt;/td&gt; &lt;td width="12%" valign="top"&gt; -20 to &lt;br /&gt; 60&amp;deg;C&lt;/td&gt; &lt;td width="11%" valign="top"&gt; -20 to &lt;br /&gt; 60&amp;deg;C&lt;/td&gt; &lt;td width="12%" valign="top"&gt; -20 to &lt;br /&gt; 60&amp;deg;C&lt;/td&gt; &lt;td width="12%" valign="top"&gt; 0 to &lt;br /&gt; 60&amp;deg;C&lt;/td&gt; &lt;td width="14%" valign="top"&gt; 0 to &lt;br /&gt; 65&amp;deg;C&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="23%" valign="top" bgcolor="#f3f3f3"&gt; &lt;b class="table-bolder"&gt;Maintenance &#10; Requirement&lt;/b&gt;&lt;/td&gt; &lt;td width="12%" valign="top" bgcolor="#f3f3f3"&gt; 30 to 60&amp;nbsp;days&lt;/td&gt; &lt;td width="12%" valign="top" bgcolor="#f3f3f3"&gt; 60 to 90&amp;nbsp;days&lt;/td&gt; &lt;td width="11%" valign="top" bgcolor="#f3f3f3"&gt; 3 to 6 months&lt;sup&gt;9&lt;/sup&gt;&lt;/td&gt; &lt;td width="12%" valign="top" bgcolor="#f3f3f3"&gt; not req.&lt;/td&gt; &lt;td width="12%" valign="top" bgcolor="#f3f3f3"&gt; not req.&lt;/td&gt; &lt;td width="14%" valign="top" bgcolor="#f3f3f3"&gt; not req.&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="23%" valign="top"&gt; &lt;b class="table-bolder"&gt;Typical &#10; Battery Cost&lt;/b&gt;&lt;br /&gt; (US$, reference only)&lt;/td&gt; &lt;td width="12%" valign="top"&gt; $50&lt;br /&gt; (7.2V)&lt;/td&gt; &lt;td width="12%" valign="top"&gt; $60&lt;br /&gt; (7.2V)&lt;/td&gt; &lt;td width="11%" valign="top"&gt; $25&lt;br /&gt; (6V)&lt;/td&gt; &lt;td width="12%" valign="top"&gt; $100&lt;br /&gt; (7.2V)&lt;/td&gt; &lt;td width="12%" valign="top"&gt; $100&lt;br /&gt; (7.2V)&lt;/td&gt; &lt;td width="14%" valign="top"&gt; $5&lt;br /&gt; (9V)&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="23%" valign="top" bgcolor="#f3f3f3"&gt; &lt;b class="table-bolder"&gt;Cost &#10; per Cycle&lt;/b&gt; (US$)&lt;sup&gt;11&lt;/sup&gt;&lt;/td&gt; &lt;td width="12%" valign="top" bgcolor="#f3f3f3"&gt; $0.04&lt;/td&gt; &lt;td width="12%" valign="top" bgcolor="#f3f3f3"&gt; $0.12&lt;/td&gt; &lt;td width="11%" valign="top" bgcolor="#f3f3f3"&gt; $0.10&lt;/td&gt; &lt;td width="12%" valign="top" bgcolor="#f3f3f3"&gt; $0.14&lt;/td&gt; &lt;td width="12%" valign="top" bgcolor="#f3f3f3"&gt; $0.29&lt;/td&gt; &lt;td width="14%" valign="top" bgcolor="#f3f3f3"&gt; $0.10-0.50&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="23%" valign="top"&gt; &lt;b class="table-bolder"&gt;Commercial &#10; use since&lt;/b&gt;&lt;/td&gt; &lt;td width="12%" valign="top"&gt; 1950&lt;/td&gt; &lt;td width="12%" valign="top"&gt; 1990&lt;/td&gt; &lt;td width="11%" valign="top"&gt; 1970&lt;/td&gt; &lt;td width="12%" valign="top"&gt; 1991&lt;/td&gt; &lt;td width="12%" valign="top"&gt; 1999&lt;/td&gt; &lt;td width="14%" valign="top"&gt; 1992&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td colspan="7" valign="top"&gt; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;p&gt;&lt;a name="_Ref501868451"&gt;&lt;/a&gt;&lt;a name="_Toc502116683"&gt;&lt;/a&gt;&lt;a name="_Toc507815234"&gt;&lt;span class="caption"&gt;Figure&amp;nbsp;&lt;/span&gt;&lt;/a&gt;&lt;span class="caption"&gt;2-1:&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; &#10; Characteristics of commonly used rechargeable batteries.&lt;br /&gt; &lt;/span&gt;&lt;span class="caption-sub"&gt;The figures are based on &#10; average ratings of batteries available commercially at the &#10; time of publication; experimental batteries with above average &#10; ratings are not included.&lt;/span&gt;&lt;/p&gt; &lt;ol&gt; &lt;li&gt;Internal resistance of a battery pack varies with cell &#10; rating, type of protection circuit and number of cells. &#10; Protection circuit of Li-ion and Li-polymer adds about 100mW.&lt;/li&gt; &lt;li&gt; Cycle life is based on battery receiving regular maintenance. &#10; Failing to apply periodic full discharge cycles may reduce &#10; the cycle life by a factor of three.&lt;/li&gt; &lt;li&gt;Cycle life is based on the depth of discharge. Shallow &#10; discharges provide more cycles than deep discharges.&lt;/li&gt; &lt;li&gt;The discharge is highest immediately after charge, then &#10; tapers off. The NiCd capacity decreases 10% in the first &#10; 24h, then declines to about 10% every 30 days thereafter. &#10; Self-discharge increases with higher temperature.&lt;/li&gt; &lt;li&gt; Internal protection circuits typically consume 3% of &#10; the stored energy per month.&lt;/li&gt; &lt;li&gt; 1.25V is the open cell voltage. 1.2V is the commonly &#10; used value. There is no difference between the cells; it &#10; is simply a method of rating.&lt;/li&gt; &lt;li&gt;Capable of high current pulses.&lt;/li&gt; &lt;li&gt;Applies to discharge only; charge temperature range is &#10; more confined.&lt;/li&gt; &lt;li&gt;Maintenance may be in the form of ‘equalizing’ or ‘topping’ &#10; charge.&lt;/li&gt; &lt;li&gt;Cost of battery for commercially available portable devices.&lt;/li&gt; &lt;li&gt; Derived from the battery price divided by cycle life. &#10; Does not include the cost of electricity and chargers.&lt;/li&gt; &lt;/ol&gt; &lt;p&gt;&lt;b&gt;Observation:&lt;/b&gt; It is interesting to note that NiCd has &#10; the shortest charge time, delivers the highest load current &#10; and offers the lowest overall cost-per-cycle, but has the &#10; most demanding maintenance requirements.&lt;a name="_Toc366986325"&gt;&lt;/a&gt;&lt;a name="_Toc366986402"&gt;&lt;/a&gt;&lt;a name="_Toc366986468"&gt;&lt;/a&gt;&lt;a name="_Toc366987099"&gt;&lt;/a&gt;&lt;a name="_Toc366987144"&gt;&lt;/a&gt;&lt;a name="_Toc366987185"&gt;&lt;/a&gt;&lt;a name="_Toc387644044"&gt;&lt;/a&gt;&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>02. Battery Chemistries 3</title><link>https://technick.net/guides/electronics/bpw/c02_03/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c02_03/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c02_02"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c02_04"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;2.2 The Nickel Cadmium (NiCd) Battery&lt;/h4&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;&lt;a name="_Toc366986275"&gt;&lt;/a&gt;&lt;a name="_Toc366986326"&gt;&lt;/a&gt;&lt;a name="_Toc366986403"&gt;&lt;/a&gt;&lt;a name="_Toc366986469"&gt;&lt;/a&gt;&lt;a name="_Toc366987100"&gt;&lt;/a&gt;&lt;a name="_Toc366987145"&gt;&lt;/a&gt;&lt;a name="_Toc366987186"&gt;&lt;/a&gt;&lt;a name="_Toc387644045"&gt;&lt;/a&gt;Alkaline nickel battery technology &#10; originated in 1899, when Waldmar Jungner invented the NiCd &#10; battery. The materials were expensive compared to other battery &#10; types available at the time and its use was limited to special &#10; applications. In 1932, the active materials were deposited &#10; inside a porous nickel-plated electrode and in 1947, research &#10; began on a sealed NiCd battery, which recombined the internal &#10; gases generated during charge rather than venting them. These &#10; advances led to the modern sealed NiCd battery, which is in &#10; use&amp;nbsp;today.&lt;/p&gt; &lt;p&gt;The NiCd prefers fast charge to slow charge and pulse charge &#10; to DC charge. All other chemistries prefer a shallow discharge &#10; and moderate load currents. The NiCd is a strong and silent &#10; worker; hard labor poses no problem. In fact, the NiCd is &#10; the only battery type that performs best under rigorous working &#10; conditions. It does not like to be pampered by sitting in &#10; chargers for days and being used only occasionally for brief &#10; periods. A periodic full discharge is so important that, if &#10; omitted, large crystals will form on the cell plates (also &#10; referred to as 'memory') and the NiCd will gradually lose &#10; its performance.&lt;/p&gt; &lt;p&gt;Among rechargeable batteries, NiCd remains a popular choice &#10; for applications such as two-way radios, emergency medical &#10; equipment, professional video cameras and power tools. Over &#10; 50&amp;nbsp;percent of all rechargeable batteries for portable &#10; equipment are NiCd. However, the introduction of batteries &#10; with higher energy densities and less toxic metals is causing &#10; a diversion from NiCd to newer technologies.&lt;br /&gt; &lt;br /&gt; &lt;/p&gt; &lt;table border="0" cellspacing="0" cellpadding="3"&gt; &lt;tr&gt; &#10; &lt;td width="482" colspan="2" valign="top"&gt; &#10; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="482" colspan="2" valign="top" bgcolor="#E6E6E6"&gt; &#10; &lt;p align="center"&gt;&lt;b&gt;Advantages &#10; and Limitations of NiCd Batteries&lt;/b&gt;&lt;/p&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="482" colspan="2" valign="top"&gt; &#10; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="65" valign="top"&gt; &#10; &lt;p&gt;&lt;b&gt;Advantages&lt;/b&gt;&lt;/p&gt; &lt;/td&gt; &lt;td width="417" valign="top"&gt; &#10; &lt;p&gt;Fast and simple charge — even after prolonged storage.&lt;/p&gt; &lt;p&gt;High number of charge/discharge cycles — if properly &#10; maintained, the NiCd provides over 1000&amp;nbsp;charge/discharge &#10; cycles.&lt;/p&gt; &lt;p&gt;Good load performance — the NiCd allows recharging &#10; at low temperatures.&lt;/p&gt; &lt;p&gt;Long shelf life – in any state-of-charge.&lt;/p&gt; &lt;p&gt;Simple storage and transportation — most airfreight &#10; companies accept the NiCd without special conditions.&lt;/p&gt; &lt;p&gt;Good low temperature performance.&lt;/p&gt; &lt;p&gt;Forgiving if abused — the NiCd is one of the most rugged &#10; rechargeable batteries.&lt;/p&gt; &lt;p&gt;Economically priced — the NiCd is the lowest cost battery &#10; in terms of cost per cycle. &lt;/p&gt; &lt;p&gt;Available in a wide range of sizes and performance &#10; options — most NiCd cells are cylindrical.&lt;/p&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="65" valign="top" bgcolor="#F3F3F3"&gt; &#10; &lt;p&gt;&lt;b&gt;Limitations&lt;/b&gt;&lt;/p&gt; &lt;/td&gt; &lt;td width="417" valign="top" bgcolor="#F3F3F3"&gt; &#10; &lt;p&gt;Relatively low energy density — compared with newer &#10; systems.&lt;/p&gt; &lt;p&gt;Memory effect — the NiCd must periodically be exercised &#10; to prevent memory.&lt;/p&gt; &lt;p&gt;Environmentally unfriendly — the NiCd contains toxic &#10; metals. Some countries are limiting the use of the NiCd &#10; battery.&lt;/p&gt; &lt;p&gt;Has relatively high self-discharge — needs recharging &#10; after storage.&lt;/p&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td colspan="2" valign="top"&gt; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;p&gt;&lt;a name="_Toc507815235" class="caption"&gt;Figure&amp;nbsp;2-2:&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; &#10; Advantages and limitations of NiCd batteries.&lt;/a&gt;&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>02. Battery Chemistries 4</title><link>https://technick.net/guides/electronics/bpw/c02_04/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c02_04/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c02_03"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c02_05"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;2.3 The Nickel-Metal Hydride (NiMH) Battery&lt;/h4&gt;&lt;p&gt;&lt;a name="_Toc507909149"&gt;&lt;/a&gt; &#10;&lt;pre&gt;&lt;code&gt; &amp;lt;/p&amp;gt;&amp;lt;p&amp;gt;Research of the NiMH system started in the 1970s as a means &#10; of discovering how to store hydrogen for the nickel hydrogen &#10; battery. Today, nickel hydrogen batteries&amp;amp;nbsp;are mainly used &#10; for satellite applications. They are bulky, contain high-pressure &#10; steel canisters and cost thousands of dollars&amp;amp;nbsp;each.&amp;lt;/p&amp;gt; &amp;lt;p&amp;gt;In the early experimental days of the NiMH battery, the metal &#10; hydride alloys were unstable in the cell environment and the &#10; desired performance characteristics could not be achieved. &#10; As a result, the development of the NiMH slowed down. New &#10; hydride alloys were developed in the 1980s that were stable &#10; enough for use in a cell. Since the late 1980s, NiMH has steadily &#10; improved, mainly in terms of energy density.&amp;lt;/p&amp;gt; &amp;lt;p&amp;gt;The success of the NiMH has been driven by its high energy &#10; density and the use of environmentally friendly metals. The &#10; modern NiMH offers up to 40&amp;amp;nbsp;percent higher energy density &#10; compared to NiCd. There is potential for yet higher capacities, &#10; but not without some negative side effects.&amp;lt;/p&amp;gt; &amp;lt;p&amp;gt;Both NiMH&amp;amp;nbsp;and NiCd&amp;amp;nbsp;are affected by high self-discharge. The &#10; NiCd loses about 10&amp;amp;nbsp;percent of its capacity&amp;amp;nbsp;within the &#10; first 24&amp;amp;nbsp;hours, after which the self-discharge&amp;amp;nbsp;settles &#10; to about 10&amp;amp;nbsp;percent per month. The self-discharge of &#10; the NiMH is about one-and-a-half to two times greater compared &#10; to NiCd. Selection of hydride materials that improve hydrogen &#10; bonding and reduce corrosion of the alloy constituents reduces &#10; the rate of self-discharge, but at the cost of lower energy &#10; density.&amp;lt;/p&amp;gt; &amp;lt;p&amp;gt;The NiMH has been replacing the NiCd in markets such as wireless &#10; communications and mobile computing. In many parts of the &#10; world, the buyer is encouraged to use NiMH rather than NiCd &#10; batteries. This is due to environmental concerns about careless &#10; disposal of the spent battery.&amp;lt;/p&amp;gt; &amp;lt;p&amp;gt;The question is often asked, “Has NiMH improved over the &#10; last few years?” Experts agree that considerable improvements &#10; have been achieved, but the limitations remain. Most of the &#10; shortcomings are native to the nickel-based technology and &#10; are shared with the NiCd battery. It is widely accepted that &#10; NiMH is an interim step to lithium battery technology.&amp;lt;/p&amp;gt; &amp;lt;p&amp;gt;Initially more expensive than the NiCd, the price of the &#10; NiMH has dropped and is now almost at par value. This was &#10; made possible with high volume production. With a lower demand &#10; for NiCd, there will be a tendency for the price to increase.&amp;lt;br /&amp;gt; &amp;lt;br /&amp;gt; &amp;lt;/p&amp;gt; &amp;lt;table border=&amp;quot;0&amp;quot; cellspacing=&amp;quot;0&amp;quot; cellpadding=&amp;quot;3&amp;quot;&amp;gt; &amp;lt;tr&amp;gt; &#10; &amp;lt;td width=&amp;quot;482&amp;quot; colspan=&amp;quot;2&amp;quot; valign=&amp;quot;top&amp;quot;&amp;gt; &amp;lt;table width=&amp;quot;100%&amp;quot; border=&amp;quot;0&amp;quot; cellspacing=&amp;quot;0&amp;quot; cellpadding=&amp;quot;0&amp;quot; bgcolor=&amp;quot;#000000&amp;quot;&amp;gt; &amp;lt;tr&amp;gt; &#10; &amp;lt;td&amp;gt;&amp;lt;/td&amp;gt; &amp;lt;/tr&amp;gt; &amp;lt;/table&amp;gt; &amp;lt;/td&amp;gt; &amp;lt;/tr&amp;gt; &amp;lt;tr&amp;gt; &#10; &amp;lt;td width=&amp;quot;482&amp;quot; colspan=&amp;quot;2&amp;quot; valign=&amp;quot;top&amp;quot; bgcolor=&amp;quot;#E6E6E6&amp;quot;&amp;gt; &#10; &amp;lt;p align=&amp;quot;center&amp;quot;&amp;gt;&amp;lt;b&amp;gt;Advantages &#10; and Limitations of NiMH Batteries&amp;lt;/b&amp;gt;&amp;lt;/p&amp;gt; &amp;lt;/td&amp;gt; &amp;lt;/tr&amp;gt; &amp;lt;tr&amp;gt; &#10; &amp;lt;td width=&amp;quot;482&amp;quot; colspan=&amp;quot;2&amp;quot; valign=&amp;quot;top&amp;quot;&amp;gt; &amp;lt;table width=&amp;quot;100%&amp;quot; border=&amp;quot;0&amp;quot; cellspacing=&amp;quot;0&amp;quot; cellpadding=&amp;quot;0&amp;quot; bgcolor=&amp;quot;#000000&amp;quot;&amp;gt; &amp;lt;tr&amp;gt; &#10; &amp;lt;td&amp;gt;&amp;lt;/td&amp;gt; &amp;lt;/tr&amp;gt; &amp;lt;/table&amp;gt; &amp;lt;/td&amp;gt; &amp;lt;/tr&amp;gt; &amp;lt;tr&amp;gt; &#10; &amp;lt;td width=&amp;quot;65&amp;quot; valign=&amp;quot;top&amp;quot;&amp;gt; &#10; &amp;lt;p&amp;gt;&amp;lt;b&amp;gt;Advantages&amp;lt;/b&amp;gt;&amp;lt;/p&amp;gt; &amp;lt;/td&amp;gt; &amp;lt;td width=&amp;quot;417&amp;quot; valign=&amp;quot;top&amp;quot;&amp;gt; &#10; &amp;lt;p&amp;gt;30 – 40&amp;amp;nbsp;percent higher capacity over a standard &#10; NiCd. The NiMH has potential for yet higher energy densities.&amp;lt;/p&amp;gt; &amp;lt;p&amp;gt;Less prone to memory than the NiCd. Periodic exercise &#10; cycles are required less often.&amp;lt;/p&amp;gt; &amp;lt;p&amp;gt;Simple storage and transportation — transportation &#10; conditions are not subject to regulatory control.&amp;lt;/p&amp;gt; &amp;lt;p&amp;gt;Environmentally friendly — contains only mild toxins; &#10; profitable for recycling.&amp;lt;/p&amp;gt; &amp;lt;/td&amp;gt; &amp;lt;/tr&amp;gt; &amp;lt;tr&amp;gt; &#10; &amp;lt;td width=&amp;quot;65&amp;quot; valign=&amp;quot;top&amp;quot; bgcolor=&amp;quot;#F3F3F3&amp;quot;&amp;gt; &#10; &amp;lt;p&amp;gt;&amp;lt;b&amp;gt;Limitations&amp;lt;/b&amp;gt;&amp;lt;/p&amp;gt; &amp;lt;/td&amp;gt; &amp;lt;td width=&amp;quot;417&amp;quot; valign=&amp;quot;top&amp;quot; bgcolor=&amp;quot;#F3F3F3&amp;quot;&amp;gt; &#10; &amp;lt;p&amp;gt;Limited service life — if repeatedly deep cycled, especially &#10; at high load currents, the performance starts to deteriorate &#10; after 200 to 300 cycles. Shallow rather than deep discharge &#10; cycles are preferred.&amp;lt;/p&amp;gt; &amp;lt;p&amp;gt;Limited discharge current — although a NiMH battery &#10; is capable of delivering high discharge currents, repeated &#10; discharges with high load currents reduces the battery’s &#10; cycle life. Best results are achieved with load currents &#10; of 0.2C to 0.5C (one-fifth to one-half of the rated &#10; capacity).&amp;lt;/p&amp;gt; &amp;lt;p&amp;gt;More complex charge algorithm needed — the NiMH generates &#10; more heat during charge and requires a longer charge &#10; time than the NiCd. The trickle charge is critical and &#10; must be controlled carefully.&amp;lt;/p&amp;gt; &amp;lt;p&amp;gt;High self-discharge — the NiMH has about 50&amp;amp;nbsp;percent &#10; higher self-discharge compared to the NiCd. New chemical &#10; additives improve the self-discharge but at the expense &#10; of lower energy density.&amp;lt;/p&amp;gt; &amp;lt;p&amp;gt;Performance degrades if stored at elevated temperatures &#10; — the NiMH should be stored in a cool place and at a &#10; state-of-charge of about 40&amp;amp;nbsp;percent.&amp;lt;/p&amp;gt; &amp;lt;p&amp;gt;High maintenance — battery requires regular full discharge &#10; to prevent crystalline formation.&amp;lt;/p&amp;gt; &amp;lt;p&amp;gt;About 20&amp;amp;nbsp;percent more expensive than NiCd — NiMH &#10; batteries designed for high current draw are more expensive &#10; than the regular version.&amp;lt;/p&amp;gt; &amp;lt;/td&amp;gt; &amp;lt;/tr&amp;gt; &amp;lt;tr valign=&amp;quot;middle&amp;quot;&amp;gt; &#10; &amp;lt;td colspan=&amp;quot;2&amp;quot; height=&amp;quot;18&amp;quot;&amp;gt; &#10; &amp;lt;table width=&amp;quot;100%&amp;quot; border=&amp;quot;0&amp;quot; cellspacing=&amp;quot;0&amp;quot; cellpadding=&amp;quot;0&amp;quot; bgcolor=&amp;quot;#000000&amp;quot;&amp;gt; &amp;lt;tr&amp;gt; &#10; &amp;lt;td&amp;gt;&amp;lt;/td&amp;gt; &amp;lt;/tr&amp;gt; &amp;lt;/table&amp;gt; &amp;lt;/td&amp;gt; &amp;lt;/tr&amp;gt; &amp;lt;/table&amp;gt; &amp;lt;p&amp;gt;&amp;lt;a name=&amp;quot;_Toc507815236&amp;quot;&amp;gt;&amp;lt;span class=&amp;quot;caption&amp;quot;&amp;gt;Figure&amp;amp;nbsp;2-&amp;lt;/span&amp;gt;&amp;lt;/a&amp;gt;&amp;lt;span class=&amp;quot;caption&amp;quot;&amp;gt;3:&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp;&amp;amp;nbsp; &#10; Advantages and limitations of NiMH batteries&amp;lt;/span&amp;gt;&amp;lt;/p&amp;gt;&amp;lt;/blockquote&amp;gt;&amp;lt;p align=&amp;quot;center&amp;quot;&amp;gt;&amp;lt;font size=&amp;quot;2&amp;quot;&amp;gt;&amp;lt;a href=&amp;quot;/guides/electronics/bpw/c02_03&amp;quot;&amp;gt;&amp;amp;lt;&amp;amp;lt; Previous page&amp;lt;/a&amp;gt;&amp;amp;nbsp;&amp;amp;nbsp;&amp;lt;a href=&amp;quot;/guides/electronics/bpw/00_toc&amp;quot;&amp;gt;INDEX&amp;lt;/a&amp;gt;&amp;amp;nbsp;&amp;amp;nbsp;&amp;lt;a href=&amp;quot;/guides/electronics/bpw/c02_05&amp;quot;&amp;gt;Next page &amp;amp;gt;&amp;amp;gt;&amp;lt;/a&amp;gt;&amp;lt;/font&amp;gt;&amp;lt;/p&amp;gt;&#10;&lt;/code&gt;&lt;/pre&gt;</description></item><item><title>02. Battery Chemistries 5</title><link>https://technick.net/guides/electronics/bpw/c02_05/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c02_05/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c02_04"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c02_06"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;2.4 The Lead Acid Battery&lt;/h4&gt;&lt;p&gt;&lt;a name="_Toc507909150"&gt;&lt;/a&gt; &lt;/p&gt;&lt;p&gt;Invented by the French physician Gaston Plant&amp;eacute; in 1859, lead &#10; acid was the first rechargeable battery for commercial use. &#10; Today, the flooded lead acid battery is used in automobiles, &#10; forklifts and large uninterruptible power supply (UPS) systems.&lt;/p&gt; &lt;p&gt;During the mid 1970s, researchers developed a maintenance-free &#10; lead acid battery, which could operate in any position. The &#10; liquid electrolyte was transformed into moistened separators &#10; and the enclosure was sealed. Safety valves were added to &#10; allow venting of gas during charge and discharge.&lt;/p&gt; &lt;p&gt;&lt;img src="https://technick.net/img/guide_bpw2/c02_01.gif" width="190" height="96" border="0" alt="Text Box: The SLA and VRLA can never be charged to their full potential." align="left" hspace="19" vspace="19" /&gt;Driven by diverse applications, two designations of batteries &#10; emerged. They are the sealed lead acid (SLA), also known under &#10; the brand name of Gelcell, and the valve regulated lead acid &#10; (VRLA). Technically, both batteries are the same. No scientific &#10; definition exists as to when an SLA becomes a VRLA. (Engineers &#10; may argue that the word ‘sealed lead acid’ is a misnomer because &#10; no lead acid battery can be totally sealed. In essence, all &#10; are valve regulated.) &lt;/p&gt; &lt;p&gt;The SLA has a typical capacity range of 0.2Ah to 30Ah and &#10; powers portable and wheeled applications. Typical uses are &#10; personal UPS units for PC backup, small emergency lighting &#10; units, ventilators for health care patients and wheelchairs. &#10; Because of low cost, dependable service and minimal maintenance &#10; requirements, the SLA battery is the preferred choice for &#10; biomedical and health care instruments in hospitals and retirement &#10; homes.&lt;/p&gt; &lt;p&gt;The VRLA battery is generally used for stationary applications. &#10; Their capacities range from 30Ah to several thousand Ah and &#10; are found in larger UPS systems for power backup. Typical &#10; uses are mobile phone repeaters, cable distribution centers, &#10; Internet hubs and utilities, as well as power backup for banks, &#10; hospitals, airports and military installations.&lt;/p&gt; &lt;p&gt;Unlike the flooded lead acid battery, both the SLA and VRLA &#10; are designed with a low over-voltage potential to prohibit &#10; the battery from reaching its gas-generating potential during &#10; charge. Excess charging would cause gassing and water depletion. &#10; Consequently, the SLA and VRLA can never be charged to their &#10; full potential. &lt;/p&gt; &lt;p&gt;Among modern rechargeable batteries, the lead acid battery &#10; family has the lowest energy density. For the purpose of analysis, &#10; we use the term ‘sealed lead acid’ to describe the lead acid &#10; batteries for portable use and ‘valve regulated lead acid’ &#10; for stationary applications. Because of our focus on portable &#10; batteries, we focus mainly on&amp;nbsp;the&amp;nbsp;SLA.&lt;/p&gt; &lt;p&gt;&lt;img src="https://technick.net/img/guide_bpw2/c02_02.gif" width="170" height="93" border="0" alt="Text Box: The SLA must always be stored in a charged state." align="left" hspace="19" vspace="19" /&gt;&lt;/p&gt;The &#10; SLA is not subject to memory. Leaving the battery on float &#10; charge for a prolonged time does not cause damage. The battery’s &#10; charge retention is best among rechargeable batteries. Whereas &#10; the NiCd self-discharges approximately 40&amp;nbsp;percent of &#10; its stored energy in three months, the SLA self-discharges &#10; the same amount in one year. The SLA is relatively inexpensive &#10; to purchase but the operational costs can be more expensive &#10; than the NiCd if full cycles are required on a repetitive &#10; basis. &lt;p&gt;The SLA does not lend itself to fast charging — typical charge &#10; times are 8&amp;nbsp;to&amp;nbsp;16&amp;nbsp;hours. The SLA must always &#10; be stored in a charged state. Leaving the battery in a discharged &#10; condition causes sulfation, a condition that makes the battery &#10; difficult, if not impossible, to recharge.&lt;/p&gt; &lt;p&gt;Unlike the NiCd, the SLA does not like deep cycling. A full &#10; discharge causes extra strain and each discharge/charge cycle &#10; robs the battery of a small amount of capacity. This loss &#10; is very small while the battery is in good operating condition, &#10; but becomes more acute once the performance drops below 80&amp;nbsp;percent &#10; of its nominal capacity. This wear-down characteristic also &#10; applies to other battery chemistries in varying degrees. To &#10; prevent the battery from being stressed through repetitive &#10; deep discharge, a larger SLA battery is recommended.&lt;/p&gt; &lt;p&gt;Depending on the depth of discharge and operating temperature, &#10; the SLA provides 200&amp;nbsp;to 300&amp;nbsp;discharge/charge cycles. &#10; The primary reason for its relatively short cycle life is &#10; grid corrosion of the positive electrode, depletion of the &#10; active material and expansion of the positive plates. These &#10; changes are most prevalent at higher operating temperatures. &#10; Applying charge/discharge cycles does not prevent or reverse &#10; the&amp;nbsp;trend.&lt;/p&gt; &lt;p&gt;There are some methods that improve the performance and prolong &#10; the life of the SLA. The optimum operating temperature for &#10; a VRLA battery is 25&amp;deg;C (77&amp;deg;F). As a rule of thumb, every 8&amp;deg;C &#10; (15&amp;deg;F) rise in temperature will cut the battery life in half. &#10; VRLA that would last for 10&amp;nbsp;years at 25&amp;deg;C would only &#10; be good for 5&amp;nbsp;years if operated at 33&amp;deg;C (95&amp;deg;F). The same &#10; battery would endure a little more than one year at a temperature &#10; of 42&amp;deg;C (107&amp;deg;F).&lt;/p&gt; &lt;table border="0" cellspacing="0" cellpadding="3"&gt; &lt;tr&gt; &#10; &lt;td width="482" colspan="2" valign="top"&gt; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="482" colspan="2" valign="top" bgcolor="#E6E6E6"&gt; &#10; &lt;p align="center"&gt;&lt;b&gt;Advantages &#10; and Limitations of Lead Acid Batteries&lt;/b&gt;&lt;/p&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="482" colspan="2" valign="top"&gt; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="65" valign="top"&gt; &#10; &lt;p&gt;&lt;b&gt;Advantages&lt;/b&gt;&lt;/p&gt; &lt;/td&gt; &lt;td width="417" valign="top"&gt; &#10; &lt;p&gt;Inexpensive and simple to manufacture — in terms &#10; of cost per watt hours, the SLA is the least expensive.&lt;/p&gt; &lt;p&gt;Mature, reliable and well-understood technology — &#10; when used correctly, the SLA is durable and provides &#10; dependable service.&lt;/p&gt; &lt;p&gt;Low self-discharge —the self-discharge rate is &#10; among the lowest in rechargeable batterysystems.&lt;/p&gt; &lt;p&gt;Low maintenance requirements — no memory; no electrolyte &#10; to fill.&lt;/p&gt; &lt;p&gt;Capable of high discharge rates.&lt;/p&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="65" valign="top" bgcolor="#F3F3F3"&gt; &#10; &lt;p&gt;&lt;b&gt;Limitations&lt;/b&gt;&lt;/p&gt; &lt;/td&gt; &lt;td width="417" valign="top" bgcolor="#F3F3F3"&gt; &#10; &lt;p&gt;Cannot be stored in a discharged condition.&lt;/p&gt; &lt;p&gt;Low energy density — poor weight-to-energy density &#10; limits use to stationary and wheeled applications.&lt;/p&gt; &lt;p&gt;Allows only a limited number of full discharge cycles &#10; — well suited for standby applications that require &#10; only occasional deep discharges.&lt;/p&gt; &lt;p&gt;Environmentally unfriendly — the electrolyte and &#10; the lead content can cause environmental damage.&lt;/p&gt; &lt;p&gt;Transportation restrictions on flooded lead acid — &#10; there are environmental concerns regarding spillage &#10; in case of an accident.&lt;/p&gt; &lt;p&gt;Thermal runaway can occur with improper charging.&lt;/p&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td colspan="2" valign="top"&gt; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;p&gt;&lt;a name="_Toc507815237" class="caption"&gt;Figure&amp;nbsp;2-4:&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; &#10; Advantages and limitations of lead acid batteries.&lt;/a&gt;&lt;/p&gt; &lt;p&gt;The SLA has a relatively low energy density compared with &#10; other rechargeable batteries, making it unsuitable for handheld &#10; devices that demand compact size. In addition, performance &#10; at low temperatures is greatly reduced.&lt;/p&gt; &lt;p&gt;The SLA is rated at a 5-hour discharge or 0.2C. Some batteries &#10; are even rated at a slow 20&amp;nbsp;hour discharge. Longer discharge &#10; times produce higher capacity readings. The SLA performs well &#10; on high pulse currents. During these pulses, discharge rates &#10; well in excess of 1C can be&amp;nbsp;drawn.&lt;/p&gt; &lt;p&gt;In terms of disposal, the SLA is less harmful than the NiCd &#10; battery but the high lead content makes the SLA environmentally &#10; unfriendly. Ninety percent of lead acid-based batteries are &#10; being recycled.&lt;a name="_Toc366986328"&gt;&lt;/a&gt;&lt;a name="_Toc366986405"&gt;&lt;/a&gt;&lt;a name="_Toc366986471"&gt;&lt;/a&gt;&lt;a name="_Toc366987102"&gt;&lt;/a&gt;&lt;a name="_Toc366987147"&gt;&lt;/a&gt;&lt;a name="_Toc366987188"&gt;&lt;/a&gt;&lt;a name="_Toc387644047"&gt;&lt;/a&gt;&lt;a name="_Ref503245262"&gt;&lt;/a&gt;&lt;a name="_Ref503245269"&gt;&lt;/a&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>02. Battery Chemistries 6</title><link>https://technick.net/guides/electronics/bpw/c02_06/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c02_06/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c02_05"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c02_07"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;2.5 The Lithium Ion Battery&lt;/h4&gt;&lt;p&gt;&lt;a name="_Toc507909151"&gt;&lt;/a&gt; &lt;/p&gt;&lt;p&gt;Pioneer work with the lithium battery began in 1912 under &#10; G.N.&amp;nbsp;Lewis but it was not until the early 1970s that &#10; the first non-rechargeable lithium batteries became commercially &#10; available. Attempts to develop rechargeable lithium batteries &#10; followed in the 1980s, but failed due to safety problems.&lt;/p&gt; &lt;p&gt;Lithium is the lightest of all metals, has the greatest electrochemical &#10; potential and provides the largest energy density per weight. &#10; Rechargeable batteries using lithium metal anodes (negative &#10; electrodes) are capable of providing both high voltage and &#10; excellent capacity, resulting in an extraordinary high energy &#10; density.&lt;/p&gt; &lt;p&gt;After much research on rechargeable lithium batteries during &#10; the 1980s, it was found that cycling causes changes on the &#10; lithium electrode. These transformations, which are part of &#10; normal wear and tear, reduce the thermal stability, causing &#10; potential thermal runaway&amp;nbsp;conditions. When this occurs, the &#10; cell temperature quickly approaches the melting point of lithium, &#10; resulting in a violent reaction called ‘venting with flame’. &#10; A large quantity of rechargeable lithium batteries sent to &#10; Japan had to be recalled in 1991 after a battery in a mobile &#10; phone released flaming gases and inflicted burns to a person’s &#10; face.&lt;/p&gt; &lt;p&gt;Because of the inherent instability of lithium metal, especially &#10; during charging, research shifted to a non-metallic lithium &#10; battery using lithium ions. Although slightly lower in energy &#10; density than lithium metal, the Li-ion is safe, provided &#10; certain precautions are met when charging and discharging. &#10; In 1991, the Sony Corporation commercialized the first Li-ion &#10; battery. Other manufacturers followed suit. Today, the Li-ion &#10; is the fastest growing and most promising battery chemistry.&lt;/p&gt; &lt;p&gt;The energy density&amp;nbsp;of the Li-ion is typically twice &#10; that of the standard NiCd. Improvements in electrode active &#10; materials have the potential of increasing the energy density &#10; close to three times that of the NiCd. In addition to high &#10; capacity, the load characteristics are reasonably good and &#10; behave similarly to the NiCd in terms of discharge characteristics &#10; (similar shape of discharge profile, but different voltage). &#10; The flat discharge curve offers effective utilization of the &#10; stored power in a desirable voltage spectrum.&lt;/p&gt; &lt;p&gt;The Li-ion is a low maintenance battery, an advantage &#10; that most other chemistries cannot claim. There is no memory &#10; and no scheduled cycling is required to prolong the battery’s &#10; life. In addition, the self-discharge is less than half compared &#10; to NiCd and NiMH, making the Li-ion well suited for &#10; modern fuel gauge applications.&lt;/p&gt; &lt;p&gt;The high cell voltage of Li-ion allows the manufacture &#10; of battery packs consisting of only one cell. Many of today’s &#10; mobile phones run on a single cell, an advantage that simplifies &#10; battery design. Supply voltages of electronic applications &#10; have been heading lower, which in turn requires fewer cells &#10; per battery pack. To maintain the same power, however, higher &#10; currents are needed. This emphasizes the importance of very &#10; low cell resistance to allow unrestricted flow of current.&lt;/p&gt; &lt;p&gt;&lt;b&gt;Chemistry variations&lt;/b&gt; — During recent years, several &#10; types of Li-ion batteries have emerged with only one &#10; thing in common — the catchword 'lithium'. Although strikingly &#10; similar on the outside, lithium-based batteries can vary widely. &#10; This book addresses the lithium-based batteries that are predominantly &#10; used in commercial products.&lt;/p&gt; &lt;p&gt;Sony’s original version of the Li-ion used coke, a &#10; product of coal, as the negative electrode. Since 1997, most &#10; Li-ions (including Sony’s) have shifted to graphite. &#10; This electrode provides a flatter discharge voltage curve &#10; than coke and offers a sharp knee bend at the end of discharge &#10; (see Figure&amp;nbsp;2-5). As a result, the graphite system &#10; delivers the stored energy by only having to discharge to &#10; 3.0V/cell, whereas the coke version must be discharged to &#10; 2.5V to get similar runtime. In addition, the graphite&amp;nbsp;version &#10; is capable of delivering a higher discharge current and remains &#10; cooler during charge and discharge than the coke version.&lt;/p&gt; &lt;p&gt;For the positive electrode, two distinct chemistries&amp;nbsp;have &#10; emerged. They are cobalt and spinel&amp;nbsp;(also known as &lt;i&gt;manganese&lt;/i&gt;). &#10; Whereas cobalt&amp;nbsp;has been in use longer, spinel is inherently &#10; safer and more forgiving if abused. Small prismatic spinel &#10; packs for mobile phones may only include a thermal fuse&amp;nbsp;and &#10; temperature sensor. In addition to cost savings on a simplified &#10; protection circuit, the raw material cost for spinel is lower &#10; than that of&amp;nbsp;cobalt.&lt;/p&gt; &lt;p&gt;&lt;img width="461" height="416" src="https://technick.net/img/guide_bpw2/c02_03.gif" v:shapes="_x0000_i1025" border="0" alt="" /&gt;&lt;/p&gt; &lt;p&gt;&lt;a name="_Ref501867234"&gt;&lt;/a&gt;&lt;a name="_Ref501867257"&gt;&lt;/a&gt;&lt;a name="_Ref501934734"&gt;&lt;/a&gt;&lt;a name="_Toc502116684"&gt;&lt;/a&gt;&lt;a name="_Toc507815238"&gt;&lt;span class="caption"&gt;Figure&amp;nbsp;&lt;/span&gt;&lt;/a&gt;&lt;span class="caption"&gt;2-5:&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; &#10; Li-ion discharge characteristics.&lt;br /&gt; &lt;/span&gt;&lt;span class="caption-sub"&gt;The graphite Li-ion only &#10; needs to discharge to 3.0V/cell, whereas the coke version &#10; must be discharged to 2.5V/cell to achieve similar performance.&lt;/span&gt;&lt;/p&gt; &lt;p&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>02. Battery Chemistries 7</title><link>https://technick.net/guides/electronics/bpw/c02_07/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c02_07/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c02_06"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c02_08"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;As a trade-off, spinel offers a slightly lower energy density, &#10; suffers capacity loss at temperatures above 40&amp;deg;C and ages &#10; quicker than cobalt. Figure&amp;nbsp;2-6 compares the advantages &#10; and disadvantages of the two chemistries.&lt;/p&gt; &lt;table border="0" cellspacing="0" cellpadding="3" width="98%"&gt; &lt;tr&gt; &#10; &lt;td colspan="3" valign="top"&gt; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="18%" valign="top" bgcolor="#E6E6E6"&gt;&amp;nbsp; &lt;/td&gt; &lt;td width="40%" valign="top" bgcolor="#E6E6E6"&gt; &lt;b class="table-bolder"&gt;Cobalt&lt;/b&gt;&lt;/td&gt; &lt;td width="40%" valign="top" bgcolor="#E6E6E6"&gt; &lt;b class="table-bolder"&gt;Manganese &#10; (Spinel)&lt;/b&gt;&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td colspan="3" valign="top"&gt; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="18%" valign="top"&gt; &lt;b class="table-bolder"&gt;Energy &#10; density&lt;/b&gt; (Wh/kg)&lt;/td&gt; &lt;td width="40%" valign="top"&gt; 140 &lt;sup&gt;1&lt;/sup&gt;&lt;/td&gt; &lt;td width="40%" valign="top"&gt; 120 &lt;sup&gt;1&lt;/sup&gt;&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="18%" valign="top" bgcolor="#F3F3F3"&gt; &lt;b class="table-bolder"&gt;Safety&lt;/b&gt;&lt;/td&gt; &lt;td width="40%" valign="top" bgcolor="#F3F3F3"&gt; On overcharge, &#10; the cobalt electrode provides extra lithium, which can &#10; form into metallic lithium, causing a potential safety &#10; risk if not protected by a safety circuit.&lt;/td&gt; &lt;td width="40%" valign="top" bgcolor="#F3F3F3"&gt; On overcharge, &#10; the manganese electrode runs out of lithium causing the &#10; cell only to get warm. Safety circuits can be eliminated &#10; for small 1 and 2 cell packs.&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="18%" valign="top"&gt; &lt;b class="table-bolder"&gt;Temperature&lt;/b&gt;&lt;/td&gt; &lt;td width="40%" valign="top"&gt; Wide temperature range. Best &#10; suited for operation at elevated temperature.&lt;/td&gt; &lt;td width="40%" valign="top"&gt; Capacity loss above +40&amp;deg;C. &#10; Not as durable at higher temperatures.&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="18%" valign="top" bgcolor="#F3F3F3"&gt; &lt;b class="table-bolder"&gt;Aging&lt;/b&gt;&lt;/td&gt; &lt;td width="40%" valign="top" bgcolor="#F3F3F3"&gt; Short-term &#10; storage possible. Impedance increases with age. Newer &#10; versions offer longer storage.&lt;/td&gt; &lt;td width="40%" valign="top" bgcolor="#F3F3F3"&gt; Slightly &#10; less than cobalt. Impedance changes little over the life &#10; of the cell. Due to continuous improvements, storage time &#10; is difficult to predict.&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="18%" valign="top"&gt; &lt;b class="table-bolder"&gt;Life &#10; Expectancy&lt;/b&gt;&lt;/td&gt; &lt;td width="40%" valign="top"&gt; 300 cycles, 50% capacity at &#10; 500 cycles.&lt;/td&gt; &lt;td width="40%" valign="top"&gt; May be shorter than cobalt.&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="18%" valign="top" bgcolor="#F3F3F3"&gt; &lt;b class="table-bolder"&gt;Cost&lt;/b&gt;&lt;/td&gt; &lt;td width="40%" valign="top" bgcolor="#F3F3F3"&gt; Raw material &#10; relatively high; protection circuit adds to costs.&lt;/td&gt; &lt;td width="40%" valign="top" bgcolor="#F3F3F3"&gt; Raw material &#10; 30% lower than cobalt. Cost advantage on simplified protection &#10; circuit.&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td colspan="3" valign="top"&gt; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;p&gt;&lt;a name="_Ref501867955"&gt;&lt;/a&gt;&lt;a name="_Toc502116685"&gt;&lt;/a&gt;&lt;a name="_Toc507815239" class="caption"&gt;Figure&amp;nbsp;2-6:&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; Comparison of cobalt &#10; and manganese as positive electrodes.&lt;/a&gt;&lt;br /&gt; &lt;span class="caption-sub"&gt;Manganese is inherently safer and &#10; more forgiving if abused but offers a slightly lower energy &#10; density. Manganese suffers capacity loss at temperature above &#10; 40&amp;deg;C and ages quicker than cobalt.&lt;/span&gt;&lt;/p&gt; &lt;p&gt;Based on present generation 18650 cells. The energy density &#10; tends to be lower for prismatic cells.&lt;/p&gt; &lt;p&gt;The choice of metals, chemicals and additives help balance &#10; the critical trade-off between high energy density, long storage &#10; time, extended cycle life and safety. High energy densities &#10; can be achieved with relative ease. For example, adding more &#10; nickel in lieu of cobalt increases the ampere/hours rating &#10; and lowers the manufacturing cost but makes the cell less &#10; safe. While a start-up company may focus on high energy density &#10; to gain quick market acceptance, safety, cycle life and storage &#10; capabilities may be compromised. Reputable manufacturers, &#10; such as Sony, Panasonic, Sanyo, Moli Energy and Polystor place &#10; high importance on safety. Regulatory authorities assure that &#10; only safe batteries are sold to the public.&lt;/p&gt; &lt;p&gt;Li-ion cells cause less harm when disposed of than &#10; lead or cadmium-based batteries. Among the Li-ion family, &#10; the spinel is the friendliest in terms of disposal.&lt;/p&gt; &lt;p&gt;Despite its overall advantages, Li-ion also has its &#10; drawbacks. It is fragile and requires a protection circuit&amp;nbsp;to &#10; maintain safe operation. Built into each pack, the protection &#10; circuit limits the peak voltage of each cell during charge &#10; and prevents the cell voltage from dropping too low on discharge. &#10; In addition, the maximum charge and discharge current is limited &#10; and the cell temperature is monitored to prevent temperature &#10; extremes. With these precautions in place, the possibility &#10; of metallic lithium plating occurring due to overcharge is &#10; virtually eliminated.&lt;/p&gt; &lt;p&gt;Aging is a concern with most Li-ion batteries. For &#10; unknown reasons, battery manufacturers are silent about this &#10; issue. Some capacity deterioration is noticeable after one &#10; year, whether the battery is in use or not. Over two or perhaps &#10; three years, the battery frequently fails. It should be mentioned &#10; that other chemistries also have age-related degenerative &#10; effects. This is especially true for the NiMH if exposed to &#10; high ambient temperatures.&lt;/p&gt; &lt;p&gt;Storing the battery in a cool place slows down the aging &#10; process of the Li-ion (and other chemistries). Manufacturers &#10; recommend storage temperatures of 15&amp;deg;C (59&amp;deg;F). In addition, &#10; the battery should only be partially charged when in storage.&lt;/p&gt; &lt;p&gt;Extended storage is not recommended for Li-ion batteries. &#10; Instead, packs should be rotated. The buyer should be aware &#10; of the manufacturing date when purchasing a replacement Li-ion &#10; battery. Unfortunately, this information is often encoded &#10; in an encrypted serial number and is only available to the &#10; manufacturer.&lt;/p&gt; &lt;p&gt;Manufacturers are constantly improving the chemistry of the &#10; Li-ion battery. Every six months, a new and enhanced &#10; chemical combination is tried. With such rapid progress, it &#10; becomes difficult to assess how well the revised battery ages &#10; and how it performs after long-term storage.&lt;/p&gt; &lt;p&gt;&lt;b&gt;Cost analysis&lt;/b&gt; — The most economical lithium-based &#10; battery in terms of cost-to-energy ratio is a pack using the &#10; cylindrical 18650&amp;nbsp;cell. This battery is somewhat bulky &#10; but suitable for portable applications such as mobile computing. &#10; If a slimmer pack is required (thinner than 18&amp;nbsp;mm), the &#10; prismatic Li-ion cell is the best choice. There is little &#10; or no gain in energy density per weight and size over the &#10; 18650, however the cost is more than double.&lt;/p&gt; &lt;p&gt;If an ultra-slim geometry is needed (less than 4&amp;nbsp;mm), &#10; the best choice is Li-ion polymer. This is the most &#10; expensive option in terms of energy cost. The Li-ion &#10; polymer does not offer appreciable energy gains over conventional &#10; Li-ion systems, nor does it match the durability of &#10; the 18560&amp;nbsp;cell.&lt;br /&gt; &lt;br /&gt; &lt;/p&gt; &lt;table border="0" cellspacing="0" cellpadding="3"&gt; &lt;tr&gt; &#10; &lt;td width="482" colspan="2" valign="top"&gt; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="482" colspan="2" valign="top" bgcolor="#E6E6E6"&gt; &#10; &lt;p align="center"&gt;&lt;b&gt;Advantages &#10; and Limitations of Li-ion Batteries&lt;/b&gt;&lt;/p&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="482" colspan="2" valign="top"&gt; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="65" valign="top"&gt; &#10; &lt;p&gt;&lt;b&gt;Advantages&lt;/b&gt;&lt;/p&gt; &lt;/td&gt; &lt;td width="417" valign="top"&gt; &#10; &lt;p&gt;High energy density — potential for yet higher capacities.&lt;/p&gt; &lt;p&gt;Relatively low self-discharge — self-discharge is less &#10; than half that of NiCd and NiMH.&lt;/p&gt; &lt;p&gt;Low Maintenance — no periodic discharge is needed; &#10; no memory.&lt;/p&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="65" valign="top" bgcolor="#F3F3F3"&gt; &#10; &lt;p&gt;&lt;b&gt;Limitations&lt;/b&gt;&lt;/p&gt; &lt;/td&gt; &lt;td width="417" valign="top" bgcolor="#F3F3F3"&gt; &#10; &lt;p&gt;Requires protection circuit — protection circuit limits &#10; voltage and current. Battery is safe if not provoked.&lt;/p&gt; &lt;p&gt;Subject to aging, even if not in use — storing the &#10; battery in a cool place and at 40&amp;nbsp;percent state-of-charge &#10; reduces the aging effect.&lt;/p&gt; &lt;p&gt;Moderate discharge current.&lt;/p&gt; &lt;p&gt;Subject to transportation regulations — shipment of &#10; larger quantities of Li-ion batteries may be subject &#10; to regulatory control. This restriction does not apply &#10; to personal carry-on batteries.&lt;/p&gt; &lt;p&gt;Expensive to manufacture — about 40&amp;nbsp;percent higher &#10; in cost than NiCd. Better manufacturing techniques and &#10; replacement of rare metals with lower cost alternatives &#10; will likely reduce the price.&lt;/p&gt; &lt;p&gt;Not fully mature — changes in metal and chemical combinations &#10; affect battery test results, especially with some quick &#10; test methods.&lt;/p&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td colspan="2" valign="top"&gt; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;p&gt;&lt;a name="_Toc507815240" class="caption"&gt;Figure&amp;nbsp;2-7:&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; &#10; Advantages and limitations of Li-ion batteries.&lt;/a&gt;&lt;/p&gt; &lt;p&gt;&lt;span class="warning"&gt;Caution:&lt;/span&gt; Li-ion batteries have &#10; a high energy density. Exercise precaution when handling and &#10; testing. Do not short circuit, overcharge, crush, drop, mutilate, &#10; penetrate, apply reverse polarity, expose to high temperature &#10; or disassemble. Only use the Li-ion battery with the designated &#10; protection circuit. High case temperature resulting from abuse &#10; of the cell could cause physical injury. The electrolyte is &#10; highly flammable. Rupture may cause venting with flame.&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>02. Battery Chemistries 8</title><link>https://technick.net/guides/electronics/bpw/c02_08/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c02_08/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c02_07"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c02_09"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;2.6 The Lithium Polymer Battery&lt;/h4&gt;&lt;p&gt;&lt;a name="_Toc507909152"&gt;&lt;/a&gt; &lt;/p&gt;&lt;p&gt;The Li-polymer differentiates itself from other battery systems &#10; in the type of electrolyte used. The original design, dating &#10; back to the 1970s, uses a dry solid polymer electrolyte only. &#10; This electrolyte resembles a plastic-like film that does not &#10; conduct electricity but allows an exchange of ions (electrically &#10; charged atoms or groups of atoms). The polymer electrolyte &#10; replaces the traditional porous separator, which is soaked &#10; with electrolyte.&lt;/p&gt; &lt;p&gt;The dry polymer design offers simplifications with respect &#10; to fabrication, ruggedness, safety and thin-profile geometry. &#10; There is no danger of flammability because no liquid or gelled &#10; electrolyte is used.&lt;/p&gt; &lt;p&gt;With a cell thickness measuring as little as one millimeter &#10; (0.039&amp;nbsp;inches), equipment designers are left to their &#10; own imagination in terms of form, shape and size. It is possible &#10; to create designs which form part of a protective housing, &#10; are in the shape of a mat that can be rolled up, or are even &#10; embedded into a carrying case or piece of clothing. Such innovative &#10; batteries are still a few years away, especially for the commercial &#10; market.&lt;/p&gt; &lt;p&gt;Unfortunately, the dry Li-polymer suffers from poor conductivity. &#10; Internal resistance is too high and cannot deliver the current &#10; bursts needed for modern communication devices and spinning &#10; up the hard drives of mobile computing equipment. Although &#10; heating the cell to 60&amp;deg;C (140&amp;deg;F) and higher increases the &#10; conductivity to acceptable levels, this requirement is unsuitable &#10; in commercial applications.&lt;/p&gt; &lt;p&gt;Research is continuing to develop a dry solid Li-polymer &#10; battery that performs at room temperature. A dry solid Li-polymer &#10; version is expected to be commercially available by 2005. &#10; It is expected to be very stable; would run 1000&amp;nbsp;full &#10; cycles and would have higher energy densities than today’s &#10; Li-ion battery.&lt;/p&gt; &lt;p&gt;In the meantime, some Li-polymers are used as standby batteries &#10; in hot climates. One manufacturer has added heating elements &#10; that keeps the battery in the conductive temperature range &#10; at all times. Such a battery performs well for the application &#10; intended because high ambient temperatures do not affect the &#10; service life of this battery in the same way it does the VRLA, &#10; for example.&lt;/p&gt; &lt;p&gt;To make a small Li-polymer battery conductive, some gelled &#10; electrolyte has been added. Most of the commercial Li-polymer &#10; batteries used today for mobile phones are a hybrid and contain &#10; gelled electrolyte. The correct term for this system is ‘Lithium &#10; Ion Polymer’. For promotional reasons, most battery manufacturers &#10; mark the battery simply as Li-polymer. Since the hybrid lithium &#10; polymer is the only functioning polymer battery for portable &#10; use today, we will focus on this chemistry.&lt;/p&gt; &lt;p&gt;With gelled electrolyte added, what then is the difference &#10; between Li-ion and Li-ion polymer? Although the &#10; characteristics and performance of the two systems are very &#10; similar, the Li-ion polymer is unique in that it uses &#10; a solid electrolyte, replacing the porous separator. The gelled &#10; electrolyte is simply added to enhance ion conductivity.&lt;/p&gt; &lt;p&gt;Technical difficulties and delays in volume manufacturing &#10; have deferred the introduction of the Li-ion polymer &#10; battery. This postponement, as some critics argue, is due &#10; to ‘cashing in’ on the Li-ion battery. Manufacturers &#10; have invested heavily in research, development and equipment &#10; to mass-produce the Li-ion. Now businesses and shareholders &#10; want to see a return on their investment.&lt;/p&gt; &lt;p&gt;In addition, the promised superiority of the Li-ion &#10; polymer has not yet been realized. No improvements in capacity &#10; gains have been achieved — in fact, the capacity is slightly &#10; less than that of the standard Li-ion battery. For the &#10; present, there is no cost advantage in using the Li-ion &#10; polymer battery. The thin profile has, however, compelled &#10; mobile phone manufacturers to use this promising technology &#10; for their new generation handsets.&lt;/p&gt; &lt;p&gt;One of the advantages of the Li-ion polymer, however, &#10; is simpler packaging because the electrodes can easily be &#10; stacked. Foil packaging, similar to that used in the food &#10; industry, is being used. No defined norm in cell size has &#10; been established by the industry.&lt;br /&gt; &lt;br /&gt; &lt;/p&gt; &lt;table border="0" cellspacing="0" cellpadding="3"&gt; &lt;tr&gt; &#10; &lt;td width="482" colspan="2" valign="top"&gt; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="482" colspan="2" valign="top" bgcolor="#E6E6E6"&gt; &#10; &lt;p align="center"&gt;&lt;b&gt;Advantages &#10; and Limitations of Li-ion Polymer Batteries&lt;/b&gt;&lt;/p&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="482" colspan="2" valign="top"&gt; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="65" valign="top"&gt; &#10; &lt;p&gt;&lt;b&gt;Advantages&lt;/b&gt;&lt;/p&gt; &lt;/td&gt; &lt;td width="417" valign="top"&gt; &#10; &lt;p&gt;Very low profile — batteries that resemble the profile &#10; of a credit card are feasible.&lt;/p&gt; &lt;p&gt;Flexible form factor — manufacturers are not bound &#10; by standard cell formats. With high volume, any reasonable &#10; size can be produced economically.&lt;/p&gt; &lt;p&gt;Light weight – gelled rather than liquid electrolytes &#10; enable simplified packaging, in some cases eliminating &#10; the metal shell.&lt;/p&gt; &lt;p&gt;Improved safety — more resistant to overcharge; less &#10; chance for electrolyte leakage.&lt;/p&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="65" valign="top" bgcolor="#F3F3F3"&gt; &#10; &lt;p&gt;&lt;b&gt;Limitations&lt;/b&gt;&lt;/p&gt; &lt;/td&gt; &lt;td width="417" valign="top" bgcolor="#F3F3F3"&gt; &#10; &lt;p&gt;Lower energy density and decreased cycle count compared &#10; to Li-ion — potential for improvements exist.&lt;/p&gt; &lt;p&gt;Expensive to manufacture — once mass-produced, the &#10; Li-ion polymer has the potential for lower cost. Reduced &#10; control circuit offsets higher manufacturing costs.&lt;/p&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td colspan="2" valign="top"&gt; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;p&gt;&lt;a name="_Toc366986279"&gt;&lt;/a&gt;&lt;a name="_Toc366986330"&gt;&lt;/a&gt;&lt;a name="_Toc366986407"&gt;&lt;/a&gt;&lt;a name="_Toc366986473"&gt;&lt;/a&gt;&lt;a name="_Toc366987104"&gt;&lt;/a&gt;&lt;a name="_Toc366987149"&gt;&lt;/a&gt;&lt;a name="_Toc366987190"&gt;&lt;/a&gt;&lt;a name="_Toc387644049"&gt;&lt;/a&gt;&lt;a name="_Toc507815241"&gt;&lt;span class="caption"&gt;Figure&amp;nbsp;2-8:&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; Advantages &#10; and limitations of Li-ion polymer batteries&lt;/span&gt;.&lt;/a&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>02. Battery Chemistries 9</title><link>https://technick.net/guides/electronics/bpw/c02_09/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c02_09/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c02_08"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c02_10"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;2.7 Reusable Alkaline Batteries&lt;/h4&gt;&lt;p&gt;&lt;a name="_Toc507909153"&gt;&lt;/a&gt; &lt;/p&gt;&lt;p&gt;The idea of recharging alkaline batteries is not new. Although &#10; not endorsed by manufacturers, ordinary alkaline batteries &#10; have been recharged in households for many years. Recharging &#10; these batteries is only effective, however, if the cells have &#10; been discharged to less than 50&amp;nbsp;percent of their total &#10; capacity. The number of recharges depends solely on the depth &#10; of discharge and is limited to a few at best. With each recharge, &#10; less capacity can be reclaimed. There is a cautionary advisory, &#10; however: charging ordinary alkaline batteries may generate &#10; hydrogen gas, which can lead to explosion. It is therefore &#10; not prudent to charge ordinary alkaline unsupervised.&lt;/p&gt; &lt;p&gt;In comparison, the reusable alkaline is designed for repeated &#10; recharge. It too loses charge acceptance with each recharge. &#10; The longevity of the reusable alkaline is a direct function &#10; of the depth of discharge; the deeper the discharge, the fewer &#10; cycles the battery can endure.&lt;/p&gt; &lt;p&gt;Tests performed by Cadex on ‘AA’ reusable alkaline cells &#10; showed a very high capacity reading on the first discharge. &#10; In fact, the energy density was similar to that of a NiMH &#10; battery. When the battery was discharged, then later recharged &#10; using the manufacturer’s charger, the reusable alkaline settled &#10; at 60&amp;nbsp;percent, a capacity slightly below that of a NiCd. &#10; Repeat cycling in the same manner resulted in a fractional &#10; capacity loss with each cycle. In our tests, the discharge &#10; current was adjusted to 200mA (0.2&amp;nbsp;C-rate, or one &#10; fifth of the rated capacity); the end-of-discharge threshold &#10; was set to&amp;nbsp;1V/cell.&lt;/p&gt; &lt;p&gt;An additional limitation of the reusable alkaline system &#10; is its low load current capability of 400mA (lower than 400mA &#10; provides better results). Although adequate for portable AM/FM &#10; radios, CD players, tape players and flashlights, 400mA is &#10; insufficient to power most mobile phones and video cameras.&lt;/p&gt; &lt;p&gt;The reusable alkaline is inexpensive but the cost per cycle &#10; is high when compared to the nickel-based rechargeables. Whereas &#10; the NiCd checks in at $0.04&amp;nbsp;per cycle based on 1500&amp;nbsp;cycles, &#10; the reusable alkaline costs $0.50&amp;nbsp;based on 10&amp;nbsp;full &#10; discharge cycles. For many applications, this seemingly high &#10; cost is still economical when compared to the non-reusable &#10; alkaline that has a one-time use. If the reusable alkaline &#10; battery is only partially discharged before recharge, an improved &#10; cycle life is possible. At 50&amp;nbsp;percent depth of discharge, &#10; 50&amp;nbsp;cycles can be expected.&lt;/p&gt; &lt;p&gt;To compare the operating cost between the standard and reusable &#10; alkaline, a study was done on flashlight batteries for hospital &#10; use. The low-intensity care unit using the flashlights &#10; only occasionally achieved measurable savings by employing &#10; the reusable alkaline. The high-intensity unit that used the &#10; flashlights constantly, on the other hand, did not attain &#10; the same result. Deeper discharge and more frequent recharge &#10; reduced their service life and offset any cost advantage over &#10; the standard alkaline battery.&lt;/p&gt; &lt;p&gt;In summary, the standard alkaline offers maximum energy density &#10; whereas the reusable alkaline provides the benefit of allowing &#10; some recharging. The compromise of the reusable alkaline is &#10; loss of charge acceptance after the first recharge.&lt;br /&gt; &lt;br /&gt; &lt;/p&gt; &lt;table border="0" cellspacing="0" cellpadding="3"&gt; &lt;tr&gt; &#10; &lt;td width="482" colspan="2" valign="top"&gt; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="482" colspan="2" valign="top" bgcolor="#E6E6E6"&gt; &#10; &lt;p align="center"&gt;&lt;b&gt;Advantages &#10; and Limitations of Reusable Alkaline Batteries&lt;/b&gt;&lt;/p&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="482" colspan="2" valign="top"&gt; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="65" valign="top"&gt; &#10; &lt;p&gt;&lt;b&gt;Advantages&lt;/b&gt;&lt;/p&gt; &lt;/td&gt; &lt;td width="417" valign="top"&gt; &#10; &lt;p&gt;Inexpensive and readily available — can be used as &#10; a direct replacement of non-rechargeable (primary) cells.&lt;/p&gt; &lt;p&gt;More economical than non-rechargeable – allows several &#10; recharges.&lt;/p&gt; &lt;p&gt;Low self-discharge — can be stored as a standby battery &#10; for up to 10&amp;nbsp;years.&lt;/p&gt; &lt;p&gt;Environmentally friendly — no toxic metals used, fewer &#10; batteries are discarded, reduces landfill.&lt;/p&gt; &lt;p&gt;Maintenance free — no need for cycling; no memory.&lt;/p&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="65" valign="top" bgcolor="#F3F3F3"&gt; &#10; &lt;p&gt;&lt;b&gt;Limitations&lt;/b&gt;&lt;/p&gt; &lt;/td&gt; &lt;td width="417" valign="top" bgcolor="#F3F3F3"&gt; &#10; &lt;p&gt;Limited current handling — suited for light-duty applications &#10; like portable home entertainment, flashlights.&lt;/p&gt; &lt;p&gt;Limited cycle life — for best results, recharge before &#10; the battery gets too low.&lt;/p&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td colspan="2" valign="top"&gt; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;p&gt;&lt;a name="_Toc507815242" class="caption"&gt;Figure&amp;nbsp;2-9:&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; &#10; Advantages and limitations of reusable alkaline batteries.&lt;/a&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>02. Relation to Stochastic Processes</title><link>https://technick.net/guides/theory/edft/002/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/edft/002/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/filters/"&gt;Introduction to Digital Filters with Audio Applications&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, Copyright &amp;#169; &lt;i&gt;2017-11-26&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/edft/001"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/000"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/022"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/003"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;Relation to Stochastic Processes&lt;/h3&gt;&lt;p&gt;&lt;b&gt;Theorem. &lt;/b&gt; If a stationary random process &lt;img width="44" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img113.gif" alt="$\" x="" /&gt; has a rational power spectral &#10; density &lt;!-- MATH&#10; $R(e^{j\omega})$&#10; --&gt;&lt;img width="58" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img114.gif" alt="$R(e^{j\" mega="" /&gt; corresponding to an autocorrelation function&#10; &lt;!-- MATH&#10; $r(k)={\cal E}\left\{x_nx_{n+k}\right\}$&#10; --&gt;&lt;img width="155" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img115.gif" alt="$r(k)={\" al="" eft\="" nx="" k="" ight\="" /&gt;, then &#10; &lt;br /&gt;&lt;/p&gt;</description></item><item><title>03. Relation to Schur Functions</title><link>https://technick.net/guides/theory/edft/003/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/edft/003/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/filters/"&gt;Introduction to Digital Filters with Audio Applications&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, Copyright &amp;#169; &lt;i&gt;2017-11-26&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/edft/002"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/000"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/022"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/004"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;Relation to Schur Functions&lt;/h3&gt;&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;A &lt;i&gt;&lt;a href="https://technick.net/guides/theory/edft/003"&gt;Schur function&lt;/a&gt;&lt;/i&gt;&lt;a name="2243"&gt;&lt;/a&gt; &lt;img width="41" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img134.gif" alt="$S(z)$" /&gt;is defined as a complex function analytic and of modulus not exceeding&#10;unity in &lt;img width="60" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img135.gif" alt="$\" ert="" ert\leq="" /&gt;.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Theorem. &lt;/b&gt;The function&lt;br /&gt;&lt;/p&gt;</description></item><item><title>03. The Battery Pack</title><link>https://technick.net/guides/electronics/bpw/c03_01/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c03_01/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c02_09"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c03_02"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;3. The Battery Pack&lt;/h3&gt;&lt;p&gt; &#10; &lt;/p&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;In the 1700 and 1800s, cells were encased in glass jars. &#10; Later, larger batteries were developed that used wooden containers. &#10; The inside was treated with a sealant to prevent electrolyte &#10; leakage. With the need for portability, the cylindrical cell &#10; appeared. After World War II, these cells became the standard &#10; format for smaller, rechargeable batteries.&lt;/p&gt; &lt;p class="MsoNormal"&gt;Downsizing required smaller and more compact &#10; cell design. The button cell, which gained popularity in the &#10; 1980s, was a first attempt to achieve a reasonably flat geometry, &#10; or obtain higher voltages in a compact profile by stacking. &#10; The early 1990s brought the prismatic cell, which was followed &#10; by the modern pouch&amp;nbsp;cell.&lt;/p&gt; &lt;p class="MsoNormal"&gt;This chapter addresses the cell designs, &#10; pack configurations and intrinsic safety devices. In keeping &#10; with portability, this book addresses only the smaller cells &#10; used for portable batteries.&lt;/p&gt;&lt;a name="_Toc507909156"&gt;&lt;/a&gt;&lt;h4&gt;3.1 The Cylindrical Cell &lt;p class="MsoNormal"&gt;The cylindrical cell continues to be the &#10; most widely used packaging style. The advantages are ease &#10; of manufacture and good mechanical stability. The cylinder &#10; has the ability to withstand high internal pressures. While &#10; charging, the cell pressure of a NiCd can reach 1379&amp;nbsp;kilopascals &#10; (kPa) or 200&amp;nbsp;pounds per square inch (psi). A venting &#10; system is added on one end of the cylinder. Venting occurs &#10; if the cell pressure reaches between 150 and 200&amp;nbsp;psi. &#10; Figure&amp;nbsp;3-1 illustrates the conventional cell of &#10; a NiCd battery.&lt;/p&gt; &lt;p class="MsoNormal"&gt;&lt;img width="383" height="307" src="https://technick.net/img/guide_bpw2/c03_01.gif" v:shapes="_x0000_i1027" border="0" alt="" /&gt;&lt;/p&gt; &lt;p class="MsoNormal"&gt;&lt;a name="_Ref501870117"&gt;&lt;/a&gt;&lt;a name="_Toc502116686"&gt;&lt;/a&gt;&lt;a name="_Toc507815244" class="caption"&gt;Figure&amp;nbsp;3-1:&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; Cross-section of a &#10; classic NiCd cell.&lt;/a&gt;&lt;br /&gt; &lt;span class="caption-sub"&gt;The negative and positive plates &#10; are rolled together in a metal cylinder. The positive plate &#10; is sintered and filled with nickel hydroxide. The negative &#10; plate is coated with cadmium active material. A separator &#10; moistened with electrolyte isolates the two plates. Design &#10; courtesy of Panasonic OEM Battery Sales Group, March&amp;nbsp;2001.&lt;/span&gt;&lt;/p&gt; &lt;p class="MsoNormal"&gt;The cylindrical cell is moderately priced &#10; and offers high energy density. Typical applications are wireless &#10; communication, mobile computing, biomedical instruments, power &#10; tools and other uses that do not demand ultra-small&amp;nbsp;size.&lt;/p&gt; &lt;p class="MsoNormal"&gt;NiCd offers the largest selection of cylindrical &#10; cells. A good variety is also available in the NiMH family, &#10; especially in the smaller cell formats. In addition to cylindrical &#10; formats, NiMH also comes in the prismatic cell packaging.&lt;/p&gt; &lt;p class="MsoNormal"&gt;The Li-ion batteries are only available &#10; in limited cells sizes, the most popular being the 18650. &#10; ‘Eighteen’ denotes the diameter in millimeters and ‘650’ describes &#10; the length in millimeters. The 18650&amp;nbsp;cell has a capacity &#10; of 1800&amp;nbsp;to 2000mAh. The larger 26650&amp;nbsp;cell has a &#10; diameter of 26&amp;nbsp;mm and delivers 3200mAh. Because of the &#10; flat geometry of the Li-ion polymer, this battery chemistry &#10; is not available in a cylindrical format.&lt;/p&gt; &lt;p class="MsoNormal"&gt;Most SLA batteries are built in a prismatic &#10; format, thus creating a rectangle box that is commonly made &#10; of plastic materials. There are SLA batteries, however, that &#10; take advantage of the cylindrical design by using a winding &#10; technique that is similar to the conventional cell. The cylindrical &#10; Hawker Cyclone SLA is said to offer improved cell stability, &#10; provide higher discharge currents and have better temperature &#10; stability than the conventional prismatic design.&lt;/p&gt; &lt;p class="MsoNormal"&gt;The drawback of the cylindrical cell is less &#10; than maximum use of space. When stacking the cells, air cavities &#10; are formed. Because of fixed cell size, the pack must be designed &#10; around the available cell&amp;nbsp;size.&lt;/p&gt; &lt;p class="MsoNormal"&gt;Almost all cylindrical cells are equipped &#10; with a venting mechanism to expel excess gases in an orderly &#10; manner. Whereas nickel-based batteries feature a resealable &#10; vent, many cylindrical Li-ion contain a membrane seal &#10; that ruptures if the pressure exceeds 3448&amp;nbsp;kPa (500&amp;nbsp;psi). &#10; There is usually some serious swelling of the cell before &#10; the seal breaks. Venting only occurs under extreme conditions.&lt;/p&gt; &lt;/h4&gt;&lt;/blockquote&gt;</description></item><item><title>03. The Battery Pack 2</title><link>https://technick.net/guides/electronics/bpw/c03_02/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c03_02/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c03_01"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c03_03"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;3.2 The Button Cell&lt;/h4&gt;&lt;p&gt;&lt;a name="_Toc507909157"&gt;&lt;/a&gt; &lt;/p&gt;&lt;p class="MsoNormal"&gt; &lt;/p&gt;&lt;p class="MsoNormal"&gt;The button cell was developed to miniaturize &#10; battery packs and solve stacking problems. Today, this architecture &#10; is limited to a small niche market. Non-rechargeable versions &#10; of the button cell continue to be popular and can be found &#10; in watches, hearing aids and memory backup. &lt;/p&gt; &lt;p class="MsoNormal"&gt;The main applications of the rechargeable &#10; button cell are (or were) older cordless telephones, biomedical &#10; devices and industrial instruments. Although small in design &#10; and inexpensive to manufacture, the main drawback is swelling &#10; if charged too rapidly. Button cells have no safety vent and &#10; can only be charged at a 10&amp;nbsp;to 16&amp;nbsp;hour charge rate. &#10; New designs claim rapid charge capability.&lt;/p&gt; &lt;table border="0" cellspacing="0" cellpadding="0"&gt; &lt;tr&gt; &#10; &lt;td width="217"&gt; &#10; &lt;p class="MsoNormal"&gt;&lt;img width="195" height="156" src="https://technick.net/img/guide_bpw2/c03_02.jpg" v:shapes="_x0000_i1028" border="0" alt="" /&gt;&lt;/p&gt; &lt;/td&gt; &lt;td width="270"&gt; &#10; &lt;p class="MsoNormal"&gt;&lt;img width="216" height="151" src="https://technick.net/img/guide_bpw2/c03_03.jpg" v:shapes="_x0000_i1029" border="0" alt="" /&gt;&lt;/p&gt; &lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;p class="MsoNormal"&gt;&lt;a name="_Ref501870275"&gt;&lt;/a&gt;&lt;a name="_Toc502116687"&gt;&lt;/a&gt;&lt;a name="_Toc507815245" class="caption"&gt;Figure&amp;nbsp;3-2:&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; The button cell.&lt;/a&gt;&lt;br /&gt; &lt;span class="caption-sub"&gt;The button cell offers small size &#10; and ease of stacking but does not allow fast charging. Coin &#10; cells, which are similar in appearance, are normally lithium-based &#10; and are non-rechargeable.&lt;b&gt; &lt;/b&gt;Photograph courtesy of Sanyo &#10; Corporation; design courtesy of Panasonic OEM Battery Sales &#10; Group, March 2001.&lt;/span&gt;&lt;/p&gt;&lt;a name="_Toc507909158"&gt;&lt;/a&gt;&lt;h4&gt;3.3 The Prismatic Cell&lt;/h4&gt; &lt;p class="MsoNormal"&gt;The prismatic cell was developed in response &#10; to consumer demand for thinner pack sizes. Introduced in the &#10; early 1990’s, the prismatic cell makes almost maximum use &#10; of space when stacking. Narrow and elegant battery styles &#10; are possible that suit today’s slim-style geometry. Prismatic &#10; cells are used predominantly for mobile phone applications. &#10; Figure&amp;nbsp;3-3 shows the prismatic&amp;nbsp;cell.&lt;/p&gt; &lt;p class="MsoNormal"&gt;Prismatic cells are most common in the lithium &#10; battery family. The Li-ion polymer is exclusively prismatic. &#10; No universally accepted cell size exists for Li-ion &#10; polymer batteries. One leading manufacturer may bring out &#10; one or more sizes that fit a certain portable device, such &#10; as a mobile phone. While these cells are produced at high &#10; volume, other cell manufacturers follow suit and offer an &#10; identical cell at a competitive price. Prismatic cells that &#10; have gained acceptance are the 340648 and the 340848. Measured &#10; in millimeters, ‘34’ denotes the width, ‘06’ or ‘08’ the thickness &#10; and ‘48’ the length of the&amp;nbsp;cell.&lt;/p&gt; &lt;p class="MsoNormal"&gt;&lt;img width="288" height="268" src="https://technick.net/img/guide_bpw2/c03_04.gif" v:shapes="_x0000_i1025" border="0" alt="" /&gt;&lt;/p&gt; &lt;p class="MsoNormal"&gt;&lt;a name="_Ref501871175"&gt;&lt;/a&gt;&lt;a name="_Toc502116688"&gt;&lt;/a&gt;&lt;a name="_Toc507815246" class="caption"&gt;Figure&amp;nbsp;3-3:&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; Cross-section of a &#10; prismatic cell.&lt;/a&gt;&lt;br /&gt; &lt;span class="caption-sub"&gt;The prismatic cell improves space &#10; utilization and allows more flexibility in pack design. This &#10; cell construction is less cost effective than the cylindrical &#10; equivalent and provides a slightly lower energy density. Design &#10; courtesy of Polystor Corporation, March&amp;nbsp;2001.&lt;/span&gt;&lt;/p&gt; &lt;p class="MsoNormal"&gt;Some prismatic cells are similar in size &#10; but are off by just a small fraction. Such is the case with &#10; the Panasonic cell that measures 34&amp;nbsp;mm by 50&amp;nbsp;mm &#10; and is 6.5&amp;nbsp;mm thick. If a few cubic millimeters can be &#10; added for a given application, the manufacturer will do so &#10; for the sake of higher capacities.&lt;/p&gt; &lt;p class="MsoNormal"&gt;The disadvantage of the prismatic cell is &#10; slightly lower energy densities compared to the cylindrical &#10; equivalent. In addition, the prismatic cell is more expensive &#10; to manufacture and does not provide the same mechanical stability &#10; enjoyed by the cylindrical cell. To prevent bulging when pressure &#10; builds up, heavier gauge metal is used for the container. &#10; The manufacturer allows some degree of bulging when designing &#10; the battery&amp;nbsp;pack.&lt;/p&gt; &lt;p class="MsoNormal"&gt;The prismatic cell is offered in limited &#10; sizes and chemistries and runs from about 400mAh to 2000mAh &#10; and higher. Because of the very large quantities required &#10; for mobile phones, special prismatic cells are built to fit &#10; certain models. Most prismatic cells do not have a venting &#10; system. In case of pressure build-up, the cell starts to bulge. &#10; When correctly used and properly charged, no swelling should&amp;nbsp;occur.&lt;/p&gt; &lt;p class="MsoNormal"&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>03. The Battery Pack 3</title><link>https://technick.net/guides/electronics/bpw/c03_03/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c03_03/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c03_02"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c03_04"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;3.4 The Pouch Cell&lt;/h4&gt;&lt;p&gt;&lt;a name="_Toc507909159"&gt;&lt;/a&gt; &lt;/p&gt;&lt;p class="MsoNormal"&gt;Cell design made a profound advance in 1995 &#10; when the pouch cell concept was developed. Rather than using &#10; an expensive metallic cylinder and glass-to-metal electrical &#10; feed-through to insulate the opposite polarity, the positive &#10; and negative plates are enclosed in flexible, heat-sealable &#10; foils. The electrical contacts consist of conductive foil &#10; tabs that are welded to the electrode and sealed to the pouch &#10; material. Figure&amp;nbsp;3-4 illustrates the pouch&amp;nbsp;cell.&lt;/p&gt; &lt;p class="MsoNormal"&gt;The pouch cell concept allows tailoring to &#10; exact cell dimensions. It makes the most efficient use of &#10; available space and achieves a packaging efficiency of 90&amp;nbsp;to &#10; 95&amp;nbsp;percent, the highest among battery packs. Because &#10; of the absence of a metal can, the pouch pack has a lower &#10; weight. The main applications are mobile phones and military &#10; devices. No standardized pouch cells exist, but rather, each &#10; manufacturer builds to a special application.&lt;/p&gt; &lt;p class="MsoNormal"&gt;The pouch cell is exclusively used for Li-ion &#10; and Li-ion polymer chemistries. At the present time, &#10; it costs more to produce this cell architecture and its reliability &#10; has not been fully proven. In addition, the energy density &#10; and load current are slightly lower than that of conventional &#10; cell designs. The cycle life in everyday applications is not &#10; well documented but is, at present, less than that of the &#10; Li-ion system with conventional cell design.&lt;/p&gt; &lt;p class="MsoNormal"&gt;A critical issue with the pouch cell is the &#10; swelling that occurs when gas is generated during charging &#10; or discharging. Battery manufacturers insist that Li-ion &#10; or Polymer cells do not generate gas if properly formatted, &#10; are charged at the correct current and are kept within allotted &#10; voltage levels. When designing the protective housing for &#10; a pouch cell, some provision for swelling must be made. To &#10; alleviate the swelling issue when using multiple cells, it &#10; is best not to stack pouch cells, but lay them side by&amp;nbsp;side.&lt;/p&gt; &lt;table border="0" cellspacing="0" cellpadding="5"&gt; &lt;tr&gt; &#10; &lt;td&gt; &#10; &lt;p class="MsoNormal"&gt;&lt;img width="240" height="152" src="https://technick.net/img/guide_bpw2/c03_05.jpg" border="0" alt="" /&gt;&lt;/p&gt; &lt;/td&gt; &lt;td&gt; &#10; &lt;p class="MsoNormal"&gt;&lt;a name="_Ref501871286"&gt;&lt;/a&gt;&lt;a name="_Toc502116689"&gt;&lt;/a&gt;&lt;a name="_Toc507815247"&gt;&lt;span class="caption"&gt;Figure&amp;nbsp;3-4: The pouch cell.&lt;/span&gt;&lt;/a&gt;&lt;br /&gt; &lt;span class="caption-sub"&gt;The pouch cell offers a simple, &#10; flexible and lightweight solution to battery design. &#10; This new concept has not yet fully matured and the manufacturing &#10; costs are still high. &lt;br /&gt; &amp;copy; Cadex Electronics Inc.&lt;/span&gt;&lt;/p&gt; &lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;p class="MsoNormal"&gt;The pouch cell is highly sensitive to twisting. &#10; Point pressure must also be avoided. The protective housing &#10; must be designed to protect the cell from mechanical stress.&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>03. The Battery Pack 4</title><link>https://technick.net/guides/electronics/bpw/c03_04/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c03_04/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c03_03"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c03_05"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;3.5 Series and Parallel Configurations&lt;/h4&gt;&lt;p&gt;&lt;a name="_Toc507909160"&gt;&lt;/a&gt; &lt;/p&gt;&lt;p class="MsoNormal"&gt;In most cases, a single cell does not provide &#10; a high enough voltage and a serial connection of several cells &#10; is needed. The metallic skin of the cell is insulated to prevent &#10; the ‘hot’ metal cylinders from creating an electrical short &#10; circuit against the neighboring&amp;nbsp;cell.&lt;/p&gt; &lt;p class="MsoNormal"&gt;Nickel-based cells provide a nominal cell &#10; voltage of 1.25V. A lead acid cell delivers 2V and most Li-ion &#10; cells are rated at 3.6V. &lt;img src="https://technick.net/img/guide_bpw2/c03_06.gif" width="173" height="123" align="left" vspace="19" hspace="19" border="0" alt="" /&gt;The &#10; spinel (manganese) and Li-ion polymer systems sometimes use &#10; 3.7V as the designated cell voltage. This is the reason for &#10; the often unfamiliar voltages, such as 11.1V for a three cell &#10; pack of spinel chemistry.&lt;/p&gt; &lt;p class="MsoNormal"&gt;Nickel-based cells are often marked 1.2V. &#10; There is no difference between a 1.2&amp;nbsp;and 1.25V cell; &#10; it is simply the preference of the manufacturer in marking. &#10; Whereas commercial batteries tend to be identified with 1.2V/cell, &#10; industrial, aviation and military batteries are still marked &#10; with the original designation of 1.25V/cell.&lt;/p&gt; &lt;p class="MsoNormal"&gt;A five-cell nickel-based battery delivers &#10; 6V (6.25V with 1.25V/cell marking) and a six-cell pack has &#10; 7.2V (7.5V with 1.25V/cell marking). The portable lead acid &#10; comes in 3&amp;nbsp;cell (6V) and 6&amp;nbsp;cell (12V) formats. The &#10; Li-ion family has either 3.6V for a single cell pack, &#10; 7.2V for a two-cell pack or 10.8V for a three-cell pack. The &#10; 3.6V and 7.2V batteries are commonly used for mobile phones; &#10; laptops use the larger 10.8V&amp;nbsp;packs.&lt;/p&gt; &lt;p class="MsoNormal"&gt;There has been a trend towards lower voltage &#10; batteries for light portable devices, such as mobile phones. &#10; This was made possible through advancements in microelectronics. &#10; To achieve the same energy with lower voltages, higher currents &#10; are needed. With higher currents, a low internal battery resistance &#10; is critical. This presents a challenge if protection devices &#10; are used. Some losses through the solid-state switches of &#10; protection devices cannot be avoided.&lt;/p&gt; &lt;p class="MsoNormal"&gt;Packs with fewer cells in series generally &#10; perform better than those with 12&amp;nbsp;cells or more. Similar &#10; to a chain, the more links that are used, the greater the &#10; odds of one breaking. On higher voltage batteries, precise &#10; cell matching becomes important, especially if high load currents &#10; are drawn or if the pack is operated in cold temperatures.&lt;/p&gt; &lt;p class="MsoNormal"&gt;Parallel connections are used to obtain higher &#10; ampere-hour (Ah) &amp;nbsp;ratings. When possible, pack designers prefer &#10; using larger cells. This may not always be practical because &#10; new battery chemistries come in limited sizes. Often, a parallel &#10; connection is the only option to increase the battery rating. &#10; Paralleling is also necessary if pack dimensions restrict &#10; the use of larger cells. Among the battery chemistries, Li-ion &#10; lends itself best to parallel connection.&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>03. The Battery Pack 5</title><link>https://technick.net/guides/electronics/bpw/c03_05/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c03_05/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c03_04"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c03_06"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;3.6 Protection Circuits&lt;/h4&gt;&lt;p&gt;&lt;a name="_Toc507909161"&gt;&lt;/a&gt; &lt;/p&gt;&lt;p class="MsoNormal"&gt;Most battery packs include some type of protection &#10; to safeguard battery and equipment, should a malfunction occur. &#10; The most basic protection is a fuse that opens if excessively &#10; high current is drawn. Some fuses open permanently and render &#10; the battery useless once the filament is broken; other fuses &#10; are based on a Polyswitch™, which resembles a resettable fuse. &#10; On excess current, the Polyswitch™ creates a high resistance, &#10; inhibiting the current flow. When the condition normalizes, &#10; the resistance of the switch reverts to the low ON position, &#10; allowing normal operation to resume. Solid-state switches &#10; are also used to disrupt the current. Both solid-state switches &#10; and the Polyswitch™ have a residual resistance to the ON position &#10; during normal operation, causing a slight increase in internal &#10; battery resistance.&lt;/p&gt; &lt;p class="MsoNormal"&gt;A more complex protection circuit is found &#10; in intrinsically safe&amp;nbsp;batteries. These batteries are mandated &#10; for two-way radios, gas detectors and other electronic instruments &#10; that operate in a hazardous area such as oil refineries and &#10; grain elevators. Intrinsically safe batteries prevent explosion, &#10; should the electronic devices malfunction while operating &#10; in areas that contain explosive gases or high dust concentration. &#10; The protection circuit prevents excessive current, which could &#10; lead to high heat and electric&amp;nbsp;spark.&lt;/p&gt; &lt;p class="MsoNormal"&gt;There are several levels of intrinsic safety, &#10; each serving a specific hazard level. The requirement for &#10; intrinsic safety varies from country to country. The purchase &#10; cost of an intrinsically safe battery is two or three times &#10; that of a regular battery.&lt;/p&gt; &lt;p class="MsoNormal"&gt;Commercial Li-ion packs contain one &#10; of the most exact protection circuits in the battery industry. &#10; These circuits assure safety under all circumstances when &#10; in the hands of the public. Typically, a Field Effect Transistor &#10; (FET) opens if the charge voltage of any cell reaches 4.30V &#10; and a fuse activates if the cell temperature approaches 90&amp;deg;C (194&amp;deg;F). &#10; In addition, a disconnect switch in each cell permanently &#10; interrupts the charge current if a safe pressure threshold &#10; of 1034&amp;nbsp;kPa (150&amp;nbsp;psi) is exceeded. To prevent the &#10; battery from over-discharging, the control circuit cuts off &#10; the current path at low voltage, which is typically 2.50V/cell.&lt;/p&gt; &lt;p class="MsoNormal"&gt;The Li-ion is typically discharged &#10; to 3V/cell. The lowest ‘low-voltage’ power cut-off is 2.5V/cell. &#10; During prolonged storage, however, a discharge below that &#10; cut-off level is possible. Manufacturers recommend a ‘trickle’ &#10; charge to raise such a battery gradually back up into the &#10; acceptable voltage&amp;nbsp;window.&lt;/p&gt; &lt;p class="MsoNormal"&gt;Not all chargers are designed to apply a &#10; charge once a Li-ion battery has dipped below 2.5V/cell. &#10; A ‘wake-up’ boost will be needed to first engage the electronic &#10; circuit, after which a gentle charge is applied to re-energize &#10; the battery. Caution must be applied not to boost lithium-based &#10; batteries back to life, which have dwelled at a very low voltage &#10; for a prolonged&amp;nbsp;time.&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>03. The Battery Pack 6</title><link>https://technick.net/guides/electronics/bpw/c03_06/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c03_06/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c03_05"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c04_01"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;Each parallel string of cells of a Li-ion pack needs &#10; independent voltage monitoring. The more cells that are connected &#10; in series, the more complex the protection circuit becomes. &#10; Four cells in series is the practical limit for commercial &#10; applications.&lt;/p&gt; &lt;p class="MsoNormal"&gt;The internal protection circuit of a mobile &#10; phone while in the ON position has a resistance of 50&amp;nbsp;to &#10; 100&amp;nbsp;mW. The circuit normally consists of two switches &#10; connected in series. One is responsible for high cut-off, &#10; the other for low cut-off. The combined resistance of these &#10; two devices virtually doubles the internal resistance of a &#10; battery pack, especially if only one cell is used. Battery &#10; packs powering mobile phones, for example, must be capable &#10; of delivering high current bursts. The internal protection &#10; does, in a certain way, interfere with the current delivery.&lt;/p&gt; &lt;p class="MsoNormal"&gt;Some small Li-ion packs with spinel &#10; chemistry containing one or two cells may not include an electronic &#10; protection circuit. Instead, they use a single component fuse &#10; device. These cells are deemed safe because of small size &#10; and low capacity. In addition, spinel is more tolerant than &#10; other systems if abused. The absence of a protection circuit &#10; saves money, but a new problem arises. Here is what can happen:&lt;/p&gt; &lt;p class="MsoNormal"&gt;Mobile phone users have access to chargers &#10; that may not be approved by the battery manufacturer. Available &#10; at low cost for car and travel, these chargers may rely on &#10; the battery’s protection circuit to terminate at full charge. &#10; Without the protection circuit, the battery cell voltage rises &#10; too high and overcharges the battery. Apparently still safe, &#10; irreversible battery damage often occurs. Heat buildup and &#10; bulging is common under these circumstances. Such situations &#10; must be avoided at all times. The manufacturers are often &#10; at a loss when it comes to replacing these batteries under &#10; warranty.&lt;/p&gt; &lt;p class="MsoNormal"&gt;Li-ion batteries with cobalt electrodes, &#10; for example, require full safety protection. A major concern &#10; arises if static electricity or a faulty charger has destroyed &#10; the battery’s protection circuit. Such damage often causes &#10; the solid-state switches to fuse in a permanent ON position &#10; without the user’s knowledge. A battery with a faulty protection &#10; circuit may function normally but does not provide the required &#10; safety. If charged beyond safe voltage limits with a poorly &#10; designed accessory charger, the battery may heat up, then &#10; bulge and in some cases vent with flame. Shorting such a battery &#10; can also be hazardous.&lt;/p&gt; &lt;p class="MsoNormal"&gt;Manufacturers of Li-ion batteries refrain &#10; from mentioning explosion. ‘Venting with flame’ is the accepted &#10; terminology. Although slower in reaction than an explosion, &#10; venting with flame can be very violent and inflicts injury &#10; to those in close proximity. It can also damage the equipment &#10; to which the battery is connected.&lt;/p&gt; &lt;p class="MsoNormal"&gt;Most manufacturers do not sell the Li-ion &#10; cells by themselves but make them available in a battery pack, &#10; complete with protection circuit. This precaution is understandable &#10; when considering the danger of explosion and fire if the battery &#10; is charged and discharged beyond its safe limits. Most battery &#10; assembling houses must certify the pack assembly and protection &#10; circuit intended to be used with the manufacturer before these &#10; items are approved for sale. &lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>03. Theory of Operation</title><link>https://technick.net/guides/theory/dar/003/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dar/003/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/resample/"&gt;The Digital Audio Resampling Home Page&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, Copyright &amp;#169; &lt;i&gt;2016-05-17&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dar/002"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dar/000"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dar/004"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;Theory of Operation&lt;/h3&gt;&lt;p&gt;&lt;br /&gt;&lt;hr /&gt;&lt;!--Table of Child-Links--&gt;&lt;a name="CHILD_LINKS"&gt;&lt;strong&gt;Subsections&lt;/strong&gt;&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html70" href="https://technick.net/guides/theory/dar/004"&gt;Abstract&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html71" href="https://technick.net/guides/theory/dar/005"&gt;Introduction&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html72" href="https://technick.net/guides/theory/dar/006"&gt;Theory of Ideal Bandlimited Interpolation&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html73" href="https://technick.net/guides/theory/dar/007"&gt;From Theory to Practice&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html74" href="https://technick.net/guides/theory/dar/008"&gt;Implementation&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html75" href="https://technick.net/guides/theory/dar/009"&gt;Quantization Issues&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html76" href="https://technick.net/guides/theory/dar/010"&gt;Choice of Table Size&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html77" href="https://technick.net/guides/theory/dar/011"&gt;Choice of Interpolation Resolution&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html78" href="https://technick.net/guides/theory/dar/012"&gt;Conclusions&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html79" href="https://technick.net/guides/theory/dar/013"&gt;Appendix A: Exact Sinc-Interpolation of Sampled Periodic Signals&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html80" href="https://technick.net/guides/theory/dar/014"&gt;Appendix B: Relation between Sinc and Lagrange Interpolation&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;!--End of Table of Child-Links--&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>04. Abstract</title><link>https://technick.net/guides/theory/dar/004/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dar/004/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/resample/"&gt;The Digital Audio Resampling Home Page&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, Copyright &amp;#169; &lt;i&gt;2016-05-17&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dar/003"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dar/000"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dar/005"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;Abstract&lt;/h3&gt;&lt;p&gt;This tutorial describes a technique for &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dar/000"&gt;bandlimited&#10;interpolation&lt;/a&gt;&lt;/i&gt; of discrete-time signals which supports signal&#10;evaluation at an ``arbitrary'' time, and which performs well for&#10;smoothly changing &lt;a href="https://ccrma.stanford.edu/~jos//st/Shannon_s_Sampling_Theorem.html" target="_blank"&gt;sampling rates&lt;/a&gt;, such as needed for digital audio&#10;``scrubbing.'' The method is based on interpolated look-up in a table&#10;of &lt;a href="https://technick.net/guides/theory/edft/010"&gt;filter&lt;/a&gt; coefficients, so as to make the filter &lt;a href="https://technick.net/guides/theory/edft/010#2321"&gt;impulse&lt;/a&gt; response&#10;available effectively in continuous-time form. A single pre-computed&#10;filter table handles all interpolation times and &lt;a href="https://technick.net/guides/theory/dar/000"&gt;sampling-rate&#10;conversion&lt;/a&gt; ratios. Formulas are given for determining the look-up&#10;table size needed for a given precision requirement. This tutorial is&#10;an expansion of the conference paper [&lt;a href="https://technick.net/guides/theory/dar/015#SmithAndGossett84"&gt;Smith and Gossett&amp;nbsp;1984&lt;/a&gt;].&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>04. Proper Charge Methods</title><link>https://technick.net/guides/electronics/bpw/c04_01/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c04_01/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c03_06"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c04_02"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;4. Proper Charge Methods&lt;/h3&gt;&lt;p&gt; &#10; &lt;/p&gt;&lt;p&gt; To a large extent, the performance and longevity of rechargeable &#10; batteries depends on the quality of the chargers. Battery &#10; chargers are commonly given low priority, especially on consumer &#10; products. Choosing a quality charger makes sense. This is &#10; especially true when considering the high cost of battery &#10; replacements and the frustration that poorly performing batteries &#10; create. In most cases, the extra money invested is returned &#10; because the batteries last longer and perform more efficiently. &#10; &lt;/p&gt; &lt;a name="_Toc507909163"&gt;&lt;/a&gt;&lt;h4&gt;4.1 All About Chargers&lt;/h4&gt; &lt;p&gt;&lt;img width="188" height="102" src="https://technick.net/img/guide_bpw2/c04_01.gif" align="left" hspace="19" vspace="19" alt="Text Box: Battery chargers are commonly given low priority." v:shapes="_x0000_s1031" border="0" /&gt;There &#10; are two distinct varieties of chargers: the personal chargers &#10; and the industrial chargers. The personal charger is sold &#10; in attractive packaging and is offered with such products &#10; as mobile phones, laptops and video cameras. These chargers &#10; are economically priced and perform well when used for the &#10; application intended. The personal charger offers moderate &#10; charge&amp;nbsp;times.&lt;/p&gt; &lt;p&gt;In comparison, the industrial charger is designed &#10; for employee use and accommodates fleet batteries. These chargers &#10; are built for repetitive use. Available for single or multi-bay &#10; configurations, the industrial chargers are offered from the &#10; original equipment manufacturer (OEM). In many instances, &#10; the chargers can also be obtained from third party manufacturers. &#10; While the OEM chargers meet basic requirements, third party &#10; manufacturers often include special features, such as negative &#10; pulse charging, discharge function for battery conditioning, &#10; and state-of-charge (SoC) and state-of-health (SoH) indications. &#10; Many third party manufacturers are prepared to build low quantities &#10; of custom chargers. Other benefits third party suppliers can &#10; offer include creative pricing and superior performance.&lt;/p&gt; &lt;p&gt;Not all third party charger manufacturers meet &#10; the quality standards that the industry demands, The buyer &#10; should be aware of possible quality and performance compromises &#10; when purchasing these chargers at discount prices. Some units &#10; may not be rugged enough to withstand repetitive use; others &#10; may develop maintenance problems such as burned or broken &#10; battery contacts.&lt;/p&gt; &lt;p&gt;Uncontrolled over-charge is another problem of &#10; some chargers, especially those used to charge nickel-based &#10; batteries. High temperature during charge and standby kills &#10; batteries. Over-charging occurs when the charger keeps the &#10; battery at a temperature that is warm to touch (body temperature) &#10; while in ready condition.&lt;/p&gt; &lt;p&gt;&lt;img width="201" height="101" src="https://technick.net/img/guide_bpw2/c04_02.gif" align="left" hspace="19" vspace="19" alt="Text Box: High temperature during charge and standby kills batteries." v:shapes="_x0000_s1026" border="0" /&gt;Some temperature rise cannot be avoided when charging &#10; nickel-based batteries. A temperature peak is reached when &#10; the battery approaches full charge. The temperature must moderate &#10; when the ready light appears and the battery has switched &#10; to trickle charge. The battery should eventually cool to room &#10; temperature.&lt;/p&gt; &lt;p&gt;If the temperature does not drop and remains &#10; above room temperature, the charger is performing incorrectly. &#10; In such a case, the battery should be removed as soon as possible &#10; after the ready light appears. Any prolonged trickle charging &#10; will damage the battery. This caution applies especially to &#10; the NiMH because it cannot absorb overcharge well. In fact, &#10; a NiMH with high trickle charge could be cold to the touch &#10; and still be in a damaging overcharge condition. Such a battery &#10; would have a short service&amp;nbsp;life.&lt;/p&gt; &lt;p&gt;A lithium-based battery should never get warm &#10; in a charger. If this happens, the battery is faulty or the &#10; charger is not functioning properly. Discontinue using this &#10; battery and/or charger.&lt;/p&gt; &lt;p&gt;It is best to store batteries on a shelf and &#10; apply a topping-charge before use rather than leaving the &#10; pack in the charger for days. Even at a seemingly correct &#10; trickle charge, nickel-based batteries produce a crystalline &#10; formation (also referred to as ‘memory’) when left &#10; in the charger. Because of relatively high self-discharge, &#10; a topping charge is needed before use. Most Li-ion chargers &#10; permit a battery to remain engaged without inflicting damage.&lt;/p&gt; &lt;p&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>04. Proper Charge Methods 10</title><link>https://technick.net/guides/electronics/bpw/c04_10/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c04_10/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c04_09"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c05_01"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;4.8 Ultra-fast Chargers&lt;/h4&gt;&lt;p&gt;&lt;a name="_Toc507909170"&gt;&lt;/a&gt; &lt;/p&gt;&lt;p&gt;Some charger manufacturers claim amazingly short &#10; charge times of 30&amp;nbsp;minutes or less. With well-balanced &#10; cells and operating at moderate room temperatures, NiCd batteries &#10; designed for fast charging can indeed be charged in a very &#10; short time. This is done by simply dumping in a high charge &#10; current during the first 70&amp;nbsp;percent of the charge cycle. &#10; Some NiCd batteries can take as much a 10C, or ten times the &#10; rated current. Precise SoC detection and temperature monitoring &#10; are essential.&lt;/p&gt; &lt;p&gt;The high charge current must be reduced to lower &#10; levels in the second phase of the charge cycle because the &#10; efficiency to absorb charge is progressively reduced as the &#10; battery moves to a higher SoC. If the charge current remains &#10; too high in the later part of the charge cycle, the excess &#10; energy turns into heat and pressure. Eventually venting occurs, &#10; releasing hydrogen gas. Not only do the escaping gases deplete &#10; the electrolyte, they are also highly flammable!&lt;/p&gt; &lt;p&gt;Several manufacturers offer chargers that claim &#10; to fully charge NiCd batteries in half the time of conventional &#10; chargers. Based on pulse charge technology, these chargers &#10; intersperse one or several brief discharge pulses between &#10; each charge pulse. This promotes the recombination of oxygen &#10; and hydrogen gases, resulting in reduced pressure buildup &#10; and a lower cell temperature. Ultra-fast-chargers based on &#10; this principle can charge a nickel-based battery in a shorter &#10; time than regular chargers, but only to about a 90&amp;nbsp;percent &#10; SoC. A trickle charge is needed to top the charge to 100&amp;nbsp;percent.&lt;/p&gt; &lt;p&gt;Pulse chargers are known to reduce the crystalline &#10; formation (memory) of nickel-based batteries. By using these &#10; chargers, some improvement in battery performance can be realized, &#10; especially if the battery is affected by memory. The pulse &#10; charge method does not replace a periodic full discharge. &#10; For more severe crystalline formation on nickel-based batteries, &#10; a full discharge or recondition&amp;nbsp;cycle is recommended to restore &#10; the battery.&lt;/p&gt; &lt;p&gt;Ultra-fast charging can only be applied to healthy &#10; batteries and those designed for fast charging. Some cells &#10; are simply not built to carry high current and the conductive &#10; path heats up. The battery contacts also take a beating if &#10; the current handling of the spring-loaded plunger contacts &#10; is underrated. Pressing against a flat metal surface, these &#10; contacts may work well at first, and then wear out prematurely. &#10; Often, a fine and almost invisible crater appears on the tip &#10; of the contact, which causes a high resistive path or forms &#10; an isolator. The heat generated by a bad contact can melt &#10; the plastic.&lt;/p&gt; &lt;p&gt;Another problem with ultra-fast charging is servicing &#10; aged batteries that commonly have high internal resistance. &#10; Poor conductivity turns into heat, which further deteriorates &#10; the cells. Battery packs with mismatched cells pose another &#10; challenge. The weak cells holding less capacity are charged &#10; before those with higher capacity and start to heat up. This &#10; process makes them vulnerable to further damage.&lt;/p&gt; &lt;p&gt;Many of today’s fast chargers are designed &#10; for the ideal battery. Charging less than perfect specimens &#10; can create such a heat buildup that the plastic housing starts &#10; to distort. Provisions must be made to accept special needs &#10; batteries, albeit at lower charging speeds. Temperature sensing &#10; is a prerequisite.&lt;/p&gt; &lt;p&gt;The ideal ultra-fast charger first checks the &#10; battery type, measures its SoH and then applies a tolerable &#10; charge current. Ultra-high capacity batteries and those that &#10; have aged are identified, and the charge time is prolonged &#10; because of higher internal resistance. Such a charger would &#10; provide due respect to those batteries that still perform &#10; satisfactorily but are no longer ‘spring chickens’.&lt;/p&gt; &lt;p&gt;The charger must prevent excessive temperature &#10; build-up. Sluggish heat detection, especially when charging &#10; takes place at a very rapid pace, makes it easy to overcharge &#10; a battery before the charge is terminated. This is especially &#10; true for chargers that control fast charge using temperature &#10; sensing alone. If the temperature rise is measured right on &#10; the skin of the cell, reasonably accurate SoC detection is &#10; possible. If done on the outside surface of the battery pack, &#10; further delays occur. Any prolonged exposure to a temperature &#10; of 45&amp;deg;C (113&amp;deg;F) harms the battery.&lt;/p&gt; &lt;p&gt;New charger concepts are being studied which &#10; regulate the charge current according to the battery's charge &#10; acceptance. On the initial charge of an empty battery when &#10; the charge acceptance is high and little gas is generated, &#10; a very high charge current can be applied. Towards the end &#10; of a charge, the current is tapered&amp;nbsp;down.&lt;/p&gt;&lt;a name="_Toc507909171"&gt;&lt;/a&gt;&lt;h4&gt;4.9 Charge IC Chips&lt;/h4&gt; &lt;p&gt;Newer battery systems demand more complex chargers &#10; than batteries with older chemistries. With today’s charge &#10; IC chips, designing a charger has been simplified. These chips &#10; apply proven charge algorithms and are capable of servicing &#10; all major battery chemistries. As the price of these chips &#10; decreases, design engineers make more use of this product. &#10; With the charge IC chip, an engineer can focus entirely on &#10; the portable equipment rather than devoting time to developing &#10; a charging circuit.&lt;/p&gt; &lt;p&gt;The charge IC chips have some limitations, however. &#10; The charge algorithm is fixed and does not allow fine-tuning. &#10; If a trickle charge is needed to raise a Li-ion that &#10; has dropped below 2.5V/cell to its normal operating voltage, &#10; the charge IC may not be able to perform this function. Similarly, &#10; if an ultra-fast charge is needed for nickel-based batteries, &#10; the charge IC applies a fixed charge current and does not &#10; take into account the SoH of the battery. Furthermore, a temperature &#10; compensated charge would be difficult to administer if the &#10; IC chips do not provide this feature.&lt;/p&gt; &lt;p&gt;Using a small micro controller is an alternative &#10; to selecting an off-the-shelf charge IC. The hardware cost &#10; is about the same. When opting for the micro controller, custom &#10; firmware will be needed. Some extra features can be added &#10; with little extra cost. They are fast charging based on the &#10; SoH of the battery. Ambient temperatures can also be taken &#10; into account. Whether an IC chip or micro controller is used, &#10; peripheral components are required consisting of solid-state &#10; switches and a power supply. &lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>04. Proper Charge Methods 2</title><link>https://technick.net/guides/electronics/bpw/c04_02/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c04_02/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c04_01"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c04_03"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;There are three types of chargers for nickel-based batteries. &#10; They are: &lt;/p&gt; &lt;p&gt;&lt;b&gt;Slow Charger&lt;/b&gt; — Also known as ‘overnight &#10; charger’ or ‘normal charger’, the slow-charger &#10; applies a fixed charge rate of about 0.1C (one tenth of the &#10; rated capacity) for as long as the battery is connected. Typical &#10; charge time is 14&amp;nbsp;to 16&amp;nbsp;hours. In most cases, no &#10; full-charge detection occurs to switch the battery to a lower &#10; charge rate at the end of the charge cycle. The slow-charger &#10; is inexpensive and can be used for NiCd batteries only. With &#10; the need to service both NiCd and NiMH, these chargers are &#10; being replaced with more advanced units.&lt;/p&gt; &lt;p&gt;If the charge current is set correctly, a battery &#10; in a slow-charger remains lukewarm to the touch when fully &#10; charged. In this case, the battery does not need to be removed &#10; immediately when ready but should not stay in the charger &#10; for more than a day. The sooner the battery can be removed &#10; after being fully charged, the better&amp;nbsp;it&amp;nbsp;is.&lt;/p&gt; &lt;p&gt;A problem arises if a smaller battery (lower &#10; mAh) is charged with a charger designed to service larger &#10; packs. Although the charger will perform well in the initial &#10; charge phase, the battery starts to heat up past the 70&amp;nbsp;percent &#10; charge level. Because there is no provision to lower the charge &#10; current or to terminate the charge, heat-damaging over-charge &#10; will occur in the second phase of the charge cycle. If an &#10; alternative charger is not available, the user is advised &#10; to observe the temperature of the battery being charged and &#10; disconnect the battery when it is warm to the touch.&lt;/p&gt; &lt;p&gt;The opposite may also occur when a larger battery &#10; is charged on a charger designed for a smaller battery. In &#10; such a case, a full charge will never be reached. The battery &#10; remains cold during charge and will not perform as expected. &#10; A nickel-based battery that is continuously undercharged will &#10; eventually loose its ability to accept a full charge due to &#10; memory.&lt;/p&gt; &lt;p&gt;&lt;b&gt;Quick Charger&lt;/b&gt; — The so-called quick-charger, &#10; or rapid charger, is one of the most popular. It is positioned &#10; between the slow-charger and the fast-charger, both in terms &#10; of charging time and price. Charging takes 3 to 6&amp;nbsp;hours &#10; and the charge rate is around 0.3C. Charge control is required &#10; to terminate the charge when the battery is ready. The well &#10; designed quick-charger provides better service to nickel-based &#10; batteries than the slow-charger. Batteries last longer if &#10; charged with higher currents, provided they remain cool and &#10; are not overcharged. The quick-chargers are made to accommodate &#10; either nickel-based or lithium-based batteries. These two &#10; chemistries can normally not be interchanged in the same charger.&lt;/p&gt; &lt;p&gt;&lt;b&gt;Fast Charger &lt;/b&gt;— The fast-charger offers &#10; several advantages over the other chargers; the obvious one &#10; is shorter charge times. Because of the larger power supply &#10; and the more expensive control circuits needed, the fast-charger &#10; costs more than slower chargers, but the investment is returned &#10; in providing good performing batteries that live longer.&lt;/p&gt; &lt;p&gt;The charge time is based on the charge rate, &#10; the battery’s SoC, its rating and the chemistry. At a &#10; 1C charge rate, an empty NiCd typically charges in a little &#10; more than an&amp;nbsp;hour. When a battery is fully charged, some &#10; chargers switch to a topping charge mode governed by a timer &#10; that completes the charge cycle at a reduced charge current. &#10; Once fully charged, the charger switches to trickle charge. &#10; This maintenance charge compensates for the self-discharge &#10; of the battery.&lt;/p&gt; &lt;p&gt;Modern fast-chargers commonly accommodate both &#10; NiCd and NiMH batteries. Because of the fast-charger’s &#10; higher charge current and the need to monitor the battery &#10; during charge, it is important to charge only batteries specified &#10; by the manufacturer. Some battery manufacturers encode the &#10; batteries electrically to identify their chemistry and rating. &#10; The charger then sets the correct charge current and algorithm &#10; for the battery intended. Lead Acid and Li-ion chemistries &#10; are charged with different algorithms and are not compatible &#10; with the charge methods used for nickel-based batteries.&lt;/p&gt; &lt;p&gt;It is best to fast charge nickel-based batteries. &#10; A slow charge is known to build up a crystalline formation &#10; on nickel-based batteries, a phenomenon that lowers battery &#10; performance and shortens service life. The battery temperature &#10; during charge should be moderate and the temperature peak &#10; kept as short as possible.&lt;/p&gt; &lt;p&gt;It is not recommended to leave a nickel-based &#10; battery in the charger for more than a few days, even with &#10; a correctly set trickle charge current. If a battery must &#10; remain in a charger for operational readiness, an exercise &#10; cycle should be applied once every month.&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>04. Proper Charge Methods 3</title><link>https://technick.net/guides/electronics/bpw/c04_03/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c04_03/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c04_02"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c04_04"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;&lt;b&gt;Simple Guidelines&lt;/b&gt;&lt;/p&gt; &lt;p&gt;A charger designed to service NiMH batteries &#10; can also accommodate NiCd’s, but not the other way around. &#10; A charger only made for the NiCd batteries could overcharge &#10; the NiMH battery.&lt;/p&gt; &lt;p&gt;While many charge methods exist for nickel-based &#10; batteries, chargers for lithium-based batteries are more defined &#10; in terms of charge method and charge time. This is, in part, &#10; due to the tight charge regime and voltage requirements demanded &#10; by these batteries. There is only one way to charge Li-ion/Polymer &#10; batteries and the so-called ‘miracle chargers’, &#10; which claim to restore and prolong battery life, do not exist &#10; for these chemistries. Neither does a super-fast charging &#10; solution apply.&lt;/p&gt; &lt;p&gt;The pulse charge method for Li-ion&amp;nbsp;has &#10; no major advantages and the voltage peaks wreak havoc with &#10; the voltage limiting circuits. While charge times can be reduced, &#10; some manufacturers suggest that pulse charging may shorten &#10; the cycle life of Li-ion batteries.&lt;/p&gt; &lt;p&gt;Fast charge methods do not significantly decrease &#10; the charge time. A charge rate over 1C should be avoided because &#10; such high current can induce lithium plating. With most packs, &#10; a charge above 1C is not possible. The protection circuit &#10; limits the amount of current the battery can accept. The lithium-based &#10; battery has a slow metabolism and must take its time to absorb &#10; the energy.&lt;/p&gt; &lt;p&gt;Lead acid chargers serve industrial markets such &#10; as hospitals and health care units. Charge times are very &#10; long and cannot be shortened. Most lead acid chargers charge &#10; the battery in 14&amp;nbsp;hours. Because of its low energy density, &#10; this battery type is not used for small portable devices.&lt;/p&gt; &lt;p&gt;In the following sections various charging needs &#10; and charging methods are studied. The charging techniques &#10; of different chargers are examined to determine why some perform &#10; better than others. Since fast charging rather than slow charging &#10; is the norm today, we look at well-designed, closed loop systems, &#10; which communicate with the battery and terminate the fast &#10; charge when certain responses from the battery are received.&lt;/p&gt; &lt;a name="_Toc366986281"&gt;&lt;/a&gt;&lt;a name="_Toc366986332"&gt;&lt;/a&gt;&lt;a name="_Toc366986409"&gt;&lt;/a&gt;&lt;a name="_Toc366986475"&gt;&lt;/a&gt;&lt;a name="_Toc366987106"&gt;&lt;/a&gt;&lt;a name="_Toc366987151"&gt;&lt;/a&gt;&lt;a name="_Toc366987192"&gt;&lt;/a&gt;&lt;a name="_Toc387644052"&gt;&lt;/a&gt;&lt;a name="_Toc507909164"&gt;&lt;/a&gt;&lt;h4&gt;4.2 Charging the Nickel Cadmium Battery&lt;/h4&gt; &lt;p&gt;Battery manufacturers recommend that new batteries &#10; be slow-charged for 24&amp;nbsp;hours before use. A slow charge &#10; helps to bring the cells within a battery pack to an equal &#10; charge level because each cell self-discharges to different &#10; capacity levels. During long storage, the electrolyte tends &#10; to gravitate to the bottom of the cell. The initial trickle &#10; charge helps redistribute the electrolyte to remedy dry spots &#10; on the separator that may have developed.&lt;/p&gt; &lt;p&gt;Some battery manufacturers do not fully form &#10; their batteries before shipment. These batteries reach their &#10; full potential only after the customer has primed them through &#10; several charge/discharge cycles, either with a battery analyzer &#10; or through normal use. In many cases, 50&amp;nbsp;to 100&amp;nbsp;discharge/charge &#10; cycles are needed to fully form a nickel-based battery. Quality &#10; cells, such as those made by Sanyo and Panasonic, are known &#10; to perform to full specification after as few as 5&amp;nbsp;to &#10; 7&amp;nbsp;discharge/charge cycles. Early readings may be inconsistent, &#10; but the capacity levels become very steady once fully primed. &#10; A slight capacity peak is observed between 100&amp;nbsp;and 300&amp;nbsp;cycles.&lt;/p&gt; &lt;p&gt;Most rechargeable cells are equipped with a safety &#10; vent to release excess pressure if incorrectly charged. The &#10; safety vent on a NiCd cell opens at 1034&amp;nbsp;to 1379&amp;nbsp;kPa &#10; (150&amp;nbsp;to 200&amp;nbsp;psi). In comparison, the pressure of &#10; a car tire is typically 240&amp;nbsp;kPa (35&amp;nbsp;psi). With a &#10; resealable vent, no damage occurs on venting but some electrolyte &#10; is lost and the seal may leak afterwards. When this happens, &#10; a white powder will accumulate over time at the vent opening.&lt;/p&gt; &lt;p&gt;&lt;img width="211" height="119" src="https://technick.net/img/guide_bpw2/c04_03.gif" align="left" hspace="19" vspace="19" alt="Text Box: Commercial fast-chargers are often not designed in the best interests of the battery." v:shapes="_x0000_s1033" border="0" /&gt;Commercial fast-chargers are often not designed in the &#10; best interests of the battery. This is especially true of &#10; NiCd chargers that measure the battery’s charge state &#10; solely through temperature sensing. Although simple and inexpensive &#10; in design, charge termination by temperature sensing is not &#10; accurate. The thermistors used commonly exhibit broad tolerances; &#10; their positioning with respect to the cells are not consistent. &#10; Ambient temperatures and exposure to the sun while charging &#10; also affect the accuracy of full-charge detection. To prevent &#10; the risk of premature cut-off and assure full charge under &#10; most conditions, charger manufacturers use 50&amp;deg;C (122&amp;deg;F) as &#10; the recommended temperature cut-off. Although a prolonged &#10; temperature above 45&amp;deg;C (113&amp;deg;F) is harmful to the battery, &#10; a brief temperature peak above that level is often unavoidable.&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>04. Proper Charge Methods 4</title><link>https://technick.net/guides/electronics/bpw/c04_04/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c04_04/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c04_03"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c04_05"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;More advanced NiCd chargers sense the rate of &#10; temperature increase, defined as dT/dt, or the change in temperature &#10; over charge time, rather than responding to an absolute temperature &#10; (dT/dt is defined as delta Temperature / delta time). This &#10; type of charger is kinder to the batteries than a fixed temperature &#10; cut-off, but the cells still need to generate heat to trigger &#10; detection. To terminate the charge, a temperature increase &#10; of 1&amp;deg;C (1.8&amp;deg;F) per minute with an absolute temperature cut-off &#10; of 60&amp;deg;C (140&amp;deg;F) works well. Because of the relatively large &#10; mass of a cell and the sluggish propagation of heat, the delta &#10; temperature, as this method is called, will also enter a brief &#10; overcharge condition before the full-charge is detected. The &#10; dT/dt method only works with fast chargers.&lt;/p&gt; &lt;p&gt;Harmful overcharge occurs if a fully charged &#10; battery is repeatedly inserted for topping charge. Vehicular &#10; or base station chargers that require the removal of two-way &#10; radios with each use are especially hard on the batteries &#10; because each reconnection initiates a fast-charge cycle. This &#10; also applies to laptops that are momentarily disconnected &#10; and reconnected to perform a service. Likewise, a technician &#10; may briefly plug the laptop into the power source to check &#10; a repeater station or service other installations. Problems &#10; with laptop batteries have also been reported in car manufacturing &#10; plants where the workers move the laptops from car to car, &#10; checking their functions, while momentarily plugging into &#10; the external power source. Repetitive connection to power &#10; affects mostly ‘dumb’ nickel-based batteries. A &#10; ‘dumb’ battery contains no electronic circuitry &#10; to communicate with the charger. Li-ion chargers detect &#10; the SoC by voltage only and multiple reconnections will not &#10; confuse the charging regime.&lt;/p&gt; &lt;p&gt;More precise full charge detection&amp;nbsp;of nickel-based &#10; batteries can be achieved with the use of a micro controller &#10; that monitors the battery voltage and terminates the charge &#10; when a certain voltage signature occurs. A drop in voltage &#10; signifies that the battery has reached full charge. This is &#10; known as Negative Delta V (NDV).&lt;/p&gt; &lt;p&gt;NDV is the recommended full-charge detection &#10; method for ‘open-lead’ NiCd chargers because it &#10; offers a quick response time. The NDV charge detection also &#10; works well with a partially or fully charged battery. If a &#10; fully charged battery is inserted, the terminal voltage raises &#10; quickly, then drops sharply, triggering the ready state. Such &#10; a charge lasts only a few minutes and the cells remain cool. &#10; NiCd chargers based on the NDV full charge detection typically &#10; respond to a voltage drop of 10&amp;nbsp;to 30mV per cell. Chargers &#10; that respond to a very small voltage decrease are preferred &#10; over those that require a larger&amp;nbsp;drop.&lt;/p&gt; &lt;p&gt;To obtain a sufficient voltage drop, the charge &#10; rate must be 0.5C and higher. Lower than 0.5C charge rates &#10; produce a very shallow voltage decrease that is often difficult &#10; to measure, especially if the cells are slightly mismatched. &#10; In a battery pack that has mismatched cells, each cell reaches &#10; the full charge at a different time and the curve gets distorted. &#10; Failing to achieve a sufficient negative slope allows the &#10; fast-charge to continue, causing excessive heat buildup due &#10; to overcharge. Chargers using the NDV must include other charge-termination &#10; methods to provide safe charging under all conditions. Most &#10; chargers also observe the battery temperature.&lt;/p&gt; &lt;p&gt;The charge efficiency factor of a standard NiCd &#10; is better on fast charge than slow charge. At a 1C charge &#10; rate, the typical charge efficiency is 1.1 or 91&amp;nbsp;percent. &#10; On an overnight slow charge (0.1C), the efficiency drops to &#10; 1.4&amp;nbsp;or 71&amp;nbsp;percent.&lt;/p&gt; &lt;p&gt;At a rate of 1C, the charge time of a NiCd is &#10; slightly longer than 60&amp;nbsp;minutes (66&amp;nbsp;minutes at an &#10; assumed charge efficiency of 1.1). The charge time on a battery &#10; that is partially discharged or cannot hold full capacity &#10; due to memory or other degradation is shorter accordingly. &#10; At a 0.1C charge rate, the charge time of an empty NiCd is &#10; about 14&amp;nbsp;hours, which relates to the charge efficiency&amp;nbsp;of &#10; 1.4.&lt;/p&gt; &lt;p&gt;During the first 70&amp;nbsp;percent of the charge &#10; cycle, the charge efficiency of a NiCd battery is close to &#10; 100&amp;nbsp;percent. Almost all of the energy is absorbed and &#10; the battery remains cool. Currents of several times the C-rating &#10; can be applied to a NiCd battery designed for fast charging &#10; without causing heat build-up. Ultra-fast chargers use this &#10; unique phenomenon and charge a battery to the 70&amp;nbsp;percent &#10; charge level within a few minutes. The charge continues at &#10; a lower rate until the battery is fully charged.&lt;/p&gt; &lt;p&gt;Once the 70&amp;nbsp;percent charge threshold is &#10; passed, the battery gradually loses ability to accept charge. &#10; The cells start to generate gases, the pressure rises and &#10; the temperature increases. The charge acceptance drops further &#10; as the battery reaches 80&amp;nbsp;and 90&amp;nbsp;percent SoC. Once &#10; full charge is reached, the battery goes into overcharge. &#10; In an attempt to gain a few extra capacity points, some chargers &#10; allow a measured amount of overcharge. Figure&amp;nbsp;4-1 &#10; illustrates the relationship of cell voltage, pressure and &#10; temperature while a NiCd is being charged.&lt;/p&gt; &lt;p&gt;Ultra-high capacity NiCd batteries tend to heat &#10; up more than the standard NiCd if charged at 1C and higher. &#10; This is partly due to the higher internal resistance of the &#10; ultra-high capacity battery. Optimum charge performance can &#10; be achieved by applying higher current at the initial charge &#10; stage, then tapering it to a lower rate as the charge acceptance &#10; decreases. This avoids excess temperature rise and yet assures &#10; fully charged batteries.&lt;/p&gt; &lt;p&gt;&lt;img width="463" height="395" src="https://technick.net/img/guide_bpw2/c04_04.gif" v:shapes="_x0000_i1026" border="0" alt="" /&gt;&lt;/p&gt; &lt;p class="caption"&gt;Figure&amp;nbsp;4-1:&amp;nbsp;Charge characteristics of &#10; a NiCd cell.&lt;br /&gt; &lt;span class="caption-sub"&gt;These cell voltage, pressure and &#10; temperature characteristics are similar in a NiMH cell.&lt;/span&gt;&lt;/p&gt; &lt;p&gt;Interspersing discharge pulses between charge &#10; pulses improves the charge acceptance of nickel-based batteries. &#10; Commonly referred to as ‘burp’ or ‘reverse&lt;b&gt; &#10; &lt;/b&gt;load’ charge, this charge method promotes high surface &#10; area on the electrodes, resulting in enhanced performance &#10; and increased service life. Reverse load also improves fast &#10; charging because it helps to recombine the gases generated &#10; during charge. The result is a cooler and more effective charge &#10; than with conventional DC chargers.&lt;/p&gt; &lt;p&gt;Charging with the reverse load method minimizes &#10; crystalline formation. The US Army Electronics Command in &#10; Fort Monmouth, NJ, USA, had done extensive research in this &#10; field and has published the results. (See Figure 10-1, Crystalline &#10; formation on NiCd cell). Research conducted in Germany has &#10; shown that the reverse load method adds 15&amp;nbsp;percent to &#10; the life of the NiCd battery.&lt;/p&gt; &lt;p&gt;After full charge, the NiCd battery is maintained &#10; with a trickle charge to compensate for the self-discharge. &#10; The trickle charge for a NiCd battery ranges between 0.05C &#10; and 0.1C. In an effort to reduce the memory phenomenon, there &#10; is a trend towards lower trickle charge currents.&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>04. Proper Charge Methods 5</title><link>https://technick.net/guides/electronics/bpw/c04_05/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c04_05/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c04_04"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c04_06"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;4.3 Charging the Nickel-Metal Hydride Battery&lt;/h4&gt;&lt;p&gt;&lt;a name="_Toc507909165"&gt;&lt;/a&gt; &lt;/p&gt;&lt;p&gt;Chargers for NiMH batteries are very similar &#10; to those of the NiCd system but the electronics is generally &#10; more complex. To begin with, the NiMH produces a very small &#10; voltage drop at full charge. This NDV is almost non-existent &#10; at charge rates below 0.5C and elevated temperatures. Aging &#10; and cell mismatch works further against the already minute &#10; voltage delta. The cell mismatch gets worse with age and increased &#10; cycle count, which makes the use of the NDV increasingly more &#10; difficult.&lt;/p&gt; &lt;p&gt;The NDV of a NiMH charger must respond to a voltage &#10; drop of 16mV or less. Increasing the sensitivity of the charger &#10; to respond to the small voltage drop often terminates the &#10; fast charge by error halfway through the charge cycle. Voltage &#10; fluctuations and noise induced by the battery and charger &#10; can fool the NDV detection circuit if set too precisely.&lt;/p&gt; &lt;p&gt;The popularity of the NiMH battery has introduced &#10; many innovative charging techniques. Most of today’s &#10; NiMH fast chargers use a combination of NDV, voltage plateau, &#10; rate-of-temperature-increase (dT/dt), temperature threshold &#10; and timeout timers. The charger utilizes whatever comes first &#10; to terminate the fast-charge.&lt;/p&gt; &lt;p&gt;NiMH batteries which use the NDV method or the &#10; thermal cut-off control tend to deliver higher capacities &#10; than those charged by less aggressive methods. The gain is &#10; approximately 6&amp;nbsp;percent on a good battery. This capacity &#10; increase is due to the brief overcharge to which the battery &#10; is exposed. The negative aspect is a shorter cycle life. Rather &#10; than expecting 350 to 400&amp;nbsp;service cycles, this pack may &#10; be exhausted with 300&amp;nbsp;cycles.&lt;/p&gt; &lt;p&gt;Similar to NiCd charge methods, most NiMH fast-chargers &#10; work on the rate-of-temperature-increase (dT/dt). A temperature &#10; raise of 1&amp;deg;C (1.8&amp;deg;F) per minute is commonly used to terminate &#10; the charge. The absolute temperature cut-off is 60&amp;deg;C (140&amp;deg;F). &#10; A topping charge of 0.1C is added for about 30&amp;nbsp;minutes &#10; to maximize the charge. The continuous trickle charge that &#10; follows keeps the battery in full charge state.&lt;/p&gt; &lt;p&gt;Applying an initial fast charge of 1C works well. &#10; Cooling periods of a few minutes are added when certain voltage &#10; peaks are reached. The charge then continues at a lower current. &#10; When reaching the next charge threshold, the current steps &#10; down further. This process is repeated until the battery is &#10; fully charged.&lt;/p&gt; &lt;p&gt;Known as ‘step-differential charge’, &#10; this charge method works well with NiMH and NiCd batteries. &#10; The charge current adjusts to the SoC, allowing high current &#10; at the beginning and more moderate current towards the end &#10; of charge. This avoids excessive temperature build-up towards &#10; the end of the charge cycle when the battery is less capable &#10; of accepting charge.&lt;/p&gt; &lt;p&gt;NiMH batteries should be rapid charged&amp;nbsp;rather &#10; than slow charged. The amount of trickle charge applied to &#10; maintain full charge is especially critical. Because NiMH &#10; does not absorb overcharge well, the trickle charge must be &#10; set lower than that of the NiCd. The recommended trickle charge &#10; for the NiMH battery is a low 0.05C. This is why the original &#10; NiCd charger cannot be used to charge NiMH batteries. The &#10; lower trickle charge rate is acceptable for the&amp;nbsp;NiCd.&lt;/p&gt; &lt;p&gt;It is difficult, if not impossible, to slow-charge &#10; a NiMH battery. At a C-rate of 0.1C and 0.3C, the voltage &#10; and temperature profiles fail to exhibit defined characteristics &#10; to measure the full charge state accurately and the charger &#10; must depend on a timer. Harmful overcharge can occur if a &#10; partially or fully charged battery is charged on a charger &#10; with a fixed timer. The same occurs if the battery has lost &#10; charge acceptance due to age and can only hold 50&amp;nbsp;percent &#10; of charge. A fixed timer that delivers a 100&amp;nbsp;percent &#10; charge each time without regard to the battery condition would &#10; ultimately apply too much charge. Overcharge could occur even &#10; though the NiMH battery feels cool to the touch.&lt;/p&gt; &lt;p&gt;Some lower-priced chargers may not apply a fully &#10; saturated charge. On these economy chargers, the full-charge &#10; detection may occur immediately after a given voltage peak &#10; is reached or a temperature threshold is detected. These chargers &#10; are commonly promoted on the merit of short charge time and &#10; moderate price.&lt;/p&gt; &lt;p&gt;Figure&amp;nbsp;4-2 summarizes the characteristics &#10; of the slow charger, quick charger&amp;nbsp;and fast charger. A higher &#10; charge current allows better full-charge detection.&lt;br /&gt; &lt;br /&gt; &lt;/p&gt; &lt;table border="0" cellspacing="0" cellpadding="3" width="100%"&gt; &lt;tr&gt; &#10; &lt;td colspan="5" valign="top"&gt; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="9%" valign="top" bgcolor="#E6E6E6"&gt;&amp;nbsp; &lt;/td&gt; &lt;td width="10%" valign="top" bgcolor="#E6E6E6"&gt; &lt;b class="table-bolder"&gt;Charge &#10; &lt;br /&gt; C-rate&lt;/b&gt;&lt;/td&gt; &lt;td width="13%" valign="top" bgcolor="#E6E6E6"&gt; &lt;b class="table-bolder"&gt;Typical &#10; charge time&lt;/b&gt;&lt;/td&gt; &lt;td width="23%" valign="top" bgcolor="#E6E6E6"&gt; &lt;b class="table-bolder"&gt;Maximum &#10; permissible charge temperatures&lt;/b&gt;&lt;/td&gt; &lt;td width="42%" valign="top" bgcolor="#E6E6E6"&gt; &lt;b class="table-bolder"&gt;Charge &#10; termination method&lt;/b&gt;&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td colspan="5" valign="top"&gt; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="9%" valign="top"&gt; &lt;b class="table-bolder"&gt;Slow &#10; Charger&lt;/b&gt;&lt;/td&gt; &lt;td width="10%" valign="top"&gt; 0.1C&lt;/td&gt; &lt;td width="13%" valign="top"&gt; 14h&lt;/td&gt; &lt;td width="23%" valign="top"&gt; 0&amp;deg;C to 45&amp;deg;C &lt;br /&gt; (32&amp;deg;F to 113&amp;deg;F)&lt;/td&gt; &lt;td width="42%" valign="top"&gt; Fixed timer. Subject to overcharge. &#10; Remove battery when charged.&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="9%" valign="top" bgcolor="#F3F3F3"&gt; &lt;b class="table-bolder"&gt;Quick &#10; Charger&lt;/b&gt;&lt;/td&gt; &lt;td width="10%" valign="top" bgcolor="#F3F3F3"&gt; 0.3-0.5C&lt;/td&gt; &lt;td width="13%" valign="top" bgcolor="#F3F3F3"&gt; 4h&lt;/td&gt; &lt;td width="23%" valign="top" bgcolor="#F3F3F3"&gt; 10&amp;deg;C to &#10; 45&amp;deg;C &lt;br /&gt; (50&amp;deg;F to 113&amp;deg;F)&lt;/td&gt; &lt;td width="42%" valign="top" bgcolor="#F3F3F3"&gt; NDV set &#10; to 10mV/cell, uses voltage plateau, absolute temperature &#10; and time-out-timer. (At 0.3C, dT/dt fails to raise the &#10; temperature sufficiently to terminate the charge.) &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="9%" valign="top"&gt; &lt;b class="table-bolder"&gt;Fast &#10; Charger&lt;/b&gt;&lt;/td&gt; &lt;td width="10%" valign="top"&gt; 1C&lt;/td&gt; &lt;td width="13%" valign="top"&gt; 1h+&lt;/td&gt; &lt;td width="23%" valign="top"&gt; 10&amp;deg;C to 45&amp;deg;C &lt;br /&gt; (50&amp;deg;F to 113&amp;deg;F)&lt;/td&gt; &lt;td width="42%" valign="top"&gt; NDV responds to higher settings; &#10; uses dT/dt, voltage plateau absolute temperature and time-out-timer&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td colspan="5" valign="top"&gt; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;p&gt;&lt;a name="_Ref503151559"&gt;&lt;/a&gt;&lt;a name="_Toc507815249" class="caption"&gt;Figure&amp;nbsp;4-2: &#10; Characteristics of various charger types.&lt;/a&gt;&lt;br /&gt; &lt;span class="caption-sub"&gt;These values also apply to NiMH &#10; and NiCd cells.&lt;/span&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>04. Proper Charge Methods 6</title><link>https://technick.net/guides/electronics/bpw/c04_06/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c04_06/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c04_05"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c04_07"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;4.4 Charging the Lead Acid Battery&lt;/h4&gt;&lt;p&gt;&lt;a name="_Toc507909166"&gt;&lt;/a&gt; &lt;/p&gt;&lt;p&gt;The charge algorithm for lead acid batteries &#10; differs from nickel-based chemistry in that voltage limiting &#10; rather than current limiting is used. Charge time of a sealed &#10; lead acid (SLA) is 12&amp;nbsp;to 16&amp;nbsp;hours. With higher charge &#10; currents and multi-stage charge methods, charge time can be &#10; reduced to 10&amp;nbsp;hours or less. SLAs cannot be fully charged &#10; as quickly as nickel-based systems.&lt;/p&gt; &lt;p&gt;A multi-stage charger applies constant-current &#10; charge, topping charge and float charge&lt;b&gt; &lt;/b&gt;(see Figure&amp;nbsp;4-3). &#10; During the constant current charge, the battery charges to &#10; 70&amp;nbsp;percent in about five&amp;nbsp;hours; the remaining 30&amp;nbsp;percent &#10; is completed by the slow topping charge. The topping charge &#10; lasts another five&amp;nbsp;hours and is essential for the well-being &#10; of the battery. This can be compared to a little rest after &#10; a good meal before resuming work. If the battery is not completely &#10; saturated, the SLA will eventually lose its ability to accept &#10; a full charge and the performance of the battery is reduced. &#10; The third stage is the float charge, which compensates for &#10; the self-discharge after the battery has been fully charged.&lt;/p&gt; &lt;p&gt;&lt;img width="455" height="404" src="https://technick.net/img/guide_bpw2/c04_05.gif" v:shapes="_x0000_i1029" border="0" alt="" /&gt;&lt;/p&gt; &lt;p&gt;&lt;a name="_Ref501871753"&gt;&lt;/a&gt;&lt;a name="_Toc502116690"&gt;&lt;/a&gt;&lt;a name="_Toc507815250" class="caption"&gt;Figure&amp;nbsp;4-3: Charge stages of a lead &#10; acid battery.&lt;/a&gt;&lt;br /&gt; &lt;span class="caption-sub"&gt;A multi-stage charger applies constant-current &#10; charge, topping charge and float charge.&lt;/span&gt;&lt;/p&gt; &lt;p&gt;Correctly setting the cell-voltage limit is critical. &#10; A typical voltage limit is from 2.30V to 2.45V. If a slow &#10; charge is acceptable, or the room temperature may exceed 30&amp;deg;C &#10; (86&amp;deg;F), the recommended voltage limit is 2.35V/cell. If a &#10; faster charge is required, and the room temperature will remain &#10; below 30&amp;deg;C, 2.40&amp;nbsp;to 2.45V/cell may be used. Figure&amp;nbsp;4-4 &#10; compares the advantages and disadvantages of the different &#10; voltage settings.&lt;br /&gt; &lt;br /&gt; &lt;/p&gt; &lt;table border="0" cellspacing="0" cellpadding="3"&gt; &lt;tr&gt; &#10; &lt;td valign="top" colspan="3"&gt; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td valign="top" bgcolor="#E6E6E6"&gt;&amp;nbsp;&lt;/td&gt; &lt;td width="204" valign="top" bgcolor="#E6E6E6"&gt; &#10; &lt;p align="center"&gt;&lt;b&gt;2.30V &#10; to 2.35V/cell&lt;/b&gt;&lt;/p&gt; &lt;/td&gt; &lt;td width="204" valign="top" bgcolor="#E6E6E6"&gt; &#10; &lt;p align="center"&gt;&lt;b&gt;2.40V &#10; to 2.45V/cell&lt;/b&gt;&lt;/p&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td valign="top" colspan="3"&gt; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td valign="top"&gt; &#10; &lt;p&gt;&lt;b&gt;Advantage&lt;/b&gt;&lt;/p&gt; &lt;/td&gt; &lt;td width="204" valign="top"&gt; &#10; &lt;p&gt;Maximum service life; battery remains &#10; cool during charge; ambient charge temperature may exceed &#10; 30&amp;deg;C (86&amp;deg;F).&lt;/p&gt; &lt;/td&gt; &lt;td width="204" valign="top"&gt; &#10; &lt;p&gt;Faster charge times; higher and more &#10; consistent capacity readings; less subject to damage &#10; due to under-charge condition.&lt;/p&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td valign="top" bgcolor="#F3F3F3"&gt; &#10; &lt;p&gt;&lt;b&gt;Disadvantage&lt;/b&gt;&lt;/p&gt; &lt;/td&gt; &lt;td width="204" valign="top" bgcolor="#F3F3F3"&gt; &#10; &lt;p&gt;Slow charge time; capacity readings &#10; may be low and inconsistent. If no periodic topping &#10; charge is applied, under-charge conditions (sulfation) &#10; may occur, which can lead to unrecoverable capacity &#10; loss. &lt;/p&gt; &lt;/td&gt; &lt;td width="204" valign="top" bgcolor="#F3F3F3"&gt; &#10; &lt;p&gt;Battery life may be reduced due to &#10; elevated battery temperature while charging. A hot battery &#10; may fail to reach the cell voltage limit, causing harmful &#10; over charge. &lt;/p&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td valign="top" colspan="3"&gt; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;p&gt;&lt;a name="_Ref501872132"&gt;&lt;/a&gt;&lt;a name="_Toc502116691"&gt;&lt;/a&gt;&lt;a name="_Toc507815251"&gt;&lt;span class="caption"&gt;Figure&amp;nbsp;4-4:&amp;nbsp;Effects of charge &#10; voltage on a plastic SLA battery&lt;/span&gt;.&lt;/a&gt;&lt;br /&gt; &lt;span class="caption-sub"&gt;Large VRLA and the cylindrical Hawker &#10; cell may have different requirements.&lt;/span&gt;&lt;/p&gt; &lt;p&gt;The charge voltage limit indicated in Figure&amp;nbsp;4-4 &#10; is a momentary voltage peak and the battery cannot dwell on &#10; that level. This voltage crest is only used when applying &#10; a full charge cycle to a battery that has been discharged. &#10; Once fully charged and at operational readiness, a float charge &#10; is applied, which is held constant at a lower voltage level. &#10; The recommended float charge voltage of most low-pressure &#10; lead acid batteries is between 2.25&amp;nbsp;to 2.30V/cell. A &#10; good compromise is 2.27V.&lt;/p&gt; &lt;p&gt;The optimal float charge voltage shifts with &#10; temperature. A higher temperature demands slightly lower voltages &#10; and a lower temperature demands higher voltages. Chargers &#10; that are exposed to large temperature fluctuations are equipped &#10; with temperature sensors to optimize the float voltage.&lt;/p&gt; &lt;p&gt;Regardless of how well the float voltage may &#10; be compensated, there is always a compromise. The author of &#10; a paper in a battery seminar explained that charging a sealed &#10; lead acid battery using the traditional float charge techniques &#10; is like 'dancing on the head of a pin'. The battery wants &#10; to be fully charged to avoid sulfation on the negative plate, &#10; but does not want to be over-saturated which causes grid corrosion &#10; on the positive plate. In addition to grid corrosion, too &#10; high a float charge contributes to loss of electrolyte.&lt;/p&gt; &lt;p&gt;Differences in the aging of the cells create &#10; another challenge in finding the optimum float charge voltage. &#10; With the development of air pockets within the cells over &#10; time, some batteries exhibit hydrogen evolution from overcharging. &#10; Others undergo oxygen recombination in an almost starved state. &#10; Since the cells are connected in series, controlling the individual &#10; cell voltages during charge is virtually impossible. If the &#10; applied cell voltage is too high or too low for a given cell, &#10; the weaker cell deteriorates further and its condition becomes &#10; more pronounced with time. Companies have developed cell-balancing &#10; devices that correct some of these problems but these devices &#10; can only be applied if access to individual cells is possible.&lt;/p&gt; &lt;p&gt;A ripple voltage imposed on the charge voltage &#10; also causes problems for lead acid batteries, especially the &#10; larger VRLA. The peak of the ripple voltage constitutes an &#10; overcharge, causing hydrogen evolution; the valleys induce &#10; a brief discharge causing a starved state. Electrolyte depletion &#10; may be the result.&lt;/p&gt; &lt;p&gt;Much has been said about pulse charging lead &#10; acid batteries. Although there are obvious benefits of reduced &#10; cell corrosion, manufacturers and service technicians are &#10; not in agreement regarding the benefit of such a charge method. &#10; Some advantages are apparent if pulse charging is applied &#10; correctly, but the results are non-conclusive.&lt;/p&gt; &lt;p&gt;Whereas the voltage settings in Figure&amp;nbsp;4-4 &#10; apply to low-pressure lead acid batteries with a pressure &#10; relief valve setting of about 34&amp;nbsp;kPa (5&amp;nbsp;psi), the &#10; cylindrical SLA by Hawker requires higher voltage settings. &#10; These voltage limits should be set according to the manufacturer’s &#10; specifications. Failing to apply the recommended voltage threshold &#10; for these batteries causes a gradual decrease in capacity &#10; due to sulfation. Typically, the Hawker cell has a pressure &#10; relief setting of 345&amp;nbsp;kPa (50&amp;nbsp;psi). This allows &#10; some recombination of the gases during charge.&lt;/p&gt; &lt;p&gt;An SLA must be stored in a charged state. A topping &#10; charge should be applied every six months to avoid the voltage &#10; from dropping below 2.10V/cell. The topping charge requirements &#10; may differ with cell manufacturers. Always follow the time &#10; intervals recommended by the manufacturer.&lt;/p&gt; &lt;p&gt;By measuring the open cell voltage while in storage, &#10; an approximate charge-level indication can be obtained. A &#10; voltage of 2.11V, if measured at room temperature, reveals &#10; that the cell has a charge of 50&amp;nbsp;percent and higher. &#10; If the voltage is at or above this threshold, the battery &#10; is in good condition and only needs a full charge cycle prior &#10; to use. If the voltage drops below 2.10V, several discharge/charge &#10; cycles may be required to bring the battery to full performance. &#10; When measuring the terminal voltage of any cell, the storage &#10; temperature should be observed. A cool battery raises the &#10; voltage slightly and a warm one lowers&amp;nbsp;it.&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>04. Proper Charge Methods 7</title><link>https://technick.net/guides/electronics/bpw/c04_07/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c04_07/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c04_06"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c04_08"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;&lt;/p&gt; &lt;p&gt;Plastic SLA batteries arriving from vendors with &#10; less than 2.10V per cell are rejected by some buyers who inspect &#10; the battery during quality control. Low voltage suggests that &#10; the battery may have a soft short, a defect that cannot be &#10; corrected with cycling. Although cycling may increase the &#10; capacity of these batteries, the extra cycles compromise the &#10; service life of the battery. Furthermore, the time and equipment &#10; required to make the battery fully functional adds to operational &#10; costs.&lt;/p&gt; &lt;p&gt;The Hawker cell can be stored at voltages as &#10; low as 1.81V. However, when reactivating the cells, a higher &#10; than normal charge voltage may be required to convert the &#10; large sulfite crystals back to good active material.&lt;/p&gt; &lt;p class="Standout"&gt;&lt;span class="warning"&gt;Caution:&lt;/span&gt; When &#10; charging a lead acid battery with over-voltage, current limiting &#10; must be applied once the battery starts to draw full current. &#10; Always set the current limit to the lowest practical setting &#10; and observe the battery voltage and temperature during the &#10; procedure. If the battery does not accept a normal charge &#10; after 24&amp;nbsp;hours under elevated voltage, a return to normal &#10; condition is unlikely.&lt;/p&gt; &lt;p&gt;The price of the Hawker cell is slightly higher &#10; than that of the plastic equivalent, but lower than the NiCd. &#10; Also known as the ‘Cyclone’, this cell is wound &#10; similar to a cylindrical NiCd. This construction improves &#10; the cell’s stability and provides higher discharge currents &#10; when compared to the flat plate SLA. Because of its relatively &#10; low self-discharge, Hawker cells are well suited for defibrillators &#10; that are used on standby&amp;nbsp;mode.&lt;/p&gt; &lt;p&gt;Lead acid batteries are preferred for UPS systems. &#10; During prolonged float charge, a periodic topping charge, &#10; also known as an ‘equalizing charge’, is recommended &#10; to fully charge the plates and prevent sulfation. An equalizing &#10; charge raises the battery voltage for several&amp;nbsp;hours to &#10; a voltage level above that specified by the manufacturer. &#10; Loss of electrolyte through elevated temperature may occur &#10; if the equalizing charge is not administered correctly. Because &#10; no liquid can be added to the SLA and VRLA systems, a reduction &#10; of the electrolyte will cause irreversible damage. Manufacturers &#10; and service personnel are often divided on the benefit of &#10; the equalizing charge.&lt;/p&gt; &lt;p&gt;Some exercise, or brief periodic discharge, is &#10; believed to prolong battery life of lead acid systems. If &#10; applied once a month as part of an exercising program, the &#10; depth of discharge should only be about 10&amp;nbsp;percent of &#10; its total capacity. A full discharge as part of regular maintenance &#10; is not recommended because each deep discharge cycle robs &#10; service life from the battery.&lt;/p&gt; &lt;p&gt;More experiments are needed to verify the benefit &#10; of exercising lead acid batteries. Again, manufacturers and &#10; service technicians express different views on how preventive &#10; maintenance should be carried out. Some experts prefer a topping &#10; charge while others recommend scheduled discharges. No scientific &#10; data is available on the benefit of frequent shallow discharges &#10; as opposed to fewer deep discharges or discharge pulses.&lt;/p&gt; &lt;p&gt;Disconnecting the float charge while the VRLA &#10; is on standby is another method of prolonging battery life. &#10; From time-to-time, a topping charge is applied to replenish &#10; the energy lost through self-discharge. This is said to lower &#10; cell corrosion and prolong battery life. In essence, the battery &#10; is kept as if it was in storage. This only works for applications &#10; that do not draw a load current during standby. In many applications, &#10; the battery acts as an energy buffer and needs to be under &#10; continuous charge.&lt;/p&gt; &lt;p class="Standout"&gt;&lt;span class="warning"&gt;Important:&lt;/span&gt; In &#10; case of rupture, leaking electrolyte or any other cause of &#10; exposure to the electrolyte, flush with water immediately. &#10; If eye exposure occurs, flush with water for 15&amp;nbsp;minutes &#10; and consult a physician immediately.&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>04. Proper Charge Methods 8</title><link>https://technick.net/guides/electronics/bpw/c04_08/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c04_08/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c04_07"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c04_09"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;4.5 Charging the Lithium Ion Battery&lt;/h4&gt;&lt;p&gt;&lt;a name="_Toc507909167"&gt;&lt;/a&gt; &lt;/p&gt;&lt;p&gt;The Li-ion charger is a voltage-limiting &#10; device similar to the lead acid battery charger. The difference &#10; lies in a higher voltage per cell, tighter voltage tolerance &#10; and the absence of trickle&amp;nbsp;or float charge when full charge &#10; is reached.&lt;/p&gt; &lt;p&gt;While the lead acid battery offers some flexibility &#10; in terms of voltage cut-off, manufacturers of Li-ion &#10; cells are very strict on setting the correct voltage. When &#10; the Li-&amp;nbsp;ion was first introduced, the graphite system &#10; demanded a charge voltage limit of 4.10V/cell. Although higher &#10; voltages deliver increased energy densities, cell oxidation &#10; severely limited the service life in the early graphite cells &#10; that were charged above the 4.10V/cell threshold. This effect &#10; has been solved with chemical additives. Most commercial Li-ion &#10; cells can now be charged to 4.20V. The tolerance on all Li-ion &#10; batteries is a tight +/-0.05V/cell.&lt;/p&gt; &lt;p&gt;Industrial and military Li-ion batteries &#10; designed for maximum cycle life use an end-of-charge voltage &#10; threshold of about 3.90V/cell. These batteries are rated lower &#10; on the watt-hour-per-kilogram scale, but longevity takes precedence &#10; over high energy density and small&amp;nbsp;size.&lt;/p&gt; &lt;p&gt;The charge time of all Li-ion&amp;nbsp;batteries, &#10; when charged at a 1C initial current, is about 3&amp;nbsp;hours. &#10; The battery remains cool during charge. Full charge is attained &#10; after the voltage has reached the upper voltage threshold &#10; and the current has dropped and leveled off at about 3&amp;nbsp;percent &#10; of the nominal charge current.&lt;/p&gt; &lt;p&gt;Increasing the charge current on a Li-ion &#10; charger does not shorten the charge time by much. Although &#10; the voltage peak is reached quicker with higher current, the &#10; topping charge will take longer. Figure&amp;nbsp;4-5 shows &#10; the voltage and current signature of a charger as the Li-ion &#10; cell passes through stage one and&amp;nbsp;two.&lt;/p&gt; &lt;p&gt;Some chargers claim to fast-charge a Li-ion &#10; battery in one&amp;nbsp;hour or less. Such a charger eliminates &#10; stage&amp;nbsp;2 and goes directly to ‘ready’ once the &#10; voltage threshold is reached at the end of stage 1. The charge &#10; level at this point is about 70&amp;nbsp;percent. The topping &#10; charge typically takes twice as long as the initial charge.&lt;/p&gt; &lt;p&gt;No trickle charge is applied because the Li-ion &#10; is unable to absorb overcharge. Trickle charge could cause &#10; plating of metallic lithium, a condition that renders the &#10; cell unstable. Instead, a brief topping charge is applied &#10; to compensate for the small amount of self-discharge the battery &#10; and its protective circuit consume.&lt;/p&gt; &lt;p&gt;Depending on the charger and the self-discharge &#10; of the battery, a topping charge may be implemented once every &#10; 500&amp;nbsp;hours or 20&amp;nbsp;days. Typically, the charge kicks &#10; in when the open terminal voltage drops to 4.05V/cell and &#10; turns off when it reaches 4.20V/cell again.&lt;/p&gt; &lt;p&gt;&lt;img width="455" height="423" chap4="" iles="" mage013="" if="" hapes="_x0000_i1025" src="https://technick.net/img/guide_bpw2/c04_06.gif" border="0" alt="" /&gt;&lt;/p&gt; &lt;p&gt;&lt;a name="_Ref501873117"&gt;&lt;/a&gt;&lt;a name="_Toc502116692"&gt;&lt;/a&gt;&lt;a name="_Ref506002557"&gt;&lt;/a&gt;&lt;a name="_Toc507815252" class="caption"&gt;Figure&amp;nbsp;4-5:&amp;nbsp;&amp;nbsp;&amp;nbsp; &#10; Charge stages of a Li-ion battery.&lt;/a&gt;&lt;br /&gt; &lt;span class="caption-sub"&gt;Increasing the charge current on &#10; a Li-ion charger does not shorten the charge time by much. &#10; Although the voltage peak is reached quicker with higher current, &#10; the topping charge will take longer.&lt;/span&gt;&lt;/p&gt; &lt;p&gt;What if a battery is inadvertently overcharged? &#10; Li-ion batteries are designed to operate safely within &#10; their normal operating voltage but become increasingly unstable &#10; if charged to higher voltages. On a charge voltage above 4.30V, &#10; the cell causes lithium metal plating on the anode. In addition, &#10; the cathode material becomes an oxidizing agent, loses stability &#10; and releases oxygen. Overcharging causes the cell to heat&amp;nbsp;up.&lt;/p&gt; &lt;p&gt;Much attention has been placed on the safety &#10; of the Li-ion battery. Commercial Li-ion battery &#10; packs contain a protection circuit&amp;nbsp;that prevents the cell &#10; voltage from going too high while charging. The typical safety &#10; threshold is set to 4.30V/cell. In addition, temperature sensing&amp;nbsp;disconnects &#10; the charge if the internal temperature approaches 90&amp;deg;C (194&amp;deg;F). &#10; Most cells feature a mechanical pressure switch that permanently &#10; interrupts the current path if a safe pressure threshold is &#10; exceeded. Internal voltage control circuits cut off the battery &#10; at low and high voltage points.&lt;/p&gt; &lt;p&gt;Exceptions are made on some spinel (manganese) &#10; packs containing one or two small cells. On overcharge, this &#10; chemistry produces minimal lithium plating on the anode because &#10; most metallic lithium has been removed from the cathode during &#10; normal charging. The cathode material remains stable and does &#10; not generate oxygen unless the cell gets extremely&amp;nbsp;hot.&lt;/p&gt; &lt;p class="Standout"&gt;&lt;span class="warning"&gt;Important:&lt;/span&gt; In &#10; case of rupture, leaking electrolyte or any other cause of &#10; exposure to the electrolyte, flush with water immediately. &#10; If eye exposure occurs, flush with water for 15&amp;nbsp;minutes &#10; and consult a physician immediately.&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>04. Proper Charge Methods 9</title><link>https://technick.net/guides/electronics/bpw/c04_09/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c04_09/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c04_08"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c04_10"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;4.6 Charging the Lithium Polymer Battery&lt;/h4&gt;&lt;p&gt;&lt;a name="_Toc507909168"&gt;&lt;/a&gt; &lt;/p&gt;&lt;p&gt;The charge process of a Li-Polymer is similar &#10; to that of the Li-ion. Li-Polymer uses dry electrolyte &#10; and takes 3 to 5&amp;nbsp;hours to charge. Li-ion polymer &#10; with gelled electrolyte, on the other hand, is almost identical &#10; to that of Li-ion. In fact, the same charge algorithm &#10; can be applied. With most chargers, the user does not need &#10; to know whether the battery being charged is Li-ion &#10; or Li-ion polymer.&lt;/p&gt; &lt;p&gt;Almost all commercial batteries sold under the &#10; so-called ‘Polymer’ category are a variety of the &#10; Li-ion polymer using some sort of gelled electrolyte. &#10; A low-cost dry polymer battery operating at ambient temperatures &#10; is still some years&amp;nbsp;away.&lt;/p&gt;&lt;a name="_Ref503247351"&gt;&lt;/a&gt;&lt;a name="_Ref503247355"&gt;&lt;/a&gt;&lt;a name="_Toc507909169"&gt;&lt;/a&gt;&lt;h4&gt;4.7 Charging at High and Low Temperatures&lt;/h4&gt; &lt;p&gt;Rechargeable batteries can be used under a reasonably &#10; wide temperature range. This, however, does not automatically &#10; mean that the batteries can also be charged at these temperature &#10; conditions. While the use of batteries under hot or cold conditions &#10; cannot always be avoided, recharging time is controlled by &#10; the user. Efforts should be made to charge the batteries only &#10; at room temperatures.&lt;/p&gt; &lt;p&gt;In general, older battery technologies such as &#10; the NiCd are more tolerant to charging at low and high temperatures &#10; than the more advanced systems. &lt;i&gt;Figure&amp;nbsp;4-6&lt;/i&gt; &#10; indicates the permissible slow and fast charge temperatures &#10; of the NiCd, NiMH, SLA and Li-ion. &lt;br /&gt; &lt;br /&gt; &lt;/p&gt; &lt;table border="0" cellspacing="0" cellpadding="3" width="100%"&gt; &lt;tr&gt; &#10; &lt;td width="27%" valign="top" bgcolor="#E6E6E6"&gt;&amp;nbsp; &#10; &lt;/td&gt; &lt;td width="36%" valign="top" bgcolor="#E6E6E6"&gt; &#10; &lt;p align="center"&gt;&lt;b&gt;Slow &#10; Charge (0.1)&lt;/b&gt;&lt;/p&gt; &lt;/td&gt; &lt;td width="36%" valign="top" bgcolor="#E6E6E6"&gt; &#10; &lt;p align="center"&gt;&lt;b&gt;Fast &#10; Charge (0.5-1C)&lt;/b&gt;&lt;/p&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="27%" valign="top"&gt; &#10; &lt;p&gt;&lt;b&gt;Nickel Cadmium&lt;/b&gt;&lt;/p&gt; &lt;/td&gt; &lt;td width="36%" valign="top"&gt; &#10; &lt;p align="center"&gt;0&amp;deg;C &#10; to 45&amp;deg;C (32&amp;deg;F to 113&amp;deg;F)&lt;/p&gt; &lt;/td&gt; &lt;td width="36%" valign="top"&gt; &#10; &lt;p align="center"&gt;5&amp;deg;C &#10; to 45&amp;deg;C (41&amp;deg;F to 113&amp;deg;F)&lt;/p&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="27%" valign="top" bgcolor="#F3F3F3"&gt; &#10; &lt;p&gt;&lt;b&gt;Nickel-Metal Hydride&lt;/b&gt;&lt;/p&gt; &lt;/td&gt; &lt;td width="36%" valign="top" bgcolor="#F3F3F3"&gt; &#10; &lt;p align="center"&gt;0&amp;deg;C &#10; to 45&amp;deg;C (32&amp;deg;F to 113&amp;deg;F)&lt;/p&gt; &lt;/td&gt; &lt;td width="36%" valign="top" bgcolor="#F3F3F3"&gt; &#10; &lt;p align="center"&gt;10C&amp;deg; &#10; to 45&amp;deg;C (50&amp;deg;F to 113&amp;deg;F)&lt;/p&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="27%" valign="top"&gt; &#10; &lt;p&gt;&lt;b&gt;Lead Acid&lt;/b&gt;&lt;/p&gt; &lt;/td&gt; &lt;td width="36%" valign="top"&gt; &#10; &lt;p align="center"&gt;0&amp;deg;C &#10; to 45&amp;deg;C (32&amp;deg;F to 113&amp;deg;F)&lt;/p&gt; &lt;/td&gt; &lt;td width="36%" valign="top"&gt; &#10; &lt;p align="center"&gt;5C&amp;deg; &#10; to 45&amp;deg;C (41&amp;deg;F to 113&amp;deg;F)&lt;/p&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="27%" valign="top" bgcolor="#F3F3F3"&gt; &#10; &lt;p&gt;&lt;b&gt;Lithium Ion&lt;/b&gt;&lt;/p&gt; &lt;/td&gt; &lt;td width="36%" valign="top" bgcolor="#F3F3F3"&gt; &#10; &lt;p align="center"&gt;0&amp;deg;C &#10; to 45&amp;deg;C (32&amp;deg;F to 113&amp;deg;F)&lt;/p&gt; &lt;/td&gt; &lt;td width="36%" valign="top" bgcolor="#F3F3F3"&gt; &#10; &lt;p align="center"&gt;5C&amp;deg; &#10; to 45&amp;deg;C (41&amp;deg;F to 113&amp;deg;F)&lt;/p&gt; &lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;p&gt;&lt;a name="_Ref501873424"&gt;&lt;/a&gt;&lt;a name="_Toc502116693"&gt;&lt;/a&gt;&lt;a name="_Toc507815253" class="caption"&gt;Figure&amp;nbsp;4-6:&amp;nbsp;Permissible temperature &#10; limits for various batteries.&lt;/a&gt;&lt;br /&gt; &lt;span class="caption-sub"&gt;Older battery technologies are more &#10; tolerant to charging at extreme temperatures than newer, more &#10; advanced systems.&lt;/span&gt;&lt;/p&gt; &lt;p&gt;NiCd batteries can be fast-charged in an hour &#10; or so, however, such a fast charge can only be applied within &#10; temperatures of 5&amp;deg;C and 45&amp;deg;C (41&amp;deg;F and&amp;nbsp;113&amp;deg;F). More moderate &#10; temperatures of 10&amp;deg;C to 30&amp;deg;C (50&amp;deg;F to 86&amp;deg;F) produce better &#10; results. When charging a NiCd below 5&amp;deg;C (41&amp;deg;F), the ability &#10; to recombine oxygen and hydrogen is greatly reduced and pressure &#10; build up occurs as a result. In some cases, the cells vent, &#10; releasing oxygen and hydrogen. Not only do the escaping gases &#10; deplete the electrolyte, hydrogen is highly flammable!&lt;/p&gt; &lt;p&gt;Chargers featuring NDV to terminate full-charge &#10; provide some level of protection when fast-charging at low &#10; temperatures. Because of the battery’s poor charge acceptance &#10; at low temperatures, the charge energy is turned into oxygen &#10; and to a lesser amount hydrogen. This reaction causes cell &#10; voltage drop, terminating the charge through NDV detection. &#10; When this occurs, the battery may not be fully charged, but &#10; venting is avoided or minimized.&lt;/p&gt; &lt;p&gt;To compensate for the slower reaction at temperatures &#10; below 5&amp;deg;C, a low charge rate of 0.1C must be applied. Special &#10; charge methods are available for charging at cold temperatures. &#10; Industrial batteries that need to be fast-charged at low temperatures &#10; include a thermal blanket that heats the battery to an acceptable &#10; temperature. Among commercial batteries, the NiCd is the only &#10; battery that can accept charge at extremely low temperatures.&lt;/p&gt; &lt;p&gt;Charging at high temperatures reduces the oxygen &#10; generation. This reduces the NDV effect and accurate full-charge &#10; detection using this method becomes difficult. To avoid overcharge, &#10; charge termination by temperature measurement becomes more &#10; practical.&lt;/p&gt; &lt;p&gt;The charge acceptance of a NiCd at higher temperatures &#10; is drastically reduced. A battery that provides a capacity &#10; of 100&amp;nbsp;percent if charged at moderate room temperature &#10; can only accept 70&amp;nbsp;percent if charged at 45&amp;deg;C (113&amp;deg;F), &#10; and 45&amp;nbsp;percent if charged at 60&amp;deg;C (140&amp;deg;F) (see Figure&amp;nbsp;4-7). &#10; Similar conditions apply to the NiMH battery. This demonstrates &#10; the typically poor summer performance of vehicular mounted &#10; chargers using nickel-based batteries.&lt;/p&gt; &lt;p&gt;Another reason for poor battery performance, &#10; especially if charged at high ambient temperatures, is premature &#10; charge cutoff. This is common with chargers that use absolute &#10; temperature to terminate the fast charge. These chargers read &#10; the SoC on battery temperature alone and are fooled when the &#10; room temperature is high. The battery may not be fully charged, &#10; but a timely charge cut-off protects the battery from damage &#10; due to excess&amp;nbsp;heat.&lt;/p&gt; &lt;p&gt;The NiMH is less forgiving than the NiCd if charged &#10; under high and low temperatures. The NiMH cannot be fast charged &#10; below 10&amp;deg;C (45&amp;deg;F), neither can it be slow charged below 0&amp;deg;C &#10; (32&amp;deg;F). Some industrial chargers adjust the charge rate to &#10; prevailing temperatures. Price sensitivity on consumer chargers &#10; does not permit elaborate temperature control features.&lt;/p&gt; &lt;p style="'"&gt;&lt;img width="464" height="287" src="https://technick.net/img/guide_bpw2/c04_07.gif" v:shapes="_x0000_i1027" border="0" alt="" /&gt;&lt;/p&gt; &lt;p&gt;&lt;a name="_Ref501873549"&gt;&lt;/a&gt;&lt;a name="_Toc502116694"&gt;&lt;/a&gt;&lt;a name="_Toc507815254" class="caption"&gt;Figure&amp;nbsp;4-7:&amp;nbsp;&amp;nbsp;&amp;nbsp; Effects of temperature &#10; on NiCd charge acceptance.&lt;/a&gt;&lt;br /&gt; &lt;span class="caption-sub"&gt;Charge acceptance is much reduced &#10; at higher temperatures. NiMH cells follow a similar pattern.&lt;/span&gt;&lt;/p&gt; &lt;p&gt;The lead acid battery is reasonably forgiving &#10; when it comes to temperature extremes, as in the case of car &#10; batteries. Part of this tolerance is credited to the sluggishness &#10; of the lead acid battery. A full charge under ten&amp;nbsp;hours &#10; is difficult, if not impossible. The recommended charge rate &#10; at low temperature is&amp;nbsp;0.3C.&lt;/p&gt; &lt;p&gt;Figure&amp;nbsp;4-8 indicates the optimal peak &#10; voltage at various temperatures when recharging and float &#10; charging an SLA battery. Implementing temperature compensation &#10; on the charger to adjust to temperature extremes prolongs &#10; the battery life by up to 15&amp;nbsp;percent. This is especially &#10; true when operating at higher temperatures.&lt;/p&gt; &lt;p&gt;An SLA battery should never be allowed to freeze. &#10; If this were to occur, the battery would be permanently damaged &#10; and would only provide a few cycles when it returned to normal &#10; temperature.&lt;br /&gt; &lt;br /&gt; &lt;/p&gt; &lt;table border="0" cellspacing="0" cellpadding="3" width="100%"&gt; &lt;tr&gt; &#10; &lt;td colspan="4" valign="top"&gt; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="31%" valign="top" bgcolor="#E6E6E6"&gt;&amp;nbsp; &lt;/td&gt; &lt;td width="22%" valign="top" bgcolor="#E6E6E6"&gt; &lt;b class="table-bolder"&gt;0&amp;deg;C &#10; (32&amp;deg;F)&lt;/b&gt;&lt;/td&gt; &lt;td width="22%" valign="top" bgcolor="#E6E6E6"&gt; &lt;b class="table-bolder"&gt;25&amp;deg;C &#10; (77&amp;deg;F)&lt;/b&gt;&lt;/td&gt; &lt;td width="22%" valign="top" bgcolor="#E6E6E6"&gt; &lt;b class="table-bolder"&gt;40&amp;deg;C &#10; (104&amp;deg;F)&lt;/b&gt;&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td colspan="4" valign="top"&gt; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="31%" valign="top"&gt; &lt;b class="table-bolder"&gt;Voltage &#10; limit on recharge&lt;/b&gt;&lt;/td&gt; &lt;td width="22%" valign="top"&gt; 2.55V/cell&lt;/td&gt; &lt;td width="22%" valign="top"&gt; 2.45V/cell&lt;/td&gt; &lt;td width="22%" valign="top"&gt; 2.35V/cell&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="31%" valign="top" bgcolor="#F3F3F3"&gt; &lt;b class="table-bolder"&gt;Continuous &#10; float voltage &lt;/b&gt;&lt;/td&gt; &lt;td width="22%" valign="top" bgcolor="#F3F3F3"&gt; 2.35V/cell &#10; or lower&lt;/td&gt; &lt;td width="22%" valign="top" bgcolor="#F3F3F3"&gt; 2.30V/cell &#10; or lower&lt;/td&gt; &lt;td width="22%" valign="top" bgcolor="#F3F3F3"&gt; 2.25V/cell &#10; or lower&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td colspan="4" valign="top"&gt; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;p&gt;&lt;a name="_Toc502116695"&gt;&lt;/a&gt;&lt;a name="_Ref503153153"&gt;&lt;/a&gt;&lt;a name="_Toc507815255" class="caption"&gt;Figure&amp;nbsp;4-8:&amp;nbsp;Recommended voltage limits &#10; on recharge and float charge of SLAs.&lt;/a&gt;&lt;br /&gt; &lt;span class="caption-sub"&gt;These voltage limits should be applied &#10; when operating at temperature extremes.&lt;/span&gt;&lt;/p&gt; &lt;p&gt;To improve charge acceptance of SLA batteries &#10; in colder temperatures, and avoid thermal runaway in warmer &#10; temperatures, the voltage limit of a charger should be compensated &#10; by approximately 3mV per cell per degree Celsius. The voltage &#10; adjustment has a negative coefficient, meaning that the voltage &#10; threshold drops as the temperature increases. For example, &#10; if the voltage limit is set to 2.40V/cell at 20&amp;deg;C, the setting &#10; should be lowered to 2.37V/cell at 30&amp;deg;C and raised to 2.43V/cell &#10; at 10&amp;deg;C. This represents a 30mV correction per cell per 10 &#10; degrees Celsius.&lt;/p&gt; &lt;p&gt;The Li-ion batteries offer good cold and &#10; hot temperature charging performance. Some cells allow charging &#10; at 1C from 0&amp;deg;C to 45&amp;deg;C (32&amp;deg;F to 113&amp;deg;F). Most Li-ion &#10; cells prefer a lower charge current when the temperature gets &#10; down to 5&amp;deg;C (41&amp;deg;F) or colder. Charging below freezing must &#10; be avoided because plating of lithium metal could occur.&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>04. Relation to functions positive real in the right-half plane</title><link>https://technick.net/guides/theory/edft/004/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/edft/004/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/filters/"&gt;Introduction to Digital Filters with Audio Applications&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, Copyright &amp;#169; &lt;i&gt;2017-11-26&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/edft/003"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/000"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/022"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/005"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;Relation to functions positive real in the right-half plane&lt;/h3&gt;&lt;p&gt;&lt;b&gt;Theorem. &lt;/b&gt; &lt;!-- MATH&#10; $\mbox{re}\left\{H(z)\right\}\geq 0\ for\ \left|z\right|\geq 1 \quad\\forall \quad \mbox{re}\left\{H\left(\frac{\alpha+s}{ \alpha-s}\right)\right\}\geq 0\ &#10; for\ Re\{s\}\geq 0$&#10; --&gt;&lt;img width="557" height="46" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img157.gif" alt="$\" box="" e="" eft\="" z="" ight\="" eq="" or="" eft\vert="" ight\vert\geq="" uad="" h\left="" rac="" lpha="" s="" lpha-s="" ight="" ight\="" eq="" or="" s\="" eq="" /&gt;, where &lt;img width="17" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img158.gif" alt="$\" lpha="" /&gt; is any &lt;a href="https://technick.net/guides/theory/edft/001"&gt;positive real&lt;/a&gt; number.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Proof. &lt;/b&gt; We shall show that the change of variable &lt;!-- MATH&#10; $z\leftarrow (\alpha+s)/(\alpha-s),\; \alpha&gt;0$&#10; --&gt;&lt;img width="231" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img159.gif" alt="$z\" eftarrow="" lpha="" s="" lpha-s="" lpha="" t="" /&gt;,&#10; provides a conformal map from the z-plane to the s-plane that takes the&#10; region &lt;!-- MATH&#10; $\left|z\right|\geq 1$&#10; --&gt;&lt;img width="60" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img160.gif" alt="$\" eft\vert="" ight\vert\geq="" /&gt; to the region &lt;!-- MATH&#10; $\mbox{re}\left\{s\right\}\geq 0$&#10; --&gt;&lt;img width="85" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img161.gif" alt="$\" box="" e="" eft\="" right\="" eq="" /&gt;. The general formula for a&#10; bilinear conformal mapping of functions of a complex variable is given by&#10; &lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\frac{(z-z_1)(z_2-z_3)}{ (z-z_3)(z_2-z_1)} = &#10; \frac{(s-s_1)(s_2-s_3)}{ (s-s_3)(s_2-s_1)}.&#10;\end{displaymath}&#10; --&gt;&lt;a name="eq:CM"&gt;&lt;/a&gt;&lt;a name="eq:CM"&gt;&lt;/a&gt;&lt;img width="334" height="57" border="0" src="https://technick.net/img/guide_edft/guide_edft_img162.gif" alt="\" egin="" isplaymath="" rac="" z="" z="" z="" z="" rac="" s="" s="" s="" s="" s="" s="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;In general, a &lt;a href="https://ccrma.stanford.edu/~jos//bbt/Bilinear_Transform.html" target="_blank"&gt;bilinear transformation&lt;/a&gt; maps circles and lines into circles&#10; and lines [&lt;a href="https://technick.net/guides/theory/edft/023#Churchill"&gt;Churchill&amp;nbsp;1960&lt;/a&gt;]. We see that the choice of three specific points&#10; and their images determines the mapping for all &lt;img width="14" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img163.gif" alt="$s$" /&gt; and &lt;img width="14" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img1.gif" alt="$z$" /&gt;.&#10; We must have that the imaginary axis in the s-plane maps to the unit circle&#10; in the z-plane. &#10; That is, we may determine the mapping by three points of the form&#10; &lt;!-- MATH&#10; $z_i=e^{j\theta_i}$&#10; --&gt;&lt;img width="71" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img164.gif" alt="$z_i=e^{j\" heta="" i="" /&gt; and &lt;!-- MATH&#10; $s_i=j\omega_i,\;i=1,2,3$&#10; --&gt;&lt;img width="160" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img165.gif" alt="$s_i=j\" mega="" i="" /&gt;.&#10; If we predispose one such mapping by choosing the pairs&#10; &lt;!-- MATH&#10; $(s_1=\pm\infty ) \forall (z_1= -1)$&#10; --&gt;&lt;img width="186" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img166.gif" alt="$(s_1=\" m\infty="" orall="" /&gt; and &lt;!-- MATH&#10; $(s_3=0)\forall(z_3=1)$&#10; --&gt;&lt;img width="146" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img167.gif" alt="$(s_3=0)\" orall="" /&gt;, then we are left with&#10; transformations of the form&#10; &lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;s=\left(s_2 \frac{z_2+1}{ z_2-1}\right)\left( \frac{z-1}{ z+1}\right)&#10;&#9;=\alpha\left( \frac{z-1}{ z+1}\right)&#10;\end{displaymath}&#10; --&gt;&lt;img width="337" height="53" border="0" src="https://technick.net/img/guide_edft/guide_edft_img168.gif" alt="\" egin="" isplaymath="" left="" s="" frac="" z="" ight="" eft="" rac="" z="" ight="" lpha\left="" rac="" z="" ight="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;or&#10; &lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;z\leftarrow \frac{\alpha+s}{ \alpha-s},&#10;\end{displaymath}&#10; --&gt;&lt;a name="eq:ztos"&gt;&lt;/a&gt;&lt;a name="eq:ztos"&gt;&lt;/a&gt;&lt;img width="100" height="50" border="0" src="https://technick.net/img/guide_edft/guide_edft_img169.gif" alt="\" egin="" isplaymath="" leftarrow="" rac="" lpha="" s="" lpha-s="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Letting &lt;img width="21" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img170.gif" alt="$s_2$" /&gt; be some point &lt;img width="26" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img171.gif" alt="$j\" mega="" /&gt; on the imaginary axis,&#10; and &lt;img width="21" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img172.gif" alt="$z_2$" /&gt; be some point &lt;img width="27" height="20" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img173.gif" alt="$e^{j\" heta="" /&gt; on the unit circle, we find that&#10; &lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\alpha = j\omega \frac{e^{j\theta} + 1}{ e^{j\theta} -1 }&#10; = \omega \frac{\sin\theta}{ 1-\cos\theta}&#10; = \omega\cot(\theta/2)&#10;\end{displaymath}&#10; --&gt;&lt;img width="370" height="55" border="0" src="https://technick.net/img/guide_edft/guide_edft_img174.gif" alt="\" egin="" isplaymath="" lpha="j\omega" frac="" j\theta="" j\theta="" ega="" rac="" in\theta="" os\theta="" mega\cot="" heta="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;which gives us that &lt;img width="17" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img158.gif" alt="$\" lpha="" /&gt; is real. To avoid degeneracy, we require&#10; &lt;!-- MATH&#10; $s_2\neq 0,\infty ,\;z_2\neq \pm1$&#10; --&gt;&lt;img width="162" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img175.gif" alt="$s_2\" eq="" nfty="" neq="" m1="" /&gt;, and this translates to &lt;img width="17" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img158.gif" alt="$\" lpha="" /&gt; finite and&#10; nonzero. Finally, to make the unit disk map to the &lt;i&gt;left&lt;/i&gt;-half s-plane,&#10; &lt;img width="17" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img129.gif" alt="$\" mega="" /&gt; and &lt;img width="14" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img92.gif" alt="$\" heta="" /&gt; must have the same sign in which case &lt;img width="51" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img176.gif" alt="$\" lpha="" t="" /&gt;.&lt;img width="19" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img13.gif" alt="$\" ox="" /&gt;&lt;p&gt;There is a bonus associated with the restriction that &lt;img width="17" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img158.gif" alt="$\" lpha="" /&gt; be real which&#10;is that &lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;z= \frac{\alpha+s}{ \alpha-s}\in\Re \quad \\forall \quad s = \alpha \frac{z-1}{ z+1}\in\Re .&#10;\end{displaymath}&#10; --&gt;&lt;a name="eq:zrsr"&gt;&lt;/a&gt;&lt;a name="eq:zrsr"&gt;&lt;/a&gt;&lt;img width="356" height="52" border="0" src="https://technick.net/img/guide_edft/guide_edft_img177.gif" alt="\" egin="" isplaymath="" frac="" alpha="" s="" alpha-s="" n\re="" uad="" rall="" uad="" lpha="" rac="" z="" n\re="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;We have therefore proven&lt;/p&gt;&lt;p&gt;&lt;b&gt;Theorem. &lt;/b&gt;&lt;img width="46" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img5.gif" alt="$H(z)$" /&gt; PR &lt;!-- MATH&#10; $\quad\\forall\quad H\left(\frac{\alpha+s}{ \alpha-s}\right)$&#10; --&gt;&lt;img width="143" height="46" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img178.gif" alt="$ \" uad="" rall\quad="" eft="" rac="" lpha="" s="" lpha-s="" ight="" /&gt; PR, &#10;&#9;where &lt;img width="17" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img158.gif" alt="$\" lpha="" /&gt; is any positive real number.&lt;/p&gt;&lt;p&gt;The class of mappings of the form Eq.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/edft/004#eq:CM"&gt;1.3&lt;/a&gt;) which take the exterior of&#10;the unit circle to the right-half plane is larger than the class&#10;Eq.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/edft/004#eq:ztos"&gt;1.3&lt;/a&gt;). For example, we may precede the transformation &#10;Eq.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/edft/004#eq:ztos"&gt;1.3&lt;/a&gt;) by any&#10;conformal map which takes the unit disk to the unit disk, and these&#10;mappings have the algebraic form of a first order complex allpass&#10;whose zero lies inside the unit circle.&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;z\leftarrow e^{j\theta} \frac{w-w_0}{ \overline{w_0}\,w - 1},\qquad \left|w_0\right|&lt;1&#10;\end{displaymath}&#10; --&gt;&lt;a name="eq:map"&gt;&lt;/a&gt;&lt;a name="eq:map"&gt;&lt;/a&gt;&lt;img width="272" height="52" border="0" src="https://technick.net/img/guide_edft/guide_edft_img179.gif" alt="\" egin="" isplaymath="" leftarrow="" theta="" rac="" w="" verline="" w="" quad="" eft\vert="" ight\vert="" t="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where &lt;img width="26" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img180.gif" alt="$w_0$" /&gt; is the zero of the allpass and the image (also pre-image)&#10;of the origin, and &lt;img width="14" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img92.gif" alt="$\" heta="" /&gt; is an angle of pure rotation. Note that&#10;Eq.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/edft/004#eq:map"&gt;1.3&lt;/a&gt;) is equivalent to a pure rotation, followed by a &lt;i&gt;real&lt;/i&gt;allpass substitution (&lt;img width="26" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img180.gif" alt="$w_0$" /&gt; real), followed by a pure rotation. The&#10;general preservation of condition (2) in Def.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/001#def:PR"&gt;2&lt;/a&gt; forces the real axis&#10;to map to the real axis. Thus rotations by other than &lt;img width="16" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img181.gif" alt="$\" i="i" /&gt; are&#10;useless, except perhaps in some special cases. However, we may&#10;precede Eq.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/edft/004#eq:ztos"&gt;1.3&lt;/a&gt;) by the first order &lt;i&gt;real&lt;/i&gt; allpass&#10;substitution&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;z\leftarrow \frac{w-r}{ r\,w - 1},\qquad \left|r\right|&lt;1,\; r\; real,&#10;\end{displaymath}&#10; --&gt;&lt;img width="294" height="50" border="0" src="https://technick.net/img/guide_edft/guide_edft_img182.gif" alt="\" egin="" isplaymath="" leftarrow="" rac="" r="" qquad="" eft\vert="" ight\vert="" t="" real="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;which maps the real axis to the real axis. This leads only to the composite&#10;transformation,&#10; &lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;z \leftarrow \frac{s+ \left(\alpha \frac{1-r}{ 1+r}\right)}{ s- \left(\alpha \frac{1-r}{ 1+r}\right)}&#10;\end{displaymath}&#10; --&gt;&lt;img width="146" height="76" border="0" src="https://technick.net/img/guide_edft/guide_edft_img183.gif" alt="\" egin="" isplaymath="" leftarrow="" rac="" s="" eft="" lpha="" rac="" r="" ight="" left="" lpha="" rac="" r="" ight="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;which is of the form Eq.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/edft/004#eq:ztos"&gt;1.3&lt;/a&gt;) up to a minus sign (rotation by&lt;img width="16" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img181.gif" alt="$\" i="i" /&gt;). By inspection of Eq.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/edft/004#eq:CM"&gt;1.3&lt;/a&gt;), it is clear that sign negation&#10;corresponds to the swapping of points &lt;img width="14" height="16" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img154.gif" alt="$1$" /&gt; and &lt;img width="14" height="16" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img184.gif" alt="$2$" /&gt;, or &lt;img width="14" height="16" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img184.gif" alt="$2$" /&gt; and &lt;img width="14" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img185.gif" alt="$3$" /&gt;.&#10;Thus the only extension we have found by means of the general disk to&#10;disk pre-transform, is the ability to interchange two of the three&#10;points already tried. Consequently, we conclude that the largest&#10;class of &lt;a href="https://ccrma.stanford.edu/~jos//bbt/Bilinear_Transform.html" target="_blank"&gt;bilinear transforms&lt;/a&gt; which convert functions positive real in&#10;the outer disk to functions positive real in the right-half plane is&#10;characterized by&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;z \leftarrow \pm \frac{\alpha+s}{ \alpha-s}.&#10;\end{displaymath}&#10; --&gt;&lt;a name="eq:bltpr"&gt;&lt;/a&gt;&lt;a name="eq:bltpr"&gt;&lt;/a&gt;&lt;img width="116" height="50" border="0" src="https://technick.net/img/guide_edft/guide_edft_img186.gif" alt="\" egin="" isplaymath="" leftarrow="" m="" rac="" lpha="" s="" lpha-s="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Riemann's theorem may be used to show that Eq.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/edft/004#eq:bltpr"&gt;1.3&lt;/a&gt;) is also the&#10;largest such class of conformal mappings. It is not essential,&#10;however, to restrict attention solely to conformal maps. The&#10;pre-transform &lt;!-- MATH&#10; $z\leftarrow \overline{z}$&#10; --&gt;&lt;img width="53" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img187.gif" alt="$z\" eftarrow="" verline="" /&gt;, for example, is not conformal and yet PR&#10;is preserved.&lt;p&gt;The bilinear transform is one which is used to map analog &lt;a href="https://technick.net/guides/theory/edft/010"&gt;filters&lt;/a&gt; into&lt;a href="http://www.dsptutor.freeuk.com/dfilt1.html" target="_blank"&gt;digital filters&lt;/a&gt;. Another such mapping is called the &lt;i&gt;matched &lt;img width="14" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img1.gif" alt="$z$" /&gt;transform&lt;/i&gt; [&lt;a href="https://technick.net/guides/theory/edft/023#RabinerAndGold"&gt;Rabiner and Gold&amp;nbsp;1975&lt;/a&gt;]. It also preserves the positive real&#10;property.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Theorem. &lt;/b&gt;&lt;img width="46" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img5.gif" alt="$H(z)$" /&gt; is PR if &lt;img width="62" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img188.gif" alt="$H(e^{sT})$" /&gt; is positive real in the analog&#10;sense, where &lt;img width="53" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img189.gif" alt="$T&amp;gt;0$" /&gt; is interpreted as the &lt;a href="https://ccrma.stanford.edu/~jos//st/Shannon_s_Sampling_Theorem.html" target="_blank"&gt;sampling period&lt;/a&gt;.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Proof. &lt;/b&gt;The mapping &lt;!-- MATH&#10; $z \leftarrow e^{sT}$&#10; --&gt;&lt;img width="69" height="20" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img190.gif" alt="$z \" eftarrow="" t="" /&gt; takes the right-half &lt;img width="14" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img163.gif" alt="$s$" /&gt;-plane to&#10;the outer disk in the &lt;img width="14" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img1.gif" alt="$z$" /&gt;-plane. Also &lt;img width="14" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img1.gif" alt="$z$" /&gt; is real if &lt;img width="14" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img163.gif" alt="$s$" /&gt; is&#10;real. Hence &lt;img width="62" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img188.gif" alt="$H(e^{sT})$" /&gt; PR implies &lt;img width="46" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img5.gif" alt="$H(z)$" /&gt; PR. (Note, however, that&#10;rational functions do not in general map to rational&#10;functions.)&lt;img width="19" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img13.gif" alt="$\" ox="" /&gt;&lt;/p&gt;&lt;p&gt;These transformations allow application of the large&#10;battery of tests which exist for functions positive real in the right-half&#10;plane [&lt;a href="https://technick.net/guides/theory/edft/023#VV"&gt;Van Valkenburg&amp;nbsp;1960&lt;/a&gt;].&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>05. Discharge Methods</title><link>https://technick.net/guides/electronics/bpw/c05_01/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c05_01/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c04_10"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c05_02"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;5. Discharge Methods&lt;/h3&gt;&lt;p&gt;&lt;a name="_Toc387644057"&gt;&lt;/a&gt;&lt;a name="_Ref503247266"&gt;&lt;/a&gt;&lt;a name="_Ref503247270"&gt;&lt;/a&gt;&lt;a name="_Ref503247274"&gt;&lt;/a&gt;&lt;a name="_Ref506212051"&gt;&lt;/a&gt;&lt;a name="_Ref506212106"&gt;&lt;/a&gt;&lt;a name="_Ref506212126"&gt;&lt;/a&gt;&lt;a name="_Toc507909172"&gt;&lt;/a&gt; &lt;/p&gt;&lt;p&gt;The purpose of a battery is to store energy &#10; and release it at the appropriate time in a controlled manner. &#10; Being capable of storing a large amount of energy is one thing; &#10; the ability to satisfy the load demands is another. The third &#10; criterion is being able to deliver all available energy without &#10; leaving precious energy behind when the equipment cuts&amp;nbsp;off.&lt;/p&gt; &lt;p&gt;In this chapter, we examine how different discharge &#10; methods&amp;nbsp;can affect the deliverance of power. Further, we look &#10; at the load requirements of various portable devices and evaluate &#10; the performance of each battery chemistry in terms of discharge.&lt;/p&gt;&lt;a name="_Toc507909173"&gt;&lt;/a&gt;&lt;h4&gt;5.1 C-rate&lt;/h4&gt; &lt;p&gt;The charge and discharge current&amp;nbsp;of a battery &#10; is measured in C-rate. Most portable batteries, with &#10; the exception of the lead acid, are rated at 1C. A discharge &#10; of 1C draws a current equal to the rated capacity. For example, &#10; a battery rated at 1000mAh provides 1000mA for one&amp;nbsp;hour &#10; if discharged at 1C rate. The same battery discharged at 0.5C &#10; provides 500mA for two&amp;nbsp;hours. At 2C, the same battery &#10; delivers 2000mA for 30&amp;nbsp;minutes. 1C is often referred &#10; to as a one-hour discharge; a 0.5C would be a two-hour, and &#10; a 0.1C a 10&amp;nbsp;hour discharge.&lt;/p&gt; &lt;p&gt;The capacity of a battery is commonly measured &#10; with a battery analyzer. If the analyzer’s capacity readout &#10; is displayed in&amp;nbsp;percentage of the nominal rating, 100&amp;nbsp;percent &#10; is shown if 1000mA can be drawn for one&amp;nbsp;hour from a battery &#10; that is rated at 1000mAh. If the battery only lasts for 30&amp;nbsp;minutes &#10; before cut-off, 50&amp;nbsp;percent is indicated. A new battery &#10; sometimes provides more than 100&amp;nbsp;percent capacity. In &#10; such a case, the battery is conservatively rated and can endure &#10; a longer discharge time than specified by the manufacturer.&lt;/p&gt; &lt;p&gt;When discharging a battery with a battery analyzer &#10; that allows setting different discharge C-rates, a higher &#10; capacity reading is observed if the battery is discharged &#10; at a lower C-rate and vice versa. By discharging the &#10; 1000mAh battery at 2C, or 2000mA, the analyzer is scaled to &#10; derive the full capacity in 30&amp;nbsp;minutes. Theoretically, &#10; the capacity reading should be the same as a slower discharge, &#10; since the identical amount of energy is dispensed, only over &#10; a shorter time. Due to energy loss that occurs inside the &#10; battery and a drop in voltage that causes the battery to reach &#10; the low-end voltage cut-off sooner, the capacity reading is &#10; lower and may be 97&amp;nbsp;percent. Discharging the same battery &#10; at 0.5C, or 500mA over two&amp;nbsp;hours would increase the capacity &#10; reading to about 103&amp;nbsp;percent.&lt;/p&gt; &lt;p&gt;The discrepancy in capacity readings with different &#10; C-rates largely depends on the internal resistance of &#10; the battery. On a new battery with a good load current characteristic &#10; or low internal resistance, the difference in the readings &#10; is only a few&amp;nbsp;percentage points. On a battery exhibiting &#10; high internal resistance, the difference in capacity readings &#10; could swing plus/minus 10&amp;nbsp;percent or&amp;nbsp;more.&lt;/p&gt; &lt;p&gt;One battery that does not perform well at a 1C &#10; discharge rate is the SLA. To obtain a practical capacity &#10; reading, manufacturers commonly rate these batteries at 0.05C &#10; or 20&amp;nbsp;hour discharge. Even at this slow discharge rate, &#10; it is often difficult to attain 100&amp;nbsp;percent capacity. &#10; By discharging the SLA at a more practical 5h discharge (0.2C), &#10; the capacity readings are correspondingly lower. To compensate &#10; for the different readings at various discharge currents, &#10; manufacturers offer a capacity offset.&lt;/p&gt; &lt;p&gt;Applying the capacity offset&amp;nbsp;does not improve &#10; battery performance; it merely adjusts the capacity calculation &#10; if discharged at a higher or lower C-rate than specified. &#10; The battery manufacturer determines the amount of capacity &#10; offset recommended for a given battery&amp;nbsp;type.&lt;/p&gt; &lt;p&gt;&lt;a name="_Toc387644059"&gt;Li-ion/polymer &#10; batteries are electronically protected against high discharge &#10; currents&lt;/a&gt;. Depending on battery type, the discharge current &#10; is limited somewhere between 1C and 2C. This protection makes &#10; the Li-ion unsuitable for biomedical equipment, power &#10; tools and high-wattage transceivers. These applications are &#10; commonly reserved for the NiCd&amp;nbsp;battery.&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>05. Discharge Methods 2</title><link>https://technick.net/guides/electronics/bpw/c05_02/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c05_02/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c05_01"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c05_04"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;5.2 Depth of Discharge&lt;/h4&gt;&lt;p&gt;&lt;a name="_Toc507909174"&gt;&lt;/a&gt; &lt;/p&gt;&lt;p&gt;The typical end-of-discharge voltage for nickel-based &#10; batteries is 1V/cell. At that voltage level, about 99&amp;nbsp;percent &#10; of the energy is spent and the voltage starts to drop rapidly &#10; if the discharge continues. Discharging beyond the cut-off &#10; voltage must be avoided, especially under heavy&amp;nbsp;load.&lt;/p&gt; &lt;p&gt;Since the cells in a battery pack cannot be perfectly &#10; matched, a negative voltage potential (cell reversal) across &#10; a weaker cell occurs if the discharge is allowed to continue &#10; beyond the cut-off point. The larger the number of cells connected &#10; in series, the greater the likelihood of this occurring.&lt;/p&gt; &lt;p&gt;A NiCd battery can tolerate a limited amount &#10; of cell reversal, which is typically about 0.2V. During that &#10; time, the polarity of the positive electrode is reversed. &#10; Such a condition can only be sustained for a brief moment &#10; because hydrogen evolution occurs on the positive electrode. &#10; This leads to pressure build-up and cell venting.&lt;/p&gt; &lt;p&gt;If the cell is pushed further into voltage reversal, &#10; the polarity of both electrodes is being reversed, resulting &#10; in an electrical short. Such a fault cannot be corrected and &#10; the pack will need to be replaced.&lt;/p&gt; &lt;p&gt;On battery analyzers that apply a secondary discharge &#10; (recondition), the current is controlled to assure that the &#10; maximum allowable current, while in sub-discharge range, does &#10; not exceed a safe limit. Should a cell reversal develop, the &#10; current would be low enough as not to cause damage. A cell &#10; breakdown through recondition is possible on a weak or aged&amp;nbsp;pack.&lt;/p&gt; &lt;p&gt;If the battery is discharged at a rate higher &#10; than 1C, the more common end-of-discharge point of a nickel-based &#10; battery is 0.9V/cell. This is done to compensate for the voltage &#10; drop induced by the internal resistance of the cell, the wiring, &#10; protection devices and contacts of the pack. A lower cut-off &#10; point also delivers better battery performance at cold temperatures.&lt;/p&gt; &lt;p&gt;The recommended end-of-discharge voltage for &#10; the SLA is 1.75V/cell. Unlike the preferred flat discharge &#10; curve of the NiCd, the SLA has a gradual voltage drop with &#10; a rapid drop towards the end of discharge (see Figure&amp;nbsp;5-1). &#10; Although this steady decrease in voltage is a disadvantage, &#10; it has a benefit because the voltage level can be utilized &#10; to display the state-of-charge (SoC) of a battery. However, &#10; the voltage readings fluctuate with load and the SoC readings &#10; are inaccurate.&lt;/p&gt; &lt;p&gt;&lt;img width="460" height="329" src="https://technick.net/img/guide_bpw2/c05_01.gif" v:shapes="_x0000_i1025" border="0" alt="" /&gt;&lt;/p&gt; &lt;p&gt;&lt;a name="_Ref502025341"&gt;&lt;/a&gt;&lt;a name="_Toc502116696"&gt;&lt;/a&gt;&lt;a name="_Ref506168204"&gt;&lt;/a&gt;&lt;a name="_Toc507815256" class="caption"&gt;Figure&amp;nbsp;5-1:&amp;nbsp;&amp;nbsp;&amp;nbsp; &#10; Discharge characteristics of NiCd, NiMH and SLA batteries.&lt;/a&gt;&lt;br /&gt; &lt;span class="caption-sub"&gt;While voltage readings to measure &#10; the SoC are not practical on nickel-based batteries, the SLA &#10; enables some level of indication as to the SoC.&lt;/span&gt;&lt;/p&gt; &lt;p style="'" times="" ew="" man=""&gt;&amp;deg;C (77&amp;deg;F) with respect &#10; to the depth of discharge is:&lt;/p&gt; &lt;ul&gt; &lt;li&gt;150 – 200 cycles with 100&amp;nbsp;percent depth of discharge &#10; (full&amp;nbsp;discharge)&lt;/li&gt; &lt;li&gt;400 – 500 cycles with 50&amp;nbsp;percent depth of discharge &#10; (partial&amp;nbsp;discharge)&lt;/li&gt; &lt;li&gt;1000 and more cycles with 30&amp;nbsp;percent depth of discharge &#10; (shallow&amp;nbsp;discharge)&lt;/li&gt; &lt;/ul&gt; &lt;/blockquote&gt;</description></item><item><title>05. Discharge Methods 3</title><link>https://technick.net/guides/electronics/bpw/c05_04/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c05_04/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c05_02"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c05_05"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;The SLA should not be discharged beyond 1.75V &#10; per cell, nor can it be stored in a discharged state. The &#10; cells of a discharged SLA sulfate, a condition that renders &#10; the battery useless if left in that state for a few&amp;nbsp;days.&lt;/p&gt; &lt;p&gt;The Li-ion typically discharges to 3.0V/cell. &#10; The spinel and coke versions can be discharged to 2.5V/cell. &#10; The lower end-of-discharge voltage gains a few extra&amp;nbsp;percentage &#10; points. Since the equipment manufacturers cannot specify which &#10; battery type may be used, most equipment is designed for a &#10; three-volt cut-off.&lt;/p&gt; &lt;p&gt;Caution should be exercised not to discharge &#10; a lithium-based battery too low. Discharging a lithium-based &#10; battery below 2.5V may cut off the battery’s protection circuit. &#10; Not all chargers accommodate a recharge on batteries that &#10; have gone to sleep because of low voltage.&lt;/p&gt; &lt;p&gt;Some Li-ion batteries feature an ultra-low &#10; voltage cut-off that permanently disconnects the pack if a &#10; cell dips below 1.5V. This precaution prohibits recharge if &#10; a battery has dwelled in an illegal voltage state. A very &#10; deep discharge may cause the formation of copper shunt, which &#10; can lead to a partial or total electrical short. The same &#10; occurs if the cell is driven into negative polarity and is &#10; kept in that state for a while. A fully discharged battery &#10; should be charged at 0.1C. Charging a battery with a copper &#10; shunt at the 1C rate would cause excessive heat. Such a battery &#10; should be removed from service.&lt;/p&gt; &lt;p&gt;Discharging a battery too deeply is one problem; &#10; equipment that cuts off before the energy is consumed is another. &#10; Some portable devices are not properly tuned to harvest the &#10; optimal energy stored in a battery. Valuable energy may be &#10; left behind if the voltage cut-off-point is set too&amp;nbsp;high.&lt;/p&gt; &lt;p&gt;Digital devices are especially demanding on a &#10; battery. Momentary pulsed loads cause a brief voltage drop, &#10; which may push the voltage into the cut-off region. Batteries &#10; with high internal resistance are particularly vulnerable &#10; to premature cut-off. If such a battery is removed from the &#10; equipment and discharged to the appropriate cut-off point &#10; with a battery analyzer on DC load, a high level of residual &#10; capacity&amp;nbsp;can still be obtained.&lt;/p&gt; &lt;p&gt;Most rechargeable batteries prefer a partial &#10; rather than a full discharge. Repeated full discharge robs &#10; the battery of its capacity. The battery chemistry which is &#10; most affected by repeat deep discharge is lead acid. Additives &#10; to the deep-cycle version of the lead acid battery compensate &#10; for some of the cycling strain.&lt;/p&gt; &lt;p&gt;Similar to the lead acid battery, the Li-ion &#10; battery prefers shallow over repetitive deep discharge cycles. &#10; Up to 1000&amp;nbsp;cycles can be achieved if the battery is only &#10; partially discharged. Besides cycling, the performance of &#10; the Li-ion is also affected by aging. Capacity loss &#10; through aging is independent of use. However, in daily use, &#10; there is a combination of&amp;nbsp;both.&lt;/p&gt; &lt;p&gt;The NiCd battery is least affected by repeated &#10; full discharge cycles. Several thousand charge/discharge cycles &#10; can be obtained with this battery system. This is the reason &#10; why the NiCd performs well on power tools and two-way radios &#10; that are in constant use. The NiMH is more delicate with respect &#10; to repeated deep cycling.&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>05. Discharge Methods 4</title><link>https://technick.net/guides/electronics/bpw/c05_05/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c05_05/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c05_04"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c05_06"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;5.3 Pulse Discharge&lt;/h4&gt;&lt;p&gt;&lt;a name="_Toc507909175"&gt;&lt;/a&gt; &lt;/p&gt;&lt;p&gt;&lt;a name="_Ref503247400"&gt;&lt;/a&gt;&lt;a name="_Ref503247406"&gt;&lt;/a&gt;&lt;a name="_Ref503247410"&gt;Battery chemistries react differently &#10; to specific loading requirements. Discharge loads range from &#10; a low and steady current used in a flashlight, to intermittent &#10; high current bursts in a power tool, to sharp current pulses &#10; required for digital communications equipment, to a prolonged &#10; high current load for an electric vehicle traveling at highway &#10; speed. Because batteries are chemical devices that must convert &#10; higher-level active materials into an alternate state during &#10; discharge, the speed of such transaction determines the load &#10; characteristics of a battery. Also referred to as concentration &#10; polarization, the nickel and lithium-based batteries are superior &#10; to lead-based batteries in reaction speed. This reflects in &#10; good load characteristics.&lt;/a&gt;&lt;/p&gt; &lt;p&gt;The lead acid battery performs best at a slow &#10; 20-hour discharge. A pulse discharge also works well because &#10; the rest periods between the pulses help to disperse the depleted &#10; acid concentrations back into the electrode plate. In terms &#10; of capacity, these two discharge methods provide the highest &#10; efficiency for this battery chemistry.&lt;/p&gt; &lt;p&gt;A discharge at the rated capacity of 1C yields &#10; the poorest efficiency for the lead acid battery. The lower &#10; level of conversion, or increased polarization, manifests &#10; itself in a momentary higher internal resistance due to the &#10; depletion of active material in the reaction.&lt;/p&gt; &lt;p&gt;Different discharge methods, notably pulse discharging, &#10; also affect the longevity of some battery chemistries. While &#10; NiCd and Li-ion are robust and show minimal deterioration &#10; when pulse discharged, the NiMH exhibits a reduced cycle life &#10; when powering a digital&amp;nbsp;load.&lt;/p&gt; &lt;p&gt;In a recent study, the longevity of NiMH was &#10; observed by discharging these batteries with analog and digital &#10; loads. In both tests, the battery discharged to 1.04V/cell. &#10; The analog discharge current was 500mA; the digital mode simulated &#10; the load requirements of the Global System for Mobile Communications &#10; (GSM) protocol and applied 1.65-ampere peak current for 12&amp;nbsp;ms &#10; every 100&amp;nbsp;ms. The current in between the peaks was 270mA. &#10; (Note that the GSM pulse for voice is about 550&amp;nbsp;ms every&amp;nbsp;4.5&amp;nbsp;ms).&lt;/p&gt; &lt;p&gt;With the analog discharge, the NiMH wore out &#10; gradually, providing an above average service life. At 700&amp;nbsp;cycles, &#10; the battery still provided 80&amp;nbsp;percent capacity. By contrast, &#10; the cells faded more rapidly with a digital discharge. The &#10; 80&amp;nbsp;percent capacity threshold was reached after only &#10; 300&amp;nbsp;cycles. This phenomenon indicates that the kinetic &#10; characteristics for the NiMH deteriorate more rapidly with &#10; a digital rather than an analog&amp;nbsp;load.&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>05. Discharge Methods 5</title><link>https://technick.net/guides/electronics/bpw/c05_06/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c05_06/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c05_05"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c06_01"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;5.4 Discharging at High and Low Temperature&lt;/h4&gt;&lt;p&gt;&lt;a name="_Toc507909176"&gt;&lt;/a&gt; &lt;/p&gt;&lt;p&gt;Batteries function best at room temperature. &#10; Operating batteries at an elevated temperature dramatically &#10; shortens their life. Although a lead acid battery may deliver &#10; the highest capacity at temperatures above 30&amp;deg;C (86&amp;deg;F), prolonged &#10; use under such conditions decreases the life of the battery.&lt;/p&gt; &lt;p&gt;Similarly, a Li-ion performs better at &#10; high temperatures. Elevated temperatures temporarily counteracts &#10; the battery’s internal resistance, which is a result of aging. &#10; The energy gain is short-lived because elevated temperature &#10; promotes aging by further increasing the internal resistance.&lt;/p&gt; &lt;p&gt;There is one exception to running a battery at &#10; high temperature — it is the lithium polymer with dry solid &#10; polymer electrolyte, the true ‘plastic battery’. While the &#10; commercial Li-ion polymer uses some moist electrolyte &#10; to enhance conductivity, the dry solid polymer version depends &#10; on heat to enable ion flow. This requires that the battery &#10; core be kept at an operation temperature of 60&amp;deg;C to 100&amp;deg;C.&lt;/p&gt; &lt;p&gt;The dry solid polymer battery has found a niche &#10; market as backup power in warm climates. The battery is kept &#10; at the operating temperature with built-in heating elements. &#10; During normal operation, the core is kept warm with power &#10; derived from the utility grid. Only on a power outage would &#10; the battery need to provide power to maintain its own heat. &#10; To minimize heat loss, the battery is insulated.&lt;/p&gt; &lt;p&gt;The Li-ion polymer as standby battery is &#10; said to outperform VRLA batteries in terms of size and longevity, &#10; especially in shelters in which the temperature cannot be &#10; controlled. The high price of the Li-ion polymer battery &#10; remains an obstacle.&lt;/p&gt; &lt;p&gt;The NiMH chemistry degrades rapidly if cycled &#10; at higher ambient temperatures. Optimum battery life and cycle &#10; count are achieved at 20&amp;deg;C (68&amp;deg;F). Repeated charging and discharging &#10; at higher temperatures will cause irreversible capacity loss. &#10; For example, if operated at 30&amp;deg;C (86&amp;deg;F), the cycle life is &#10; reduced by 20&amp;nbsp;percent. At 40&amp;deg;C (104&amp;deg;F), the loss jumps &#10; to a whopping 40&amp;nbsp;percent. If charged and discharged at &#10; 45&amp;deg;C (113&amp;deg;F), the cycle life is only half of what can be expected &#10; if used at moderate room temperature. The NiCd is also affected &#10; by high temperature operation, but to a lesser degree.&lt;/p&gt; &lt;p&gt;At low temperatures, the performance of all battery &#10; chemistries drops drastically. While -20&amp;deg;C (-4&amp;deg;F) is threshold &#10; at which the NiMH, SLA and Li-ion battery stop functioning, &#10; the NiCd can go down to -40&amp;deg;C (-40&amp;deg;F). At that frigid temperature, &#10; the NiCd is limited to a discharge rate of 0.2C (5&amp;nbsp;hour &#10; rate). There are new types of Li-ion batteries that &#10; are said to operate down to -40&amp;deg;C.&lt;/p&gt; &lt;p&gt;It is important to remember that although a battery &#10; may be capable of operating at cold temperatures, this does &#10; not automatically mean it can also be charged under those &#10; conditions. The charge acceptance for most batteries at very &#10; low temperatures is extremely confined. Most batteries need &#10; to be brought up to temperatures above the freezing point &#10; for charging. The NiCd can be recharged at below freezing &#10; provided the charge rate is reduced to&amp;nbsp;0.1C.&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>05. Introduction</title><link>https://technick.net/guides/theory/dar/005/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dar/005/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/resample/"&gt;The Digital Audio Resampling Home Page&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, Copyright &amp;#169; &lt;i&gt;2016-05-17&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dar/004"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dar/000"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dar/006"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;Introduction&lt;/h3&gt;&lt;p&gt;&lt;a href="https://technick.net/guides/theory/dar/000"&gt;Bandlimited interpolation&lt;/a&gt; of discrete-time signals is a basic tool&#10;having extensive application in &lt;a href="http://www.dsptutor.freeuk.com/" target="_blank"&gt;digital signal processing&lt;/a&gt;. In&#10;general, the problem is to correctly compute signal values at&#10;arbitrary continuous times from a set of discrete-time samples of the&#10;signal &lt;a href="https://ccrma.stanford.edu/~jos//log/Logarithms.html"&gt;amplitude&lt;/a&gt;. In other words, we must be able to interpolate the&#10;signal between samples. Since the original signal is always assumed&#10;to be &lt;i&gt;bandlimited &lt;/i&gt;to half the &lt;a href="https://ccrma.stanford.edu/~jos//st/Shannon_s_Sampling_Theorem.html"&gt;sampling rate&lt;/a&gt;, (otherwisealiasing distortion would occur upon sampling), &lt;a href="https://ccrma.stanford.edu/~jos//st/Shannon_s_Sampling_Theorem.html"&gt;Shannon's sampling&#10;theorem&lt;/a&gt; tells us the signal can be exactly and uniquely reconstructed&#10;for all time from its samples by bandlimited interpolation.&lt;/p&gt;&lt;p&gt;Considerable research has been devoted to the problem of interpolating&#10;discrete points. A comprehensive survey of ``&lt;a href="https://ccrma.stanford.edu/~jos//Interpolation"&gt;fractional delay filter&#10;design&lt;/a&gt;'' is provided in [&lt;a href="https://technick.net/guides/theory/dar/015#LaaksoB"&gt;Laakso &lt;em&gt;et&amp;nbsp;al.&lt;/em&gt;&amp;nbsp;1996&lt;/a&gt;]. A comparison between&#10;classical (e.g., Lagrange) and bandlimited interpolation is given in&#10;[&lt;a href="https://technick.net/guides/theory/dar/015#SchaferAndRabiner"&gt;Schafer and Rabiner&amp;nbsp;1973&lt;/a&gt;]. The book &lt;b&gt;Multirate Digital Signal&#10;Processing &lt;/b&gt;[&lt;a href="https://technick.net/guides/theory/dar/015#Crochiere"&gt;Crochiere and Rabiner&amp;nbsp;1983&lt;/a&gt;] provides a comprehensive summary and&#10;review of classical signal processing techniques for &lt;a href="https://technick.net/guides/theory/dar/000"&gt;sampling-rate&#10;conversion&lt;/a&gt;. In these techniques, the signal is first interpolated by&#10;an integer factor &lt;img width="17" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img6.gif" alt="$L$" /&gt; and then decimated by an integer factor&lt;img width="25" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img7.gif" alt="$M$" /&gt;. This provides sampling-rate conversion by any rational factor&lt;img width="46" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img8.gif" alt="$L/M$" /&gt;. The conversion requires a digital lowpass &lt;a href="https://technick.net/guides/theory/edft/010"&gt;filter&lt;/a&gt; whose cutofffrequency depends on &lt;img width="100" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img9.gif" alt="$\" ax\="" m\="" /&gt;. While sufficiently general, this&#10;formulation is less convenient when it is desired to &lt;a href="https://technick.net/guides/theory/dar/000"&gt;resample&lt;/a&gt; the&#10;signal at arbitrary times or change the sampling-rate conversion&#10;factor smoothly over time.&lt;/p&gt;&lt;p&gt;In this tutorial, a public-domain &lt;a href="https://technick.net/guides/theory/dar/000"&gt;resampling&lt;/a&gt; algorithm is described&#10;which will evaluate a signal at any time specifiable by a fixed-pointnumber. In addition, one lowpass filter is used regardless of the&#10;sampling-rate conversion factor. The algorithm effectively implements&#10;the ``analog interpretation'' of rate conversion, as discussed in&#10;[&lt;a href="https://technick.net/guides/theory/dar/015#Crochiere"&gt;Crochiere and Rabiner&amp;nbsp;1983&lt;/a&gt;], in which a certain lowpass-filter &lt;a href="https://technick.net/guides/theory/edft/010#2321"&gt;impulse&lt;/a&gt; response&#10;must be available as a continuous function. Continuity of the impulse&#10;response is simulated by linearly interpolating between samples of the&#10;impulse response stored in a table. Due to the relatively low cost of&#10;memory, the method is quite practical for hardware implementation.&lt;/p&gt;&lt;p&gt;In section 2, the basic theory is presented, section 3 addresses&#10;practical issues, and implementation details are discussed in section&#10;4. Finally, section 5 discusses numerical requirements on the length,&#10;width, and interpolation accuracy of the filter coefficient table.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>05. Special cases and examples</title><link>https://technick.net/guides/theory/edft/005/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/edft/005/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/filters/"&gt;Introduction to Digital Filters with Audio Applications&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, Copyright &amp;#169; &lt;i&gt;2017-11-26&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/edft/004"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/000"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/022"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/006"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;Special cases and examples&lt;/h3&gt;&lt;p&gt;&lt;ul&gt;&lt;li&gt;The sum of &lt;a href="https://technick.net/guides/theory/edft/001"&gt;positive real functions&lt;/a&gt; is &lt;a href="https://technick.net/guides/theory/edft/001"&gt;positive real&lt;/a&gt;.&lt;/li&gt;&lt;li&gt;The difference of positive real functions is conditionally positive real.&lt;/li&gt;&lt;li&gt;The product or division of positive real functions is conditionally PR.&lt;/li&gt;&lt;li&gt;&lt;img width="46" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img5.gif" alt="$H(z)$" /&gt; PR &lt;!-- MATH&#10; $\Rightarrow \alpha\,z^{\pm k}H(z)$&#10; --&gt;&lt;img width="114" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img191.gif" alt="$\" ightarrow="" lpha="" m="" z="" /&gt; not PR for &lt;!-- MATH&#10; $\alpha&gt;0,k\geq 2$&#10; --&gt;&lt;img width="105" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img192.gif" alt="$\" lpha="" t="" geq="" /&gt;.&lt;/li&gt;&lt;/ul&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>06. Minimum Phase (MP) polynomials in Z</title><link>https://technick.net/guides/theory/edft/006/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/edft/006/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/filters/"&gt;Introduction to Digital Filters with Audio Applications&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, Copyright &amp;#169; &lt;i&gt;2017-11-26&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/edft/005"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/000"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/022"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/007"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;Minimum Phase (MP) polynomials in &lt;img width="14" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img1.gif" alt="$z$" /&gt;&lt;/h3&gt;&lt;p&gt;All properties of MP polynomials apply without modification to marginally&lt;a href="https://technick.net/guides/theory/edft/010#2327"&gt;stable&lt;/a&gt; allpole transfer functions (cf. Thm.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/edft/001#thm:Tinv"&gt;1&lt;/a&gt;)).&lt;/p&gt;&lt;p&gt;&lt;ul&gt;&lt;li&gt;Every first-order MP polynomial is &lt;a href="https://technick.net/guides/theory/edft/001"&gt;positive real&lt;/a&gt;. &lt;p&gt;&lt;/p&gt;&lt;/li&gt;&lt;li&gt;Every first-order MP polynomial &lt;!-- MATH&#10; $b(z)=1+b_1\,z^{-1}$&#10; --&gt;&lt;img width="141" height="38" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img193.gif" alt="$b(z)=1+b_1 z^{-1}$" /&gt; is such that&#10;&#9;&lt;!-- MATH&#10; $\frac{1}{ b(z)} - \frac{1}{ 2}$&#10; --&gt;&lt;img width="66" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img194.gif" alt="$ \" rac="" b="" frac="" /&gt; is positive real.&lt;p&gt;&lt;/p&gt;&lt;/li&gt;&lt;li&gt;A PR second-order MP polynomial with complex-conjugate zeros,&lt;br /&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray}&#10;H(z)&amp;=&amp; 1+b_1z^{-1}+b_2z^{-2}\\&#10; &amp;=&amp; 1-(2R\cos\phi)z^{-1}+R^2z^{-2},\quad R\leq 1&#10;\end{eqnarray}&#10; --&gt;&lt;table align="CENTER" cellpadding="0" width="100%"&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&lt;img width="51" height="41" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img21.gif" alt="$\" isplaystyle="" /&gt;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="21" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img10.gif" alt="$\" extstyle="$" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="162" height="45" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img195.gif" alt="$\" isplaystyle="" b="" b="b" z="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(38)&lt;/td&gt;&lt;/tr&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&amp;nbsp;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="21" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img10.gif" alt="$\" extstyle="$" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="325" height="45" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img196.gif" alt="$\" isplaystyle="" cos\phi="" r="" quad="" eq="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(39)&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;satisfies&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;R^2 + \frac{\cos^2\phi}{ 2} \leq 1.&#10;\end{displaymath}&#10; --&gt;&lt;img width="148" height="53" border="0" src="https://technick.net/img/guide_edft/guide_edft_img197.gif" alt="\" egin="" isplaymath="" frac="" os="" hi="" eq="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;If &lt;!-- MATH&#10; $2R^2+\cos^2\phi=2$&#10; --&gt;&lt;img width="140" height="38" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img198.gif" alt="$2R^2+\" os="" hi="2$" /&gt;, then &lt;!-- MATH&#10; $\mbox{re}\left\{H(e^{j\omega})\right\}$&#10; --&gt;&lt;img width="98" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img199.gif" alt="$\" box="" e="" eft\="" e="" omega="" ight\="" /&gt; has a double zero at&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\omega = \cos^{-1}\left(\pm \sqrt{ \frac{1-R^2}{ 2R^2}}\right)&#10;= \cos^{-1}\left(\pm \frac{\cos\phi}{ 2R}\right)&#10;= \cos^{-1}\left(\pm \frac{1}{ \sqrt{2}} \frac{\cos\phi}{ \sqrt{1+\sin^2\phi}}\right).&#10;\end{displaymath}&#10; --&gt;&lt;img width="666" height="74" border="0" src="https://technick.net/img/guide_edft/guide_edft_img200.gif" alt="\" egin="" isplaymath="" mega="\cos^{-1}\left(\pm" sqrt="" rac="" r="" igh="" c="" qrt="" rac="" os\phi="" qrt="" in="" hi="" ight="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;/li&gt;&lt;li&gt;All polynomials of the form&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;H(z)=1+R^nz^{-n},\quad R\leq 1&#10;\end{displaymath}&#10; --&gt;&lt;img width="250" height="36" border="0" src="https://technick.net/img/guide_edft/guide_edft_img201.gif" alt="\" egin="" isplaymath="" z="" nz="" quad="" eq="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;are positive real. (These have zeros uniformly distributed on a circle of radius&lt;img width="19" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img202.gif" alt="$R$" /&gt;.)&lt;p&gt;&lt;/p&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>06. The Secrets of Battery Runtime</title><link>https://technick.net/guides/electronics/bpw/c06_01/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c06_01/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c05_06"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c06_03"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;6. The Secrets of Battery Runtime&lt;/h3&gt;&lt;p&gt; &lt;a name="_Ref503245016"&gt;&lt;/a&gt;&lt;a name="_Ref503245039"&gt;&lt;/a&gt;&lt;a name="_Ref503247447"&gt;&lt;/a&gt;&lt;a name="_Ref503247449"&gt;&lt;/a&gt;&lt;a name="_Ref503247451"&gt;&lt;/a&gt;&lt;a name="_Toc507909177"&gt;&lt;/a&gt; &lt;/p&gt;&lt;p&gt;Is the runtime of a portable device directly related to the &#10; size of the battery and the energy it can hold? In most cases, &#10; the answer is yes. But with digital equipment, the length &#10; of time a battery can operate is not necessarily linear to &#10; the amount of energy stored in the battery. &lt;/p&gt; &lt;p&gt;In this chapter we examine why the specified &#10; runtime of a portable device cannot always be achieved, especially &#10; after the battery has aged. We address the four renegades &#10; that are affecting the performance of the battery. They are: &#10; declining capacity, increasing internal resistance, elevated &#10; self-discharge, and premature voltage cut-off on discharge.&lt;/p&gt;&lt;a name="_Toc507909178"&gt;&lt;/a&gt;&lt;h4&gt;6.1 Declining Capacity&lt;/h4&gt; &lt;p&gt;The amount of charge a battery can hold gradually &#10; decreases due to usage, aging and, with some chemistries, &#10; lack of maintenance. Specified to deliver about 100&amp;nbsp;percent &#10; capacity when new, the battery eventually requires replacement &#10; when the capacity drops to the 70&amp;nbsp;or 60&amp;nbsp;percent &#10; level. The warranty threshold is typically 80&amp;nbsp;percent. &#10; &lt;/p&gt; &lt;p&gt;The energy storage of a battery can be divided &#10; into three imaginary sections consisting of available energy, &#10; the empty zone that can be refilled and the rock content that &#10; has become unusable. Figure&amp;nbsp;6-1 illustrates these &#10; three sections of a battery.&lt;/p&gt; &lt;p&gt;In nickel-based batteries, the rock content may &#10; be in the form of crystalline formation, also known as memory. &#10; Deep cycling can often restore the capacity to full service. &#10; Also known as ‘exercise’, a typical cycle consists of one &#10; or several discharges to 1V/cell with subsequent discharges.&lt;/p&gt; &lt;table border="0" cellspacing="0" cellpadding="0"&gt; &lt;tr&gt; &#10; &lt;td width="199"&gt; &#10; &lt;p&gt;&lt;img width="170" height="205" src="https://technick.net/img/guide_bpw2/c06_01.gif" v:shapes="_x0000_i1025" border="0" alt="" /&gt;&lt;/p&gt; &lt;/td&gt; &lt;td width="288" valign="middle"&gt; &#10; &lt;p&gt;&lt;span class="caption"&gt;Figure&amp;nbsp;6-1:&amp;nbsp;&amp;nbsp;&amp;nbsp; &#10; Battery charge capacity.&lt;/span&gt;&lt;br /&gt; &lt;span class="caption-sub"&gt;Three imaginary sections of &#10; a battery consisting of available energy, empty zone &#10; and rock content.&lt;br /&gt; &lt;br /&gt; With usage and age, the rock content grows. Without &#10; regular maintenance, the user may end up carrying rocks &#10; instead of batteries.&lt;/span&gt;&lt;/p&gt; &lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;p&gt;The loss of charge acceptance of the Li-ion/polymer &#10; batteries is due to cell oxidation, which occurs naturally &#10; during use and as part of aging. Li-ion batteries cannot &#10; be restored with cycling or any other external means. The &#10; capacity loss is permanent because the metals used in the &#10; cells are designated to run for a specific time only and are &#10; being consumed during their service&amp;nbsp;life.&lt;/p&gt; &lt;p&gt;Performance degradation of the lead acid battery &#10; is often caused by sulfation, a thin layer that forms on the &#10; negative cell plates, which inhibits current flow. In addition, &#10; there is grid corrosion that sets in on the positive plate. &#10; With sealed lead acid batteries, the issue of water permeation, &#10; or loss of electrolyte, also comes into play. Sulfation can &#10; be reversed to a certain point with cycling and/or topping &#10; charge but corrosion and permeation are permanent. Adding &#10; water to a sealed lead acid battery may help to restore operation &#10; but the long-term results are unpredictable.&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>06. The Secrets of Battery Runtime 2</title><link>https://technick.net/guides/electronics/bpw/c06_03/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c06_03/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c06_01"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c06_04"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;Increasing Internal Resistance&lt;/h4&gt;&lt;p&gt;&lt;a name="_Toc507909179"&gt;&lt;/a&gt; &lt;/p&gt;&lt;p&gt;To a large extent, the internal resistance, also &#10; known as impedance, determines the performance and runtime &#10; of a battery. If measured with an AC signal, the internal &#10; resistance of a battery is also referred to as impedance. &#10; High internal resistance curtails the flow of energy from &#10; the battery to the equipment.&lt;/p&gt; &lt;p&gt;A battery with simulated low and high internal &#10; resistance is illustrated below. While a battery with low &#10; internal resistance can deliver high current on demand, a &#10; battery with high resistance collapses with heavy current. &#10; Although the battery may hold sufficient capacity, the voltage &#10; drops to the cut-off line and the ‘low battery’ indicator &#10; is triggered. The equipment stops functioning and the remaining &#10; energy is undelivered.&lt;/p&gt; &lt;table border="0" cellspacing="0" cellpadding="0"&gt; &lt;tr&gt; &#10; &lt;td width="255"&gt; &#10; &lt;p&gt;&lt;img width="300" height="209" src="https://technick.net/img/guide_bpw2/c06_02.jpg" v:shapes="_x0000_i1026" border="0" alt="" /&gt;&lt;/p&gt; &lt;/td&gt; &lt;td width="232" valign="middle"&gt; &#10; &lt;p&gt;&lt;a name="_Ref502025417"&gt;&lt;/a&gt;&lt;a name="_Toc502116699"&gt;&lt;/a&gt;&lt;a name="_Toc507815258" class="caption"&gt;Figure&amp;nbsp;6-2:&amp;nbsp;&amp;nbsp;&amp;nbsp; Effects of impedance &#10; on battery load.&lt;/a&gt;&lt;br /&gt; &lt;span class="caption-sub"&gt;A battery with low impedance &#10; provides unrestricted current flow and delivers all &#10; available energy. A battery with high impedance cannot &#10; deliver high-energy bursts due to a restricted path, &#10; and equipment may cut off prematurely.&lt;/span&gt;&lt;/p&gt; &lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;p&gt;NiCd has the lowest internal resistance of all &#10; commercial battery systems, even after delivering 1000&amp;nbsp;cycles. &#10; In comparison, NiMH starts with a slightly higher resistance &#10; and the readings increase rapidly after 300&amp;nbsp;to 400&amp;nbsp;cycles.&lt;/p&gt; &lt;p&gt;Maintaining a battery at low internal resistance &#10; is important, especially with digital devices that require &#10; high surge current. Lack of maintenance on nickel-based batteries &#10; can increase the internal resistance. Readings of more than &#10; twice the normal resistance have been observed on neglected &#10; NiCd batteries. After applying a recondition&amp;nbsp;cycle with the &#10; Cadex &lt;i&gt;7000&lt;/i&gt; &lt;i&gt;Series&lt;/i&gt; battery analyzer, the readings &#10; on the batteries returned to normal. Reconditioning clears &#10; the cell plates of unwanted crystalline formations, which &#10; restores proper current&amp;nbsp;flow.&lt;/p&gt; &lt;p&gt;Li-ion offers internal resistance characteristics &#10; that are between those of NiMH and NiCd. Usage does not contribute &#10; much to the increase in resistance, but aging does. The typical &#10; life span of a Li-ion battery is two to three years, &#10; whether it is used or not. Cool storage and keeping the battery &#10; in a partially charged state when not in use retard the aging &#10; process.&lt;/p&gt; &lt;p&gt;The internal resistance of the Li-ion batteries &#10; cannot be improved with cycling. The cell oxidation, which &#10; causes high resistance, is non-reversible. The ultimate cause &#10; of failure is high internal resistance. Energy may still be &#10; present in the battery, but it can no longer be delivered &#10; due to poor conductivity.&lt;/p&gt; &lt;p&gt;With effort and patience, lead acid batteries &#10; can sometimes be improved by cycling or applying a topping &#10; and/or equalizing charge. This reduces the current-inhibiting &#10; sulfation layer but does not reverse grid corrosion.&lt;/p&gt; &lt;p&gt;Figure&amp;nbsp;6-3 compares the voltage signature &#10; and corresponding runtime of a battery with low, medium and &#10; high internal resistance when connected to a digital load. &#10; Similar to a soft ball that easily deforms when squeezed, &#10; the voltage of a battery with high internal resistance modulates &#10; the supply voltage and leaves the imprint of the load. The &#10; current pulses push the voltage towards the end-of-discharge &#10; line, resulting in a premature cut-off.&lt;/p&gt; &lt;p&gt;When measuring the battery with a voltmeter after &#10; the equipment has cut off and the load is removed, the terminal &#10; voltage commonly recovers and the voltage reading appears &#10; normal. This is especially true of nickel-based batteries. &#10; Measuring the open terminal voltage is an unreliable method &#10; to establish the state-of-charge (SoC) of the battery.&lt;/p&gt; &lt;p&gt;A battery with high impedance may perform well &#10; if loaded with a low DC current such as a flashlight, portable &#10; CD player or wall clock. With such a gentle load, virtually &#10; all of the stored energy can be retrieved and the deficiency &#10; of high impedance is masked.&lt;/p&gt; &lt;p&gt;&lt;img width="463" height="362" src="https://technick.net/img/guide_bpw2/c06_03.gif" v:shapes="_x0000_i1027" border="0" alt="" /&gt;&lt;/p&gt; &lt;p&gt;&lt;a name="_Ref502025661"&gt;&lt;/a&gt;&lt;a name="_Toc502116701"&gt;&lt;/a&gt;&lt;a name="_Ref504194835"&gt;&lt;/a&gt;&lt;a name="_Toc507815259" class="caption"&gt;Figure&amp;nbsp;6-3:&amp;nbsp;&amp;nbsp;&amp;nbsp; &#10; Discharge curve.&lt;/a&gt;&lt;br /&gt; &lt;span class="caption-sub"&gt;This chart compares the runtime &#10; of batteries with similar capacities under low, medium and &#10; high impedance when connected to a pulsed&amp;nbsp;load.&lt;/span&gt;&lt;/p&gt; &lt;p&gt;The internal resistance of a battery can be measured &#10; with dedicated impedance meters. Several methods are available, &#10; of which the most common are applying DC loads and AC signals. &#10; The AC method may be done with different frequencies. Depending &#10; on the level of capacity loss, each technique provides slightly &#10; different readings. On a good battery, the measurements are &#10; reasonably close; on a weak battery, the readings between &#10; the methods may disperse more drastically.&lt;/p&gt; &lt;p&gt;Modern battery analyzers offer internal resistance &#10; measurements as a battery quick-test. Such tests can identify &#10; batteries that would fail due to high internal resistance, &#10; even though the capacity may still be acceptable. Internal &#10; battery resistance measurements are available in the Cadex &#10; &lt;i&gt;7000 Series&lt;/i&gt; battery analyzers. (See Chapter 9:&amp;nbsp;Internal &#10; Battery Resistance.)&lt;/p&gt; &#10; &lt;/blockquote&gt;</description></item><item><title>06. The Secrets of Battery Runtime 3</title><link>https://technick.net/guides/electronics/bpw/c06_04/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c06_04/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c06_03"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c07_01"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;6.3 Elevated Self-Discharge&lt;/h4&gt;&lt;p&gt;&lt;a name="_Toc507909180"&gt;&lt;/a&gt; &lt;/p&gt;&lt;p&gt;All batteries exhibit a certain amount of self-discharge; &#10; the highest is visible on nickel-based batteries. As a rule, &#10; a nickel-based battery discharges 10&amp;nbsp;to 15&amp;nbsp;percent &#10; of its capacity in the first 24&amp;nbsp;hours after charge, followed &#10; by 10&amp;nbsp;to 15&amp;nbsp;percent every month thereafter.&lt;/p&gt; &lt;p&gt;The self-discharge on the Li-ion battery &#10; is lower compared to the nickel-based systems. The Li-ion &#10; self-discharges about five&amp;nbsp;percent in the first 24&amp;nbsp;hours &#10; and one to two&amp;nbsp;percent thereafter. Adding the protection &#10; circuit increases the self-discharge to ten&amp;nbsp;percent per &#10; month.&lt;/p&gt; &lt;p&gt;One of the best batteries in terms of self-discharge &#10; is the lead acid system; it only self-discharges five&amp;nbsp;percent &#10; per month. It should be noted, however, that the lead acid &#10; family has also the lowest energy density among current battery &#10; systems. This makes the system unsuitable for most hand-held &#10; applications.&lt;/p&gt; &lt;p&gt;At higher temperatures, the self-discharge on &#10; all battery chemistries increases. Typically, the rate doubles &#10; with every 10&amp;deg;C (18&amp;deg;F). Large energy losses occur through &#10; self-discharge if a battery is left in a hot vehicle. On some &#10; older batteries, stored energy may get lost during the course &#10; of the day through self-discharge rather than actual&amp;nbsp;use.&lt;/p&gt; &lt;p&gt;The self-discharge of a battery increases with &#10; age and usage. For example, a NiMH battery is good for 300&amp;nbsp;to&amp;nbsp;400&amp;nbsp;cycles, &#10; whereas a NiCd adequately performs over 1000&amp;nbsp;cycles before &#10; high self-discharge affects the performance of the battery. &#10; Once a battery exhibits high self-discharge, no remedy is &#10; available to reverse the effect. Factors that accelerate self-discharge &#10; on nickel-based batteries are damaged separators (induced &#10; by excess crystalline formation, allowing the packs to cook &#10; while charging), and high cycle count, which promotes swelling &#10; in the&amp;nbsp;cell.&lt;/p&gt; &lt;table border="0" cellspacing="0" cellpadding="0"&gt; &lt;tr&gt; &#10; &lt;td width="217"&gt; &#10; &lt;p&gt;&lt;img width="250" height="214" src="https://technick.net/img/guide_bpw2/c06_04.jpg" v:shapes="_x0000_i1028" border="0" alt="" /&gt;&lt;/p&gt; &lt;/td&gt; &lt;td width="270" valign="middle"&gt; &#10; &lt;p&gt;&lt;a name="_Toc502116702"&gt;&lt;/a&gt;&lt;a name="_Toc507815260" class="caption"&gt;Figure&amp;nbsp;6-4:&amp;nbsp;Effects &#10; of high load impedance.&lt;/a&gt;&lt;br /&gt; &lt;span class="caption-sub"&gt;A battery may gradually self-discharge &#10; as a result of high temperature, high cycle count and &#10; age. In older batteries, stored energy may be lost during &#10; the course of the day through self-discharge rather &#10; than actual use.&lt;/span&gt;&lt;/p&gt; &lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;p&gt;At present, no simple quick-test is available &#10; to measure the self-discharge of a battery. A battery analyzer &#10; can be used by first reading the initial capacity after full &#10; charge, then measuring the capacity again after a rest period &#10; of 12&amp;nbsp;hours. The Cadex&lt;i&gt; 7000 Series&lt;/i&gt; performs this &#10; task automatically. In the future, quick test methods may &#10; be available that are able to measure the self-discharge of &#10; a battery within a few seconds.&lt;/p&gt;&lt;a name="_Toc507909181"&gt;&lt;/a&gt;&lt;h4&gt;6.4 Premature Voltage Cut-off&lt;/h4&gt; &lt;p&gt;Some portable equipment does not fully utilize &#10; the low-end voltage spectrum of a battery. The equipment cuts &#10; off before the designated end-of-discharge voltage is reached &#10; and some precious battery power remains unused.&lt;/p&gt; &lt;p&gt;A high cut-off voltage problem is more widespread &#10; than is commonly assumed. For example, a certain brand of &#10; mobile phone that is powered with a single-cell Li-ion &#10; battery cuts off at 3.3V. The Li-ion can be designed &#10; to be used to 3V and lower. With a discharge to 3.3V, only &#10; about 70&amp;nbsp;percent of the expected 100&amp;nbsp;percent capacity &#10; is utilized. Another mobile phone using NiMH and NiCd batteries &#10; cuts off at 5.7V. The four-cell nickel-based batteries are &#10; designed to discharge to&amp;nbsp;5V.&lt;/p&gt; &lt;table border="0" cellspacing="0" cellpadding="0"&gt; &lt;tr&gt; &#10; &lt;td width="127"&gt; &#10; &lt;p&gt;&lt;img width="131" height="282" src="https://technick.net/img/guide_bpw2/c06_05.jpg" v:shapes="_x0000_i1029" border="0" alt="" /&gt;&lt;/p&gt; &lt;/td&gt; &lt;td width="252" valign="middle"&gt; &#10; &lt;p&gt;&lt;a name="_Toc502116703"&gt;&lt;/a&gt;&lt;a name="_Toc507815261" class="caption"&gt;Figure&amp;nbsp;6-5: &#10; Illustration of equipment with high cut-off voltage.&lt;/a&gt;&lt;br /&gt; &lt;span class="caption-sub"&gt; Some portable devices do &#10; not utilize all available battery power and leave precious &#10; energy behind.&lt;/span&gt;&lt;/p&gt; &lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;p&gt;When discharging these batteries to their respective &#10; end-of-discharge threshold with a battery analyzer after the &#10; equipment has cut off, up to 60&amp;nbsp;percent residual capacity &#10; readings can be retrieved. High residual capacity&amp;nbsp;is prevalent &#10; with batteries that have elevated internal resistance and &#10; are operated at warm ambient temperatures. Digital devices &#10; that load the battery with current bursts are more receptive &#10; to premature voltage cut-off than analog equipment.&lt;/p&gt; &lt;p&gt;A ’high cut-off voltage’ is mostly equipment &#10; related. In some cases the problem of premature cut-off is &#10; induced by a battery with low voltage. A low table voltage &#10; is often caused by a battery pack that contains a cell with &#10; an electrical short. Memory also causes a decrease in voltage; &#10; however, this is only present in nickel-based systems. In &#10; addition, elevated temperature lowers the voltage level on &#10; all battery systems. Voltage reduction due to high temperatures &#10; is temporary and normalizes once the battery cools&amp;nbsp;down. &#10; &lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>06. Theory of Ideal Bandlimited Interpolation</title><link>https://technick.net/guides/theory/dar/006/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dar/006/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/resample/"&gt;The Digital Audio Resampling Home Page&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, Copyright &amp;#169; &lt;i&gt;2016-05-17&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dar/005"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dar/000"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dar/007"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;Theory of Ideal Bandlimited Interpolation&lt;/h3&gt;&lt;p&gt;We review briefly the ``analog interpretation'' of &lt;a href="https://technick.net/guides/theory/dar/000"&gt;sampling rate conversion&lt;/a&gt;[&lt;a href="https://technick.net/guides/theory/dar/015#Crochiere"&gt;Crochiere and Rabiner&amp;nbsp;1983&lt;/a&gt;] on which the present method is based. Suppose we have&#10;samples &lt;img width="59" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img10.gif" alt="$x(nT_s)$" /&gt; of a continuous absolutely integrable signal &lt;img width="37" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img1.gif" alt="$x(t)$" /&gt;,&#10;where &lt;img width="12" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img11.gif" alt="$t$" /&gt; is time in seconds (real), &lt;img width="16" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img12.gif" alt="$n$" /&gt; ranges over the integers, and&lt;img width="23" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img13.gif" alt="$T_s$" /&gt; is the &lt;a href="https://ccrma.stanford.edu/~jos//st/Shannon_s_Sampling_Theorem.html" target="_blank"&gt;sampling period&lt;/a&gt;. We assume &lt;img width="37" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img1.gif" alt="$x(t)$" /&gt; is bandlimited to&lt;img width="58" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img14.gif" alt="$\" m="" s="" /&gt;, where &lt;img width="86" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img15.gif" alt="$F_s=1/T_s$" /&gt; is the &lt;a href="https://ccrma.stanford.edu/~jos//st/Shannon_s_Sampling_Theorem.html" target="_blank"&gt;sampling rate&lt;/a&gt;. If &lt;img width="49" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img16.gif" alt="$X(\" mega="" /&gt;denotes the Fourier transform of &lt;img width="37" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img1.gif" alt="$x(t)$" /&gt;, i.e., &lt;!-- MATH&#10; $X(\omega)=\int_{-\infty}^\infty x(t)&#10;e^{-j\omega t} dt$&#10; --&gt;&lt;img width="198" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img17.gif" alt="$X(\" mega="" nt="" nfty="" nfty="" e="" omega="" t="dt" /&gt;, then we assume &lt;img width="83" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img18.gif" alt="$X(\" mega="" /&gt; for&#10;&lt;!-- MATH&#10; $|\omega|\geq\pi F_s$&#10; --&gt;&lt;img width="84" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img19.gif" alt="$\" ert\omega\vert\geq\pi="" s="" /&gt;. Consequently, &lt;a href="https://ccrma.stanford.edu/~jos//st/Shannon_s_Sampling_Theorem.html" target="_blank"&gt;Shannon's sampling&#10;theorem&lt;/a&gt; gives us that &lt;img width="37" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img1.gif" alt="$x(t)$" /&gt; can be uniquely reconstructed from the&#10;samples &lt;img width="59" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img10.gif" alt="$x(nT_s)$" /&gt; via&lt;br /&gt;&lt;div align="RIGHT"&gt;&lt;!-- MATH&#10; \begin{equation}&#10;\hat{x}(t) \isdef \sum_{n=-\infty}^\infty x(nT_s) h_s(t-nT_s) \equiv x(t),&#10;\end{equation}&#10; --&gt;&lt;table width="100%" align="CENTER"&gt;&lt;tr valign="MIDDLE"&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;a name="eq:Erc"&gt;&lt;/a&gt;&lt;img width="342" height="62" border="0" src="https://technick.net/img/guide_dar/guide_dar_img20.gif" alt="\" egin="" isplaymath="" at="" t="" sdef="" um="" infty="" infty="" nt="" s="" s="s" t-nt="" s="" quiv="" end="" isplaymath="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(1)&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;where&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;h_s(t) \isdef \mbox{sinc}(F_st) \isdef {\sin(\pi F_st)\over \pi F_st}.&#10;\end{displaymath}&#10; --&gt;&lt;img width="265" height="55" border="0" src="https://technick.net/img/guide_dar/guide_dar_img21.gif" alt="\" egin="" isplaymath="" s="s" t="" sdef="" box="" inc="" st="" sdef="" in="" i="" t="" ver="" i="" t="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;To &lt;a href="https://technick.net/guides/theory/dar/000"&gt;resample&lt;/a&gt; &lt;img width="37" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img1.gif" alt="$x(t)$" /&gt; at a new sampling rate &lt;!-- MATH&#10; $F_s^\prime =1/T_s^\prime$&#10; --&gt;&lt;img width="86" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img22.gif" alt="$F_s^\" rime="1/T_s^\prime" /&gt;, we need only&#10;evaluate Eq.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/dar/006#eq:Erc"&gt;1&lt;/a&gt;) at integer multiples of &lt;img width="23" height="36" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img23.gif" alt="$T_s^\" rime="" /&gt;.&lt;p&gt;When the new sampling rate &lt;img width="24" height="36" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img24.gif" alt="$F_s^\" rime="" /&gt; is less than the original rate &lt;img width="24" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img25.gif" alt="$F_s$" /&gt;,&#10;the lowpass cutoff must be placed below half the new lower sampling rate.&#10;Thus, in the case of an ideal lowpass, &lt;!-- MATH&#10; $h_s(t) = \min\{1,F_s^\prime /F_s\}&#10;\mbox{sinc}(\min\{F_s,F_s^\prime \}t)$&#10; --&gt;&lt;img width="332" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img26.gif" alt="$h_s(t) = \" in\="" s="s" prime="" s\="" box="" inc="" in\="" s="s" f="" s="" rime="" /&gt;, where the scale factor maintains unity gain&#10;in the passband.&lt;/p&gt;&lt;p&gt;A plot of the sinc function &lt;!-- MATH&#10; $\mbox{sinc}(t) \isdeftext \sin(\pi t)/(\pi t)$&#10; --&gt;&lt;img width="178" height="44" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img27.gif" alt="$\" box="" inc="" isdeftext="" in="" i="" i="" /&gt;to the left and right of the origin &lt;img width="46" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img28.gif" alt="$t=0$" /&gt; is shown in Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dar/006#fig:Sinc"&gt;1&lt;/a&gt;.&#10;Note that peak is at &lt;a href="https://ccrma.stanford.edu/~jos//log/Logarithms.html" target="_blank"&gt;amplitude&lt;/a&gt; &lt;img width="14" height="16" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img29.gif" alt="$1$" /&gt;, and zero-crossings occur at all&#10;nonzero integers. The sinc function can be seen as a hyperbolically&#10;weighted sine function with its zero at the origin canceled out.&lt;/p&gt;&lt;p&gt; &lt;div align="CENTER"&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:Sinc"&gt;&lt;/a&gt;&lt;a name="1162"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure 1:&lt;/strong&gt;The sinc function &#10;plotted for seven zero-crossings to the left and right.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; $\scalebox{0.5}{\includegraphics{eps/Sinc.eps}}$&#10; --&gt;&lt;img width="249" height="139" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img30.gif" alt="\" calebox="" ncludegraphics="" ps="" inc="" ps="" /&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;&lt;p&gt;If ``&lt;img width="14" height="16" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img31.gif" alt="$\" st="" /&gt;'' denotes the &lt;a href="https://ccrma.stanford.edu/~jos//ReviewFourier/Convolution.html" target="_blank"&gt;convolution&lt;/a&gt; operation for digital signals, then&#10;the summation in Eq.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/dar/006#eq:Erc"&gt;1&lt;/a&gt;) can be written as &lt;!-- MATH&#10; $(x\ast h_s)(t)$&#10; --&gt;&lt;img width="87" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img32.gif" alt="$(x\" st="" s="" /&gt;.&lt;/p&gt;&lt;p&gt;Equation Eq.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/dar/006#eq:Erc"&gt;1&lt;/a&gt;) can be interpreted as a superpositon of&#10;shifted and scaled sinc functions &lt;img width="23" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img33.gif" alt="$h_s$" /&gt;. A sinc function instance is&#10;translated to each signal sample and scaled by that sample, and the&#10;instances are all added together. Note that zero-crossings of&#10;&lt;!-- MATH&#10; $\mbox{sinc}(z)$&#10; --&gt;&lt;img width="58" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img34.gif" alt="$\" box="" inc="" /&gt; occur at all integers except &lt;img width="49" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img35.gif" alt="$z=0$" /&gt;. That means at time&lt;img width="66" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img36.gif" alt="$t=nT_s$" /&gt;, (i.e., on a sample instant), the only contribution to the&#10;sum is the single sample &lt;img width="59" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img10.gif" alt="$x(nT_s)$" /&gt;. All other samples contribute sinc&#10;functions which have a zero-crossing at time &lt;img width="66" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img36.gif" alt="$t=nT_s$" /&gt;. Thus, the&#10;interpolation goes precisely through the existing samples, as it&#10;should.&lt;/p&gt;&lt;p&gt;A plot indicating how sinc functions sum together to reconstruct&#10;bandlimited signals is shown in Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dar/006#fig:SincSum"&gt;2&lt;/a&gt;. The figure shows a&#10;superposition of five sinc functions, each at unit amplitude, and&#10;displaced by one-sample intervals. These sinc functions would be used&#10;to reconstruct the &lt;a href="https://technick.net/guides/theory/dar/000"&gt;bandlimited interpolation&lt;/a&gt; of the discrete-time&#10;signal &lt;!-- MATH&#10; $x = [\ldots,0,1,1,1,1,1,0,\ldots]$&#10; --&gt;&lt;img width="230" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img37.gif" alt="$x = [\" dots="" dots="" /&gt;. Note that at each sampling&#10;instant &lt;img width="66" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img36.gif" alt="$t=nT_s$" /&gt;, the solid line passes exactly through the tip of the&#10;sinc function for that sample; this is just a restatement of the fact&#10;that the interpolation passes through the existing samples. Since the&#10;nonzero samples of the digital signal are all &lt;img width="14" height="16" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img29.gif" alt="$1$" /&gt;, we might expect the&#10;interpolated signal to be very close to &lt;img width="14" height="16" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img29.gif" alt="$1$" /&gt; over the nonzero interval;&#10;however, this is far from being the case. The deviation from unity&#10;between samples can be thought of as ``overshoot'' or ``ringing'' of&#10;the lowpass &lt;a href="https://technick.net/guides/theory/edft/010"&gt;filter&lt;/a&gt; which cuts off at half the sampling rate, or it can&#10;be considered a ``Gibbs phenomenon'' associated with bandlimiting.&lt;/p&gt;&lt;p&gt; &lt;div align="CENTER"&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:SincSum"&gt;&lt;/a&gt;&lt;a name="1174"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure 2:&lt;/strong&gt;Bandlimited reconstruction&#10;of the signal &lt;img width="37" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img1.gif" alt="$x(t)$" /&gt; from its samples &lt;!-- MATH&#10; $x =&#10;[\ldots,0,1,1,1,1,1,0,\ldots]$&#10; --&gt;&lt;img width="230" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img37.gif" alt="$x = [\" dots="" dots="" /&gt;. The dots show the signal samples, the&#10;dashed lines show the component sinc functions, and the solid line&#10;shows the unique bandlimited reconstruction from the samples obtained&#10;by summing the component sinc functions.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; $\scalebox{0.8}{\includegraphics{eps/SincSum.eps}}$&#10; --&gt;&lt;img width="348" height="130" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img38.gif" alt="\" calebox="" ncludegraphics="" ps="" incsum="" ps="" /&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;&lt;p&gt;A second interpretation of Eq.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/dar/006#eq:Erc"&gt;1&lt;/a&gt;) is as follows: to obtain the&#10;interpolation at time &lt;img width="12" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img11.gif" alt="$t$" /&gt;, shift the signal samples under &lt;i&gt;one &lt;/i&gt;sinc&#10;function so that time &lt;img width="12" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img11.gif" alt="$t$" /&gt; in the signal is translated under the peak of the&#10;sinc function, then create the output as a linear combination of signal&#10;samples where the coefficient of each signal sample is given by the value&#10;of the sinc function at the location of each sample. That this&#10;interpretation is equivalent to the first can be seen as a result of the&#10;fact that convolution is commutative; in the first interpretation, all&#10;signal samples are used to form a linear combination of shifted sinc&#10;functions, while in the second interpretation, samples from one sinc&#10;function are used to form a linear combination of samples of the shifted&#10;input signal. The practical bandlimited interpolation algorithm presented&#10;below is based on the second interpretation.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>07. Conjectured Properties</title><link>https://technick.net/guides/theory/edft/007/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/edft/007/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/filters/"&gt;Introduction to Digital Filters with Audio Applications&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, Copyright &amp;#169; &lt;i&gt;2017-11-26&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/edft/006"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/000"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/022"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/008"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;Conjectured Properties&lt;/h3&gt;&lt;p&gt;The following conjectures are true for analog &lt;a href="https://technick.net/guides/theory/edft/001"&gt;positive-real functions&lt;/a&gt;,&#10;but no rigorous attempt was made to establish them in the discrete-time case.&lt;/p&gt;&lt;p&gt;&lt;ul&gt;&lt;li&gt;If all poles and zeros of a PR function are on the unit circle, &#10;&#9;then they alternate along the circle.&lt;p&gt;&lt;/p&gt;&lt;/li&gt;&lt;li&gt;If &lt;img width="95" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img203.gif" alt="$B(z)/A(Z)$" /&gt; is PR, then so is &lt;!-- MATH&#10; $B^\prime(z)/A^\prime(z)$&#10; --&gt;&lt;img width="99" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img204.gif" alt="$B^\" rime="" a="a" prime="" /&gt;, where the prime&#10;&#9;denotes differentiation in &lt;img width="14" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img1.gif" alt="$z$" /&gt;.&lt;/li&gt;&lt;/ul&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>07. From Theory to Practice</title><link>https://technick.net/guides/theory/dar/007/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dar/007/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/resample/"&gt;The Digital Audio Resampling Home Page&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, Copyright &amp;#169; &lt;i&gt;2016-05-17&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dar/006"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dar/000"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dar/008"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;From Theory to Practice&lt;/h3&gt;&lt;p&gt;The summation in Eq.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/dar/006#eq:Erc"&gt;1&lt;/a&gt;) cannot be implemented in practice because&#10;the ``ideal lowpass &lt;a href="https://technick.net/guides/theory/edft/010"&gt;filter&lt;/a&gt;'' &lt;a href="https://technick.net/guides/theory/edft/010#2321"&gt;impulse&lt;/a&gt; response &lt;img width="44" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img39.gif" alt="$h_s(t)$" /&gt; actually extends&#10;from minus infinity to infinity. It is necessary in practice to &lt;i&gt;window&lt;/i&gt;the ideal impulse response so as to make it finite. This is the basis&#10;of the &lt;i&gt;window method &lt;/i&gt;for digital filter design[&lt;a href="https://technick.net/guides/theory/dar/015#DSPC"&gt;Digital Signal Processing Committee&amp;nbsp;1979a&lt;/a&gt;,&lt;a href="https://technick.net/guides/theory/dar/015#RabinerAndGold"&gt;Rabiner and Gold&amp;nbsp;1975&lt;/a&gt;]. While many other filter design techniques&#10;exist, the window method is simple and robust, especially for very&#10;long impulse responses. In the case of the algorithm presented below,&#10;the filter impulse response is very long because it is heavily&#10;oversampled. Another approach is to design optimal decimated&#10;``sub-phases'' of the filter impulse response, which are then&#10;interpolated to provide the ``continuous'' impulse response needed for&#10;the algorithm [&lt;a href="https://technick.net/guides/theory/dar/015#PutnamAndSmithMohonk97"&gt;Putnam and Smith&amp;nbsp;1997&lt;/a&gt;].&lt;/p&gt;&lt;p&gt;Figure&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dar/007#fig:IdealLowpass"&gt;3&lt;/a&gt; shows the &lt;a href="https://technick.net/guides/theory/edft/012"&gt;frequency response&lt;/a&gt; of the ideal &#10;lowpass filter. This is just the Fourier transform of &lt;img width="44" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img39.gif" alt="$h_s(t)$" /&gt;.&lt;/p&gt;&lt;p&gt; &lt;div align="CENTER"&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:IdealLowpass"&gt;&lt;/a&gt;&lt;a name="1185"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure 3:&lt;/strong&gt;Frequency response of the&#10;ideal lowpass filter.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; $\scalebox{0.5}{\includegraphics{eps/IdealLowpass.eps}}$&#10; --&gt;&lt;img width="225" height="139" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img40.gif" alt="\" calebox="" ncludegraphics="" ps="" deallowpass="" ps="" /&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;&lt;p&gt;If we truncate &lt;img width="44" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img39.gif" alt="$h_s(t)$" /&gt; at the fifth zero-crossing to the left and the&#10;right of the origin, we obtain the frequency response shown in&#10;Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dar/007#fig:SincTruncatedF"&gt;4&lt;/a&gt;. Note that the stopband exhibits only slightly&#10;more than 20 &lt;a href="https://ccrma.stanford.edu/~jos//log/Decibels.html" target="_blank"&gt;dB&lt;/a&gt; rejection.&lt;/p&gt;&lt;p&gt; &lt;div align="CENTER"&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:SincTruncatedF"&gt;&lt;/a&gt;&lt;a name="1194"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure 4:&lt;/strong&gt;Frequency response of&#10;the ideal lowpass filter after rectangularly windowing the ideal&#10;(sinc) impulse response at the fifth zero crossing to the left and&#10;right of the time origin. The vertical axis is in units of &lt;a href="https://ccrma.stanford.edu/~jos//log/Decibels.html" target="_blank"&gt;decibels&lt;/a&gt;(dB), and the horizontal axis is labeled in units of spectral samples&#10;between plus and minus half the &lt;a href="https://ccrma.stanford.edu/~jos//st/Shannon_s_Sampling_Theorem.html" target="_blank"&gt;sampling rate&lt;/a&gt;.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; $\scalebox{0.8}{\includegraphics{eps/SincTruncatedF.eps}}$&#10; --&gt;&lt;img width="359" height="223" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img41.gif" alt="\" calebox="" ncludegraphics="" ps="" inctruncatedf="" ps="" /&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;&lt;p&gt;If we instead use the Kaiser window [&lt;a href="https://technick.net/guides/theory/dar/015#Kaiser74"&gt;Kaiser&amp;nbsp;1974&lt;/a&gt;,&lt;a href="https://technick.net/guides/theory/dar/015#SmithWinFlt"&gt;Smith&amp;nbsp;1992&lt;/a&gt;] to&#10;taper &lt;img width="44" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img39.gif" alt="$h_s(t)$" /&gt; to zero by the fifth zero-crossing to the left and the&#10;right of the origin, we obtain the frequency response shown in&#10;Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dar/007#fig:SincKaiseredF"&gt;5&lt;/a&gt;. Note that now the stopband starts out close to&lt;img width="38" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img42.gif" alt="$-80$" /&gt; dB. The Kaiser window has a single parameter which can be used&#10;to modify the stop-band attenuation, trading it against the transition&#10;width from pass-band to stop-band.&lt;/p&gt;&lt;p&gt; &lt;div align="CENTER"&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:SincKaiseredF"&gt;&lt;/a&gt;&lt;a name="1203"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure 5:&lt;/strong&gt;Frequency response of the&#10;ideal lowpass filter Kaiser windowed at the fifth zero crossing to the&#10;left and right.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; $\scalebox{0.8}{\includegraphics{eps/SincKaiseredF.eps}}$&#10; --&gt;&lt;img width="338" height="223" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img43.gif" alt="\" calebox="" ncludegraphics="" ps="" inckaiseredf="" ps="" /&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>07. The ‘Smart’ Battery</title><link>https://technick.net/guides/electronics/bpw/c07_01/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c07_01/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c06_04"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c07_02"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;7. The ‘Smart’ Battery&lt;/h3&gt;&lt;p&gt; &#10; &lt;/p&gt;&lt;p&gt;Aspeaker at a battery seminar remarked that, “The battery &#10; is a wild animal and artificial intelligence domesticates &#10; it.” An ordinary or ‘dumb’ battery&amp;nbsp;has the inherit problem &#10; of not being able to display the amount of reserve energy &#10; it holds. Neither weight, color, nor size provides any indication &#10; of the battery’s state-of-charge (SoC) and state-of-health &#10; (SoH). The user is at the mercy of the battery when pulling &#10; a freshly charged battery from the charger. &lt;/p&gt;</description></item><item><title>07. The ‘Smart’ Battery 2</title><link>https://technick.net/guides/electronics/bpw/c07_02/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c07_02/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c07_01"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c07_03"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;The SMBus&lt;/h4&gt;&lt;p&gt; &lt;a name="_Ref503247608"&gt;&lt;/a&gt;&lt;a name="_Ref503247621"&gt;&lt;/a&gt;&lt;a name="_Ref503247623"&gt;&lt;/a&gt;&lt;a name="_Toc507909184"&gt;&lt;/a&gt; &lt;/p&gt;&lt;p&gt;The SMBus is the most complete of all systems. &#10; It represents a large effort from the portable electronic &#10; industry to standardize to one communications protocol and &#10; one set of data. The SMBus is a two-wire interface system &#10; through which simple power-related chips can communicate with &#10; the rest of the system. One wire handles the data; the second &#10; is the clock. It uses I&amp;sup2;C as its backbone. Defined by Philips, &#10; the I&amp;sup2;C is a synchronous multi-drop bi-directional communications &#10; system, which operates at a speed of up to 100 kilohertz (kHz). &#10; &lt;/p&gt; &lt;p&gt;The Duracell/Intel SBS, in use today, was standardized &#10; in 1993. In previous years, computer manufacturers had developed &#10; their own proprietary ‘smart’ batteries. With the new SBS &#10; specification, a broader interface standard was made possible. &#10; This reduces the hurdles of interfering with patents and intellectual &#10; properties.&lt;/p&gt; &lt;p&gt;In spite of an agreed standard, many large computer &#10; manufacturers, such as IBM, Compaq and Toshiba, have retained &#10; their proprietary batteries. The reason for going their own &#10; way is partly due to safety, performance and form factor. &#10; Manufacturers claim that they cannot guarantee safe and enduring &#10; performance if a non-brand battery is used. To make the equipment &#10; as compact as possible, the manufacturers explain that the &#10; common form factor battery does not optimally fit their available &#10; space. Perhaps the leading motive for using their proprietary &#10; batteries is pricing. In the absence of competition, these &#10; batteries can be sold for a premium price.&lt;/p&gt; &lt;p&gt;The early SMBus batteries had problems of poor &#10; accuracy. Electronic circuits did not provide the necessary &#10; resolution; neither was real time reporting of current, voltage &#10; and temperature adequate. On some batteries, the specified &#10; accuracy could only be achieved if the battery was new, operated &#10; at room temperature and was discharged at a steady rate of &#10; 1C. Operating in adverse temperatures or discharging at uneven &#10; loads reduced the accuracy dramatically. Most loads for portable &#10; equipment are uneven and fluctuate with power demand. There &#10; are power surges on a laptop at start up and refresh, high &#10; inrush currents on biomedical equipment during certain procedures &#10; and sharp pulse bursts on digital communications devices on &#10; transmit.&lt;/p&gt; &lt;p&gt;In the absence of a reliable reporting system &#10; on the older generation of ‘smart’ batteries, capacity estimation &#10; was inaccurate. This resulted in powering down the equipment &#10; before the battery was fully depleted, leaving precious energy &#10; behind. Most batteries introduced in the late 1990s have resolved &#10; some or all of these deficiencies. Further improvements will &#10; be necessary.&lt;/p&gt; &lt;p&gt;&lt;b&gt;Design&lt;/b&gt;— The design philosophy behind the &#10; SMBus battery is to remove the charge control from the charger &#10; and assign it to the battery. With a true SMBus system, the &#10; battery becomes the master and the charger serves as a slave &#10; that must follow the dictates of the battery. This is done &#10; out of concerns over charger quality, compatibility with new &#10; and old battery chemistries, administration of the correct &#10; amount of charge currents and accurate full-charge detection. &#10; Simplifying the charging for the user is an issue that is &#10; important when considering that some battery packs share the &#10; same footprint but contain radically different chemistries.&lt;/p&gt; &lt;p&gt;The SMBus system allows new battery chemistries &#10; to be introduced without the charger becoming obsolete. Because &#10; the battery controls the charger, the battery manages the &#10; voltage and current levels, as well as cut-off thresholds. &#10; The user does not need to know which battery chemistry is &#10; being&amp;nbsp;used.&lt;/p&gt; &lt;p&gt;The analogy of charging a ‘smart’ and ‘dumb’ &#10; battery can be made with the eating habits of an adult and &#10; a baby. Charging a ‘smart’ battery resembles the eating choices &#10; of a responsible adult who knows best what food to select &#10; how much to take. The baby, in on the other hand, has limited &#10; communications skills in expressing the type and amount of &#10; food desired. Putting this analogy in parallel with charging &#10; batteries, the charger servicing ‘dumb’ batteries can only &#10; observe the approximate SoC level and avoid overcharge conditions.&lt;/p&gt; &#10; &lt;/blockquote&gt;</description></item><item><title>07. The ‘Smart’ Battery 3</title><link>https://technick.net/guides/electronics/bpw/c07_03/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c07_03/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c07_02"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c07_04"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt; &#10; &lt;/p&gt;&lt;p&gt;&lt;b&gt;Architecture&lt;/b&gt; — An SMBus battery contains &#10; permanent and temporary data. The permanent data is programmed &#10; into the battery at the time of manufacturing and include &#10; battery ID number, battery type, serial number, manufacturer’s &#10; name and date of manufacture. The temporary data is acquired &#10; during use and consists of cycle count, user pattern and maintenance &#10; requirements. Some of the temporary data is being replaced &#10; and renewed during the life of the battery.&lt;/p&gt; &lt;p&gt;The SMBus is divided into Level&amp;nbsp;1, 2 and &#10; 3. Level&amp;nbsp;1 has been eliminated because it does not provide &#10; chemistry independent charging. Level&amp;nbsp;2 is designed for &#10; in-circuit charging. A laptop that charges its battery within &#10; the unit is a typical example of Level&amp;nbsp;2. Another application &#10; of Level&amp;nbsp;2 is a battery that contains the charging circuit &#10; within the pack. Level&amp;nbsp;3 is reserved for full-featured &#10; external chargers.&lt;/p&gt; &lt;p&gt;Most external SMBus chargers are based on Level&amp;nbsp;3. &#10; Unfortunately, this level is complex and the chargers are &#10; costly to manufacture. Some lower cost chargers have emerged &#10; that accommodate SMBus batteries but are not fully SBS compliant. &#10; Manufacturers of SMBus batteries do not readily endorse this &#10; shortcut. Safety is always a concern, but customers buy these &#10; economy chargers because of the lower price.&lt;/p&gt; &lt;table border="0" cellspacing="0" cellpadding="0"&gt; &lt;tr&gt; &#10; &lt;td width="255"&gt; &#10; &lt;p&gt;&lt;img width="239" height="366" src="https://technick.net/img/guide_bpw2/c07_03.gif" v:shapes="_x0000_i1030" border="0" alt="" /&gt;&lt;/p&gt; &lt;/td&gt; &lt;td width="232" valign="middle"&gt; &#10; &lt;p&gt;&lt;a name="_Toc502116705"&gt;&lt;/a&gt;&lt;a name="_Toc507815263" class="caption"&gt;Figure&amp;nbsp;7-2: &#10; Two-wire SMBus system.&lt;/a&gt;&lt;br /&gt; &lt;span class="caption-sub"&gt;The SMBus is based on a two-wire &#10; system using a standardized communications protocol. &#10; This system lends itself to standardized state-of-charge &#10; and state-of-health measurements.&lt;/span&gt;&lt;/p&gt; &lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;p&gt;Serious industrial battery users operating biomedical &#10; instruments, data collection devices and survey equipment &#10; use Level&amp;nbsp;3 chargers with full-fledged charge protocol. &#10; No shortcuts are applied. To assure compatibility, the charger &#10; and battery are matched and only approved packs are used. &#10; The need to test and approve the marriage between specific &#10; battery and charger types is unfortunate given that the ‘smart’ &#10; battery is intended to be universal.&lt;/p&gt; &lt;p&gt;Among the most popular SMBus batteries for portable &#10; computers are the 35&amp;nbsp;and 202&amp;nbsp;form-factors. Manufactured &#10; by Sony, Hitachi, GP Batteries, Moltech (formerly Energizer), &#10; Moli Energy and many others, this battery works (should work) &#10; in all portable equipment designed for this system.&lt;/p&gt; &lt;p&gt;Figure&amp;nbsp;7-3 illustrates the 35&amp;nbsp;and &#10; 202&amp;nbsp;series ‘smart' batteries. Although the ‘35’ has a &#10; smaller footprint compared to the ‘202’, most chargers are &#10; designed to accommodate all sizes, provided the common five-prong &#10; knife connector is&amp;nbsp;used.&lt;/p&gt; &lt;p&gt;&lt;img width="432" height="238" src="https://technick.net/img/guide_bpw2/c07_04.jpg" v:shapes="_x0000_i1036" border="0" alt="" /&gt;&lt;/p&gt; &lt;p&gt;&lt;a name="_Ref501878414"&gt;&lt;/a&gt;&lt;a name="_Toc502116706"&gt;&lt;/a&gt;&lt;a name="_Ref505493222"&gt;&lt;/a&gt;&lt;a name="_Toc507815264"&gt;&lt;span class="caption"&gt;Figure&amp;nbsp;7-3:&amp;nbsp;&lt;/span&gt;&lt;/a&gt;&lt;span class="caption"&gt;35 &#10; and 202 series ‘smart’ batteries featuring SMBus.&lt;br /&gt; &lt;/span&gt;&lt;span class="caption-sub"&gt;Available in NiCd, NiMH and &#10; Li-ion chemistries, these batteries are used for mobile computing, &#10; biomedical instruments and high-end survey equipment. The &#10; same form factor also accommodates NiCd and NiMH chemistries &#10; but without SMBus (‘dumb’).&lt;/span&gt;&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>07. The ‘Smart’ Battery 4</title><link>https://technick.net/guides/electronics/bpw/c07_04/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c07_04/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c07_03"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c07_05"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;&lt;b&gt;Negatives of the SMBus&lt;/b&gt; — Like any good &#10; invention, the SMBus battery has some serious downsides that &#10; must be addressed. For starters, the ‘smart’ battery costs &#10; about 25&amp;nbsp;percent more than the ‘dumb’ equivalent. In &#10; addition, the ‘smart’ battery was intended to simplify the &#10; charger, but a full-fledged Level&amp;nbsp;3 charger costs substantially &#10; more than a regular dumb model.&lt;/p&gt; &lt;p&gt;A more serious issue is maintenance requirements, &#10; better known as capacity re-learning. This procedure is needed &#10; on a regular basis to calibrate the battery. The Engineering &#10; Manager of Moli Energy, a large Li-ion cell manufacturer &#10; commented, “With the Li-ion battery we have eliminated &#10; the memory effect, but are we introducing digital memory with &#10; the SMBus battery?”&lt;/p&gt; &lt;p&gt;Why is calibration needed? The answer is in correcting &#10; the tracking errors that occur between the battery and the &#10; digital sensing circuit during use. The most ideal battery &#10; use, as far as fuel-gauge accuracy is concerned, is a full &#10; charge followed by a full discharge at a constant 1C rate. &#10; This ensures that the tracking error is less than one&amp;nbsp;percent &#10; per cycle. However, a battery may be discharged for only a &#10; few minutes at a time and commonly at a lower C-rate &#10; than 1C. Worst of all, the load may be uneven and vary drastically. &#10; Eventually, the true capacity of the battery no longer synchronizes &#10; with the fuel gauge and a full charge and discharge are needed &#10; to ‘re-learn’ or calibrate the battery.&lt;/p&gt; &lt;p&gt;How often is calibration needed? The answer lies &#10; in the type of battery application. For practical purposes, &#10; a calibration is recommended once every three months or after &#10; every 40&amp;nbsp;short cycles. Long storage also contributes &#10; to errors because the circuit cannot accurately compensate &#10; for self-discharge. After extensive storage, a calibration &#10; cycle is recommended prior to&amp;nbsp;use.&lt;/p&gt; &lt;p&gt;Many applications apply a full discharge as part &#10; of regular use. If this occurs regularly, no additional calibration &#10; is needed. If a full discharge has not occurred for a few &#10; months and the user notices the fuel gauge losing accuracy, &#10; a deliberate full discharge on the equipment is recommended. &#10; Some intelligent equipment advises the user when a calibrating &#10; discharge is needed. This is done by measuring the tracking &#10; error and estimating the discrepancy between the fuel gauge &#10; reading and that of the chemical battery.&lt;/p&gt; &lt;p&gt;What happens if the battery is not calibrated &#10; regularly? Can such a battery be used in confidence? Most &#10; ‘smart’ battery chargers obey the dictates of the cells rather &#10; than the electronic circuit. In this case, the battery will &#10; be fully charged regardless of the fuel gauge setting. Such &#10; a battery is able to function normally, but the digital readout &#10; will be inaccurate. If not corrected, the fuel gauge information &#10; simply becomes a nuisance.&lt;/p&gt; &lt;p&gt;The level of non-compliance is another problem &#10; with the SMBus. Unlike other tightly regulated standards, &#10; such as the long play record introduced in the late 1950s, &#10; the audiocassette in the 1960s, the VCR in the 1970s, ISDN &#10; and GSM in the 1980s and the USB in the 1990s, some variations &#10; are permitted in the SMBus protocol. These are: adding a check &#10; bid to halt the service if the circuit crashes, counting the &#10; number of discharges to advise on calibration and disallowing &#10; a charge if a certain fault condition has occurred. Unfortunately, &#10; these variations cause problems with some existing chargers. &#10; As a result, a given SMBus battery should be checked for compatibility &#10; with the designated charger before use to assure reliable &#10; service. Ironically, the more features that are added to the &#10; SMBus charger and battery, the higher the likelihood of incompatibilities.&lt;/p&gt; &lt;p&gt;‘Smart’ battery technology has not received the &#10; widespread acceptance that battery manufacturers had hoped. &#10; Some engineers go so far as to suggest that the SMBus battery &#10; is a ‘misguided principal’. Design engineers may not have &#10; fully understood the complexity of charging batteries in the &#10; incubation period of the ‘smart’ battery. Manufacturers of &#10; SMBus chargers are left to clean up the&amp;nbsp;mess.&lt;/p&gt; &lt;p&gt;The forecast in consumer acceptance of the ‘smart’ &#10; battery has been too optimistic. In the early 1990s when the &#10; SMBus battery was conceived, price many not have been as critical &#10; an issue as it is now. Then, the design engineer would include &#10; many wonderful options. Today, we look for scaled down products &#10; that are economically priced and perform the function intended. &#10; When looking at the wireless communications market, adding &#10; high-level intelligence to the battery is simply too expensive &#10; for most consumers. In the competitive mobile phone market, &#10; for example, the features offered by the SMBus would be considered &#10; overkill.&lt;/p&gt; &lt;p&gt;SMBus battery technology is mainly used by higher-level &#10; industrial applications and battery manufacturers are constantly &#10; searching for avenues to achieve a wider utilization of the &#10; ‘smart’ battery. According to a survey in Japan, about 30&amp;nbsp;percent &#10; of all mobile computing devices are equipped with a ‘smart’ &#10; battery.&lt;/p&gt; &lt;p&gt;Improvements in the ‘smart’ battery system, such &#10; as better compatibilities, improved error-checking functions &#10; and higher accuracies will likely increase the appeal of the &#10; ‘smart’ battery. Endorsement by large software manufacturers &#10; such as Microsoft will entice PC manufacturers to make full &#10; use of these powerful features.&lt;/p&gt; &#10; &lt;/blockquote&gt;</description></item><item><title>07. The ‘Smart’ Battery 5</title><link>https://technick.net/guides/electronics/bpw/c07_05/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c07_05/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c07_04"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c07_06"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;7.3 The State-of-Charge Indicator&lt;/h4&gt;&lt;p&gt;&lt;a name="_Toc507909185"&gt;&lt;/a&gt; &lt;/p&gt;&lt;p&gt;Most SMBus batteries are equipped with a charge &#10; level indicator. When pressing a SoC button on a battery that &#10; is fully charged, all signal lights illuminate. On a partially &#10; discharged battery, half the lights illuminate, and on an &#10; empty battery, all lights remain dark. Figure&amp;nbsp;7-4&lt;i&gt; &#10; s&lt;/i&gt;hows such a fuel gauge.&lt;/p&gt; &lt;table border="0" cellspacing="0" cellpadding="0"&gt; &lt;tr&gt; &#10; &lt;td width="263"&gt; &#10; &lt;p&gt;&lt;img width="250" height="86" src="https://technick.net/img/guide_bpw2/c07_05.gif" v:shapes="_x0000_i1028" border="0" alt="" /&gt;&lt;/p&gt; &lt;/td&gt; &lt;td width="224"&gt; &#10; &lt;p&gt;&lt;a name="_Ref506312528"&gt;&lt;/a&gt;&lt;a name="_Toc507815265" class="caption"&gt;Figure&amp;nbsp;7-4:&amp;nbsp;&amp;nbsp;&amp;nbsp; &#10; State-of-charge readout of a ‘smart’ battery.&lt;/a&gt;&lt;br /&gt; &lt;span class="caption-sub"&gt;Although the state-of-charge &#10; is displayed, the state-of-health and its predicted &#10; runtime are unknown.&lt;/span&gt;&lt;/p&gt; &lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;p&gt;While SoC information displayed on a battery &#10; or computer screen is helpful, the fuel gauge resets to 100&amp;nbsp;percent &#10; each time the battery is recharged, regardless of the battery’s &#10; SoH. A serious miscount occurs if an aged battery shows 100&amp;nbsp;percent &#10; after a full-charge, when in fact the charge acceptance has &#10; dropped to 50&amp;nbsp;percent or less. The question remains: &#10; “100&amp;nbsp;percent of what?” A user unfamiliar with this battery &#10; has little information about the runtime of the&amp;nbsp;pack.&lt;/p&gt; &lt;a name="_Toc507909186"&gt;&lt;/a&gt;&lt;h4&gt;7.4 The Tri-State Fuel Gauge&lt;/h4&gt; &lt;p&gt;The SoC information alone is incomplete without &#10; knowing the battery’s SoH. To fully evaluate the present state &#10; of a battery, three levels of information are needed. They &#10; are: SoC, SoH and the empty portion of the battery that can &#10; be replenished with a charge. (The empty portion is derived &#10; by deducting the SoC from the SoH.)&lt;/p&gt; &lt;p&gt;How can the three levels of a battery be measured &#10; and made visible to the user? While the SoC is relatively &#10; simple to produce, as discussed above, measuring the SoH is &#10; more complex. Here is how it works:&lt;/p&gt; &lt;p&gt;At time of manufacture, each SMBus battery is &#10; given its specified SoH status, which is 100&amp;nbsp;percent &#10; by default. This information is permanently programmed into &#10; the pack and does not change. With each charge, the battery &#10; resets to the full-charge status. During discharge, the energy &#10; units (coulombs) are counted and compared against the 100&amp;nbsp;percent &#10; setting. A perfect battery would indicate 100&amp;nbsp;percent &#10; on a calibrated fuel gauge. As the battery ages and the charge &#10; acceptance drops, the SoH begins to indicate lower readings. &#10; The discrepancy between the factory set 100&amp;nbsp;percent and &#10; the actual delivered coulombs is used to calculate the SoH.&lt;/p&gt; &lt;p&gt;Knowing the SoC and SoH, a simple linear display &#10; can be made. The SoC is indicated with green LED’s; the empty &#10; part remains dark; and the unusable part is shown with red &#10; LED’s. Figure&amp;nbsp;7-5 shows such a tri-state fuel gauge. &#10; As an alternative, the colored bar display may be replaced &#10; with a numeric display indicating SoH and&amp;nbsp;SoC.&lt;/p&gt; &lt;p&gt;&lt;a name="_Ref501878383"&gt;&lt;/a&gt;&lt;a name="_Toc502116708"&gt;&lt;img width="432" height="183" src="https://technick.net/img/guide_bpw2/c07_06.gif" v:shapes="_x0000_i1026" border="0" alt="" /&gt;&lt;/a&gt;&lt;/p&gt; &lt;p&gt;&lt;a name="_Ref506175742"&gt;&lt;/a&gt;&lt;a name="_Toc507815266"&gt;&lt;span class="caption"&gt;Figure&amp;nbsp;7-5&lt;/span&gt;&lt;/a&gt;&lt;span class="caption"&gt;: &#10; Tri-state fuel gauge.&lt;/span&gt;&lt;br /&gt; &lt;span class="caption-sub"&gt;The Battery Health Gauge reads the &#10; ‘learned’ battery information available on the SMBus and displays &#10; it on a multi-colored LED bar. This illustration shows a partially &#10; discharged battery of 50% SoC with a 20% empty portion and &#10; an unusable portion of 30%.&lt;/span&gt;&lt;/p&gt; &lt;p&gt;The most practical setting to place the tri-state-fuel &#10; gauge is on a charger. Only one display would be needed for &#10; a multi-bay charging unit. To view the readings of a battery, &#10; the user would simply press a button. The SoC and SoH information &#10; would be displayed within five seconds after inserting the &#10; battery into the charger bay. During charge, the gauge would &#10; reveal the charge level of each battery. This information &#10; would be handy when a functional battery is needed in a hurry. &#10; Cadex offers a series of SMBus chargers that feature the tri-state &#10; fuel gauge as an option.&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>07. The ‘Smart’ Battery 6</title><link>https://technick.net/guides/electronics/bpw/c07_06/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c07_06/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c07_05"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c07_07"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;7.5 The Target Capacity Selector&lt;/h4&gt;&lt;p&gt;&lt;a name="_Toc507909187"&gt;&lt;/a&gt; &lt;/p&gt;&lt;p&gt;For users that simply need a go/no go answer &#10; and do not want to bother about other battery information, &#10; chargers are available that feature a target capacity selector. &#10; Adjustable to 60, 70 or 80&amp;nbsp;percent, the target capacity &#10; selector acts as a performance check and flags batteries that &#10; do not meet set requirements.&lt;/p&gt; &lt;p&gt;If a battery falls below target, the charger &#10; triggers the condition light. The user is prompted to press &#10; the condition button to cycle the battery. Condition consists &#10; of charge/discharge/charge and performs calibration and conditioning &#10; functions. If the battery does not recover after the conditioning &#10; service, the fail light illuminates, indicating that the battery &#10; should be replaced. A green ready light at the completion &#10; of the program assures that the battery meets the required &#10; performance level.&lt;/p&gt; &lt;p&gt;An SMBus charger with the above described features &#10; acts as charger, conditioner and quality control system. Figure&amp;nbsp;76 &#10; illustrates a two-bay Cadex charger featuring the target capacity &#10; selector and discharge circuit. This unit is based on Level&amp;nbsp;3 &#10; and services both SMBus and ‘dumb’ batteries.&lt;/p&gt; &lt;p&gt;Some SMBus chargers can be fully automated to &#10; apply a conditioning cycle whenever the battery falls below &#10; the target setting. An override button cancels the discharge &#10; if a fast-charge is needed instead. Such a system maximizes &#10; the life of fleet batteries and assures that deadwood is identified &#10; and removed.&lt;/p&gt; &lt;table border="0" cellspacing="0" cellpadding="0"&gt; &lt;tr&gt; &#10; &lt;td width="235"&gt; &#10; &lt;p&gt;&lt;a name="_Ref501878362"&gt;&lt;/a&gt;&lt;a name="_Toc502116709"&gt;&lt;/a&gt;&lt;img src="https://technick.net/img/guide_bpw2/c07_07.jpg" width="216" height="266" border="0" alt="" /&gt;&lt;/p&gt; &lt;p&gt;&amp;nbsp;&lt;/p&gt; &lt;/td&gt; &lt;td width="235"&gt; &#10; &lt;p&gt;&lt;a name="_Toc507815267"&gt;&lt;span class="caption"&gt;Figure 7-6:The Cadex &lt;/span&gt;&lt;/a&gt;&lt;span class="caption"&gt;&lt;i&gt;SM2+&lt;/i&gt; &#10; charger&lt;/span&gt;&lt;br /&gt; &lt;span class="caption-sub"&gt;This Level 3 charger serves &#10; as charger, conditioner and quality control system. &#10; It reads the battery’s true state-of-health and flags &#10; those that fall below the set target capacity. Each &#10; bay operates independently and charges NiCd, NiMH and &#10; Liion chemistries in approximately three&amp;nbsp;hours. &#10; ‘Dumb’ batteries can also be charged.&lt;/span&gt;&lt;/p&gt; &lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;p&gt;By allowing the user to set the desired battery &#10; performance level, the question is raised as to what level &#10; to select. The answer is governed by the applications, reliability &#10; standards and cost policies. &lt;/p&gt; &lt;p&gt;It should be noted that the batteries are always &#10; charged to 100&amp;nbsp;percent, regardless of the target setting. &#10; The target capacity simply refers to the amount of charge &#10; the battery has delivered on the last discharge.&lt;/p&gt; &lt;p&gt;A practical target capacity setting for most &#10; applications is 80&amp;nbsp;percent. Decreasing the threshold &#10; to 70&amp;nbsp;percent will lower the performance standard but &#10; pass more batteries. A direct cost saving will result. The &#10; 60&amp;nbsp;percent level may suit those users who run a low budget &#10; operation, have ready access to replacement batteries and &#10; can live with shorter, less predictable runtimes.&lt;/p&gt; &lt;p&gt;Battery SoH readings are only available with &#10; Level&amp;nbsp;3 SMBus chargers servicing valid SMBus batteries. &#10; ‘Dumb’ batteries cannot provide SoH readings, even if they &#10; share the identical footprint of the ‘smart’ battery and can &#10; use the same charger.&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>07. The ‘Smart’ Battery 7</title><link>https://technick.net/guides/electronics/bpw/c07_07/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c07_07/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c07_06"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c08_01"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;7.6 Fuel Gauges for Large Batteries&lt;/h4&gt;&lt;p&gt;&lt;a name="_Toc507909188"&gt;&lt;/a&gt; &lt;/p&gt;&lt;p&gt;Most ‘smart’ battery applications today are limited &#10; to portable electronic equipment, and the electronic circuit &#10; is built right into the battery pack. In applications where &#10; larger ‘smart’ batteries are needed, such as electric wheelchairs, &#10; scooters, robots and forklifts, the electronic circuit may &#10; be placed in a box external to the battery.&lt;/p&gt; &lt;p&gt;The main benefit of adding intelligence to the &#10; battery is to enable the measurement of SoH and reserve energy. &#10; Most measuring devices used are based on voltage, which is &#10; known to be highly inaccurate.&lt;/p&gt; &lt;p&gt;Cadex is extending the ‘smart’ battery technology &#10; to wheeled applications. Called the Cadex &lt;i&gt;Fuelcheck™&lt;/i&gt;, &#10; the device is based on the tri-state fuel gauge described &#10; earlier in this section. The system consists of a controller, &#10; current measuring device and a display unit. The Cadex &lt;i&gt;Fuelcheck™&lt;/i&gt; &#10; device can be added to new equipment when it is manufactured &#10; and can be installed in existing equipment as a retrofit. &#10; The installation is permanent and each wheeled appliance requires &#10; one system.&lt;/p&gt; &lt;p&gt;A tri-state linear bar graph consisting of colored &#10; LED’s would be the preferred display for a personal user, &#10; such as a wheelchair operator. By replacing the light display &#10; with a digital readout, additional information can be shown. &#10; For example, a display could indicate the remaining runtime &#10; based on the average power consumption logged. Corrections &#10; would be applied if the load factor changes during the course &#10; of the day. Figure&amp;nbsp;77 illustrates a digital fuel &#10; gauge using the LCD panel.&lt;/p&gt; &lt;p&gt;To initialize the Cadex &lt;i&gt;Fuelcheck&lt;/i&gt;™ system, &#10; a one-time setup procedure is required. A PC will prompt the &#10; technician to enter information such as battery chemistry, &#10; desired end-of-discharge voltage, Ah rating of the battery, &#10; and designated service flags. The system is then calibrated &#10; by applying a full charge, followed by a full discharge. The &#10; initial discharge assesses the battery, or learns the performance. &#10; The SoH readings will be known after the first full discharge.&lt;/p&gt; &lt;table border="0" cellspacing="0" cellpadding="0"&gt; &lt;tr&gt; &#10; &lt;td width="211"&gt; &#10; &lt;p style="'&amp;lt;span" style="'" styleref="" s=""&gt;&lt;img src="https://technick.net/img/guide_bpw2/c07_08.jpg" width="192" height="161" border="0" alt="" /&gt;&lt;/p&gt; &lt;/td&gt; &lt;td width="211"&gt; &#10; &lt;p class="caption" style="'&amp;lt;span" style="'" styleref="" s=""&gt;7-7:&amp;nbsp;Cadex &lt;i&gt;Fuelcheck™&lt;/i&gt; digital fuel&amp;nbsp;gauge.&lt;br /&gt; &lt;span class="caption-sub"&gt;The display indicates SoC, &#10; SoH, remaining power in&amp;nbsp;hours, the voltage and &#10; current draw.&lt;/span&gt;&lt;/p&gt; &lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;p&gt;The simplest way to discharge the battery as &#10; part of calibration is to run it down through normal use in &#10; the equipment. The most accurate readings are obtained by &#10; using a load bank. Such a device may not be always available.&lt;/p&gt; &lt;p&gt;With a data logging option built into the system, &#10; the PC allows downloading service data that have been collected &#10; during use. Such information would benefit large equipment &#10; fleets and rental places that need to check the performance &#10; of the batteries on demand.&lt;/p&gt; &lt;p&gt;Similar to other ‘smart’ battery systems, calibration &#10; will be needed once every 6&amp;nbsp;to&amp;nbsp;12&amp;nbsp;months. More &#10; frequent calibrations may be required if the equipment is &#10; used for short durations between each recharge. The most practical &#10; way to calibrate the system is by occasionally allowing the &#10; battery to run down through continued use. Information relating &#10; to the date of the last calibration, or an early call for &#10; calibration if certain conditions occur, can be calculated &#10; and displayed.&lt;/p&gt; &lt;p&gt;Knowing the SoH of a battery at any time and scheduling timely &#10; service or replacement is a major benefit for industrial battery &#10; users. Such a system would be especially helpful for organizations &#10; in which different individuals use the equipment and no one &#10; is given maintenance responsibilities. Equipment rental places &#10; fall into this category.&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>08. Choosing the Right Battery</title><link>https://technick.net/guides/electronics/bpw/c08_01/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c08_01/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c07_07"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c08_02"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;8. Choosing the Right Battery&lt;/h3&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;What causes a battery to wear down — is it mechanical or &#10; chemical? The answer is ‘both’. A battery is a perishable &#10; product that starts deteriorating from the time it leaves &#10; the factory. Similar to a spring under tension, a battery &#10; seeks to revert to its lowest denominator. The rate of aging &#10; is subject to depth of discharge, environmental conditions, &#10; charge methods and maintenance procedures (or lack thereof). &#10; Each battery chemistry behaves differently in terms of aging &#10; and wear through normal use. &lt;/p&gt;&lt;a name="_Toc507909190"&gt;&lt;/a&gt;&lt;h4&gt;8.1 What’s the best battery for mobile phones?&lt;/h4&gt; &lt;p&gt;&lt;img src="https://technick.net/img/guide_bpw2/c08_01.gif" width="203" height="114" align="right" vspace="19" hspace="19" border="0" alt="" /&gt;When &#10; buying a replacement battery, the buyer often has the choice &#10; of different battery chemistries. Li-ion and Li-ion polymer &#10; batteries are used on newer phones, whereas the NiMH and NiCd &#10; are found in older models. If the buyer has a choice, the &#10; sales person may advise a customer to go for the highest capacity &#10; rating and to stay away from the NiCd because of the memory &#10; effect. The customer may settle for the slim-line NiMH because &#10; it offers relatively high capacity in a small package and &#10; is reasonably priced.&lt;/p&gt; &lt;p&gt;Seemingly a wise choice, an analysis in this &#10; chapter reveals that other chemistries may have served better. &#10; The NiMH offers good value for the price but falls short in &#10; expected cycle life. Although excellent when new, the performance &#10; trails off quickly after about 300&amp;nbsp;cycles due to decreased &#10; capacity and rising internal resistance. In comparison, the &#10; Li-ion can be used for about 500&amp;nbsp;cycles. The best cycle &#10; count is achieved with NiCd. Properly maintained, the NiCd &#10; delivers over 1000&amp;nbsp;cycles and the internal resistance &#10; remains low. However, the NiCd offers about 30&amp;nbsp;percent &#10; less capacity compared to the NiMH. In addition, the NiCd &#10; is being removed from the mobile phone market because of environmental &#10; concerns.&lt;/p&gt; &lt;p&gt;Switching to environmentally friendlier batteries &#10; is fitting, especially in the mobile phone market where the &#10; NiMH performs reasonably well and can be economical. The battery &#10; disposal issue is difficult to control, particularly in the &#10; hands of a diverse user group.&lt;/p&gt; &lt;p&gt;&lt;img src="https://technick.net/img/guide_bpw2/c08_02.gif" width="213" height="100" align="left" hspace="19" vspace="19" border="0" alt="" /&gt;The &#10; NiMH and NiCd are considered high maintenance batteries, which &#10; require regular discharge cycles to prevent what is referred &#10; to as ‘memory’. Although the NiMH was originally advertised &#10; as memory-free, both NiCd and NiMH are affected by the phenomenon. &#10; The capacity loss is caused by crystalline formation that &#10; is generated by the positive nickel plate, a metal shared &#10; by both systems.&lt;/p&gt; &lt;p&gt;Nickel-based batteries, especially NiCd’s, should &#10; be fully discharged once per month. If such maintenance is &#10; omitted for four months or more, the capacity drops by as &#10; much as one third. A full restoration becomes more difficult &#10; the longer service is withheld.&lt;/p&gt; &lt;p&gt;It is not recommended to discharge a battery &#10; before each charge because this wears down the battery unnecessarily &#10; and shortens the life. Neither is it advisable to leave a &#10; battery in the charger for a long period of time. When not &#10; in use, the battery should be put on a shelf and charged before &#10; use. Always store the battery in a cool place.&lt;/p&gt; &lt;p&gt;Is the Li-ion a better choice? Yes, for &#10; many applications. The Li-ion is a low maintenance battery &#10; which offers high energy, is lightweight and does not require &#10; periodic full discharge. No trickle charge&amp;nbsp;is applied once &#10; the battery reaches full charge. The Li-ion battery &#10; can stay in most chargers until used. The charging process &#10; of a Li-ion is, in many ways, simpler and cleaner than &#10; that of nickel-based systems, but requires tighter tolerances. &#10; Repeated insertion into the charger or cradle does not affect &#10; the battery by inducing overcharge.&lt;/p&gt; &lt;p&gt;On the negative side, the Li-ion gradually &#10; loses charge acceptance as part of aging, even if not used. &#10; For this reason, Li-ion batteries should not be stored &#10; for long periods of time but be rotated like perishable food. &#10; The buyer should be aware of the manufacturing date when purchasing &#10; a replacement battery.&lt;/p&gt; &lt;p&gt;The Li-ion is most economical for those &#10; who use a mobile phone daily. Up to 1000&amp;nbsp;charge/discharge &#10; cycles can be expected if used within the expected service &#10; life of about two to three years. Because of the aging effect, &#10; the Li-ion does not provide an economical solution for &#10; the occasional user. If the Li-ion is the only battery &#10; choice and the equipment is seldom used, the battery should &#10; be removed from the equipment and stored in a cool place, &#10; preferably only partially charged.&lt;/p&gt; &lt;p&gt;So far, little is known about the life expectancy &#10; of the Li-ion polymer. Because of the similarities with &#10; the Li-ion, the long-term performance of both systems &#10; is expected to be similar. Much effort is being made to prolong &#10; the service life of lithium-based systems. New chemical additives &#10; have been effective in retarding the aging process.&lt;/p&gt; &#10; &lt;/blockquote&gt;</description></item><item><title>08. Choosing the Right Battery 2</title><link>https://technick.net/guides/electronics/bpw/c08_02/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c08_02/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c08_01"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c08_03"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;8.2 What’s the best battery for two-way radios?&lt;/h4&gt;&lt;p&gt;&lt;a name="_Toc507909191"&gt;&lt;/a&gt; &lt;/p&gt;&lt;p&gt;The two-way radio market uses mostly NiCd batteries. &#10; In the last few years, environmental agencies have been attempting &#10; to discourage the use of NiCd, especially in Europe. NiMH &#10; have been tried and tested in two-way radios for a number &#10; of years but the results are mixed. Shorter cycle life compared &#10; to NiCd is the major drawback.&lt;/p&gt; &lt;p&gt;The reasons for the relatively short life of &#10; NiMH are multi-fold. NiMH is less robust than NiCd and has &#10; a cycle life expectancy that is half or one third that of &#10; the standard NiCd. In addition, NiMH prefers a moderate discharge &#10; current of 0.5C or less. A two-way radio, on the other hand, &#10; draws a discharge current of about 1.5A when transmitting &#10; at 4W of power. High discharge loads shorten the life of the &#10; NiMH battery considerably.&lt;/p&gt; &lt;p&gt;NiCd has the advantage of maintaining a low and &#10; steady internal resistance throughout most of its service &#10; life. Although low when new, NiMH increases the resistance &#10; with advanced cycle count. A battery with high internal resistance &#10; causes the voltage to drop when a load is applied. Even though &#10; energy may still be present, the battery cannot deliver the &#10; high current flow required during transmit mode. This results &#10; in a drop in voltage, which triggers the ‘low battery’ condition &#10; and the radio cuts off. This happens mostly during transmission.&lt;/p&gt; &lt;p&gt;The Li-ion has been tested for use with &#10; two-way radios but has not been able to provide the ultimate &#10; answer. Higher replacement costs, restrictions posed by the &#10; safety circuit and aging pose limitations on this battery &#10; system.&lt;/p&gt;&lt;a name="_Toc507909192"&gt;&lt;/a&gt;&lt;h4&gt;8.3 What’s the best battery for laptops?&lt;/h4&gt; &lt;p&gt;Batteries for laptops have a unique challenge &#10; because they must be small and lightweight. &lt;img width="242" height="107" src="https://technick.net/img/guide_bpw2/c08_03.gif" align="left" hspace="19" vspace="19" alt="Text Box: For better or worse, we have learned to accept the short runtime of a laptop." v:shapes="_x0000_s1028" border="0" /&gt;In fact, the laptop battery should be invisible to the &#10; user and deliver enough power to last for a five-hour flight &#10; from Toronto to Vancouver. In reality, a typical laptop battery &#10; provides only about 90&amp;nbsp;minutes of service.&lt;/p&gt; &lt;p&gt;&amp;nbsp;Computer manufacturers are hesitant to add a &#10; larger battery because of increased size and weight. A recent &#10; survey indicated that, given the option of larger size and &#10; more weight to obtain longer runtimes, most users would settle &#10; for what is being offered today. For better or worse, we have &#10; learned to accept the short runtime of a laptop.&lt;/p&gt; &lt;p&gt;During the last few years, batteries have improved &#10; in terms of energy density. Any benefit in better battery &#10; performance, however, is being eaten up by the higher power &#10; requirements of the laptops. It is predicted that the even &#10; more power-hungry PC’s of the future will counteract any improvements &#10; in battery technology, as marginal as they might be. The net &#10; effect will result in the same runtimes but faster and more &#10; powerful computers.&lt;/p&gt; &lt;p&gt;The length of time the battery can be used will &#10; get shorter as the battery ages. A battery residing in a laptop &#10; ages more quickly than when used in other applications. After &#10; a warm-up, the official operating temperature inside a laptop &#10; computer is 45&amp;deg;C (113&amp;deg;F). Such a high ambient temperature &#10; drastically lowers the battery’s life expectation. At a temperature &#10; of 45&amp;deg;C, for example, the life expectancy of a NiMH battery &#10; is less than 50&amp;nbsp;percent as compared to running it at &#10; the ideal operating temperature of 20&amp;deg;C (68&amp;deg;F).&lt;/p&gt; &lt;p&gt;The Li-ion does not fare much better. At &#10; this high ambient temperature, the wear-down effect of the &#10; battery is primarily governed by temperature as opposed to &#10; cycle count. The situation is worsened by the fact that the &#10; battery resides in a high SoC most of the time. The combination &#10; of heat and high SoC promotes cell oxidation, a condition &#10; that cannot be reversed once afflicted.&lt;/p&gt; &lt;p&gt;A fully charged Li-ion battery that is &#10; stored at 45&amp;deg;C suffers a capacity loss from 100&amp;nbsp;percent &#10; to about 70&amp;nbsp;percent in as little as six months. If this &#10; condition persists, the capacity degrades further to 50&amp;nbsp;percent &#10; in twelve months. In reality, the battery in a laptop is exposed &#10; to elevated temperatures just during use and the battery is &#10; in a full charge state only part of the time. But leaving &#10; the laptop in a parked car under the hot sun will aggravate &#10; the situation.&lt;/p&gt; &lt;p&gt;Some Japanese computer manufacturers have introduced &#10; a number of sub-notebooks in which the battery is mounted &#10; externally, forming part of the hinge. This design improves &#10; battery life because the battery is kept at room temperature. &#10; Some models carry several size batteries to accommodate different &#10; user patterns.&lt;/p&gt; &lt;p&gt;What then is the best battery for a laptop? The &#10; choices are limited. The NiCd has virtually disappeared from &#10; the mobile computer scene and the NiMH is loosing steam, paving &#10; the way for the Li-ion. Eventually, very slim geometry &#10; will also demand thin batteries, and this is possible with &#10; the prismatic Li-ion polymer.&lt;/p&gt; &lt;p&gt;Besides providing reliable performance for general &#10; portable use, the Li-ion battery also offers superior &#10; service for laptop users who must continually switch from &#10; fixed power to battery use, as is the case for many sales &#10; people. Many biomedical and industrial applications follow &#10; this pattern also. Here is the reason why such use can be &#10; hard on some batteries:&lt;/p&gt; &lt;p&gt;On a nickel-based charging system, unless smart, &#10; the charger applies a full charge each time the portable device &#10; is connected to fixed power. In many cases, the battery is &#10; already fully charged and the cells go almost immediately &#10; into overcharge. The battery heats up, only to be detected &#10; by a sluggish thermal charge control, which finally terminates &#10; the fast charge. Permanent capacity loss caused by overcharge &#10; and elevated temperature is the result.&lt;/p&gt; &lt;p&gt;Among the nickel-based batteries, NiMH is least &#10; capable of tolerating a recharge on top of a charge. Adding &#10; elevated ambient temperatures to the charging irregularities, &#10; a NiMH battery can be made inoperable in as little as six &#10; months. In severe cases, the NiMH is known to last only 2 &#10; to 3&amp;nbsp;months.&lt;/p&gt; &lt;p&gt;For mixed battery and utility power use, the &#10; Li-ion system is a better choice. If a fully charged &#10; Li-ion is placed on charge, no charge current is applied. &#10; The battery only receives a recharge once the terminal voltage &#10; has dropped to a set threshold. Neither is there a concern &#10; if the device is connected to fixed power for long periods &#10; of time. No overcharge can occur and there is no memory to &#10; worry about.&lt;/p&gt; &lt;p&gt;NiMH is the preferred choice for a user who runs &#10; the laptop mostly on fixed power and removes the battery when &#10; not needed. This way, the battery is only engaged if the device &#10; is used in portable mode. The NiMH battery can thus be kept &#10; fresh while sitting on the shelf. NiMH ages well if kept cool &#10; and only partially charged.&lt;/p&gt; &#10; &lt;/blockquote&gt;</description></item><item><title>08. Choosing the Right Battery 3</title><link>https://technick.net/guides/electronics/bpw/c08_03/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c08_03/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c08_02"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c08_04"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;8.4 Selecting a Lasting Battery&lt;/h4&gt;&lt;p&gt;&lt;a name="_Toc507909193"&gt;&lt;/a&gt; &lt;/p&gt;&lt;p&gt;As part of an ongoing research program to find &#10; the optimum battery system for selected applications, Cadex &#10; has performed life cycle tests on NiCd, NiMH and Li-ion &#10; batteries. All tests were carried out on the Cadex &lt;i&gt;7000 &#10; Series &lt;/i&gt;battery analyzers in the test labs of Cadex, Vancouver, &#10; Canada. The batteries tested received an initial full-charge, &#10; and then underwent a regime of continued discharge/charge &#10; cycles. The internal resistance was measured with Cadex’s &#10; &lt;i&gt;Ohmtest&lt;/i&gt;™ method, and the self-discharge was obtained &#10; from time-to-time by reading the capacity loss incurred during &#10; a 48-hour rest period. The test program involved 53&amp;nbsp;commercial &#10; telecommunications batteries of different models and chemistries. &#10; One battery of each chemistry displaying typical behavior &#10; was chosen for the charts below.&lt;/p&gt; &lt;p&gt;When conducting battery tests in a laboratory, &#10; it should be noted that the performance in a protected environment &#10; is commonly superior to those in field use. Elements of stress &#10; and inconsistency that are present in everyday use cannot &#10; always be simulated accurately in the&amp;nbsp;lab.&lt;/p&gt; &lt;p&gt;&lt;b&gt;The NiCd Battery&lt;/b&gt; — In terms of life cycling, &#10; the standard NiCd is the most enduring battery. In Figure&amp;nbsp;8-1 &#10; we examine the capacity, internal resistance and self-discharge &#10; of a 7.2V, 900mA NiCd battery with standard cells. Due to &#10; time constraints, the test was terminated after 2300&amp;nbsp;cycles. &#10; During this period, the capacity remains steady, the internal &#10; resistance stays flat at 75mW and the self-discharge is stable. &#10; This battery receives a grade ‘A’ for almost perfect performance.&lt;/p&gt; &lt;p&gt;The readings on an ultra-high capacity NiCd are &#10; less favorable but still better than other chemistries in &#10; terms of endurance. Although up to 60&amp;nbsp;percent higher &#10; in energy density compared to the standard NiCd version, Figure&amp;nbsp;8-2 &#10; shows the ultra-high NiCd gradually losing capacity during &#10; the 2000&amp;nbsp;cycles delivered. At the same time, the internal &#10; resistance rises slightly. A more serious degradation is the &#10; increase of self-discharge after 1000&amp;nbsp;cycles. This deficiency &#10; manifests itself in shorter runtimes because the battery consumes &#10; some energy itself, even if not in&amp;nbsp;use.&lt;/p&gt; &lt;p&gt;&lt;img width="407" height="289" src="https://technick.net/img/guide_bpw2/c08_04.gif" v:shapes="_x0000_i1027" border="0" alt="" /&gt;&lt;/p&gt; &lt;p&gt;&lt;a name="_Ref501879137"&gt;&lt;/a&gt;&lt;a name="_Ref501879647"&gt;&lt;/a&gt;&lt;a name="_Toc502116712"&gt;&lt;/a&gt;&lt;a name="_Toc507815269" class="caption"&gt;Figure&amp;nbsp;8-1: &#10; Characteristics of a standard cell NiCd battery.&lt;/a&gt;&lt;br /&gt; &lt;span class="caption-sub"&gt;This battery deserves an ‘A’ for &#10; almost perfect performance in terms of stable capacity, internal &#10; resistance and self-discharge over many cycles. This illustration &#10; shows results for a 7.2V, 900mA&amp;nbsp;NiCd.&lt;/span&gt;&lt;/p&gt; &lt;p&gt;&lt;img width="407" height="288" src="https://technick.net/img/guide_bpw2/c08_05.gif" v:shapes="_x0000_i1028" border="0" alt="" /&gt;&lt;/p&gt; &lt;p&gt;&lt;a name="_Ref501879160"&gt;&lt;/a&gt;&lt;a name="_Ref501879599"&gt;&lt;/a&gt;&lt;a name="_Toc502116713"&gt;&lt;/a&gt;&lt;a name="_Toc507815270" class="caption"&gt;Figure&amp;nbsp;8-2:&amp;nbsp;Characteristics &#10; of a NiCd battery with ultra-high capacity cells.&lt;/a&gt;&lt;br /&gt; &lt;span class="caption-sub"&gt;This battery is not as favorable &#10; as the standard NiCd but offers higher energy densities and &#10; performs better than other chemistries in terms of endurance. &#10; This illustrations shows results for a 6V, 700mA&amp;nbsp;NiCd.&lt;/span&gt;&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>08. Choosing the Right Battery 4</title><link>https://technick.net/guides/electronics/bpw/c08_04/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c08_04/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c08_03"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c09_01"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;&lt;b&gt;The NiMH Battery&lt;/b&gt; — Figure&amp;nbsp;8-3 &#10; examines the NiMH, a battery that offers high energy density &#10; at reasonably low cost. We observe good performance at first &#10; but past the 300-cycle mark, the performance starts to drift &#10; downwards rapidly. One can detect a swift increase in internal &#10; resistance and self-discharge after cycle count 700.&lt;/p&gt; &lt;p&gt;&lt;img width="431" height="300" src="https://technick.net/img/guide_bpw2/c08_06.gif" v:shapes="_x0000_i1025" border="0" alt="" /&gt;&lt;/p&gt; &lt;p&gt;&lt;a name="_Ref501879347"&gt;&lt;/a&gt;&lt;a name="_Ref501879712"&gt;&lt;/a&gt;&lt;a name="_Toc502116714"&gt;&lt;/a&gt;&lt;a name="_Ref505515136"&gt;&lt;/a&gt;&lt;a name="_Toc507815271" class="caption"&gt;Figure&amp;nbsp;8-3:&amp;nbsp;&amp;nbsp;&amp;nbsp; &#10; Characteristics of a NiMH battery.&lt;/a&gt;&lt;br /&gt; &lt;span class="caption-sub"&gt;This battery offers good performance &#10; at first but past the 300-cycle mark, the capacity, internal &#10; resistance and self-discharge start to deteriorate rapidly. &#10; This illustrations shows results for a 6V, 950mA&amp;nbsp;NiMH.&lt;/span&gt;&lt;/p&gt; &lt;p&gt;&lt;b&gt;The Li-ion Battery&lt;/b&gt; — The Li-ion &#10; battery offers advantages that neither the NiCd nor NiMH can &#10; match. In Figure&amp;nbsp;8-4 we examine the capacity and &#10; internal resistance of a typical Li-ion. A gentle capacity &#10; drop is observed over 1000&amp;nbsp;cycles and the internal resistance &#10; increases only slightly. Because of low readings, self-discharge &#10; was omitted for this&amp;nbsp;test.&lt;/p&gt; &lt;p&gt;The better than expected performance of this &#10; test battery may be due to the fact that the test did not &#10; include aging. The lab test was completed in about 200&amp;nbsp;days. &#10; A busy user may charge the battery once every 24&amp;nbsp;hours. &#10; With such a user pattern, 500&amp;nbsp;cycles would represent &#10; close to two years of normal&amp;nbsp;use and the effects of aging &#10; would become apparent.&lt;/p&gt; &lt;p&gt;Manufacturers of commercial Li-ion batteries &#10; specify a cycle count of 500. At that stage, the battery capacity &#10; would drop from 100 to 80&amp;nbsp;percent. If operated at 40&amp;deg;C &#10; (104&amp;deg;F) rather than at room temperature, the same battery &#10; would only deliver about 300&amp;nbsp;cycles.&lt;/p&gt; &lt;p&gt;&lt;img width="431" height="308" src="https://technick.net/img/guide_bpw2/c08_07.gif" v:shapes="_x0000_i1026" border="0" alt="" /&gt;&lt;/p&gt; &lt;p&gt;&lt;a name="_Ref501880037"&gt;&lt;/a&gt;&lt;a name="_Toc502116715"&gt;&lt;/a&gt;&lt;a name="_Ref505515197"&gt;&lt;/a&gt;&lt;a name="_Toc507815272" class="caption"&gt;Figure&amp;nbsp;8-4: &#10; Characteristics of a Li-ion battery.&lt;/a&gt;&lt;br /&gt; &lt;span class="caption-sub"&gt;The above-average performance of &#10; this battery may be due to the fact that the test did not &#10; include aging. This illustration shows results for a 3.6V, &#10; 500mA Li-ion battery.&lt;b&gt;&lt;i&gt; &lt;/i&gt;&lt;/b&gt;&lt;/span&gt;&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>08. Implementation</title><link>https://technick.net/guides/theory/dar/008/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dar/008/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/resample/"&gt;The Digital Audio Resampling Home Page&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, Copyright &amp;#169; &lt;i&gt;2016-05-17&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dar/007"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dar/000"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dar/009"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;Implementation&lt;/h3&gt;&lt;p&gt;Our implementation provides signal evaluation at an arbitrary time,&#10;where time is specified as an unsigned binary fixed-point number in&#10;units of the input &lt;a href="https://ccrma.stanford.edu/~jos//st/Shannon_s_Sampling_Theorem.html" target="_blank"&gt;sampling period&lt;/a&gt; (assumed constant).&#10;Figure&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dar/008#fig:TimeRegisterFormat"&gt;6&lt;/a&gt; shows the time register &lt;img width="12" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img11.gif" alt="$t$" /&gt;, and&#10;Figure&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dar/008#fig:Waveforms"&gt;7&lt;/a&gt; shows an example configuration of the input&#10;signal and lowpass &lt;a href="https://technick.net/guides/theory/edft/010"&gt;filter&lt;/a&gt; at a given time. The time register is&#10;divided into three fields: The leftmost field gives the number &lt;img width="16" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img12.gif" alt="$n$" /&gt; of&#10;samples into the input signal buffer, the middle field is an initial&#10;index &lt;img width="11" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img44.gif" alt="$l$" /&gt; into the filter coefficient table &lt;img width="36" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img45.gif" alt="$h(l)$" /&gt;, and the rightmost&#10;field is interpreted as a number &lt;img width="15" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img46.gif" alt="$\" ta="" /&gt; between &lt;img width="14" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img47.gif" alt="$0$" /&gt; and &lt;img width="14" height="16" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img29.gif" alt="$1$" /&gt; for doing&lt;a href="https://ccrma.stanford.edu/~jos//Interpolation/Linear_Interpolation.html" target="_blank"&gt;linear interpolation&lt;/a&gt; between samples &lt;img width="11" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img44.gif" alt="$l$" /&gt; and &lt;img width="43" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img48.gif" alt="$l+1$" /&gt; (initially) of the&#10;filter table. The concatenation of &lt;img width="11" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img44.gif" alt="$l$" /&gt; and &lt;img width="15" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img46.gif" alt="$\" ta="" /&gt; are called&lt;img width="82" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img49.gif" alt="$P\" n="" /&gt; which is interpreted as the position of the current time&#10;between samples &lt;img width="16" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img12.gif" alt="$n$" /&gt; and &lt;img width="48" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img50.gif" alt="$n+1$" /&gt; of the input signal.&lt;/p&gt;</description></item><item><title>08. Introduction to Digital Filter Theory</title><link>https://technick.net/guides/theory/edft/008/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/edft/008/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/filters/"&gt;Introduction to Digital Filters with Audio Applications&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, Copyright &amp;#169; &lt;i&gt;2017-11-26&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/edft/007"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/000"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/022"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/009"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;Introduction to Digital Filter Theory&lt;/h3&gt;&lt;p&gt;In this section, &lt;i&gt;linearity&lt;/i&gt;, &lt;i&gt;time-invariance&lt;/i&gt; and four&#10;basic representations of &lt;a href="http://www.dsptutor.freeuk.com/dfilt1.html" target="_blank"&gt;digital filters&lt;/a&gt; are defined: the&lt;i&gt;&lt;a href="https://technick.net/guides/theory/edft/010"&gt;difference equation&lt;/a&gt; coefficients, &lt;a href="https://technick.net/guides/theory/edft/010#2321"&gt;impulse&lt;/a&gt; response, transfer&#10;function,&lt;/i&gt; and &lt;i&gt;&lt;a href="https://technick.net/guides/theory/edft/012"&gt;frequency response&lt;/a&gt;&lt;/i&gt;. Next the concepts of&lt;i&gt;&lt;a href="https://technick.net/guides/theory/edft/013"&gt;phase delay&lt;/a&gt;&lt;/i&gt;, &lt;i&gt;&lt;a href="https://technick.net/guides/theory/edft/013"&gt;group delay&lt;/a&gt;&lt;/i&gt;, &lt;i&gt;poles&lt;/i&gt; and &lt;i&gt;zeros&lt;/i&gt;,&#10;and &lt;a href="https://technick.net/guides/theory/edft/010"&gt;filter&lt;/a&gt; &lt;i&gt;stability&lt;/i&gt; are defined. This elementary material was&#10;taken from course notes for a class given at Stanford by the author in&#10;1979.&lt;/p&gt;</description></item><item><title>09. Internal Battery Resistance</title><link>https://technick.net/guides/electronics/bpw/c09_01/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c09_01/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c08_04"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c09_02"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;9. Internal Battery Resistance&lt;/h3&gt;&lt;p&gt; &lt;a name="_Ref502119400"&gt;&lt;/a&gt;&lt;a name="_Ref502119434"&gt;&lt;/a&gt;&lt;a name="_Toc507909194"&gt;&lt;/a&gt; &lt;/p&gt;&lt;p&gt;With the move from analog to digital devices, new demands &#10; are being placed on the battery. Unlike analog equipment that &#10; draws a steady current, the digital mobile phone, for example, &#10; loads the battery with short, high current bursts. &lt;/p&gt; &lt;p&gt;&lt;img width="238" height="123" src="https://technick.net/img/guide_bpw2/c09_01.gif" align="left" hspace="19" vspace="19alt=" text="" x:="" e="" ternal="" sistance="" s="" e="" tekeeper="" at="" o="" arge="" tent="" etermines="" e="" ntime="" shapes="_x0000_s1026" border="0" alt="" /&gt;Increasingly, mobile communication devices are moving &#10; from voice only to multimedia which allows sending and receiving &#10; data, still pictures and even video. Such transmissions add &#10; to the bandwidth, which require several times the battery &#10; power compared to voice&amp;nbsp;only.&lt;/p&gt; &lt;p&gt;One of the urgent requirements of a battery for &#10; digital applications is low internal resistance. Measured &#10; in milliohms (mW), the internal resistance is the gatekeeper &#10; that, to a large extent, determines the runtime. The lower &#10; the resistance, the less restriction the battery encounters &#10; in delivering the needed power bursts. A high mW reading can &#10; trigger an early ‘low battery’ indication on a seemingly good &#10; battery because the available energy cannot be delivered in &#10; an appropriate manner.&lt;/p&gt; &lt;p&gt;Figure&amp;nbsp;9-1 examines the major global mobile &#10; phone systems and compares peak power and peak current requirements. &#10; The systems are the AMP, GSM, TDMA and CDMA.&lt;br /&gt; &lt;br /&gt; &lt;/p&gt; &lt;table border="0" cellspacing="0" cellpadding="3" width="100%"&gt; &lt;tr&gt; &#10; &lt;td colspan="5" valign="top"&gt; &#10; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="24%" valign="top" bgcolor="#E6E6E6"&gt;&amp;nbsp; &lt;/td&gt; &lt;td width="20%" valign="top" bgcolor="#E6E6E6"&gt; &lt;b class="table-bolder"&gt;AMP&lt;/b&gt;&lt;/td&gt; &lt;td width="13%" valign="top" bgcolor="#E6E6E6"&gt; &lt;b class="table-bolder"&gt;GSM&lt;/b&gt;&lt;/td&gt; &lt;td width="20%" valign="top" bgcolor="#E6E6E6"&gt; &lt;b&gt;&lt;span class="table-bolder"&gt;TDMA&lt;sup&gt;1&lt;/sup&gt;&lt;/span&gt;&lt;/b&gt;&lt;/td&gt; &lt;td width="20%" valign="top" bgcolor="#E6E6E6"&gt; &lt;b class="table-bolder"&gt;CDMA&lt;/b&gt;&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td colspan="5" valign="top"&gt; &#10; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="24%" valign="top"&gt; &lt;b class="table-bolder"&gt;Type&lt;/b&gt;&lt;/td&gt; &lt;td width="20%" valign="top"&gt; Analog&lt;/td&gt; &lt;td width="13%" valign="top"&gt; Digital&lt;/td&gt; &lt;td width="20%" valign="top"&gt; Digital&lt;/td&gt; &lt;td width="20%" valign="top"&gt; Digital&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="24%" valign="top" bgcolor="#F3F3F3"&gt; &lt;b class="table-bolder"&gt;Used &#10; in&lt;/b&gt;&lt;/td&gt; &lt;td width="20%" valign="top" bgcolor="#F3F3F3"&gt; USA, Canada&lt;/td&gt; &lt;td width="13%" valign="top" bgcolor="#F3F3F3"&gt; Globally&lt;/td&gt; &lt;td width="20%" valign="top" bgcolor="#F3F3F3"&gt; USA, Canada&lt;/td&gt; &lt;td width="20%" valign="top" bgcolor="#F3F3F3"&gt; USA, Canada&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="24%" valign="top"&gt; &lt;b class="table-bolder"&gt;Peak &#10; Power&lt;/b&gt;&lt;/td&gt; &lt;td width="20%" valign="top"&gt; 0.6W&lt;/td&gt; &lt;td width="13%" valign="top"&gt; 1-2W&lt;/td&gt; &lt;td width="20%" valign="top"&gt; 0.6-1W&lt;/td&gt; &lt;td width="20%" valign="top"&gt; 0.2W&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="24%" valign="top" bgcolor="#F3F3F3"&gt; &lt;b&gt;&lt;span class="table-bolder"&gt;Peak &#10; current&lt;sup&gt;2&lt;/sup&gt;&lt;/span&gt;&lt;/b&gt;&lt;/td&gt; &lt;td width="20%" valign="top" bgcolor="#F3F3F3"&gt; 0.3A DC&lt;/td&gt; &lt;td width="13%" valign="top" bgcolor="#F3F3F3"&gt; 1-2.5A&lt;/td&gt; &lt;td width="20%" valign="top" bgcolor="#F3F3F3"&gt; 0.8-1.5A&lt;/td&gt; &lt;td width="20%" valign="top" bgcolor="#F3F3F3"&gt; 0.7A&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="24%" valign="top"&gt; &lt;b class="table-bolder"&gt;In &#10; service since&lt;/b&gt;&lt;/td&gt; &lt;td width="20%" valign="top"&gt; 1985&lt;/td&gt; &lt;td width="13%" valign="top"&gt; 1986&lt;/td&gt; &lt;td width="20%" valign="top"&gt; 1992&lt;/td&gt; &lt;td width="20%" valign="top"&gt; 1995&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td colspan="5" valign="top"&gt; &#10; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;p&gt;&lt;a name="_Ref501947346"&gt;&lt;/a&gt;&lt;a name="_Toc502116716"&gt;&lt;/a&gt;&lt;a name="_Toc507815273" class="caption"&gt;Figure&amp;nbsp;9-1:&amp;nbsp;Peak power requirements &#10; of popular global mobile phone systems.&lt;/a&gt;&lt;br /&gt; &lt;span class="caption-sub"&gt;Moving from voice to multi-media &#10; requires several times the battery power.&lt;/span&gt;&lt;/p&gt; &lt;ol&gt; &lt;li&gt;Some TDMA handsets feature dual mode &#10; (analog 800mA DC load; digital 1500mA pulsed load).&lt;/li&gt; &lt;li&gt;Current varies with battery voltage; &#10; a 3.6V battery requires higher current than a 7.2V battery.&lt;/li&gt; &lt;/ol&gt; &lt;a name="_Toc507909195"&gt;&lt;/a&gt;&lt;h4&gt;9.1 Why do seemingly good batteries fail on digital equipment?&lt;/h4&gt; &lt;p&gt;Service technicians have been puzzled by the &#10; seemingly unpredictable battery behavior when powering digital &#10; equipment. With the switch from analog to digital wireless &#10; communications devices, particularly mobile phones, a battery &#10; that performs well on an analog device may show irrational &#10; behavior when used on a digital device. Testing these batteries &#10; with a battery analyzer produces normal capacity readings. &#10; Why then do some batteries fail prematurely on digital devices &#10; but not on analog? &lt;/p&gt; &lt;p&gt;The overall energy requirement of a digital mobile &#10; phone is less than that of the analog equivalent, however, &#10; the battery must be capable of delivering high current pulses &#10; that are often several times that of the battery’s rating. &#10; Let’s look at the battery rating as expressed in C-rates.&lt;/p&gt; &lt;p&gt;A 1C discharge of a battery rated at 500mAh is &#10; 500mA. In comparison, a 2C discharge of the same battery is &#10; 1000mA. A GSM phone powered by a 500mA battery that draws &#10; 1.5A pulses loads the battery with a whopping 3C discharge.&lt;/p&gt; &lt;p&gt;A 3C rate discharge is fine for a battery with &#10; very low internal resistance. However, aging batteries, especially &#10; Li-ion and NiMH chemistries, pose a challenge because the &#10; mW readings of these batteries increase with use.&lt;/p&gt; &lt;p&gt;Improved performance can be achieved by using &#10; a larger battery, also known as an extended pack. Somewhat &#10; bulkier and heavier, an extended pack offers a typical rating &#10; of about 1000mAh or roughly double that of the slim-line. &#10; In terms of C-rate, the 3C discharge is reduced to 1.5C when &#10; using a 1000mAh instead of a 500mAh battery.&lt;/p&gt; &lt;p&gt;As part of ongoing research to find the best &#10; battery system for wireless devices, Cadex has performed life &#10; cycle tests on various battery systems. In Figure&amp;nbsp;9-2, &#10; Figure&amp;nbsp;9-3, and Figure&amp;nbsp;9-4, we examine NiCd, NiMH &#10; and Li-ion batteries, each of which generates a good capacity &#10; reading when tested with a battery analyzer but produce stunning &#10; differences on a pulsed discharge of 1C, 2C and 3C. These &#10; pulses simulate a GSM phone.&lt;/p&gt; &lt;p&gt;&lt;img width="431" height="263" src="https://technick.net/img/guide_bpw2/c09_02.jpg" v:shapes="_x0000_i1025" border="0" alt="" /&gt;&lt;/p&gt; &lt;p&gt;&lt;a name="_Ref501947556"&gt;&lt;/a&gt;&lt;a name="_Toc502116717"&gt;&lt;/a&gt;&lt;a name="_Toc507815274" class="caption"&gt;Figure&amp;nbsp;9-2:&amp;nbsp;Talk-time of a NiCd battery &#10; under the GSM load schedule.&lt;/a&gt;&lt;br /&gt; &lt;span class="caption-sub"&gt;This battery has 113% capacity and &#10; 155m&amp;copy; internal resistance.&lt;/span&gt;&lt;/p&gt; &lt;p&gt;A closer look reveals vast discrepancies in the &#10; m&amp;copy; measurements of the test batteries. In fact, these &#10; readings are typical of batteries that have been in use for &#10; a while. The NiCd shows 155mW, the NiMH 778mW and the Li-ion &#10; 320mW, although the capacities checked in at 113, 107 and &#10; 94&amp;nbsp;percent respectively when tested with the DC load &#10; of a battery analyzer. It should be noted that the internal &#10; resistance was low when the batteries were&amp;nbsp;new.&lt;/p&gt; &lt;p&gt;&lt;img width="432" height="265" src="https://technick.net/img/guide_bpw2/c09_03.jpg" v:shapes="_x0000_i1027" border="0" alt="" /&gt;&lt;/p&gt; &lt;p&gt;&lt;a name="_Ref501947591"&gt;&lt;/a&gt;&lt;a name="_Toc502116718"&gt;&lt;/a&gt;&lt;a name="_Ref504213581"&gt;&lt;/a&gt;&lt;a name="_Toc507815275" class="caption"&gt;Figure&amp;nbsp;9-3:&amp;nbsp;Talk-time &#10; of a NiMH battery under the GSM load schedule.&lt;/a&gt;&lt;br /&gt; &lt;span class="caption-sub"&gt;This battery has 107% capacity and &#10; 778m&amp;copy; internal resistance.&lt;/span&gt;&lt;/p&gt; &lt;p&gt;&lt;img width="432" height="262" src="https://technick.net/img/guide_bpw2/c09_04.jpg" v:shapes="_x0000_i1026" border="0" alt="" /&gt;&lt;/p&gt; &lt;p&gt;&lt;a name="_Ref501947602"&gt;&lt;/a&gt;&lt;a name="_Toc502116719"&gt;&lt;/a&gt;&lt;a name="_Ref504213584"&gt;&lt;/a&gt;&lt;a name="_Toc507815276" class="caption"&gt;Figure&amp;nbsp;9-4: &#10; Talk-time of a Li-ion battery under the GSM load schedule.&lt;/a&gt;&lt;br /&gt; &lt;span class="caption-sub"&gt;This battery has 94% capacity and &#10; 320m&amp;copy; internal resistance.&lt;/span&gt;&lt;/p&gt; &lt;p&gt;From these charts we can see that the talk-time &#10; is in direct relationship with the battery’s internal resistance. &#10; The NiCd performs best and produces a talk time of 140&amp;nbsp;minutes &#10; at 1C and a long 120&amp;nbsp;minutes at 3C. In comparison, the &#10; NiMH is good for 140&amp;nbsp;minutes at 1C but fails at 3C. The &#10; Li-ion provides 105&amp;nbsp;minutes at 1C and 50&amp;nbsp;minutes &#10; at 3C discharge.&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>09. Internal Battery Resistance 2</title><link>https://technick.net/guides/electronics/bpw/c09_02/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c09_02/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c09_01"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c09_03"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;9.2 How is the internal battery resistance measured?&lt;/h4&gt;&lt;p&gt;&lt;a name="_Toc507909196"&gt;&lt;/a&gt; &lt;/p&gt;&lt;p&gt;A number of techniques are used to measure internal &#10; battery resistance. One common method is the DC load test, &#10; which applies a discharge current to the battery while measuring &#10; the voltage drop. Voltage over current provides the internal &#10; resistance (see&amp;nbsp;Figure&amp;nbsp;9-5).&lt;/p&gt; &lt;p&gt;&lt;img width="463" height="270" src="https://technick.net/img/guide_bpw2/c09_05.gif" v:shapes="_x0000_i1029" border="0" alt="" /&gt;&lt;/p&gt; &lt;p&gt;&lt;a name="_Toc502116720"&gt;&lt;/a&gt;&lt;a name="_Ref503164017"&gt;&lt;/a&gt;&lt;a name="_Toc507815277" class="caption"&gt;Figure&amp;nbsp;9-5: DC load test.&lt;/a&gt;&lt;br /&gt; &lt;span class="caption-sub"&gt;The DC load test measures the battery’s &#10; internal resistance by reading the voltage drop. A large drop &#10; indicates high resistance.&lt;/span&gt;&lt;/p&gt; &lt;p&gt;The AC method, also known as the conductivity &#10; test, measures the electrochemical characteristics of a battery. &#10; This technique applies an alternating current to the battery &#10; terminals. Depending on manufacturer and battery type, the &#10; frequency ranges from 10 to 1000Hz. The impedance level affects &#10; the phase shift between voltage and current, which reveals &#10; the condition of the battery. The AC method works best on &#10; single cells. Figure&amp;nbsp;9-6 demonstrates a typical &#10; phase shift between voltage and current when testing a battery.&lt;/p&gt; &lt;p&gt;&lt;img width="463" height="285" src="https://technick.net/img/guide_bpw2/c09_06.gif" v:shapes="_x0000_i1030" border="0" alt="" /&gt;&lt;/p&gt; &lt;p&gt;&lt;a name="_Toc502116721"&gt;&lt;/a&gt;&lt;a name="_Ref503164072"&gt;&lt;/a&gt;&lt;a name="_Ref505515570"&gt;&lt;/a&gt;&lt;a name="_Toc507815278" class="caption"&gt;Figure&amp;nbsp;9-6:&amp;nbsp;AC &#10; load test.&lt;/a&gt;&lt;br /&gt; &lt;span class="caption-sub"&gt;The AC method measures the phase &#10; shift between voltage and current. The battery’s reactance &#10; is used to calculate the impedance.&lt;/span&gt;&lt;/p&gt; &lt;p&gt;Some AC resistance meters evaluate only the load &#10; factor and disregard the phase shift information. This technique &#10; is similar to the DC method. The AC voltage that is superimposed &#10; on the battery’s DC voltage acts as brief charge and discharge &#10; pulses. The amplitude of the ripple is utilized to calculate &#10; the internal battery resistance.&lt;/p&gt; &lt;p&gt;Cadex uses the discreet DC method to measure &#10; internal battery resistance. Added to the Cadex &lt;i&gt;7000 Series&lt;/i&gt; &#10; battery analyzers, a number of charge and discharge pulses &#10; are applied, which are scaled to the mAh rating of the battery &#10; tested. Based on the voltage deflections, the battery’s internal &#10; resistance is calculated. Known as &lt;i&gt;Ohmtest&lt;/i&gt;™, the mW &#10; reading is obtained in five seconds. Figure&amp;nbsp;9-7 &#10; shows the technique&amp;nbsp;used.&lt;/p&gt; &lt;p&gt;&lt;img width="463" height="319" src="https://technick.net/img/guide_bpw2/c09_07.gif" v:shapes="_x0000_i1031" border="0" alt="" /&gt;&lt;/p&gt; &lt;p&gt;&lt;a name="_Toc502116722"&gt;&lt;/a&gt;&lt;a name="_Ref503164160"&gt;&lt;/a&gt;&lt;a name="_Ref505515607"&gt;&lt;/a&gt;&lt;a name="_Toc507815279"&gt;&lt;span class="caption"&gt;Figure&amp;nbsp;&lt;/span&gt;&lt;/a&gt;&lt;span class="caption"&gt;9-7:&amp;nbsp;Cadex &#10; &lt;i&gt;Ohmtest&lt;/i&gt;™.&lt;/span&gt;&lt;br /&gt; &lt;span class="caption-sub"&gt;Cadex’s pulse method measures the &#10; voltage deflections by applying charge and discharge pulses. &#10; Higher deflections indicate higher internal resistance.&lt;/span&gt;&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>09. Internal Battery Resistance 3</title><link>https://technick.net/guides/electronics/bpw/c09_03/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c09_03/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c09_02"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c10_01"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;Figure&amp;nbsp;9-8 compares the three methods of &#10; measuring the internal resistance of a battery and observe &#10; the accuracy. In a good battery, the discrepancies between &#10; methods are minimal. The test results deviate to a larger &#10; degree on packs with poor SoH.&lt;/p&gt; &lt;p&gt;Impedance measurement alone does not provide &#10; a definite conclusion as to the battery performance. The mW &#10; readings may vary widely and are dependent on battery chemistry, &#10; cell size (mAh rating), type of cell, number of cells connected &#10; in series, wiring and contact&amp;nbsp;type.&lt;/p&gt; &lt;p&gt;&lt;img width="455" height="309" src="https://technick.net/img/guide_bpw2/c09_08.gif" v:shapes="_x0000_i1032" border="0" alt="" /&gt;&lt;/p&gt; &lt;p&gt;&lt;a name="_Ref501881081"&gt;&lt;/a&gt;&lt;a name="_Toc502116723"&gt;&lt;/a&gt;&lt;a name="_Toc507815280"&gt;&lt;span class="caption"&gt;Figure&amp;nbsp;9-8: Comparison of the &#10; AC, DC and Cadex &lt;/span&gt;&lt;/a&gt;&lt;span class="caption"&gt;&lt;i&gt;Ohmtest&lt;/i&gt;™ &#10; methods.&lt;br /&gt; &lt;/span&gt;&lt;span class="caption-sub"&gt;State-of-health readings &#10; were obtained using the Cadex &lt;i&gt;7000&lt;/i&gt; &lt;i&gt;Series&lt;/i&gt; battery &#10; analyzer by applying a full charge/discharge/charge cycle. &#10; The DC method on the 68% SoH battery exceeded 1000mW.&lt;/span&gt;&lt;/p&gt; &lt;p&gt;When using the impedance method, a battery with &#10; a known performance should be measured and its readings used &#10; as a reference. For best results, a reference reading should &#10; be on hand for each battery type. Figure&amp;nbsp;9-9kl; provides &#10; a guideline for digital mobile phone batteries based on impedance &#10; readings. &lt;/p&gt; &lt;p&gt;The milliohm readings are related to the battery &#10; voltage. Higher voltage batteries allow higher internal resistance &#10; because less current is required to deliver the same power. &#10; The ratio between voltage and milliohm is not totally linear. &#10; There are certain housekeeping components that are always &#10; present whether the battery has one or several cells. These &#10; are wiring, contacts and protection circuits. &lt;/p&gt; &lt;p&gt;Temperature also affects the internal resistance &#10; of a battery. The internal resistance of a naked Li-ion cell, &#10; for example, measures 50mW at 25&amp;deg;C (77&amp;deg;F). If the temperature &#10; increases, the internal resistance decreases. At 40&amp;deg;C (104&amp;deg;F), &#10; the internal resistance drops to about 43mW and at 60&amp;deg;C (140&amp;deg;F) &#10; to 40mW. While the battery performs better when exposed to &#10; heat, prolonged exposure to elevated temperatures is harmful. &#10; Most batteries deliver a momentary performance boost when &#10; heated.&lt;br /&gt; &lt;br /&gt; &lt;/p&gt; &lt;div align="center"&gt; &#10; &lt;table border="0" cellspacing="0" cellpadding="3" width="100%"&gt; &lt;tr&gt; &#10; &lt;td colspan="3" valign="top"&gt; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="31%" valign="top" bgcolor="#E6E6E6"&gt; &lt;b class="table-bolder"&gt;Milli-Ohm&lt;/b&gt;&lt;/td&gt; &lt;td width="34%" valign="top" bgcolor="#E6E6E6"&gt; &lt;b class="table-bolder"&gt;Battery &#10; Voltage&lt;/b&gt;&lt;/td&gt; &lt;td width="33%" valign="top" bgcolor="#E6E6E6"&gt; &lt;b class="table-bolder"&gt;Ranking&lt;/b&gt;&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td colspan="3" valign="top"&gt; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="31%" valign="top" class="table-bolder"&gt; 75-150mOhm&lt;/td&gt; &lt;td width="34%" valign="top"&gt; 3.6V&lt;/td&gt; &lt;td width="33%" valign="top"&gt; Excellent&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="31%" valign="top" bgcolor="#F3F3F3" class="table-bolder"&gt; &#10; 150-250mOhm&lt;/td&gt; &lt;td width="34%" valign="top" bgcolor="#F3F3F3"&gt; 3.6V&lt;/td&gt; &lt;td width="33%" valign="top" bgcolor="#F3F3F3"&gt; Good&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="31%" valign="top" class="table-bolder"&gt; 250-350mOhm&lt;/td&gt; &lt;td width="34%" valign="top"&gt; 3.6V&lt;/td&gt; &lt;td width="33%" valign="top"&gt; Marginal&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="31%" valign="top" bgcolor="#F3F3F3" class="table-bolder"&gt; &#10; 350-500mOhm&lt;/td&gt; &lt;td width="34%" valign="top" bgcolor="#F3F3F3"&gt; 3.6V&lt;/td&gt; &lt;td width="33%" valign="top" bgcolor="#F3F3F3"&gt; Poor&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="31%" valign="top" class="table-bolder"&gt; Above &#10; 500mOhm&lt;/td&gt; &lt;td width="34%" valign="top"&gt; 3.6V&lt;/td&gt; &lt;td width="33%" valign="top"&gt; Fail&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td colspan="3" valign="top" class="table-bolder"&gt; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;p align="left" class="caption"&gt;Figure&amp;nbsp;9-9:&amp;nbsp;&amp;nbsp;&amp;nbsp; Battery &#10; state-of-health based on internal resistance.&lt;br /&gt; &lt;span class="caption-sub"&gt;The milliohm readings relate to &#10; the battery voltage; higher voltage allows higher milliohm &#10; readings.&lt;/span&gt;&lt;/p&gt; &lt;/div&gt; &lt;p&gt;Cold temperatures have a drastic effect on all &#10; batteries. At 0&amp;deg;C (32&amp;deg;F), the internal resistance of the same &#10; Li-ion cell drops to 70mW. The resistance increases to 80mW &#10; at -10&amp;deg;C (50&amp;deg;F) and 100mW at -20&amp;deg;C (-4&amp;deg;F).&lt;/p&gt; &lt;p&gt;The impedance readings work best with Li-ion &#10; batteries because the performance degradation follows a linear &#10; pattern with cell oxidation. The performance of NiMH batteries &#10; can also be measured with the impedance method but the readings &#10; are less dependable. There are instances when a poorly performing &#10; NiMH battery can also exhibit a low mW reading.&lt;/p&gt; &lt;p&gt;Testing a NiCd on resistance alone is unpredictable. &#10; A low resistance reading does not automatically constitute &#10; a good battery. Elevated impedance readings are often caused &#10; by memory, a phenomenon that is reversible. Internal resistance &#10; values have been reduced by a factor of two and three after &#10; servicing the affected batteries with the recondition cycle &#10; of a Cadex &lt;i&gt;7000 Series&lt;/i&gt; battery analyzer. Of cause, &#10; high internal resistance can have sources other than memory &#10; alone.&lt;/p&gt;&lt;a name="_Toc507909197"&gt;&lt;/a&gt;&lt;h4&gt;9.3 What’s the difference between internal resistance and impedance?&lt;/h4&gt; &lt;p&gt;The terms ‘internal resistance’ and ‘impedance’ &#10; are often intermixed when addressing the electrical conductivity &#10; of a battery. The differences are as follows: The internal &#10; resistance views the conductor from a purely resistive value, &#10; or ohmic resistance. A comparison can be made with a heating &#10; element that produces warmth by the friction of electric current &#10; passing through.&lt;/p&gt; &lt;p&gt;Most electrical loads are not purely resistive, &#10; rather, they have an element of reactance. If an alternating &#10; current (AC) is sent through a coil, for example, an inductance &#10; (magnetic field) is created, which opposes current flow. This &#10; AC impedance is always higher than the ohmic resistance of &#10; the copper wire. The higher the frequency, the higher the &#10; inductive resistance becomes. In comparison, sending a direct &#10; current (DC) through a coil constitutes an electrical short &#10; because there is only a very small ohmic resistance.&lt;/p&gt; &lt;p&gt;Similarly, a capacitor does not allow the flow &#10; of DC, but passes AC. In fact, a capacitor is an insulator &#10; for DC. The resistance that is present when sending an AC &#10; current flowing through a capacitor is called capacitance. &#10; The higher the frequency, the lower the capacitive resistance.&lt;/p&gt; &lt;p&gt;A battery as a power source combines ohmic, inductive &#10; and capacitive resistance. Figure&amp;nbsp;9-10 represents these &#10; resistive values on a schematic diagram. Each battery type &#10; exhibits slightly different resistive values.&lt;/p&gt; &lt;p&gt;&lt;img width="230" height="120" src="https://technick.net/img/guide_bpw2/c09_10.jpg" v:shapes="_x0000_i1028" border="0" alt="" /&gt;&lt;/p&gt; &lt;p&gt;&lt;a name="_Toc507815282" class="caption"&gt;Figure&amp;nbsp;9-10:&amp;nbsp; Ohmic, inductive and &#10; capacitive resistance in batteries.&lt;/a&gt;&lt;/p&gt; &lt;ul&gt; &lt;li class="caption"&gt;&lt;span class="caption-sub"&gt;R&lt;sub&gt;o&lt;/sub&gt; &#10; = ohmic resistance&lt;/span&gt;&lt;/li&gt; &lt;li class="caption"&gt;&lt;span class="caption-sub"&gt;Q&lt;sub&gt;c&lt;/sub&gt; &#10; = constant phase loop (type of capacitance)&lt;/span&gt;&lt;/li&gt; &lt;li class="caption"&gt;&lt;span class="caption-sub"&gt;L =&amp;nbsp;&amp;nbsp; inductor&lt;/span&gt;&lt;/li&gt; &lt;li class="caption"&gt;&lt;span class="caption-sub"&gt;Z&lt;sub&gt;w&lt;/sub&gt; &#10; =&amp;nbsp; Warburg impedance (particle movement within the electrolyte)&lt;/span&gt;&lt;/li&gt; &lt;li class="caption"&gt;&lt;span class="caption-sub"&gt;R&lt;sub&gt;t&lt;/sub&gt; &#10; =&amp;nbsp; transfer resistance&lt;/span&gt;&lt;/li&gt; &lt;/ul&gt; &lt;/blockquote&gt;</description></item><item><title>09. Linearity and Time-Invariance</title><link>https://technick.net/guides/theory/edft/009/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/edft/009/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/filters/"&gt;Introduction to Digital Filters with Audio Applications&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, Copyright &amp;#169; &lt;i&gt;2017-11-26&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/edft/008"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/000"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/022"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/010"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;Linearity and Time-Invariance&lt;/h3&gt;&lt;p&gt;In everyday terms, the fact that a &lt;a href="https://technick.net/guides/theory/edft/010"&gt;filter&lt;/a&gt; is&lt;i&gt;linear&lt;/i&gt;&lt;a name="2325"&gt;&lt;/a&gt; means simply that &lt;ol&gt;&lt;li&gt;the &lt;a href="https://ccrma.stanford.edu/~jos//log/Logarithms.html" target="_blank"&gt;amplitude&lt;/a&gt; of the output is proportional to the amplitude of&#10;the input, and&lt;p&gt;&lt;/p&gt;&lt;/li&gt;&lt;li&gt;when two signals are added together and fed to the filter,&#10;the filter output is the same as if one had put each signal through&#10;the filter separately and then added the outputs.&lt;p&gt;&lt;/p&gt;&lt;/li&gt;&lt;/ol&gt;&lt;/p&gt;&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;A filter is said to be &lt;i&gt;linear&lt;/i&gt;&lt;a name="2330"&gt;&lt;/a&gt; &#10;if for any pair of signals &lt;!-- MATH&#10; $x_1(\cdot),x_2(\cdot)$&#10; --&gt;&lt;img width="89" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img210.gif" alt="$x_1(\" dot="" cdot="" /&gt; and for all constant &#10;gains &lt;img width="14" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img211.gif" alt="$g$" /&gt;, we have&lt;br /&gt;&lt;div align="CENTER"&gt;&lt;a name="eq:Lin"&gt;&lt;/a&gt;&lt;!-- MATH&#10; \begin{eqnarray}&#10;(1)\qquad &amp;&amp; {\cal L}_n\{g\, x_1(\cdot) \} = g\,{\cal L}_n\{x_1(\cdot)\} \\&#10;(2)\qquad &amp;&amp; {\cal L}_n\{x_1(\cdot) + x_2(\cdot)\} = {\cal L}_n\{x_1(\cdot)\} &#10;&#9;+ {\cal L}_n\{x_2(\cdot)\},&#10;\end{eqnarray}&#10; --&gt;&lt;table align="CENTER" cellpadding="0" width="100%"&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&lt;img width="73" height="41" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img212.gif" alt="$\" isplaystyle="" quad="" /&gt;&lt;/td&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="237" height="41" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img213.gif" alt="$\" isplaystyle="" al="" g="" dot="" cal="" x="" dot="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(40)&lt;/td&gt;&lt;/tr&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&lt;img width="73" height="41" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img214.gif" alt="$\" isplaystyle="" quad="" /&gt;&lt;/td&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="394" height="41" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img215.gif" alt="$\" isplaystyle="" al="" x="" dot="" cdot="" al="" x="" dot="" al="" x="" dot="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(41)&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;for all &lt;img width="16" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img206.gif" alt="$n$" /&gt;. These two conditions are a mathematical statement of the&#10;previous definition. For &lt;img width="14" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img211.gif" alt="$g$" /&gt; rational, property (2) implies (1).&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;A filter is said to be &lt;i&gt;time-invariant&lt;/i&gt;&lt;a name="2340"&gt;&lt;/a&gt; if&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;{\cal L}_n\{x(\;\cdot\;-N)\}={\cal L}_{n-N}\{x(\cdot)\}=y(n-N),&#10;\end{displaymath}&#10; --&gt;&lt;a name="eq:gtif"&gt;&lt;/a&gt;&lt;a name="eq:gtif"&gt;&lt;/a&gt;&lt;img width="382" height="36" border="0" src="https://technick.net/img/guide_edft/guide_edft_img216.gif" alt="\" egin="" isplaymath="" al="" x="" dot\="" cal="" n="" cdot="" n-n="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where &lt;!-- MATH&#10; $x(\;\cdot\;-N)$&#10; --&gt;&lt;img width="86" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img217.gif" alt="$x(\" cdot\="" /&gt; is understood to denote the waveform &lt;img width="35" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img208.gif" alt="$x(\" dot="" /&gt; shifted&#10;right (or delayed) by &lt;img width="22" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img218.gif" alt="$N$" /&gt; samples.&lt;p&gt;From now on, all filters discussed will be &lt;a href="https://technick.net/guides/theory/edft/009"&gt;linear and time-invariant&lt;/a&gt;.&#10;For brevity, these will be referred to as &lt;i&gt;&lt;a href="https://technick.net/guides/theory/edft/009"&gt;LTI&lt;/a&gt; filters&lt;/i&gt;&lt;a name="2344"&gt;&lt;/a&gt;.&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>09. Quantization Issues</title><link>https://technick.net/guides/theory/dar/009/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dar/009/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/resample/"&gt;The Digital Audio Resampling Home Page&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, Copyright &amp;#169; &lt;i&gt;2016-05-17&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dar/008"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dar/000"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dar/010"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;Quantization Issues&lt;/h3&gt;&lt;p&gt;In this section, we investigate the requirements on the sampling density&lt;img width="66" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img55.gif" alt="$L=2^{n_l}$" /&gt; of the lowpass-&lt;a href="https://technick.net/guides/theory/edft/010"&gt;filter&lt;/a&gt; &lt;a href="https://technick.net/guides/theory/edft/010#2321"&gt;impulse&lt;/a&gt; response, and the number of bits&lt;img width="24" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img53.gif" alt="${n_\" ta="" /&gt; required in the interpolation factor &lt;img width="15" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img46.gif" alt="$\" ta="" /&gt;. These quantities are&#10;determined by computing the worst-case error and comparing it to the filter&#10;coefficient quantization error.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>1. An Introduction to ESD</title><link>https://technick.net/guides/electronics/esd/001/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/esd/001/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/electronics/esd/000"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/esd/000"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/esd/002"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;1. An Introduction to &#10;ESD&lt;/h3&gt;&lt;p&gt;&lt;b&gt;History &amp;amp; Background&lt;br /&gt;&lt;/b&gt;The decade of the 90's may be remembered &#10;as the &lt;i&gt;Decade of Quality&lt;/i&gt; in the electronics industry. Increased &#10;competition, &lt;i&gt;six-sigma quality,&lt;/i&gt; and &lt;i&gt;ISO 9000 &lt;/i&gt;have forced a &#10;recommitment to quality even in those companies that might not have done so &#10;willingly. As we examine our environments for quality improvement areas, &#10;electrostatic discharge (ESD) remains a key target.&lt;/p&gt;&lt;p&gt;Static electricity has been an industrial problem for centuries. As early as &#10;the 1400’s, European and Caribbean forts were using static control procedures &#10;and devices to prevent electrostatic discharge ignition of black powder stores. &#10;By the 1860's, paper mills throughout the U.S. employed basic grounding, flame &#10;ionization techniques, and steam drums to dissipate static electricity from the &#10;paper web as it traveled through the drying process. The age of electronics &#10;brought with it new problems associated with static electricity and &#10;electrostatic discharge. And, as electronic devices became faster and smaller, &#10;their sensitivity to ESD increased. &lt;/p&gt;&lt;p&gt;Today, ESD impacts productivity and product reliability in virtually every &#10;aspect of today’s electronics environment. Many aspects of electrostatic control &#10;in the electronics industry also apply in other industries such as clean room &#10;applications and graphic arts.&lt;/p&gt;&lt;p&gt;Despite a great deal of effort during the past decade, ESD still affects &#10;production yields, manufacturing costs, product quality, product reliability, &#10;and profitability. Industry experts have estimated average product losses due to &#10;static to range from 8-33% (Table 1). Others estimate the actual cost of ESD &#10;damage to the electronics industry as running into the billions of dollars &#10;annually. The cost of damaged devices themselves range from only a few cents for &#10;a simple diode to several hundred dollars for complex hybrids. When associated &#10;costs of repair and rework, shipping, labor, and overhead are included, clearly &#10;the opportunities exist for significant improvements. &lt;/p&gt;&lt;div align="center"&gt;&lt;table cellspacing="1" cellpadding="7" border="1"&gt; &lt;tbody&gt; &lt;tr&gt; &lt;td colspan="4"&gt; &lt;p align="center"&gt;&lt;b&gt;Table 1&lt;br /&gt;&lt;/b&gt;&lt;b&gt;Informal Summary of&lt;br /&gt;&lt;/b&gt;&lt;b&gt;Static &#10; Losses by Level&lt;/b&gt; &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td colspan="4"&gt; &lt;p align="center"&gt;&lt;b&gt;Static Losses Reported&lt;/b&gt; &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;&lt;b&gt;Description&lt;/b&gt; &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;&lt;b&gt;Min.&lt;br /&gt;Loss&lt;/b&gt; &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;&lt;b&gt;Max.&lt;br /&gt;Loss&lt;/b&gt; &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;&lt;b&gt;Est. Avg.&lt;br /&gt;Loss&lt;/b&gt; &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p&gt;Component Manufacturers &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;4% &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;97% &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;16-22% &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p&gt;Subcontractors &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;3% &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;70% &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;9-15% &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p&gt;Contractors &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;2% &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;35% &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;8-14% &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p&gt;User &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;5% &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;70% &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;27-33% &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td colspan="4"&gt; &lt;p align="center"&gt;&lt;font size="1"&gt;Source: Stephen Halperin, "Guidelines for &#10; Static Control Management," Eurostat, 1990.&lt;/font&gt; &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/tbody&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&amp;nbsp;&lt;/p&gt;&lt;p&gt;This first in a series of six articles on ESD focuses on how electrostatic &#10;charge and discharge occur, how various materials affect the level of charge, &#10;types of ESD damage, and how ESD events can damage electronic components. Future &#10;articles will cover various ways to control the problem. &lt;/p&gt;&lt;p&gt;&lt;b&gt;Static Electricity: Creating Charge&lt;br /&gt;&lt;/b&gt;&lt;i&gt;Static electricity&lt;/i&gt; is &#10;defined as an electrical charge caused by an imbalance of electrons on the &#10;surface of a material. This imbalance of electrons produces an electric field &#10;that can be measured and that can influence other objects at a distance. &lt;i&gt;Electrostatic discharge &lt;/i&gt;is defined as the transfer of charge between &#10;bodies at different electrical potentials.&lt;/p&gt;&lt;p&gt;Electrostatic discharge can change the electrical characteristics of a &#10;semiconductor device, degrading or destroying it. Electrostatic discharge also &#10;may upset the normal operation of an electronic system, causing equipment &#10;malfunction or failure. Another problem caused by static electricity occurs in &#10;clean rooms. Charged surfaces can attract and hold contaminants, making removal &#10;from the environment difficult. When attracted to the surface of a silicon wafer &#10;or a device's electrical circuitry, these particulates can cause random wafer &#10;defects and reduce product yields. &lt;/p&gt;&lt;p&gt;Controlling electrostatic &lt;i&gt;discharge&lt;/i&gt; begins with understanding how &#10;electrostatic &lt;i&gt;charge&lt;/i&gt; occurs in the first place. Electrostatic charge is &#10;most commonly created by the contact and separation of two similar or dissimilar &#10;materials. For example, a person walking across the floor generates static &#10;electricity as shoe soles contact and then separate from the floor surface. An &#10;electronic device sliding into or out of a bag, magazine or tube generates an &#10;electrostatic charge as the device's case and/or metal leads make multiple &#10;contacts and separations with the surface of the container. While the magnitude &#10;of electrostatic charge may be different in these examples, static electricity &#10;is indeed generated.&lt;/p&gt;&lt;p align="center"&gt;&lt;img height="267" alt="Triboelectric Charge" src="https://technick.net/img/guide_esd/tchgecon.gif" width="246" border="1" /&gt; &lt;br /&gt;Figure 1: The Triboelectric Charge. Materials Make Intimate &#10;Contact &lt;/p&gt;&lt;p align="center"&gt;&lt;img height="272" alt="Triboelectric Charge" src="https://technick.net/img/guide_esd/tchgesep.gif" width="258" border="1" /&gt; &lt;br /&gt;Figure 2: The Triboelectric Charge - Separation&lt;/p&gt;&lt;p&gt;Creating electrostatic charge by contact and separation of materials is known &#10;as "triboelectric charging." It involves the transfer of electrons between &#10;materials. The atoms of a material with no static charge have an equal number of &#10;positive (+) protons in their nucleus and negative (-) electrons orbiting the &#10;nucleus. In Figure 1, Material "A" consists of atoms with equal numbers of &#10;protons and electrons. Material B also consists of atoms with equal (though &#10;perhaps different) numbers of protons and electrons. Both materials are &#10;electrically neutral.&lt;/p&gt;&lt;p&gt;When the two materials are placed in contact and then separated, negatively &#10;charged electrons are transferred from the surface of one material to the &#10;surface of the other material. Which material loses electrons and which gains &#10;electrons will depend on the nature of the two materials. The material that &#10;loses electrons becomes positively charged, while the material that gains &#10;electrons is negatively charged. This is shown in Figure 2. &lt;/p&gt;&lt;p&gt;The actual level of charge is measured in coulombs. Commonly, however, we &#10;speak of the electrostatic potential on an object, which is expressed as &#10;voltage. &lt;/p&gt;&lt;p&gt;This process of material contact, electron transfer and separation is really &#10;a more complex mechanism than described here. The amount of charge created by &#10;triboelectric charging is affected by the area of contact, the speed of &#10;separation, relative humidity, and other factors. Once the charge is created on &#10;a material, it becomes an "electrostatic" charge (if it remains on the &#10;material). This charge may be transferred from the material, creating an &#10;electrostatic discharge, or ESD, event.&lt;/p&gt;&lt;div align="center"&gt;&lt;table cellspacing="1" cellpadding="7" border="1"&gt; &lt;tbody&gt; &lt;tr&gt; &lt;td colspan="3"&gt; &lt;p align="center"&gt;&lt;b&gt;Table 2&lt;br /&gt;Examples of Static Generation&lt;br /&gt;Typical &#10; Voltage Levels&lt;/b&gt; &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p&gt;&lt;b&gt;&lt;u&gt;Means of Generation&lt;/u&gt;&lt;/b&gt; &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;&lt;b&gt;&lt;u&gt;10-25% RH&lt;/u&gt;&lt;/b&gt; &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;&lt;b&gt;&lt;u&gt;65-90% RH&lt;/u&gt;&lt;/b&gt; &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p&gt;Walking across carpet &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;35,000V &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;1,500V &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p&gt;Walking across vinyl tile &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;12,000V &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;250V &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p&gt;Worker at bench &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;6,000V &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;100V &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p&gt;Poly bag picked up from bench &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;20,000V &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;1,200V &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p&gt;Chair with urethane foam &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;18,000V &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;1,500V &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/tbody&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;An electrostatic charge also may be created on a material in other ways such &#10;as by induction, ion bombardment, or contact with another charged object. &#10;However, triboelectric charging is the most common. &lt;/p&gt;&lt;p align="left"&gt;&lt;b&gt;Material Characteristics—How They Affect Static Charge&lt;/b&gt; &lt;br /&gt;Virtually all materials, including water and dirt particles in the air, can &#10;be triboelectrically charged. How much charge is generated, where that charge &#10;goes, and how quickly, are functions of the materials' electrical &#10;characteristics.&lt;/p&gt;&lt;p&gt;&lt;b&gt;&lt;font size="1"&gt;Insulators&lt;/font&gt;&lt;font size="2"&gt;&lt;br /&gt;&lt;/font&gt;&lt;/b&gt;A material that &#10;prevents or limits the flow of electrons across its surface or through its &#10;volume is called an insulator. Insulators have an extremely high electrical &#10;resistance. A considerable amount of charge can be generated on the surface of &#10;an insulator. Because an insulative material does not readily allow the flow of &#10;electrons, both positive and negative charges can reside on insulative surface &#10;at the same time, although at different locations. The excess electrons at the &#10;negatively charged spot might be sufficient to satisfy the absence of electrons &#10;at the positively charged spot. However, electrons cannot easily flow across the &#10;insulative material's surface, and both charges may remain in place for a very &#10;long time.&lt;/p&gt;&lt;p&gt;&lt;b&gt;&lt;font size="1"&gt;Conductive Materials&lt;br /&gt;&lt;/font&gt;&lt;/b&gt;A conductive material, &#10;because it has low electrical resistance, allows electrons to flow easily across &#10;its surface or through its volume. When a conductive material becomes charged, &#10;the charge (i.e., the deficiency or excess of electrons) will be uniformly &#10;distributed across the surface of the material. If the charged conductive &#10;material makes contact with another conductive material, the electrons will &#10;transfer between the materials quite easily. If the second conductor is attached &#10;to an earth grounding point, the electrons will flow to ground and the excess &#10;charge on the conductor will be "neutralized."&lt;/p&gt;&lt;p&gt;Electrostatic charge can be created triboelectrically on conductors the same &#10;way it is created on insulators. As long as the conductor is isolated from other &#10;conductors or ground, the static charge will remain on the conductor. If the &#10;conductor is grounded the charge will easily go to ground. Or, if the charged &#10;conductor contacts or nears another conductor, the charge will flow between the &#10;two conductors. &lt;/p&gt;&lt;p&gt;&lt;b&gt;&lt;font size="1"&gt;Static Dissipative Materials&lt;br /&gt;&lt;/font&gt;&lt;/b&gt;Static dissipative &#10;materials have electrical resistance between insulative and conductive &#10;materials. There can be electron flow across or through the dissipative &#10;material, but it is controlled by the surface resistance or volume resistance of &#10;the material.&lt;/p&gt;&lt;p&gt;As with the other two types of materials, charge can be generated &#10;triboelectrically on a static dissipative material. However, like the conductive &#10;material, the static dissipative material will allow the transfer of charge to &#10;ground or other conductive objects. The transfer of charge from a static &#10;dissipative material will generally take longer than from a conductive material &#10;of equivalent size. Charge transfers from static dissipative materials are &#10;significantly faster than from insulators, and slower than from conductors.&lt;/p&gt;&lt;p&gt;&lt;b&gt;&lt;font size="1"&gt;Triboelectric Series&lt;br /&gt;&lt;/font&gt;&lt;/b&gt;When two materials contact &#10;and separate, the polarity and magnitude of the charge are indicated by the &#10;materials’ positions in the &lt;i&gt;triboelectric series.&lt;/i&gt; The triboelectric &#10;simply lists materials according to their relative triboelectric charging &#10;characteristics. When two materials contact and separate, the one nearer the top &#10;of the series takes on a positive charge, the other a negative charge. Materials &#10;further apart on the table typically generate a higher charge than ones closer &#10;together. See Table 3.&lt;/p&gt;&lt;div align="center"&gt;&lt;table cellspacing="2" cellpadding="7" border="1"&gt; &lt;tbody&gt; &lt;tr&gt; &lt;td colspan="2"&gt; &lt;p align="center"&gt;&lt;b&gt;Table 3&lt;br /&gt;&lt;/b&gt;&lt;b&gt;Typical Triboelectric &#10; Series&lt;/b&gt;&lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="right"&gt;&lt;b&gt;+&lt;br /&gt;Positive&lt;/b&gt;&lt;/p&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt; &lt;p align="right"&gt;&lt;b&gt;Negative&lt;br /&gt;-&lt;/b&gt; &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p&gt;&lt;b&gt;Acetate&lt;br /&gt;&lt;/b&gt;&lt;b&gt;Glass&lt;br /&gt;&lt;/b&gt;&lt;b&gt;Nylon&lt;br /&gt;&lt;/b&gt;&lt;b&gt;Wool&lt;br /&gt;&lt;/b&gt;&lt;b&gt;Lead&lt;br /&gt;&lt;/b&gt;&lt;b&gt;Aluminum&lt;br /&gt;&lt;/b&gt;&lt;b&gt;Paper&lt;br /&gt;&lt;/b&gt;&lt;b&gt;COTTON&lt;br /&gt;&lt;/b&gt;&lt;b&gt;Wood&lt;br /&gt;&lt;/b&gt;&lt;b&gt;Steel&lt;br /&gt;&lt;/b&gt;&lt;b&gt;Nickel-Copper&lt;br /&gt;&lt;/b&gt;&lt;b&gt;Rubber&lt;br /&gt;&lt;/b&gt;&lt;b&gt;Polyester&lt;br /&gt;&lt;/b&gt;&lt;b&gt;PVC&lt;br /&gt;&lt;/b&gt;&lt;b&gt;Silicon&lt;br /&gt;&lt;/b&gt;&lt;b&gt;Teflon&lt;/b&gt; &#10; &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/tbody&gt;&lt;/table&gt;&lt;/div&gt;&lt;p align="left"&gt;&amp;nbsp;&lt;/p&gt;&lt;p&gt;&lt;b&gt;ESD Damage—How Devices Fail&lt;br /&gt;&lt;/b&gt;Electrostatic damage to electronic &#10;devices can occur at any point from manufacture to field service. Damage results &#10;from handling the devices in uncontrolled surroundings or when poor ESD control &#10;practices are used. Generally damage is classified as either a catastrophic &#10;failure or a latent defect.&lt;/p&gt;&lt;p&gt;&lt;b&gt;&lt;font size="1"&gt;Catastrophic Failure&lt;br /&gt;&lt;/font&gt;&lt;/b&gt;When an electronic device &#10;is exposed to an ESD event it may no longer function. The ESD event may have &#10;caused a metal melt, junction breakdown, or oxide failure. The device's &#10;circuitry is permanently damaged causing the device fail. Such failures usually &#10;can be detected when the device is tested before shipment. If the ESD event &#10;occurs after test, the damage will go undetected until the device fails in &#10;operation.&lt;/p&gt;&lt;p&gt;&lt;b&gt;&lt;font size="1"&gt;Latent Defect&lt;br /&gt;&lt;/font&gt;&lt;/b&gt;A latent defect, on the other &#10;hand, is more difficult to identify. A device that is exposed to an ESD event &#10;may be partially degraded, yet continue to perform its intended function. &#10;However, the operating life of the device may be reduced dramatically. A product &#10;or system incorporating devices with latent defects may experience premature &#10;failure after the user places them in service. Such failures are usually costly &#10;to repair and in some applications may create personnel hazards. &lt;/p&gt;&lt;p&gt;It is relatively easy with the proper equipment to confirm that a device has &#10;experienced catastrophic failure. Basic performance tests will substantiate &#10;device damage. However, latent defects are extremely difficult to prove or &#10;detect using current technology, especially after the device is assembled into a &#10;finished product.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Basic ESD Events--What Causes Electronic Devices to Fail?&lt;br /&gt;&lt;/b&gt;ESD &#10;damage is usually caused by one of three events: direct electrostatic discharge &lt;i&gt;to&lt;/i&gt; the device; electrostatic discharge&lt;i&gt; from&lt;/i&gt; the device or field &#10;induced discharges.&lt;/p&gt;&lt;p&gt;&lt;b&gt;&lt;font size="1"&gt;Discharge to the Device&lt;br /&gt;&lt;/font&gt;&lt;/b&gt;An ESD event can occur &#10;when any charged conductor (including the human body) discharges to an ESDS &#10;(electrostatic discharge sensitive) device. The most common cause of &#10;electrostatic damage is the direct transfer of electrostatic charge from the &#10;human body or a charged material to the electrostatic discharge sensitive (ESDS) &#10;device. When one walks across a floor, an electrostatic charge accumulates on &#10;the body. Simple contact of a finger to the leads of an ESDS device or assembly &#10;allows the body to discharge, possibly causing device damage. The model used to &#10;simulate this event is the Human Body Model (HBM).&lt;/p&gt;&lt;p&gt;A similar discharge can occur from a charged conductive object, such as a &#10;metallic tool or fixture. The model used to characterize this event is known as &#10;the Machine Model.&lt;/p&gt;&lt;p&gt;&lt;b&gt;&lt;font size="1"&gt;Discharge from the Device&lt;br /&gt;&lt;/font&gt;&lt;/b&gt;The transfer of &#10;charge &lt;i&gt;from&lt;/i&gt; an ESDS device is also an ESD event. The trend towards &#10;automated assembly would seem to solve the problems of HBM ESD events. However, &#10;it has been shown that components may be more sensitive to damage when assembled &#10;by automated equipment. A device may become charged, for example, from sliding &#10;down the feeder. If it then contacts the insertion head or another conductive &#10;surface, a rapid discharge occurs from the device to the metal object. This &#10;event is known as the Charged Device Model (CDM) event, and can be more &#10;destructive than the HBM for some devices. Although the duration of the &#10;discharge is very short--often less than one nanosecond--the peak current can &#10;reach several tens of amperes.&lt;/p&gt;&lt;p&gt;&lt;b&gt;&lt;font size="1"&gt;Field Induced Discharges&lt;br /&gt;&lt;/font&gt;&lt;/b&gt;Another event that can &#10;directly or indirectly damage devices is termed Field Induction. As noted &#10;earlier, whenever any object becomes electrostatically charged, there is an &#10;electrostatic field associated with that charge. If an ESDS device is placed in &#10;that electrostatic field, a charge may be induced on the device. If the device &#10;is then momentarily grounded while within the electrostatic field, a transfer of &#10;charge from the device occurs. &lt;/p&gt;&lt;p&gt;&lt;b&gt;Device Sensitivity: How Much Static Protection is Needed?&lt;br /&gt;&lt;/b&gt;Damage to &#10;an ESDS device by the ESD event is determined by the device's ability to &#10;dissipate the energy of the discharge or withstand the voltage levels involved. &#10;This is known as device "ESD sensitivity". Test procedures based on the models &#10;of ESD events help define the sensitivity of components to ESD. Some devices may &#10;be more readily damaged by discharges occurring within automated equipment, &#10;while others may be more prone to damage from handling by personnel. Defining &#10;the ESD sensitivity of electronic components is the first step in determining &#10;the degree of ESD protection required.&lt;/p&gt;&lt;p&gt;Many electronic components are susceptible to ESD damage at relatively low &#10;voltage levels. Many are susceptible at less than 100 volts, and many disk drive &#10;components have sensitivities below 10 volts. Current trends in product design &#10;and development pack more circuitry onto these miniature devices, further &#10;increasing their sensitivity to ESD and making the potential problem even more &#10;acute. Table 4 indicates the ESD sensitivity of various types of components.&lt;/p&gt;&lt;div align="center"&gt;&lt;table cellspacing="1" cellpadding="7" border="1"&gt; &lt;tbody&gt; &lt;tr&gt; &lt;td colspan="2"&gt; &lt;p align="center"&gt;&lt;b&gt;Table 4&lt;br /&gt;&lt;/b&gt;&lt;b&gt;Susceptibility of Electronic &#10; Components to ESD&lt;/b&gt; &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;&lt;b&gt;&lt;u&gt;Device Type&lt;/u&gt;&lt;/b&gt; &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;&lt;b&gt;&lt;u&gt;ESD Susceptibility&lt;br /&gt;(Volts)&lt;/u&gt;&lt;/b&gt; &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p&gt;VMOS &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;30 - 1,200 &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p&gt;Mosfet, GaAsfet, EPROM &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;100 - 300 &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p&gt;JFET &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;150 - 7,000 &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p&gt;OP-AMP &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;190 - 2,500 &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p&gt;Schottky Diodes &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;300 - 2,500 &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p&gt;Film Resistors &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;300 - 3,000 &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p&gt;Schottky TTL &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;1,000 - 2,500 &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/tbody&gt;&lt;/table&gt;&lt;p&gt;&amp;nbsp;&lt;/p&gt;&lt;/div&gt;&lt;p&gt;&lt;b&gt;Summary&lt;br /&gt;&lt;/b&gt;In this introductory article on electrostatic discharge, we &#10;have discussed the basics of electrostatic charge, discharge, types of failures, &#10;ESD events, and device sensitivity. We can summarize this discussion as &#10;follows:Virtually all materials, even conductors, can be triboelectrically &#10;charged.&lt;/p&gt;&lt;ol&gt; &lt;li&gt;The level of charge is affected by material type, speed of contact and &#10; separation, humidity, and several other factors. &#10; &lt;/li&gt;&lt;li&gt;Electrostatic discharge can create catastrophic or latent failures in &#10; electronic components. &#10; &lt;/li&gt;&lt;li&gt;Electrostatic discharge can occur throughout the manufacturing, test, &#10; shipping, handling, or operational processes. &#10; &lt;/li&gt;&lt;li&gt;Component damage can occur as the result of a discharge from the component &#10; as well as a direct discharge to the component. &#10; &lt;/li&gt;&lt;li&gt;Components vary significantly in their sensitivity to ESD. &lt;/li&gt;&lt;/ol&gt;&lt;p&gt;Protecting your products from the effects of static damage begins by &#10;understanding these key concepts of ESD. Armed with this information, you can &#10;then begin to develop an effective ESD control program. In &lt;i&gt;&lt;a href="https://technick.net/guides/electronics/esd/002"&gt;Part Two&lt;/a&gt;&lt;/i&gt; we will focus on some &#10;basic concepts of ESD control.&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>1. WHAT IS MEMORY?</title><link>https://technick.net/guides/hardware/umg/01_000/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/umg/01_000/</guid><description>&lt;hr /&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/01_001"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt;&lt;a name="TOC"&gt;&lt;/a&gt;&lt;h3&gt;1. WHAT IS MEMORY?&lt;/h3&gt;&lt;/p&gt;&lt;p&gt;&lt;ul&gt;&lt;li&gt;&lt;a href="https://technick.net/guides/hardware/umg/01_001"&gt;1.1. INTRODUCTION&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href="https://technick.net/guides/hardware/umg/01_002"&gt;1.2. THE ROLE OF MEMORY IN THE COMPUTER&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href="https://technick.net/guides/hardware/umg/01_003"&gt;1.3. THE DIFFERENCE BETWEEN MEMORY AND STORAGE&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href="https://technick.net/guides/hardware/umg/01_004"&gt;1.4. MEMORY AND PERFORMANCE&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href="https://technick.net/guides/hardware/umg/01_005"&gt;1.5. HOW MUCH MEMORY DO YOU NEED?&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/p&gt;&lt;/blockquote&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/01_001"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;</description></item><item><title>1.1. INTRODUCTION</title><link>https://technick.net/guides/hardware/umg/01_001/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/umg/01_001/</guid><description>&lt;hr /&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/hardware/umg/01_000"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/01_002"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt;&lt;a name="TOC"&gt;&lt;/a&gt;&lt;h3&gt;1.1. INTRODUCTION&lt;/h3&gt;&lt;/p&gt;&lt;p&gt;These days, no matter how much memory your computer has, it never seems to be&#10;quite enough. Not long ago, it was unheard of for a PC (Personal Computer), to&#10;have more than 1 or 2 MB (Megabytes) of memory. Today, most systems require&#10;64MB to run basic applications. And up to 256MB or more is needed for optimal&#10;performance when using graphical and multimedia programs.&lt;br /&gt;&lt;br /&gt;As an indication of how much things have changed over the past two decades,&#10;consider this: in 1981, referring to computer memory, Bill Gates said, “640K&#10;(roughly 1/2 of a megabyte) ought to be enough for anybody.”&lt;br /&gt;&lt;br /&gt;For some, the memory equation is simple: more is good; less is bad. However, for&#10;those who want to know more, this reference guide contains answers to the most&#10;common questions, plus much, much more.&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>1.2. THE ROLE OF MEMORY IN THE COMPUTER</title><link>https://technick.net/guides/hardware/umg/01_002/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/umg/01_002/</guid><description>&lt;hr /&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/hardware/umg/01_001"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/01_003"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt;&lt;a name="TOC"&gt;&lt;/a&gt;&lt;h3&gt;1.2. THE ROLE OF MEMORY IN THE COMPUTER&lt;/h3&gt;&lt;/p&gt;&lt;p&gt;People in the computer industry commonly use the term “memory” to refer to RAM&#10;(Random Access Memory). A computer uses RAM to hold temporary instructions&#10;and data needed to complete tasks. This enables the computer’s CPU (Central&#10;Processing Unit), to access instructions and data stored in memory very quickly.&lt;br /&gt;&lt;br /&gt;A good example of this is when the CPU loads an application program – such as a&#10;word processing or page layout program – into memory, thereby allowing the&#10;application program to work as quickly and efficiently as possible. In practical&#10;terms, having the program loaded into memory means you can get work done more&#10;quickly with less time spent waiting for the computer to perform tasks.&lt;br /&gt;&lt;br /&gt;&lt;div align="center"&gt;&lt;img src="https://technick.net/img/guide_umg/guide_umg_001.jpg" width="348" height="269" border="0" alt="" /&gt;&lt;/div&gt;&lt;br /&gt;The process begins when you enter a command from your keyboard. The CPU interprets the command and instructs the hard drive to load the command or prgram into memory. Once the data is loaded into memory, the CPU is able to access it much more quickly than if it had to retrieve it from the hard drive.&lt;br /&gt;&lt;br /&gt;This process of putting things the CPU needs in a place where it can get at them&#10;more quickly is similar to placing various electronic files and documents you’re&#10;using on the computer into a single file folder or directory. By doing so, you keep&#10;all the files you need handy and avoid searching in several places every time you&#10;need them.&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>1.3. THE DIFFERENCE BETWEEN MEMORY AND STORAGE</title><link>https://technick.net/guides/hardware/umg/01_003/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/umg/01_003/</guid><description>&lt;hr /&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/hardware/umg/01_002"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/01_004"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt;&lt;a name="TOC"&gt;&lt;/a&gt;&lt;h3&gt;1.3. THE DIFFERENCE BETWEEN MEMORY AND STORAGE&lt;/h3&gt;&lt;/p&gt;&lt;p&gt;People often confuse the terms memory and storage, especially when describing the&#10;amount they have of each. The term memory refers to the amount of RAM installed&#10;in the computer, whereas the term storage refers to the capacity of the computer’s&#10;hard disk. To clarify this common mix-up, it helps to compare your computer to&#10;an office that contains a desk and a file cabinet.&lt;br /&gt;&lt;br /&gt;&lt;table border="0" cellspacing="2" cellpadding="2"&gt;&lt;tr align="left" valign="top"&gt;&lt;td&gt;&lt;img src="https://technick.net/img/guide_umg/guide_umg_002.jpg" width="266" height="307" border="0" alt="" /&gt;&lt;/td&gt;&lt;td&gt;The file cabinet represents the computer's hard disk, which provides storage for all the files and information you need in your office. When you come in to work, you take out the files you need from storage and put them on your desk for easy access while you work on them. The desk is like memory in the computer: it holds the information and data you need to have handy while you're working.&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;br /&gt;Consider the desk-and-file-cabinet metaphor for a moment. Imagine what it would&#10;be like if every time you wanted to look at a document or folder you had to retrieve&#10;it from the file drawer. It would slow you down tremendously, not to mention drive&#10;you crazy. With adequate desk space – our metaphor for memory – you can lay out&#10;the documents in use and retrieve information from them immediately, often with&#10;just a glance.&lt;br /&gt;&lt;br /&gt;Here’s another important difference between memory and storage: the information&#10;stored on a hard disk remains intact even when the computer is turned off.&#10;However, any data held in memory is lost when the computer is turned off. In our&#10;desk space metaphor, it’s as though any files left on the desk at closing time will be&#10;thrown away.&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>1.4. MEMORY AND PERFORMANCE</title><link>https://technick.net/guides/hardware/umg/01_004/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/umg/01_004/</guid><description>&lt;hr /&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/hardware/umg/01_003"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/01_005"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt;&lt;a name="TOC"&gt;&lt;/a&gt;&lt;h3&gt;1.4. MEMORY AND PERFORMANCE&lt;/h3&gt;&lt;/p&gt;&lt;p&gt;It’s been proven that adding more memory to a computer system increases its&#10;performance. If there isn’t enough room in memory for all the information the CPU&#10;needs, the computer has to set up what’s known as a virtual memory file. In so&#10;doing, the CPU reserves space on the hard disk to simulate additional RAM. This&#10;process, referred to as “swapping”, slows the system down. In an average computer,&#10;it takes the CPU approximately 200ns (nanoseconds) to access RAM compared to&#10;12,000,000ns to access the hard drive. To put this into perspective, this is equivalent&#10;to what’s normally a 3&amp;frac12; minute task taking 4&amp;frac12; months to complete!&lt;br /&gt;&lt;br /&gt;&lt;div align="center"&gt;&lt;img src="https://technick.net/img/guide_umg/guide_umg_003.jpg" width="514" height="129" border="0" alt="" /&gt;&lt;br /&gt;Access time comparision between RAM and a hard drive.&lt;/div&gt;&lt;br /&gt;&lt;br /&gt;&lt;h4&gt;MEMORY UPGRADE ON A PC: LIFE IS GOOD&lt;/h4&gt;If you've ever had more memory added to your PC, you probably noticed a performance improvement right away. With a memory upgrade, applications respond more quickly, Web pages load faster, and you can have more programs running simultaneously. In short, additional memory can make using your computer a lot more enjoyable.&lt;br /&gt;&lt;br /&gt;&lt;h4&gt;MEMORY UPGRADE ON A SERVER: LIFE IS EVEN BETTER&lt;/h4&gt;These days, more and more people are using computers in a workgroup and sharing information over a network. The computers that help distribute information to people on a network are called servers. And their performance has a huge impact on the performance of the network: if a server is performing poorly, everyone on the network "feels the pain." So, while a memory upgrade on an individual PC makes a big difference for the person who uses it, a memory upgrade in a server has even more far-reaching effects and benefits everyone who accesses the server.&lt;br /&gt;&lt;br /&gt;To better understand the benefits of increasing memory on a server, take a look at these results from an independent study done on Windows NT-based servers.&lt;br /&gt;&lt;br /&gt;&lt;div align="center"&gt;&lt;img src="https://technick.net/img/guide_umg/guide_umg_004.jpg" width="490" height="228" border="0" alt="" /&gt;&lt;br /&gt;Application servers are utilized to host a wide range of applications, such as word processing and spreadsheet programs. By increasing base memory from 64MB to 256MB, Windows NT Server was able to support five times as many clients before transactions per second dropped. &lt;/div&gt;&lt;br /&gt;&lt;br /&gt;&lt;table border="0" cellspacing="2" cellpadding="2"&gt;&lt;tr align="left" valign="top"&gt;&lt;td&gt;&lt;img src="https://technick.net/img/guide_umg/guide_umg_005.jpg" width="339" height="228" border="0" alt="" /&gt;&lt;/td&gt;&lt;td&gt;Web servers are employed to serve up Web pages in response to HTTP requests from users. Doubling memory can cut response time by more than 50%.&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;br /&gt;&lt;br /&gt;Directory servers are vital to corporate productivity, handling most email and messaging tasks. In this environment, more memory increases the speed with which a server can access information from linked databases. Doubling memory increased performance from 248 to 3000%.&lt;br /&gt;&lt;br /&gt;&lt;div align="center"&gt;&lt;img src="https://technick.net/img/guide_umg/guide_umg_006.jpg" width="501" height="240" border="0" alt="" /&gt;&lt;/div&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>1.5. HOW MUCH MEMORY DO YOU NEED?</title><link>https://technick.net/guides/hardware/umg/01_005/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/umg/01_005/</guid><description>&lt;hr /&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/hardware/umg/01_004"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/02_000"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt;&lt;a name="TOC"&gt;&lt;/a&gt;&lt;h3&gt;1.5. HOW MUCH MEMORY DO YOU NEED?&lt;/h3&gt;&lt;/p&gt;&lt;p&gt;Perhaps you already know what it's like to work on a computer that doesn't have&#10;quite enough memory. You can hear the hard drive operating more frequently and&#10;the "hour glass" or "wrist watch" cursor symbol appears on the screen for longer&#10;periods of time. Things can run more slowly at times, memory errors can occur&#10;more frequently, and sometimes you can't launch an application or a file without&#10;first closing or quitting another.&lt;br /&gt;&lt;br /&gt;So, how do you determine if you have enough memory, or if you would benefit&#10;from more? And if you do need more, how much more? The fact is, the right&#10;amount of memory depends on the type of system you have, the type of work&#10;you're doing, and the software applications you're using. Because the right amount&#10;of memory is likely to be different for a desktop computer than for a server, we've&#10;divided this section into two parts - one for each type of system.&lt;br /&gt;&lt;br /&gt;&lt;h4&gt;MEMORY REQUIREMENTS FOR A DESKTOP COMPUTER&lt;/h4&gt;If you're using a desktop computer, memory requirements depend on the computer's&#10;operating system and the application software you're using. Today's word processing&#10;and spreadsheet applications require as little as 32MB of memory to run. However,&#10;software and operating system developers continue to extend the capabilities of their&#10;products, which usually means greater memory requirements. Today, developers&#10;typically assume a minimum memory configuration of 64MB. Systems used for&#10;graphic arts, publishing, and multimedia call for at least 128MB of memory and it's&#10;common for such systems to require 256MB or more for best performance.&lt;br /&gt;&lt;br /&gt;The chart on the next page provides basic guidelines to help you decide how much&#10;memory is optimal for your desktop computer. The chart is divided by operating&#10;system and by different kinds of work. Find the operating system you're using on&#10;your computer, then look for the descriptions of work that most closely match the&#10;kind of work you do.&lt;br /&gt;&lt;br /&gt;&lt;h4&gt;DESKTOP MEMORY MAP&lt;/h4&gt;&lt;table cellspacing="0" cellpadding="2" border="1"&gt;&lt;!-- WINDOWS 2000 --&gt;&lt;tr&gt;&lt;td colspan="3" valign="top"&gt;&lt;b&gt;WINDOWS&lt;sup&gt;&amp;reg;&lt;/sup&gt; 2000 PROFESSIONAL&lt;/b&gt;&lt;br /&gt;Windows 2000 &#10;&#9;&#9;Professional runs software applications faster. Notebook- ready and designed &#10;&#9;&#9;with the future in mind, Windows 2000 Professional allows users to take &#10;&#9;&#9;advantage of a full- range of features today. Windows 2000 Professional is &#10;&#9;&#9;future- ready and promises to run today's and tomorrow's applications better.&lt;br /&gt;Baseline: 64MB - 128MB&lt;br /&gt;Optimal: 128MB - 512MB&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td rowspan="3" valign="top"&gt;&lt;b&gt;Administrative &amp;amp; Service&lt;/b&gt;&lt;/td&gt;&lt;td valign="top"&gt;&lt;b&gt;Light-&lt;/b&gt; Word processing, email, data- entry&lt;/td&gt;&lt;td valign="top"&gt;64MB - 96MB&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td valign="top"&gt;&lt;b&gt;Medium-&lt;/b&gt; Fax /communications, database administration, spreadsheets; &amp;gt;2 applications open at a time&lt;/td&gt;&lt;td valign="top"&gt;64MB - 128MB&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td valign="top"&gt;&lt;b&gt;Heavy-&lt;/b&gt; Complex documents, accounting, business graphics, presentation software, network connectivity&lt;/td&gt;&lt;td valign="top"&gt;96MB - 256MB&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td rowspan="3" valign="top"&gt;&lt;b&gt;Executives &amp;amp; Analysts&lt;/b&gt;&lt;/td&gt;&lt;td valign="top"&gt;&lt;b&gt;Light-&lt;/b&gt; Proposals, reports, spreadsheets, business graphics, databases, scheduling, presentations&lt;/td&gt;&lt;td valign="top"&gt;64MB - 96MB&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td valign="top"&gt;&lt;b&gt;Medium-&lt;/b&gt; Complex presentations, sales/ market analysis, project management, Internet access&lt;/td&gt;&lt;td valign="top"&gt;96MB - 128MB&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td valign="top"&gt;&lt;b&gt;Heavy-&lt;/b&gt; Statistical applications, large databases, research/ technical analysis, complex presentations, video conferencing&lt;/td&gt;&lt;td valign="top"&gt;128MB - 512MB&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td rowspan="3" valign="top"&gt;&lt;b&gt;Engineers&amp;amp;Designers&lt;/b&gt;&lt;/td&gt;&lt;td valign="top"&gt;&lt;b&gt;Light-&lt;/b&gt; Page layout, 2 - 4 color line drawings, simple image manipulation, simple graphics&lt;/td&gt;&lt;td valign="top"&gt;96MB - 128MB&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td valign="top"&gt;&lt;b&gt;Medium-&lt;/b&gt; 2D CAD, rendering, multimedia presentations, simple photo- editing, Web development&lt;/td&gt;&lt;td valign="top"&gt;128MB - 512MB&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td valign="top"&gt;&lt;b&gt;Heavy-&lt;/b&gt; Animation, complex photo- editing, real- time video, 3D CAD, solid modeling, finite element analysis&lt;/td&gt;&lt;td valign="top"&gt;256MB - 1GB&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;br /&gt;&lt;table cellspacing="0" cellpadding="2" border="1"&gt;&lt;!-- WINDOWS 98 --&gt;&lt;tr&gt;&lt;td colspan="3" valign="top"&gt;&lt;b&gt;WINDOWS&lt;sup&gt;&amp;reg;&lt;/sup&gt; 98&lt;/b&gt;&lt;br /&gt; &#10;&#9;&#9;Windows 98 requires 16 - 32MB to run basic applications. Tests show 45 - 65% &#10;&#9;&#9;performance improvements at 64MB and beyond. &lt;br /&gt;Baseline: 32MB - 64MB&lt;br /&gt;Optimal: 128MB - 256MB&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td rowspan="3" valign="top"&gt;&lt;b&gt;Students&lt;/b&gt;&lt;/td&gt;&lt;td valign="top"&gt;&lt;b&gt;Light-&lt;/b&gt; Word processing, basic financial management, email and other light Internet use&lt;/td&gt;&lt;td valign="top"&gt;32MB - 64MB&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td valign="top"&gt;&lt;b&gt;Medium-&lt;/b&gt; Home office applications, games, Internet surfing, downloading images, spreadsheets, presentations&lt;/td&gt;&lt;td valign="top"&gt;64MB - 128MB&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td valign="top"&gt;&lt;b&gt;Heavy-&lt;/b&gt; Multimedia use such as video, graphics, music, voice recognition, design, complex images&lt;/td&gt;&lt;td valign="top"&gt;128MB - 384MB&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td rowspan="3" valign="top"&gt;&lt;b&gt;Home Users&lt;/b&gt;&lt;/td&gt;&lt;td valign="top"&gt;&lt;b&gt;Light-&lt;/b&gt; Word processing, basic financial management, email and other light Internet use&lt;/td&gt;&lt;td valign="top"&gt;32MB - 48MB&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td valign="top"&gt;&lt;b&gt;Medium-&lt;/b&gt; Home office applications, games, Internet surfing, downloading images, spreadsheets, presentations&lt;/td&gt;&lt;td valign="top"&gt;48MB - 64MB&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td valign="top"&gt;&lt;b&gt;Heavy-&lt;/b&gt; Multimedia use such as video, graphics, music, voice recognition, design, complex images&lt;/td&gt;&lt;td valign="top"&gt;64MB - 128MB&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;br /&gt;&lt;table cellspacing="0" cellpadding="2" border="1"&gt;&lt;!-- LINUX --&gt;&lt;tr&gt;&lt;td colspan="3" valign="top"&gt;&lt;b&gt;LINUX&lt;sup&gt;&amp;reg;&lt;/sup&gt;&lt;/b&gt;&lt;br /&gt;The Linux operating system is quickly gaining popularity as an alternative to &#10;&#9;&#9;Microsoft Windows. It includes true multitasking, virtual memory, shared &#10;&#9;&#9;libraries, demand loading, proper memory management, TCP/ IP networking, and&#10;&#9;&#9;other features consistent with Unix- type systems. &lt;br /&gt;Baseline: 48MB - 112MB&lt;br /&gt;Optimal: 112MB - 512MB&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td rowspan="3" valign="top"&gt;&lt;b&gt;Administrative&amp;amp;Service&lt;/b&gt;&lt;/td&gt;&lt;td valign="top"&gt;&lt;b&gt;Light-&lt;/b&gt; Word processing, email, data- entry&lt;/td&gt;&lt;td valign="top"&gt;48MB - 80MB&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td valign="top"&gt;&lt;b&gt;Medium-&lt;/b&gt; Fax /communications, database administration, spreadsheets; &amp;gt;2 applications open at a time&lt;/td&gt;&lt;td valign="top"&gt;48MB - 112MB&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td valign="top"&gt;&lt;b&gt;Heavy-&lt;/b&gt; Complex documents, accounting, business graphics, presentation software, network connectivity&lt;/td&gt;&lt;td valign="top"&gt;80MB - 240MB&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td rowspan="3" valign="top"&gt;&lt;b&gt;Executives&amp;amp;Analysts&lt;/b&gt;&lt;/td&gt;&lt;td valign="top"&gt;&lt;b&gt;Light-&lt;/b&gt; Proposals, reports, spreadsheets, business graphics, databases, scheduling, presentations&lt;/td&gt;&lt;td valign="top"&gt;48MB - 80MB&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td valign="top"&gt;&lt;b&gt;Medium-&lt;/b&gt; Complex presentations, sales/ market analysis, project management, Internet access&lt;/td&gt;&lt;td valign="top"&gt;80MB - 112MB&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td valign="top"&gt;&lt;b&gt;Heavy-&lt;/b&gt; Statistical applications, large databases, research/ technical analysis, complex presentations, video conferencing&lt;/td&gt;&lt;td valign="top"&gt;112MB - 512MB&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td rowspan="3" valign="top"&gt;&lt;b&gt;Engineers&amp;amp;Designers&lt;/b&gt;&lt;/td&gt;&lt;td valign="top"&gt;&lt;b&gt;Light-&lt;/b&gt; Page layout, 2 - 4 color line drawings, simple image manipulation, simple graphics&lt;/td&gt;&lt;td valign="top"&gt;80MB - 112MB&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td valign="top"&gt;&lt;b&gt;Medium-&lt;/b&gt; 2D CAD, rendering, multimedia presentations, simple photo- editing, Web development&lt;/td&gt;&lt;td valign="top"&gt;112MB - 512MB&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td valign="top"&gt;&lt;b&gt;Heavy-&lt;/b&gt; Animation, complex photo- editing, real- time video, 3D CAD, solid modeling, finite element analysis&lt;/td&gt;&lt;td valign="top"&gt;240MB - 1GB&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;br /&gt;&lt;table cellspacing="0" cellpadding="2" border="1"&gt;&lt;!-- MACINTOSH OS --&gt;&lt;tr&gt;&lt;td colspan="3" valign="top"&gt;&lt;b&gt;MACINTOSH&lt;sup&gt;™&lt;/sup&gt; OS&lt;/b&gt;&lt;br /&gt;The Macintosh operating system manages memory in substantially different ways &#10;&#9;&#9;than other systems. Still, System 9.0 users will find that 48MB is a bare &#10;&#9;&#9;minimum. When using PowerMac &lt;sup&gt;&amp;reg;&lt;/sup&gt; applications with Internet connectivity, plan &#10;&#9;&#9;on a range between 64 and 128MB as a minimum. &lt;br /&gt;Baseline: 48MB - 64MB&lt;br /&gt;Optimal: 128MB - 512MB&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td rowspan="3" valign="top"&gt;&lt;b&gt;Administrative&amp;amp;Service&lt;/b&gt;&lt;/td&gt;&lt;td valign="top"&gt;&lt;b&gt;Light- &lt;/b&gt;Word processing, email, data- entry&lt;/td&gt;&lt;td valign="top"&gt;48MB - 64MB&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td valign="top"&gt;&lt;b&gt;Medium-&lt;/b&gt; Fax /communications, database administration, spreadsheets; &amp;gt;2 applications open at a time&lt;/td&gt;&lt;td valign="top"&gt;64MB - 96MB&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td valign="top"&gt;&lt;b&gt;Heavy-&lt;/b&gt; Complex documents, accounting, business graphics, presentation software, network connectivity&lt;/td&gt;&lt;td valign="top"&gt;96MB - 128MB&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td rowspan="3"&gt;&lt;b&gt;Executives&amp;amp;Analysts&lt;/b&gt;&lt;/td&gt;&lt;td valign="top"&gt;&lt;b&gt;Light-&lt;/b&gt; Proposals, reports, spreadsheets, business graphics, databases, scheduling, presentations&lt;/td&gt;&lt;td valign="top"&gt;64MB - 256MB&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td valign="top"&gt;&lt;b&gt;Medium-&lt;/b&gt; Complex presentations, sales/ market analysis, project management, Internet access&lt;/td&gt;&lt;td valign="top"&gt;128MB - 1GB&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td valign="top"&gt;&lt;b&gt;Heavy-&lt;/b&gt; Statistical applications, large databases, research/ technical analysis, complex presentations, video conferencing&lt;/td&gt;&lt;td valign="top"&gt;96MB - 128MB&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td rowspan="3" valign="top"&gt;&lt;b&gt;Engineers&amp;amp;Designers&lt;/b&gt;&lt;/td&gt;&lt;td valign="top"&gt;&lt;b&gt;Light-&lt;/b&gt; Page layout, 2 - 4 color line drawings, simple image manipulation, simple graphics&lt;/td&gt;&lt;td valign="top"&gt;128MB - 512MB&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td valign="top"&gt;&lt;b&gt;Medium-&lt;/b&gt; 2D CAD, rendering, multimedia presentations, simple photo- editing, Web development&lt;/td&gt;&lt;td valign="top"&gt;256MB - 1GB&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td valign="top"&gt;&lt;b&gt;Heavy-&lt;/b&gt; Animation, complex photo- editing, real- time video, 3D CAD, solid modeling, finite element analysis&lt;/td&gt;&lt;td valign="top"&gt;512MB - 2GB&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;br /&gt;&lt;br /&gt;* Please Note: These figures reflect work done in a typical desktop environment. &#10;Higher-end workstation tasks may require up to 4GB. Naturally, a chart such as this &#10;evolves as memory needs and trends change. Over time, developers of software and &#10;operating systems will continue to add features and functionality to their products. &#10;This will continue to drive the demand for more memory. More complex character sets, &#10;like Kanji, may require more memory than the standard Roman based (English) character &#10;sets.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;h4&gt;SERVER MEMORY REQUIREMENTS&lt;/h4&gt;How can you tell when a server requires more memory? Quite often, the users of the&#10;network are good indicators. If network-related activity such as email, shared &#10;appli-cations, or printing slows down, they'll probably let their Network &#10;Administrator know. Here are a few proactive strategies that can be used to gauge &#10;whether or not a server has sufficient memory:&lt;br /&gt;&lt;br /&gt;&lt;ul&gt;&lt;li&gt;Monitor server disk activity. If disk swapping is detected, it is usually a result of&#10;inadequate memory.&lt;br /&gt;&lt;br /&gt;&lt;/li&gt;&lt;li&gt;Most servers have a utility that monitors CPU, memory, and disk utilization.&#10;Review this at peak usage times to measure the highest spikes in demand.&lt;/li&gt;&lt;/ul&gt;Once it's determined that a server does need more memory, there are many factors&#10;to consider when deciding on how much is enough:&lt;br /&gt;&lt;br /&gt;&lt;b&gt;What functions does the server perform (application, communication, remote&#10;access, email, Web, file, multimedia, print, database)?&lt;/b&gt;&lt;br /&gt;&lt;br /&gt;&lt;ul&gt;Some servers hold a large amount of information in memory at once, while oth-ers&#10;process information sequentially. For example, a typical large database server&#10;does a lot of data processing; with more memory, such a server would likely run&#10;much faster because more of the records it needs for searches and queries could&#10;be held in memory - that is, "at the ready." On the other hand, compared to a&#10;database server, a typical file server can perform efficiently with less memory&#10;because its primary job is simply to transfer information rather than to process it.&lt;/ul&gt;&lt;b&gt;What operating system does the server use?&lt;/b&gt;&lt;br /&gt;&lt;br /&gt;&lt;ul&gt;Each server operating system manages memory differently. For example, a&lt;b&gt;network operating system (NOS)&lt;/b&gt; such as the Novell operating system handles&#10;information much differently than an application-oriented system such as&#10;Windows NT. Windows NT's richer interface requires more memory, while the&#10;traditional Novell functions of file and print serving require less memory.&lt;/ul&gt;&lt;b&gt;How many users access the server at one time?&lt;/b&gt;&lt;br /&gt;&lt;br /&gt;&lt;ul&gt;Most servers are designed and configured to support a certain number of users&#10;at one time. Recent tests show that this number is directly proportional to the&#10;amount of memory in the server. As soon as the number of users exceeds&#10;maximum capacity, the server resorts to using hard disk space as virtual memory,&#10;and performance drops sharply. In recent studies with Windows NT, additional&#10;memory allowed an application server to increase by several times the number of&#10;users supported while maintaining the same level of performance.&lt;/ul&gt;&lt;b&gt;What kind and how many processors are installed on the server?&lt;/b&gt;&lt;br /&gt;&lt;br /&gt;&lt;ul&gt;Memory and processors affect server performance differently, but they work hand&#10;in hand. Adding memory allows more information to be handled at one time,&#10;while adding processors allows the information to be processed faster. So, if you&#10;add processing power to a system, additional memory will enable the processors&#10;to perform at their full potential.&lt;/ul&gt;&lt;b&gt;How critical is the server's response time?&lt;/b&gt;&lt;br /&gt;&lt;br /&gt;&lt;ul&gt;In some servers, such as Web or e-commerce servers, response time directly&#10;affects the customer experience and hence revenue. In these cases, some IT&#10;Managers choose to install more memory than they think they would ever need&#10;in order to accommodate surprise surges in use.&#10;Because server configurations involve so many variables, it's difficult to make&#10;precise recommendations with regard to memory. The following chart shows two&#10;server upgrade scenarios.&lt;/ul&gt;&lt;h4&gt;SERVER MEMORY MAP&lt;/h4&gt;&lt;table cellspacing="0" cellpadding="2" border="1"&gt;&lt;tr&gt;&lt;td colspan="6" valign="top"&gt;&lt;b&gt;WINDOWS&lt;sup&gt;&amp;reg;&lt;/sup&gt; &#10;&#9;&#9;2000 SERVER&lt;/b&gt;&lt;br /&gt;Designed to help businesses of all sizes run better, Windows &#10;&#9;&#9;2000 Server offers a manageable, reliable and internet- ready solution for &#10;&#9;&#9;today's growing enterprises. For optimal performance, consider adding more &#10;&#9;&#9;memory to take advantage of Windows 2000 Server's robust feature set. Windows &#10;&#9;&#9;2000 Server is internet- ready and promises to run today's and tomorrow's &#10;&#9;&#9;applications better. &lt;br /&gt;Baseline: 128MB&lt;br /&gt;Optimal: 256MB - 1GB&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td valign="top"&gt;&lt;b&gt;Application Server&lt;/b&gt;&lt;/td&gt;&lt;td valign="top"&gt;Houses one or more applications to be accessed over a wide user base&lt;/td&gt;&lt;td valign="top"&gt;256MB - 4GB&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td valign="top"&gt;&lt;b&gt;Directory Server&lt;/b&gt;&lt;/td&gt;&lt;td valign="top"&gt;Central Management of network resources&lt;/td&gt;&lt;td valign="top"&gt;128MB - 1GB&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td valign="top"&gt;&lt;b&gt;Print Server&lt;/b&gt;&lt;/td&gt;&lt;td valign="top"&gt;Distributes print jobs to appropriate printers&lt;/td&gt;&lt;td valign="top"&gt;128MB - 512MB&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td valign="top"&gt;&lt;b&gt;Communication Server&lt;/b&gt;&lt;/td&gt;&lt;td valign="top"&gt;Manages a variety of communications such as PBX, Voicemail, Email, and VPN&lt;/td&gt;&lt;td valign="top"&gt;512MB - 2GB&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td valign="top"&gt;&lt;b&gt;Web Server&lt;/b&gt;&lt;/td&gt;&lt;td valign="top"&gt;Internet and intranet solutions&lt;/td&gt;&lt;td valign="top"&gt;512MB - 2GB&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td valign="top"&gt;&lt;b&gt;Database Server&lt;/b&gt;&lt;/td&gt;&lt;td valign="top"&gt;Manages simple to complex databases of varying sizes&lt;/td&gt;&lt;td valign="top"&gt;256MB - 4GB&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;br /&gt;&lt;table cellspacing="0" cellpadding="2" border="1"&gt;&lt;tr&gt;&lt;td colspan="6" valign="top"&gt;&lt;b&gt;LINUX&lt;sup&gt;&amp;reg;&lt;/sup&gt;&lt;/b&gt;&lt;br /&gt;Linux is a reliable, cost- effective alternative to traditional &#10;&#9;&#9;UNIX servers. Depending on the distribution, the Linux server platform &#10;&#9;&#9;features a variety of utilities, applications, and services. &lt;br /&gt;Baseline: 64MB - 128MB&lt;br /&gt;Optimal: 256MB - 1GB&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td valign="top"&gt;&lt;b&gt;Application Server&lt;/b&gt;&lt;/td&gt;&lt;td valign="top"&gt;Houses one or more applications to be accessed over a wide user base&lt;/td&gt;&lt;td valign="top"&gt;64MB - 4GB&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td valign="top"&gt;&lt;b&gt;Directory Server&lt;/b&gt;&lt;/td&gt;&lt;td valign="top"&gt;Central Management of network resources&lt;/td&gt;&lt;td valign="top"&gt;128MB - 1GB&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td valign="top"&gt;&lt;b&gt;Print Server&lt;/b&gt;&lt;/td&gt;&lt;td valign="top"&gt;Distributes print jobs to appropriate printers&lt;/td&gt;&lt;td valign="top"&gt;128MB - 512MB&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td valign="top"&gt;&lt;b&gt;Communication Server&lt;/b&gt;&lt;/td&gt;&lt;td valign="top"&gt;Manages a variety of communications such as PBX, Voicemail, Email, and VPN&lt;/td&gt;&lt;td valign="top"&gt;512MB - 2GB&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td valign="top"&gt;&lt;b&gt;Web Server&lt;/b&gt;&lt;/td&gt;&lt;td valign="top"&gt;Internet and intranet solutions&lt;/td&gt;&lt;td valign="top"&gt;512MB - 2GB&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td valign="top"&gt;&lt;b&gt;Database Server&lt;/b&gt;&lt;/td&gt;&lt;td valign="top"&gt;Manages simple to complex databases of varying sizes&lt;/td&gt;&lt;td valign="top"&gt;256MB - 4GB&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;br /&gt;&lt;br /&gt;* Please Note: These figures reflect work done in a typical server environment. &#10;Higher- end workstation tasks may require up to 4GB. Naturally, a chart such as &#10;this evolves as memory needs and trends change. Over time, developers of software &#10;and operating systems will continue to add features and functionality to their &#10;products. This will continue to drive the demand for more memory. More complex&#10;character sets, like Kanji, may require more memory than the standard Roman based &#10;(English) character sets.&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>10. Choice of Table Size</title><link>https://technick.net/guides/theory/dar/010/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dar/010/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/resample/"&gt;The Digital Audio Resampling Home Page&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, Copyright &amp;#169; &lt;i&gt;2016-05-17&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dar/009"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dar/000"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dar/011"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;Choice of Table Size&lt;/h3&gt;&lt;p&gt;It is desirable that the stored &lt;a href="https://technick.net/guides/theory/edft/010"&gt;filter&lt;/a&gt; &lt;a href="https://technick.net/guides/theory/edft/010#2321"&gt;impulse&lt;/a&gt; response be sampled&#10;sufficiently densely so that interpolating linearly between samples does&#10;not introduce error greater than the quantization error. We will show that&#10;this condition is satisfied whenever the filter table contains at least&#10;&lt;!-- MATH&#10; $L=2^{1+{n_c}/2}$&#10; --&gt;&lt;img width="98" height="20" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img114.gif" alt="$L=2^{1+{n_c}/2}$" /&gt; entries per zero-crossing, where &lt;img width="23" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img89.gif" alt="${n_c}$" /&gt; is the number of&#10;bits allocated to each table entry.&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;b&gt;&lt;a href="https://ccrma.stanford.edu/~jos//Interpolation/Linear_Interpolation.html" target="_blank"&gt;Linear Interpolation&lt;/a&gt; Error Bound. &lt;/b&gt;&lt;/p&gt;&lt;p&gt;Let &lt;img width="37" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img115.gif" alt="$h(t)$" /&gt; denote the lowpass filter impulse response, and assume it is&#10;twice continuously differentiable for all &lt;img width="12" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img11.gif" alt="$t$" /&gt;. By Taylor's theorem[&lt;a href="https://technick.net/guides/theory/dar/015#Goldstein"&gt;Goldstein&amp;nbsp;1967&lt;/a&gt;, p.&amp;nbsp;119], we have&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;h(t_0+\eta ) = h(t_0) + \eta h^\prime (t_0) + {1\over 2} \eta ^2 h^{\prime\prime}(t_0+\lambda \eta ),&#10;\end{displaymath}&#10; --&gt;&lt;a name="eq:Etaylor"&gt;&lt;/a&gt;&lt;a name="eq:Etaylor"&gt;&lt;/a&gt;&lt;img width="400" height="50" border="0" src="https://technick.net/img/guide_dar/guide_dar_img116.gif" alt="\" egin="" isplaymath="" t="" ta="" t="" ta="" rime="" over="" ta="" prime\prime="" lambda="" ta="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;for some &lt;!-- MATH&#10; $\lambda \in[0,1]$&#10; --&gt;&lt;img width="76" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img117.gif" alt="$\" ambda="" n="" /&gt;, where &lt;!-- MATH&#10; $h^\prime (t_0)$&#10; --&gt;&lt;img width="49" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img118.gif" alt="$h^\" rime="" /&gt; denotes the time derivative of&lt;img width="37" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img115.gif" alt="$h(t)$" /&gt; evaluated at &lt;img width="51" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img119.gif" alt="$t=t_0$" /&gt;, and &lt;!-- MATH&#10; $h^{\prime\prime}(t_0)$&#10; --&gt;&lt;img width="53" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img120.gif" alt="$h^{\" rime\prime="" /&gt; is the second derivative at&lt;img width="19" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img121.gif" alt="$t_0$" /&gt;.&lt;p&gt;The linear interpolation error is defined as&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\tilde{h}(t) \isdef h(t) - \hat{h}(t),&#10;\end{displaymath}&#10; --&gt;&lt;img width="163" height="36" border="0" src="https://technick.net/img/guide_dar/guide_dar_img122.gif" alt="\" egin="" isplaymath="" ilde="" t="" sdef="" hat="" t="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where &lt;img width="84" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img123.gif" alt="$t=t_0+\" ta="" /&gt;, &lt;!-- MATH&#10; $t_0=\lfloor{t}\rfloor$&#10; --&gt;&lt;img width="68" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img124.gif" alt="$t_0=\" floor="" rfloor="" /&gt;, &lt;img width="84" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img125.gif" alt="$\" ta="t-t_0$" /&gt;, and&lt;img width="37" height="45" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img126.gif" alt="$\" at="" t="" /&gt; is the interpolated value given by&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\hat{h}(t) \isdef \overline{\eta }h(t_0) + \eta h(t_1),&#10;\end{displaymath}&#10; --&gt;&lt;a name="eq:Ehh"&gt;&lt;/a&gt;&lt;a name="eq:Ehh"&gt;&lt;/a&gt;&lt;img width="201" height="36" border="0" src="https://technick.net/img/guide_dar/guide_dar_img127.gif" alt="\" egin="" isplaymath="" at="" t="" sdef="" verline="" ta="" t="" ta="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where &lt;!-- MATH&#10; $\overline{\eta }\isdef 1-\eta$&#10; --&gt;&lt;img width="82" height="44" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img128.gif" alt="$\" verline="" ta="" sdef="" ta="" /&gt; and &lt;!-- MATH&#10; $t_1\isdef t_0+1$&#10; --&gt;&lt;img width="91" height="44" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img129.gif" alt="$t_1\" sdef="" /&gt;. Thus &lt;img width="19" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img121.gif" alt="$t_0$" /&gt; and &lt;img width="19" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img130.gif" alt="$t_1$" /&gt; are&#10;successive time instants for which samples of &lt;img width="37" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img115.gif" alt="$h(t)$" /&gt; are available,&#10;and &lt;!-- MATH&#10; $\eta \in [0,1)$&#10; --&gt;&lt;img width="77" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img74.gif" alt="$\" ta="" n="" /&gt; is the linear interpolation factor. (We ignore&#10;errors in the linear interpolation itself at this point.)&lt;p&gt;Expressing &lt;img width="37" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img115.gif" alt="$h(t)$" /&gt; as &lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;h(t_0+\eta ) = \overline{\eta }h(t_0+\eta ) + \eta h(t_1-\overline{\eta })&#10;\end{displaymath}&#10; --&gt;&lt;img width="313" height="36" border="0" src="https://technick.net/img/guide_dar/guide_dar_img131.gif" alt="\" egin="" isplaymath="" t="" ta="" verline="" ta="" t="" ta="" ta="" overline="" ta="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;applying Eq.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/dar/010#eq:Etaylor"&gt;2.6.1&lt;/a&gt;) to both terms on the right-hand side,&#10;and subtracting Eq.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/dar/010#eq:Ehh"&gt;2.6.1&lt;/a&gt;) gives&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\tilde{h}(t_0+\eta ) = \eta \overline{\eta }\left[h^\prime (t_0) -h^\prime (t_1) + {\eta h^{\prime\prime}(\xi _0)+\overline{\eta }h^{\prime\prime}(\xi _1)&#10;&#9;\over 2} \right],&#10;\end{displaymath}&#10; --&gt;&lt;img width="469" height="60" border="0" src="https://technick.net/img/guide_dar/guide_dar_img132.gif" alt="\" egin="" isplaymath="" ilde="" t="" ta="" ta="" verline="" ta="" eft="" prime="" verline="" ta="" prime\prime="" i="" ver="" ight="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where both &lt;img width="21" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img133.gif" alt="$\" i="i" /&gt; and &lt;img width="21" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img134.gif" alt="$\" i="i" /&gt; are in &lt;img width="52" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img135.gif" alt="$[t_0,t_1]$" /&gt;. Defining&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;M_2 \isdef \max_{t} \left|h^{\prime\prime}(t)\right|&#10;\end{displaymath}&#10; --&gt;&lt;img width="151" height="44" border="0" src="https://technick.net/img/guide_dar/guide_dar_img136.gif" alt="\" egin="" isplaymath="" isdef="" ax="" left\vert="" rime\prime="" right\vert="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;and noting that &lt;!-- MATH&#10; $h^\prime (t_1) = h^\prime (t_0) + h^{\prime\prime}(t_0+\lambda )$&#10; --&gt;&lt;img width="223" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img137.gif" alt="$h^\" rime="" h="" rime="" h="" rime\prime="" lambda="" /&gt; for some &lt;!-- MATH&#10; $\lambda \in[0,1]$&#10; --&gt;&lt;img width="76" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img117.gif" alt="$\" ambda="" n="" /&gt;which implies&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\left| h^\prime (t_0) - h^\prime (t_1)\right| \leq M_2,&#10;\end{displaymath}&#10; --&gt;&lt;img width="194" height="36" border="0" src="https://technick.net/img/guide_dar/guide_dar_img138.gif" alt="\" egin="" isplaymath="" eft\vert="" rime="" h="" rime="" right\vert="" eq="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;we obtain the upper bound&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\left|\tilde{h}(t_0+\eta )\right| \leq \eta \overline{\eta }\left[M_2 + {M_2\over 2}\right]\leq {3\over 8} M_2.&#10;\end{displaymath}&#10; --&gt;&lt;a name="eq:Egbound"&gt;&lt;/a&gt;&lt;a name="eq:Egbound"&gt;&lt;/a&gt;&lt;img width="324" height="52" border="0" src="https://technick.net/img/guide_dar/guide_dar_img139.gif" alt="\" egin="" isplaymath="" eft\vert\tilde="" t="" ta="" ight\vert="" eq="" ta="" verline="" ta="" eft="" m="" ver="" ight="" eq="" ver="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;b&gt;Application to the Ideal Lowpass Filter. &lt;/b&gt;&lt;/p&gt;&lt;p&gt;For the ideal lowpass filter, we have&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;h(t) = \mbox{sinc}(\omega_L t/ \pi) \isdef {\sin(\omega_L t)\over \omega_L t} &#10;&#9;= {1\over \omega_L}\int_0^{\omega_L}\cos(\omega t)\do ,&#10;\end{displaymath}&#10; --&gt;&lt;a name="eq:Ehint"&gt;&lt;/a&gt;&lt;a name="eq:Ehint"&gt;&lt;/a&gt;&lt;img width="439" height="55" border="0" src="https://technick.net/img/guide_dar/guide_dar_img140.gif" alt="\" egin="" isplaymath="" t="" box="" inc="" mega="" pi="" sdef="" in="" mega="" l="" ver="" mega="" int="" mega="" cos="" mega="" o="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where &lt;!-- MATH&#10; $\omega_L=\pi/L$&#10; --&gt;&lt;img width="85" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img141.gif" alt="$\" mega="" pi="" l="" /&gt;, and &lt;img width="66" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img142.gif" alt="$L=2^{{n_l}}$" /&gt; is the number of table entries per&#10;zero-crossing. &#10;Note that the rightmost form in Eq.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/dar/010#eq:Ehint"&gt;2.6.1&lt;/a&gt;) is simply&#10;the inverse Fourier transform of the ideal lowpass-filter &lt;a href="https://technick.net/guides/theory/edft/012"&gt;frequency&#10;response&lt;/a&gt;. Twice differentiating with respect to &lt;img width="12" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img11.gif" alt="$t$" /&gt;, we obtain&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;h^{\prime\prime}(t) = -{1\over\omega_L}\int_0^{\omega_L} \omega^2\cos(\omega t) \do,&#10;\end{displaymath}&#10; --&gt;&lt;a name="eq:Ehppint"&gt;&lt;/a&gt;&lt;a name="eq:Ehppint"&gt;&lt;/a&gt;&lt;img width="255" height="53" border="0" src="https://technick.net/img/guide_dar/guide_dar_img143.gif" alt="\" egin="" isplaymath="" prime\prime="" over\omega="" int="" mega="" omega="" os="" mega="" o="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;from which it follows that the maximum magnitude is&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;M_2 = {\omega_L^2\over 3} = {\pi^2\over 3L^2}.&#10;\end{displaymath}&#10; --&gt;&lt;a name="eq:Esmt"&gt;&lt;/a&gt;&lt;a name="eq:Esmt"&gt;&lt;/a&gt;&lt;img width="151" height="53" border="0" src="https://technick.net/img/guide_dar/guide_dar_img144.gif" alt="\" egin="" isplaymath="" omega="" over="" i="" ver="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Note that this bound is attained at &lt;img width="46" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img28.gif" alt="$t=0$" /&gt;. Substituting Eq.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/dar/010#eq:Esmt"&gt;2.6.1&lt;/a&gt;)&#10;into Eq.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/dar/010#eq:Egbound"&gt;2.6.1&lt;/a&gt;), we obtain the error bound&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\left|\tilde{h}(t_0+\eta )\right| \leq {\pi^2\over 8 L^2} &lt; &#10;{1.234\over L^2} = 1.234\cdot2^{-2{n_l}}.&#10;\end{displaymath}&#10; --&gt;&lt;a name="eq:Esbound"&gt;&lt;/a&gt;&lt;a name="eq:Esbound"&gt;&lt;/a&gt;&lt;img width="372" height="53" border="0" src="https://technick.net/img/guide_dar/guide_dar_img145.gif" alt="\" egin="" isplaymath="" eft\vert\tilde="" t="" ta="" ight\vert="" eq="" i="" ver="" lt="" ver="" dot2="" l="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Thus for the ideal lowpass filter &lt;!-- MATH&#10; $h(t)=\mbox{sinc}(t/L)$&#10; --&gt;&lt;img width="135" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img146.gif" alt="$h(t)=\" box="" inc="" l="" /&gt;, the pointwise&#10;error in the interpolated lookup of &lt;img width="37" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img115.gif" alt="$h(t)$" /&gt; is bounded by &lt;img width="77" height="38" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img147.gif" alt="$1.234/L^2$" /&gt;.&#10;This means that &lt;img width="21" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img52.gif" alt="${n_l}$" /&gt; must be about half the coefficient word-length &lt;img width="23" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img89.gif" alt="${n_c}$" /&gt;used for the filter coefficients. For example, if &lt;img width="37" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img115.gif" alt="$h(t)$" /&gt; is quantized to&lt;img width="23" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img148.gif" alt="$16$" /&gt; bits, &lt;img width="17" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img6.gif" alt="$L$" /&gt; must be of the order of &lt;img width="95" height="21" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img149.gif" alt="$2^{16/2}=256$" /&gt;. In contrast, we&#10;will show that without linear interpolation, &lt;img width="21" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img52.gif" alt="${n_l}$" /&gt; must increase&#10;proportional to &lt;img width="23" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img89.gif" alt="${n_c}$" /&gt; for &lt;img width="23" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img89.gif" alt="${n_c}$" /&gt;-bit samples of &lt;img width="37" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img115.gif" alt="$h(t)$" /&gt;. In the &lt;img width="23" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img148.gif" alt="$16$" /&gt;-bit&#10;case, this gives &lt;!-- MATH&#10; $L\sim 2^{16}=65536$&#10; --&gt;&lt;img width="138" height="20" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img150.gif" alt="$L\" im="" /&gt;. The use of linear interpolation&#10;of the filter coefficients reduces the memory requirements considerably.&lt;p&gt;The error bounds obtained for the ideal lowpass filter are typically&#10;accurate also for lowpass filters used in practice. This is because the&#10;error bound is a function of &lt;img width="30" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img151.gif" alt="$M_2$" /&gt;, the maximum curvature of the impulse&#10;response &lt;img width="37" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img115.gif" alt="$h(t)$" /&gt;, and most lowpass designs will have a value of &lt;img width="30" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img151.gif" alt="$M_2$" /&gt; very&#10;close to that of the ideal case. The maximum curvature is determined&#10;primarily by the bandwidth of the filter since, generalizing equations&#10;Eq.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/dar/010#eq:Ehint"&gt;2.6.1&lt;/a&gt;) and Eq.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/dar/010#eq:Ehppint"&gt;2.6.1&lt;/a&gt;),&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;h^{\prime\prime}(0) = -{1\over\pi}\int_0^{\pi} \omega^2 H(\omega) \do,&#10;\end{displaymath}&#10; --&gt;&lt;img width="217" height="50" border="0" src="https://technick.net/img/guide_dar/guide_dar_img152.gif" alt="\" egin="" isplaymath="" prime\prime="" ver\pi="" nt="" i="" mega="" omega="" o="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;which is just the second moment of the lowpass-filter frequency response&lt;img width="49" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img153.gif" alt="$H(\" mega="" /&gt; (which is real for symmetric FIR filters obtained by&#10;symmetrically windowing the ideal sinc function [&lt;a href="https://technick.net/guides/theory/dar/015#RabinerAndGold"&gt;Rabiner and Gold&amp;nbsp;1975&lt;/a&gt;]). A&#10;lowpass-&lt;a href="https://ccrma.stanford.edu/~jos//WinFlt/Problem_Statement.html" target="_blank"&gt;filter design&lt;/a&gt; will move the cut-off frequency slightly below that&#10;of the ideal lowpass filter in order to provide a ``transition band'' which&#10;allows the filter response to give sufficient rejection at the ideal&#10;cut-off frequency which is where aliasing begins. Therefore, in a well&#10;designed practical lowpass filter, the error bound &lt;img width="30" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img151.gif" alt="$M_2$" /&gt; should be lower&#10;than in the ideal case.&lt;p&gt;&lt;br /&gt;&lt;b&gt;Relation of Interpolation Error to Quantization Error. &lt;/b&gt;&lt;/p&gt;&lt;p&gt;If &lt;!-- MATH&#10; $h(t)\in[-1,1-2^{-{n_c}}]$&#10; --&gt;&lt;img width="171" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img154.gif" alt="$h(t)\" n="" c="" /&gt; is approximated by &lt;img width="44" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img155.gif" alt="$h_q(t)$" /&gt; which is&#10;represented in two's complement fixed-pointarithmetic, then&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;h_q(t_0) = -b_0 + \sum_{i=1}^{{n_c}-1} b_i 2^{-i},&#10;\end{displaymath}&#10; --&gt;&lt;img width="223" height="64" border="0" src="https://technick.net/img/guide_dar/guide_dar_img156.gif" alt="\" egin="" isplaymath="" q="q" t="" b="" um="" n="" c="" b="b" i="i" i="i" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where &lt;img width="88" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img157.gif" alt="$b_i\" n\="" /&gt; is the &lt;img width="11" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img158.gif" alt="$i$" /&gt;th bit,&#10;and the worst-case rounding error is &lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\left|h(t)-h_q(t)\right| \leq 2^{-{n_c}}.&#10;\end{displaymath}&#10; --&gt;&lt;img width="186" height="37" border="0" src="https://technick.net/img/guide_dar/guide_dar_img159.gif" alt="\" egin="" isplaymath="" eft\vert="" h="" q="" right\vert="" eq="" c="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Letting &lt;!-- MATH&#10; $h_q(t_i)=h(t_i)+\epsilon _i$&#10; --&gt;&lt;img width="148" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img160.gif" alt="$h_q(t_i)=h(t_i)+\" psilon="" i="" /&gt;, where &lt;!-- MATH&#10; $|\epsilon _i|\leq2^{-{n_c}}$&#10; --&gt;&lt;img width="89" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img161.gif" alt="$\" ert\epsilon="" vert\leq2="" c="" /&gt;,&#10;the interpolated look-up becomes&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\hat{h}_q(t_0+\eta ) = \overline{\eta }h_q(t_0) + \eta h_q(t_1)&#10;&#9; = \hat{h}(t_0+\eta ) + \overline{\eta }\epsilon _0 + \eta \epsilon _1.&#10;\end{displaymath}&#10; --&gt;&lt;img width="484" height="37" border="0" src="https://technick.net/img/guide_dar/guide_dar_img162.gif" alt="\" egin="" isplaymath="" at="" q="q" t="" ta="" verline="" ta="" q="q" t="" ta="" q="" t="" ta="" verline="" ta="" psilon="" ta="" psilon="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Thus the error in the interpolated&#10;lookup between quantized filter coefficients is bounded by&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\left|\tilde{h}_q(t)\right| \leq {3\over 8} M_2 + 2^{-{n_c}},&#10;\end{displaymath}&#10; --&gt;&lt;img width="192" height="50" border="0" src="https://technick.net/img/guide_dar/guide_dar_img163.gif" alt="\" egin="" isplaymath="" eft\vert\tilde="" q="q" t="" ight\vert="" eq="" ver="" n="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;which, in the case of &lt;!-- MATH&#10; $h(t)=\mbox{sinc}(t/L)$&#10; --&gt;&lt;img width="135" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img146.gif" alt="$h(t)=\" box="" inc="" l="" /&gt;, can be written&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\left|\tilde{h}_q(t)\right| &lt; {1.234\over L^2} + 2^{-{n_c}}&#10; = 1.234 \cdot 2^{-2{n_l}} + 2^{-{n_c}}.&#10;\end{displaymath}&#10; --&gt;&lt;img width="398" height="50" border="0" src="https://technick.net/img/guide_dar/guide_dar_img164.gif" alt="\" egin="" isplaymath="" eft\vert\tilde="" q="q" t="" ight\vert="" t="" ver="" c="" dot="" l="" c="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;If &lt;!-- MATH&#10; $L=2^{1+{n_c}/2}$&#10; --&gt;&lt;img width="98" height="20" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img114.gif" alt="$L=2^{1+{n_c}/2}$" /&gt;, then &lt;!-- MATH&#10; $|\tilde{h}_q(t)| &lt; 1.5\cdot 2^{-{n_c}}$&#10; --&gt;&lt;img width="153" height="43" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img165.gif" alt="$\" ert\tilde="" q="q" t="" ert="" t="" dot="" c="" /&gt;,&#10;and the interpolation error is less than the quantization error by more&#10;than a factor of &lt;img width="14" height="16" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img111.gif" alt="$2$" /&gt;.&lt;p&gt;&lt;br /&gt;&lt;b&gt;Error in the Absence of Interpolation. &lt;/b&gt;&lt;/p&gt;&lt;p&gt;For comparison purposes, we derive the error incurred when no interpolation&#10;of the filter table is performed. In this case, assuming rounding to the&#10;nearest table entry, we have &lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray}&#10;t &amp; = &amp; t_0+\eta ,\qquad \left|\eta \right|\leq {1\over 2} \\&#10;\hat{h}(t) &amp; = &amp; h(t_0) \\&#10;\tilde{h}(t) &amp; = &amp; h(t) - h(t_0) \\&#10; &amp; = &amp; \eta h^\prime (t_0) + {1\over 2} \eta ^2h^{\prime\prime}(t_0+\lambda \eta ) \\&#10;\left|\tilde{h}(t)\right| &amp; \leq &amp;{M_1\over2} + {M_2\over8},&#10;\end{eqnarray}&#10; --&gt;&lt;table align="CENTER" cellpadding="0" width="100%"&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&lt;img width="13" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img166.gif" alt="$\" isplaystyle="" /&gt;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="21" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img167.gif" alt="$\" extstyle="$" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="173" height="65" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img168.gif" alt="$\" isplaystyle="" ta="" quad="" eft\vert\eta="" ight\vert\leq="" ver="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(5)&lt;/td&gt;&lt;/tr&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&lt;img width="41" height="50" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img169.gif" alt="$\" isplaystyle="" at="" t="" /&gt;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="21" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img167.gif" alt="$\" extstyle="$" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="49" height="41" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img170.gif" alt="$\" isplaystyle="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(6)&lt;/td&gt;&lt;/tr&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&lt;img width="41" height="48" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img171.gif" alt="$\" isplaystyle="" ilde="" t="" /&gt;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="21" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img167.gif" alt="$\" extstyle="$" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="110" height="41" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img172.gif" alt="$\" isplaystyle="" h="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(7)&lt;/td&gt;&lt;/tr&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&amp;nbsp;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="21" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img167.gif" alt="$\" extstyle="$" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="225" height="65" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img173.gif" alt="$\" isplaystyle="" ta="" rime="" over="" ta="" prime\prime="" lambda="" ta="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(8)&lt;/td&gt;&lt;/tr&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&lt;img width="52" height="51" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img174.gif" alt="$\" isplaystyle="" eft\vert\tilde="" t="" ight\vert="" /&gt;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="22" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img175.gif" alt="$\" extstyle="" eq="" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="101" height="66" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img176.gif" alt="$\" isplaystyle="" over2="" over8="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(9)&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;where &lt;!-- MATH&#10; $M_1 \isdef \max_{t} |h^\prime (t)|$&#10; --&gt;&lt;img width="146" height="44" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img177.gif" alt="$M_1 \" sdef="" ax="" vert="" rime="" vert="" /&gt;. For the ideal lowpass, we&#10;have&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;h^\prime (t) = -{1\over\omega_L}\int_0^{\omega_L}\omega\sin(\omega t) d\omega&#10;&#9;= {\omega_L t\cos(\omega_L t) - \sin(\omega_L t)\over \omega_L t^2} .&#10;\end{displaymath}&#10; --&gt;&lt;img width="505" height="55" border="0" src="https://technick.net/img/guide_dar/guide_dar_img178.gif" alt="\" egin="" isplaymath="" prime="" over\omega="" int="" mega="" omega\sin="" a="" cos="" mega="" sin="" mega="" over="" mega="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Note that &lt;!-- MATH&#10; $h^\prime (L)=1/L$&#10; --&gt;&lt;img width="104" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img179.gif" alt="$h^\" rime="" l="" /&gt; and &lt;!-- MATH&#10; $|h^\prime (t)| &lt; \omega_L/2 = \pi/2L$&#10; --&gt;&lt;img width="185" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img180.gif" alt="$\" ert="" rime="" vert="" t="" mega="" pi="" /&gt;. Thus&lt;img width="87" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img181.gif" alt="$M_1=a/L$" /&gt; where &lt;!-- MATH&#10; $1\leq a &lt;\pi/2$&#10; --&gt;&lt;img width="104" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img182.gif" alt="$1\" eq="" t="" i="" /&gt;. The no-interpolation error bound is then&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\left|h^\prime (t)\right| \leq {a\over2L} + {\pi^2\over24L^2} &lt; {0.7854\over L} + &#10;{0.4113\over L^2}.&#10;\end{displaymath}&#10; --&gt;&lt;img width="360" height="53" border="0" src="https://technick.net/img/guide_dar/guide_dar_img183.gif" alt="\" egin="" isplaymath="" eft\vert="" rime="" right\vert="" eq="" over2l="" i="" ver24l="" t="" ver="" ver="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>10. Difference Equation</title><link>https://technick.net/guides/theory/edft/010/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/edft/010/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/filters/"&gt;Introduction to Digital Filters with Audio Applications&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, Copyright &amp;#169; &lt;i&gt;2017-11-26&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/edft/009"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/000"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/022"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/011"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;Difference Equation&lt;/h3&gt;&lt;p&gt;&lt;a name="2321"&gt;&lt;/a&gt;&lt;a name="2327"&gt;&lt;/a&gt;&lt;b&gt;Definition. &lt;/b&gt;The &lt;i&gt;&lt;a href="https://technick.net/guides/theory/edft/010"&gt;difference equation&lt;/a&gt;&lt;/i&gt;&lt;a name="2347"&gt;&lt;/a&gt; for a general linear time-invariant (&lt;a href="https://technick.net/guides/theory/edft/009"&gt;LTI&lt;/a&gt;)&lt;a href="http://www.dsptutor.freeuk.com/dfilt1.html" target="_blank"&gt;digital filter&lt;/a&gt; is given by&lt;br /&gt;&lt;div align="CENTER"&gt;&lt;a name="eq:gde"&gt;&lt;/a&gt;&lt;!-- MATH&#10; \begin{eqnarray}&#10;y(n) = b_0\,x(n) &amp;+&amp; b_1\,x(n-1) +\,\cdots\, + b_{n_b}\,x(n-{n_b}) \\&#10;&#9;&amp;-&amp; a_1\,y(n-1) - \,\cdots\, -a_{n_a}\,y(n-{n_a})&#10;\end{eqnarray}&#10; --&gt;&lt;table align="CENTER" cellpadding="0" width="100%"&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&lt;img width="133" height="41" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img219.gif" alt="$\" isplaystyle="" b="b" x="" /&gt;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="21" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img220.gif" alt="$\" extstyle="" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="299" height="41" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img221.gif" alt="$\" isplaystyle="" n-1="" dots="" b="" b="b" x="" n="" b="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(42)&lt;/td&gt;&lt;/tr&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&amp;nbsp;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="22" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img222.gif" alt="$\" extstyle="" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="305" height="41" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img223.gif" alt="$\" isplaystyle="" n-1="" dots="" a="" a="a" y="" n="" a="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(43)&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;where &lt;img width="15" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img224.gif" alt="$x$" /&gt; is the input signal, &lt;img width="15" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img225.gif" alt="$y$" /&gt; is the output signal, and the&#10;constants &lt;img width="28" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img226.gif" alt="$\" b="b" i="i" /&gt;, &lt;!-- MATH&#10; $i=0,1,2,\ldots,{n_b}\}$&#10; --&gt;&lt;img width="150" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img227.gif" alt="$i=0,1,2,\" dots="" b="b" /&gt;, &lt;img width="30" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img228.gif" alt="$\" a="a" i="i" /&gt;,&#10;&lt;!-- MATH&#10; $i=1,2,\ldots,{n_a}\}$&#10; --&gt;&lt;img width="134" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img229.gif" alt="$i=1,2,\" dots="" a="a" /&gt; are called &lt;i&gt;difference equation&#10;coefficients&lt;/i&gt;&lt;a name="2357"&gt;&lt;/a&gt;, or more simply, &lt;i&gt;&lt;a href="https://technick.net/guides/theory/edft/010"&gt;filter&lt;/a&gt; coefficients&lt;/i&gt;&lt;a name="2359"&gt;&lt;/a&gt;. When the&lt;img width="15" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img230.gif" alt="$a$" /&gt; and &lt;img width="13" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img231.gif" alt="$b$" /&gt; coefficients are real numbers, then the filter is said to&#10;be &lt;i&gt;real&lt;/i&gt;&lt;a name="2361"&gt;&lt;/a&gt;.&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;Equation Eq.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/edft/010#eq:gde"&gt;43&lt;/a&gt;) represents only &lt;i&gt;&lt;a href="https://technick.net/guides/theory/edft/010"&gt;causal&lt;/a&gt;&lt;/i&gt; LTI&#10;filters. A filter is said to be &lt;i&gt;causal&lt;/i&gt;&lt;a name="2365"&gt;&lt;/a&gt; when the output does&#10;not depend on any ``future'' inputs. (In more colorful terms, a&#10;filter is causal if it does not ``laugh'' before it is ``tickled.'')&lt;/p&gt;&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;The &lt;i&gt;maximum time span&lt;/i&gt;, in samples, used in creating&#10;each output sample is called the order&lt;a name="2367"&gt;&lt;/a&gt; of&#10;the filter. In&#10;Eq.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/edft/010#eq:gde"&gt;43&lt;/a&gt;), the order is the larger of &lt;img width="22" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img232.gif" alt="${n_b}$" /&gt; and &lt;img width="24" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img233.gif" alt="${n_a}$" /&gt;. Since &lt;img width="22" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img232.gif" alt="${n_b}$" /&gt;and &lt;img width="24" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img233.gif" alt="${n_a}$" /&gt; in Eq.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/edft/010#eq:gde"&gt;43&lt;/a&gt;) are assumed finite, Eq.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/edft/010#eq:gde"&gt;43&lt;/a&gt;) represents the&#10;class of &lt;i&gt;finite order&lt;/i&gt; causal LTI filters.&lt;/p&gt;&lt;p&gt;In addition to difference equation coefficients, any LTI filter may be&#10;represented in the time domain by its response to a specific signal&#10;called the &lt;i&gt;&lt;a href="https://technick.net/guides/theory/edft/010#2321"&gt;impulse&lt;/a&gt;&lt;/i&gt;.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;The &lt;i&gt;impulse&lt;/i&gt;&lt;a name="2377"&gt;&lt;/a&gt; is denoted as &lt;img width="39" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img234.gif" alt="$\" elta="" /&gt; and is defined by&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\delta(n)\isdef \left\{ {1,\;n=0}\atop{0,\;n\neq 0} \right..&#10;\end{displaymath}&#10; --&gt;&lt;img width="170" height="60" border="0" src="https://technick.net/img/guide_edft/guide_edft_img235.gif" alt="\" egin="" isplaymath="" elta="" isdef="" eft\="" atop="" n\neq="" ight="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;The &lt;i&gt;impulse response&lt;/i&gt;&lt;a name="2380"&gt;&lt;/a&gt; of a filter is the response of&#10;the filter to &lt;img width="39" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img234.gif" alt="$\" elta="" /&gt; and is most often denoted &lt;img width="41" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img70.gif" alt="$h(n)$" /&gt;. &lt;/p&gt;&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;A filter is said to be &lt;i&gt;&lt;a href="https://technick.net/guides/theory/edft/010#2327"&gt;stable&lt;/a&gt;&lt;/i&gt;&lt;a name="2383"&gt;&lt;/a&gt; if&#10;the impulse response &lt;img width="41" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img70.gif" alt="$h(n)$" /&gt; approaches zero as &lt;img width="16" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img206.gif" alt="$n$" /&gt; goes to infinity.&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>10. Getting the Most from your Batteries</title><link>https://technick.net/guides/electronics/bpw/c10_01/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c10_01/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c09_03"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c10_02"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;10. Getting the Most from your Batteries&lt;/h3&gt;&lt;p&gt; A common difficulty with portable equipment is the gradual decline &#10; in battery performance after the first year of service. Although &#10; fully charged, the battery eventually regresses to a point where &#10; the available energy is less than half of its original capacity, &#10; resulting in unexpected downtime. &#10; &lt;/p&gt;&lt;p&gt;&lt;img width="201" height="126" src="https://technick.net/img/guide_bpw2/c10_01.gif" align="left" hspace="19" vspace="19" alt="Text Box: In many ways, a rechargeable battery exhibits human-like characteristics." v:shapes="_x0000_s1026" border="0" /&gt;Downtime almost always occurs at critical moments. This &#10; is especially true in the public safety sector where portable &#10; equipment runs as part of a fleet operation and the battery &#10; is charged in a pool setting, often with minimal care and &#10; attention. Under normal conditions, the battery will hold &#10; enough power to last the day. During heavy activities and &#10; longer than expected duties, a marginal battery cannot provide &#10; the extra power needed and the equipment fails.&lt;/p&gt;</description></item><item><title>10. Getting the Most from your Batteries 2</title><link>https://technick.net/guides/electronics/bpw/c10_02/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c10_02/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c10_01"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c10_03"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;10.2 How to Restore and Prolong Nickel-based Batteries&lt;/h4&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;The effects of crystalline formation are most &#10; pronounced if a nickel-based battery is left in the charger &#10; for days, or if repeatedly recharged without a periodic full &#10; discharge. Since most applications do not use up all energy &#10; before recharge, a periodic discharge to 1V/cell (known as &#10; exercise) is essential to prevent the buildup of crystalline &#10; formation on the cell plates. This maintenance is most critical &#10; for the NiCd battery.&lt;/p&gt; &lt;p&gt;All NiCd batteries in regular use and on standby &#10; mode (sitting in a charger for operational readiness) should &#10; be exercised once per month. Between these monthly exercise &#10; cycles, no further service is needed. The battery can be used &#10; with any desired user pattern without the concern of memory.&lt;/p&gt; &lt;p&gt;The NiMH battery is affected by memory also, &#10; but to a lesser degree. No scientific research is available &#10; that compares NiMH with NiCd in terms of memory degradation. &#10; Neither is information on hand that suggests the optimal amount &#10; of maintenance required to obtain maximum battery life. Applying &#10; a full discharge once every three months appears right. Because &#10; of the NiMH battery’s shorter cycle life, over-exercising &#10; is not recommended.&lt;/p&gt; &lt;p&gt;A hand towel must be cleaned periodically. However, &#10; if it were washed after each use, its fabric would wear out &#10; very quickly. In the same way, it is neither necessary nor &#10; advisable to discharge a rechargeable battery before each &#10; charge — excessive cycling puts extra strain on the battery.&lt;/p&gt; &lt;p&gt;&lt;b&gt;Exercise and Recondition&lt;/b&gt; — Research has &#10; shown that if no exercise is applied to a NiCd for three months &#10; or more, the crystals ingrain themselves, making them more &#10; difficult to break up. In such a case, exercise is no longer &#10; effective in restoring a battery and reconditioning is required. &#10; Recondition is a slow, deep discharge that removes the remaining &#10; battery energy by draining the cells to a voltage threshold &#10; below 1V/cell. &lt;/p&gt; &lt;p&gt;&lt;img width="432" height="346" src="https://technick.net/img/guide_bpw2/c10_06.gif" v:shapes="_x0000_i1026" border="0" alt="" /&gt;&lt;/p&gt; &lt;p class="caption"&gt;Figure&amp;nbsp;10-2:&amp;nbsp; Exercising and reconditioning &#10; batteries on a Cadex battery analyzer.&lt;br /&gt; &lt;span class="caption-sub"&gt;This illustration shows the battery &#10; voltage during a normal discharge to 1V, followed by the secondary &#10; discharge (recondition). Recondition consists of a discharge &#10; to 1V/cell at a 1C load current, followed by a secondary discharge &#10; to 0.4V at a much reduced current. NiCd batteries affected &#10; by memory often restore themselves to full service.&lt;/span&gt;&lt;/p&gt; &lt;p&gt;Tests performed by the US Army have shown that &#10; a NiCd cell needs to be discharged to at least 0.6V to effectively &#10; break up the more resistant crystalline formation. During &#10; recondition, the current must be kept low to prevent cell &#10; reversal. Figure&amp;nbsp;10-2 illustrates the battery voltage &#10; during normal discharge to 1V/cell followed by the secondary &#10; discharge (recondition).&lt;/p&gt; &lt;p&gt;Figure&amp;nbsp;10-3 illustrates the effects &#10; of exercise and recondition. Four batteries afflicted with &#10; various degrees of memory are serviced. The batteries are &#10; first fully charged, then discharged to 1V/cell. The resulting &#10; capacities are plotted on a scale of 0 to 120&amp;nbsp;percent &#10; in the first column. Additional discharge/charge cycles are &#10; applied and the battery capacities are plotted in the subsequent &#10; columns. The solid black line represents exercise, (discharge &#10; to 1V/cell) and the dotted line recondition (secondary discharge &#10; at reduced current to 0.4V/cell). On this test, the exercise &#10; and recondition cycles are applied manually at the discretion &#10; of the research technician.&lt;/p&gt; &lt;p&gt;&lt;img width="463" height="270" src="https://technick.net/img/guide_bpw2/c10_07.gif" v:shapes="_x0000_i1027" border="0" alt="" /&gt;&lt;/p&gt; &lt;p class="caption"&gt;Figure&amp;nbsp;10-3:&amp;nbsp; Effects of exercise and &#10; recondition.&lt;br /&gt; &lt;span class="caption-sub"&gt;Battery A improved capacity on exercise &#10; alone; batteries B and C required recondition. A new battery &#10; with excellent readings improved further with recondition.&lt;/span&gt;&lt;/p&gt; &lt;p&gt;Battery A responded well to exercise alone and &#10; no recondition was required. This result is typical of a battery &#10; that has been in service for only a few months or has received &#10; periodic exercise cycles. Batteries B and C, on the other &#10; hand, required recondition (dotted line) to restore their &#10; performance. Without the recondition function, these two batteries &#10; would need to be replaced.&lt;/p&gt; &#10; &lt;/blockquote&gt;</description></item><item><title>10. Getting the Most from your Batteries 3</title><link>https://technick.net/guides/electronics/bpw/c10_03/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c10_03/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c10_02"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c10_04"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;After service, the restored batteries were returned &#10; to full use. When examined after six months of field use, &#10; no noticeable degradation in the restored performance was &#10; visible. The regained capacity was permanent with no evidence &#10; of falling back to the previous state. Obviously, the batteries &#10; would need to be serviced on a regular basis to maintain the &#10; performance.&lt;/p&gt; &lt;p&gt;Applying the recondition cycle on a new battery &#10; (top line on chart) resulted in a slight capacity increase. &#10; This capacity gain is not fully understood, other than to &#10; assume that the battery improved by additional formatting. &#10; Another explanation is the presence of early memory. Since &#10; new batteries are stored with some charge, the self-discharge &#10; that occurs during storage contributes to a certain amount &#10; of crystalline formation. Exercising and reconditioning reverse &#10; this effect. This is why the manufacturers recommend storing &#10; rechargeable batteries at about 40&amp;nbsp;percent charge.&lt;/p&gt; &lt;p&gt;The importance of exercising and reconditioning &#10; NiCd batteries is emphasized further by a study carried out &#10; by GTE Government Systems in Virginia, USA, for the US Navy. &#10; To determine the&amp;nbsp;percentage of batteries needing replacement &#10; within the first year of use, one group of batteries received &#10; charge only, another group was exercised and a third group &#10; received recondition. The batteries studied were used for &#10; two-way radios on the aircraft carriers USS Eisenhower with &#10; 1500 batteries and USS George Washington with 600&amp;nbsp;batteries, &#10; and the destroyer USS Ponce with 500&amp;nbsp;batteries.&lt;/p&gt; &lt;p&gt;With charge only (charge-and-use), the annual&amp;nbsp;percentage &#10; of battery failure on the USS Eisenhower was 45&amp;nbsp;percent &#10; (see Figure&amp;nbsp;10-4). When applying exercise, the &#10; failure rate was reduced to 15&amp;nbsp;percent. By far the best &#10; results were achieved with recondition. The failure rate dropped &#10; to 5&amp;nbsp;percent. Identical results were attained from the &#10; USS George Washington and the USS Ponce.&lt;br /&gt; &lt;/p&gt; &lt;table border="0" cellspacing="0" cellpadding="3" width="100%"&gt; &lt;tr&gt; &#10; &lt;td colspan="2" valign="top"&gt; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="54%" valign="top" bgcolor="#E6E6E6"&gt; &lt;b class="table-bolder"&gt;Maintenance &#10; Method&lt;/b&gt;&lt;/td&gt; &lt;td width="45%" valign="top" bgcolor="#E6E6E6"&gt; &lt;b class="table-bolder"&gt;Annual&amp;nbsp;Percentage &#10; of Batteries &lt;br /&gt; Requiring Replacement&lt;/b&gt;&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td colspan="2" valign="top"&gt; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="54%" valign="top"&gt; Charge only (charge-and-use)&lt;/td&gt; &lt;td width="45%" valign="top"&gt; 45%&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="54%" valign="top" bgcolor="#F3F3F3"&gt; Exercise &#10; only (discharge to 1V/cell)&lt;/td&gt; &lt;td width="45%" valign="top" bgcolor="#F3F3F3"&gt; 15%&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="54%" valign="top"&gt; Reconditioning (secondary &#10; deep discharge)&lt;/td&gt; &lt;td width="45%" valign="top"&gt; 5%&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td colspan="2" valign="top"&gt; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;p class="caption"&gt;Figure&amp;nbsp;10-4:&amp;nbsp; Replacement rates of NiCd &#10; batteries.&lt;br /&gt; &lt;span class="caption-sub"&gt;The annual&amp;nbsp;percentage of NiCd &#10; batteries requiring replacement when used without any maintenance &#10; decreases with exercise and recondition. These statistics &#10; were drawn from batteries used by the US Navy on the USS Eisenhower, &#10; USS George Washington and USS Ponce.&lt;/span&gt;&lt;/p&gt; &lt;p&gt;The GTE Government System report concluded that &#10; a battery analyzer featuring exercise and recondition functions &#10; costing $2,500US would pay for itself in less than one month &#10; on battery savings alone. The report did not address the benefits &#10; of increased system reliability, an issue that is of equal &#10; if not greater importance, especially when the safety of human &#10; lives is at stake.&lt;/p&gt; &lt;p&gt;Another study involving NiCd batteries for defense &#10; applications was performed by the Dutch Army. This involved &#10; battery packs that had been in service for 2&amp;nbsp;to&amp;nbsp;3 &#10; years during the Balkan War. The Dutch Army was aware that &#10; the batteries were used under the worst possible conditions. &#10; Rather than a good daily workout, the packs were used for &#10; patrol duties lasting 2&amp;nbsp;to 3&amp;nbsp;hours per day. The &#10; rest of the time the batteries remained in the chargers for &#10; operational readiness.&lt;/p&gt; &lt;p&gt;After the war, the batteries were sent to the &#10; Dutch Military Headquarters and were tested with Cadex &lt;i&gt;7000 &#10; Series&lt;/i&gt; battery analyzers. The test technician found that &#10; the capacity of some packs had dropped to as low as 30&amp;nbsp;percent. &#10; With the recondition function, 90&amp;nbsp;percent of the batteries &#10; restored themselves to full field use. The Dutch Army set &#10; the target capacity threshold for field acceptability to 80&amp;nbsp;percent. &#10; This setting is the pass/fail acceptance level for their batteries.&lt;/p&gt; &lt;p&gt;Based on the successful reconditioning results, &#10; the Dutch Army now assigns the battery maintenance duty to &#10; individual battalions. The program calls for a service once &#10; every two months. Under this regime, the Army reports reduced &#10; battery failure and prolonged service life. The performance &#10; of each battery is known at any time and any under-performing &#10; battery is removed before it causes a problem.&lt;/p&gt; &lt;p&gt;NiCd batteries remain the preferred chemistry &#10; for mobile communications, both in civil and defense applications. &#10; The main reason for its continued use is dependable and enduring &#10; service under difficult conditions. Other chemistries have &#10; been tested and found problematic in long-term&amp;nbsp;use.&lt;/p&gt; &lt;p&gt;During the later part of the 1990s, the US Army &#10; switched from mainly non-rechargeable to the NiMH battery. &#10; The choice of chemistry was based on the benefit of higher &#10; energy densities as compared to NiCd. The army soon discovered &#10; that the NiMH did not live up to the expected cycle life. &#10; Their reasoning, however, is that the 100&amp;nbsp;cycles attained &#10; from a NiMH pack is still more economical than using a non-rechargeable &#10; equivalent. The army’s focus is now on the Li-ion Polymer, &#10; a system that is more predictable than NiMH and requires little &#10; or no maintenance. The aging issue will likely cause some &#10; logistic concerns, especially if long-term storage is required.&lt;/p&gt; &lt;p&gt;&lt;b&gt;Simple Guidelines &lt;/b&gt;&lt;/p&gt; &lt;p&gt;Do not leave a nickel-based battery in a charger &#10; for more than a day after full charge is reached.&lt;/p&gt; &lt;ul&gt; &lt;li&gt;Apply a monthly full discharge cycle. Running the battery &#10; down in the equipment may do this&amp;nbsp;also.&lt;/li&gt; &lt;li&gt;Do not discharge the battery before each recharge. This &#10; would put undue stress on the battery.&lt;/li&gt; &lt;li&gt;Avoid elevated temperature. A charger should only raise &#10; the battery temperature for a short time at full charge, &#10; and then the battery should cool&amp;nbsp;off.&lt;/li&gt; &lt;li&gt;Use quality chargers to charge batteries.&lt;/li&gt; &lt;/ul&gt; &#10; &lt;/blockquote&gt;</description></item><item><title>10. Getting the Most from your Batteries 4</title><link>https://technick.net/guides/electronics/bpw/c10_04/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c10_04/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c10_03"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c10_05"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;10.3 The Effect of Zapping&lt;/h4&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;To maximize battery performance, remote control &#10; (RC) racing enthusiasts have experimented with all imaginable &#10; methods available. One technique that seems to work is zapping &#10; the cells with a very high pulse current. Zapping is said &#10; to increase the cell voltage slightly, generating more power.&lt;/p&gt; &lt;p&gt;Typically, the racecar motor draws 30A, delivered &#10; by a 7.2V battery. This calculates to over 200W of power. &#10; The battery must endure a race lasting about four minutes.&lt;/p&gt; &lt;p&gt;According to experts, zapping works best with &#10; NiCd cells. NiMH cells have been tried but they have shown &#10; inconsistent results.&lt;/p&gt; &lt;p&gt;Companies specializing in zapping NiCd for RC &#10; racing use a very high quality Japanese NiCd cell. The cells &#10; are normally sub-C in size and are handpicked at the factory &#10; for the application. Specially labeled, the cells are delivered &#10; in a discharged state. When measuring the cell in empty state-of-charge &#10; (SoC), the voltage typically reads between 1.11 to 1.12V. &#10; If the voltage drops lower than 1.06V, the cell is considered &#10; suspect and zapping does not seem to enhance the performance &#10; as well as on the others.&lt;/p&gt; &lt;p&gt;The zapping is done with a 47,000mF capacitor &#10; that is charged to 90V. Best results are achieved if the battery &#10; is cycled twice after treatment, then is zapped again. After &#10; the battery has been in service for a while, zapping no longer &#10; seems to improve the cell’s performance. Neither does zapping &#10; regenerate a cell that has become&amp;nbsp;weak.&lt;/p&gt; &lt;p&gt;The voltage increase on a properly zapped battery &#10; is between 20 and 40mV. This improvement is measured under &#10; a load of 30A. According to experts, the voltage gain is permanent &#10; but there is a small drop with usage and&amp;nbsp;age.&lt;/p&gt; &lt;p&gt;There are no apparent side effects in zapping, &#10; however, the battery manufacturers remain silent about this &#10; treatment. No scientific explanations are available why the &#10; method of zapping improves battery performance. There is little &#10; information available regarding the longevity of the cells &#10; after they have been zapped.&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>10. Getting the Most from your Batteries 5</title><link>https://technick.net/guides/electronics/bpw/c10_05/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c10_05/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c10_04"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c10_06"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;10.4 How to Restore and Prolong Sealed Lead Acid Batteries&lt;/h4&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;The sealed version of the lead acid battery is &#10; designed with a low over-voltage potential to prevent water &#10; depletion. Consequently, the SLA and VRLA systems never get &#10; fully charged and some sulfation will develop over&amp;nbsp;time.&lt;/p&gt; &lt;p&gt;Finding the ideal charge voltage limit for the &#10; sealed lead acid system is critical. Any voltage level is &#10; a compromise. A high voltage limit produces good battery performance, &#10; but shortens the service life due to grid corrosion on the &#10; positive plate. The corrosion is permanent and cannot be reversed. &#10; A low voltage preserves the electrolyte and allows charging &#10; under a wide temperature range, but is subject to sulfation &#10; on the negative plate. (In keeping with portability, this &#10; book focuses on portable SLA batteries. Due to similarities &#10; between the SLA and VRLA systems, references to the VRLA are &#10; made where applicable).&lt;/p&gt; &lt;p&gt;Once the SLA battery has lost capacity due to &#10; sulfation, regaining its performance is often difficult and &#10; time consuming. The metabolism of the SLA battery is slow &#10; and cannot be hurried.&lt;/p&gt; &lt;p&gt;A subtle indication on whether an SLA battery &#10; can be recovered is reflected in the behavior of its discharge &#10; voltage. A fully charged SLA battery that starts its discharge &#10; with a high voltage and tapers off gradually can be reactivated &#10; more successfully than one on which the voltage drops rapidly &#10; when the load is applied.&lt;/p&gt; &lt;p&gt;Reasonably good results in regaining lost capacity &#10; are achieved by applying a charge on top of a charge. This &#10; is done by fully charging an SLA battery, then removing it &#10; for a 24 to 48&amp;nbsp;hour rest period and applying a charge &#10; again. This is repeated several times, then the capacity of &#10; the battery is checked with a full discharge. The SLA is able &#10; to accept some overcharge, however, too long an overcharge &#10; could harm the battery due to corrosion and loss of electrolyte.&lt;/p&gt; &lt;p&gt;The effect of sulfation of the plastic SLA can &#10; be reversed by applying an over-voltage charge of up to 2.50V/cell &#10; for one to two&amp;nbsp;hours. During that time, the battery must &#10; be kept cool and careful observation is necessary. Extreme &#10; caution is required not to raise the cell pressure to venting &#10; point. Most plastic SLA batteries vent at 34&amp;nbsp;kPa (5&amp;nbsp;psi). &#10; Cell venting causes the membrane on some SLA to rupture permanently. &#10; Not only do the escaping gases deplete the electrolyte, they &#10; are also highly flammable! &lt;/p&gt; &lt;p&gt;The VRLA uses a cell self-regulating venting &#10; system that opens and closes the cells based on cell pressure. &#10; Changes in atmospheric pressure contribute to cell venting. &#10; Proper ventilation of the battery room is essential to prevent &#10; the accumulation of hydrogen&amp;nbsp;gas.&lt;/p&gt; &lt;p&gt;&lt;b&gt;Cylindrical SLA&lt;/b&gt; — The cylindrical SLA &#10; (made by Hawker) resembles an enlarged D sized cell. After &#10; long storage, the Hawker cell can be reactivated relatively &#10; easily. If affected by sulfation, the cell voltage under charge &#10; may initially raise up to 5V, absorbing only a small amount &#10; of current. Within about two&amp;nbsp;hours, the small charging &#10; current converts the large sulfate crystals back into active &#10; material. The internal cell resistance decreases and the charge &#10; voltage eventually returns to normal. At a voltage between &#10; 2.10V and 2.40V, the cell is able to accept a normal charge. &#10; To prevent damage, caution must be exercised to limit the &#10; charge current.&lt;/p&gt; &lt;p&gt;The Hawker cells are known to regain full performance &#10; with the described voltage method, leaving few adverse effects. &#10; This, however, does not give credence to store this cell at &#10; a very low voltage. It is always best to follow the manufacturer’s &#10; recommended specifications.&lt;/p&gt; &lt;p&gt;Improving the capacity of an older SLA by cycling &#10; is mostly unsuccessful. Such a battery may simply be worn &#10; out. Cycling would just wear down the battery further. Unlike &#10; nickel-based batteries, the lead acid battery is not affected &#10; by memory.&lt;/p&gt; &lt;p&gt;SLA batteries are commonly rated at a 20-hour &#10; discharge. Even at such a slow rate, a capacity of 100&amp;nbsp;percent &#10; is difficult to obtain. For practical reasons, most battery &#10; analyzers use a 5-hour discharge when servicing SLA batteries. &#10; This typically produces 80 to 90&amp;nbsp;percent of the rated &#10; capacity. SLA batteries are normally overrated and manufacturers &#10; are aware of&amp;nbsp;this.&lt;/p&gt; &lt;p&gt;&lt;span class="warning"&gt;Caution:&lt;/span&gt; When charging an SLA &#10; with over-voltage, current limiting must be applied to protect &#10; the battery. Always set the current limit to the lowest practical &#10; setting and observe the battery voltage and temperature during &#10; charge. Prevent cell venting.&lt;/p&gt; &lt;p class="Standout"&gt;&lt;span class="warning"&gt;Important: &lt;/span&gt;In &#10; case of rupture, leaking electrolyte or any other cause of &#10; exposure to the electrolyte, flush with water immediately. &#10; If eye exposure occurs, flush with water for 15&amp;nbsp;minutes &#10; and consult a physician immediately.&lt;/p&gt; &lt;p&gt;&lt;b&gt;Simple Guidelines&lt;/b&gt;&lt;/p&gt; &lt;ul&gt; &lt;li&gt;Always keep the SLA charged. Never store below 2.10V/cell.&lt;/li&gt; &lt;li&gt;Avoid repeated deep discharges. Charge more often.&lt;/li&gt; &lt;li&gt;If repeated deep discharges cannot be avoided, use a larger &#10; battery to ease the strain.&lt;/li&gt; &lt;li&gt;Prevent sulfation and grid corrosion by choosing the correct &#10; charge and float voltages.&lt;/li&gt; &lt;/ul&gt; &lt;/blockquote&gt;</description></item><item><title>10. Getting the Most from your Batteries 6</title><link>https://technick.net/guides/electronics/bpw/c10_06/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c10_06/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c10_05"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c10_07"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;10.5 How to Prolong Lithium-based Batteries&lt;/h4&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;Today’s battery research is heavily focused on &#10; lithium chemistries, so much so that one could assume that &#10; all future batteries will be lithium systems. Lithium-based &#10; batteries offer many advantages over nickel and lead-based &#10; systems. Although maintenance free, no external service is &#10; known that can restore the battery’s performance once degraded.&lt;/p&gt; &lt;p&gt;&lt;img src="https://technick.net/img/guide_bpw2/c10_08.gif" width="236" height="116" align="right" vspace="19" hspace="19" border="0" alt="" /&gt;In &#10; many respects, Li-ion provides a superior service to other &#10; chemistries, but its performance is limited to a defined lifespan. &#10; The Li-ion battery has a time clock that starts ticking as &#10; soon as the battery leaves the factory. The electrolyte slowly &#10; ‘eats up’ the positive plate and the electrolyte decays. This &#10; chemical change causes the internal resistance to increase. &#10; In time, the cell resistance raises to a point where the battery &#10; can no longer deliver the energy, although it may still be &#10; retained in the battery. Equipment requiring high current &#10; bursts is affected most by the increase of internal resistance.&lt;/p&gt; &lt;p&gt;Battery wear-down on lithium-based batteries &#10; is caused by two activities: actual usage or cycling, and &#10; aging. The wear-down effects by usage and aging apply to all &#10; batteries but this is more pronounced on lithium-based systems.&lt;/p&gt; &lt;p&gt;The Li-ion batteries prefer a shallow discharge. &#10; Partial discharges produce less wear than a full discharge &#10; and the capacity loss per cycle is reduced. A periodic full &#10; discharge is not required because the lithium-based battery &#10; has no memory. A full cycle constitutes a discharge to 3V/cell. &#10; When specifying the number of cycles a lithium-based battery &#10; can endure, manufacturers commonly use an 80&amp;nbsp;percent &#10; depth of discharge. This method resembles a reasonably accurate &#10; field simulation. It also achieves a higher cycle count than &#10; doing full discharges.&lt;/p&gt; &lt;p&gt;&lt;img src="https://technick.net/img/guide_bpw2/c10_09.gif" width="218" height="94" align="right" vspace="19" hspace="19" border="0" alt="" /&gt;In &#10; addition to cycling, the battery ages even if not used. The &#10; amount of permanent capacity loss the battery suffers during &#10; storage is governed by the SoC and temperature. For best results, &#10; keep the battery cool. In addition, store the battery at a &#10; 40&amp;nbsp;percent charge level. Never fully charge or discharge &#10; the battery before storage. The 40&amp;nbsp;percent charge assures &#10; a stable condition even if self-discharge robs some of the &#10; battery’s energy. Most battery manufacturers store Li-ion &#10; batteries at 15&amp;deg;C (59&amp;deg;F) and at 40&amp;nbsp;percent charge.&lt;/p&gt; &lt;p&gt;&lt;b&gt;Simple Guidelines&lt;/b&gt;&lt;/p&gt; &lt;ul&gt; &lt;li&gt;Charge the Li-ion often, except before a long storage. &#10; Avoid repeated deep discharges.&lt;/li&gt; &lt;li&gt;Keep the Li-ion battery cool. Prevent storage in &#10; a hot car. Never freeze a battery.&lt;/li&gt; &lt;li&gt;If your laptop is capable of running without a battery &#10; and fixed power is used most of the time, remove the battery &#10; and store it in a cool place.&lt;/li&gt; &lt;li&gt;Avoid purchasing spare Li-ion batteries for later &#10; use. Observe manufacturing date when purchasing. Do not &#10; buy old stock, even if sold at clearance prices.&lt;/li&gt; &lt;/ul&gt; &lt;/blockquote&gt;</description></item><item><title>10. Getting the Most from your Batteries 7</title><link>https://technick.net/guides/electronics/bpw/c10_07/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c10_07/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c10_06"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c11_01"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;10.6 Battery Recovery Rate&lt;/h4&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;The battery recovery rate by applying controlled &#10; discharge/charge cycles varies with chemistry type, cycle &#10; count, maintenance practices and age of the battery. &lt;img src="https://technick.net/img/guide_bpw2/c10_10.gif" width="156" height="86" align="left" vspace="19" hspace="19" border="0" alt="" /&gt;The &#10; best results are achieved with NiCd. Typically 50&amp;nbsp;to &#10; 70&amp;nbsp;percent of discarded NiCd batteries can be restored &#10; when using the exercise and recondition methods of a Cadex &#10; battery analyzer or equivalent device.&lt;/p&gt; &lt;p&gt;Not all batteries respond equally well to exercise &#10; and recondition services. An older battery may show low and &#10; inconsistent capacity readings with each cycle. Another will &#10; get worse when additional cycles are applied. An analogy can &#10; be made to a very old man for whom exercise is harmful. Such &#10; conditions indicate instabilities caused by aging, suggesting &#10; that this pack should be replaced. In fact, some users of &#10; the Cadex analyzers use the recondition cycle as the acid &#10; test. If the battery gets worse, there is strong evidence &#10; that this battery would not perform well in the field. Applying &#10; the acid test exposes the&amp;nbsp;weak packs, which can no longer &#10; hide behind their stronger peers.&lt;/p&gt; &lt;p&gt;Some older NiCd batteries recover to near original &#10; capacity when serviced. Caution should be applied when ‘rehiring’ &#10; these old-timers because they may exhibit high self-discharge. &#10; If in doubt, a self-discharge test should be carried&amp;nbsp;out.&lt;/p&gt; &lt;p&gt;The recovery rate of the NiMH is about 40&amp;nbsp;percent. &#10; This lower yield is, in part, due to the NiMH’s reduced cycle &#10; count as compared to the NiCd. Some batteries may be afflicted &#10; by heat damage that occurs during incorrect charging. &lt;img src="https://technick.net/img/guide_bpw2/c10_11.gif" width="192" height="90" align="left" vspace="19" hspace="19" border="0" alt="" /&gt;This &#10; deficiency cannot be corrected. Permanent loss of battery &#10; capacity is also caused by prolonged storage at elevated temperatures.&lt;/p&gt; &lt;p&gt;The recovery rate for lead acid batteries is &#10; a low 15&amp;nbsp;percent. Unlike nickel-based batteries, the &#10; restoration of the SLA is not based on reversing crystalline &#10; formation, but rather by reactivating the chemical process. &#10; The reasons for low capacity readings are prolonged storage &#10; at low terminal voltage, and poor charging methods. The battery &#10; also fails due to age and high cycle count.&lt;/p&gt; &lt;p&gt;Lithium-based batteries have a defined age limit. &#10; Once the anticipated cycles have been delivered, no method &#10; exists to improve the battery. The main reason for failure &#10; is high internal resistance caused by oxidation. Operating &#10; the battery at elevated temperatures will momentarily reduce &#10; this condition. When the temperature normalizes, the condition &#10; of high internal resistance returns.&lt;/p&gt; &lt;p&gt;The speed of oxidation depends on the storage &#10; temperature and the battery’s charge state. Keeping the battery &#10; in a cool place can prolong its life. The Li-ion battery &#10; should be stored at 40&amp;nbsp;percent rather than full-charge &#10; state.&lt;/p&gt; &lt;p&gt;An increasing number of modern batteries fall &#10; prey to the cut-off problem induced by a deep discharge. This &#10; is especially evident on Li-ion batteries for&amp;nbsp;mobile &#10; phones. If discharged below 2.5V/cell, the internal protection &#10; circuit often opens. Many chargers cannot apply a recharge &#10; and the battery appears to be&amp;nbsp;dead.&lt;/p&gt; &lt;p&gt;Some battery analyzers feature a boost, or wake-up &#10; function, to activate the protection circuit and enable a &#10; recharge if discharged too low. If the cell voltage has fallen &#10; too low (1.5V/cell and lower) and has remained in that state &#10; for a few days, a recharge should not be attempted because &#10; of safety concerns on the cell(s).&lt;/p&gt; &lt;p&gt;It is often asked whether a restored battery &#10; will work as good as a new one. The breakdown of the crystalline &#10; formation can be considered a full restoration. &lt;img src="https://technick.net/img/guide_bpw2/c10_12.gif" width="258" height="92" align="left" vspace="19" hspace="19" border="0" alt="" /&gt;However, &#10; the crystalline formation will re-occur with time if the battery &#10; is denied the required maintenance.&lt;/p&gt; &lt;p&gt;When the defective component of a machine is &#10; replaced, only the replaced part is new; the rest of the machine &#10; remains in the same condition. If the separator of a nickel-based &#10; battery is damaged by excess heat or is marred by uncontrolled &#10; crystalline formation, that part of the battery will not improve.&lt;/p&gt; &lt;p&gt;Other methods, which claim to restore and prolong &#10; rechargeable batteries, have produced disappointing results. &#10; One method is attaching a strong magnet on the side of the &#10; battery; another is exposing the battery to ultrasound vibrations. &#10; No scientific evidence exists that such methods will improve &#10; battery performance, or restore an ailing battery. &lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>10. THE GLOSSARY</title><link>https://technick.net/guides/hardware/umg/10_000/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/umg/10_000/</guid><description>&lt;hr /&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/hardware/umg/09_003"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;TOC&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt;&lt;h3&gt;10. THE GLOSSARY&lt;/h3&gt;&lt;/p&gt;&lt;p&gt;&lt;center&gt;&lt;b&gt;&lt;a href="#NUM"&gt;#&lt;/a&gt;&lt;a href="#A"&gt;A&lt;/a&gt;&lt;a href="#B"&gt;B&lt;/a&gt;&lt;a href="#C"&gt;C&lt;/a&gt;&lt;a href="#D"&gt;D&lt;/a&gt;&lt;a href="#E"&gt;E&lt;/a&gt;&lt;a href="#F"&gt;F&lt;/a&gt;&lt;a href="#G"&gt;G&lt;/a&gt;&lt;a href="#H"&gt;H&lt;/a&gt;&lt;a href="#I"&gt;I&lt;/a&gt;&lt;a href="#J"&gt;J&lt;/a&gt;&lt;a href="#K"&gt;K&lt;/a&gt;&lt;a href="#L"&gt;L&lt;/a&gt;&lt;a href="#M"&gt;M&lt;/a&gt;&lt;a href="#N"&gt;N&lt;/a&gt;&lt;a href="#O"&gt;O&lt;/a&gt;&lt;a href="#P"&gt;P&lt;/a&gt;&lt;a href="#Q"&gt;Q&lt;/a&gt;&lt;a href="#R"&gt;R&lt;/a&gt;&lt;a href="#S"&gt;S&lt;/a&gt;&lt;a href="#T"&gt;T&lt;/a&gt;&lt;a href="#U"&gt;U&lt;/a&gt;&lt;a href="#V"&gt;V&lt;/a&gt;&lt;a href="#W"&gt;W&lt;/a&gt;&lt;a href="#X"&gt;X&lt;/a&gt;&lt;a href="#Y"&gt;Y&lt;/a&gt;&lt;a href="#Z"&gt;Z&lt;/a&gt;&lt;/b&gt;&lt;/center&gt;&lt;/p&gt;&lt;p&gt;&lt;ul&gt;&lt;a name="NUM"&gt;&lt;/a&gt;&lt;a name="A"&gt;&lt;/a&gt;&lt;li&gt;&lt;b&gt;Accelerated Graphics Port: &lt;/b&gt;(AGP) – An Intel-developed interface that enables high-speed graphics. Graphics&#10;data move between the PC’s graphics controller and computer memory directly,&#10;instead of being cached in video memory.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Access Time: &lt;/b&gt;The average time (in nanoseconds) for RAM to complete one access. Access time is&#10;composed of address setup time and latency (the time it takes to initiate a request&#10;for data and prepare access).&lt;/li&gt;&lt;li&gt;&lt;b&gt;ANSI: &lt;/b&gt;(American National Standards Institute) – The U.S. organization responsible for setting&#10;information technology standards.&lt;/li&gt;&lt;li&gt;&lt;b&gt;ASCII: &lt;/b&gt;(American Standard Code for Information Interchange) – A method of encoding text&#10;as binary values. The ASCII coding system contains 256 combinations of 7-bit or&#10;8-bit binary numbers to represent every possible keystroke.&lt;a name="B"&gt;&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;b&gt;Backside Bus: &lt;/b&gt;(BSB) – The data path that runs between the CPU and L2 cache.&#10;The amount of data moved on electronic lines, such as a bus, per second.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Bandwidth: &lt;/b&gt;Bandwidth is usually measured in bits per second, bytes per second, or cycles per&#10;second (Hertz).&lt;/li&gt;&lt;li&gt;&lt;b&gt;Bank: &lt;/b&gt;See memory bank.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Bank Schema: &lt;/b&gt;A method of diagramming memory configurations. The bank schema consists of&#10;rows and/or columns that represent memory sockets on a computer board. Rows&#10;indicate independent sockets; columns represent banks.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Base Rambus: &lt;/b&gt;The first generation of Rambus technology, first shipped in 1995.&lt;/li&gt;&lt;li&gt;&lt;b&gt;BGA: &lt;/b&gt;(Ball Grid Array) – A chip package having solder balls on the underside for mounting.&#10;BGA allows for a reduction in die package size, better heat dissipation, and greater&#10;module densities.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Binary: &lt;/b&gt;A numbering system that uses combinations of 0 and 1 to represent data. Also&#10;known as Base 2.&lt;/li&gt;&lt;li&gt;&lt;b&gt;BIOS: &lt;/b&gt;(Basic Input-Output System) – Startup routines that prepare the computer for operation.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Bit: &lt;/b&gt;The smallest unit of information a computer processes. A bit is 1 or 0.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Buffer: &lt;/b&gt;A holding area for data shared by devices that operate at different speeds or have&#10;different priorities. A buffer allows a device to operate without the delays that other&#10;devices impose.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Buffered Memory: &lt;/b&gt;A memory module that contains buffers. Buffers re-drive the signals through the&#10;memory chips and allow the module to include more memory chips. Buffered&#10;and unbuffered memory cannot be mixed. The design of the computer memory&#10;controller dictates whether memory must be buffered or unbuffered.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Burst EDO RAM: &lt;/b&gt;(BEDO) – EDO memory that can process four memory addresses in one burst. Bus&#10;speeds range from 50MHz to 66MHz (compared to 33MHz for EDO and 25MHz&#10;for Fast Page Mode).&lt;/li&gt;&lt;li&gt;&lt;b&gt;Burst Mode: &lt;/b&gt;High-speed transmission of a block of data (a series of consecutive addresses) when&#10;the processor requests a single address.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Bus: &lt;/b&gt;A data path in a computer, consisting of various parallel wires to which the CPU,&#10;memory, and all input/output devices are connected.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Bus Cycle: &lt;/b&gt;A single transaction between main memory and the CPU.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Byte: &lt;/b&gt;Eight bits of information. The byte is the fundamental unit of computer processing;&#10;almost all specifications and measures of computer performance are in bytes or&#10;multiples thereof. See kilobytes and megabytes.&lt;a name="C"&gt;&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;b&gt;Cache Memory: &lt;/b&gt;A small amount (normally less than 1MB) of high-speed memory residing on or&#10;close to the CPU. Cache memory supplies the processor with the most frequently&#10;requested data and instructions. Level 1 cache (primary cache) is the cache closest&#10;to the processor. Level 2 cache (secondary cache) is the cache second closest to the&#10;processor and is usually on the motherboard.&lt;/li&gt;&lt;li&gt;&lt;b&gt;CAS: &lt;/b&gt;(Column Address Strobe) – A memory chip signal that latches the column address of&#10;a particular location in a row-column matrix.&lt;/li&gt;&lt;li&gt;&lt;b&gt;CAS Latency: &lt;/b&gt;The ratio between column access time and clock cycle time. CAS Latency 2 (CL2)&#10;offers a slight performance increase over CAS Latency 3 (CL3).&lt;/li&gt;&lt;li&gt;&lt;b&gt;ccNUMA: &lt;/b&gt;(Cache-Coherent, Non-uniform Memory Access) – A flexible architecture that uses&#10;modular, low-cost components and offers multidimensional scaling potential to&#10;high-end servers.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Chipset: &lt;/b&gt;Microchips that support the CPU. The chipset usually contains several controllers&#10;that govern how information travels between the processor and other components.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Chip-Scale Package: &lt;/b&gt;(CSP) – Thin chip packaging whereby electrical connections are typically through a&#10;ball grid array. Chip-scale packaging is used in RDRAM and flash memory.&lt;/li&gt;&lt;li&gt;&lt;b&gt;CompactFlash: &lt;/b&gt;A small, lightweight form factor for removable storage cards. CompactFlash cards&#10;are durable, operate at low voltages, and retain data when power is off. Uses&#10;include digital cameras, cell phones, printers, handheld computers, pagers, and&#10;audio recorders.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Composite: &lt;/b&gt;An Apple Computer, Inc. term for a memory module that used an older technology&#10;and contained more but lower-density chips.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Concurrent Rambus: &lt;/b&gt;The second generation of Rambus technology. Concurrent Rambus has been used&#10;in graphics-based computers, digital TVs, and video game applications (such as&#10;Nintendo 64 since 1997).&lt;/li&gt;&lt;li&gt;&lt;b&gt;Continuity RIMM: &lt;/b&gt;(C-RIMM) – A Direct Rambus memory module that does not contain memory chips.&#10;C-RIMM provides a continuous channel for the signal. In a Direct Rambus system, open&#10;connectors must be populated with C-RIMMs.&lt;/li&gt;&lt;li&gt;&lt;b&gt;CPU: &lt;/b&gt;(Central Processing Unit) – The computer chip that has primary responsibility for&#10;interpreting commands and running programs. The CPU is also known as the&#10;processor or microprocessor.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Credit Card Memory: &lt;/b&gt;A type of memory typically in laptop and notebook computers. Credit card memory&#10;is the size of a credit card.&lt;a name="D"&gt;&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;b&gt;DDR SDRAM: &lt;/b&gt;(Double Data Rate Synchronous Dynamic Random-Access Memory) – The latest generation&#10;of SDRAM technology. Data is read on both the rising and the falling edge of&#10;the computer clock, thereby delivering twice the bandwidth of standard SDRAM.&#10;With DDR SDRAM, memory speed doubles without increasing the clock frequency.&lt;/li&gt;&lt;li&gt;&lt;b&gt;DIMM: &lt;/b&gt;(Dual In-line Memory Module) – A printed circuit board with gold contacts and&#10;memory devices. A DIMM is similar to a SIMM, but with this primary difference:&#10;unlike the metal leads on either side of a SIMM, which are “tied together” electrically,&#10;the leads on either side of a DIMM are electrically independent.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Direct Rambus: &lt;/b&gt;Rambus technology’s third generation, which offers a completely new DRAM&#10;architecture for high-performance PCs. Data transfers at speeds up to 800MHz over&#10;a narrow 16-bit channel, compared to current SDRAM, which operates at 100MHz&#10;on a wide 64-bit bus.&lt;/li&gt;&lt;li&gt;&lt;b&gt;DIP: &lt;/b&gt;(Dual In-line Package) – A DRAM component packaging. DIPs can be installed in sockets&#10;or permanently soldered into holes on the printed circuit board. The DIP package&#10;was extremely popular when memory was installed directly on the motherboard.&lt;/li&gt;&lt;li&gt;&lt;b&gt;DRAM: &lt;/b&gt;(Dynamic Random-Access Memory) – The most common form of RAM. DRAM can&#10;hold data for only a short time. To retain data, DRAM must be refreshed periodically.&#10;If the cell is not refreshed, the data disappear.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Dual-Banked: &lt;/b&gt;A memory module having two banks.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Dual Independent Bus: &lt;/b&gt;(DIB) – An Intel-developed bus architecture that offers greater bandwidth by having&#10;two separate buses (frontside and backside) access the processor. Pentium II&#10;computers have DIBs.&lt;a name="E"&gt;&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;b&gt;ECC: &lt;/b&gt;(Error Correction Code) – A method of checking the integrity of data in DRAM. ECC&#10;provides more elaborate error detection than parity; ECC can detect multiple-bit&#10;errors and can locate and correct single-bit errors.&lt;/li&gt;&lt;li&gt;&lt;b&gt;EDO: &lt;/b&gt;(Extended Data-Out) – A DRAM technology that shortens the read cycle between&#10;memory and CPU. On computers that support it, EDO memory allows a CPU to&#10;access memory 10 to 20 percent faster than comparable fast-page mode memory.&lt;/li&gt;&lt;li&gt;&lt;b&gt;EDRAM: &lt;/b&gt;(Enhanced DRAM) – Enhanced Memory Systems, Inc. DRAM that contains a small&#10;amount of SRAM.&lt;/li&gt;&lt;li&gt;&lt;b&gt;EEPROM: &lt;/b&gt;(Electrically Erasable Programmable Read-Only Memory) – A memory chip that&#10;retains data content after power has been removed. EEPROM can be erased and&#10;reprogrammed within the computer or externally.&lt;/li&gt;&lt;li&gt;&lt;b&gt;EISA: &lt;/b&gt;(Extended ISA) – A bus architecture that extended the 16-bit ISA bus to 32 bits. EISA&#10;operates at 8MHz and has a peak data transfer rate of 33MB per second. EISA was&#10;introduced in 1988 as an open alternative to IBM’s proprietary Micro Channel bus.&lt;/li&gt;&lt;li&gt;&lt;b&gt;EOS: &lt;/b&gt;(ECC on SIMM) – An IBM data-integrity-checking technology that features ECC&#10;data-integrity-checking on a SIMM.&lt;/li&gt;&lt;li&gt;&lt;b&gt;EPROM: &lt;/b&gt;(Erasable Programmable Read-Only Memory) – A programmable and reusable chip&#10;that retains content until erasure under ultraviolet light. Special equipment erases&#10;and reprograms EPROMs.&lt;/li&gt;&lt;li&gt;&lt;b&gt;ESDRAM: &lt;/b&gt;(Enhanced Synchronous DRAM) – A type of SDRAM developed by Enhanced&#10;Memory Systems, Inc. ESDRAM replaces expensive SRAM in embedded systems&#10;and offers comparable speed with less power consumption and lower cost.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Even Parity: &lt;/b&gt;A type of data integrity checking whereby the parity bit checks for an even&#10;number of 1s.&lt;a name="F"&gt;&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;b&gt;Fast-Cycle RAM: &lt;/b&gt;(FCRAM) – FCRAM is a memory technology currently being developed by Toshiba&#10;and Fujitsu. FCRAM is not intended for PC main memory but will be used in&#10;specialty applications such as high-end servers, printers, and telecommunications&#10;switching systems.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Fast-Page Mode: &lt;/b&gt;An early form of DRAM, fast-page mode’s advantage over previous page mode&#10;memory technologies was faster access to data in the same row.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Flash Memory: &lt;/b&gt;A solid-state, nonvolatile, rewritable memory that functions like a combination of&#10;RAM and hard disk. Flash memory is durable, operates at low voltages, and retains&#10;data when power is off. Flash memory cards are used in digital cameras, cell&#10;phones, printers, handheld computers, pagers, and audio recorders.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Form Factor: &lt;/b&gt;The size, configuration, and other specifications used to describe hardware.&#10;Examples of memory form factors are: SIMM, DIMM, RIMM, 30-pin, 72-pin, and&#10;168-pin.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Frontside Bus: &lt;/b&gt;(FSB) – The data path that runs between the CPU and main memory (RAM).&lt;a name="G"&gt;&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;b&gt;Gigabit: &lt;/b&gt;Approximately 1 billion bits, or exactly 1 bit x 1,0243 (1,073,741,824) bits.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Gigabyte: &lt;/b&gt;Approximately 1 billion bytes, or exactly 1 byte x 1,0243 (1,073,741,824) bytes.&lt;a name="H"&gt;&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;b&gt;Heat Spreader: &lt;/b&gt;A sheath, usually aluminum, that covers an electronic device and dissipates heat.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Heat Sink: &lt;/b&gt;A component, typically zinc alloy, that dissipates heat. CPUs require heat sinks.&lt;a name="I"&gt;&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;b&gt;IC: &lt;/b&gt;(Integrated Circuit) – An electronic circuit on a semiconductor chip. The circuit&#10;includes components and connectors. A semiconductor chip is usually molded in&#10;a plastic or ceramic case and has external connector pins.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Interleaving: &lt;/b&gt;Techniques for increasing memory speed. For example, with separate memory&#10;banks for odd and even addresses, the next byte of memory can be accessed while&#10;the current byte refreshes.&lt;a name="J"&gt;&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;b&gt;JEDEC: &lt;/b&gt;(Joint Electron Device Engineering Council) – An Electronic Industries Alliance (EIA)&#10;body that sets semiconductor engineering standards.&lt;a name="K"&gt;&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;b&gt;Kilobit: &lt;/b&gt;Approximately one thousand bits, or exactly 1 bit x 210 (1,024) bits.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Kilobyte: &lt;/b&gt;Approximately one thousand bytes, or exactly 1 byte x 210 (1,024) bytes.&lt;a name="L"&gt;&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;b&gt;Level 1 Cache: &lt;/b&gt;(L1) – Also known as primary cache, L1 Cache is a small amount of high-speed&#10;memory that resides on or very close to the processor. L1 Cache supplies the&#10;processor with the most frequently requested data and instructions.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Level 2 Cache: &lt;/b&gt;(L2) – Also known as secondary cache, L2 Cache is a small amount of high-speed&#10;memory close to the CPU and usually on the motherboard. L2 Cache supplies the&#10;processor with the most frequently requested data and instructions. Depending on&#10;the motherboard, Level 2 cache may be upgraded.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Logic Board: &lt;/b&gt;See Motherboard.&lt;a name="M"&gt;&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;b&gt;Megabit: &lt;/b&gt;Approximately one million bits, or exactly 1 bit x 1,0242 (1,048,576) bits.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Megabyte: &lt;/b&gt;Approximately one million bytes, or exactly 1 byte x 1,0242 (1,048,576) bytes.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Memory: &lt;/b&gt;A computer’s random-access memory. Memory temporarily holds data and instructions&#10;for the CPU. See RAM.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Memory Bank: &lt;/b&gt;A logical unit of memory in a computer, the size of which the CPU determines. For&#10;example, a 32-bit CPU requires memory banks that provide 32 bits of information&#10;at a time. A bank can consist of one or more memory modules.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Memory Bus: &lt;/b&gt;The bus that runs from the CPU to the memory expansion slots.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Memory Controller Hub: &lt;/b&gt;(MCH) – The interface between the processor, Accelerated Graphics Port, and&#10;RDRAM on motherboards that use Intel’s 820 or 840 chipsets.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Memory Translator Hub: &lt;/b&gt;(MTH) – The interface that allows SDRAM memory to be supported on a Direct&#10;Rambus Channel for motherboards using Intel’s 820 chipset.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Micro BGA: &lt;/b&gt;(&amp;micro;BGA) – Tessera, Inc. BGA chip packaging technique allows for a reduction in die&#10;package size, improved heat dissipation, and greater module densities.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Motherboard: &lt;/b&gt;Also known as the logic board, main board, or computer board, the motherboard&#10;is the computer’s main board and in most cases holds all CPU, memory, and I/O&#10;functions or has expansion slots for them.&lt;a name="N"&gt;&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;b&gt;Nanosecond: &lt;/b&gt;(ns) – One billionth of a second. Memory data access times are in nanoseconds. For&#10;example, memory access times for typical 30- and 72-pin SIMM modules range&#10;from 60 to 100 nanoseconds.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Nibble: &lt;/b&gt;Half of an 8-bit byte, or 4 bits.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Non-Composite: &lt;/b&gt;An Apple Computer, Inc. term for a memory module that used a new technology and&#10;contained fewer but higher-density chips. Non-composite modules were more reliable&#10;and more expensive than composite modules.&lt;a name="O"&gt;&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;b&gt;Odd Parity: &lt;/b&gt;Data integrity checking in which the parity bit checks for an odd number of 1s.&lt;a name="P"&gt;&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;b&gt;Parity: &lt;/b&gt;Data integrity checking that adds a single bit to each byte of data. The parity bit is&#10;used to detect errors in the other 8 bits.&lt;/li&gt;&lt;li&gt;&lt;b&gt;PCB: &lt;/b&gt;(Printed Circuit Board) – Generally flat, multi-layer boards made of fiberglass with&#10;electrical traces. The surface and sublayers use copper traces to provide electrical&#10;connections for chips and other components. Examples of PCBs include: motherboards,&#10;SIMMs, and credit card memory.&lt;/li&gt;&lt;li&gt;&lt;b&gt;PC Card: &lt;/b&gt;(PCMCIA: Personal Computer Memory Card International Association) – A standard that&#10;allows interchangeability of various computing components on the same connector.&#10;The PCMCIA standard supports input-output devices, including memory,&#10;fax/modem, SCSI, and networking products.&lt;/li&gt;&lt;li&gt;&lt;b&gt;PCI: &lt;/b&gt;(Peripheral Component Interconnect) – A peripheral bus that can send 32 or 64 bits&#10;of data simultaneously. PCI offers plug-and-play capability.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Pipeline Burst Cache: &lt;/b&gt;Cache that reduces wait states and accelerates memory access by using pipelining&#10;and bursting functions.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Pipelining: &lt;/b&gt;A technique in which memory loads the requested memory contents into a small&#10;cache composed of SRAM, then immediately begins fetching the next memory&#10;contents. This creates a two-stage pipeline, where data is read from or written to&#10;SRAM in one stage, and data is read from or written to memory in the other stage.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Proprietary Memory: &lt;/b&gt;Memory custom designed for a specific computer.&lt;a name="Q"&gt;&lt;/a&gt;&lt;a name="R"&gt;&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;b&gt;RAM: &lt;/b&gt;(Random-Access Memory) – A memory cell configuration that holds data for&#10;processing by a central processing unit (CPU). Random means the CPU can retrieve&#10;data from any address within RAM. See also Memory.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Rambus: &lt;/b&gt;(1) Rambus, Inc. develops and licenses high-performance memory logic and circuit design&#10;technology and provides licensees with product design, layout, and testing information. (2) Direct Rambus is a high-speed memory technology that uses a narrow 16-bit bus&lt;/li&gt;&lt;li&gt;&lt;b&gt;Rambus Channel: &lt;/b&gt;(Rambus channel) to transmit data at speeds up to 800MHz. See Rambus Channel.&#10;The data path of Rambus systems. Because of the narrow data width (two bytes),&#10;Rambus modules transfer data at up to 800MHz.&lt;/li&gt;&lt;li&gt;&lt;b&gt;RAS: &lt;/b&gt;A memory chip signal that latches the row address of a particular location in a&#10;row-column matrix.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Refresh: &lt;/b&gt;Refreshing maintains data stored in DRAM. The process of refreshing electrical cells&#10;on a DRAM component is similar to recharging batteries. Different DRAM components&#10;require different refresh methods.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Refresh Rate: &lt;/b&gt;The number of DRAM component rows that must be refreshed. Three common&#10;refresh rates are 2K, 4K and 8K.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Registered Memory: &lt;/b&gt;SDRAM memory that contains registers directly on the module. The registers&#10;re-drive the signals through the memory chips and allow the module to be built&#10;with more memory chips. Registered and unbuffered memory cannot be mixed.&#10;The design of the computer memory controller dictates which type of memory the&#10;computer requires.&lt;/li&gt;&lt;li&gt;&lt;b&gt;RIMM&lt;sup&gt;&lt;font size="-1"&gt;TM&lt;/font&gt;&lt;/sup&gt;: &lt;/b&gt;The trademarked name for a Direct Rambus memory module. A RIMM™ conforms to&#10;the DIMM form factor and transfers data 16 bits at a time.&lt;/li&gt;&lt;li&gt;&lt;b&gt;RIMM Connector: &lt;/b&gt;A Direct Rambus memory socket.&lt;a name="S"&gt;&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;b&gt;SDRAM: &lt;/b&gt;(Synchronous DRAM) – A DRAM technology that uses a clock to synchronize signal&#10;input and output on a memory chip. The clock is coordinated with the CPU clock&#10;so the timing of the memory chips and the timing of the CPU are in synch.&#10;Synchronous DRAM saves time in executing commands and transmitting data,&#10;thereby increasing the overall performance of the computer. SDRAM allows the&#10;CPU to access memory approximately 25 percent faster than EDO memory.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Self-Refresh: &lt;/b&gt;A memory technology that enables DRAM to refresh on its own and independent&#10;of the CPU or external refresh circuitry. Self-Refresh technology is built into the&#10;DRAM chip itself and reduces power consumption dramatically. Notebook and laptop&#10;computers use this technology.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Serial Presence Detect: &lt;/b&gt;An EEPROM chip that contains information about size and speed, as well as other&#10;specifications and manufacturer information of a memory module.&lt;/li&gt;&lt;li&gt;&lt;b&gt;SGRAM: &lt;/b&gt;(Synchronous Graphics Random-Access Memory) – Video memory that includes graphicsspecific&#10;read/write features. SGRAM allows data to be retrieved and modified in&#10;blocks instead of individually. Blocking reduces the number of reads and writes the&#10;memory must perform and increases the performance of the graphics controller.&lt;/li&gt;&lt;li&gt;&lt;b&gt;SIMM: &lt;/b&gt;(Single In-line Memory Module) – A printed circuit board having memory devices and&#10;gold or tin/lead contacts. A SIMM plugs into a computer memory expansion socket.&#10;SIMMs offer two main advantages: ease of installation and minimal consumption of&#10;board surface. A vertically mounted SIMM requires only a fraction of the space&#10;required by a horizontally mounted DRAM. A SIMM may have as few as 30 or&#10;as many as 200 pins. On a SIMM, the metal leads on either side of the board are&#10;electrically tied together.&lt;/li&gt;&lt;li&gt;&lt;b&gt;SIMM Socket: &lt;/b&gt;A motherboard component that holds a single SIMM.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Single-Banked: &lt;/b&gt;A module that has only one bank or row.&lt;/li&gt;&lt;li&gt;&lt;b&gt;SLDRAM: &lt;/b&gt;(Synclink) – Although obsolete today, SLDRAM was a main memory technology&#10;developed by a consortium of twelve DRAM manufacturers as an alternative to&#10;Direct Rambus technology.&lt;/li&gt;&lt;li&gt;&lt;b&gt;SMART CARD: &lt;/b&gt;An electronic device, similar in size to a credit card, that can store data and programs&#10;while enhancing security. Applications include identification, mass transit, and banking.&lt;/li&gt;&lt;li&gt;&lt;b&gt;SO DIMM: &lt;/b&gt;(Small-Outline Dual In-line Memory Module) – An enhanced version of a standard&#10;DIMM. A 72-pin small-outline DIMM is about half the length of a 72-pin SIMM.&#10;The trademarked name for a Direct Rambus memory module in notebook computers.&lt;/li&gt;&lt;li&gt;&lt;b&gt;SO-RIMM&lt;sup&gt;&lt;font size="-1"&gt;TM&lt;/font&gt;&lt;/sup&gt;: &lt;/b&gt;SO-RIMM™s provide memory bandwidth comparable to desktop memory&#10;configurations.&lt;/li&gt;&lt;li&gt;&lt;b&gt;SOJ: &lt;/b&gt;(Small-Outline J-lead) – A common form of surface-mounted DRAM packaging. An&#10;SOJ is a rectangular package with J-shaped leads on the two long sides.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Static RAM: &lt;/b&gt;(SRAM) – A memory chip that requires power to retain content. SRAM is faster than&#10;DRAM but more expensive and bulky. A typical use for SRAM is cache memory.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Storage: &lt;/b&gt;A data-holding device, such as a hard disk or CD-ROM.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Swapping: &lt;/b&gt;Using part of the hard drive as memory when RAM is full. See Virtual Memory.&lt;/li&gt;&lt;li&gt;&lt;b&gt;System Board: &lt;/b&gt;See Motherboard.&lt;a name="T"&gt;&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;b&gt;Transmission Line Technology: &lt;/b&gt;A technology that supports the backside bus in Direct Rambus systems.Information&#10;is quickly pipelined in simultaneous packets. The memory controller reassembles&#10;the packets for frontside bus transfer and communication to the processor.&lt;/li&gt;&lt;li&gt;&lt;b&gt;TSOP: &lt;/b&gt;(Thin Small-Outline Package) – A DRAM package that uses gull-wing leads on both&#10;sides. TSOP DRAM mounts directly on the surface of the printed circuit board. The&#10;TSOP package is one-third the thickness of an SOJ. TSOP components commonly&#10;occur in small-outline DIMMs and credit card memory.&lt;a name="U"&gt;&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;b&gt;Unbuffered Memory: &lt;/b&gt;Memory that does not contain buffers or registers located on the module. Instead,&#10;these devices are located on the motherboard.&lt;a name="V"&gt;&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;b&gt;VESA Local Bus: &lt;/b&gt;(VL-Bus) – A 32-bit local bus that runs between the CPU and peripheral devices at&#10;speeds up to 40MHz.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Virtual Channel Memory: &lt;/b&gt;(VCM) – VCM is a memory architecture developed by NEC. VCM allows different&#10;blocks of memory–each with its own buffer–to interface separately with the&#10;controller. This way, system tasks can be assigned their own virtual channels.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Virtual Memory: &lt;/b&gt;Information related to one function does not share buffer space with other tasks&#10;running simultaneously, thereby making overall operations much more efficient.&#10;Simulated memory. When RAM is full, the computer swaps data to the hard disk&#10;and back as needed. See Swapping.&lt;/li&gt;&lt;li&gt;&lt;b&gt;VRAM: &lt;/b&gt;(Video Random-Access Memory) – Dual-ported (two separate data ports) memory&#10;typically on a video or graphics card. One port is dedicated to the CRT and refreshes&#10;and updates the image. The second port is for the CPU or graphics controller and&#10;changes the image data in memory.&lt;a name="W"&gt;&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;b&gt;Wait State: &lt;/b&gt;An inactive period for the processor. Wait states result from the different clock&#10;speeds of the processor and memory, the latter being typically slower.&lt;/li&gt;&lt;li&gt;&lt;b&gt;Window Random Access Memory: &lt;/b&gt;(WRAM) – Samsung Electronics’ dual-ported (two separate data ports) memory&#10;typically on a video or graphics card. WRAM has a 25% higher bandwidth than&#10;VRAM but costs less.&lt;a name="X"&gt;&lt;/a&gt;&lt;a name="Y"&gt;&lt;/a&gt;&lt;a name="Z"&gt;&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>11. Choice of Interpolation Resolution</title><link>https://technick.net/guides/theory/dar/011/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dar/011/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/resample/"&gt;The Digital Audio Resampling Home Page&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, Copyright &amp;#169; &lt;i&gt;2016-05-17&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dar/010"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dar/000"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dar/012"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;Choice of Interpolation Resolution&lt;/h3&gt;&lt;p&gt;We now consider the error due to finite precision in the &lt;a href="https://ccrma.stanford.edu/~jos//Interpolation/Linear_Interpolation.html" target="_blank"&gt;linear&#10;interpolation&lt;/a&gt; between stored &lt;a href="https://technick.net/guides/theory/edft/010"&gt;filter&lt;/a&gt; coefficients. We will find that the&#10;number of bits &lt;img width="24" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img53.gif" alt="${n_\" ta="" /&gt; in the interpolation factor should be about half the&#10;filter coefficient word-length &lt;img width="23" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img89.gif" alt="${n_c}$" /&gt;.&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;b&gt;Quantized Interpolation Error Bound. &lt;/b&gt;&lt;/p&gt;&lt;p&gt;The quantized interpolation factor and its complement are representable as&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray}&#10;\eta_q &amp; = &amp; \eta + \nu \\&#10;\overline{\eta }_q&amp; = &amp; \overline{\eta }- \nu&#10;\end{eqnarray}&#10; --&gt;&lt;table align="CENTER" cellpadding="0" width="100%"&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&lt;img width="24" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img184.gif" alt="$\" isplaystyle="" ta="" q="" /&gt;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="21" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img167.gif" alt="$\" extstyle="$" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="53" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img185.gif" alt="$\" isplaystyle="" ta="" u="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(10)&lt;/td&gt;&lt;/tr&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&lt;img width="24" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img186.gif" alt="$\" isplaystyle="" verline="" ta="" q="" /&gt;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="21" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img167.gif" alt="$\" extstyle="$" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="54" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img187.gif" alt="$\" isplaystyle="" verline="" ta="" u="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(11)&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;where, since &lt;!-- MATH&#10; $\eta ,\overline{\eta }$&#10; --&gt;&lt;img width="33" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img188.gif" alt="$\" ta="" verline="" ta="" /&gt; are unsigned, &lt;!-- MATH&#10; $|\nu|\leq 2^{-({n_\eta }+1)}$&#10; --&gt;&lt;img width="115" height="41" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img189.gif" alt="$\" ert\nu\vert\leq="" eta="" /&gt;.&#10;The interpolated coefficient look-up then gives&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray}&#10;\hat{h}_{qq}(t) &amp; = &amp; (\overline{\eta }-\nu)[h(t_0)+\epsilon _0] + (\eta +\nu)[h(t_1)+\epsilon _1] \\&#10; &amp; = &amp; \hat{h}(t) + \overline{\eta }\epsilon _0 + \eta \epsilon _1 + \nu[h(t_1)-h(t_0)],&#10;\end{eqnarray}&#10; --&gt;&lt;table align="CENTER" cellpadding="0" width="100%"&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&lt;img width="56" height="50" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img190.gif" alt="$\" isplaystyle="" at="" qq="" /&gt;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="21" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img167.gif" alt="$\" extstyle="$" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="354" height="41" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img191.gif" alt="$\" isplaystyle="" verline="" ta="" u="" t="" psilon="" ta="" u="" t="" psilon="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(12)&lt;/td&gt;&lt;/tr&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&amp;nbsp;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="21" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img167.gif" alt="$\" extstyle="$" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="314" height="50" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img192.gif" alt="$\" isplaystyle="" at="" t="" verline="" ta="" psilon="" ta="" psilon="" u="" t="" t="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(13)&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;where second-order errors &lt;!-- MATH&#10; $\nu\epsilon _0$&#10; --&gt;&lt;img width="30" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img193.gif" alt="$\" u\epsilon="" /&gt; and &lt;!-- MATH&#10; $\nu\epsilon _1$&#10; --&gt;&lt;img width="30" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img194.gif" alt="$\" u\epsilon="" /&gt; are dropped.&#10;Since &lt;!-- MATH&#10; $|h(t_1)-h(t_0)|\leq M_1$&#10; --&gt;&lt;img width="169" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img195.gif" alt="$\" ert="" h="" vert\leq="" /&gt;, we obtain the error bound&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\left|\tilde{h}_{qq}(t)\right|\leq 2^{-{n_c}} + 2^{-({n_\eta }+1)}M_1 + {3\over8}M_2.&#10;\end{displaymath}&#10; --&gt;&lt;a name="eq:Ebe"&gt;&lt;/a&gt;&lt;a name="eq:Ebe"&gt;&lt;/a&gt;&lt;img width="324" height="50" border="0" src="https://technick.net/img/guide_dar/guide_dar_img196.gif" alt="\" egin="" isplaymath="" eft\vert\tilde="" qq="" right\vert\leq="" c="" eta="" over8="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;The three terms in Eq.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/dar/011#eq:Ebe"&gt;2.6.2&lt;/a&gt;) are caused by coefficient quantization,&#10;interpolation quantization, and linear-approximation error, respectively.&lt;p&gt;&lt;br /&gt;&lt;b&gt;Ideal Lowpass Filter. &lt;/b&gt;&lt;/p&gt;&lt;p&gt;For the ideal lowpass, the error bound is&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\left|\tilde{h}_{qq}(t)\right| \leq 2^{-{n_c}} + a 2^{-({n_l}+{n_\eta }+1)} + {\pi^2\over 8} 2^{-{n_l}}.&#10;\end{displaymath}&#10; --&gt;&lt;img width="352" height="53" border="0" src="https://technick.net/img/guide_dar/guide_dar_img197.gif" alt="\" egin="" isplaymath="" eft\vert\tilde="" qq="" right\vert="" eq="" c="" a="" l="" eta="" i="" ver="" l="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Let &lt;!-- MATH&#10; ${n_l}=1+{n_c}/2$&#10; --&gt;&lt;img width="115" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img90.gif" alt="${n_l}=1+{n_c}/2$" /&gt; and require that the added error is at most &lt;!-- MATH&#10; ${1\over2}2^{-{n_c}}$&#10; --&gt;&lt;img width="50" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img198.gif" alt="${1\" ver2="" c="" /&gt;.&#10;Then we arrive at the requirement&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;{n_\eta }\geq {{n_c}\over2}.&#10;\end{displaymath}&#10; --&gt;&lt;img width="78" height="46" border="0" src="https://technick.net/img/guide_dar/guide_dar_img199.gif" alt="\" egin="" isplaymath="" eta="" eq="" c="" ver2="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>11. Convolution Representation</title><link>https://technick.net/guides/theory/edft/011/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/edft/011/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/filters/"&gt;Introduction to Digital Filters with Audio Applications&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, Copyright &amp;#169; &lt;i&gt;2017-11-26&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/edft/010"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/000"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/022"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/012"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;Convolution Representation&lt;/h3&gt;&lt;p&gt;If &lt;img width="40" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img209.gif" alt="$y(n)$" /&gt; is the output of an &lt;a href="https://technick.net/guides/theory/edft/009"&gt;LTI&lt;/a&gt; &lt;a href="https://technick.net/guides/theory/edft/010"&gt;filter&lt;/a&gt; with input &lt;img width="41" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img236.gif" alt="$x(n)$" /&gt; and &lt;a href="https://technick.net/guides/theory/edft/010#2321"&gt;impulse&lt;/a&gt;response &lt;img width="41" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img70.gif" alt="$h(n)$" /&gt;, then &lt;img width="15" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img225.gif" alt="$y$" /&gt; is the &lt;i&gt;&lt;a href="https://ccrma.stanford.edu/~jos//ReviewFourier/Convolution.html" target="_blank"&gt;convolution&lt;/a&gt;&lt;/i&gt; of &lt;img width="15" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img224.gif" alt="$x$" /&gt; with &lt;img width="16" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img237.gif" alt="$h$" /&gt;,&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;y(n)=\sum_{i=0}^n x(i)h(n-i) \isdef x\ast h(n).&#10;\end{displaymath}&#10; --&gt;&lt;img width="308" height="61" border="0" src="https://technick.net/img/guide_edft/guide_edft_img238.gif" alt="\" egin="" isplaymath="" n="" um="" n="" i="i" h="" i="" sdef="" st="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Since convolution is commutative (&lt;!-- MATH&#10; $x\ast h(n) = h\ast x(n)$&#10; --&gt;&lt;img width="160" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img239.gif" alt="$x\" st="" h\ast="" /&gt;), we have also&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;y(n)=\sum_{i=0}^n h(i)x(n-i).&#10;\end{displaymath}&#10; --&gt;&lt;a name="eq:convrep"&gt;&lt;/a&gt;&lt;a name="eq:convrep"&gt;&lt;/a&gt;&lt;img width="208" height="61" border="0" src="https://technick.net/img/guide_edft/guide_edft_img240.gif" alt="\" egin="" isplaymath="" n="" um="" n="" i="i" x="" i="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt; &lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;The &lt;i&gt;&lt;img width="14" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img1.gif" alt="$z$" /&gt;-transform&lt;/i&gt;&lt;a name="2386"&gt;&lt;/a&gt; of the discrete-time signal &lt;img width="41" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img236.gif" alt="$x(n)$" /&gt; is defined to be&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;X(z)\isdef \sum_{n=-\infty}^\infty x(n)z^{-n},&#10;\end{displaymath}&#10; --&gt;&lt;img width="200" height="62" border="0" src="https://technick.net/img/guide_edft/guide_edft_img241.gif" alt="\" egin="" isplaymath="" z="" sdef="" um="" infty="" infty="" n="" n="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;That &lt;img width="41" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img236.gif" alt="$x(n)$" /&gt; and &lt;img width="46" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img242.gif" alt="$X(z)$" /&gt; are transform pairs is expressed&#10;by writing &lt;!-- MATH&#10; $X(z)={\cal Z}\{x(n)\}$&#10; --&gt;&lt;img width="142" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img243.gif" alt="$X(z)={\" al="" n="" /&gt; or &lt;!-- MATH&#10; $X(z)\forall x(n)$&#10; --&gt;&lt;img width="93" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img244.gif" alt="$X(z)\" orall="" /&gt;.&lt;p&gt;&lt;b&gt;Theorem. &lt;/b&gt;The &lt;i&gt;&lt;a href="https://ccrma.stanford.edu/~jos//thms/Convolution_Theorem.html" target="_blank"&gt;convolution theorem&lt;/a&gt;&lt;/i&gt; (Papoulis [&lt;a href="https://technick.net/guides/theory/edft/023#Papoulis"&gt;Papoulis&amp;nbsp;1977&lt;/a&gt;]) states that &lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;x\ast y(n)\forall X(z)Y(z).&#10;\end{displaymath}&#10; --&gt;&lt;img width="175" height="36" border="0" src="https://technick.net/img/guide_edft/guide_edft_img245.gif" alt="\" egin="" isplaymath="" ast="" forall="" y="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;In words, &lt;i&gt;convolution in the&#10;time domain is multiplication in the frequency domain&lt;/i&gt;.&lt;p&gt;Taking the &lt;img width="14" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img1.gif" alt="$z$" /&gt;-transform of both sides of Eq.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/edft/011#eq:convrep"&gt;2.2.1&lt;/a&gt;) and&#10;applying the convolution theorem gives&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;Y(z)=H(z)X(z)&#10;\end{displaymath}&#10; --&gt;&lt;a name="eq:YHX"&gt;&lt;/a&gt;&lt;a name="eq:YHX"&gt;&lt;/a&gt;&lt;img width="159" height="36" border="0" src="https://technick.net/img/guide_edft/guide_edft_img246.gif" alt="\" egin="" isplaymath="" z="" z="" z="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where &lt;img width="46" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img5.gif" alt="$H(z)$" /&gt; is the &lt;img width="14" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img1.gif" alt="$z$" /&gt;-transform of the filter impulse response. Thus the&lt;img width="14" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img1.gif" alt="$z$" /&gt;-transform of the filter output is the &lt;img width="14" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img1.gif" alt="$z$" /&gt;-transform of the input times the &lt;img width="14" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img1.gif" alt="$z$" /&gt;-transform of&#10;the impulse response.&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;The &lt;i&gt;transfer function&lt;/i&gt;&lt;a name="2392"&gt;&lt;/a&gt; &lt;img width="52" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img247.gif" alt="$ H(z) $" /&gt; of a linear&#10;time-invariant discrete-time filter is defined to be the &lt;img width="14" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img1.gif" alt="$z$" /&gt;-transform of the&#10;impulse response &lt;img width="44" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img248.gif" alt="$ h(n)$" /&gt;.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Theorem. &lt;/b&gt;The &lt;i&gt;&lt;a href="https://ccrma.stanford.edu/~jos//ReviewFourier/Shift_Theorem.html" target="_blank"&gt;shift theorem&lt;/a&gt;&lt;/i&gt; [&lt;a href="https://technick.net/guides/theory/edft/023#Papoulis"&gt;Papoulis&amp;nbsp;1977&lt;/a&gt;] for &lt;img width="14" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img1.gif" alt="$z$" /&gt;-transforms states that&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;x(n-k)\forall z^{-k}X(z).&#10;\end{displaymath}&#10; --&gt;&lt;img width="170" height="36" border="0" src="https://technick.net/img/guide_edft/guide_edft_img249.gif" alt="\" egin="" isplaymath="" n-k="" orall="" x="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;The general &lt;a href="https://technick.net/guides/theory/edft/010"&gt;difference equation&lt;/a&gt; for an LTI filter appears as&lt;br /&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray}&#10;y(n) = b_0\,x(n) &amp;+&amp; b_1\,x(n-1) +\,\cdots\, + b_{n_b}\,x(n-{n_b}) \\&#10;&#9;&#9; &amp;-&amp; a_1\,y(n-1) - \,\cdots\, -a{n_a}\,y(n-{n_a}),&#10;\end{eqnarray}&#10; --&gt;&lt;table align="CENTER" cellpadding="0" width="100%"&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&lt;img width="133" height="41" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img219.gif" alt="$\" isplaystyle="" b="b" x="" /&gt;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="21" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img220.gif" alt="$\" extstyle="" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="299" height="41" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img221.gif" alt="$\" isplaystyle="" n-1="" dots="" b="" b="b" x="" n="" b="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(44)&lt;/td&gt;&lt;/tr&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&amp;nbsp;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="22" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img222.gif" alt="$\" extstyle="" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="314" height="41" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img250.gif" alt="$\" isplaystyle="" n-1="" dots="" a="" a="a" y="" n="" a="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(45)&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;Taking the &lt;img width="14" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img1.gif" alt="$z$" /&gt;-transform of both sides, denoting the transform by&#10;&lt;!-- MATH&#10; ${\cal Z}\{\,\}$&#10; --&gt;&lt;img width="42" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img251.gif" alt="${\" al="" /&gt; gives&#10; &lt;br /&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray}&#10;{\cal Z}\{y(n)\}&#10; &amp;=&amp;b_0\,{\cal Z}\{x(n)\} + b_1\,z^{-1}{\cal Z}\{x(n)\} +\,\cdots\, + b_{n_b}\,z^{-{n_b}}{\cal Z}\{x(n)\} \\&#10; &amp;&amp; \qquad - a_1\,z^{-1}{\cal Z}\{y(n)\} - \,\cdots\, - a{n_a}\,z^{-{n_a}}{\cal Z}\{y(n)\},&#10;\end{eqnarray}&#10; --&gt;&lt;table align="CENTER" cellpadding="0" width="100%"&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&lt;img width="83" height="41" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img252.gif" alt="$\" isplaystyle="" al="" n="" /&gt;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="21" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img10.gif" alt="$\" extstyle="$" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="487" height="45" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img253.gif" alt="$\" isplaystyle="" al="" n="" b="" cal="" n="" dots="" b="" b="b" z="" b="b" cal="" n="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(46)&lt;/td&gt;&lt;/tr&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="435" height="45" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img254.gif" alt="$\" isplaystyle="" quad="" a="" cal="" n="" dots="" a="" a="a" z="" a="a" cal="" n="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(47)&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;using linearity and the shift theorem. Replacing &lt;!-- MATH&#10; ${\cal Z}\{y(n)\}$&#10; --&gt;&lt;img width="75" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img255.gif" alt="${\" al="" n="" /&gt; by &lt;img width="44" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img256.gif" alt="$Y(z)$" /&gt;,&#10;&lt;!-- MATH&#10; ${\cal Z}\{x(n)\}$&#10; --&gt;&lt;img width="76" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img257.gif" alt="${\" al="" n="" /&gt; by &lt;img width="46" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img242.gif" alt="$X(z)$" /&gt;, and solving for &lt;img width="94" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img258.gif" alt="$Y(z)/X(z)$" /&gt;, which equals the transfer &#10;function &lt;img width="46" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img5.gif" alt="$H(z)$" /&gt;, yields&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;H(z)= \frac{Y(z)}{ X(z)}&#10;=\frac{b_0 + b_1\,z^{-1} +\,\cdots\, + b_{n_b}\,z^{-{n_b}} }{&#10; 1 + a_1\,z^{-1} + \,\cdots\, +a{n_a}\,z^{-{n_a}}}.&#10;\end{displaymath}&#10; --&gt;&lt;a name="eq:Hz"&gt;&lt;/a&gt;&lt;a name="eq:Hz"&gt;&lt;/a&gt;&lt;img width="406" height="58" border="0" src="https://technick.net/img/guide_edft/guide_edft_img259.gif" alt="\" egin="" isplaymath="" z="" rac="" z="" z="" rac="" b="" b="" cdots\="" b="b" a="a" z="" dots="" a="" a="a" z="" a="a" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>11. Maintaining Fleet Batteries</title><link>https://technick.net/guides/electronics/bpw/c11_01/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c11_01/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c10_07"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c11_02"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;11. Maintaining Fleet Batteries&lt;/h3&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;Unlike individual battery users, who come to know their batteries &#10; like a good friend, fleet users must share the batteries from &#10; a pool of unknown packs. While an individual user can detect &#10; even a slight reduction in runtime, fleet operators have no &#10; way of knowing the behavior or condition of the battery when &#10; pulling it from the charger. They are at the mercy of the &#10; battery. It’s almost like playing roulette. &lt;/p&gt; &lt;p&gt;&lt;img src="https://technick.net/img/guide_bpw2/c11_01.gif" width="230" height="106" align="right" vspace="19" hspace="19" border="0" alt="" /&gt;It &#10; is recommended that fleet battery users set up a battery maintenance &#10; program. Such a plan exercises all batteries on a regular &#10; basis, reconditions those that fall below a set target capacity &#10; and ‘weeds out’ the deadwood. Usually, batteries get serviced &#10; only when they no longer hold a charge or when the equipment &#10; is sent in for repair. As a result, battery-operated equipment &#10; becomes unreliable and battery-related failures often occur. &#10; The loss of adequate battery power is as detrimental as any &#10; other malfunction in the system.&lt;/p&gt; &lt;p&gt;Implementing a battery maintenance plan requires &#10; an effort by management to schedule the required service for &#10; the battery packs. This should become an integral component &#10; of an organization’s overall equipment maintenance and repair &#10; activities. A properly managed program improves battery performance, &#10; enhances reliability and cuts replacement costs.&lt;/p&gt; &lt;p&gt;The maintenance plan should include all rechargeable &#10; batteries in use. Large organizations often employ a variety &#10; of batteries ranging from wireless communications, to mobile &#10; computing, to emergency medical equipment, to video cameras, &#10; portable lighting and power tools. The performance of these &#10; batteries is critical and there is little room for failure.&lt;/p&gt; &lt;p&gt;Whether the batteries are serviced in-house with &#10; their own battery analyzers or sent to an independent firm &#10; specializing in that service, sufficient spare batteries are &#10; required to replace those packs that have been temporarily &#10; removed. When the service is done on location and the batteries &#10; can be reinstated within 24&amp;nbsp;hours, only five spares in &#10; a fleet of 100&amp;nbsp;batteries are required. This calculation &#10; is based on servicing five batteries per day in a 20&amp;nbsp;workday &#10; month, which equals100&amp;nbsp;batteries per month. If the batteries &#10; are sent away, five spares are needed for each day the batteries &#10; are away. If 100&amp;nbsp;batteries are absent for one week, for &#10; example, 35&amp;nbsp;spare batteries are needed.&lt;/p&gt; &lt;p&gt;Manufacturers of portable equipment support battery &#10; maintenance programs. Not only does such a plan reduce unexpected &#10; downtime, a well-performing battery fleet makes the equipment &#10; work better. If the recurring problems relating to the battery &#10; can be eliminated, less equipment is sent to the service centers. &#10; A well-managed battery maintenance program also prolongs battery &#10; life, a benefit that looks good for the vendor.&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>11. Maintaining Fleet Batteries 2</title><link>https://technick.net/guides/electronics/bpw/c11_02/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c11_02/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c11_01"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c11_03"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;11.1 The ‘Green Light’ Lies&lt;/h4&gt;&lt;p&gt; &lt;h2&gt;&lt;/h2&gt; &lt;/p&gt;&lt;p&gt;When charging a battery, the ready light will &#10; eventually illuminate, indicating that the battery is fully &#10; charged. The user assumes that the battery has reached its &#10; full potential and the battery is taken in confidence.&lt;/p&gt; &lt;p&gt;In no way does the ‘green light’ guarantee sufficient &#10; battery capacity or assure good state-of-health (SoH). Similar &#10; to a toaster that pops up the bread when brown (or black), &#10; the charger fills the battery with energy and ‘pops’ it to &#10; ready when full (or&amp;nbsp;warm).&lt;/p&gt; &lt;p&gt;The rechargeable battery is a corrosive device &#10; that gradually loses its ability to hold a charge. Many users &#10; in an organization are unaware that their fleet batteries &#10; barely last a day with no reserve energy to spare. In fact, &#10; weak batteries can hide comfortably because little demand &#10; is placed on them in a routine day. The situation changes &#10; when full performance is required during an emergency. Total &#10; collapse of portable systems is common and such breakdowns &#10; are frequently related to poor battery performance. Figure&amp;nbsp;11-1 &#10; shows five batteries in various states of degradation.&lt;/p&gt; &lt;p&gt;&lt;img width="375" height="281" src="https://technick.net/img/guide_bpw2/c11_02.gif" v:shapes="_x0000_i1028" border="0" alt="" /&gt;&lt;/p&gt; &lt;p class="caption"&gt;Figure&amp;nbsp;11-1:&amp;nbsp; Progressive loss of charge &#10; acceptance.&lt;br /&gt; &lt;span class="caption-sub"&gt;The rechargeable battery is a corrosive &#10; device that gradually loses its ability to hold charge as &#10; part of natural aging, incorrect use and/or lack of maintenance. &#10; The unusable part of the battery that creeps in is referred &#10; to as ‘rock content’.&lt;/span&gt;&lt;/p&gt; &lt;p&gt;Carrying larger packs or switching to higher &#10; energy-dense chemistries does not assure better reliability &#10; if the weak batteries are not ‘weeded’ out at the appropriate &#10; time. Likewise, the benefit of using ultra-advanced battery &#10; systems offers little advantage if packs are allowed to remain &#10; in the fleet once their performance has dropped below an acceptable &#10; performance level.&lt;/p&gt; &lt;p&gt;Figure&amp;nbsp;11-2 illustrates&lt;i&gt; &lt;/i&gt;four &#10; batteries with different ratings and SoH conditions. Batteries &#10; B, C and D show reduced performance because of memory problems &#10; and other deficiencies. The worst pack is Battery D. Because &#10; of its low charge acceptance, this battery might switch to &#10; ready after only 14&amp;nbsp;minutes of charge (assumed time). &#10; Ironically, this battery is a likely candidate to be picked &#10; when a fresh battery is required in a hurry. Unfortunately, &#10; it will last only for a brief moment. Battery A, on the other &#10; hand, has the highest capacity and takes the longest to charge. &#10; Because the ready light is not yet lit, this battery is least &#10; likely picked.&lt;/p&gt; &lt;p&gt;&lt;img width="430" height="273" src="https://technick.net/img/guide_bpw2/c11_03.gif" v:shapes="_x0000_i1029" border="0" alt="" /&gt;&lt;/p&gt; &lt;p class="caption"&gt;Figure&amp;nbsp;11-2:&amp;nbsp; Comparison of charge and &#10; discharge times.&lt;br /&gt; &lt;span class="caption-sub"&gt;This illustration shows typical &#10; charge and discharge times for batteries with different ratings &#10; and SoH conditions. Carrying larger batteries or switching &#10; to high energy-dense chemistries does not necessarily assure &#10; longer runtime if deadwood is allowed to remain in the battery &#10; fleet.&lt;/span&gt;&lt;/p&gt; &lt;p&gt;&lt;img width="227" height="122" src="https://technick.net/img/guide_bpw2/c11_04.gif" align="left" hspace="19" vspace="19" alt="Text Box: The bad batteries tend to gravitate to the top. They become a target for the unsuspecting user." v:shapes="_x0000_s1027" border="0" /&gt;The weak batteries are charged quicker and remain on ‘ready’ &#10; longer than the strong ones. The bad batteries tend to gravitate &#10; to the top. They become a target for the unsuspecting user. &#10; In an emergency situation that demands quick charge action, &#10; the batteries that show ready may simply be those that are &#10; deadwood.&lt;/p&gt; &lt;p&gt;A weak battery can be compared to a fuel tank &#10; with an indentation. Refueling this tank is quicker than a &#10; normal tank because it holds less fuel. Similar to the ‘green &#10; light’ on a charger, the fuel gauge in the vehicle will show &#10; full when filled to the brim, but the distance traveled before &#10; refueling will be short.&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>11. Maintaining Fleet Batteries 3</title><link>https://technick.net/guides/electronics/bpw/c11_03/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c11_03/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c11_02"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c12_01"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;11.2 Battery Maintenance, a Function of Quality Control&lt;/h4&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;The reliability of portable equipment relies &#10; almost entirely on the performance of the battery. A dependable &#10; battery fleet can only be assured if batteries are maintained &#10; on a periodic basis.&lt;/p&gt; &lt;p&gt;Battery maintenance also needs proper documentation. &#10; One simple method is attaching a color dot, each color indicating &#10; the month of service. A different color dot is applied when &#10; the battery is re-serviced the following month. A numbering &#10; system indicating the month of service also works&amp;nbsp;well.&lt;/p&gt; &lt;p&gt;A better system is attaching a full battery label&amp;nbsp;containing &#10; service date and capacity. Like the pending service on a car, &#10; the label shows the user when maintenance is due. For critical &#10; missions, the user will pick a battery with the highest capacity &#10; and the most recent service date. The label ensures a properly &#10; serviced replacement&amp;nbsp;pack.&lt;/p&gt; &lt;p&gt;Battery analyzers are available that print a &#10; label revealing the organization, group, service date, expiry &#10; date (time to service the battery), battery capacity and ID &#10; number. The label is generated automatically when the battery &#10; is removed from the analyzer. Figure&amp;nbsp;11-3 illustrates &#10; such a label.&lt;/p&gt; &lt;table border="0" cellspacing="0" cellpadding="0"&gt; &lt;tr&gt; &#10; &lt;td width="243"&gt; &#10; &lt;p style="'&lt;span&#10; style='" styleref="" s=""&gt;"&amp;gt;&lt;img src="https://technick.net/img/guide_bpw2/c11_05.jpg" width="240" height="167" border="0" alt="" /&gt;&lt;/p&gt; &lt;p class="caption" style="'&lt;span&#10; style='" styleref="" s=""&gt;"&amp;gt;11-3:&amp;nbsp; Sample battery label.&lt;br /&gt; &lt;span class="caption-sub"&gt;The battery label keeps track &#10; of the battery in the same way a service sticker on &#10; a car reminds the owner of pending service.&lt;/span&gt;&lt;/p&gt; &lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;p&gt;The battery labeling system is simple to manage. &#10; It is self-governing in the sense that the users would only &#10; pick a battery that is properly labeled and has recently been &#10; serviced. The system does not permit batteries to fall though &#10; the cracks and be forgotten. It is in the interest of the &#10; user to ensure continued reliability by bringing in batteries &#10; with dated labels for service.&lt;/p&gt;&lt;h4&gt;11.3 Battery Maintenance Made Simple&lt;/h4&gt; &lt;p&gt;Several methods are available to maintain a fleet &#10; of batteries. A simple, self-governing system is illustrated &#10; in Figure&amp;nbsp;11-4 to Figure&amp;nbsp;11-6. Only &#10; 30&amp;nbsp;minutes per day should be required for a technician &#10; to maintain the system. One or several battery analyzers are &#10; needed that are capable of producing battery labels.&lt;/p&gt; &lt;p&gt;&lt;img width="384" height="295" src="https://technick.net/img/guide_bpw2/c11_06.jpg" v:shapes="_x0000_i1025" border="0" alt="" /&gt;&lt;/p&gt; &lt;p class="caption"&gt;Figure&amp;nbsp;11-4:&amp;nbsp; Sorting batteries for servicing.&lt;br /&gt; &lt;span class="caption-sub"&gt;Each time a battery is taken from &#10; the charger, the user checks the service date on the label &#10; attached to the battery. If the date has expired, the battery &#10; is placed in a box marked ‘To be serviced’.&lt;/span&gt;&lt;/p&gt; &lt;p style="'"&gt;&lt;img width="384" height="280" src="https://technick.net/img/guide_bpw2/c11_07.jpg" v:shapes="_x0000_i1026" border="0" alt="" /&gt;&lt;/p&gt; &lt;p class="caption"&gt;Figure&amp;nbsp;11-5:&amp;nbsp; Servicing expired batteries.&lt;br /&gt; &lt;span class="caption-sub"&gt;Batteries with expired dates are &#10; exercised; those that do not recover to the preset target &#10; capacity are reconditioned. Batteries that pass are re-certified &#10; by attaching a new label with dates and capacity reading.&lt;/span&gt;&lt;/p&gt; &lt;p&gt;&lt;img width="384" height="294" src="https://technick.net/img/guide_bpw2/c11_08.jpg" v:shapes="_x0000_i1027" border="0" alt="" /&gt;&lt;/p&gt; &lt;p class="caption"&gt;Figure&amp;nbsp;11-6:&amp;nbsp; Returning batteries to circulation.&lt;br /&gt; &lt;span class="caption-sub"&gt;After servicing, the restored batteries &#10; are returned to the charger; those that failed are replaced &#10; with new ones. Battery maintenance assures that all packs &#10; perform at the expected capacity level.&lt;/span&gt;&lt;/p&gt; &lt;p&gt;When taking a battery from the charger, the user &#10; checks the service date on the battery label. If expired, &#10; the battery is placed into the box marked: ‘To be serviced’. &#10; Periodically, the box is removed and the batteries are serviced &#10; and re-certified with a battery analyzer.&lt;/p&gt; &lt;p&gt;After service, the batteries are re-labeled and &#10; returned to the charger. Those batteries that fail to meet &#10; the target capacity are replaced with new packs. All batteries &#10; in the charger are now certified to meet a required performance &#10; standard.&lt;/p&gt; &lt;p&gt;Battery maintenance has been simplified with &#10; the introduction of battery analyzers that offer a target &#10; capacity&amp;nbsp;selection. All batteries must meet a user-defined &#10; performance test or target capacity to pass. Nickel-based &#10; batteries that fall short of the required capacity are automatically &#10; restored with the analyzer’s recondition cycle. Those packs &#10; that fail to recover are subsequently replaced with new packs.&lt;/p&gt; &lt;p&gt;Recondition is only effective for nickel-based &#10; batteries. It is worth noting that batteries with high self-discharge &#10; and/or shorted cells cannot be corrected with recondition; &#10; neither can a battery be restored that is worn out or has &#10; been damaged through abuse.&lt;/p&gt; &lt;p&gt;Another group of batteries that cannot be deep &#10; discharged by recondition are ‘smart’ batteries. This includes &#10; any pack that contains a microchip that must be maintained &#10; by a continuous voltage supply. Discharging these batteries &#10; below a certain voltage point will put the battery to sleep. &#10; A recharge often fails to wake up these batteries.&lt;/p&gt;&lt;h4&gt;11.4 Battery Maintenance as a Business&lt;/h4&gt; &lt;p&gt;Some entrepreneurs have come up with the novel &#10; idea of providing a service to test and restore rechargeable &#10; batteries. They operate in convenient locations such as downtown &#10; cores, shopping malls and transportation hubs. Customers bring &#10; in their batteries to have them serviced. The packs are tested &#10; and reconditioned with automated battery analyzers. A full &#10; performance report is issued with each battery serviced, showing &#10; service date, performance status and the date for the next &#10; service. The suggested fee per battery is $10.00US. Higher &#10; prices can be requested on specialty batteries which are expensive &#10; to replace.&lt;/p&gt; &lt;p&gt;For organizations using a large number of batteries, &#10; a special pick-up and delivery service can be organized to &#10; provide scheduled maintenance. This ensures that fleet batteries &#10; used by organizations are regularly maintained. Such a service &#10; would benefit firms that do not want to bother with battery &#10; maintenance or do not have the expertise or resources to perform &#10; the task in-house.&lt;/p&gt; &lt;p&gt;Increasingly, dealers who sell mobile phones, laptops and &#10; camcorders also provide battery service. This activity increases &#10; traffic and helps foster good customer relations. A new battery &#10; is sold if the old one does not recover when serviced. By &#10; knowing that a battery can be checked and possibly restored, &#10; customers may try to salvage their weak batteries before investing &#10; in new ones. Some dealers may be reluctant to restore used &#10; batteries for fear of reduced battery sales.&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>12. Battery Maintenance Equipment</title><link>https://technick.net/guides/electronics/bpw/c12_01/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c12_01/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c11_03"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c12_02"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;12. Battery Maintenance Equipment&lt;/h3&gt;&lt;p&gt; &lt;img width="274" height="146" src="https://technick.net/img/guide_bpw2/c12_01.gif" align="left" hspace="19" vspace="19" alt="Text Box: The dealers are simply not equipped to handle the influx of returned batteries, neither is the staff trained to perform this task on a customer service level." v:shapes="_x0000_s1026" border="0" /&gt;With the increasing volume of batteries in circulation, &#10; battery manufacturing is outpacing the supply of suitable equipment &#10; to test these packs. This void is especially apparent in the &#10; mobile phone market where large quantities of batteries are &#10; being replaced under warranty without checking or attempting &#10; to restore them. The dealers are simply not equipped to handle &#10; the influx of returned batteries, neither is the staff trained &#10; to perform this task on a customer service level. Testing and &#10; conditioning these batteries is a complex procedure that lies &#10; outside the capabilities of most customer service clerks. &#10; &lt;/p&gt;&lt;p&gt;With the move to maintenance-free batteries and &#10; the need to test larger numbers of batteries, the function &#10; of battery test equipment is changing. Lengthy cycling is &#10; giving way to quick testing, improved battery preparation &#10; and better customer service. This shift in priority is especially &#10; apparent in the rapidly growing consumer market. In this chapter &#10; we examine modern battery analyzers and how they adapt to &#10; the changing needs of battery service.&lt;/p&gt;&lt;h4&gt;12.1 Conditioning Chargers&lt;/h4&gt; &lt;p&gt;Charging batteries is often not enough, especially &#10; when it comes to nickel-based chemistries. Periodic maintenance &#10; is needed to optimize battery life. Some innovative manufacturers &#10; offer chargers with conditioning features. The most basic &#10; charger models feature one or several bays with discharge &#10; opportunity. More advanced chargers include a display to reveal &#10; the capacity.&lt;/p&gt; &lt;p&gt;Some chargers offer pulse charge methods. This &#10; is done to improve charge efficiency and reduce the memory &#10; phenomenon on nickel-based batteries. Optimal charge performance &#10; is achieved by using a pulse charge that intersperses discharge &#10; pulses between charge pulses. Commonly referred to as ‘burp’ &#10; or ‘reverse&lt;b&gt; &lt;/b&gt;load’ charge, this charge method promotes &#10; high surface area on the electrodes and helps in the recombination &#10; of the gases generated during charge.&lt;/p&gt; &lt;p&gt;Some manufacturers claim that the pulse charge &#10; method conditions and restores NiCd batteries and makes the &#10; periodic discharges redundant. Research carried out by the &#10; US Army has revealed that pulse charging does reduce the crystalline &#10; formation on the NiCd battery. If properly administered, batteries &#10; charged with these pulse chargers prolong service life. For &#10; batteries with advanced memory, however, the pulse charge&amp;nbsp;method &#10; alone is not sufficient and a full discharge or recondition &#10; cycle is needed to break down the more stubborn crystalline &#10; formation.&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>12. Battery Maintenance Equipment 2</title><link>https://technick.net/guides/electronics/bpw/c12_02/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c12_02/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c12_01"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c12_03"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;12.2 Battery Analyzers&lt;/h4&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;There are two types of battery analyzers: the &#10; fixed current units and the programmable devices. While fixed &#10; current units are less expensive and generally simpler to &#10; operate, programmable analyzers are more accurate and faster. &#10; Programmable units can better adapt to different battery needs &#10; and are more effective in restoring weak batteries. One of &#10; the main advantages of the programmable battery analyzer is &#10; the ability to test the batteries against preset parameters.&lt;/p&gt; &lt;p&gt;Fixed current analyzers perform well in organizations &#10; that use medium size batteries ranging from 600mAh to 1500mAh. &#10; If smaller or larger batteries are serviced, the charge and &#10; discharge currents are compromised and the program time is &#10; prolonged. Here is the reason&amp;nbsp;why.&lt;/p&gt; &lt;p&gt;A fixed current battery analyzer with a current &#10; of 600mA, for example, services a 600mAh battery in about &#10; three&amp;nbsp;hours, roughly one&amp;nbsp;hour for each cycle starting &#10; with charge, followed by discharge and a final charge. Servicing &#10; an 1800mAh battery would take three times as long. On the &#10; low end of the scale, a problem may arise if a 400mAh battery &#10; is serviced. This battery may not be capable of accepting &#10; a charge rate higher than 1C and the battery could be damaged.&lt;/p&gt; &lt;p&gt;When purchasing a battery analyzer, there is &#10; a tendency to buy according to price. With the need to service &#10; a larger volume of batteries of a wider variety, second-generation &#10; buyers find the advanced features on upscale models worth &#10; the extra cost. These features manifest themselves in reduced &#10; operator time, increased, throughput, simpler operation and &#10; the use of less trained staff. Adaptation to new battery systems &#10; is also made easier. Figure&amp;nbsp;12-1 illustrates an &#10; advanced battery analyzer.&lt;/p&gt; &lt;p&gt;&lt;img width="350" height="295" src="https://technick.net/img/guide_bpw2/c12_02.jpg" v:shapes="_x0000_i1034" border="0" alt="" /&gt;&lt;/p&gt; &lt;p&gt;&lt;span class="caption"&gt;Figure&amp;nbsp;12-1:&amp;nbsp; Cadex &lt;i&gt;7400&lt;/i&gt; &#10; battery analyzer&lt;/span&gt;&lt;br /&gt; &lt;span class="caption-sub"&gt;The Cadex &lt;i&gt;7400 &lt;/i&gt;services NiCd, &#10; NiMH, SLA and Li-ion/polymer batteries and is programmable &#10; to a wide range of voltage and current settings. Custom battery &#10; adapters simplify the interface with different battery types. &#10; A quick test program measures battery state-of-health in three &#10; minutes, independent of charge. Nickel-based batteries are &#10; automatically restored if the capacity falls below the user-defined &#10; target capacity.&lt;/span&gt;&lt;/p&gt; &lt;p&gt;An advanced battery analyzer evaluates the condition &#10; of a battery and implements the appropriate service to restore &#10; the battery’s performance. On nickel-based systems, a recondition &#10; cycle is applied automatically if a user-selected capacity &#10; level cannot be reached.&lt;/p&gt; &lt;p&gt;Battery chemistry, voltage and current ratings &#10; are user-programmable. These parameters are stored in interchangeable &#10; battery adapters and configure&amp;nbsp;the analyzer to the correct &#10; function when the adapter is installed. In the Cadex &lt;i&gt;7000 &#10; Series&lt;/i&gt; battery analyzers, for example, each adapter is &#10; preprogrammed with up to ten distinct configuration codes&amp;nbsp;(C-codes) &#10; to enable service for all batteries with the same footprint.&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>12. Battery Maintenance Equipment 3</title><link>https://technick.net/guides/electronics/bpw/c12_03/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c12_03/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c12_02"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c12_04"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;Battery-specific adapters are available for all &#10; major batteries; user-programmable cables with alligator clips &#10; accommodate batteries for which no adapter is on hand. Batteries &#10; with shorted, mismatched or soft cells are identified in minutes &#10; and their deficiencies are displayed on the LCD panel.&lt;/p&gt; &lt;p&gt;User-selectable programs address different &#10; battery needs. The Cadex &lt;i&gt;7000 Series&lt;/i&gt; features &lt;i&gt;‘Prime’&lt;/i&gt; &#10; to prepare a new battery for field use and &lt;i&gt;‘Auto’ &lt;/i&gt;to &#10; test and recondition weak batteries from the field. &lt;i&gt;‘Custom’&lt;/i&gt; &#10; allows the setting of unique cycle sequences composed of charge, &#10; discharge, recondition, trickle charge or any combination, &#10; including rest periods and repeats.&lt;/p&gt; &lt;p&gt;More and more battery analyzers now measure the &#10; internal battery resistance, a feature that enables one to &#10; test a battery in a few seconds. The resistance check works &#10; best with lithium-based batteries because the level of internal &#10; cell resistance is in direct reflection to the performance. &#10; The resistance measurements can also be used for NiMH batteries &#10; but the readings do not fully disclose the battery’s condition.&lt;/p&gt; &lt;p&gt;One of the most powerful features offered in &#10; modern battery analyzers is battery quick testing. Within &#10; two to five minutes, reasonably accurate state-of-health (SoH) &#10; readings are available. The test is independent of the state-of-charge &#10; (SoC). Some charge is needed, however, to facilitate the&amp;nbsp;test.&lt;/p&gt; &lt;p&gt;New requirements of battery analyzers are the &#10; ultra-fast charge and quick prime features. When a battery &#10; is inserted, the analyzer evaluates the battery, applies an &#10; ultra-fast charge if needed, and prepares the battery for &#10; service within minutes. Such a feature helps the mobile phone &#10; industry, which receives a large number of batteries under &#10; warranty. With the proper equipment, many of these presumably &#10; faulty batteries can be jump-started instead of replaced.&lt;/p&gt; &lt;p&gt;To accurately test batteries that power digital &#10; equipment, a modern battery analyzer is capable of discharging &#10; a battery under a simulated digital load. The GSM waveform, &#10; for example, transmits voice data in 567&amp;nbsp;ms bursts with &#10; currents of 1.5A and higher. By simulating these pulses, the &#10; performance of a battery can be tested under these field conditions. &#10; Not all analyzers are capable of simulating such short current &#10; bursts. Instead, medium-priced battery analyzers use a slower &#10; motion to accommodate the load signals. Pulse duration of &#10; 5&amp;nbsp;ms, or ten times slower than the true GSM, is commonly&amp;nbsp;used.&lt;/p&gt; &lt;p&gt;Another application involving uneven load demand &#10; is the so-called 5-5-90&amp;nbsp;program used to simulate &#10; the runtime of analog two-way radios. The battery is loaded &#10; 5&amp;nbsp;percent of the time on transmit, 5&amp;nbsp;percent on &#10; receive and 90&amp;nbsp;percent on standby. Other combinations &#10; are 10-10-80. Each stage can be programmed to the appropriate &#10; discharge current. Because of the different load conditions, &#10; calculating the predicted runtime in the absence of a battery &#10; analyzer would be difficult.&lt;/p&gt; &lt;p&gt;Easy operation is an important feature of any &#10; battery analyzer. This quality is appreciated because the &#10; user is confronted with an ever-increasing number of battery &#10; types. Displaying the battery capacity in&amp;nbsp;percentage &#10; of the nominal capacity rather than in milliampere-hours (mAh) &#10; is preferred by many users. With the&amp;nbsp;percentage readout, &#10; the user does not need to memorize the ratings of each battery &#10; tested because this battery information is stored in the system. &#10; The&amp;nbsp;percentage readout allows an added level of automation &#10; by implementing a recondition cycle if the set target capacity &#10; level cannot be reached.&lt;/p&gt; &lt;p&gt;Some analyzers are capable of setting the appropriate &#10; battery parameters automatically when a battery is inserted. &#10; An intelligent battery adapter reads a passive code that is &#10; imbedded in most batteries. The code may consist of a jumper, &#10; resistor or specified thermistor value. Some battery packs &#10; contain a memory chip that holds a digital code. On recognition &#10; of the battery, the adapter assigns the correct service parameters. &#10; Automatic battery identification minimizes training and allows &#10; battery service by untrained staff.&lt;/p&gt; &lt;p&gt;Most analyzers are capable of printing service &#10; reports and battery labels. This feature simplifies the task &#10; of keeping track of batteries. Marking batteries with the &#10; service date reminds the user when a battery is due for service. &#10; Labeling works well because the basic service history is attached &#10; right to the battery.&lt;/p&gt; &lt;p&gt;A battery analyzer should be automated and require &#10; minimal operator time. The task of the operator should be &#10; limited to scheduling incoming batteries for testing, marking &#10; the batteries after service, and replacing those that did &#10; not meet the performance criteria. Occasional selection of &#10; the correct current rating and chemistry may also be necessary. &#10; Properly used, a battery analyzer generates major cost savings &#10; in terms of longer battery life and more dependable service.&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>12. Battery Maintenance Equipment 4</title><link>https://technick.net/guides/electronics/bpw/c12_04/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c12_04/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c12_03"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c12_05"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;12.3 Battery Analyzers for Maintenance-Free Batteries&lt;/h4&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;In the past, the purpose of battery analyzers &#10; was to restore NiCd batteries affected by ‘memory’. With today’s &#10; nickel-free batteries, memory is no longer a problem and the &#10; modern battery analyzer assumes duties other than conditioning &#10; weak batteries. In an environment with nickel-free batteries, &#10; the purpose of an analyzer is shifting to performance verification, &#10; quality control, quick testing and quick priming.&lt;/p&gt;</description></item><item><title>12. Battery Maintenance Equipment 5</title><link>https://technick.net/guides/electronics/bpw/c12_05/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c12_05/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c12_04"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c13_01"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;12.5 Battery Maintenance Software&lt;/h4&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;Organizations servicing portable equipment need &#10; simplified battery testing. The difficulty of testing batteries &#10; is brought on by the proliferation of batteries, both in volume &#10; and diversity of models. With most standalone battery test &#10; equipment, servicing batteries with conventional methods is &#10; complex and time consuming. This task will only get more difficult &#10; as new battery models are added, almost weekly. New chemistries &#10; are being introduced which have different service requirements.&lt;/p&gt; &lt;p&gt;Manufacturers of battery test equipment are responding &#10; by introducing software packages that run on a PC. Many new &#10; systems enable operating the battery analyzers through a PC. &#10; Such products bring battery maintenance within reach of the &#10; untrained operator.&lt;/p&gt; &lt;p&gt;Cadex&lt;i&gt; Batteryshop™&lt;/i&gt; is a system that integrates &#10; with the Cadex &lt;i&gt;7000&lt;/i&gt; &lt;i&gt;Series &lt;/i&gt;battery analyzers. &#10; Although the analyzers are stand-alone units that can think &#10; on their own, the software overrides the analyzer to adjust &#10; the settings, and stores the test results obtained from the &#10; batteries. Figure&amp;nbsp;12-2 illustrates such a battery &#10; maintenance system.&lt;/p&gt; &lt;p&gt;&lt;img width="461" height="256" src="https://technick.net/img/guide_bpw2/c12_05.jpg" v:shapes="_x0000_i1025" border="0" alt="" /&gt;&lt;/p&gt; &lt;p class="caption"&gt;Figure&amp;nbsp;12-2:&amp;nbsp; Components of a battery &#10; maintenance system.&lt;br /&gt; &lt;span class="caption-sub"&gt;Cadex &lt;i&gt;Batteryshop&lt;/i&gt;™&amp;nbsp;stores &#10; the battery test results on the database. Point and click &#10; technology programs the analyzer by selecting the battery &#10; from a listing of over 2000 commercial batteries. The system &#10; accommodates up to 120 analyzers for simultaneous service &#10; of 480 batteries.&lt;/span&gt;&lt;/p&gt; &lt;p&gt;Here are examples of how a computer-assisted &#10; battery testing system can simplify operation. To service &#10; a battery with Cadex&lt;i&gt; Batteryshop™,&lt;/i&gt; for example, the &#10; user selects the battery model from the database, clicks the &#10; mouse, and the analyzer is automatically configured to the &#10; correct battery parameters. Programming the analyzer by scanning &#10; the bar code identifying the battery’s model number is also &#10; possible.&lt;/p&gt; &lt;p&gt;In the near future, the operator will be able &#10; to view a picture of the battery on a PC monitor. Clicking &#10; on the image will reveal the various models available in that &#10; battery family. Clicking on the correct model will program &#10; the analyzer.&lt;/p&gt; &lt;p&gt;For battery fleet operators, keeping track of &#10; a large battery fleet can be difficult, especially when observing &#10; the periodic maintenance requirements. With systems such as &#10; Cadex&lt;i&gt; Batteryshop™,&lt;/i&gt; the battery test results can be &#10; stored in the database. This feature enables the operator &#10; to retain battery records from birth to retirement. Here is &#10; how this is done:&lt;/p&gt; &lt;p&gt;Each battery is marked with a permanent bar code &#10; label containing a unique battery ID number. When servicing &#10; the battery, the user scans the battery ID and the analyzer &#10; is automatically configured through the PC. All battery test &#10; results are stored and updated in the database under the assigned &#10; battery ID number. Any reference to this battery in terms &#10; of performance, maintenance history and even vendor information &#10; is available with a click of a mouse.&lt;/p&gt; &lt;p&gt;Delivering batteries with consistent high quality &#10; is a concern for all battery manufacturers and distributors. &#10; With advanced battery maintenance systems, battery batches &#10; can be tested and documented to satisfy quality control standards. &#10; Voltage, current and temperature information can be displayed &#10; in real-time graphics.&lt;/p&gt; &lt;p&gt;Cadex &lt;i&gt;Batteryshop&lt;/i&gt;™, includes&lt;i&gt; &lt;/i&gt;specialty &#10; programs that may not be available on other software products. &#10; For example, the program allows discharging a battery under &#10; a given pulsed current to simulate digital load requirements. &#10; Other programs include life cycling to evaluate the battery’s &#10; longevity, self-discharge tests, quick formatting and priming. &#10; The Internet allows updating the battery database to include &#10; new entries, fetching battery matrix settings for quick testing, &#10; sending battery test results to a central location, and downloading &#10; of new firmware for the Cadex &lt;i&gt;7000 Series&lt;/i&gt; battery analyzers. &#10; &lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>12. Conclusions</title><link>https://technick.net/guides/theory/dar/012/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dar/012/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/resample/"&gt;The Digital Audio Resampling Home Page&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, Copyright &amp;#169; &lt;i&gt;2016-05-17&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dar/011"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dar/000"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dar/013"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;Conclusions&lt;/h3&gt;&lt;p&gt;A digital &lt;a href="https://technick.net/guides/theory/dar/000"&gt;resampling&lt;/a&gt; method has been described which is convenient for&lt;a href="https://technick.net/guides/theory/dar/000"&gt;bandlimited interpolation&lt;/a&gt; at arbitrary times and for smoothly varying&lt;a href="https://ccrma.stanford.edu/~jos//st/Shannon_s_Sampling_Theorem.html" target="_blank"&gt;sampling rates&lt;/a&gt;, and which is attractive for hardware implementation. We&#10;have presented the case which assumes uniform sampling of the input signal;&#10;however, extensions to variable sampling rates and isolated-point evaluation&#10;are straightforward.&lt;/p&gt;&lt;p&gt;A quantization error analysis led to the conclusion that for &lt;img width="23" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img89.gif" alt="${n_c}$" /&gt;-bit&lt;a href="https://technick.net/guides/theory/edft/010"&gt;filter&lt;/a&gt; coefficients, the number of &lt;a href="https://technick.net/guides/theory/edft/010#2321"&gt;impulse&lt;/a&gt;-response samples stored in the&#10;filter lookup table should be on the order of &lt;img width="43" height="20" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img200.gif" alt="$2^{{n_c}/2}$" /&gt; times the number&#10;of ``zero-crossings'' in the impulse response, and the number of bits in&#10;the interpolation between impulse-response samples should be about &lt;img width="41" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img201.gif" alt="${n_c}/2$" /&gt;.&#10;With these choices, the &lt;a href="https://ccrma.stanford.edu/~jos//Interpolation/Linear_Interpolation.html" target="_blank"&gt;linear interpolation&lt;/a&gt; error and the error due to&#10;quantized interpolation factors are each about equal to the coefficient&#10;quantization error. A signal resampler designed according to these rules&#10;will typically be limited primarily by the lowpass filter &lt;i&gt;design&lt;/i&gt;,&#10;rather than by quantization effects.&lt;/p&gt;&lt;p&gt;We note that the error analysis presented here is pessimistic in the sense&#10;that it assumes worst-case input signal conditions (e.g., a sinusoid at&#10;half the sampling rate or white &lt;a href="http://www.treasure-troves.com/physics/Noise.html" target="_blank"&gt;noise&lt;/a&gt;). A different type of error analysis&#10;is possible by treating the filter coefficients as exact but subject to&#10;time jitter. In this approach, the error can be expressed in terms of the&#10;input signal &lt;a href="http://mathworld.wolfram.com/TaylorSeries.html" target="_blank"&gt;Taylor series expansion&lt;/a&gt;, and consequently in terms of the&#10;input signal bandwidth (or maximum slope). Such an analysis reveals that&#10;for most practical signals, the quantization error is considerably less&#10;than the levels derived here.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>12. Frequency Response</title><link>https://technick.net/guides/theory/edft/012/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/edft/012/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/filters/"&gt;Introduction to Digital Filters with Audio Applications&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, Copyright &amp;#169; &lt;i&gt;2017-11-26&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/edft/011"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/000"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/022"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/013"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;Frequency Response&lt;/h3&gt;&lt;p&gt;Beginning with Eq.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/edft/011#eq:YHX"&gt;2.2.1&lt;/a&gt;), we have&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;Y(z)=H(z)X(z),&#10;\end{displaymath}&#10; --&gt;&lt;img width="166" height="36" border="0" src="https://technick.net/img/guide_edft/guide_edft_img260.gif" alt="\" egin="" isplaymath="" z="" z="" z="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where &lt;img width="46" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img242.gif" alt="$X(z)$" /&gt; is the &lt;img width="14" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img1.gif" alt="$z$" /&gt;-transform of the &lt;a href="https://technick.net/guides/theory/edft/010"&gt;filter&lt;/a&gt; input, &lt;img width="44" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img256.gif" alt="$Y(z)$" /&gt; is the &lt;img width="14" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img1.gif" alt="$z$" /&gt;-transform &#10;of the output signal, and &lt;img width="46" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img5.gif" alt="$H(z)$" /&gt; is the filter transfer function. &lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;The &lt;i&gt;&lt;a href="https://technick.net/guides/theory/edft/012"&gt;frequency response&lt;/a&gt;&lt;/i&gt;&lt;a name="2423"&gt;&lt;/a&gt; of a linear time-invariant &lt;a href="http://www.dsptutor.freeuk.com/dfilt1.html" target="_blank"&gt;digital&#10;filter&lt;/a&gt; is defined to be the transfer function, &lt;img width="46" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img5.gif" alt="$H(z)$" /&gt;, evaluated on&#10;the unit circle, that is, &lt;!-- MATH&#10; $H(e^{j\omega})$&#10; --&gt;&lt;img width="61" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img261.gif" alt="$H(e^{j\" mega="" /&gt;.&lt;/p&gt;&lt;p&gt;The frequency response is a complex-valued function of a real&#10;variable. The response at frequency &lt;img width="16" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img262.gif" alt="$f$" /&gt; Hz, for example, is&#10;&lt;!-- MATH&#10; $H(e^{j2\pi fT})$&#10; --&gt;&lt;img width="85" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img263.gif" alt="$H(e^{j2\" i="i" t="" /&gt;, where &lt;img width="18" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img264.gif" alt="$T$" /&gt; is the &lt;a href="https://ccrma.stanford.edu/~jos//st/Shannon_s_Sampling_Theorem.html" target="_blank"&gt;sampling period&lt;/a&gt; in seconds.&lt;/p&gt;&lt;p&gt;Since every complex number can be represented as a magnitude and&#10;angle, the frequency response may be decomposed into two real-valued&#10;functions, the &lt;i&gt;&lt;a href="https://ccrma.stanford.edu/~jos//log/Logarithms.html" target="_blank"&gt;amplitude&lt;/a&gt; response&lt;/i&gt;&lt;a name="2427"&gt;&lt;/a&gt; and the &lt;i&gt;phase response&lt;/i&gt;&lt;a name="2429"&gt;&lt;/a&gt;.&#10;Formally, we may define them as follows:&lt;br /&gt;&lt;div align="CENTER"&gt;&lt;a name="eq:Polar"&gt;&lt;/a&gt;&lt;!-- MATH&#10; \begin{eqnarray}&#10;G(\omega)&amp;\isdef &amp; \left\| H(e^{j\omega})\right\| \\&#10;\Theta(\omega)&amp;\isdef &amp; \angle H(e^{j\omega})&#10;\end{eqnarray}&#10; --&gt;&lt;table align="CENTER" cellpadding="0" width="100%"&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&lt;img width="51" height="41" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img265.gif" alt="$\" isplaystyle="" mega="" /&gt;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="21" height="49" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img74.gif" alt="$\" extstyle="" sdef="" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="87" height="51" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img266.gif" alt="$\" isplaystyle="" eft\vert="" j\omega="" ight\vert="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(48)&lt;/td&gt;&lt;/tr&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&lt;img width="51" height="41" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img267.gif" alt="$\" isplaystyle="" heta="" mega="" /&gt;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="21" height="49" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img74.gif" alt="$\" extstyle="" sdef="" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="79" height="45" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img268.gif" alt="$\" isplaystyle="" ngle="" j\omega="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(49)&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;so that &lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;H(e^{j\omega}) = G(\omega)\,e^{j\Theta(\omega)}.&#10;\end{displaymath}&#10; --&gt;&lt;a name="eq:Hpolar"&gt;&lt;/a&gt;&lt;a name="eq:Hpolar"&gt;&lt;/a&gt;&lt;img width="194" height="36" border="0" src="https://technick.net/img/guide_edft/guide_edft_img269.gif" alt="\" egin="" isplaymath="" e="" omega="" omega="" j\theta="" mega="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Thus &lt;img width="46" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img270.gif" alt="$G(\" mega="" /&gt; is the magnitude (or complex modulus) of &lt;!-- MATH&#10; $H(e^{j\omega})$&#10; --&gt;&lt;img width="61" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img261.gif" alt="$H(e^{j\" mega="" /&gt;,&#10;and &lt;!-- MATH&#10; $\Theta(\omega)$&#10; --&gt;&lt;img width="46" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img271.gif" alt="$\" heta="" mega="" /&gt; is the phase (or complex angle) of &lt;!-- MATH&#10; $H(e^{j\omega})$&#10; --&gt;&lt;img width="61" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img261.gif" alt="$H(e^{j\" mega="" /&gt;.&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;The real valued function &lt;img width="46" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img270.gif" alt="$G(\" mega="" /&gt; in Eq.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/edft/012#eq:Polar"&gt;49&lt;/a&gt;) is&#10; called the filter &lt;i&gt;amplitude response&lt;/i&gt;&lt;a name="2440"&gt;&lt;/a&gt; and it specifies the&#10;amplitude &lt;i&gt;gain&lt;/i&gt; that the filter provides at each frequency.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;The function &lt;img width="54" height="38" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img272.gif" alt="$G^2(\" mega="" /&gt; is called the &lt;i&gt;power response&lt;/i&gt; and it specifies the power gain&lt;a name="2442"&gt;&lt;/a&gt; at each frequency.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;The real function &lt;!-- MATH&#10; $\Theta(\omega)$&#10; --&gt;&lt;img width="46" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img271.gif" alt="$\" heta="" mega="" /&gt; in Eq.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/edft/012#eq:Polar"&gt;49&lt;/a&gt;) is the&lt;i&gt;phase response&lt;/i&gt;&lt;a name="2446"&gt;&lt;/a&gt; and it gives the phase shift in radians that&#10;each input component sinusoid will undergo.&lt;/p&gt;&lt;p&gt;If the filter input and output signals are &lt;img width="41" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img236.gif" alt="$x(n)$" /&gt; and &lt;img width="40" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img209.gif" alt="$y(n)$" /&gt;respectively, then&lt;br /&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray}&#10;\left|Y(e^{j\omega})\right| &amp;=&amp;G(\omega)\,\left|X(e^{j\omega})\right|\\&#10;&#9;\angle Y(e^{j\omega}) &amp;=&amp;\Theta(\omega)+\angle X(e^{j\omega}).&#10;\end{eqnarray}&#10; --&gt;&lt;table align="CENTER" cellpadding="0" width="100%"&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&lt;img width="77" height="51" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img273.gif" alt="$\" isplaystyle="" eft\vert="" j\omega="" ight\vert="" /&gt;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="21" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img10.gif" alt="$\" extstyle="$" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="132" height="51" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img274.gif" alt="$\" isplaystyle="" mega="" eft\vert="" j\omega="" ight\vert="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(50)&lt;/td&gt;&lt;/tr&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&lt;img width="77" height="45" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img275.gif" alt="$\" isplaystyle="" ngle="" j\omega="" /&gt;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="21" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img10.gif" alt="$\" extstyle="$" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="156" height="45" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img276.gif" alt="$\" isplaystyle="" heta="" mega="" ngle="" j\omega="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(51)&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>13. Exact Sinc-Interpolation of Sampled Periodic Signals</title><link>https://technick.net/guides/theory/dar/013/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dar/013/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/resample/"&gt;The Digital Audio Resampling Home Page&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, Copyright &amp;#169; &lt;i&gt;2016-05-17&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dar/012"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dar/000"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dar/014"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;Appendix A: Exact Sinc-Interpolation of Sampled Periodic Signals&lt;/h3&gt;&lt;p&gt;It turns out all &lt;i&gt;periodic &lt;/i&gt;sampled signals can be sinc-interpolated&lt;i&gt;exactly &lt;/i&gt;using the following formula [&lt;a href="https://technick.net/guides/theory/dar/015#Schanze"&gt;Schanze&amp;nbsp;1995&lt;/a&gt;]:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;x(t) = {\sin(\pi t) \over 2N} \sum_{n = -L}^{M-1} &#10;&#9;x_n (-1)^n \left[ (-1)^{N+1} \tan\left(\pi {t-n \over 2N} \right)&#10;&#9;&#9; + \cot\left(\pi {t-n \over 2N} \right) \right], &#10;&#9;&#9;\quad N=L+M&#10;\end{displaymath}&#10; --&gt;&lt;img width="762" height="66" border="0" src="https://technick.net/img/guide_dar/guide_dar_img202.gif" alt="\" egin="" isplaymath="" t="" in="" i="" ver="" sum="" l="" m-1="" x="" cot\left="" i="" n="" ver="" right="" ight="" uad="" m="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where the &lt;a href="https://ccrma.stanford.edu/~jos//st/Shannon_s_Sampling_Theorem.html" target="_blank"&gt;sampling rate&lt;/a&gt; is normalized to be &lt;img width="53" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img203.gif" alt="$T=1$" /&gt;, and the period is &lt;img width="103" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img204.gif" alt="$N = L + M$" /&gt; samples.&lt;p&gt;The first step in the derivation is the exact general formula&lt;br /&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray}&#10;x(t) &amp; = &amp; \sum_{n = -\infty}^{\infty} x_n {\sin[\pi (t-n)] \over \pi(t-n)} \\&#10; &amp; = &amp; {\sin(\pi t) \over \pi} \sum_{n = -\infty}^{\infty} x_n {(-1)^n \over t-n}&#10;\end{eqnarray}&#10; --&gt;&lt;table align="CENTER" cellpadding="0" width="100%"&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&lt;img width="41" height="41" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img205.gif" alt="$\" isplaystyle="" /&gt;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="21" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img167.gif" alt="$\" extstyle="$" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="193" height="70" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img206.gif" alt="$\" isplaystyle="" um="" infty="" infty="" x="" sin="" i="" n="" ver="" i="" n="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(14)&lt;/td&gt;&lt;/tr&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&amp;nbsp;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="21" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img167.gif" alt="$\" extstyle="$" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="204" height="70" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img207.gif" alt="$\" isplaystyle="" in="" i="" ver="" i="" um="" infty="" infty="" x="" n="" ver="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(15)&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;which follows immediately from the identity &lt;!-- MATH&#10; $\sin[\pi(t-n)] =&#10;(-1)^n\sin(\pi t)$&#10; --&gt;&lt;img width="237" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img208.gif" alt="$\" in="" i="" n="" sin="" i="" /&gt;. This form can be used to develop a table-based &lt;a href="https://technick.net/guides/theory/dar/000"&gt;sinc&#10;interpolation&lt;/a&gt; algorithm in which the function &lt;img width="30" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img209.gif" alt="$1/t$" /&gt; is sampled, windowed,&#10;and stored in a table over a small range of &lt;img width="12" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img11.gif" alt="$t$" /&gt;. (Reverting to the&#10;weighted sinc table is advisable near an argument of zero where there is a&#10;pole-zero cancellation in the definition of &lt;img width="34" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img210.gif" alt="$\" box="" inc="" /&gt;, i.e., when&#10;&lt;!-- MATH&#10; $\left|t-n\right|\ll 1$&#10; --&gt;&lt;img width="96" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img211.gif" alt="$\" eft\vert="" right\vert\ll="" /&gt;.) Note that when &lt;img width="12" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img11.gif" alt="$t$" /&gt; crosses &lt;img width="14" height="16" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img111.gif" alt="$2$" /&gt;, the &lt;img width="30" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img209.gif" alt="$1/t$" /&gt; table can be&#10;implemented as &lt;!-- MATH&#10; $(1/2)(1/(t/2))$&#10; --&gt;&lt;img width="121" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img212.gif" alt="$(1/2)(1/(t/2))$" /&gt;. In other words, the table between &lt;img width="46" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img213.gif" alt="$t=2$" /&gt;and &lt;img width="46" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img214.gif" alt="$t=4$" /&gt; can be computed from the table between &lt;img width="46" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img215.gif" alt="$t=1$" /&gt; and &lt;img width="46" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img213.gif" alt="$t=2$" /&gt; using a&#10;simple one-bit right-shift on the table address and the table output. If&#10;this trick is used, the table window must be applied separately, but there&#10;ways to synthesize simple windows (e.g., the Hanning or Hamming windows&#10;which consist of a single sinusoidal component) using waveform synthesis&#10;techniques, avoiding a separate table for the interpolated window function.&lt;p&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>13. Making Battery Quick-Test Feasible</title><link>https://technick.net/guides/electronics/bpw/c13_01/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c13_01/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c12_05"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c13_02"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;13. Making Battery Quick-Test Feasible&lt;/h3&gt;&lt;p&gt; When Sanyo, one of the largest battery manufacturers in the &#10; world, was asked, “Is it feasible to quick test batteries?” &#10; the engineer replied decisively, “No”. He based his conclusion &#10; on the difficulty of using a universal test formula that applies &#10; to all battery applications, — from wireless communications &#10; to mobile computing, and from power tools to forklifts and electric &#10; vehicles. &#10; &lt;/p&gt;&lt;p&gt;Several universities, research organizations &#10; and private companies, including Cadex, are striving to find &#10; a workable solution to battery quick testing. Many methods &#10; have been tried, and an equal number have failed because they &#10; were inaccurate, inconsistent and impractical.&lt;/p&gt; &lt;p&gt;When studying the characteristics relating to &#10; battery state-of-health&amp;nbsp;and state-of-charge&amp;nbsp;(SoH and SoC, &#10; respectively) some interesting effects can be observed. Unfortunately, &#10; these properties are cumbersome and non-linear, and worst &#10; of all, the parameters are unique for every battery type. &#10; This inherent complexity makes it difficult, if not impossible, &#10; to create a formula that works for all batteries.&lt;/p&gt; &lt;p&gt;In spite of these seemingly insurmountable odds, &#10; battery quick testing is possible. But the question is asked, &#10; “how accurate will it be, and how well will it adapt to continuously &#10; changing battery chemistries?” The cost of a commercial quick &#10; tester and the ease-of-use are other issues of concern.&lt;/p&gt;&lt;h4&gt;13.1 Battery Specific Quick Testing&lt;/h4&gt; &lt;p&gt;The secret of battery quick testing lies, to &#10; a large extent, in understanding how the battery is being &#10; loaded. Battery loads vary from short current bursts for a &#10; mobile phone using the GSM&lt;i&gt; &lt;/i&gt;protocol, to long and fluctuating &#10; loads on laptops, and to intermittent heavy loads for power &#10; tools.&lt;/p&gt; &lt;p&gt;Because of these differences in loads, a battery &#10; for a digital mobile phone should be tested primarily for &#10; low impedance to assure a clean delivery of the current bursts, &#10; whereas a battery for a notebook should be examined mainly &#10; for the bulk in energy reserve. Ultra-low impedance is of &#10; less importance here. A battery for a power tool, on the other &#10; hand, needs both — low impedance and good power reserve.&lt;/p&gt; &lt;p&gt;Some quick testers simulate the equipment load &#10; and observe the voltage signature of the battery under these &#10; conditions. The readings are compared with the reference settings, &#10; which are stored in the tester. The resulting discrepancies &#10; are calculated against the anticipated or ideal settings and &#10; displayed as the SoH readings.&lt;/p&gt; &lt;p&gt;The first step in obtaining quick test readings &#10; is measuring the battery’s internal resistance, often referred &#10; to as impedance. Internal resistance measurements take only &#10; a few seconds to complete and provide a reasonably accurate &#10; indication of the battery’s condition, especially if a reference &#10; reading from a good battery is available for comparison.&lt;/p&gt; &lt;p&gt;Unfortunately, the impedance measurement alone &#10; provides only a rough sketch of the battery’s performance. &#10; The readings are affected by various battery conditions, which &#10; cannot always be controlled. For example, a fully charged &#10; battery that has just been removed from the charger shows &#10; a higher impedance reading than one that has rested for a &#10; few&amp;nbsp;hours after charge. The elevated impedance is due &#10; to the increased interfacial resistance present after charging. &#10; Allowing the battery to rest for an&amp;nbsp;hour or two will &#10; normalize the battery. Temperature also affects the readings. &#10; In addition, the chemistry, the number of cells connected &#10; in series and the rating of a battery influence the results. &#10; Many batteries also contain a protection circuit that further &#10; distorts the readings.&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>13. Making Battery Quick-Test Feasible 2</title><link>https://technick.net/guides/electronics/bpw/c13_02/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c13_02/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c13_01"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c13_03"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;13.2 Three-Point Quick Test&lt;/h4&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;The &lt;i&gt;three-point quick test&lt;/i&gt; uses internal &#10; battery impedance as a basis and adds the battery voltage &#10; under charge and discharge to the equation. The readings are &#10; evaluated and compared with reference settings stored in the &#10; tester. Let’s explore each of these fundamentals closer to &#10; see what it entails: &lt;/p&gt; &lt;p&gt;&lt;b&gt;Internal resistance — &lt;/b&gt;To measure the impedance, &#10; a battery must be at least 50&amp;nbsp;percent charged. An empty &#10; or nearly empty battery exhibits a high internal resistance. &#10; As the battery reaches 50&amp;nbsp;percent SoH, the resistance &#10; drops, then increases again towards full discharge or full &#10; charge. Figure&amp;nbsp;13-1 shows the typical internal &#10; resistance curve of a NiMH as a function of charge. Note the &#10; decrease of impedance after the battery has rested for a while. &#10; To obtain accurate results, allow the battery to rest after &#10; discharge and charge.&lt;/p&gt; &lt;p&gt;&lt;img width="431" height="342" src="https://technick.net/img/guide_bpw2/c13_01.gif" v:shapes="_x0000_i1026" border="0" alt="" /&gt;&lt;/p&gt; &lt;p&gt;&lt;span class="caption"&gt;Figure&amp;nbsp;13-1: &#10; Internal resistance in a NiMH battery.&lt;/span&gt;&lt;br /&gt; &lt;span class="caption-sub"&gt;Note the higher readings immediately &#10; after a full discharge and full charge. To obtain accurate &#10; results, allow the battery to rest after discharge and charge.&lt;/span&gt;&lt;/p&gt; &lt;p&gt;&lt;b&gt;Charge Voltage&lt;/b&gt; — During charge, the voltage &#10; of a battery must follow a narrow predetermined path relating &#10; to time. Anomalies such as too high and too low voltages are &#10; identified. For example, a fast initial rise reveals that &#10; the battery may be fully charged. If the voltage overshoots, &#10; the battery may be ‘soft’. This condition often arises when &#10; one or more cells have developed dry spots. A frozen battery &#10; exhibits a similar effect. If, on the other hand, the voltage &#10; does not increase in the allotted time and remains constant, &#10; an electrical short is suspected. &lt;/p&gt; &lt;p&gt;&lt;b&gt;Discharge Voltage&lt;/b&gt; — When applying a discharge, &#10; the voltage drops slightly, and then stabilizes for most of &#10; the period in which the energy is drawn. As the battery reaches &#10; the end-of-discharge point, the voltage drops rapidly. Observing &#10; the initial voltage drop and measuring the voltage delta during &#10; the flat part of the discharge curve provides some information &#10; as to the SoC. However, each battery type behaves differently &#10; and an accurate prediction is not easy. NiCd batteries that &#10; have a long flat voltage during most of the discharge period &#10; are more difficult to predict using this method than chemistries &#10; which exhibit a steady voltage drop under&amp;nbsp;load.&lt;/p&gt; &lt;p&gt;Unfortunately, the battery’s SoC affects the &#10; three-point quick test. Even within a charge range of 50 to &#10; 90&amp;nbsp;percent, fluctuations in the test results cannot be &#10; avoided. Internal resistance readings further influence the &#10; final outcome. If used as a linear correlation with capacity, &#10; internal resistance measurements can be highly unreliable, &#10; especially with NiCd and NiMH batteries. Figure&amp;nbsp;13-2 &#10; compares the accuracy of six batteries when tested with the &#10; three-point quick test. To establish the true capacity, each &#10; battery was analyzed by applying a full charge/discharge/charge &#10; cycle.&lt;/p&gt; &lt;p&gt;Often referred to as the ‘Feel Good Battery Tester’ &#10; because of overly optimistic readings, the three-point quick &#10; test method fails to provide the accuracy and repeatability &#10; that serious battery users demand. &lt;/p&gt; &lt;p&gt;&lt;img width="463" height="291" src="https://technick.net/img/guide_bpw2/c13_02.gif" v:shapes="_x0000_i1027" border="0" alt="" /&gt;&lt;/p&gt; &lt;p class="caption"&gt;Figure&amp;nbsp;13-2:&amp;nbsp; Comparison of battery quick &#10; test methods.&lt;br /&gt; &lt;span class="caption-sub"&gt; Six batteries with different state-of-health &#10; conditions were quick tested. The dark gray bars reflect the &#10; true state-of-health obtained with the Cadex &lt;i&gt;7000&lt;/i&gt; Series &#10; battery analyzer by applying a full charge/discharge/ charge &#10; cycle; the light gray bars are readings derived using the &#10; Three-Point Quick Test.&lt;/span&gt;&lt;/p&gt; &lt;p&gt;The impression of casual battery users that this &#10; method is “better than nothing” will not stand up to the requirements &#10; of critical industries such as biomedical, law enforcement, &#10; emergency response, aviation and defense. Because of relatively &#10; low cost, the three-point tester finds a strong niche in the &#10; consumer market where a wrong reading is simply a nuisance &#10; and does not threaten human safety. Satisfactory readings &#10; are achieved in the mobile phone market where batteries are &#10; similar in format. It should be noted that the three-point &#10; quick test method provides better results than merely measuring &#10; the battery’s internal resistance or voltage.&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>13. Making Battery Quick-Test Feasible 3</title><link>https://technick.net/guides/electronics/bpw/c13_03/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c13_03/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c13_02"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c13_04"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;13.3 The Evolving Battery&lt;/h4&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;The Li-ion battery has not yet matured. &#10; Chemical compositions change as often as once every six months. &#10; According to Moli Energy, a large manufacturer of Li-ion &#10; batteries, the chemical composition of Li-based batteries &#10; changes every six months. New chemicals are discovered that &#10; provide better load characteristics, higher capacities and &#10; longer storage life. Although beneficial to consumers, these &#10; improvements wreak havoc with battery testing equipment that &#10; base quick test algorithms on fixed parameters. Why do these &#10; changes in battery composition affect the results of a quick &#10; tester?&lt;/p&gt; &lt;p&gt;&lt;img src="https://technick.net/img/guide_bpw2/c13_03.gif" width="294" height="88" vspace="19" hspace="19" align="right" border="0" alt="" /&gt;The &#10; early Li-ion batteries, notably the coke-based variety, exhibited &#10; a gradual drop of voltage during discharge. With newer graphite-based &#10; Li-ion batteries, flatter voltage signatures are achieved. &#10; Such batteries provide a more stable voltage during most of &#10; the discharge cycle. The rapid voltage drop only occurs towards &#10; the end of discharge.&lt;/p&gt; &lt;p&gt;A ‘hardwired’ tester looks for an anticipated &#10; voltage drop and estimates the SoH according to fixed references. &#10; If the voltage-drop changes due to improved battery technology, &#10; erroneous readings will result.&lt;/p&gt; &lt;p&gt;Diverse metals used in the positive electrode &#10; also alter the open terminal voltage. Manganese, also referred &#10; to as spinel, has a slightly higher terminal voltage compared &#10; to the more traditional cobalt. In addition, spinel ages differently &#10; from cobalt. Although both cobalt and spinel systems belong &#10; to the Li-ion family, differences in readings can be &#10; expected when the batteries are quick tested side-by-side.&lt;/p&gt; &lt;p&gt;The Li-ion polymer has a dissimilar composition &#10; to the Li-ion and responds in a different way when tested. &#10; Instruments capable of checking Li-ion batteries may &#10; not provide reliable readings when quick testing Li-ion &#10; polymer batteries.&lt;/p&gt;&lt;h4&gt;13.4 The Cadex Quicktest™&amp;nbsp;Method&lt;/h4&gt; &lt;p&gt;A battery quick text must be capable of adapting &#10; to new chemical combinations as introduced from time to time. &#10; Cadex solves this by using a self-learning fuzzy logic algorithm. &#10; Used to measure analog variances in an assortment of applications, &#10; fuzzy logic&amp;nbsp;is known to the industry as a universal approximator. &#10; Along with unique learning capabilities, this system can adapt &#10; to new trends. Similar to a student adapting to the complexity &#10; of a curriculum, the system learns with each battery tested. &#10; The more batteries that are serviced, the higher the accuracy &#10; becomes.&lt;/p&gt; &lt;p&gt;Cadex&lt;i&gt; Quicktest&lt;/i&gt;™ is built on the &#10; new Cadex &lt;i&gt;7000&lt;/i&gt; &lt;i&gt;Series &lt;/i&gt;battery analyzer platform. &#10; This system features interchangeable battery adapters that &#10; contain the battery configuration codes (C-codes). When installed, &#10; the adapter sets the analyzer to the correct battery parameters &#10; (chemistry, voltage rating,&amp;nbsp;etc.).&lt;/p&gt; &lt;p&gt;To enable quick testing, the battery adapters &#10; must also contain the matrix settings for the serviced battery. &#10; While matrices for the most common batteries are included &#10; when acquiring the adapter, the user is asked to enter the &#10; information on those adapters that have not yet been prepared &#10; for quick testing. This can be done in the field by ‘scanning’ &#10; the working battery.&lt;/p&gt; &lt;p&gt;The &lt;i&gt;‘Learn’&lt;/i&gt; program of the Cadex &lt;i&gt;7000 &#10; Series&lt;/i&gt; battery analyzer performs this task by applying &#10; charge-discharge-charge activities on the test battery. Similar &#10; to downloading a program into a PC, the information derived &#10; from the battery sets the matrices and prepares the Cadex&lt;i&gt; &#10; Quicktest&lt;/i&gt;™ function. The &lt;i&gt;‘Learn’&lt;/i&gt; program completes &#10; its cycle within approximately four hours. One learning cycle &#10; is the minimal requirement to enable the Cadex&lt;i&gt; Quicktest&lt;/i&gt;™ &#10; function.&lt;/p&gt; &lt;p&gt;With only one battery learned or scanned, the &#10; confidence level is ‘marginal’. Running additional batteries &#10; through the learning program will fill the matrix registers &#10; and the confidence level will increase to ‘good’ or ‘excellent’. &#10; Like a bridge that needs several pillars for proper support, &#10; the most accurate quick test results are achieved by scanning &#10; individual batteries that have SoH readings of around 100, &#10; 80 and 60&amp;nbsp;percent. The confidence level attained for &#10; a given battery adapter is indicated on the LCD panel of the &#10; analyzer.&lt;/p&gt; &lt;p&gt;The Cadex&lt;i&gt; Quicktest&lt;/i&gt;™ can be performed &#10; with charge levels between 20&amp;nbsp;and 90&amp;nbsp;percent. Within &#10; this range, different charge levels do not affect the readings. &#10; If the battery is insufficiently charged, or has too high &#10; a charge, a message appears and the analyzer automatically &#10; applies the appropriate charge or discharge to bring the battery &#10; within testing range. Charging or discharging a battery immediately &#10; prior to taking the reading does not affect the Cadex&lt;i&gt; Quicktest&lt;/i&gt;™ &#10; results.&lt;/p&gt; &lt;p&gt;The reader may ask whether the Cadex&lt;i&gt; Quicktest&lt;/i&gt;™ &#10; system can also learn incorrectly. No — once the learning &#10; cycles have been completed for a given battery, the matrix &#10; settings are firm and resilient. Testing bad batteries will &#10; not affect the setting.&lt;/p&gt; &lt;p&gt;Spoilage is only possible if a number of bad &#10; batteries are purposely put through the &lt;i&gt;‘Learn’&lt;/i&gt; program &#10; in an attempt to alter the existing matrix. Such would be &#10; the case when scanning a batch of batteries that have not &#10; been properly formatted, have been in prolonged storage, or &#10; are of poor quality. To protect the existing matrix from spoilage &#10; when adding learning cycles, the system checks each new vector &#10; reading for its integrity before accepting the information &#10; as a valid reference. Learned readings obtained from defective &#10; batteries are rejected.&lt;/p&gt; &lt;p&gt;If a battery adapter has lost its integrity as &#10; part of ‘bad learning’, the matrix setting can be erased and &#10; re-taught. As an alternative, Cadex will make recommended &#10; matrices available on the Internet. Users may also want to &#10; exchange learned matrix information with each other. Copying &#10; battery adapters by inserting a recognized adapter into the &#10; analyzer will achieve this. Another method is ‘Webcasting’ &#10; the matrices over the Internet.&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>13. Making Battery Quick-Test Feasible 4</title><link>https://technick.net/guides/electronics/bpw/c13_04/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c13_04/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c13_03"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c13_05"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;13.5 How does the Cadex Quicktest&amp;nbsp;work?&lt;/h4&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;The first stage of the Cadex&lt;i&gt; Quicktest&lt;/i&gt;™analysis &#10; uses a waveform to gather battery information under certain &#10; stresses, establishing probability levels for the given battery. &#10; Since there are many battery types with several interacting &#10; variables, a set of rules is applied to further evaluate the &#10; data. The results are averaged and an estimated battery capacity &#10; is predicted. The initial inference to categorize the batteries &#10; is computed from a set of specialized shapes called membership &#10; functions. These membership functions are unique to every &#10; battery model and are developed using a specialized trend-learning &#10; algorithm.&lt;/p&gt; &lt;p&gt;The raw data, consisting of three or more items, &#10; flows through the input layer. Vectors leading from the input &#10; layer are weighted and the derived values are passed through &#10; a function in the hidden layer. Another vector set channels &#10; the information to the output.&lt;/p&gt; &lt;p&gt;&lt;img width="294" height="88" src="https://technick.net/img/guide_bpw2/c13_03.gif" v:shapes="_x0000_i1025" border="0" alt="" /&gt;&lt;/p&gt; &lt;p class="caption"&gt;Figure&amp;nbsp;13-3:&amp;nbsp; Flowchart of a neuro-network &#10; based on fuzzy logic.&lt;br /&gt; &lt;span class="caption-sub"&gt;The first three circles on the left &#10; are the inputs. The data entering is ‘fuzzified’ according &#10; to a set of curves called membership functions. A set of rules &#10; that depend on fixed knowledge is evaluated. The results of &#10; the rules are combined and distilled, or ‘defuzzified’. The &#10; result is a crisp, non-fuzzy number.&lt;/span&gt;&lt;/p&gt; &lt;p&gt;The weights are highly significant and function &#10; as the learning facility of the network. A run would proceed &#10; with a certain set of weights. If the result is off by a certain &#10; range, the weights are changed and the process is repeated &#10; until a certain number of iterations have passed or the algorithm &#10; produces the correct output.&lt;/p&gt; &lt;p&gt;&lt;img src="https://technick.net/img/guide_bpw2/c13_04.gif" width="463" height="459" vspace="19" hspace="19" align="left" border="0" alt="" /&gt;The &#10; Cadex&lt;i&gt; Quicktest&lt;/i&gt;™ requires less time than most &#10; other methods. While current quick test systems, such as those &#10; used in defense applications, need hundreds of learning cycles &#10; and run on large computers, the Cadex method requires minimal &#10; experience and can be performed on relatively simple hardware. &#10; Typically less than five learning cycles are necessary to &#10; achieve robust, model-specific solution sets, also known as &#10; matrices. This massive reduction in time is the result of &#10; a new self-learning algorithm that acquires numerous measures &#10; of the battery’s characteristics. The algorithm uses a unique &#10; decision-making formula that determines the best solution &#10; set for each battery model.&lt;/p&gt; &lt;p&gt;Of course, artificial intelligence is a complicated &#10; subject, and is beyond the scope of this book. With respect &#10; to complexity, Dr.&amp;nbsp;Lofti Zadeh spoke these famous words: &#10; “As complexity rises, precise statements lose meaning and &#10; meaningful statements lose precision.”&lt;/p&gt; &lt;p&gt;Battery quick testing has raised the interest &#10; of manufacturers and users alike. The race is on to provide &#10; a product that is accurate, easy to use and cost effective. &#10; The true winner may not be an individual or organization that &#10; amasses the largest number of patents, but a company that &#10; can offer a product that is cost effective and truly works.&lt;/p&gt;&lt;h4&gt;13.6 Battery Testing and the Internet&lt;/h4&gt; &lt;p&gt;Increasingly, the Internet plays a pivotal role &#10; in battery testing. The ability to send all battery test results &#10; to a central global database is an exciting prospect. With &#10; this information on hand, battery manufacturers would be able &#10; to perform battery analysis based on battery type, geographic &#10; area and user pattern. Field failures could be identified &#10; quickly and appropriate corrections implemented.&lt;/p&gt; &lt;p&gt;Another application for the Internet is establishing &#10; a global database for all major battery types, complete with &#10; matrix settings. With compatible systems, users would be able &#10; to select and download battery information from a central &#10; database. &lt;i&gt;Batteryshop™&lt;/i&gt;, a software product offered &#10; by Cadex, provides such a service. The database lists all &#10; common batteries, complete with battery specifications and &#10; matrix information. Point and click technology programs the &#10; battery analyzer to the correct battery parameters.&lt;/p&gt; &lt;p&gt;Collaborating with battery manufacturers enables &#10; Cadex to create the most accurate vector settings. Manufacturers &#10; welcome such a system because it reduces beta testing and &#10; puts the manufacturer in closer contact with the battery user. &#10; The aim is to reduce warranty returns and increase customer &#10; satisfaction.&lt;/p&gt; &lt;p&gt;Another powerful feature of the Internet is downloading &#10; new software for hardware upgrades. Since battery quick testing &#10; is still in its infancy, improved software will be made available &#10; in the future that allows upgrading existing equipment with &#10; the latest developments.&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>13. Making Battery Quick-Test Feasible 5</title><link>https://technick.net/guides/electronics/bpw/c13_05/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c13_05/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c13_04"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c14_01"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;13.7 Electrochemical Impedance Spectroscopy&lt;/h4&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;Electrochemical Impedance Spectroscopy (EIS) &#10; has been used for a number of years to test the SoH and SoC &#10; of industrial batteries. EIS is well suited for observing &#10; reactions in the kinetics of electrodes and batteries. Changes &#10; in impedance readings hint at minute intrusion of corrosion, &#10; which can be evaluated with the EIS methods. Impedance studies &#10; using the EIS technology have been carried out on lead acid, &#10; NiCd, NiMH, Li-ion and other chemistries. EIS test methods &#10; are also used to examine the cells on larger stationary batteries.&lt;/p&gt; &lt;p&gt;In its simplest manifestation, measurements of &#10; internal battery resistance can be taken by applying a load &#10; to a battery and observing the current-voltage characteristics. &#10; A secondary load of higher current is applied, again noting &#10; the voltage and current. The current and voltage relationship &#10; of the two loads can be utilized to provide the internal resistance &#10; using Ohm’s&amp;nbsp;Law.&lt;/p&gt; &lt;p&gt;Rather than applying two load levels, an AC signal &#10; is injected. This AC voltage floats as a ripple on top of &#10; the battery DC voltage and charges and discharges the battery &#10; alternatively. The AC frequency varies from a low 100mHz to &#10; about 5kHz. 100mHz is a very low frequency that takes 10&amp;nbsp;seconds &#10; to complete a full cycle. In comparison, 5kHz completes 5000&amp;nbsp;cycles &#10; in one second. At about 1000Hz, the load behaves more like &#10; a DC resistance because the chemistry cannot follow the rapid &#10; changes between charge and discharge pulses. The information &#10; about electrolyte mass transport is ascertained at lower frequencies.&lt;/p&gt; &lt;p&gt;Additional information regarding the battery’s &#10; condition can be obtained by applying various frequencies. &#10; One can envision going through different layers of the battery &#10; and examining each level. Similar to tuning the dial on a &#10; broadcast radio, in which individual stations offer different &#10; types of music, so too does the battery provide different &#10; information of the internal processes. The EIS is an effective &#10; technique to analyze the mechanisms of interfacial structure &#10; and to observe the change in the formation when cycling the &#10; battery as part of everyday&amp;nbsp;use.&lt;/p&gt; &lt;p&gt;&lt;img src="https://technick.net/img/guide_bpw2/c13_06.gif" width="210" height="106" vspace="19" hspace="19" align="left" border="0" alt="" /&gt;When &#10; applying a sine wave to a battery, a phase shift between voltage &#10; and current occurs. The reactive load of the battery causes &#10; this phenomenon. The overall battery resistance consists of &#10; three resistance types: pure resistance, inductance and capacitance. &#10; Capacitance is responsible for the capacitor effect; and the &#10; inductance is accountable for the so-called magnetic field, &#10; or coil effect. The voltage on a capacitor lags behind the &#10; current. This process is reversed on a coil and the current &#10; lags behind the voltage. The level of phase shift that occurs &#10; when applying a current through a reactive load is used to &#10; provide information as to the battery’s condition.&lt;/p&gt; &lt;p&gt;One of the difficulties with the EIS method is &#10; interpreting the information. It is one thing to amass a large &#10; amount of data, and another to make practical use of it. Although &#10; the derived information reflects aging and other deficiencies, &#10; the readings are not universal and do not apply in the same &#10; way to all battery makes and types. Rather, each battery type &#10; generates its own set of signatures. Without a library of &#10; well-defined reference readings with which to compare, the &#10; EIS method has little meaning.&lt;/p&gt; &lt;p&gt;Modern technology can help. The vector settings &#10; of a given battery type can be stored in the test instrument &#10; and translated into meaningful readings by software. The readings &#10; can further be analyzed by coupling impedance spectroscopy &#10; with a fuzzy neuro-adaptive algorithm.&lt;/p&gt; &lt;p&gt;Electrochemical Impedance Spectroscopy is commonly &#10; used to research batteries in a lab environment. Best results &#10; are obtained on a single cell. EIS is also used in aviation &#10; and in-flight analysis of satellite batteries. Closer to earth, &#10; the EIS method examines stationary batteries for grid corrosion &#10; and water loss. Further refined, the EIS technology has the &#10; potential for wider applications, such as testing portable &#10; batteries. EIS may one day test batteries in a matter of seconds &#10; and achieve higher accuracy than current methods. &lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>13. Phase Delay and Group Delay</title><link>https://technick.net/guides/theory/edft/013/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/edft/013/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/filters/"&gt;Introduction to Digital Filters with Audio Applications&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, Copyright &amp;#169; &lt;i&gt;2017-11-26&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/edft/012"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/000"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/022"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/014"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;Phase Delay and Group Delay&lt;/h3&gt;&lt;p&gt;The phase response of a &lt;a href="https://technick.net/guides/theory/edft/010"&gt;filter&lt;/a&gt; &lt;!-- MATH&#10; $\Theta(\omega)$&#10; --&gt;&lt;img width="46" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img271.gif" alt="$\" heta="" mega="" /&gt; gives the &lt;i&gt;radian&lt;/i&gt; phase shift &#10;experienced by each sinusoidal component of the input signal.&#10;Sometimes it is more meaningful to consider &lt;i&gt;&lt;a href="https://technick.net/guides/theory/edft/013"&gt;phase delay&lt;/a&gt;&lt;/i&gt;[&lt;a href="https://technick.net/guides/theory/edft/023#Papoulis"&gt;Papoulis&amp;nbsp;1977&lt;/a&gt;].&lt;/p&gt;&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;The &lt;i&gt;phase delay&lt;/i&gt;&lt;a name="2455"&gt;&lt;/a&gt; of an &lt;a href="https://technick.net/guides/theory/edft/009"&gt;LTI&lt;/a&gt; filter &lt;img width="46" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img5.gif" alt="$H(z)$" /&gt; with phase response&#10;&lt;!-- MATH&#10; $\Theta(\omega)$&#10; --&gt;&lt;img width="46" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img271.gif" alt="$\" heta="" mega="" /&gt; is defined by&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;P(\omega) \isdef -\, \frac{\Theta(\omega)}{ \omega}.&#10;\end{displaymath}&#10; --&gt;&lt;img width="148" height="52" border="0" src="https://technick.net/img/guide_edft/guide_edft_img277.gif" alt="\" egin="" isplaymath="" p="" mega="" sdef="" rac="" heta="" mega="" mega="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;The phase delay gives the &lt;i&gt;time delay&lt;/i&gt;&lt;a name="2457"&gt;&lt;/a&gt; in seconds&#10;experienced by each sinusoidal component of the input signal. For&#10;example, in filter &lt;!-- MATH&#10; $y(n)\leftarrow x(n)+x(n-1)$&#10; --&gt;&lt;img width="198" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img278.gif" alt="$y(n)\" eftarrow="" x="" /&gt;, the phase response is&#10;&lt;!-- MATH&#10; $\Theta(\omega)= - \omega T/2$&#10; --&gt;&lt;img width="130" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img279.gif" alt="$\" heta="" mega="" mega="" /&gt; which corresponds to a phase delay &lt;!-- MATH&#10; $P(\omega) =&#10;T/2$&#10; --&gt;&lt;img width="103" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img280.gif" alt="$P(\" mega="" /&gt; which is one-half sample.&lt;/p&gt;&lt;p&gt;More generally, if the input to a filter with &lt;a href="https://technick.net/guides/theory/edft/012"&gt;frequency response&lt;/a&gt;&lt;!-- MATH&#10; $H(e^{j\omega})=G(\omega)e^{j\Theta(\omega)}$&#10; --&gt;&lt;img width="173" height="41" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img281.gif" alt="$H(e^{j\" mega="" omega="" j\theta="" mega="" /&gt; is&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;x(n)=\cos\left(\omega nT\right),&#10;\end{displaymath}&#10; --&gt;&lt;img width="164" height="36" border="0" src="https://technick.net/img/guide_edft/guide_edft_img282.gif" alt="\" egin="" isplaymath="" n="" os\left="" mega="" right="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;then the output is&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;y(n) = G(\omega) \cos \left(\omega nT + \Theta(\omega) \right)&#10; = G(\omega) \cos \left[\omega \left(nT - P(\omega)\right)\right],&#10;\end{displaymath}&#10; --&gt;&lt;img width="536" height="36" border="0" src="https://technick.net/img/guide_edft/guide_edft_img283.gif" alt="\" egin="" isplaymath="" n="" omega="" os="" eft="" mega="" theta="" mega="" igh="" mega="" os="" eft="" mega="" eft="" t="" p="" mega="" ight="" ight="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;and it can be seen that the phase delay expresses phase response &#10;as time delay.&lt;p&gt;In working with phase delay, care must be taken to ensure all&#10;appropriate multiples of &lt;img width="25" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img284.gif" alt="$2\" i="i" /&gt; have been included in &lt;!-- MATH&#10; $\Theta(\omega)$&#10; --&gt;&lt;img width="46" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img271.gif" alt="$\" heta="" mega="" /&gt;. We&#10;defined &lt;!-- MATH&#10; $\Theta(\omega)$&#10; --&gt;&lt;img width="46" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img271.gif" alt="$\" heta="" mega="" /&gt; simply as the complex angle of the frequencyresponse &lt;!-- MATH&#10; $H(e^{j\omega})$&#10; --&gt;&lt;img width="61" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img261.gif" alt="$H(e^{j\" mega="" /&gt;, and this is not sufficient for obtaining a phase&#10;response which can be converted to true time delay. By discarding&#10;multiples of &lt;img width="25" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img284.gif" alt="$2\" i="i" /&gt;, as is done in the definition of complex angle,&#10;the phase delay is modified by multiples of the sinusoidal&#10;period. Since LTI filter analysis is based on sinusoids without&#10;beginning or end, one cannot in principle distinguish between ``true''&#10;phase delay and a phase delay with discarded sinusoidal&#10;periods. Nevertheless, it is convenient to define the filter phase&#10;response as a &lt;i&gt;continuous&lt;/i&gt; function of frequency with the&#10;property that &lt;img width="78" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img285.gif" alt="$\" heta="" /&gt; (for real filters). This specifies a&#10;means of ``unwrapping'' the phase response to get a consistent phase&#10;delay curve.&lt;a name="1742"&gt;&lt;/a&gt;&lt;/p&gt;&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;A more commonly encountered representation of filter phase response is&#10;called the &lt;i&gt;&lt;a href="https://technick.net/guides/theory/edft/013"&gt;group delay&lt;/a&gt;&lt;/i&gt;&lt;a name="2462"&gt;&lt;/a&gt;, and it is defined by&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;D(\omega)\isdef \,-\, \frac{d}{ d\omega}\,\Theta(\omega).&#10;\end{displaymath}&#10; --&gt;&lt;img width="180" height="51" border="0" src="https://technick.net/img/guide_edft/guide_edft_img286.gif" alt="\" egin="" isplaymath="" omega="" sdef="" rac="" d\omega="" heta="" mega="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt; &lt;p&gt;For &lt;a href="https://ccrma.stanford.edu/~jos//thms/Linear_Phase_Terms.html" target="_blank"&gt;linear phase&lt;/a&gt; responses, the group delay and the phase delay are&#10;identical, and each may be interpreted as time delay. &lt;/p&gt;&lt;p&gt;For any &lt;a href="http://www.treasure-troves.com/physics/PhaseFunction.html" target="_blank"&gt;phase function&lt;/a&gt;, the group delay &lt;img width="48" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img287.gif" alt="$D(\" mega="" /&gt; may be interpreted as&#10;the time delay of the &lt;i&gt;&lt;a href="https://ccrma.stanford.edu/~jos//log/Logarithms.html" target="_blank"&gt;amplitude&lt;/a&gt; envelope&lt;/i&gt; of a sinusoid at&#10;frequency &lt;img width="17" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img129.gif" alt="$\" mega="" /&gt; [&lt;a href="https://technick.net/guides/theory/edft/023#Papoulis"&gt;Papoulis&amp;nbsp;1977&lt;/a&gt;].&lt;a name="1748"&gt;&lt;/a&gt; The bandwidth of the amplitude envelope in this&#10;interpretation must be restricted to a frequency interval over which&#10;the phase response is approximately linear. While the proof will not&#10;be given here, it should seem reasonable when the process of amplitude&#10;envelope detection is considered. The narrow ``bundle'' of&#10;frequencies centered at the carrier frequency &lt;img width="17" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img129.gif" alt="$\" mega="" /&gt; is translated to&lt;img width="14" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img288.gif" alt="$0$" /&gt; Hz. At this point, it is evident that the group delay at the&#10;carrier frequency gives the slope of the linear phase of the&#10;translated spectrum. But this is a constant phase delay, and therefore&#10;it has the interpretation of true time delay for the amplitude&#10;envelope.&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>14. Appendix B: Relation between Sinc and Lagrange Interpolation</title><link>https://technick.net/guides/theory/dar/014/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dar/014/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/resample/"&gt;The Digital Audio Resampling Home Page&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, Copyright &amp;#169; &lt;i&gt;2016-05-17&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dar/013"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dar/000"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dar/015"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;Appendix B: Relation between Sinc and Lagrange Interpolation&lt;/h3&gt;&lt;p&gt;&lt;a href="https://ccrma.stanford.edu/~jos//Interpolation/Lagrange_Interpolation.html" target="_blank"&gt;Lagrange interpolation&lt;/a&gt; is a well known, classical technique for&#10;interpolation [&lt;a href="https://technick.net/guides/theory/dar/015#Hildebrand"&gt;Hildebrand&amp;nbsp;1974&lt;/a&gt;]. Given a set of &lt;img width="48" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img50.gif" alt="$n+1$" /&gt; known samples&lt;img width="49" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img216.gif" alt="$f(x_k)$" /&gt;, &lt;!-- MATH&#10; $k=0,1,2,\ldots,n$&#10; --&gt;&lt;img width="138" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img217.gif" alt="$k=0,1,2,\" dots="" /&gt;, the problem is to find the unique order &lt;img width="16" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img12.gif" alt="$n$" /&gt;polynomial &lt;img width="40" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img218.gif" alt="$y(x)$" /&gt; which interpolates the samples. The solution can be&#10;expressed as a linear combination of elementary &lt;img width="16" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img12.gif" alt="$n$" /&gt;th order polynomials:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;y(x) = \sum_{k=0}^n l_k(x)f(x_k)&#10;\end{displaymath}&#10; --&gt;&lt;img width="188" height="61" border="0" src="https://technick.net/img/guide_dar/guide_dar_img219.gif" alt="\" egin="" isplaymath="" x="" um="" n="" k="" f="" k="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;l_k(x) \isdef { (x - x_0) \cdots (x - x_{k-1}) (x - x_{k+1}) \cdots (x - x_n)&#10; \over (x_k - x_0) \cdots (x_k - x_{k-1}) (x_k - x_{k+1}) \cdots (x_k - x_n) }&#10;\end{displaymath}&#10; --&gt;&lt;img width="508" height="57" border="0" src="https://technick.net/img/guide_dar/guide_dar_img220.gif" alt="\" egin="" isplaymath="" k="" isdef="" x="" dots="" x="" x="" k="" dots="" k="" k-1="" k="" k="" dots="" k="" n="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;From the numerator of the above definition, we see that &lt;img width="44" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img221.gif" alt="$l_k(x)$" /&gt; is an&#10;order &lt;img width="16" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img12.gif" alt="$n$" /&gt; polynomial having zeros at all of the samples except the &lt;img width="15" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img222.gif" alt="$k$" /&gt;th.&#10;The denominator is simply the constant which normalizes its value to &lt;img width="14" height="16" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img29.gif" alt="$1$" /&gt; at&lt;img width="24" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img223.gif" alt="$x_k$" /&gt;. Thus, we have &lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;l_k(x_j) = \delta_{kj} \isdef \left\{\begin{array}{ll}&#10;&#9;1, &amp; j=k \\&#10;&#9;0, &amp; j\neq k \\&#10;&#9;\end{array}&#10;&#9;\right.&#10;\end{displaymath}&#10; --&gt;&lt;img width="236" height="60" border="0" src="https://technick.net/img/guide_dar/guide_dar_img224.gif" alt="\" egin="" isplaymath="" k="" j="" elta="" j="" sdef="" eft\="" egin="" rray="" l="" k="" neq="" nd="" rray="" ight="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;In other words, the polynomial &lt;img width="18" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img225.gif" alt="$l_k$" /&gt; is the &lt;img width="15" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img222.gif" alt="$k$" /&gt;th &lt;i&gt;basis polynomial &lt;/i&gt;for constructing a polynomial interpolation of order &lt;img width="16" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img12.gif" alt="$n$" /&gt; over the &lt;img width="48" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img50.gif" alt="$n+1$" /&gt;sample points &lt;img width="24" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img223.gif" alt="$x_k$" /&gt;.&lt;p&gt;In the case of an &lt;i&gt;infinite &lt;/i&gt;number of &lt;i&gt;equally spaced &lt;/i&gt;samples, with spacing &lt;!-- MATH&#10; $x_{k+1}-x_k = \Delta$&#10; --&gt;&lt;img width="124" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img226.gif" alt="$x_{k+1}-x_k = \" elta="" /&gt;, the &lt;a href="http://www.treasure-troves.com/physics/Lagrangian.html" target="_blank"&gt;Lagrangian&lt;/a&gt; basis&#10;polynomials converge to shifts of the &lt;i&gt;sinc function, &lt;/i&gt;i.e.,&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;l_k(x) = \mbox{sinc}\left(x-k\Delta\over\Delta\right), \quad k=\ldots,-2,-1,0,1,2,\ldots&#10;\end{displaymath}&#10; --&gt;&lt;img width="468" height="60" border="0" src="https://technick.net/img/guide_dar/guide_dar_img227.gif" alt="\" egin="" isplaymath="" k="" mbox="" inc="" eft="" k\delta\over\delta\right="" uad="" dots="" dots="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\mbox{sinc}(x) \isdef {\sin(\pi x)\over \pi x}&#10;\end{displaymath}&#10; --&gt;&lt;img width="156" height="52" border="0" src="https://technick.net/img/guide_dar/guide_dar_img228.gif" alt="\" egin="" isplaymath="" box="" inc="" isdef="" in="" i="" ver="" i="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;The simplest argument is based on the fact that any analytic function is&#10;determined by its zeros and its value at one point. Since &lt;img width="64" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img229.gif" alt="$\" in="" i="" /&gt; is&#10;zero on all the integers except &lt;img width="14" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img47.gif" alt="$0$" /&gt;, and since &lt;!-- MATH&#10; $\mbox{sinc}(0)=1$&#10; --&gt;&lt;img width="93" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img230.gif" alt="$\" box="" inc="" /&gt;, it must&#10;coincide with the infinite-order Lagrangian basis polynomial for the sample&#10;at &lt;img width="50" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img231.gif" alt="$x=0$" /&gt; which also has its zeros on the nonzero integers and equals &lt;img width="14" height="16" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img29.gif" alt="$1$" /&gt; at&lt;img width="50" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img231.gif" alt="$x=0$" /&gt;.&lt;p&gt;A direct proof can be based on the equivalance between Lagrange&#10;interpolation and windowed-sinc interpolation using a ``binomial window''&#10;[&lt;a href="https://technick.net/guides/theory/dar/015#KootsookosAndWilliamson95"&gt;Kootsookos and&#10; Williamson&amp;nbsp;1996&lt;/a&gt;,&lt;a href="https://technick.net/guides/theory/dar/015#VesaT"&gt;V&amp;auml;lim&amp;auml;ki&amp;nbsp;1995&lt;/a&gt;]. That is, for a fractional sample&#10;delay of &lt;img width="21" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img232.gif" alt="$D$" /&gt; samples, multiply the shifted-by-&lt;img width="21" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img232.gif" alt="$D$" /&gt;, sampled, sinc function&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;h_s(n) = \mbox{sinc}(n-D) = \frac{\sin[\pi(n-D)]}{\pi(n-D)}&#10;\end{displaymath}&#10; --&gt;&lt;img width="331" height="57" border="0" src="https://technick.net/img/guide_dar/guide_dar_img233.gif" alt="\" egin="" isplaymath="" s="s" n="" box="" inc="" d="" rac="" in="" i="" d="" i="" d="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;by a binomial window&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;w(n) = \left(\begin{array}{c}N\\n\end{array}\right), \quad n=0,1,2,\ldots N&#10;\end{displaymath}&#10; --&gt;&lt;img width="313" height="60" border="0" src="https://technick.net/img/guide_dar/guide_dar_img234.gif" alt="\" egin="" isplaymath="" n="" eft="" egin="" rray="" n="" nd="" rray="" ight="" uad="" dots="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;and normalize by [&lt;a href="https://technick.net/guides/theory/dar/015#VesaT"&gt;V&amp;auml;lim&amp;auml;ki&amp;nbsp;1995&lt;/a&gt;]&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;C(D) = (-1)^N\frac{\pi(N+1)}{\sin(\pi D)}\left(\begin{array}{c}D\\N+1\end{array}\right),&#10;\end{displaymath}&#10; --&gt;&lt;img width="334" height="60" border="0" src="https://technick.net/img/guide_dar/guide_dar_img235.gif" alt="\" egin="" isplaymath="" d="" frac="" i="" sin="" i="" eft="" egin="" rray="" d="" nd="" rray="" ight="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;which normalizes the interpolating &lt;a href="https://technick.net/guides/theory/edft/010"&gt;filter&lt;/a&gt; to have a unit &lt;img width="25" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img236.gif" alt="$L_2$" /&gt; &lt;a href="http://mathworld.wolfram.com/topics/Norms.html" target="_blank"&gt;norm&lt;/a&gt;, to&#10;obtain the &lt;img width="22" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img4.gif" alt="$N$" /&gt;th-order Lagrange interpolating filter&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;h_D(n)=C(D)w(n)h_s(n), \quad n=0,1,2,\ldots,N&#10;\end{displaymath}&#10; --&gt;&lt;img width="406" height="36" border="0" src="https://technick.net/img/guide_dar/guide_dar_img237.gif" alt="\" egin="" isplaymath="" d="" c="" w="" h="" s="" quad="" dots="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Since the binomial window converges to the Gaussian window as &lt;img width="71" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img238.gif" alt="$N\" o\infty="" /&gt;,&#10;and since the window gets wider and wider, approaching a unit constant in&#10;the limit, the convergence of Lagrange to sinc interpolation can be seen.&lt;p&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>14. Non-Correctable Battery Problems</title><link>https://technick.net/guides/electronics/bpw/c14_01/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c14_01/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c13_05"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c14_02"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;14. Non-Correctable Battery Problems&lt;/h3&gt;&lt;p&gt; Non-correctable battery problems&amp;nbsp;are those that cannot be improved &#10; through external means such as giving the battery a full charge &#10; or by applying repeated charge/discharge cycles. Deficiencies &#10; that denote the non-correctable status are high internal resistance, &#10; elevated self-discharge, electrical short of one or several &#10; cells, lack of electrolyte, oxidation, corrosion and general &#10; chemical breakdown. These degenerative effects are not only &#10; caused by normal usage and aging, but they include less than &#10; ideal field conditions and an element of neglect. The user may &#10; have poor charging equipment, may operate and store the battery &#10; in adverse temperatures and, in the case of nickel-based batteries, &#10; may not maintain the battery properly. &#10; &lt;/p&gt;&lt;p&gt;New battery packs are not exempt from deficiency &#10; syndromes and early failure. Some batteries may be kept in &#10; storage too long and sustain age-related damage, others are &#10; returned by the customer because of incorrect user preparation.&lt;/p&gt; &lt;p&gt;In this section we examine the cause of non-correctable &#10; battery problems and explore why they occur. We also look &#10; at ways to minimize premature failure.&lt;/p&gt;&lt;h4&gt;14.1 High Self-discharge&lt;/h4&gt; &lt;p&gt;Self-discharge&amp;nbsp;is a natural phenomenon of any &#10; battery. It is not a manufacturing defect per se, although &#10; poor manufacturing practices and improper maintenance and &#10; storage by the consumer enhance the problem.&lt;/p&gt; &lt;p&gt;The level of self-discharge differs with each &#10; chemistry and cell design. High-performance nickel-based batteries &#10; with enhanced electrode surface area and super conductive &#10; electrolyte are subject to higher self-discharge than the &#10; standard version cell with lower energy densities. Self-discharge &#10; is non linear and is highest right after charge when the battery &#10; holds full capacity.&lt;/p&gt; &lt;p&gt;NiCd and NiMH battery chemistries exhibit a high &#10; level of self-discharge. If left on the shelf, a new NiCd &#10; loses about 10&amp;nbsp;percent of its capacity in the first 24&amp;nbsp;hours &#10; after being removed from the charger. The rate of self-discharge &#10; settles to about 10&amp;nbsp;percent per month afterwards. At &#10; a higher temperature, the self-discharge rate increases substantially. &#10; As a rule, the rate of self-discharge doubles with every 10&amp;deg;C &#10; (18&amp;deg;F) increase in temperature. The self-discharge of the &#10; NiMH is about 30&amp;nbsp;percent higher than that of the&amp;nbsp;NiCd.&lt;/p&gt; &lt;p&gt;A major contributor to high self-discharge on &#10; nickel and lead-based batteries is a high cycle count and/or &#10; old age. With increased cycles, the battery plates tend to &#10; swell. Once enlarged, the plates press more firmly against &#10; the delicate separator, resulting in increased self-discharge. &#10; This is common in aging NiCd and NiMH batteries but can also &#10; be seen in lead acid systems.&lt;/p&gt; &lt;p&gt;Loading less active materials on the plates can &#10; reduce the plate swelling on nickel-based batteries. This &#10; improves expansion and contraction while charging and discharging. &#10; In addition, the load characteristic is enhanced and the cycle &#10; life prolonged. The downside is lower capacity.&lt;/p&gt; &lt;p&gt;Metallic dendrites penetrating into the separator &#10; are another cause of high self-discharge. The dendrites are &#10; the result of crystalline formation, also known as memory. &#10; Once marred, the damage is permanent. Poorly designed chargers &#10; that ‘cook’ the batteries also increase the self-discharge. &#10; High cell temperature causes irreversible damage to the separator.&lt;/p&gt; &lt;p&gt;While the nickel-based systems can withstand &#10; some abuse and tolerate innovative or crude charge methods, &#10; the Li-ion demands tight charging and discharging regimes. &#10; Keeping the voltage and current within firm boundaries prevents &#10; the growth of dendrites. The presence of dendrites in lithium-based &#10; batteries has more serious implications than just an increase &#10; in self-discharge — dendrites can cause an electrical short, &#10; which could lead to venting with flame.&lt;/p&gt; &lt;p&gt;The self-discharge of the Li-ion battery &#10; is five&amp;nbsp;percent in the first 24&amp;nbsp;hours after charge &#10; and averages 1 to 2&amp;nbsp;percent per month thereafter. In &#10; addition to the natural self-discharge through the chemical &#10; cell, the safety circuit draws as much as 3&amp;nbsp;percent per &#10; month. High cycle count and aging has little effect on self-discharge &#10; on lithium-based batteries.&lt;/p&gt; &lt;p&gt;An SLA self-discharges at a rate of only five&amp;nbsp;percent &#10; per month or 50&amp;nbsp;percent per year. Repeated deep cycling &#10; increases the self-discharge. When deep cycling, the electrolyte &#10; is drawn into the separator, resulting in a crystalline formation &#10; similar to that of a NiCd battery.&lt;/p&gt; &lt;p&gt;The self-discharge of a battery is best measured &#10; with a battery analyzer. The procedure starts by charging &#10; the battery. The capacity is read by applying a controlled &#10; discharge. The battery is then recharged and put on a shelf &#10; for 24&amp;nbsp;hours, after which the capacity is measured again. &#10; The discrepancy between the capacity readings reveals the &#10; level of self-discharge.&lt;/p&gt; &lt;p&gt;More accurate self-discharge measurements can &#10; be obtained by allowing the battery to rest for at least 72&amp;nbsp;hours &#10; before taking the reading. The longer rest period compensates &#10; for the relatively high self-discharge immediately after charge. &#10; At 72&amp;nbsp;hours, the self-discharge should be between 15 &#10; and 20&amp;nbsp;percent. The most uniform self-discharge readings &#10; are obtained after seven days. On some battery analyzers, &#10; the user may choose to adjust the desired rest periods in &#10; which the self-discharge is measured.&lt;/p&gt; &lt;p&gt;Research is being conducted to find a way to &#10; measure the self-discharge of a battery in minutes, if not &#10; seconds. The accuracy and repeatability of such technology &#10; is still unknown. The challenge is finding a formula that &#10; applies to all major batteries and includes the common chemistries.&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>14. Non-Correctable Battery Problems 2</title><link>https://technick.net/guides/electronics/bpw/c14_02/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c14_02/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c14_01"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c14_03"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;14.2 Low Capacity Cells&lt;/h4&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;Even with modern manufacturing techniques, the &#10; capacity of a cell&amp;nbsp;cannot be accurately predicted. As part &#10; of the manufacturing process, each cell is measured and segregated &#10; into categories according to their inherent capacity levels. &#10; The high capacity A cells are commonly sold for special applications &#10; at premium prices; the large mid-range B cells are used for &#10; commercial and industrial applications such as mobile communications; &#10; and the low-end C cells are mostly sold in supermarkets at &#10; bargain prices. Cycling will not significantly improve the &#10; capacity of the low-end cell. When purchasing rechargeable &#10; batteries at a reduced price, the buyer should be aware of &#10; the different capacity and quality levels offered.&lt;/p&gt; &lt;p&gt;As part of quality control, the battery assembler &#10; should spot-check each batch of cells to examine cell uniformity &#10; in terms of voltage, capacity and internal resistance. Failing &#10; to observe these simple rules will often result in premature &#10; battery failures. When buying quality cells from a well-known &#10; manufacturer, battery assemblers are able to relax the matching &#10; requirements somewhat.&lt;/p&gt;&lt;h4&gt;14.3 Cell Mismatch&lt;/h4&gt; &lt;p&gt;Cell mismatch can be found in brand-new as well &#10; as aged battery packs. Poor quality control at the cell manufacturing &#10; level and inadequate cell matching when assembling the batteries &#10; cause unevenly matched cells. If only slightly off, the cells &#10; in a new pack adapt to each other after a few charge/discharge &#10; cycles, like players in a winning sports&amp;nbsp;team.&lt;/p&gt; &lt;p&gt;A weak cell holds less capacity and is discharged &#10; more quickly than the strong one. This imbalance causes cell &#10; reversal on the weak cell if the battery is discharged below &#10; 1V/cell. The weak cell reaches full charge first and goes &#10; into heat-generating overcharge while the stronger cell still &#10; accepts charge and remains cool. In both situations, the weak &#10; cell is at a disadvantage, making it weaker and contributing &#10; to a more acute cell mismatch condition. An analogy can be &#10; made with a high school bully who picks on the weaker kid.&lt;/p&gt; &lt;p&gt;High quality cells are more consistent in capacity &#10; than lower quality counterparts. During their life span, high &#10; quality cells degrade at about the same rate, helping to maintain &#10; the matching. Manufacturers of power tools choose high quality &#10; cells because of their durability under heavy load conditions &#10; and temperature extremes. Lower-cost cells have been tried, &#10; but early failure and consequent replacement is costlier than &#10; the initial investment.&lt;/p&gt; &lt;p&gt;The capacity matching between the cells in a &#10; battery pack should be within +/-&amp;nbsp;2.5&amp;nbsp;percent. &#10; Tighter tolerances are required on batteries with high cell &#10; counts that also must generate high load currents and are &#10; operating under adverse temperatures. There is a strong correlation &#10; between well-balanced cells and the longevity of a battery.&lt;/p&gt; &lt;p&gt;Lithium-based cells have tighter matching tolerances &#10; than their nickel-based cousins. Tight matching of all cells &#10; in a pack is especially important on lithium-based chemistries. &#10; All cells must reach the end-of-discharge voltage threshold &#10; at the same time. The full-charge point must be attained in &#10; unison by all cells. If the cells are allowed to get out of &#10; match, the weaker cell will be discharged to a lower voltage &#10; point before the cut-off occurs. On charge, this weak cell &#10; will attain the full-charge status before the others, causing &#10; the voltage to go higher than on the stronger cells. This &#10; larger voltage swing will put undue strain on the weak&amp;nbsp;cell.&lt;/p&gt; &lt;p&gt;Each cell in a lithium-based pack is electronically &#10; monitored to assure proper cell matching during the battery’s &#10; life. An electronic circuit is added to some packs that compensate &#10; the differences in cell voltages. This is done by connecting &#10; a shunt across each cell string to consume the excess energy &#10; of the cells which are more energetic. The low-voltage cut-off &#10; occurs when the weakest cell reaches the end-of-discharge &#10; point.&lt;/p&gt; &lt;p&gt;The Li-ion battery is controlled down to &#10; the cell level to assure safety at all times. Because this &#10; chemistry is still relatively new and unpredictable under &#10; extreme conditions, manufacturers do not want to take undue &#10; risks. There have been a few failures but such irregularities &#10; are often kept a secret. This chemistry is considered very &#10; safe, considering the large number of Li-ion batteries &#10; that are in&amp;nbsp;use.&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>14. Non-Correctable Battery Problems 3</title><link>https://technick.net/guides/electronics/bpw/c14_03/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c14_03/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c14_02"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c15_01"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;14.4 Shorted Cells&lt;/h4&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;Manufacturers are often unable to explain why &#10; some cells develop high electrical leakage or an electrical &#10; short while the batteries are still relatively new. There &#10; are a number of possible reasons that contribute to this irreversible &#10; form of cell failure.&lt;/p&gt; &lt;p&gt;The suspected culprit is foreign particles that &#10; contaminate the cells during manufacture. Another possible &#10; cause is rough spots on the plates that damage the separator. &#10; Better quality control at the raw material level and minimal &#10; human interface during the manufacturing process has greatly &#10; reduced the ‘infant mortality’ rate of the modern rechargeable &#10; cells.&lt;/p&gt; &lt;p&gt;Cell reversal caused by deep discharging also &#10; contributes to shorted cells. This commonly occurs if a nickel-based &#10; battery is being fully depleted under a heavy load. A NiCd &#10; battery is designed with some reverse voltage protection and &#10; a small reverse current in the magnitude of milliamperes can &#10; be tolerated. A high current, however, causes the reversed-polarized &#10; cell to develop a permanent electrical short. Another cause &#10; of a short circuit is marring the separator through uncontrolled &#10; crystalline formation.&lt;/p&gt; &lt;p&gt;Applying momentary high-current bursts in an &#10; attempt to repair shorted cells has had limited success. The &#10; short may temporarily evaporate but the damage to the separator &#10; material remains. The repaired cell often exhibits a high &#10; self-discharge and the short frequently returns.&lt;/p&gt; &lt;p&gt;Replacing a shorted cell in an aging pack is &#10; not recommended unless the new cell is matched with the others &#10; in terms of voltage and capacity. Otherwise, an imbalance &#10; may occur. One may remember the biblical verse “No one puts &#10; a patch of unshrunken cloth on an old garment. . .” or “No &#10; man would put new wine into old wineskins. . .” (Mt 9.16-17). &#10; Attempts to replace faulty cells have commonly lead to battery &#10; failures after about six months of use. It is best not to &#10; disturb the cells in a battery pack but allow them to age &#10; naturally. Maintaining the batteries while they are still &#10; in good working condition will help to prevent premature failure.&lt;/p&gt; &lt;p&gt;Shorts in a Li-ion cell are uncommon. Protection &#10; circuits monitor an ailing Li-ion cell and render the &#10; pack unusable if serious voltage irregularities are detected. &#10; Charging such a pack would (protection circuit permitting) &#10; generate excess heat. The battery’s temperature control circuits &#10; are designed to terminate the charge.&lt;/p&gt;&lt;h4&gt;14.5 Loss of Electrolyte&lt;/h4&gt; &lt;p&gt;Although sealed, battery cells may lose some &#10; electrolyte during their life. Typical loss of moisture occurs &#10; if the seal opens due to excessive pressure. This occurs if &#10; the battery is charged at very low or very high temperatures. &#10; Once vented, the spring-loaded seal of nickel-based cells &#10; may never properly close again, resulting in a deposit of &#10; white powder around the seal opening. Losses may also occur &#10; if the cell cap is not correctly sealed in the manufacturing &#10; process. The loss of electrolyte results in a decrease of &#10; capacity, a defect that cannot be corrected.&lt;/p&gt; &lt;p&gt;Permeation, or loss of electrolyte in sealed &#10; lead acid batteries, is a recurring problem. Overcharge is &#10; the main cause. Careful adjustment of charging and float voltages &#10; reduces loss of electrolyte. In addition, the battery should &#10; operate at moderate temperatures. Air-conditioning is a prerequisite &#10; for VRLA batteries, especially in warmer climates.&lt;/p&gt; &lt;p&gt;Replenishing lost liquid in VRLA batteries by &#10; adding water has had limited success. Although lost capacity &#10; can often be regained with a catalyst, the performance of &#10; the stack is short-lived. After tampering with the cells, &#10; it was observed that the battery stack turned into high maintenance &#10; mode and needed to be closely supervised.&lt;/p&gt; &lt;p&gt;A properly designed, correctly charged Li-ion &#10; cell should never generate gases. As a result, the Li-ion &#10; battery does not lose electrolyte through venting.&lt;/p&gt; &lt;p&gt;But in spite of what is being said, the lithium-based &#10; cells can build up an internal pressure under certain conditions. &#10; Provisions are made to maintain safety of the battery and &#10; equipment should this occur. Some cells include an electrical &#10; switch that opens if the cell pressure reaches a critical &#10; level. Other cells feature a membrane that safely releases &#10; the gases if need be. Controlled release of the pressure prevents &#10; bulging of the cell during pressure buildup.&lt;/p&gt; &lt;p&gt;Most of the safety features of lithium-based &#10; batteries are one-way; meaning that once activated, the cells &#10; are inoperable thereafter. This is done for safety reasons.&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>14. Vector Space Concepts</title><link>https://technick.net/guides/theory/edft/014/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/edft/014/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/filters/"&gt;Introduction to Digital Filters with Audio Applications&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, Copyright &amp;#169; &lt;i&gt;2017-11-26&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/edft/013"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/000"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/022"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/015"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;Vector Space Concepts&lt;/h3&gt;&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;A set &lt;img width="22" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img289.gif" alt="$X$" /&gt; of objects is called a &lt;i&gt;metric space&lt;/i&gt;&lt;a name="2466"&gt;&lt;/a&gt;if with any two points &lt;img width="14" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img290.gif" alt="$p$" /&gt; and &lt;img width="14" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img291.gif" alt="$q$" /&gt; of &lt;img width="22" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img289.gif" alt="$X$" /&gt; there is associated a real number&lt;img width="56" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img292.gif" alt="$d(p,q)$" /&gt;, called the distance from &lt;img width="14" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img290.gif" alt="$p$" /&gt; to &lt;img width="14" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img291.gif" alt="$q$" /&gt;, such that&#10;(a) &lt;img width="90" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img293.gif" alt="$d(p,q)&amp;gt;0$" /&gt; if &lt;img width="48" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img294.gif" alt="$p\" eq="" /&gt;; &lt;img width="91" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img295.gif" alt="$d(p,p)=0$" /&gt;, (b) &lt;img width="132" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img296.gif" alt="$d(p,q)=d(q,p)$" /&gt;, (c)&#10;&lt;!-- MATH&#10; $d(p,q)\leq d(p,r)+d(r,q)$&#10; --&gt;&lt;img width="205" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img297.gif" alt="$d(p,q)\" eq="" p="" d="" q="q" /&gt;, for any &lt;img width="54" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img298.gif" alt="$r\" n="" /&gt; [&lt;a href="https://technick.net/guides/theory/edft/023#Rudin"&gt;Rudin&amp;nbsp;1964&lt;/a&gt;].&lt;/p&gt;&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;A &lt;i&gt;linear space&lt;/i&gt;&lt;a name="2469"&gt;&lt;/a&gt; is a set of ``vectors'' &lt;img width="22" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img289.gif" alt="$X$" /&gt; together&#10;with a field of ``scalars'' &lt;img width="18" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img299.gif" alt="${\" al="" /&gt; with an addition&#10;operation &lt;!-- MATH&#10; $+:X\times X\mapsto X$&#10; --&gt;&lt;img width="139" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img300.gif" alt="$+:X\" imes="" apsto="" /&gt;, and a multiplication opration &lt;img width="10" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img301.gif" alt="$\" dot="" /&gt;taking &lt;!-- MATH&#10; ${\cal S}\times X\mapsto X$&#10; --&gt;&lt;img width="105" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img302.gif" alt="${\" al="" imes="" apsto="" /&gt;, with the following properties: If &lt;img width="15" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img224.gif" alt="$x$" /&gt;, &lt;img width="15" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img225.gif" alt="$y$" /&gt;,&#10;and &lt;img width="14" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img1.gif" alt="$z$" /&gt; are in &lt;img width="22" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img289.gif" alt="$X$" /&gt;, and &lt;img width="37" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img303.gif" alt="$\" lpha="" eta="" /&gt; are in &lt;img width="18" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img299.gif" alt="${\" al="" /&gt;, then&lt;ol&gt;&lt;li&gt;&lt;img width="117" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img304.gif" alt="$x+y=y+x$" /&gt;.&lt;/li&gt;&lt;li&gt;&lt;!-- MATH&#10; $x+(y+z)=(x+y)+z$&#10; --&gt;&lt;img width="211" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img305.gif" alt="$x+(y+z)=(x+y)+z$" /&gt;.&lt;/li&gt;&lt;li&gt;There exists &lt;img width="14" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img306.gif" alt="$\" mptyset="" /&gt; in &lt;img width="22" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img289.gif" alt="$X$" /&gt; such that &lt;!-- MATH&#10; $0\cdot x=\emptyset$&#10; --&gt;&lt;img width="73" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img307.gif" alt="$0\" dot="" mptyset="" /&gt;for all &lt;img width="15" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img224.gif" alt="$x$" /&gt; in &lt;img width="22" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img289.gif" alt="$X$" /&gt;. &lt;/li&gt;&lt;li&gt;&lt;!-- MATH&#10; $\alpha(\beta x) = (\alpha\beta) x$&#10; --&gt;&lt;img width="127" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img308.gif" alt="$\" lpha="" eta="" lpha\beta="" /&gt;.&lt;/li&gt;&lt;li&gt;&lt;!-- MATH&#10; $(\alpha+\beta)x=\alpha x + \beta x$&#10; --&gt;&lt;img width="170" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img309.gif" alt="$(\" lpha="" eta="" alpha="" beta="" /&gt;.&lt;/li&gt;&lt;li&gt;&lt;img width="74" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img310.gif" alt="$1\" dot="" /&gt;.&lt;/li&gt;&lt;li&gt;&lt;!-- MATH&#10; $\alpha(x+y) = \alpha x + \alpha y$&#10; --&gt;&lt;img width="167" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img311.gif" alt="$\" lpha="" y="" lpha="" lpha="" /&gt;.&lt;/li&gt;&lt;/ol&gt;The element &lt;img width="14" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img306.gif" alt="$\" mptyset="" /&gt; is written as &lt;img width="14" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img288.gif" alt="$0$" /&gt; thus coinciding with the&#10;notation for the real number zero. A linear space is sometimes be&#10;called a linear &lt;a href="http://mathworld.wolfram.com/VectorSpace.html" target="_blank"&gt;vector space&lt;/a&gt;, or a vector space.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;A &lt;i&gt;&lt;a href="http://mathworld.wolfram.com/topics/Norms.html" target="_blank"&gt;normed&lt;/a&gt; linear space&lt;/i&gt;&lt;a name="2477"&gt;&lt;/a&gt; is a linear space &lt;img width="22" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img289.gif" alt="$X$" /&gt; on which there is defined&#10;a real-valued function of &lt;img width="56" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img312.gif" alt="$x\" n="" /&gt; called&#10;a &lt;i&gt;norm&lt;/i&gt;&lt;a name="2479"&gt;&lt;/a&gt;, denoted &lt;img width="43" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img313.gif" alt="$ \" ert\vert="" ert\vert="" /&gt;, &#10;satisfying the following three properties:&lt;ol&gt;&lt;li&gt;&lt;!-- MATH&#10; $\left\|\,x\,\right\| \geq 0$&#10; --&gt;&lt;img width="76" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img314.gif" alt="$\" eft\vert="" ight\vert="" eq="" /&gt;, and &lt;!-- MATH&#10; $\left\|\,x\,\right\|=0 \Leftrightarrow x=0$&#10; --&gt;&lt;img width="150" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img315.gif" alt="$\" eft\vert="" ight\vert="0" leftrightarrow="" /&gt;.&lt;/li&gt;&lt;li&gt;&lt;!-- MATH&#10; $\left\|\,cx\,\right\| = \left|c\right|\cdot\left\|\,x\,\right\|$&#10; --&gt;&lt;img width="143" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img316.gif" alt="$\" eft\vert="" right\vert="\left\vert" c\right\vert\cdot\left\vert="" ight\vert="" /&gt;, &lt;img width="13" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img317.gif" alt="$c$" /&gt; a scalar.&lt;/li&gt;&lt;li&gt;&lt;!-- MATH&#10; $\left\|\,x_1+x_2\,\right\| \leq \left\|\,x_1\,\right\| + \left\|\,x_2\,\right\|$&#10; --&gt;&lt;img width="225" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img318.gif" alt="$\" eft\vert="" right\vert="" eq="" eft\vert="" ight\vert="" eft\vert="" ight\vert="" /&gt;.&lt;/li&gt;&lt;/ol&gt;The &lt;a href="http://mathworld.wolfram.com/Functional.html" target="_blank"&gt;functional&lt;/a&gt; &lt;img width="76" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img319.gif" alt="$ \" ert\vert="" vert\vert="" /&gt; serves as a distance function on &lt;img width="22" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img289.gif" alt="$X$" /&gt;, so &#10;a normed linear space is also a metric space.&lt;/p&gt;&lt;p&gt;Note that when &lt;img width="22" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img289.gif" alt="$X$" /&gt; is the space of continuous complex functions&#10;on the unit circle in the &lt;a href="http://mathworld.wolfram.com/ComplexPlane.html" target="_blank"&gt;complex plane&lt;/a&gt;, the norm of a function is not&#10;changed when multiplied by a function of modulus &lt;img width="14" height="16" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img154.gif" alt="$1$" /&gt; on the unit circle.&#10;In signal processing terms, the norm is insensitive to multiplication by a&#10;unity-gain allpass &lt;a href="https://technick.net/guides/theory/edft/010"&gt;filter&lt;/a&gt; (also known as a Blaschke product).&lt;/p&gt;&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;A &lt;i&gt;pseudo-norm&lt;/i&gt;&lt;a name="2484"&gt;&lt;/a&gt; is&#10;a real-valued function of &lt;img width="56" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img312.gif" alt="$x\" n="" /&gt; &#10;satisfying the following three properties:&lt;ol&gt;&lt;li&gt;&lt;!-- MATH&#10; $\left\|\,x\,\right\| \geq 0$&#10; --&gt;&lt;img width="76" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img314.gif" alt="$\" eft\vert="" ight\vert="" eq="" /&gt;, and &lt;!-- MATH&#10; $x=0\Rightarrow \left\|\,x\,\right\|=0$&#10; --&gt;&lt;img width="150" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img320.gif" alt="$x=0\" ightarrow="" eft\vert="" ight\vert="0$" /&gt;.&lt;/li&gt;&lt;li&gt;&lt;!-- MATH&#10; $\left\|\,cx\,\right\| = \left|c\right|\cdot\left\|\,x\,\right\|$&#10; --&gt;&lt;img width="143" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img316.gif" alt="$\" eft\vert="" right\vert="\left\vert" c\right\vert\cdot\left\vert="" ight\vert="" /&gt;, &lt;img width="13" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img317.gif" alt="$c$" /&gt; a scalar.&lt;/li&gt;&lt;li&gt;&lt;!-- MATH&#10; $\left\|\,x_1+x_2\,\right\| \leq \left\|\,x_1\,\right\| + \left\|\,x_2\,\right\|$&#10; --&gt;&lt;img width="225" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img318.gif" alt="$\" eft\vert="" right\vert="" eq="" eft\vert="" ight\vert="" eft\vert="" ight\vert="" /&gt;.&lt;/li&gt;&lt;/ol&gt;A pseudo-norm differs from a norm in that the pseudo-norm can be zero&#10;for nonzero vectors (functions).&lt;/p&gt;&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;A &lt;i&gt;&lt;a href="http://mathworld.wolfram.com/BanachSpace.html" target="_blank"&gt;Banach Space&lt;/a&gt;&lt;/i&gt;&lt;a name="2489"&gt;&lt;/a&gt; is a &lt;i&gt;complete&lt;/i&gt; normed linear&#10;space, that is, a normed linear space in which every Cauchy&#10;sequence&lt;a name="tex2html7" href="https://technick.net/guides/theory/edft/025#foot5929"&gt;&lt;sup&gt;2&lt;/sup&gt;&lt;/a&gt;*A sequence &lt;!-- MATH&#10; $H_n(e^{j\omega})$&#10; --&gt;&lt;img width="68" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img321.gif" alt="$H_n(e^{j\" mega="" /&gt; is said to be a &lt;i&gt;Cauchy&#10;sequence&lt;/i&gt;&lt;a name="2492"&gt;&lt;/a&gt; if for each &lt;img width="47" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img108.gif" alt="$\" psilon="" t="" /&gt; there is an &lt;img width="22" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img218.gif" alt="$N$" /&gt; such that&#10;&lt;!-- MATH&#10; $||\,H_n(e^{j\omega})-H_m(e^{j\omega})\,|| &lt;\epsilon$&#10; --&gt;&lt;img width="219" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img322.gif" alt="$ \" ert\vert="" e="" omega="" m="" j\omega="" ert\vert="" t="" psilon="" /&gt; for all &lt;img width="16" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img206.gif" alt="$n$" /&gt; and &lt;img width="21" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img29.gif" alt="$m$" /&gt; larger than &lt;img width="22" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img218.gif" alt="$N$" /&gt;.&#10;converges to an element of the space.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;A function &lt;!-- MATH&#10; $H(e^{j\omega})$&#10; --&gt;&lt;img width="61" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img261.gif" alt="$H(e^{j\" mega="" /&gt; is said to belong to the space &lt;img width="27" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img323.gif" alt="$Lp$" /&gt; if&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\int_{-\pi}^\pi \left|H(e^{j\omega})\right|^p{d\omega\over 2\pi}&lt; \infty.&#10;\end{displaymath}&#10; --&gt;&lt;img width="201" height="53" border="0" src="https://technick.net/img/guide_edft/guide_edft_img324.gif" alt="\" egin="" isplaymath="" nt="" i="" i="" eft\vert="" j\omega="" ight\vert="" p="" omega\over="" i="" t="" nfty="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;A function &lt;!-- MATH&#10; $H(e^{j\omega})$&#10; --&gt;&lt;img width="61" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img261.gif" alt="$H(e^{j\" mega="" /&gt; is said to belong to the space &lt;img width="29" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img325.gif" alt="$H^p$" /&gt; if&#10;it is in &lt;img width="27" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img323.gif" alt="$Lp$" /&gt; and if its analytic continuation &lt;img width="46" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img5.gif" alt="$H(z)$" /&gt; is analytic for&lt;img width="59" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img326.gif" alt="$\" ert="" ert="" t="" /&gt;. &lt;img width="46" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img5.gif" alt="$H(z)$" /&gt; is said to be in &lt;img width="40" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img327.gif" alt="$H^{-p}$" /&gt; if &lt;!-- MATH&#10; $H(z^{-1})\in H^p$&#10; --&gt;&lt;img width="112" height="38" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img328.gif" alt="$H(z^{-1})\" n="" p="" /&gt;.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Theorem. &lt;/b&gt; (Riesz-Fischer) The &lt;img width="27" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img323.gif" alt="$Lp$" /&gt; spaces are complete.&lt;b&gt;Proof. &lt;/b&gt;See Royden [&lt;a href="https://technick.net/guides/theory/edft/023#Royden"&gt;Royden&amp;nbsp;1968&lt;/a&gt;], p. 117.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;A Hilbert space is a Banach space with a symmetric bilinear&lt;a href="https://ccrma.stanford.edu/~jos//proj/Inner_Product.html" target="_blank"&gt;inner product&lt;/a&gt; &lt;img width="73" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img329.gif" alt="$&amp;lt;x,y&amp;gt;$" /&gt; defined such that the inner product of a vector with&#10;itself is the square of its norm &lt;!-- MATH&#10; $&lt;x,x&gt;= ||\,x\,|| ^2$&#10; --&gt;&lt;img width="140" height="38" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img330.gif" alt="$&amp;lt;x,x&amp;gt;= \" ert\vert="" ert\vert="" /&gt;.&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>15. Bibliography</title><link>https://technick.net/guides/theory/dar/015/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dar/015/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/resample/"&gt;The Digital Audio Resampling Home Page&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, Copyright &amp;#169; &lt;i&gt;2016-05-17&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dar/014"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dar/000"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dar/016"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;Bibliography&lt;/h3&gt;&lt;dl compact="compact"&gt;&lt;dd&gt;&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="Crochiere"&gt; Crochiere and Rabiner&amp;nbsp;1983&lt;/a&gt;&lt;dd&gt;Crochiere, R., and L.&amp;nbsp;R. Rabiner. 1983.&lt;br /&gt;&lt;em&gt;Multirate &lt;a href="http://www.dsptutor.freeuk.com/" target="_blank"&gt;Digital Signal Processing&lt;/a&gt;&lt;/em&gt;.&lt;br /&gt;Englewood Cliffs, NJ: Prentice-Hall, Inc.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="DSPC"&gt;Digital Signal Processing Committee&amp;nbsp;1979a&lt;/a&gt;&lt;dd&gt;&lt;a href="http://www.dsptutor.freeuk.com/" target="_blank"&gt;Digital Signal Processing&lt;/a&gt; Committee (ed). 1979a.&lt;br /&gt;&lt;em&gt;Programs for &lt;a href="http://www.dsptutor.freeuk.com/" target="_blank"&gt;Digital Signal Processing&lt;/a&gt;&lt;/em&gt;.&lt;br /&gt;New York: IEEE Press.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="DSPCB"&gt;Digital Signal Processing Committee&amp;nbsp;1979b&lt;/a&gt;&lt;dd&gt;&lt;a href="http://www.dsptutor.freeuk.com/" target="_blank"&gt;Digital Signal Processing&lt;/a&gt; Committee (ed). 1979b.&lt;br /&gt;&lt;em&gt;Programs for &lt;a href="http://www.dsptutor.freeuk.com/" target="_blank"&gt;Digital Signal Processing&lt;/a&gt; II&lt;/em&gt;.&lt;br /&gt;New York: IEEE Press.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="Goldstein"&gt; Goldstein&amp;nbsp;1967&lt;/a&gt;&lt;dd&gt;Goldstein, A.&amp;nbsp;A. 1967.&lt;br /&gt;&lt;em&gt;Constructive Real Analysis&lt;/em&gt;.&lt;br /&gt;New York: Harper and Row.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="Hildebrand"&gt; Hildebrand&amp;nbsp;1974&lt;/a&gt;&lt;dd&gt;Hildebrand, F.&amp;nbsp;B. 1974.&lt;br /&gt;&lt;em&gt;Introduction to Numerical Analysis&lt;/em&gt;.&lt;br /&gt;New York: Dover. second edition.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="Kaiser74"&gt; Kaiser&amp;nbsp;1974&lt;/a&gt;&lt;dd&gt;Kaiser, J.&amp;nbsp;F. 1974.&lt;br /&gt;``Using the &lt;img width="77" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dar/guide_dar_img239.gif" alt="${I}_0-\" inh="" /&gt; Window Function.''&lt;br /&gt;&lt;em&gt;IEEE Transactions on Circuits and Systems--I: Fundamental Theory and&#10; Applications&lt;/em&gt;, April 22-25:20-23. reprinted in [&lt;a href="https://technick.net/guides/theory/dar/015#DSPCB"&gt;Digital Signal Processing Committee&amp;nbsp;1979b&lt;/a&gt;], pp. 123-126.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="KootsookosAndWilliamson95"&gt; Kootsookos and&#10; Williamson&amp;nbsp;1996&lt;/a&gt;&lt;dd&gt;Kootsookos, P.&amp;nbsp;J., and R.&amp;nbsp;C. Williamson. 1996.&lt;br /&gt;``FIR Approximation of Fractional Sample Delay Systems.''&lt;br /&gt;&lt;em&gt;IEEE Transactions on Circuits and Systems--II: Analog and &lt;a href="http://www.dsptutor.freeuk.com/" target="_blank"&gt;Digital&#10; Signal Processing&lt;/a&gt;&lt;/em&gt;, 43(2):40-48.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="LaaksoB"&gt; Laakso &lt;em&gt;et&amp;nbsp;al.&lt;/em&gt;&amp;nbsp;1996&lt;/a&gt;&lt;dd&gt;Laakso, T.&amp;nbsp;I., V.&amp;nbsp;V&amp;auml;lim&amp;auml;ki, M.&amp;nbsp;Karjalainen, and U.&amp;nbsp;K. Laine. 1996.&lt;br /&gt;``Splitting the Unit Delay--Tools for &lt;a href="https://ccrma.stanford.edu/~jos//Interpolation/" target="_blank"&gt;Fractional Delay Filter&#10; Design&lt;/a&gt;.''&lt;br /&gt;&lt;em&gt;IEEE Signal Processing Magazine&lt;/em&gt;, 13(1):30-60.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="PutnamAndSmithMohonk97"&gt; Putnam and Smith&amp;nbsp;1997&lt;/a&gt;&lt;dd&gt;Putnam, W., and J.&amp;nbsp;O. Smith. 1997.&lt;br /&gt;``Design of Fractional Delay filters Using Convex Optimization.''&lt;br /&gt;&lt;em&gt;In:&lt;/em&gt; &lt;em&gt;Proceedings of the IEEE Workshop on Applications of Signal Processing to&#10; Audio and Acoustics, New Paltz, NY&lt;/em&gt;.&lt;br /&gt;New York: IEEE Press.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="RabinerAndGold"&gt; Rabiner and Gold&amp;nbsp;1975&lt;/a&gt;&lt;dd&gt;Rabiner, L.&amp;nbsp;R., and B.&amp;nbsp;Gold. 1975.&lt;br /&gt;&lt;em&gt;Theory and Application of &lt;a href="http://www.dsptutor.freeuk.com/" target="_blank"&gt;Digital Signal Processing&lt;/a&gt;&lt;/em&gt;.&lt;br /&gt;Englewood Cliffs, NJ: Prentice-Hall, Inc.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="RossumInterp"&gt; Rossum&amp;nbsp;1993&lt;/a&gt;&lt;dd&gt;Rossum, D. 1993.&lt;br /&gt;``Constraint Based Audio Interpolators.''&lt;br /&gt;&lt;em&gt;Proceedings of the IEEE Workshop on Applications of Signal Processing to Audio and&#10; Acoustics, New Paltz, NY&lt;/em&gt;.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="SchaferAndRabiner"&gt; Schafer and Rabiner&amp;nbsp;1973&lt;/a&gt;&lt;dd&gt;Schafer, R.&amp;nbsp;W., and L.&amp;nbsp;R. Rabiner. 1973.&lt;br /&gt;``A &lt;a href="http://www.dsptutor.freeuk.com/" target="_blank"&gt;Digital Signal Processing&lt;/a&gt; Approach to Interpolation.''&lt;br /&gt;&lt;em&gt;Proceedings of the IEEE&lt;/em&gt;, 61(June):692-702.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="Schanze"&gt; Schanze&amp;nbsp;1995&lt;/a&gt;&lt;dd&gt;Schanze, T. 1995.&lt;br /&gt;``&lt;a href="https://technick.net/guides/theory/dar/000"&gt;Sinc Interpolation&lt;/a&gt; of Discrete Periodic Signals.''&lt;br /&gt;&lt;em&gt;IEEE Transactions on Signal Processing&lt;/em&gt;, 43(6):1502-1503.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="SmithWinFlt"&gt; Smith&amp;nbsp;1992&lt;/a&gt;&lt;dd&gt;Smith, J.&amp;nbsp;O. 1992 (Winter).&lt;br /&gt;&lt;em&gt;The &lt;a href="https://ccrma.stanford.edu/~jos//WinFlt/Example.html" target="_blank"&gt;Window Method for Digital Filter Design&lt;/a&gt;&lt;/em&gt;. mathematica notebook for Music 420 (&lt;a href="http://ee.stanford.edu/" target="_blank"&gt;EE&lt;/a&gt; 367A), available online as&#10; &lt;a name="tex2html18" href="ftp://ccrma-ftp.stanford.edu/pub/DSP/Tutorials/Kaiser.ma.Z"&gt;ftp://ccrma-ftp.stanford.edu/pub/DSP/Tutorials/Kaiser.ma.Z&lt;/a&gt;.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="SmithAndGossett84"&gt; Smith and Gossett&amp;nbsp;1984&lt;/a&gt;&lt;dd&gt;Smith, J.&amp;nbsp;O., and P.&amp;nbsp;Gossett. 1984.&lt;br /&gt;``A Flexible &lt;a href="https://technick.net/guides/theory/dar/000"&gt;Sampling-Rate Conversion&lt;/a&gt; Method.''&lt;br /&gt;&lt;em&gt;Pages 19.4.1-19.4.2 of:&lt;/em&gt; &lt;em&gt;Proceedings of the International Conference on Acoustics,&#10; Speech, and Signal Processing, San Diego&lt;/em&gt;, vol. 2.&lt;br /&gt;New York: IEEE Press. an expanded tutorial based on this paper and&#10; associated free software are available online at The &lt;a href="https://technick.net/guides/theory/dar/000"&gt;Digital Audio Resampling&#10; Home Page&lt;/a&gt;:&#10; &lt;a name="tex2html19" href="https://ccrma.stanford.edu/~jos//resample/" target="_blank"&gt;https://ccrma.stanford.edu/~jos//resample/&lt;/a&gt;.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="VesaT"&gt;V&amp;auml;lim&amp;auml;ki&amp;nbsp;1995&lt;/a&gt;&lt;dd&gt;V&amp;auml;lim&amp;auml;ki, V. 1995 (Dec.).&lt;br /&gt;&lt;em&gt;Discrete-Time Modeling of Acoustic Tubes Using &lt;a href="https://ccrma.stanford.edu/~jos//Interpolation/" target="_blank"&gt;Fractional Delay&#10; Filters&lt;/a&gt;&lt;/em&gt;.&lt;br /&gt;Ph.D. thesis, Report no. 37, Helsinki University of Technology,&#10; Faculty of Electrical Engineering, Laboratory of Acoustic and Audio Signal Processing, Espoo,&#10; Finland.&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dl&gt; &lt;p&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>15. Caring for Your Batteries from Birth to Retirement</title><link>https://technick.net/guides/electronics/bpw/c15_01/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c15_01/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c14_03"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c15_02"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;15. Caring for Your Batteries from Birth to Retirement&lt;/h3&gt;&lt;p&gt; It is interesting to observe that batteries cared for by a single &#10; user generally last longer than those that operate in an open &#10; fleet system where everyone has access to, but no one is accountable &#10; for them. There are two distinct groups of battery users — the &#10; personal user and the fleet operator. &#10; &lt;/p&gt;&lt;p&gt;&lt;img src="https://technick.net/img/guide_bpw2/c15_01.gif" width="232" height="120" vspace="19" hspace="19" align="left" border="0" alt="" /&gt;A &#10; personal user is one who operates a mobile phone, a laptop &#10; computer or a video camera for business or pleasure. He or &#10; she will most likely follow the recommended guidelines in &#10; caring for the battery. The user will get to know the irregularities &#10; of the battery. When the runtime gets low, the battery often &#10; gets serviced or replaced. Critical failures are rare because &#10; the owner adjusts to the performance of the battery and lowers &#10; expectations as the battery&amp;nbsp;ages.&lt;/p&gt; &lt;p&gt;The fleet user, on the other hand, has little &#10; personal interest in the battery and is unlikely to tolerate &#10; a pack that is less than perfect. The fleet user simply grabs &#10; a battery from the charger and expects it to last through &#10; the shift. The battery is returned to the charger at the end &#10; of the day, ready for the next person. Little or no care is &#10; given to these batteries. Perhaps due to neglect, fleet batteries &#10; generally have a shorter service life than those in personal&amp;nbsp;use.&lt;/p&gt; &lt;p&gt;How can fleet batteries be made to last longer? &#10; An interesting contrast in the handling of fleet batteries &#10; can be noted by comparing the practices of the US&amp;nbsp;Army &#10; and the Dutch Army, both of which use fleet batteries. The &#10; US&amp;nbsp;Army issues batteries with no maintenance program &#10; in place. If the battery fails, another pack is issued. Little &#10; or no care is given and the failure rate is&amp;nbsp;high.&lt;/p&gt; &lt;p&gt;The Dutch Army, on the other hand, has moved &#10; away from the open fleet system by making the soldiers responsible &#10; for their batteries. This change was made in an attempt to &#10; reduce battery waste and improve reliability. The batteries &#10; are issued in the soldier’s name and the packs become part &#10; of their personal belongings. The results are startling. Since &#10; the Dutch Army adapted this new regime, the failure rate has &#10; dropped considerably and, at the same time, battery performance &#10; has increased. Unexpected down time has almost been eliminated.&lt;/p&gt; &lt;p&gt;It should be noted that the Dutch Army uses exclusively &#10; NiCd batteries. Each pack receives periodic maintenance to &#10; prolong service life. Weak batteries are systematically replaced. &#10; The US Army, on the other hand, uses NiMH batteries. They &#10; are evaluating the Li-ion polymer for the next generation &#10; battery.&lt;/p&gt; &lt;p&gt;Because of the high failure rate of fleet batteries &#10; and the uncertain situations such failures create, some organizations &#10; assign a person to maintain batteries. This person checks &#10; all batteries on a scheduled basis, exercises them for optimum &#10; service life, and replaces those that fall below an accepted &#10; capacity level and do not recover with maintenance programs. &#10; Batteries perform an important function; giving them the care &#10; they deserve is appropriate.&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>15. Caring for Your Batteries from Birth to Retirement 2</title><link>https://technick.net/guides/electronics/bpw/c15_02/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c15_02/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c15_01"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c15_03"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;15.1 Storage&lt;/h4&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;Batteries are a perishable product and start &#10; deteriorating right from the time they leave the manufacturing &#10; plant. For this reason, it is not advisable to stock up on &#10; batteries for future use. This is especially true with lithium-based &#10; batteries. The buyer should also be aware of the manufacturing &#10; date. Avoid acquiring old stock.&lt;/p&gt; &lt;p&gt;&lt;img src="https://technick.net/img/guide_bpw2/c15_02.gif" width="242" height="102" vspace="19" hspace="19" align="right" border="0" alt="" /&gt;Keep &#10; batteries in a cool and dry storage area. Refrigerators are &#10; recommended, but freezers must be avoided because most battery &#10; chemistries are not suited for storage in sub-freezing temperatures. &#10; When refrigerated, the battery should be placed in a plastic &#10; bag to protect it against condensation.&lt;/p&gt; &lt;p&gt;The NiCd battery can be stored unattended for &#10; five years and longer. For best results, a NiCd should be &#10; fully charged, then discharged to zero volts. If this procedure &#10; is impractical, a discharge to 1V/cell is acceptable. A fully &#10; charged NiCd that is allowed to self-discharge during storage &#10; is subject to crystalline formation (memory).&lt;/p&gt; &lt;p&gt;Most batteries are shipped with a state-of-charge &#10; (SoC) of 40&amp;nbsp;percent. After six months storage or longer, &#10; a nickel-based battery needs to be primed before use. A slow &#10; charge, followed by one or several discharge/charge cycles, &#10; will do. Depending on the duration of storage and temperature, &#10; the battery may require two or more cycles to regain full &#10; performance. The warmer the storage temperature, the more &#10; cycles will be needed.&lt;/p&gt; &lt;p&gt;The Li-ion does not like prolonged storage. &#10; Irreversible capacity loss occurs after 6 to 12&amp;nbsp;months, &#10; especially if the battery is stored at full charge and at &#10; warm temperatures. It is often necessary to keep a battery &#10; fully charged as in the case of emergency response, public &#10; safety and defense. Running a laptop (or other portable device) &#10; continuously on an external power source with the battery &#10; engaged will have the same effect. Figure&amp;nbsp;15-1 &#10; illustrates the recoverable capacity after storage at different &#10; charge levels and temperatures.&lt;/p&gt; &lt;p&gt;The combination of a full charge condition and &#10; high temperature cannot always be avoided. Such is the case &#10; when keeping a spare battery in the car for a mobile phone. &#10; The NiMH and Li-ion chemistries are most severely affected &#10; by hot storage and operation. Among the Li-ion family, &#10; the cobalt has an advantage over the manganese (spinel) in &#10; terms of storage at elevated temperatures.&lt;/p&gt; &lt;table border="0" cellspacing="0" cellpadding="3" width="100%"&gt; &lt;tr&gt; &#10; &lt;td colspan="3" valign="top"&gt; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="20%" valign="top" bgcolor="#E6E6E6"&gt; &lt;b class="table-bolder"&gt;Temperature&lt;/b&gt;&lt;/td&gt; &lt;td width="46%" valign="top" bgcolor="#E6E6E6"&gt; &lt;b class="table-bolder"&gt;40% &#10; charge level&lt;/b&gt;&lt;br /&gt; (recommended storage charge level)&lt;/td&gt; &lt;td width="33%" valign="top" bgcolor="#E6E6E6"&gt; &lt;b class="table-bolder"&gt;100% &#10; charge level&lt;/b&gt;&lt;br /&gt; (typical user charge level)&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td colspan="3" valign="top"&gt; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="20%" valign="top"&gt; 0&amp;deg;C&lt;/td&gt; &lt;td width="46%" valign="top"&gt; 98% after 1 year&lt;/td&gt; &lt;td width="33%" valign="top"&gt; 94% after 1 year&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="20%" valign="top" bgcolor="#F3F3F3"&gt; 25&amp;deg;C&lt;/td&gt; &lt;td width="46%" valign="top" bgcolor="#F3F3F3"&gt; 96% after &#10; 1 year&lt;/td&gt; &lt;td width="33%" valign="top" bgcolor="#F3F3F3"&gt; 80% after &#10; 1 year&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="20%" valign="top"&gt; 40&amp;deg;C&lt;/td&gt; &lt;td width="46%" valign="top"&gt; 85% after 1 year&lt;/td&gt; &lt;td width="33%" valign="top"&gt; 65% after 1 year&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="20%" valign="top" bgcolor="#F3F3F3"&gt; 60&amp;deg;C&lt;/td&gt; &lt;td width="46%" valign="top" bgcolor="#F3F3F3"&gt; 75% after &#10; 1 year&lt;/td&gt; &lt;td width="33%" valign="top" bgcolor="#F3F3F3"&gt; 60% after &#10; 3 months&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td colspan="3" valign="top"&gt; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;p class="caption"&gt;Figure&amp;nbsp;15-1:&amp;nbsp; Non-recoverable capacity &#10; loss on Li-ion batteries after storage.&lt;br /&gt; &lt;span class="caption-sub"&gt;High charge levels and elevated &#10; temperatures hasten the capacity loss. Improvements in chemistry &#10; have increased the storage performance of some Li-ion batteries.&lt;/span&gt;&lt;/p&gt; &lt;p&gt;The recommended storage temperature of a lithium-based &#10; battery is 15&amp;deg;C (59&amp;deg;F) or less. A charge level of 40&amp;nbsp;percent &#10; allows for some self-discharge that naturally occurs; and &#10; 15&amp;deg;C is a practical and economical storage temperature that &#10; can be achieved without expensive climate control systems.&lt;/p&gt; &lt;p&gt;While most rechargeable batteries cannot be stored &#10; at freezing temperatures, some newer commercial Li-ion &#10; batteries can be kept at temperatures of -40&amp;deg;C without apparent &#10; side effects. Such temperature tolerances enable long and &#10; cost-effective storage in the arctic.&lt;/p&gt; &lt;p&gt;The SLA battery can be stored for up to two years &#10; but must be kept in a charged condition. A periodic topping &#10; charge, also referred to as ‘refreshing charge’, is required &#10; to prevent the open cell voltage from dropping below 2.10V. &#10; (Depending on the manufacturer, some lead acid batteries may &#10; be allowed to drop to lower voltage levels). When self-discharged &#10; below a critical voltage threshold, sulfation occurs on most &#10; lead acid batteries. Sulfation is an oxidation layer on the &#10; negative plate that alters the charge and discharge characteristics. &#10; Although cycling can often restore the capacity loss, the &#10; battery should be recharged before the open cell voltage drops &#10; below 2.10V.&lt;/p&gt; &lt;p&gt;The SLA cannot be stored below freezing temperatures. &#10; Once a pack has been frozen, it is permanently damaged and &#10; its service life is drastically reduced. A previously frozen &#10; battery will only be able to deliver a limited number of cycles.&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>15. Caring for Your Batteries from Birth to Retirement 3</title><link>https://technick.net/guides/electronics/bpw/c15_03/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c15_03/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c15_02"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c15_04"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;15.2 Priming&lt;/h4&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;Some nickel-based batteries do not perform well &#10; when new. This deficiency is often caused by lack of formatting &#10; at the time of manufacturing. Batteries that are not sufficiently &#10; formatted are destined to fail because the initial capacity &#10; is low. The full potential is only reached after the battery &#10; has been cycled a few times. In many cases, the user does &#10; not have the patience to wait until the expected performance &#10; is reached. Instead, the customer exercises the warranty return &#10; option.&lt;/p&gt; &lt;p&gt;The most critical time in a battery’s life is &#10; the so-called priming stage. An analogy can be drawn with &#10; breaking in a new car engine. The performance and fuel efficiency &#10; may not be best at first, but with care and attention, the &#10; engine will improve over time. If overstressed when new, the &#10; engine may never provide the economical and dependable service &#10; that is expected.&lt;/p&gt; &lt;p&gt;Some poorly formatted batteries are known to &#10; produce less than 10&amp;nbsp;percent of capacity at the initial &#10; priming stage. By cycling, the capacity increases, and the &#10; battery will become usable after three to five cycles. Maximum &#10; performance on a NiCd, for example, is reached after 50 to &#10; 100&amp;nbsp;full charge/discharge cycles. This priming function &#10; occurs while the battery is being used. The gradual capacity &#10; increase during the early life of a battery is normally hidden &#10; to the&amp;nbsp;user.&lt;/p&gt; &lt;p&gt;Quality cells from major Japanese manufacturers &#10; do not need extended priming and can be used almost immediately. &#10; After five full cycles, the performance is predictable and &#10; fully repeatable.&lt;/p&gt; &lt;p&gt;The manufacturer’s recommended priming procedure &#10; should be followed. In many cases, a 24-hour trickle charge &#10; is needed. Verifying the performance with a battery analyzer &#10; is advisable, especially if the batteries are used for critical &#10; applications.&lt;/p&gt; &lt;p&gt;Some nickel-based batteries are known to form &#10; a passivation layer&amp;nbsp;if kept in prolonged storage. Little scientific &#10; knowledge is available on this subject and the battery manufacturers &#10; may deny the existence of such a layer. A full charge/discharge, &#10; followed by a complete recharge corrects the problem.&lt;/p&gt; &lt;p&gt;Li-ion cells need less priming than the &#10; nickel-based equivalent. Manufacturers of Li-ion cells &#10; insist that priming is not a requirement. The priming function &#10; on the Li-ion may be used to verify that the battery &#10; is fully functional and produces the capacity required.&lt;/p&gt; &lt;p&gt;In an earlier chapter, the question “Why are &#10; excessive quantities of batteries being returned under warranty?” &#10; was raised. This question has not been fully answered. It &#10; appears that all battery chemistries are represented among &#10; the packs being returned. It is unclear whether these batteries &#10; are inoperable as claimed. Perhaps the liberal warranty return &#10; offered by dealers provides an opportunity to acquire a new, &#10; and seemingly better, battery without charge. Some misuse &#10; of the warranty policy cannot be fully dismissed.&lt;/p&gt; &lt;p&gt;The internal protection circuit of lithium-based &#10; batteries may be the cause of some problems. For safety reasons, &#10; many of these batteries do not allow a recharge if the battery &#10; has been discharged below 2.5V/cell. If discharged close to &#10; 2.5V and the battery is not recharged for a while, self-discharge &#10; further discharges the pack below the 2.5V level. If, at this &#10; time, the battery is put into the charger, nothing may happen. &#10; The battery appears to have an open circuit and the user consequently &#10; demands a replacement.&lt;/p&gt; &lt;p&gt;Cadex&lt;i&gt; &lt;/i&gt;has received a large number of supposedly &#10; dead Li-ion polymer batteries from various manufacturers. &#10; When measured, these batteries had no voltage at the terminals &#10; and appeared to be dead. Charging the packs in their respective &#10; chargers was unsuccessful. But after waking up the battery’s &#10; control circuit with the ‘&lt;i&gt;Boost’&lt;/i&gt; function of the Cadex &#10; &lt;i&gt;7000 Series&lt;/i&gt; battery analyzer, most of these batteries &#10; accepted normal charge. After a full charge, the performance &#10; was checked. Almost all packs reached capacities of 80&amp;nbsp;percent &#10; and higher and the batteries were returned to service.&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>15. Caring for Your Batteries from Birth to Retirement 4</title><link>https://technick.net/guides/electronics/bpw/c15_04/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c15_04/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c15_03"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c15_05"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;15.3 The Million Dollar Battery Problem&lt;/h4&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;In today’s surging mobile phone market, many &#10; batteries are returned to mobile phone carriers before the &#10; ink on the invoice has dried. The most common consumer complaint &#10; is ‘less than expected’ runtime.&lt;/p&gt; &lt;p&gt;The reasons for this failure are multi-fold. &#10; The battery may not have been properly formatted at the factory. &#10; Perhaps the packs remained on the shelf too long or have been &#10; discharged too low. Incorrect customer preparation is also &#10; to blame. The true reason for such failure may never be known.&lt;/p&gt; &lt;p&gt;&lt;img src="https://technick.net/img/guide_bpw2/c15_03.gif" width="194" height="106" vspace="19" hspace="19" align="left" border="0" alt="" /&gt;Dealers &#10; are not equipped to handle the influx of returned batteries. &#10; To fulfill the warranty obligations and satisfy the customer, &#10; the dealer hands out a new battery and sends the faulty pack &#10; to the manufacturer. Truckloads of ‘worthless’ batteries are &#10; transported, only to be stockpiled in warehouses for eventual &#10; testing or recycling at the manufacturer’s expense. The cost &#10; of exchange, time lost by retail staff, shipping, warehousing &#10; and eventual disposal amounts to a million dollar problem.&lt;/p&gt; &lt;p&gt;On a recent visit to Europe, a Cadex staff member &#10; learned that a large phone manufacturer had received 17&amp;nbsp;tons &#10; of failed handset batteries in one year alone. The batteries &#10; were stockpiled in large barrels for recycling. He also discovered &#10; that 15,000&amp;nbsp;NiMH batteries were returned to the manufacturer &#10; within weeks after the release of a new phone. When spot-checking &#10; the failed batteries with a Cadex &lt;i&gt;7000 Series&lt;/i&gt; battery &#10; analyzer, most packs appeared to be operational.&lt;/p&gt; &lt;p&gt;On another occasion, a total of 14,000&amp;nbsp;Li-ion &#10; batteries were returned to a North American mobile phone provider. &#10; Of these, only 700 (or 5&amp;nbsp;percent), were faulty. Of these, &#10; ten random batteries were sent to Cadex for further testing. &#10; The Cadex lab reported that each of these failed packs indeed &#10; had genuine faults.&lt;/p&gt; &lt;p&gt;A European service center sent 40&amp;nbsp;Li-ion &#10; polymer batteries to Cadex for evaluation. These packs had &#10; failed in the field and were returned to the service center &#10; by customers. When servicing the batteries on a Cadex &lt;i&gt;7000 &#10; Series&lt;/i&gt; battery analyzer, 37&amp;nbsp;units were found to be &#10; fully functional with capacities of above 80&amp;nbsp;percent &#10; and impedances below 180mW.&lt;/p&gt; &lt;p&gt;Phone manufacturers report that 80&amp;nbsp;to 90&amp;nbsp;percent &#10; of returned batteries have no faults or can easily be repaired &#10; with battery analyzing equipment. The remaining 10&amp;nbsp;to &#10; 20&amp;nbsp;percent, which do not easily recover with basic service, &#10; can often be restored with extended programs. Only a small&amp;nbsp;percentage &#10; of batteries returned under warranty exhibit non-correctable &#10; faults.&lt;/p&gt; &lt;p&gt;Not all batteries and portable equipment under &#10; warranty fail due to manufacturer’s defects. A service manager &#10; for a major mobile phone manufacturer hinted that submersion &#10; into a cup of coffee or soft drink is a sizable contributor &#10; to equipment and battery failures. Apparently, the acids in &#10; the beverages manage to corrode the electrical conductors. &#10; Submersion into coffee occurs when the user mistakes the coffee &#10; cup for the phone cradle.&lt;/p&gt; &lt;p&gt;In an effort to salvage returned batteries, a &#10; leading mobile phone manufacturer segregates battery packs &#10; according to purchase date. Packs returned within the thirty-day &#10; warranty period are marked as type B. The batteries are then &#10; sent to a regional service center where they are serviced &#10; with battery analyzers. If the batteries are clean, (have &#10; no coffee residue) and regain a capacity of 80&amp;nbsp;percent &#10; or higher, the packs are relabeled and sold as a B class product. &#10; Over 90&amp;nbsp;percent of their returned batteries have been &#10; reclaimed with this program.&lt;/p&gt; &lt;p&gt;On the strength of this success, some battery-refurbishing &#10; houses have extended the service to include batteries of up &#10; to one year old. The service center experiences a 40&amp;nbsp;to &#10; 70&amp;nbsp;percent restoration yield in repairing these older &#10; batteries. The battery-refurbishing centers are said to make &#10; a profit. Equally important, such programs reduce the environmental &#10; impact of battery disposal.&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>15. Caring for Your Batteries from Birth to Retirement 5</title><link>https://technick.net/guides/electronics/bpw/c15_05/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c15_05/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c15_04"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c15_06"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;15.4 To the Service Counter, and No Further&lt;/h4&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;Not all manufacturers and dealers offer battery-refurbishing &#10; centers. If not available, a program is gaining popularity &#10; in which the battery is serviced at the store level. When &#10; a customer returns a faulty battery, the pack goes no further &#10; than the store that sold the equipment.&lt;/p&gt; &lt;p&gt;The customer service clerk checks the battery &#10; on site with approved test equipment. An attempt is made to &#10; restore the battery. If not successful and a warranty replacement &#10; is needed, a service report is issued, which is sent to the &#10; manufacturer by fax or e-mail. After verifying the report, &#10; the manufacturer offers replacement batteries as part of the &#10; warranty replacement policy.&lt;/p&gt; &lt;p&gt;Warranty replacement can be further streamlined &#10; by using the Internet and compatible battery analyzers. Such &#10; a process will operate with a minimum of human resources and &#10; run independent of office&amp;nbsp;hours and time zones. Here’s &#10; how it works:&lt;/p&gt; &lt;p&gt;The manufacturer first sends each participating &#10; store an appropriate number of replacement batteries. When &#10; a customer returns a faulty battery, service personnel test &#10; the pack with the in-store analyzer. If restoration is unsuccessful, &#10; the analyzer e-mails a report to the manufacturer, stating &#10; the nature of the deficiency. Other information, such as the &#10; date of purchase, battery type and customer name are also &#10; included. The computer at the manufacturer’s headquarters &#10; verifies the claim and, if valid, issues an inventory adjustment &#10; against the spare batteries allocated to the store. When the &#10; stock gets low, a re-stocking order is generated and additional &#10; batteries are sent out automatically.&lt;/p&gt; &lt;p&gt;&lt;img src="https://technick.net/img/guide_bpw2/c15_04.gif" width="218" height="118" vspace="19" hspace="19" align="right" border="0" alt="" /&gt;Besides &#10; lowering overhead costs, a fully integrated warranty replacement &#10; system provides the manufacturer with accurate information &#10; regarding the nature of battery failures. User patterns leading &#10; to battery failure can be evaluated by geographic region. &#10; For example, a temperature related failure might be more likely &#10; to occur in warm climates than in cool ones. Batteries with &#10; higher temperature resiliency can be allocated for these regions. &#10; Recurring problems can be identified quickly and corrective &#10; measures implemented within months rather than years. Such &#10; measures can be as simple as providing the customer with better &#10; operating instructions in preparing a new battery before&amp;nbsp;use.&lt;/p&gt; &lt;p&gt;One of the most difficult problems in servicing &#10; batteries at store-level is a lack of technical know-how by &#10; the customer service personnel. With the ever-increasing number &#10; of battery models, the task of identifying a battery type &#10; and setting the correct parameters is becoming increasingly &#10; more complex. Technology is not keeping pace in supplying &#10; the battery market with suitable test equipment that is both &#10; cost effective and easy to&amp;nbsp;use.&lt;/p&gt; &lt;p&gt;To bring battery testing within reach of the &#10; untrained user, battery analyzers must be simple to operate &#10; and allow easy interface with all major battery types. Setting &#10; the correct battery parameters should be clear and concise. &#10; Uncertainties that can lead to errors must be minimized. The &#10; manufacturer of the battery test equipment should be aware &#10; that the task of operating a battery analyzer is not part &#10; of the clerk’s job description.&lt;/p&gt; &lt;p&gt;The &lt;i&gt;Batteryshop&lt;/i&gt;™ software by Cadex has &#10; been developed for the purpose of simplifying battery maintenance. &#10; When installed in a PC, the operator simply selects the desired &#10; battery from the database of over 2000&amp;nbsp;battery listings. &#10; With the Cadex&lt;i&gt; 7000 Series&lt;/i&gt; connected to the PC, the &#10; analyzer programs itself to the correct parameters with the &#10; click of the mouse. The user only needs to insert the battery &#10; into the appropriate battery adapter and everything else is &#10; done automatically.&lt;/p&gt; &lt;p&gt;Some batteries, such as those manufactured by &#10; Motorola, are equipped with bar code labels. If bar coded, &#10; the user can simply scan the bar code label and insert the &#10; battery into the analyzer. Here is how it works: &lt;/p&gt; &lt;p&gt;The scanned battery model number is matched with &#10; the battery listing in the database. Cadex &lt;i&gt;Batteryshop™&lt;/i&gt; &#10; then assigns the appropriate battery configuration code (C-code) &#10; to the battery and downloads it to the Cadex &lt;i&gt;7000 Series&lt;/i&gt;. &#10; The analyzer is now programmed to the correct parameters, &#10; ready to service the battery.&lt;/p&gt; &lt;p&gt;Not all battery packs come with bar code identification. &#10; If not available, a label printer connected to the PC can &#10; generate the missing bar code. These labels can be attached &#10; to a separate sheet on the service counter. The bar code labels &#10; may also be placed next to an illustration of the battery. &#10; The clerk simply refers to the correct battery and scans the &#10; bar code label associated with the battery. The system is &#10; now set to service the battery.&lt;/p&gt; &lt;p&gt;In the near future it will be possible to view &#10; the picture of the battery on the PC monitor. Clicking the &#10; mouse on the image will reveal all model numbers associated &#10; with this battery. A click on the correct model will program &#10; the analyzer.&lt;/p&gt; &lt;p&gt;When training global staff, simplification and &#10; automation make common sense. With tools now available that &#10; do the thinking, employees no longer need to be battery experts. &#10; Similar to a checkout clerk in a supermarket who, in the pre-computer &#10; days, required full product knowledge can now rely on the &#10; embedded bar code information. The price of all items purchased &#10; is flashed on the screen and an up-to-the-second inventory &#10; status is available. Such simplifications are also possible &#10; in servicing commercial batteries.&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>15. Caring for Your Batteries from Birth to Retirement 6</title><link>https://technick.net/guides/electronics/bpw/c15_06/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c15_06/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c15_05"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c15_07"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;15.5 The Quick Fix&lt;/h4&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;Checking a battery and assessing its status within &#10; a few minutes is one thing — finding a solution and actually &#10; fixing the problem is another. Increasingly, customers and &#10; dealers alike are seeking an alternative solution to replacing &#10; the batteries under warranty. They want a quick&amp;nbsp;fix.&lt;/p&gt; &lt;p&gt;Fully automated test procedures are being developed &#10; which check the battery and apply a quick-prime program to &#10; wake up a sleeping battery. The program will last from a few &#10; minutes for an easy wake-up call, to an&amp;nbsp;hour or longer &#10; for the deep-sleepers.&lt;/p&gt; &lt;p&gt;Batteries with minor deficiencies will be serviced &#10; while the customer enjoys a cup of coffee or browses through &#10; the store. If the battery has an electrical short or does &#10; not accept a charge, the likelihood of revitalizing the battery &#10; is slim. This pack is eliminated within seconds to clear the &#10; test equipment for other batteries. If a pack requires extensive &#10; priming, which will take a few&amp;nbsp;hours to complete, the &#10; customer is asked to come back later.&lt;/p&gt; &lt;p&gt;&lt;img src="https://technick.net/img/guide_bpw2/c15_05.gif" width="234" height="102" vspace="19" hspace="19" align="right" border="0" alt="" /&gt;Some &#10; battery analyzers indicate the estimated service time after &#10; the battery has passed through the early assessment stages. &#10; The customer can decide to wait, buy a spare battery, or come &#10; back for the repaired battery the next&amp;nbsp;day.&lt;/p&gt; &lt;p&gt;A complete battery cycle offers the best service. &#10; Such a service makes optimal use of the restorative abilities &#10; of a battery analyzer. A full cycle may take five to eight&amp;nbsp;hours &#10; and can be applied overnight. Multi-bay analyzers that service &#10; several batteries at the same time increase the throughput. &#10; Such analyzers operate 24&amp;nbsp;hours without user intervention.&lt;/p&gt; &lt;p&gt;A customer may not have time to wait for the &#10; outcome of a battery test. The prospect of having to buy a &#10; new battery is even less appealing. In such a case, a class &#10; B or replacement battery may be the answer. This pack can &#10; be drawn from a pool of refurbished batteries, which the store &#10; has built up from previous returns. This could become a lucrative &#10; side business as customers begin to realize the cost saving &#10; potential, especially if the battery is accompanied by a performance &#10; report.&lt;/p&gt; &lt;p&gt;Some battery analyzers offer ultra-fast charge &#10; functions. The maximum permissible charge current that can &#10; be applied to a battery is dictated by the battery’s ability &#10; to absorb charge. A fit battery, or one that has a partial &#10; charge, would charge to the 70&amp;nbsp;percent level in 30&amp;nbsp;minutes &#10; or less. A 70&amp;nbsp;percent charge level is often sufficient &#10; to complete a performance test or quick-fill the battery for &#10; a hurried customer. The topping charge from there to full &#10; charge is what demands the long charge&amp;nbsp;time.&lt;/p&gt; &lt;p&gt;Some late model battery analyzers also offer &#10; a quick priming program that services a battery in a little &#10; more than an&amp;nbsp;hour. This program applies an ultra-fast &#10; charge and ultra-fast discharge to check the integrity of &#10; the battery. By virtue of cycling, some priming and conditioning &#10; activities occur.&lt;/p&gt; &lt;p&gt;Customers demand a quick turnaround when a mobile &#10; phone fails. Manufacturers and service providers realize that &#10; better methods are needed to handle customer returns. The &#10; expensive and wasteful battery exchange policies practiced &#10; today may no longer be acceptable in the future. Fierce competition &#10; and tight product margins are part of the reason. Returned &#10; batteries account for a considerable after-sale burden. With &#10; modern technology, these costs can be reduced while improving &#10; customer service and enhancing satisfaction.&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>15. Caring for Your Batteries from Birth to Retirement 7</title><link>https://technick.net/guides/electronics/bpw/c15_07/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c15_07/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c15_06"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c15_08"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;15.6 Battery Warranty&lt;/h4&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;Some manufacturers of industrial batteries provide &#10; warranties of up to 18&amp;nbsp;months. A free exchange is offered &#10; if the battery fails to meet 80&amp;nbsp;percent of the rated &#10; capacity throughout the warranty period. (I hasten to mention &#10; that these warranty policies apply to markets other than mobile &#10; phones.)&lt;/p&gt; &lt;p&gt;But what happens if such a battery is returned &#10; for warranty? Will the dealer replace the pack without hesitation? &#10; Rarely.&lt;/p&gt; &lt;p&gt;With lack of battery standards, manufacturers &#10; are free to challenge warranty claims, even if a genuine problem &#10; exists. Many batteries reveal only the chemistry and voltage &#10; on the label and do not make reference to the milliampere-hour &#10; rating (mAh). How does the user know what capacity rating &#10; to use when testing the battery? What performance standards &#10; can be applied? &lt;/p&gt; &lt;p&gt;On battery packs that show the mAh rating, some &#10; battery manufacturers may have used the peak capacity rating. &#10; This is done for promotional reasons to make their packs look &#10; better than the competitor’s. Peak capacity is based on a &#10; lower discharge rate because a battery produces higher readings &#10; if discharged slowly. For warranty purposes, a discharge of &#10; 1C should be&amp;nbsp;used.&lt;/p&gt; &lt;p&gt;Regulatory authorities stress the importance &#10; of marking all batteries with the average capacity rating. &#10; Portable batteries with a capacity of up to about 2A should &#10; be rated at a 1C discharge. Batteries above that capacity &#10; may be rated at 0.5C. No true standard exists in term of capacity &#10; rating.&lt;/p&gt; &lt;p&gt;With the increased popularity of battery analyzers, &#10; battery manufacturers and dealers are urged to follow industry-accepted &#10; standards regarding battery ratings. In an attempt to lower &#10; warranty claims, some battery manufacturers have moderated &#10; the published ratings of some batteries to be more consistent &#10; with reality.&lt;/p&gt; &lt;p&gt;Manufacturers are concerned about the high cost &#10; of providing free replacement batteries and disposing of returned &#10; units. If a battery analyzer is used, failures due to fading &#10; capacity can mostly be corrected. Warranty claims are exercised &#10; only on those packs that develop a genuine failure. If fewer &#10; batteries returned, the vendor can offer better pricing.&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>15. Caring for Your Batteries from Birth to Retirement 8</title><link>https://technick.net/guides/electronics/bpw/c15_08/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c15_08/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c15_07"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c16_01"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;15.7 Battery Recycling&lt;/h4&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;Even though the emphasis in battery research &#10; has shifted away from NiCd to newer technologies, the NiCd &#10; battery continues to be one of the most used rechargeable &#10; batteries. Over 75&amp;nbsp;million NiCd batteries were sold in &#10; the US during the year 2000. Market reports indicate that &#10; the demand of NiCd batteries is expected to rise six&amp;nbsp;percent &#10; per year until 2003. The demand for other chemistries, such &#10; as the NiMH and Li-ion family, is rising at a more rapid &#10; pace. Where will the mountains of batteries go when spent? &#10; The answer is recycling.&lt;/p&gt;</description></item><item><title>15. Specific Norms</title><link>https://technick.net/guides/theory/edft/015/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/edft/015/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/filters/"&gt;Introduction to Digital Filters with Audio Applications&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, Copyright &amp;#169; &lt;i&gt;2017-11-26&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/edft/014"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/000"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/022"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/016"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;Specific Norms&lt;/h3&gt;&lt;p&gt;The &lt;i&gt;&lt;img width="27" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img323.gif" alt="$Lp$" /&gt; &lt;a href="http://mathworld.wolfram.com/topics/Norms.html" target="_blank"&gt;norms&lt;/a&gt;&lt;/i&gt;&lt;a name="2506"&gt;&lt;/a&gt; are defined on the space &lt;img width="27" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img323.gif" alt="$Lp$" /&gt; by&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\left\|\,F\,\right\|_p \isdef \left( \frac{1}{ 2\pi} \int_{-\pi}^\pi \left|F(e^{j\omega})\right|^p {d\omega\over 2\pi}&#10;&#9;&#9; \right)^{1/p}, \quad p\geq 1&#10;&#9;.&#10;\end{displaymath}&#10; --&gt;&lt;a name="eq:lpnorm"&gt;&lt;/a&gt;&lt;a name="eq:lpnorm"&gt;&lt;/a&gt;&lt;img width="393" height="65" border="0" src="https://technick.net/img/guide_edft/guide_edft_img331.gif" alt="\" egin="" isplaymath="" eft\vert="" ight\vert="" p="" sdef="" eft="" rac="" i="" t\vert="" p="" omega\over="" i="" ight="" p="" uad="" eq="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;</description></item><item><title>16. About this document</title><link>https://technick.net/guides/theory/dar/016/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dar/016/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/resample/"&gt;The Digital Audio Resampling Home Page&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, Copyright &amp;#169; &lt;i&gt;2016-05-17&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dar/015"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dar/000"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;About this document&lt;/h3&gt;&lt;p&gt;This document is a new HTML formatted version published by permission of:&lt;br /&gt;&lt;br /&gt;&lt;a href="https://ccrma.stanford.edu/~jos//resample/" target="_blank"&gt;&lt;b&gt;The Digital Audio Resampling Home Page&lt;/b&gt;&lt;/a&gt; by &lt;a href="https://ccrma.stanford.edu/~jos//" target="_blank"&gt;Julius O. Smith III&lt;/a&gt;, Last updated January 17, 2000.&lt;br /&gt; Julius O. Smith III, Ph.D. Dissertation, Center for Computer Research in Music and Acoustics (CCRMA), Department&#10;of Electrical Engineering, &lt;a href="http://www.stanford.edu/" target="_blank"&gt;Stanford University&lt;/a&gt;, June 1983...&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Copyright &amp;copy; &lt;i&gt;2000-09-19&lt;/i&gt; by &lt;a href="https://ccrma.stanford.edu/~jos//" target="_blank"&gt; Julius O. Smith III&lt;/a&gt;&lt;/b&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;h4&gt;This document is also available in other formats:&lt;/h4&gt;Download &lt;a href="https://ccrma.stanford.edu/~jos//resample/resample.pdf"&gt; PDF version (resample.pdf)&lt;/a&gt;&lt;br /&gt;Download compressed PostScript version (resample.ps.gz)&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;h4&gt;Notes from original HTML document (&lt;a href="https://ccrma.stanford.edu/~jos//resample" target="_blank"&gt;https://ccrma.stanford.edu/~jos//resample&lt;/a&gt;):&lt;/h4&gt;&lt;font size="-1"&gt;This document was generated using the&lt;font color="blue"&gt;&lt;strong&gt;LaTeX&lt;/strong&gt;2&lt;tt&gt;HTML&lt;/tt&gt;&lt;/font&gt; translator Version 99.2beta6 (1.42)(patched)&lt;p&gt;Copyright &amp;copy; 1993, 1994, 1995, 1996,&lt;font color="blue"&gt;Nikos Drakos&lt;/font&gt;, &#10;Computer Based Learning Unit, University of Leeds.&lt;br /&gt;Copyright &amp;copy; 1997, 1998, 1999, 2000&lt;font color="blue"&gt;Ross Moore&lt;/font&gt;, &#10;Mathematics Department, Macquarie University, Sydney.&lt;ul&gt;&lt;li&gt;The &lt;strong&gt;Makefiles&lt;/strong&gt; and &lt;strong&gt;.latex2html-init&lt;/strong&gt; file used to generate this website are available at&lt;a href="https://ccrma.stanford.edu/~jos//webpub/" target="_blank"&gt;&lt;font color="blue"&gt;&lt;b&gt;https://ccrma.stanford.edu/~jos//webpub/&lt;/b&gt;&lt;/font&gt;&lt;/a&gt;.&lt;/li&gt;&lt;li&gt;Hypertext links installed from a&#10;&#9; &lt;font color="blue"&gt;master glossary&lt;/font&gt; prepared using the &lt;a href="http://www.opendictionary.org" target="_blank"&gt;&lt;i&gt;&lt;font color="blue"&gt;&lt;b&gt;Open Dictionary&lt;/b&gt;&lt;/font&gt;&lt;/i&gt;&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/p&gt;&lt;/font&gt;.&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>16. Concavity (Convexity)</title><link>https://technick.net/guides/theory/edft/016/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/edft/016/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/filters/"&gt;Introduction to Digital Filters with Audio Applications&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, Copyright &amp;#169; &lt;i&gt;2017-11-26&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/edft/015"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/000"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/022"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/017"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;Concavity (Convexity)&lt;/h3&gt;&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;A set &lt;img width="17" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img378.gif" alt="$S$" /&gt; is said to be &lt;i&gt;&lt;a href="http://mathworld.wolfram.com/Convex.html" target="_blank"&gt;concave&lt;/a&gt;&lt;/i&gt;&lt;a name="2579"&gt;&lt;/a&gt; if for every&#10;vector &lt;img width="15" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img224.gif" alt="$x$" /&gt; and &lt;img width="15" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img225.gif" alt="$y$" /&gt; in &lt;img width="17" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img378.gif" alt="$S$" /&gt;, &lt;!-- MATH&#10; $\lambda x + (1-\lambda) y$&#10; --&gt;&lt;img width="117" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img379.gif" alt="$\" ambda="" ambda="" /&gt; is in &lt;img width="17" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img378.gif" alt="$S$" /&gt; for&#10;all &lt;!-- MATH&#10; $0\leq&#10;\lambda \leq 1$&#10; --&gt;&lt;img width="85" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img380.gif" alt="$0\" eq="" ambda="" eq="" /&gt;. In other words, all points on the line between two points&#10;of &lt;img width="17" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img378.gif" alt="$S$" /&gt; lie in &lt;img width="17" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img378.gif" alt="$S$" /&gt;.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;A &lt;i&gt;&lt;a href="http://mathworld.wolfram.com/Functional.html" target="_blank"&gt;functional&lt;/a&gt;&lt;/i&gt;&lt;a name="2582"&gt;&lt;/a&gt; is a mapping from a &lt;a href="http://mathworld.wolfram.com/VectorSpace.html" target="_blank"&gt;vector space&lt;/a&gt; to the&#10;real numbers &lt;img width="19" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img381.gif" alt="$\" e="" /&gt;.&lt;/p&gt;&lt;p&gt;Thus, for example, every &lt;i&gt;&lt;a href="http://mathworld.wolfram.com/topics/Norms.html" target="_blank"&gt;norm&lt;/a&gt;&lt;/i&gt; is a functional. &lt;/p&gt;&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;A &lt;i&gt;linear functional&lt;/i&gt;&lt;a name="2585"&gt;&lt;/a&gt; is a functional &lt;img width="16" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img262.gif" alt="$f$" /&gt; such that&#10;for each &lt;img width="15" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img224.gif" alt="$x$" /&gt; and &lt;img width="15" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img225.gif" alt="$y$" /&gt; in the linear space &lt;img width="22" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img289.gif" alt="$X$" /&gt;, and for all scalars&lt;img width="17" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img158.gif" alt="$\" lpha="" /&gt; and &lt;img width="16" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img382.gif" alt="$\" eta="" /&gt;, we have &lt;!-- MATH&#10; $f(\alpha x + \beta y) = \alpha f(x) + &#10;\beta f(y)$&#10; --&gt;&lt;img width="242" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img383.gif" alt="$f(\" lpha="" eta="" lpha="" beta="" /&gt;.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;The &lt;i&gt;norm of a linear functional&lt;/i&gt; &lt;img width="16" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img262.gif" alt="$f$" /&gt; is defined on&#10;the normed linear space &lt;img width="22" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img289.gif" alt="$X$" /&gt; by&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\left\|\,f\,\right\| \isdef \sup_{x\in X} \frac{\left|f(x)\right|}{ \left\|\,x\,\right\|}.&#10;\end{displaymath}&#10; --&gt;&lt;img width="162" height="57" border="0" src="https://technick.net/img/guide_edft/guide_edft_img384.gif" alt="\" egin="" isplaymath="" eft\vert="" ight\vert="" sdef="" up="sup" x\in="" rac="" eft\vert="" right\vert="" eft\vert="" ight\vert="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;A functional &lt;img width="16" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img262.gif" alt="$f$" /&gt; defined on a concave subset &lt;img width="17" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img378.gif" alt="$S$" /&gt; of a vector space&lt;img width="22" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img289.gif" alt="$X$" /&gt; is said to be &lt;i&gt;concave&lt;/i&gt;&lt;a name="2589"&gt;&lt;/a&gt; on &lt;img width="17" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img378.gif" alt="$S$" /&gt; if for&#10;every vector &lt;img width="15" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img224.gif" alt="$x$" /&gt; and &lt;img width="15" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img225.gif" alt="$y$" /&gt; in &lt;img width="17" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img378.gif" alt="$S$" /&gt;,&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\lambda f(x) + (1-\lambda) f(y) \geq f\left(\lambda x + (1-\lambda) y\right)&#10;&#9;,\qquad 0\leq \lambda \leq 1.&#10;\end{displaymath}&#10; --&gt;&lt;img width="511" height="36" border="0" src="https://technick.net/img/guide_edft/guide_edft_img385.gif" alt="\" egin="" isplaymath="" ambda="" lambda="" y="" eq="" eft="" ambda="" ambda="" right="" quad="" eq="" ambda="" eq="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;A concave functional has the property that its values along a line&#10;segment lie below or on the line between its values at the end points.&#10;The functional is &lt;i&gt;strictly concave&lt;/i&gt;&lt;a name="2591"&gt;&lt;/a&gt; on &lt;img width="17" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img378.gif" alt="$S$" /&gt; if&#10;strict inequality holds above for &lt;!-- MATH&#10; $\lambda\in(0,1)$&#10; --&gt;&lt;img width="81" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img386.gif" alt="$\" ambda\in="" /&gt;. Finally, &lt;img width="16" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img262.gif" alt="$f$" /&gt; is&lt;i&gt;uniformly concave&lt;/i&gt;&lt;a name="2593"&gt;&lt;/a&gt; on &lt;img width="17" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img378.gif" alt="$S$" /&gt; if there exists &lt;img width="47" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img387.gif" alt="$c&amp;gt;0$" /&gt; such that for&#10;all &lt;img width="69" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img388.gif" alt="$x,y\" n="" /&gt;,&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\lambda f(x) + (1-\lambda) f(y) - f\left(\lambda x + (1-\lambda) y\right)&#10;&#9;\geq c \lambda(1-\lambda)\left\|\,x-y\,\right\|^2&#10;&#9;,\qquad 0\leq \lambda \leq 1.&#10;\end{displaymath}&#10; --&gt;&lt;img width="711" height="36" border="0" src="https://technick.net/img/guide_edft/guide_edft_img389.gif" alt="\" egin="" isplaymath="" ambda="" lambda="" y="" left="" ambda="" am="" eft\vert="" right\vert="" quad="" eq="" ambda="" eq="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;We have&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\hbox{Uniformly}\;\; \hbox{Concave}\quad\Rightarrow \quad &#10;\hbox{Strictly}\;\; \hbox{Concave}\quad\Rightarrow \quad \hbox{Concave}&#10;\end{displaymath}&#10; --&gt;&lt;img width="531" height="35" border="0" src="https://technick.net/img/guide_edft/guide_edft_img390.gif" alt="\" egin="" isplaymath="" box="" niformly="" box="" oncave="" uad\rightarrow="" uad="" ctly="" box="" oncave="" uad\rightarrow="" uad="" box="" oncave="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;A &lt;i&gt;local minimizer&lt;/i&gt;&lt;a name="2596"&gt;&lt;/a&gt; of a real-valued function &lt;img width="41" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img391.gif" alt="$f(x)$" /&gt; is&#10;any &lt;img width="23" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img392.gif" alt="$x^\" st="" /&gt; such that &lt;!-- MATH&#10; $f(x^\ast)&lt;f(x)$&#10; --&gt;&lt;img width="110" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img393.gif" alt="$f(x^\" st="" t="" x="" /&gt; in some neighborhood of &lt;img width="15" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img224.gif" alt="$x$" /&gt;.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;A &lt;i&gt;global minimizer&lt;/i&gt;&lt;a name="2599"&gt;&lt;/a&gt; of a real-valued function &lt;img width="41" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img391.gif" alt="$f(x)$" /&gt; &#10;on a set &lt;img width="17" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img378.gif" alt="$S$" /&gt;is&#10;any &lt;img width="59" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img394.gif" alt="$x^\" st\in="" /&gt; such that &lt;!-- MATH&#10; $f(x^\ast)&lt;f(x)$&#10; --&gt;&lt;img width="110" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img393.gif" alt="$f(x^\" st="" t="" x="" /&gt; for all &lt;img width="51" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img395.gif" alt="$x\" n="" /&gt;.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;A &lt;i&gt;cluster point&lt;/i&gt;&lt;a name="2602"&gt;&lt;/a&gt; &lt;img width="15" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img224.gif" alt="$x$" /&gt; of a sequence &lt;img width="24" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img396.gif" alt="$x_n$" /&gt; is any point&#10;such that every neighborhood of &lt;img width="15" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img224.gif" alt="$x$" /&gt; contains at least one &lt;img width="24" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img396.gif" alt="$x_n$" /&gt;.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;The &lt;i&gt;concave hull&lt;/i&gt;&lt;a name="2605"&gt;&lt;/a&gt; of a set &lt;img width="17" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img378.gif" alt="$S$" /&gt; in a metric space is the&#10;smallest concave set containing &lt;img width="17" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img378.gif" alt="$S$" /&gt;.&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>16. Practical Battery Tips</title><link>https://technick.net/guides/electronics/bpw/c16_01/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c16_01/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c15_08"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c16_02"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;16. Practical Battery Tips&lt;/h3&gt;&lt;p&gt; Batteries seem to have a mind of their own. Their stubborn and &#10; unpredictable behavior has left many battery users in awkward &#10; situations. In fact, the British Army could have lost the Falkland &#10; War in 1982 because of uncooperative batteries. The army assumed &#10; that a battery would always follow rigid military specifications. &#10; Not so. When the order was given to launch the portable missiles, &#10; nothing happened and the missiles did not fly that day. Such &#10; battery-induced letdowns happen on a daily basis. Some are simply &#10; a nuisance, others have serious consequences. &#10; &lt;/p&gt;&lt;p&gt;In this section we examine what the user can &#10; reasonably expect from a battery. We learn how to cope with &#10; the many moods of a battery and how to come to terms with &#10; its limitations.&lt;/p&gt;&lt;h4&gt;16.1 Personal Field Observations&lt;/h4&gt; &lt;p&gt;While working with General Electric, I had the &#10; opportunity to examine the behavior of many NiCd batteries &#10; for two-way radios. I noticed a trend with these batteries &#10; that was unique to NiCd. These particularities repeated themselves &#10; in various other applications.&lt;/p&gt; &lt;p&gt;A certain organization continually experienced &#10; NiCd battery failure after a relatively short service time. &#10; Although the batteries performed at 100&amp;nbsp;percent when &#10; new, their capacity dropped to 20&amp;nbsp;percent and below within &#10; one year. We discovered that their two-way radios were under-utilized; &#10; yet the batteries received a full recharge after each short &#10; field&amp;nbsp;use.&lt;/p&gt; &lt;p&gt;After replacing the batteries, we advised the &#10; organization to exercise the new batteries once per month &#10; by discharging them to one-volt-per cell with a subsequent &#10; recharge. The first exercise took place after the batteries &#10; had been in service for four months. At that stage, we were &#10; anxious to find out how much the batteries had deteriorated. &#10; Here is what we found:&lt;/p&gt; &lt;p&gt;On half of the batteries tested, the capacity &#10; loss was between 25 to 30&amp;nbsp;percent; on the other half, &#10; the losses were around 10 to 20&amp;nbsp;percent. With exercise &#10; — and some needed recondition cycles — all batteries were &#10; fully restored. Had maintenance been omitted for much longer, &#10; the probability of a full recovery would have been jeopardized.&lt;/p&gt; &lt;p&gt;On another occasion, I noticed that two-way radios &#10; used by construction workers experienced fewer NiCd battery &#10; problems than those used by security guards. The construction &#10; workers often did not turn off the radios when they put down &#10; their hammers. As a result, the batteries got their exercise &#10; and kept performing well until they fell apart from old age. &#10; In many cases the batteries were held together with electrician’s&amp;nbsp;tape.&lt;/p&gt; &lt;p&gt;In comparison, the security guards pampered their &#10; batteries to death by giving them light duty and plenty of &#10; recharge. These batteries still looked new when they had to &#10; be discarded after only 12&amp;nbsp;months of service. Because &#10; of the advanced state of memory, recondition was no longer &#10; effective to restore these batteries.&lt;/p&gt; &lt;p&gt;On a further application, I studied the performance &#10; of a two-way radio that was available with batteries of different &#10; capacities. It soon was apparent that the smaller battery &#10; lasted much longer, whereas the larger packs needed replacing &#10; more often. The small battery had to work harder and received &#10; more exercise during a daily routine.&lt;/p&gt; &lt;p&gt;Equipment manufacturers are aware of the weak &#10; link — the battery. For a more reliable energy source, higher &#10; capacity batteries are recommended. Not only are oversized &#10; batteries bulky, heavy and expensive, they hold more residual &#10; charge prior to recharge than smaller units. If the residual &#10; energy is never fully consumed before a recharge, and no exercise &#10; is applied, the nickel-based battery will eventually lose &#10; its ability to hold charge due to memory.&lt;/p&gt; &lt;p&gt;On the lithium and lead-base systems, a slightly &#10; oversized battery offers an advantage because the pack is &#10; less stressed on deep discharges. The battery does not need &#10; to be discharged as low for the given application. A high &#10; residual charge before recharge is a benefit rather than a &#10; disadvantage for these chemistries.&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>16. Practical Battery Tips 2</title><link>https://technick.net/guides/electronics/bpw/c16_02/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c16_02/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c16_01"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c16_03"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;16.2 The Correct Battery for the Job&lt;/h4&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;What is the best battery choice? The requirements &#10; differ between personal users and fleet operators. The personal &#10; user can choose batteries in various sizes and chemistries. &#10; Cost is a factor for many. If a smaller and less energy-dense &#10; battery is chosen, a spare battery may be carried to assure &#10; continued service.&lt;/p&gt; &lt;p&gt;&lt;img src="https://technick.net/img/guide_bpw2/c16_01.gif" width="262" height="98" vspace="19" hspace="19" align="right" border="0" alt="" /&gt;The &#10; energy requirements are quite different with fleet operators. &#10; The equipment is matched with a battery designed to run for &#10; a specified number of&amp;nbsp;hours per shift. A degradation &#10; factor&amp;nbsp;to compensate for battery aging is taken into account. &#10; A reserve capacity is added to allow for unforeseen activities. &#10; Allowing an aging degradation factor of 20&amp;nbsp;percent and &#10; providing a reserve capacity of 20&amp;nbsp;percent will reduce &#10; the usable battery capacity from 100&amp;nbsp;percent to 60&amp;nbsp;percent &#10; in a worst-case scenario. Such a large&amp;nbsp;percentage of &#10; reserve capacity may not always be practical but the equipment &#10; manufacturers should consider these safety factors when fitting &#10; the portable devices with a battery.&lt;/p&gt; &lt;p&gt;The best choice is not necessarily an oversized &#10; battery, but one that has sufficient safety margin and is &#10; well maintained. This is especially true of NiCd batteries. &#10; When adding large safety margins, the reserve capacity should &#10; be depleted once per month, if this is not done already through &#10; normal&amp;nbsp;use.&lt;/p&gt; &lt;p&gt;The NiMH also needs exercising but less often. &#10; Cycling lithium-based batteries is only recommended for the &#10; purpose of measuring the performance.&lt;/p&gt; &lt;p&gt;Many battery users have a choice of switching &#10; from NiCd to NiMH to obtain longer runtimes and/or reduce &#10; weight. Regulatory bodies advise using less toxic alternatives &#10; because of the environment. But will the NiMH battery perform &#10; as well as the NiCd in industries that require repetitive &#10; deep discharges? &lt;/p&gt; &lt;p&gt;The NiMH will not match the cycle count of the &#10; NiCd chemistry. This lower life expectancy has serious consequences &#10; on applications that need one or several recharges per day. &#10; However, in a recent study on battery choice for heart defibrillators &#10; for emergency applications, it was observed that a battery &#10; may cycle far less than anticipated. Instead of the expected &#10; 200-cycle count after two years of use, less than 60&amp;nbsp;cycles &#10; had been delivered. Such service information is now available &#10; with the use of ‘smart’ batteries. With fewer cycles needed, &#10; the switch to lighter and higher energy-dense batteries becomes &#10; practical for these applications.&lt;/p&gt; &lt;p&gt;In most cases, NiMH can be used as a direct replacement &#10; for NiCd. When doing so, the charger must be checked. A NiMH &#10; charger can charge NiCd batteries, but a charger designed &#10; only for the NiCd battery should not be used to charge NiMH. &#10; Battery damage may result due to inaccurate full-charge detection &#10; and excessive trickle charge while in ready mode. If no alternative &#10; exists, the battery should be removed as soon as the green &#10; ready light appears. Battery temperature during charge should &#10; also be observed.&lt;/p&gt; &lt;p&gt;Remote control racecar enthusiasts rely heavily &#10; on high current capabilities and quick charging. NiMH batteries &#10; are now available that can handle very high discharge currents. &#10; This makes the battery ideally suited for competitions, because &#10; the weight and size of the battery can be reduced.&lt;/p&gt; &lt;p&gt;For most hobbyists, the NiCd remains the preferred &#10; choice. The reasons are: more consistent performance, longer &#10; cycle life and lower cost. NiCd needs replacement less often &#10; than NiMH. RC racing experts claim that NiMH is fragile, temperamental, &#10; and can be hurt easily. The storage of the NiMH battery is &#10; also erratic. Some cells are flat after a few weeks of storage; &#10; others still retain a charge.&lt;/p&gt; &lt;p&gt;High load currents have been problematic for &#10; NiMH. Discharge currents of 0.5C and higher rob the battery &#10; of cycle life. In comparison, NiCd delivers repetitive high &#10; load currents with minimal side effects.&lt;/p&gt; &lt;p&gt;The ultra-high capacity NiCd does not perform &#10; as well compared to the standard version in terms of load &#10; characteristics and endurance. Packing more active material &#10; makes the NiCd behave more like a NiMH battery.&lt;/p&gt; &lt;p&gt;The Li-ion battery has limited current &#10; handling capabilities. In many cases, it cannot be used as &#10; a replacement for such applications as defibrillators and &#10; power tools, not to mention RC racing. In addition, Li-ion &#10; requires a different charging system than the nickel-based &#10; battery chemistries.&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>16. Practical Battery Tips 3</title><link>https://technick.net/guides/electronics/bpw/c16_03/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c16_03/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c16_02"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c17_01"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;16.3 Battery Analyzers for Critical Missions&lt;/h4&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;Occasionally, a customer will call Cadex because &#10; their battery analyzer appears faulty. The complaint: the &#10; battery no longer indicates correct capacity readings. In &#10; most cases, the customer has just purchased new batteries. &#10; When testing these new packs, the capacities read 50 to 70&amp;nbsp;percent. &#10; The customer assumes that, “Naturally, if two or more of these &#10; brand new batteries show low readings, it can only be the &#10; analyzer’s fault.” &lt;/p&gt; &lt;p&gt;Battery analyzers play a critical role in identifying &#10; non-performing batteries, new or old. Conventional wisdom &#10; says that a new battery always performs flawlessly. Yet many &#10; users realize that a fresh battery may not always meet the &#10; manufacturer's specifications. Weak batteries can be identified &#10; and primed. If the capacity does not improve, the packs can &#10; often be returned to the vendor for warranty replacement. &#10; Whole batches of new batteries have been sent back because &#10; of unacceptable performance. Had these batteries been released &#10; without prior inspection, the whole system would have been &#10; jeopardized, resulting in unpredictable performance and frequent &#10; down&amp;nbsp;time.&lt;/p&gt; &lt;p&gt;In addition to getting new batteries field-ready, &#10; battery analyzers perform the important function of weeding &#10; out the deadwood in a battery fleet. Weak batteries can often &#10; hide among their peers. However, when the system is put to &#10; the test in an emergency, these non-performers become a real &#10; nuisance.&lt;/p&gt; &lt;p&gt;Organizations tend to postpone battery maintenance &#10; until a crisis situation develops. One fire brigade using &#10; two-way radios experienced chronic communication problems, &#10; especially during emergency calls which lasted longer than &#10; two hours. Although their radios functioned in the receive &#10; mode, they were not able to transmit and firefighters were &#10; left unaware that their calls did not get through.&lt;/p&gt; &lt;p&gt;The fire brigade acquired a Cadex battery analyzer &#10; and all batteries were serviced through exercise and recondition &#10; methods. Those batteries that did not recover to a preset &#10; target capacity were replaced.&lt;/p&gt; &lt;p&gt;Shortly thereafter, the firefighters were summoned &#10; to a ten-hour call that demanded heavy radio traffic. To their &#10; astonishment, none of the two-way radios failed. The success &#10; of this flawless operation was credited to the excellent performance &#10; of their batteries. The following day, the Captain of the &#10; fire brigade personally contacted the manufacturer of the &#10; battery analyzer and enthusiastically endorsed the use of &#10; the device.&lt;/p&gt; &lt;p&gt;Batteries placed on prolonged standby commonly &#10; fail. Such was the case when a Cadex representative was allowed &#10; to view the State Emergency Management Facility of a large &#10; US city. In the fortified underground bunker, over one thousand &#10; batteries were kept in chargers. The green lights glowed, &#10; indicating that the batteries where ready at a moment’s notice. &#10; The officer in charge stood tall and confidently said, “We &#10; are prepared for any emergency”.&lt;/p&gt; &lt;p&gt;The representative then asked the officer to &#10; hand over a battery from the charger to check the state-of-health &#10; (SoH). Within seconds, the battery analyzer detected a fail &#10; condition. In an effort to make good, the officer grabbed &#10; another battery from the charger bank but, it failed too. &#10; Subsequent batteries tested also failed.&lt;/p&gt; &lt;p&gt;Scenarios such as these are common but such flaws &#10; do not get rectified quickly. Political hurdles and lack of &#10; funding are often to blame. In the meantime, all the officer &#10; can do is pray that no emergency occurs.&lt;/p&gt; &lt;p&gt;Eventually, a new set of batteries is installed &#10; and the system returns to full operational readiness. However, &#10; the same scenario will reoccur, unless a program is implemented &#10; to exercise the batteries on a regular basis. Advanced battery &#10; analyzers, such as the Cadex &lt;i&gt;7000 Series&lt;/i&gt;, apply a conditioning &#10; discharge every 30&amp;nbsp;days to prevent the memory phenomenon &#10; on nickel-based batteries.&lt;/p&gt; &lt;p&gt;&lt;img width="315" height="390" src="https://technick.net/img/guide_bpw2/c16_02.gif" v:shapes="_x0000_i1025" border="0" alt="" /&gt;&lt;/p&gt; &lt;p class="caption"&gt;Figure&amp;nbsp;16-1:&amp;nbsp; Results of neglecting your &#10; battery’s state-of-health.&lt;br /&gt; &lt;span class="caption-sub"&gt;Maintenance helps keep deadwood &#10; out of your arsenal.&lt;/span&gt;&lt;/p&gt; &lt;p&gt;The military also relies heavily on batteries. &#10; Defense organizations take great pride in employing the highest &#10; quality and best performing equipment. When it comes to rechargeable &#10; batteries, however, there are exceptions. The battery often &#10; escapes the scrutiny of a full military inspection and only &#10; its visual appearance is checked. Maintenance requirements &#10; are frequently ignored. Little effort is made in keeping track &#10; of the battery’s state of health, cycle count and age. Eventually, &#10; weak batteries get mixed with new ones and the system becomes &#10; unreliable. This results in soldiers carrying rocks instead &#10; of batteries. A battery analyzer, when used correctly, keeps &#10; deadwood out of the arsenal.&lt;/p&gt; &lt;p&gt;The task of keeping a battery fleet at an acceptable &#10; capacity level has been simplified with battery analyzers &#10; that offer target capacity selection. This novel feature works &#10; on the basis that all batteries must pass a user-defined performance &#10; test. Batteries that fall short are restored with the recondition &#10; cycle. If they fail to recover, the packs are replaced.&lt;/p&gt; &lt;p&gt;The target capacity setting of a battery analyzer &#10; can be compared to a student entry-exam for college. Assuming &#10; that the passing mark is 80&amp;nbsp;percent, the students who &#10; do not obtain that level are given the opportunity to take &#10; a refresher course and are thereafter permitted to rewrite &#10; the exam. In our analogy, the refresher course is the recondition &#10; cycle that is applied to nickel-based batteries. If the passing &#10; mark is set to 90&amp;nbsp;percent, for example, fewer but higher &#10; qualified students are admitted.&lt;/p&gt; &lt;p&gt;A practical target capacity setting for batteries &#10; in public safety is 80&amp;nbsp;percent. Increasing the capacity &#10; requirement to 90&amp;nbsp;percent will provide an extra 10&amp;nbsp;percentage &#10; points of available energy. However, higher settings will &#10; yield fewer batteries since more packs will fail as they&amp;nbsp;age.&lt;/p&gt; &lt;p&gt;Many organizations allocate the top performing &#10; batteries for critical applications and assign the lower performers &#10; for lighter duties. This makes full use of the available resources &#10; without affecting reliability.&lt;/p&gt; &lt;p&gt;Some battery analyzers display both the reserve &#10; capacity (motor fuel left in the tank before refill) and the &#10; full-charge capacity (full tank) of the batteries serviced. &#10; The user is then able to calculate how much energy was consumed &#10; during the day by subtracting the reserve from the full-charge &#10; capacity. To ensure a reasonable safety margin after a routine &#10; day, the reserve capacity should be about 20&amp;nbsp;percent. &#10; If less reserve capacity is available, the target capacity &#10; should be set higher. By allowing reasonable reserve capacity, &#10; unexpected downtime in an emergency or on extra-strenuous &#10; field activities can be eliminated.&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>17. Concave Norms</title><link>https://technick.net/guides/theory/edft/017/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/edft/017/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/filters/"&gt;Introduction to Digital Filters with Audio Applications&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, Copyright &amp;#169; &lt;i&gt;2017-11-26&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/edft/016"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/000"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/022"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/018"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;Concave Norms&lt;/h3&gt;&lt;p&gt;A desirable property of the error &lt;a href="http://mathworld.wolfram.com/topics/Norms.html" target="_blank"&gt;norm&lt;/a&gt; minimized by a &lt;a href="https://ccrma.stanford.edu/~jos//WinFlt/Problem_Statement.html" target="_blank"&gt;filter-design&lt;/a&gt;technique is &lt;a href="http://mathworld.wolfram.com/Convex.html" target="_blank"&gt;concavity&lt;/a&gt;&lt;a name="2606"&gt;&lt;/a&gt; of the&#10;error norm with respect to the &lt;a href="https://technick.net/guides/theory/edft/010"&gt;filter&lt;/a&gt; coefficients. When this holds,&#10;the error surface ``looks like a bowl,'' and the &lt;i&gt;global minimum&lt;/i&gt;can be found by iteratively moving the parameters in the ``downhill''&#10;(negative &lt;a href="http://mathworld.wolfram.com/Gradient.html" target="_blank"&gt;gradient&lt;/a&gt;) direction. The advantages of concavity are&#10;evident from the following classical results.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Theorem. &lt;a name="thm:TCIU"&gt;&lt;/a&gt;&lt;/b&gt; If &lt;img width="22" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img289.gif" alt="$X$" /&gt; is a &lt;a href="http://mathworld.wolfram.com/VectorSpace.html" target="_blank"&gt;vector space&lt;/a&gt;, &lt;img width="17" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img378.gif" alt="$S$" /&gt; a &lt;a href="http://mathworld.wolfram.com/Convex.html" target="_blank"&gt;concave&lt;/a&gt; subset&#10;of &lt;img width="22" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img289.gif" alt="$X$" /&gt;, and &lt;img width="16" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img262.gif" alt="$f$" /&gt; a concave &lt;a href="http://mathworld.wolfram.com/Functional.html" target="_blank"&gt;functional&lt;/a&gt; on &lt;img width="17" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img378.gif" alt="$S$" /&gt;, then any local&#10;minimizer of &lt;img width="16" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img262.gif" alt="$f$" /&gt; is a global minimizer of &lt;img width="16" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img262.gif" alt="$f$" /&gt; in &lt;img width="17" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img378.gif" alt="$S$" /&gt;.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Theorem. &lt;/b&gt;If &lt;img width="22" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img289.gif" alt="$X$" /&gt; is a normed linear space, &lt;img width="17" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img378.gif" alt="$S$" /&gt; a concave subset of &lt;img width="22" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img289.gif" alt="$X$" /&gt;, and &lt;img width="16" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img262.gif" alt="$f$" /&gt; a &lt;i&gt;strictly&lt;/i&gt; concave functional on &lt;img width="17" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img378.gif" alt="$S$" /&gt;, then &lt;img width="16" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img262.gif" alt="$f$" /&gt; has&lt;i&gt;at most&lt;/i&gt; one minimizer in &lt;img width="17" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img378.gif" alt="$S$" /&gt;.&lt;a name="2610"&gt;&lt;/a&gt;&lt;a name="2611"&gt;&lt;/a&gt;&lt;/p&gt;&lt;p&gt;&lt;b&gt;Theorem. &lt;a name="thm:BX"&gt;&lt;/a&gt;&lt;/b&gt; Let &lt;img width="17" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img378.gif" alt="$S$" /&gt; be a closed and bounded subset of &lt;img width="28" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img397.gif" alt="$\" e="" /&gt;.&#10;If &lt;!-- MATH&#10; $f:\Re ^n\mapsto\Re ^1$&#10; --&gt;&lt;img width="106" height="38" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img398.gif" alt="$f:\" e="" mapsto\re="" /&gt; is &lt;i&gt;continuous&lt;/i&gt; on &lt;img width="17" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img378.gif" alt="$S$" /&gt;, then &lt;img width="16" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img262.gif" alt="$f$" /&gt; has&lt;i&gt;at least&lt;/i&gt; one minimizer in &lt;img width="17" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img378.gif" alt="$S$" /&gt;.&lt;a name="2614"&gt;&lt;/a&gt;&lt;/p&gt;&lt;p&gt;Theorem&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/edft/017#thm:BX"&gt;4.1&lt;/a&gt;) bears directly on the existence of a solution to the&#10;general filter design problem in the frequency domain. Replacing&#10;``closed and bounded'' with ``compact'', it becomes true for a&#10;functional on an arbitrary metric space (Rudin&#10;[&lt;a href="https://technick.net/guides/theory/edft/023#Rudin"&gt;Rudin&amp;nbsp;1964&lt;/a&gt;], Thm.&amp;nbsp;14). (In &lt;img width="28" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img397.gif" alt="$\" e="" /&gt;, ``compact'' is equivalent to&#10;``closed and bounded'' [&lt;a href="https://technick.net/guides/theory/edft/023#Royden"&gt;Royden&amp;nbsp;1968&lt;/a&gt;].) Theorem&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/edft/017#thm:BX"&gt;4.1&lt;/a&gt;) implies only&#10;compactness of &lt;!-- MATH&#10; ${\hat \Theta}=\{{\hat b}_0,\ldots\,,{\hat b}_{n_b},&#10;{\hat a}_1,\ldots\,,{\hat a}_{n_a}\}$&#10; --&gt;&lt;img width="244" height="45" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img399.gif" alt="${\" at="" heta="" at="" dots="" at="" b="b" hat="" dots="" at="" a="a" /&gt; and continuity of the error norm &lt;!-- MATH&#10; $J({\hat \theta})$&#10; --&gt;&lt;img width="41" height="45" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img400.gif" alt="$J({\" at="" heta="" /&gt;on &lt;img width="19" height="23" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img401.gif" alt="${\" at="" heta="" /&gt; need to be shown to prove existence of a solution to the&#10;general frequency-domain filter design problem.&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>17. Did you know . . . ?</title><link>https://technick.net/guides/electronics/bpw/c17_01/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c17_01/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c16_03"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c17_02"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;17. Did you know . . . ?&lt;/h3&gt;&lt;p&gt; Technological advancements usually take off shortly after a &#10; major breakthrough has occurred. Electricity was discovered &#10; circa 1600&amp;nbsp;AD (or earlier). At that time, electric power &#10; had few other applications than creating sparks and experimenting &#10; with twitching frog legs. Once the relationship with magnetism &#10; was discovered in the mid 1800s, generators were invented that &#10; produced a steady flow of electricity. Motors followed that &#10; enabled mechanical movement and the Edison light bulb was invented &#10; to conquer the&amp;nbsp;dark. &#10; &lt;/p&gt;&lt;p&gt;In the early 1900s, the electronic vacuum tube &#10; was invented, which enabled generating and amplifying signals. &#10; Soon thereafter broadcasting through the air by radio waves &#10; became possible. The discovery of the transistor in 1947 led &#10; to the development of the integrated circuit ten years later. &#10; Finally, the microprocessor ushered in the Information Age &#10; and revolutionized the way we&amp;nbsp;live.&lt;/p&gt; &lt;p&gt;How much has the battery improved during the &#10; last 150&amp;nbsp;years when compared to other advancements? The &#10; progress has been moderate. A battery holds relatively little &#10; power, is bulky, heavy, and has a short life span. Battery &#10; power is also very expensive.&lt;/p&gt; &lt;p&gt;Yet humanity depends on the battery as a power &#10; source. In the year 2000, the total battery energy consumed &#10; globally by laptops and mobile phones alone is estimated to &#10; be 2,500MW. This equals 25,000 cars powered by a 100kW engine &#10; (134hp) driving at freeway speed.&lt;/p&gt; &lt;p&gt;Many travelers have experienced the exhilaration &#10; of take-off in a jumbo jet. At a full weight of over 396&amp;nbsp;tons, &#10; the Boeing 747 requires 90MW of energy to get airborne. The &#10; global battery power consumed by mobile phones and laptops &#10; could simultaneously lift off 28&amp;nbsp;jumbo jets. The energy &#10; consumption while cruising at high altitude is reduced to &#10; about half, or 45MW. The batteries that power our mobile phones &#10; and laptops could keep&amp;nbsp;56 Boeing 747s in the air. &lt;/p&gt; &lt;p&gt;The mighty Queen Mary, an 81,000&amp;nbsp;ton cruise &#10; ship measuring over 300&amp;nbsp;m (1000&amp;nbsp;ft) in length, was &#10; propelled by four steam turbine engines producing a total &#10; of 160,000hp. The energy consumed globally by mobile phones &#10; and laptops could power 20&amp;nbsp;Queen Mary ships, with 3000 &#10; passengers and crew aboard, traveling at a speed of 28.5&amp;nbsp;knots &#10; (52&amp;nbsp;km/hr). The Queen Mary was launched in 1934 and is &#10; now retired in Long Beach, California.&lt;/p&gt; &lt;p&gt;In this concluding chapter, we compare the cost &#10; of battery power against energy created by the combustion &#10; engine and the emerging fuel cell. We also examine the cost &#10; of electricity delivered through the electric utility system.&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>17. Did you know . . . ? 2</title><link>https://technick.net/guides/electronics/bpw/c17_02/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c17_02/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c17_01"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c17_03"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;17.1 The Cost of Mobile Power&lt;/h4&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;Among the common power sources, energy from non-rechargeable &#10; batteries is the most expensive. Figure&amp;nbsp;17-1 reflects &#10; the cost per kWh using non-rechargeable batteries, also referred &#10; to as primary batteries. In addition, non-rechargeable batteries &#10; have a high internal cell resistance, which limits their use &#10; to light loads with low discharge currents. &lt;/p&gt; &lt;p&gt;In the last few decades, there has been a shift &#10; from non-rechargeable to rechargeable batteries, also known &#10; as secondary batteries. The convenience of recharging, low &#10; cost and reliable operation have contributed to this. Another &#10; reason for the increased popularity of the secondary battery &#10; is the larger energy densities available. Some of the newer &#10; rechargeable lithium systems now approach or exceed the energy &#10; density of a primary battery.&lt;br /&gt; &lt;br /&gt; &lt;/p&gt; &lt;table border="0" cellspacing="0" cellpadding="3" width="100%"&gt; &lt;tr&gt; &#10; &lt;td colspan="6" valign="top"&gt; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="29%" valign="top" bgcolor="#E6E6E6"&gt;&amp;nbsp; &lt;/td&gt; &lt;td width="14%" valign="top" bgcolor="#E6E6E6"&gt; &lt;b class="table-bolder"&gt;AAA &#10; Cell&lt;/b&gt;&lt;/td&gt; &lt;td width="14%" valign="top" bgcolor="#E6E6E6"&gt; &lt;b class="table-bolder"&gt;AA &#10; Cell&lt;/b&gt;&lt;/td&gt; &lt;td width="14%" valign="top" bgcolor="#E6E6E6"&gt; &lt;b class="table-bolder"&gt;C &#10; Cell&lt;/b&gt;&lt;/td&gt; &lt;td width="14%" valign="top" bgcolor="#E6E6E6"&gt; &lt;b class="table-bolder"&gt;D &#10; Cell&lt;/b&gt;&lt;/td&gt; &lt;td width="14%" valign="top" bgcolor="#E6E6E6"&gt; &lt;b class="table-bolder"&gt;9 &#10; Volt&lt;/b&gt;&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td colspan="6" valign="top"&gt; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="29%" valign="top"&gt; &lt;b&gt;&lt;span class="table-bolder"&gt;Capacity&lt;/span&gt; &#10; (&lt;/b&gt;alkaline)&lt;/td&gt; &lt;td width="14%" valign="top"&gt; 1100mAh&lt;/td&gt; &lt;td width="14%" valign="top"&gt; 2500mAh&lt;/td&gt; &lt;td width="14%" valign="top"&gt; 7100mAh&lt;/td&gt; &lt;td width="14%" valign="top"&gt; 14,300mAh&lt;/td&gt; &lt;td width="14%" valign="top"&gt; 600mAh&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="29%" valign="top" bgcolor="#F3F3F3"&gt; &lt;b class="table-bolder"&gt;Energy &#10; &lt;/b&gt;(single cell)&lt;/td&gt; &lt;td width="14%" valign="top" bgcolor="#F3F3F3"&gt; 1.4Wh&lt;/td&gt; &lt;td width="14%" valign="top" bgcolor="#F3F3F3"&gt; 3Wh&lt;/td&gt; &lt;td width="14%" valign="top" bgcolor="#F3F3F3"&gt; 9Wh&lt;/td&gt; &lt;td width="14%" valign="top" bgcolor="#F3F3F3"&gt; 18Wh&lt;/td&gt; &lt;td width="14%" valign="top" bgcolor="#F3F3F3"&gt; 4.2Wh&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="29%" valign="top"&gt; &lt;b class="table-bolder"&gt;Cost &#10; per Cell &lt;/b&gt;(US$)&lt;/td&gt; &lt;td width="14%" valign="top"&gt; $1.25&lt;/td&gt; &lt;td width="14%" valign="top"&gt; $1.00&lt;/td&gt; &lt;td width="14%" valign="top"&gt; $1.60&lt;/td&gt; &lt;td width="14%" valign="top"&gt; $1.60&lt;/td&gt; &lt;td width="14%" valign="top"&gt; $3.10&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="29%" valign="top" bgcolor="#F3F3F3"&gt; &lt;b class="table-bolder"&gt;Cost &#10; per KWh &lt;/b&gt;(US$)&lt;/td&gt; &lt;td width="14%" valign="top" bgcolor="#F3F3F3"&gt; $890&lt;/td&gt; &lt;td width="14%" valign="top" bgcolor="#F3F3F3"&gt; $330&lt;/td&gt; &lt;td width="14%" valign="top" bgcolor="#F3F3F3"&gt; $180&lt;/td&gt; &lt;td width="14%" valign="top" bgcolor="#F3F3F3"&gt; $90&lt;/td&gt; &lt;td width="14%" valign="top" bgcolor="#F3F3F3"&gt; $730&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td colspan="6" valign="top"&gt; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;p class="caption"&gt;Figure&amp;nbsp;17-1:&amp;nbsp; Energy and cost comparison &#10; of primary alkaline cells.&lt;br /&gt; &lt;span class="caption-sub"&gt;Energy from primary batteries is &#10; most expensive. The cost increases with smaller battery sizes.&lt;/span&gt;&lt;/p&gt; &lt;p&gt;Figure&amp;nbsp;17-2 compares the cost of power &#10; when using rechargeable batteries. The analysis is based on &#10; the purchase cost of the battery and the number of discharge-charge &#10; cycles it can endure before replacement is necessary. The &#10; cost does not include the electricity needed for charging, &#10; nor does it account for the cost of purchasing and maintaining &#10; the charging equipment.&lt;br /&gt; &lt;br /&gt; &lt;/p&gt; &lt;table border="0" cellspacing="0" cellpadding="3" width="100%"&gt; &lt;tr&gt; &#10; &lt;td colspan="6" valign="top"&gt; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="26%" valign="top" bgcolor="#E6E6E6"&gt;&amp;nbsp; &lt;/td&gt; &lt;td width="11%" valign="top" bgcolor="#E6E6E6"&gt; &lt;b class="table-bolder"&gt;NiCd&lt;br /&gt; AA Cell&lt;/b&gt;&lt;/td&gt; &lt;td width="14%" valign="top" bgcolor="#E6E6E6"&gt; &lt;b class="table-bolder"&gt;NiMH&lt;br /&gt; AA Cell&lt;/b&gt;&lt;/td&gt; &lt;td width="14%" valign="top" bgcolor="#E6E6E6"&gt; &lt;b&gt;&lt;span class="table-bolder"&gt;Lead &#10; Acid&lt;/span&gt;&lt;br /&gt; &lt;/b&gt;(typical pack)&lt;/td&gt; &lt;td width="14%" valign="top" bgcolor="#E6E6E6"&gt; &lt;b class="table-bolder"&gt;Li-ion&lt;br /&gt; 18650 Cell&lt;/b&gt;&lt;/td&gt; &lt;td width="19%" valign="top" bgcolor="#E6E6E6"&gt; &lt;b class="table-bolder"&gt;Reusable &#10; Alkaline AA Cell&lt;/b&gt;&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td colspan="6" valign="top"&gt; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="26%" valign="top"&gt; &lt;b class="table-bolder"&gt;Capacity&lt;/b&gt;&lt;/td&gt; &lt;td width="11%" valign="top"&gt; 600mAh&lt;/td&gt; &lt;td width="14%" valign="top"&gt; 1000mAh&lt;/td&gt; &lt;td width="14%" valign="top"&gt; 2000mAh&lt;/td&gt; &lt;td width="14%" valign="top"&gt; 1200mAh&lt;/td&gt; &lt;td width="19%" valign="top"&gt; 1400mAh &lt;sup&gt;1&lt;/sup&gt;&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="26%" valign="top" bgcolor="#F3F3F3"&gt; &lt;b class="table-bolder"&gt;Battery &#10; Voltage&lt;/b&gt;&lt;/td&gt; &lt;td width="11%" valign="top" bgcolor="#F3F3F3"&gt; 7.5V&lt;/td&gt; &lt;td width="14%" valign="top" bgcolor="#F3F3F3"&gt; 7.5V&lt;/td&gt; &lt;td width="14%" valign="top" bgcolor="#F3F3F3"&gt; 12V&lt;/td&gt; &lt;td width="14%" valign="top" bgcolor="#F3F3F3"&gt; 7.2V&lt;/td&gt; &lt;td width="19%" valign="top" bgcolor="#F3F3F3"&gt; 7.5V&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="26%" valign="top"&gt; &lt;b class="table-bolder"&gt;Energy &#10; per cycle&lt;/b&gt;&lt;/td&gt; &lt;td width="11%" valign="top"&gt; 4.5Wh&lt;/td&gt; &lt;td width="14%" valign="top"&gt; 7.5Wh&lt;/td&gt; &lt;td width="14%" valign="top"&gt; 24Wh&lt;/td&gt; &lt;td width="14%" valign="top"&gt; 8.6Wh&lt;/td&gt; &lt;td width="19%" valign="top"&gt; 6.3Wh&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="26%" valign="top" bgcolor="#F3F3F3"&gt; &lt;b class="table-bolder"&gt;Cycle &#10; life&lt;/b&gt;&lt;/td&gt; &lt;td width="11%" valign="top" bgcolor="#F3F3F3"&gt; 1500&lt;/td&gt; &lt;td width="14%" valign="top" bgcolor="#F3F3F3"&gt; 500&lt;/td&gt; &lt;td width="14%" valign="top" bgcolor="#F3F3F3"&gt; 250&lt;/td&gt; &lt;td width="14%" valign="top" bgcolor="#F3F3F3"&gt; 500&lt;/td&gt; &lt;td width="19%" valign="top" bgcolor="#F3F3F3"&gt; 10&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="26%" valign="top"&gt; &lt;b class="table-bolder"&gt;Cost &#10; per battery &lt;/b&gt;(ref. only)&lt;/td&gt; &lt;td width="11%" valign="top"&gt; $50&lt;/td&gt; &lt;td width="14%" valign="top"&gt; $70&lt;/td&gt; &lt;td width="14%" valign="top"&gt; $50&lt;/td&gt; &lt;td width="14%" valign="top"&gt; $100&lt;/td&gt; &lt;td width="19%" valign="top"&gt; $6.00&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="26%" valign="top" bgcolor="#F3F3F3"&gt; &lt;b class="table-bolder"&gt;Cost &#10; per kWh &lt;/b&gt;($US)&lt;/td&gt; &lt;td width="11%" valign="top" bgcolor="#F3F3F3"&gt; $7.50&lt;/td&gt; &lt;td width="14%" valign="top" bgcolor="#F3F3F3"&gt; $18.50&lt;/td&gt; &lt;td width="14%" valign="top" bgcolor="#F3F3F3"&gt; $8.50&lt;/td&gt; &lt;td width="14%" valign="top" bgcolor="#F3F3F3"&gt; $24.00&lt;/td&gt; &lt;td width="19%" valign="top" bgcolor="#F3F3F3"&gt; $95.00&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td colspan="6" valign="top"&gt; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;p class="caption"&gt;Figure&amp;nbsp;17-2:&amp;nbsp; Energy and cost comparison &#10; using rechargeable cells.&lt;br /&gt; &lt;span class="caption-sub"&gt;Older battery technologies offer &#10; lower energy costs compared to new systems. In addition, larger &#10; cells are more cost-effective than small cells. The battery &#10; packs taken for comparison are for commercial applications &#10; at over-the-counter prices.&lt;br /&gt; &lt;br /&gt; For this calculation, 840mA is used since subsequent capacities &#10; are rated at 840mA (60% of initial capacity). If the battery &#10; is discharged partially, a higher cycle life can be obtained.&lt;/span&gt;&lt;/p&gt; &lt;p&gt;Figure&amp;nbsp;17-3 evaluates the cost to &#10; generate 1kW of energy. We take into account the initial investment, &#10; add the fuel consumption and include the eventual replacement &#10; of each system.&lt;/p&gt; &lt;p&gt;Power obtained through the electrical utility &#10; grid is most cost effective. Consumers in industrialized countries &#10; pay between $0.05 and 0.15US per&amp;nbsp;kWh. The typical daily &#10; energy consumption of a household is 25kWh.&lt;br /&gt; &lt;br /&gt; &lt;/p&gt; &lt;table border="0" cellspacing="0" cellpadding="3" width="100%"&gt; &lt;tr&gt; &#10; &lt;td colspan="5" valign="top"&gt; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="19%" valign="top" bgcolor="#E6E6E6"&gt;&amp;nbsp; &lt;/td&gt; &lt;td width="25%" valign="top" bgcolor="#E6E6E6"&gt; &lt;b class="table-bolder"&gt;Investment&lt;/b&gt; &#10; &lt;br /&gt; of equipment to &lt;br /&gt; generate 1kW&lt;/td&gt; &lt;td width="18%" valign="top" bgcolor="#E6E6E6"&gt; &lt;b class="table-bolder"&gt;Lifespan&lt;/b&gt; &#10; &lt;br /&gt; of equipment before major overhaul or replacement&lt;/td&gt; &lt;td width="14%" valign="top" bgcolor="#E6E6E6"&gt; &lt;b class="table-bolder"&gt;Cost &#10; of fuel&lt;/b&gt;&lt;br /&gt; per kWh&lt;/td&gt; &lt;td width="21%" valign="top" bgcolor="#E6E6E6"&gt; &lt;b&gt;&lt;span class="table-bolder"&gt;Total &#10; Cost&lt;/span&gt;&lt;br /&gt; &lt;/b&gt;&amp;nbsp;per kWh, incl. fuel, maintenance and equipment replacement&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td colspan="5" valign="top"&gt; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="19%" valign="top"&gt; &lt;b class="table-bolder"&gt;NiCd&lt;/b&gt;&lt;br /&gt; for portable use &lt;/td&gt; &lt;td width="25%" valign="top"&gt; $7,000, based on 7.2V, 1000mAh &#10; at $50/pack&lt;/td&gt; &lt;td width="18%" valign="top"&gt; 1500 h, based on 1C discharge&lt;/td&gt; &lt;td width="14%" valign="top"&gt; $0.15 for electricity&lt;/td&gt; &lt;td width="21%" valign="top"&gt; $7.50&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="19%" valign="top" bgcolor="#F3F3F3"&gt; &lt;b class="table-bolder"&gt;Gasoline &#10; Engine &lt;/b&gt;for mobile use &lt;/td&gt; &lt;td width="25%" valign="top" bgcolor="#F3F3F3"&gt; $30, based &#10; on $3,000/100kW (134hp)&lt;/td&gt; &lt;td width="18%" valign="top" bgcolor="#F3F3F3"&gt; 4000 h&lt;/td&gt; &lt;td width="14%" valign="top" bgcolor="#F3F3F3"&gt; $0.10&lt;/td&gt; &lt;td width="21%" valign="top" bgcolor="#F3F3F3"&gt; $0.14&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="19%" valign="top"&gt; &lt;b class="table-bolder"&gt;Diesel &#10; Engine&lt;/b&gt; &lt;br /&gt; for stationary use&lt;/td&gt; &lt;td width="25%" valign="top"&gt; $40, based on $4,000/100kW (134hp)&lt;/td&gt; &lt;td width="18%" valign="top"&gt; 5000 h&lt;/td&gt; &lt;td width="14%" valign="top"&gt; $0.07&lt;/td&gt; &lt;td width="21%" valign="top"&gt; $0.10&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="19%" valign="top" bgcolor="#F3F3F3"&gt;&lt;b class="table-bolder"&gt;Fuel &#10; Cell&lt;/b&gt;&lt;/td&gt; &lt;td width="25%" valign="top" bgcolor="#F3F3F3"&gt;$3,000 – 7,500&lt;/td&gt; &lt;td width="18%" valign="top" bgcolor="#F3F3F3"&gt;&amp;nbsp;&lt;/td&gt; &lt;td width="14%" valign="top" bgcolor="#F3F3F3"&gt;$0.35&lt;/td&gt; &lt;td width="21%" valign="top" bgcolor="#F3F3F3"&gt;&amp;nbsp;&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="19%" valign="top" bgcolor="#F3F3F3"&gt;- for portable &#10; use&lt;/td&gt; &lt;td width="25%" valign="top" bgcolor="#F3F3F3"&gt;&amp;nbsp;&lt;/td&gt; &lt;td width="18%" valign="top" bgcolor="#F3F3F3"&gt;2000 h&lt;/td&gt; &lt;td width="14%" valign="top" bgcolor="#F3F3F3"&gt;--&amp;gt;&lt;/td&gt; &lt;td width="21%" valign="top" bgcolor="#F3F3F3"&gt;$1.85 – 4.10&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="19%" valign="top" bgcolor="#F3F3F3"&gt;- for mobile &#10; use&lt;/td&gt; &lt;td width="25%" valign="top" bgcolor="#F3F3F3"&gt;&amp;nbsp;&lt;/td&gt; &lt;td width="18%" valign="top" bgcolor="#F3F3F3"&gt;4000 h&lt;/td&gt; &lt;td width="14%" valign="top" bgcolor="#F3F3F3"&gt;--&amp;gt;&lt;/td&gt; &lt;td width="21%" valign="top" bgcolor="#F3F3F3"&gt;$1.10 – 2.25&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="19%" valign="top" bgcolor="#F3F3F3"&gt;- for stationary &#10; use&lt;/td&gt; &lt;td width="25%" valign="top" bgcolor="#F3F3F3"&gt;&amp;nbsp;&lt;/td&gt; &lt;td width="18%" valign="top" bgcolor="#F3F3F3"&gt;40,000 h&lt;/td&gt; &lt;td width="14%" valign="top" bgcolor="#F3F3F3"&gt;--&amp;gt;&lt;/td&gt; &lt;td width="21%" valign="top" bgcolor="#F3F3F3"&gt;$0.45 – 0.55&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td width="19%" valign="top"&gt; &lt;b&gt;&lt;span class="table-bolder"&gt;Electricity&lt;/span&gt; &#10; &lt;br /&gt; &lt;/b&gt;from electric grid&lt;/td&gt; &lt;td width="25%" valign="top"&gt; All inclusive&lt;/td&gt; &lt;td width="18%" valign="top"&gt; All inclusive&lt;/td&gt; &lt;td width="14%" valign="top"&gt; $0.10&lt;/td&gt; &lt;td width="21%" valign="top"&gt; $0.10&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &#10; &lt;td colspan="5" valign="top"&gt; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;p class="caption"&gt;Figure&amp;nbsp;17-3:&amp;nbsp; Cost of generating 1kW of &#10; energy.&lt;br /&gt; &lt;span class="caption-sub"&gt;This takes into account the initial &#10; investment, fuel consumption, maintenance and eventual replacement &#10; of the equipment. The most economical power source is by far &#10; the utility; the most expensive is portable batteries.&lt;/span&gt;&lt;/p&gt; &lt;p&gt;The fuel cell offers the most effective means &#10; of generating electricity, but is expensive in terms of cost &#10; per kWh. This high cost is made economical when comparing &#10; with portable rechargeable batteries. For mobile and stationary &#10; applications, the fuel cell is considerably more expensive &#10; than conventional methods.&lt;/p&gt; &#10; &lt;p class="Standout"&gt;&lt;b&gt;Note&lt;/b&gt;: The costing information obtained &#10; on the fuel cell is based on current estimates and assumptions. &#10; It is anticipated that improvements and wider use of this &#10; technology will eventually lower the cost to be competitive &#10; with conventional methods.&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>17. Did you know . . . ? 3</title><link>https://technick.net/guides/electronics/bpw/c17_03/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c17_03/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c17_02"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c17_04"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;17.2 The Fuel Cell&lt;/h4&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;A fuel cell is an electrochemical device which &#10; combines hydrogen fuel with oxygen to produce electric power, &#10; heat and water. In many ways, the fuel cell resembles a battery. &#10; Rather than applying a periodic recharge, a continuous supply &#10; of oxygen and hydrogen is supplied from the outside. Oxygen &#10; is drawn from the air and hydrogen is carried as a fuel in &#10; a pressurized container. As alternative fuel, methanol, propane, &#10; butane and natural gas can be&amp;nbsp;used.&lt;/p&gt; &lt;p&gt;&amp;nbsp;&lt;img src="https://technick.net/img/guide_bpw2/c17_01.gif" width="262" height="98" vspace="19" hspace="19" align="right" border="0" alt="" /&gt;The &#10; fuel cell does not generate energy through burning; rather, &#10; it is based on an electrochemical process. There are little &#10; or no harmful emissions. The only release is clean water. &#10; In fact, the water is so pure that visitors to Vancouver’s &#10; Ballard Power Systems, the leader in the development of the &#10; proton exchange membrane fuel cell (PEMFC), drank clear water &#10; emitted from the tailpipes of buses powered by a Ballard fuel&amp;nbsp;cell.&lt;/p&gt; &lt;p&gt;The fuel cell is twice as efficient in converting &#10; fuel to energy through a chemical process than combustion. &#10; Hydrogen, the simplest element consisting of one proton and &#10; one electron, is plentiful and is exceptionally clean as a &#10; fuel. Hydrogen makes up 90&amp;nbsp;percent of the composition &#10; of the universe and is the third most abundant element on &#10; the earth’s surface. Such a wealth of fuel would provide an &#10; almost unlimited pool of energy at relatively low cost. But &#10; there is a price to pay. The fuel cell core (or ‘stack’), &#10; which converts oxygen and hydrogen to electricity, is expensive &#10; to build.&lt;/p&gt; &lt;p&gt;Hydrogen must be carried in a pressurized bottle. &#10; If propane, natural gas or diesel are used, a reformer is &#10; needed to convert the fuel to hydrogen. Reformers for PEMFCs &#10; are bulky and expensive. They start slowly and purification &#10; is required. Often the hydrogen is delivered at low pressure &#10; and additional compression is required. Some fuel efficiency &#10; is lost and a certain amount of pollution is produced. However, &#10; these pollutants are typically 90&amp;nbsp;percent less than what &#10; comes from the tailpipe of a&amp;nbsp;car.&lt;/p&gt; &lt;p&gt;The fuel cell concept was developed in 1839 by &#10; Sir William Grove, a Welsh judge and gentleman scientist. &#10; The invention never took off, partly because of the success &#10; of the internal combustion engine. It was not until the second &#10; half of the 20&lt;sup&gt;th&lt;/sup&gt; century when scientists learned &#10; how to better utilize materials such as platinum and Teflon&amp;Ocirc;, &#10; that the fuel cell could be put to practical&amp;nbsp;use.&lt;/p&gt; &lt;p&gt;A fuel cell is electrolysis in reverse, using &#10; two electrodes separated by an electrolyte. Hydrogen is presented &#10; to the negative electrode (anode) and oxygen to the positive &#10; electrode (cathode). A catalyst at the anode separates the &#10; hydrogen into positively charged hydrogen ions and electrons. &#10; On the PEMFC system, the oxygen is ionized and migrates across &#10; the electrolyte to the anodic compartment where it combines &#10; with hydrogen. The byproduct is electricity, some heat and &#10; water. A single fuel cell produces 0.6 to 0.8V under load. &#10; Several cells are connected in series to obtain higher voltages.&lt;/p&gt; &lt;p&gt;The first practical application of the fuel cell &#10; system was made in the 1960s during the Gemini space program, &#10; when this power source was favored over nuclear or solar power. &#10; The fuel cell, based on the alkaline system, generated electricity &#10; and produced the astronauts’ drinking water. Commercial application &#10; of this power source was prohibitive because of the high cost &#10; of materials. In the early 1990s, improvements were made in &#10; stack design, which led to increased power densities and reduced &#10; platinum loadings at the electrodes.&lt;/p&gt; &lt;p&gt;High cost did not hinder Dr.&amp;nbsp;Karl Kordesch, &#10; the co-inventor of the alkaline battery, from converting his &#10; car to an alkaline fuel cell in the early 1970s. Dr.&amp;nbsp;Kordesch &#10; drove the car for many years in Ohio, USA. The hydrogen tank &#10; was placed on the roof and the trunk was utilized to store &#10; the fuel cell and back-up batteries. According to Dr.&amp;nbsp;Kordesch, &#10; there was “enough room for four people and a&amp;nbsp;dog”.&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>17. Did you know . . . ? 4</title><link>https://technick.net/guides/electronics/bpw/c17_04/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c17_04/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c17_03"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c17_05"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;&lt;b&gt;Types of fuel cells&lt;/b&gt; — Several variations &#10; of fuel cell systems have emerged. The most common are the &#10; previously mentioned and most widely developed PEMFC systems &#10; using a polymer electrolyte. This system is aimed at vehicles &#10; and portable electronics. Several developers are also targeting &#10; stationary applications. The alkaline system, which uses a &#10; liquid electrolyte, is the preferred fuel cell for aerospace &#10; applications, including the space shuttle. Molten carbonate, &#10; phosphoric acid and solid oxide fuel cells are reserved for &#10; stationary applications, such as power generating plants for &#10; electric utilities. Among these stationary systems, the solid &#10; oxide fuel cell system is the least developed but has received &#10; renewed attention due to breakthroughs in cell material and &#10; stack designs.&lt;/p&gt; &lt;p&gt;The PEMFC system allows compact designs and achieves &#10; a high energy to weight ratio. Another advantage is a quick &#10; start-up when hydrogen is applied. The stack runs at a low &#10; temperature of about 80&amp;deg;C (176&amp;deg;F). The efficiency is about &#10; 50&amp;nbsp;percent (in comparison, the internal compaction motor &#10; has an efficiency of about 15&amp;nbsp;percent).&lt;/p&gt; &lt;p&gt;The limitations of the PEMFC system are high &#10; manufacturing costs and complex water management issues. The &#10; stack contains hydrogen, oxygen and water. If dry, the input &#10; resistance is high and water must be added to get the system &#10; going. Too much water causes flooding.&lt;/p&gt; &lt;p&gt;The PEMFC has a limited temperature range. Freezing &#10; water can damage the stack. Heating elements are needed to &#10; keep the fuel cell within an acceptable temperature range. &#10; The warm-up is slow and the performance is poor when cold. &#10; Heat is also a concern if the temperature rises too&amp;nbsp;high.&lt;/p&gt; &lt;p&gt;The PEMFC requires heavy accessories. Operating &#10; compressors, pumps and other apparatus consumes 30 percent &#10; of the energy generated. The PEMFC stack has an estimated &#10; service life of 4000 hours if operated in a vehicle. The relatively &#10; short life span is caused by intermittent operation. Start &#10; and stop conditions induce drying and wetting, which contribute &#10; to membrane stress. If run continuously, the stationary stack &#10; is good for about 40,000 hours. The replacement of the stack &#10; is a major expense.&lt;/p&gt; &lt;table border="0" cellspacing="0" cellpadding="3"&gt; &lt;tr valign="top"&gt; &#10; &lt;td colspan="5"&gt; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr valign="top"&gt; &#10; &lt;td bgcolor="#e6e6e6"&gt;&lt;b class="table-bolder"&gt;Type of Fuel &#10; Cell&lt;/b&gt;&lt;/td&gt; &lt;td bgcolor="#e6e6e6"&gt;&lt;b class="table-bolder"&gt;Applications&lt;/b&gt;&lt;/td&gt; &lt;td bgcolor="#e6e6e6"&gt;&lt;b class="table-bolder"&gt;Advantages&lt;/b&gt;&lt;/td&gt; &lt;td bgcolor="#e6e6e6"&gt;&lt;b class="table-bolder"&gt;Limitations&lt;/b&gt;&lt;/td&gt; &lt;td bgcolor="#e6e6e6"&gt;&lt;b class="table-bolder"&gt;Status&lt;/b&gt;&lt;/td&gt; &lt;/tr&gt; &lt;tr valign="top"&gt; &#10; &lt;td colspan="5"&gt; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr valign="top"&gt; &#10; &lt;td&gt;&lt;b style="'mso-bidi-font-weight:" normal="" lass="table-bolder"&gt;Proton Exchange Membrane&lt;br /&gt; (PEMFC)&lt;/b&gt;&lt;/td&gt; &lt;td&gt;Mobile (buses, cars), portable power, medium to large-scale &#10; stationary power generation (homes, industry). &lt;/td&gt; &lt;td&gt;&lt;span style="'mso-bidi-font-weight:" bold=""&gt;Compact design; relatively long operating life; adapted by major automakers; &#10; offers quick start-up, low temperature operation, operates &#10; at 50% efficiency.&lt;/span&gt;&lt;/td&gt; &lt;td&gt;&lt;span style="'mso-bidi-font-weight:" bold=""&gt;High manufacturing costs, needs heavy auxiliary equipment and pure hydrogen, &#10; no tolerance for contaminates; complex heat and water &#10; management.&lt;o p="p"&gt;&lt;/o&gt;p&amp;gt;&lt;/span&gt;&lt;/td&gt; &lt;td&gt;&lt;span style="'mso-bidi-font-weight:" bold=""&gt;Most widely developed; limited production; offers promising technology. &#10; &lt;/span&gt;&lt;/td&gt; &lt;/tr&gt; &lt;tr valign="top"&gt; &#10; &lt;td bgcolor="f3f3f3"&gt;&lt;b style="'mso-bidi-font-weight:" normal="" lass="table-bolder"&gt;Alkaline&lt;br /&gt; (AFC)&lt;/b&gt;&lt;/td&gt; &lt;td bgcolor="f3f3f3"&gt;&lt;span style="'mso-bidi-font-weight:" bold=""&gt;Space (NASA), terrestrial transport (German submarines).&lt;/span&gt;&lt;/td&gt; &lt;td bgcolor="f3f3f3"&gt;&lt;span style="'mso-bidi-font-weight:" bold=""&gt;Low manufacturing and operation costs; does not need heavy compressor, &#10; fast cathode kinetics.&lt;/span&gt;&lt;/td&gt; &lt;td bgcolor="f3f3f3"&gt;&lt;span style="'mso-bidi-font-weight:" bold=""&gt;Large size; needs pure hydrogen and oxygen; use of corrosive liquid electrolyte.&lt;o p="p"&gt;&lt;/o&gt;p&amp;gt;&lt;/span&gt;&lt;/td&gt; &lt;td bgcolor="f3f3f3"&gt;&lt;span style="'mso-bidi-font-weight:" bold=""&gt;First generation technology, has renewed interest due to low operating &#10; costs.&lt;/span&gt;&lt;/td&gt; &lt;/tr&gt; &lt;tr valign="top"&gt; &#10; &lt;td&gt;&lt;b style="'mso-bidi-font-weight:" normal="" lass="table-bolder"&gt;Molten Carbonate&lt;br /&gt; (MCFC)&lt;/b&gt;&lt;/td&gt; &lt;td&gt;&lt;span style="'mso-bidi-font-weight:" bold=""&gt;Large-scale power generation.&lt;/span&gt;&lt;/td&gt; &lt;td&gt;&lt;span style="'mso-bidi-font-weight:" bold=""&gt;Highly efficient; utilizes heat to run turbines for co-generation.&lt;/span&gt;&lt;/td&gt; &lt;td&gt;&lt;span style="'mso-bidi-font-weight:" bold=""&gt;Electrolyte instability; limited service life.&lt;/span&gt;&lt;/td&gt; &lt;td&gt;&lt;span style="'mso-bidi-font-weight:" bold=""&gt;Well developed; semi-commercial.&lt;/span&gt;&lt;/td&gt; &lt;/tr&gt; &lt;tr valign="top"&gt; &#10; &lt;td bgcolor="#f3f3f3"&gt;&lt;b style="'mso-bidi-font-weight:" normal="" lass="table-bolder"&gt;Phosphoric Acid&lt;br /&gt; (PAFC)&lt;/b&gt;&lt;/td&gt; &lt;td bgcolor="#f3f3f3"&gt;&lt;span style="'mso-bidi-font-weight:" bold=""&gt;Medium to large-scale power generation.&lt;o p="p"&gt;&lt;/o&gt;p&amp;gt;&lt;/span&gt;&lt;/td&gt; &lt;td bgcolor="#f3f3f3"&gt;&lt;span style="'mso-bidi-font-weight:" bold=""&gt;Commercially available; lenient to fuels; utilizes heat for co-generation.&lt;o p="p"&gt;&lt;/o&gt;p&amp;gt;&lt;/span&gt;&lt;/td&gt; &lt;td bgcolor="#f3f3f3"&gt;&lt;span style="'mso-bidi-font-weight:" bold=""&gt;Low efficiency, limited service life, expensive catalyst.&lt;/span&gt;&lt;/td&gt; &lt;td bgcolor="#f3f3f3"&gt;&lt;span style="'mso-bidi-font-weight:" bold=""&gt;Mature but faces competition from PEMFC. &lt;o p="p"&gt;&lt;/o&gt;p&amp;gt;&lt;/span&gt;&lt;/td&gt; &lt;/tr&gt; &lt;tr valign="top"&gt; &#10; &lt;td&gt;&lt;b style="'mso-bidi-font-weight:" normal="" lass="table-bolder"&gt;Solid Oxide (SOFC)&lt;/b&gt;&lt;/td&gt; &lt;td&gt;&lt;span style="'mso-bidi-font-weight:" bold=""&gt;Medium to large-scale power generation.&lt;/span&gt;&lt;/td&gt; &lt;td&gt;&lt;span style="'mso-bidi-font-weight:" bold=""&gt;High efficiency, lenient to fuels, takes natural gas directly, no reformer &#10; needed. Operates at 60% efficiency; utilizes heat for &#10; co-generation.&lt;/span&gt;&lt;/td&gt; &lt;td&gt;&lt;span style="'mso-bidi-font-weight:" bold=""&gt;High operating temperature; requires exotic metals, high manufacturing &#10; costs, oxidation issues; low specific power.&lt;/span&gt;&lt;/td&gt; &lt;td&gt;&lt;span style="'mso-bidi-font-weight:" bold=""&gt;Least developed. Breakthroughs in cell material and stack design sets &#10; off new research.&lt;/span&gt;&lt;/td&gt; &lt;/tr&gt; &lt;tr valign="top"&gt; &#10; &lt;td bgcolor="#f3f3f3"&gt;&lt;b class="table-bolder"&gt;Direct Methanol&lt;br /&gt; (DMFC)&lt;/b&gt;&lt;/td&gt; &lt;td bgcolor="#f3f3f3"&gt;&lt;span style="'mso-bidi-font-weight:" bold=""&gt;Suitable for portable, mobile and stationary applications.&lt;/span&gt;&lt;/td&gt; &lt;td bgcolor="#f3f3f3"&gt;&lt;span style="'mso-bidi-font-weight:" bold=""&gt;Compact design, no compressor or humidification needed; feeds directly &#10; off methanol in liquid form. &lt;o p="p"&gt;&lt;/o&gt;p&amp;gt;&lt;/span&gt;&lt;/td&gt; &lt;td bgcolor="#f3f3f3"&gt;&lt;span style="'mso-bidi-font-weight:" bold=""&gt;Complex stack structure, slow load response times; operates at 20% efficiency.&lt;/span&gt;&lt;/td&gt; &lt;td bgcolor="#f3f3f3"&gt;&lt;span style="'mso-bidi-font-weight:" bold=""&gt;Laboratory prototypes.&lt;/span&gt;&lt;/td&gt; &lt;/tr&gt; &lt;tr valign="top"&gt; &#10; &lt;td colspan="5"&gt; &lt;table width="100%" border="0" cellspacing="0" cellpadding="0" bgcolor="#000000"&gt; &lt;tr&gt; &#10; &lt;td&gt;&lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;p&gt;&lt;span style="mso-bookmark:_Ref506100728" class="caption"&gt;Figure&amp;nbsp;&lt;span style="'mso-field-code:" styleref="" s=""&gt;17&lt;/span&gt;-&lt;span style="'mso-field-code:" seq="" igure="" rabic="" s=""&gt;4&lt;/span&gt;&lt;/span&gt;&lt;span class="caption"&gt;: &#10; Advantages and disadvantages of various fuel cell systems. &#10; &lt;/span&gt;&lt;br /&gt; &lt;span class="caption-sub"&gt;The PEMFC is the most widely developed &#10; system.&lt;/span&gt;&lt;/p&gt; &lt;p&gt;&lt;img width="240" height="273" src="https://technick.net/img/guide_bpw2/c17_02.jpg" v:shapes="_x0000_i1025" border="0" alt="" /&gt;&lt;/p&gt; &lt;p class="caption"&gt;Figure&amp;nbsp;17-5:&amp;nbsp; 1kW portable fuel cell generator.&lt;br /&gt; &lt;span class="caption-sub"&gt;The unit is a fully automated power &#10; system, which converts hydrogen fuel and oxygen from air directly &#10; into DC electricity. Water is the only by-product of the reaction. &#10; This fuel cell generator, which operates at low pressures, &#10; provides reliable, clean, quiet and efficient power. It is &#10; small enough to be carried to wherever power is needed. Illustration &#10; courtesy of Ballard Power Systems Inc., February 2001.&lt;/span&gt;&lt;/p&gt; &lt;p&gt;The SOFC is best suited for stationary applications. &#10; The system requires high operating temperatures (about 1000&amp;deg;C). &#10; Newer systems are being developed which can run at about 700&amp;deg;C.&lt;/p&gt; &lt;p&gt;A significant advantage of the SOFC is its leniency &#10; on fuel. Due to the high operating temperature, hydrogen is &#10; produced through a catalytic reforming process. This eliminates &#10; the need for an external reformer to generate hydrogen. Carbon &#10; monoxide, a contaminant in the PEMFC system, is a fuel for &#10; the SOFC. In addition, the SOFC system offers a fuel efficiency &#10; of 60&amp;nbsp;percent, one of the highest among fuel cells. The &#10; 60&amp;nbsp;percent efficiency is achieved with co-generation, &#10; meaning that the heat is utilized.&lt;/p&gt; &lt;p&gt;Higher stack temperatures add to the manufacturing &#10; cost because they require specialized and exotic materials. &#10; Heat also presents a challenge for longevity and reliability &#10; because of increased material oxidation and stress. High temperatures, &#10; however, can be utilized for co-generation by running steam &#10; generators. This improves the overall efficiency of this fuel &#10; cell system.&lt;/p&gt; &lt;p&gt;The AFC has received renewed interest because &#10; of low operating costs. Although larger in physical size than &#10; the PEMFC system, the alkaline fuel cell has the potential &#10; of lower manufacturing and operating costs. The water management &#10; is simpler, no compressor is usually needed, and the hardware &#10; is cheaper. Whereas the separator for the PEMFC stack costs &#10; between $800 and $1,100US per square meter; the equivalent &#10; of the alkaline system is almost negligible. (In comparison, &#10; the separator of a lead acid battery is $5&amp;nbsp;per square &#10; meter.) As a negative, the alkaline fuel cell needs pure oxygen &#10; and hydrogen to operate. The amount of carbon dioxide in the &#10; air can poison the alkaline fuel&amp;nbsp;cell.&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>17. Did you know . . . ? 5</title><link>https://technick.net/guides/electronics/bpw/c17_05/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c17_05/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c17_04"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c17_06"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;&lt;b&gt;Applications&lt;/b&gt; — The fuel cell is being &#10; considered as an eventual replacement for the internal combustion &#10; engine for cars, trucks and buses. Major car manufacturers &#10; have teamed up with fuel cell research centers or are doing &#10; their own development. There are plans for mass-producing &#10; cars running on fuel cells. However, because of the low operating &#10; cost of the combustion engine, and some unresolved technical &#10; challenges of the fuel cell, experts predict that a large &#10; scale implementation of the fuel cell to power cars will not &#10; occur before 2015, or even&amp;nbsp;2020.&lt;/p&gt; &lt;p&gt;Large power plants running in the 40,000kW range &#10; will likely out-pace the automotive industry. Such systems &#10; could provide electricity to remote locations within 10&amp;nbsp;years. &#10; Many of these regions have an abundance of fossil fuel that &#10; could be utilized. The stack on these large power plants would &#10; last longer than in mobile applications because of steady &#10; use, even operating temperatures and absence of shock and &#10; vibration.&lt;/p&gt; &lt;p&gt;Residential power supplies are also being tested. &#10; Such a unit would sit in the basement or outside the house, &#10; similar to an air-conditioning unit of a typical middle class &#10; North American home. The fuel would be natural gas or propane, &#10; a commodity that is available in many urban settings.&lt;/p&gt; &lt;p&gt;Fuel cells may soon compete with batteries for &#10; portable applications, such as laptop computers and mobile &#10; phones. However, today’s technologies have limitations in &#10; meeting the cost and size criteria for small portable devices. &#10; In addition, the cost per watt-hour is less favorable for &#10; small systems than large installations.&lt;/p&gt; &lt;p&gt;Let’s examine once more the cost to produce 1kW &#10; of power. In Figure&amp;nbsp;17-5 we learned that the investment &#10; to provide 1kW of power using rechargeable batteries is around &#10; $7,000. This calculation is based on 7.2V; 1000mAh NiCd packs &#10; costing $50&amp;nbsp;each. High energy-dense batteries that deliver &#10; fewer cycles and are more expensive than the NiCd will double &#10; the&amp;nbsp;cost.&lt;/p&gt; &lt;p&gt;The high cost of portable power opens vast opportunities &#10; for the portable fuel cell. At an investment of $3,000 to &#10; $7,500 to produce one kilowatt of power, however, the energy &#10; generated by the fuel cell is only marginally less expensive &#10; than that produced by conventional batteries.&lt;/p&gt; &lt;p&gt;The DMFC, the fuel cell designed for portable &#10; applications would not necessarily replace the battery in &#10; the equipment but serve as a charger that is carried separately. &#10; The feasibility to build a mass-produced fuel cell that fits &#10; into the form factor of a battery is still a few years away.&lt;/p&gt; &lt;p&gt;&lt;img src="https://technick.net/img/guide_bpw2/c17_03.gif" width="202" height="90" vspace="19" hspace="19" align="right" border="0" alt="" /&gt;The &#10; advantages of the portable fuel cell are: relatively high &#10; energy density (up to five times that of a Li-ion battery), &#10; liquefied fuel as energy supply, environmentally clean, fast &#10; recharge and long runtimes. In fact, continuous operation &#10; is feasible. Miniature fuel cells have been demonstrated that &#10; operate at an efficiency of 20&amp;nbsp;percent and run for 3000&amp;nbsp;hours &#10; before a stack replacement is necessary. There is, however, &#10; some degradation during the service life of the fuel cell. &#10; Portable fuels cells are still in experimental stages.&lt;/p&gt; &lt;p&gt;&lt;b&gt;Advantages and limitations of the fuel cell&lt;/b&gt; &#10; — A less known limitation of the fuel cell is the marginal &#10; loading characteristic. On a high current load, mass transport &#10; limitations come into effect. Supplying air instead of pure &#10; oxygen aggregates this phenomenon.&lt;/p&gt; &lt;p&gt;The issue of mass transport limitation is why &#10; the fuel cell operates best at a 30&amp;nbsp;percent load factor. &#10; Higher loads reduce the efficiency considerably. In terms &#10; of loading characteristics, the fuel cell does not match the &#10; performance of a NiCd battery or a diesel engine, which perform &#10; well at a 100&amp;nbsp;percent load factor.&lt;/p&gt; &lt;p&gt;Ironically, the fuel cell does not eliminate &#10; the chemical battery — it promotes it. Similar to the argument &#10; that the computer would make paper redundant, the fuel cell &#10; needs batteries as a buffer. For many applications, a battery &#10; bank will provide momentary high current loads and the fuel &#10; cell will serve to keep the battery fully charged. For portable &#10; applications, a supercapacitor will improve the loading characteristics &#10; and enable high current pulses.&lt;/p&gt; &lt;p&gt;&lt;img src="https://technick.net/img/guide_bpw2/c17_04.gif" width="244" height="86" vspace="19" hspace="19" align="right" border="0" alt="" /&gt;Most &#10; fuel cells are still handmade and are used for experimental &#10; purposes. Fuel cell promoters remind the public that the cost &#10; will come down once the cells are mass-produced. While an &#10; internal combustion engine requires an investment of $35 to &#10; $50 to produce one kilowatt of power, the equivalent cost &#10; in a fuel cells is still a whopping $3,000 to $7,500. The &#10; goal is a fuel cell that would cost the same or less than &#10; diesel engines.&lt;/p&gt; &lt;p&gt;The fuel cell will find applications that lie &#10; beyond the reach of the internal combustion engine. Once low &#10; cost manufacturing is feasible, this power source will transform &#10; the world and bring great wealth potential to those who invest &#10; in this technology.&lt;/p&gt; &lt;p&gt;It is said that the fuel cell is as revolutionary &#10; in transforming our technology as the microprocessor has been. &#10; Once fuel cell technology has matured and is in common use, &#10; our quality of life will improve and the environmental degradation &#10; caused by burning fossil fuels will be reversed. However, &#10; the maturing process of the fuel cell may not be as rapid &#10; as that of microelectronics.&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>17. Did you know . . . ? 6</title><link>https://technick.net/guides/electronics/bpw/c17_06/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c17_06/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c17_05"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c18_01"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;17.3 The Electric Vehicle&lt;/h4&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;In a bid to lower air pollution in big cities, &#10; much emphasis has been placed on the electric car. The notion &#10; of driving a clean, quiet and light vehicle appeals to many &#10; city dwellers. Being able to charge the car at home for only &#10; a dollar a day and escape heavy fuel taxes (at least for the &#10; time being) makes the electric car even more attractive.&lt;/p&gt; &lt;p&gt;The battery is still the main challenge in the &#10; development of the electric car. Distance traveled between &#10; recharge, charge time and the limited cycle count of the battery &#10; continue to pose major concerns. Unless the cycle life of &#10; the battery can be increased significantly, the cost per mile &#10; will be substantially higher than that of a fuel-powered vehicle. &#10; The added expense is the need to replace the battery after &#10; a given number of recharges. This could offset any advantage &#10; of lower energy costs or the absence of fuel taxes. Disposing &#10; the spent batteries also adds to the expenditure.&lt;/p&gt; &lt;p&gt;Another challenge associated with the electric &#10; vehicle is the high power demand that would be placed on the &#10; electric grid if too many cars were charged at a certain time. &#10; Each recharge consumes between 15 to 20kW of power, an amount &#10; that is almost as much as the daily power requirement of a &#10; smaller household. By adding one electric car per family, &#10; the amount of electric power a residence requires would almost &#10; double. Delayed charging could ease this problem by only drawing &#10; power during the night when the consumption is&amp;nbsp;low.&lt;/p&gt; &lt;p&gt;A rapid shift to the electric car could create &#10; shortages of electric power. With the move to reduce the generation &#10; of electricity due environmental concerns, electricity would &#10; need to be imported at high costs. This would make the electric &#10; car less attractive.&lt;/p&gt; &lt;p&gt;If the electricity was generated with renewable &#10; energy such as hydroelectric generators and windmills, the &#10; electric vehicle would truly clear the air in big cities. &#10; The generation of electricity by means of nuclear power or &#10; fossil fuels simply shifts the pollution problem elsewhere. &#10; However, a central source of pollution is easier to contain &#10; than many polluting objects in a metropolitan&amp;nbsp;area.&lt;/p&gt; &lt;p&gt;A hybrid car is an alternative to vehicles running &#10; solely on battery power. Here, a small combustion engine works &#10; in unison with an electric motor. During acceleration, both &#10; the electric and combustion engines are engaged. Because of &#10; superior torque, the electric motor takes precedence during &#10; acceleration. Once cruising, the combustion engine maintains &#10; the speed and keeps the batteries charged. Hybrid cars achieve &#10; fuel savings of 30&amp;nbsp;percent or better compared to the &#10; combustion engine alone.&lt;/p&gt; &lt;p&gt;A hybrid car is less strenuous on a battery than &#10; a conventional electric car because the battery is not being &#10; deeply discharged during regular use. A deep discharge only &#10; occurs on a long mountain climb where the small combustion &#10; engine could not sustain the load and would need assistance &#10; from the electric motor and its battery bank. Driving habits &#10; would, to a large extent, determine the service life of the &#10; battery. A light foot on the pedal will help the pocket book &#10; also with the hybrid&amp;nbsp;car.&lt;/p&gt; &lt;p&gt;Another alternative to powering cars is the fuel &#10; cell. Although much cleaner running than the combustion engine, &#10; the fuel cell must solve a number of critical problems before &#10; the product can be offered to the consumer as an economical &#10; alternative. The major challenge is cost reduction. If fossil &#10; fuel remains as low-priced is it is today, many drivers owning &#10; high-powered cars, SUVs and trucks would be reluctant to switch &#10; to a new technology. Concerns over pollution only persuade &#10; a limited number of drivers to switch to a cleaner-running &#10; vehicle. With the slow and gradual progress in the fuel cell, &#10; it will be some time before this technology renders the combustion &#10; engine obsolete.&lt;/p&gt; &lt;p&gt;Europe is talking about the three-liter motor, &#10; an internal combustion engine running on gasoline or diesel &#10; fuel. Remarkably, ‘three’ does not denote the engine displacement &#10; but stands for liters of fuel consumed per 100 km traveled. &#10; There is talk about the one-liter engine also. Major car manufacturers &#10; are divided on the fuel that will power our cars in the future. &#10; Within one large auto manufacturer in Europe, opinions regarding &#10; the fuel cell and an economical three-liter engine are divided &#10; fifty-fifty.&lt;/p&gt;&lt;h4&gt;17.4 Strengthening the Weakest Link&lt;/h4&gt; &#10; &lt;p&gt;The speed at which mobility can advance hinges &#10; much on the battery. So important is this portable energy &#10; that engineers design handheld devices around the battery, &#10; rather than the other way around. With each incremental improvement &#10; of the battery, the doors swing open for new products and &#10; applications. It is the virtue of the battery that provides &#10; us the freedom to move around and stay in touch. The better &#10; the battery, the greater the freedom we can enjoy.&lt;/p&gt; &lt;p&gt;&lt;img src="https://technick.net/img/guide_bpw2/c17_05.gif" width="208" height="100" vspace="19" hspace="19" align="left" border="0" alt="" /&gt;The &#10; longer runtime of newer portable devices is not only credited &#10; to higher energy-dense batteries. Much improvement has been &#10; made in reducing the power consumption of portable equipment. &#10; These advancements are, however, counteracted with the demand &#10; for more features and faster processing time. In mobile computing, &#10; for example, high speed CPUs, large screens and wireless interface &#10; are a prerequisite. These features eat up the reserve energy &#10; that the more efficient circuits save and the improved battery &#10; provides. The result is similar runtime to an older system, &#10; but with increased performance. It is predicted that the improvements &#10; in battery technology will keep par with better performance.&lt;/p&gt; &lt;p&gt;Wide-band mobile phones, dubbed G3 for third &#10; generation, are being offered as replacements for the digital &#10; voice phone. There is public demand for Internet access in &#10; a tiny handset that connects to the world by the push of a &#10; few buttons, twenty-four hours a day. But these devices require &#10; many times the power compared to voice only when operating &#10; on wideband. Higher capacity batteries are needed, preferably &#10; without added size and weight. In fact, the success of the &#10; G3&amp;nbsp;system could hinge on the future performance of the &#10; battery. G3 technology may be ready but the battery lags behind.&lt;/p&gt; &lt;p&gt;The battery has not leap-frogged at the same &#10; speed as microelectronics. Only 5&amp;nbsp;to 10&amp;nbsp;percent &#10; gains in capacity per year have been achieved during the last &#10; decades and the ultimate miracle battery is still nowhere &#10; in sight. As long as the battery is based on an electro-chemical &#10; process, limitations of power density and life expectancy &#10; must be taken into account.&lt;/p&gt; &lt;p&gt;The battery remains the ‘weak link’ for the foreseeable &#10; future. A radical turn will be needed to satisfy the unquenchable &#10; thirst for mobile power. What people want is an inexhaustible &#10; pool of energy in a small package. It is anyone’s guess whether &#10; the electro-chemical battery of the future, the fuel cell &#10; or some groundbreaking new energy storage device will fulfill &#10; this dream. &lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>17. Footnotes</title><link>https://technick.net/guides/theory/dar/017/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dar/017/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/resample/"&gt;The Digital Audio Resampling Home Page&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, Copyright &amp;#169; &lt;i&gt;2016-05-17&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="javascript:parent.main.history.back()"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dar/000"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;Footnotes&lt;/h3&gt;&lt;dl&gt;&lt;dt&gt;&lt;a name="foot992"&gt;... kHz.&lt;/a&gt;&lt;a name="foot992" href="https://technick.net/guides/theory/dar/008#tex2html17"&gt;&lt;sup&gt;1&lt;/sup&gt;&lt;/a&gt;&lt;dd&gt;We arbitrarily define the &lt;img width="23" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img101.gif" alt="$20$" /&gt;% guard band as a&#10;percentage of half the &lt;a href="https://ccrma.stanford.edu/~jos//st/Shannon_s_Sampling_Theorem.html" target="_blank"&gt;sampling rate&lt;/a&gt; actually used, not as &lt;img width="23" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img101.gif" alt="$20$" /&gt;% of the&#10;desired &lt;img width="23" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img101.gif" alt="$20$" /&gt; kHz bandwidth which would call for a &lt;img width="23" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dar/guide_dar_img104.gif" alt="$48$" /&gt; kHz sampling rate.&lt;pre&gt;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&lt;/pre&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dl&gt;&lt;/blockquote&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="javascript:parent.main.history.back()"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dar/000"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;</description></item><item><title>18. Beginnings and Horizons</title><link>https://technick.net/guides/electronics/bpw/c18_01/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c18_01/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c17_06"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c18_02"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;18. Beginnings and Horizons&lt;/h3&gt;&lt;p&gt;&lt;h4&gt;18.1 About the Author&lt;/h4&gt; &lt;/p&gt;&lt;p&gt;A versatile inventor, researcher and writer, &#10; Mr.&amp;nbsp;Isidor Buchmann is the president, founder and CEO &#10; of Cadex Electronics Inc., located in Richmond (Vancouver), &#10; Canada.&lt;/p&gt; &lt;p&gt;Fascinated by electronics during his high school &#10; years, Mr. Buchmann took to inventing at an early age, designing &#10; a fuel-powered engine that was based on continuous combustion. &#10; His drawings and theory of operation were reviewed by Felix &#10; Wankel, inventor of the Wankel Rotary Engine, who kindly replied &#10; that while the design was indeed unique and original, manufacturing &#10; would be too expensive to be commercially viable. Further &#10; to his credit, Mr. Buchmann invented a broadcast radio that &#10; ran on no power — it required only an antenna and a ground &#10; connection (it didn’t even use a battery). Mr. Buchmann sold &#10; several of these radio receivers to his family and colleagues &#10; and later set up a workshop in the attic where he restored &#10; and resold old radios. After high school, a four-year apprenticeship &#10; as a Radio Technician brought him practical experience in &#10; a workshop environment as well as academic theory. Finally, &#10; his experience with radio communications in the Swiss army &#10; led to his decision to make electronics his life's&amp;nbsp;work.&lt;/p&gt; &lt;p&gt;Realizing that conservative Switzerland would &#10; not satisfy his entrepreneurial spirit, Mr. Buchmann emigrated &#10; to Canada in 1966, eventually finding employment in the radio &#10; communications department at General Electric. There he realized &#10; that a major problem with two-way radios was the battery's &#10; short life and, as part of his job, tested a wide variety &#10; of customer batteries that came in. In his spare time at home, &#10; he continued to research and develop electronic devices in &#10; his spare time, developing a battery analyzer that featured &#10; a ‘recondition’ program which restored weakened nickel cadmium &#10; batteries.&lt;/p&gt; &lt;p&gt;To prevent a conflict of interest with his employer, &#10; Mr. Buchmann quit his job with GE and started Cadex. The first &#10; battery analyzer, the Cadex &lt;i&gt;450&lt;/i&gt;, was introduced in &#10; 1981 but failed to achieve the anticipated market acceptance. &#10; Still in his spare time, Mr. Buchmann designed the modular &#10; Cadex &lt;i&gt;550&lt;/i&gt; battery analyzer. This model sold reasonably &#10; well at first but it soon became evident that manufacturing &#10; methods needed to be improved to make it cost effective.&lt;/p&gt; &lt;p&gt;In 1984, Cadex moved from a small room in Mr. &#10; Buchmann's residence to rented facilities. With increased &#10; overhead costs, a staff to maintain and sluggish sales, cash &#10; flow became tight. Bank loans for start-up companies, especially &#10; high-tech firms, were almost non-existent at the time, so &#10; Mr. Buchmann worked from home during the day looking after &#10; his growing children and spent time in the office during the &#10; evening. Happily, the company survived the slump and managed &#10; to add a number of new products. Profitability returned and &#10; the staff&amp;nbsp;grew.&lt;/p&gt; &lt;p&gt;Knowing that the wealth of an organization is &#10; in human resources, Isidor resolved to provide an environment &#10; that was conducive to attracting good people with skills that &#10; complemented his own strengths and weaknesses. Spacious new &#10; headquarters in a park-like setting overlooking the scenic &#10; Fraser River add to a pleasant working experience. Under Mr. &#10; Buchmann’s leadership, new and innovative products were developed &#10; that generated rapid growth and created global recognition &#10; of Cadex.&lt;/p&gt; &lt;p&gt;Today, Cadex is a world leader in the design &#10; and manufacture of battery analyzers and chargers.&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>18. Beginnings and Horizons 2</title><link>https://technick.net/guides/electronics/bpw/c18_02/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c18_02/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c18_01"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c18_03"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;18.2 About Cadex&lt;/h4&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;Cadex Electronics Inc. was established in 1980 &#10; in Vancouver, Canada. Isidor&amp;nbsp;Buchmann, founder, president &#10; and CEO recognized that the full potential of nickel cadmium &#10; batteries was not being achieved and developed a battery analyzer &#10; to exercise and rejuvenate&amp;nbsp;them.&lt;/p&gt; &lt;p&gt;In its early days, the company operated under &#10; the name Buchmann Enterprises Inc. Until 1983, all activities &#10; were conducted in a small room of the founder’s residence. &#10; In 1985, after the registered trademark for the name ‘Cadex’ &#10; was granted, the company changed the corporate name to Cadex &#10; Electronics Inc. Cadex is derived from ‘CADmium-EXerciser.’&lt;/p&gt; &lt;p&gt;The first product, the Cadex&lt;i&gt; 450&lt;/i&gt;, entered &#10; the market in 1981. Only a few units sold. Mr.&amp;nbsp;Buchmann &#10; then designed a modular battery analyzer that was able to &#10; service three batteries simultaneously, with expansion to &#10; ten. Called the Cadex&lt;i&gt;&amp;nbsp;550&lt;/i&gt;, this unit sold reasonably &#10; well and became the workhorse for many two-way radio users, &#10; such as railways, public safety and oil companies.&lt;/p&gt; &lt;p&gt;The Government of Canada awarded Cadex funds &#10; to develop a new generation of battery analyzers and in 1988 &#10; the Cadex&lt;i&gt; 6000&lt;/i&gt; was launched. This new product was capable &#10; of servicing up to 64&amp;nbsp;batteries unattended. A private &#10; company then commissioned Cadex to develop and manufacture &#10; an intelligent fast-charger for the &lt;i&gt;End-of-Train Unit&lt;/i&gt;, &#10; a device that replaced the caboose on a freight train. This &#10; charger was later expanded into a four-station battery analyzer &#10; called Cadex&lt;i&gt;&amp;nbsp;2000&lt;/i&gt;. Packaged into a compact desktop &#10; housing, the Cadex&amp;nbsp;&lt;i&gt;2000 &lt;/i&gt;provided a low cost alternative &#10; to the modular Cadex&amp;nbsp;&lt;i&gt;6000&lt;/i&gt; system.&lt;/p&gt; &lt;p&gt;Towards the end of the 1980s, batteries began &#10; to diversify and it became evident that a battery analyzer &#10; needed to adapt to a large pool of different battery models. &#10; With the help of the Science Council of British Columbia and &#10; the National Research Council of Canada, Cadex designed an &#10; open platform battery analyzer that was software driven similar &#10; to a PC. In 1991, the first user-programmable battery analyzer &#10; was introduced. Called the Cadex&lt;i&gt; 4000&lt;/i&gt; for its four &#10; independent stations, this instrument immediately gained the &#10; interest of many battery users, both in North America and &#10; overseas. Some of the main features were the interchangeable &#10; battery adapters that contained a memory chip holding the &#10; unique battery configuration code, ‘C-code’ in short. With &#10; a few key stokes, the user was able to program and reprogram &#10; the analyzer to fit virtually any battery&amp;nbsp;type.&lt;/p&gt; &lt;p&gt;In 1992, as part of a five-year program for a &#10; US defense project, Racal Communications commissioned Cadex &#10; to build intelligent fast-chargers and battery reconditioners. &#10; During this partnership, Cadex was the recipient of several &#10; Racal awards. The Supplier Recognition Award for Outstanding &#10; Performance, which Cadex received on two separate occasions, &#10; was granted to only six of over one thousand suppliers.&lt;/p&gt; &lt;p&gt;In 1995, Cadex introduced the Cadex &lt;i&gt;7000 Series&lt;/i&gt;, &#10; an upgraded version of the Cadex &lt;i&gt;4000&lt;/i&gt; battery analyzer. &#10; The Cadex &lt;i&gt;SnapLock&lt;/i&gt; adapters allowed quick and convenient &#10; changes from one battery type to another. The Cadex &lt;i&gt;7000 &#10; Series&lt;/i&gt; analyzer became the company’s flagship and established &#10; a new global standard to which competitive products were compared.&lt;/p&gt; &lt;p&gt;In 1996, an agreement was reached with Medtronics, &#10; (then Physio Control Corporation) to design and supply intelligent &#10; battery chargers/ conditioners as part of a five-year contract. &#10; In the same year, Cadex received the British Columbia Export &#10; Award for outstanding achievements in export.&lt;/p&gt; &lt;p&gt;In 1997, Cadex published the book &lt;i&gt;Batteries &#10; in a Portable World — A Handbook on Rechargeable Batteries &#10; for Non-Engineers&lt;/i&gt;. Many of Mr.&amp;nbsp;Buchmann’s articles &#10; on battery technology also gained recognition by appearing &#10; in leading trade magazines. By then, Cadex had achieved international &#10; market recognition with a customer base of over 100&amp;nbsp;countries.&lt;/p&gt; &lt;p&gt;In 1998, Motorola and Cadex engaged in a partnership &#10; to manufacture battery analyzers for distribution through &#10; Motorola’s global network. In the same year, Mr.&amp;nbsp;Buchmann &#10; was selected as a finalist in the Entrepreneur of the Year &#10; program.&lt;/p&gt; &lt;p&gt;In 1999, Cadex received ISO 9001 certification. &#10; The company moved to the custom built headquarters in Fraserwood &#10; Industrial Park, Richmond, British Columbia, a suburb of Vancouver. &#10; In the same year, Cadex &lt;i&gt;Batteryshop™&lt;/i&gt; was released. &#10; This high level software integrates the Cadex &lt;i&gt;7000 Series &#10; &lt;/i&gt;battery analyzers with a PC to bring battery testing and &#10; maintenance within the reach of the untrained user. The task &#10; of entering battery parameters was reduced to either scanning &#10; a bar code label or the ‘point and click’ of the mouse.&lt;/p&gt; &lt;p&gt;In the same year, Cadex released the &lt;i&gt;SM1&lt;/i&gt; &#10; and &lt;i&gt;SM2+&lt;/i&gt; intelligent battery chargers. The Cadex&lt;i&gt; &#10; SM2+ &lt;/i&gt;charger features a target capacity selector that &#10; passes or fails a battery based on state-of-health (SoH). &#10; If low, the user is prompted to restore the battery by pressing &#10; the condition key. Today, these chargers service batteries &#10; for mobile computing, medical instrumentation and survey equipment.&lt;/p&gt; &lt;p&gt;In the year 2000, Cadex developed &lt;i&gt;Quicktest&lt;/i&gt;™, &#10; a technique that checks the SoH of a battery in three minutes. &#10; The system works on a neuro-logic network based on fuzzy logic, &#10; is self-learning and adapts to new chemical combinations as &#10; introduced from time to&amp;nbsp;time.&lt;/p&gt; &lt;p&gt;During the year 2001, Cadex will introduce a &#10; new generation of &lt;i&gt;7000 Series&lt;/i&gt; battery analyzers. A &#10; two-station Cadex &lt;i&gt;7200&lt;/i&gt; has been added to serve smaller &#10; battery users. Retaining the powerful priming and reconditioning &#10; features of the previous models, the emphasis is moving towards &#10; quick testing, boosting and ultra-fast charging of batteries. &#10; These services take only minutes and can restore a battery &#10; on the&amp;nbsp;run.&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>18. Beginnings and Horizons 3</title><link>https://technick.net/guides/electronics/bpw/c18_03/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c18_03/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c18_02"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c18_04"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;18.3 Working with Natural Beauty&lt;/h4&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;The new Cadex headquarters is nestled in natural &#10; surroundings. The scenic Fraser River lies to the south, a &#10; public park to the east and the Coastal Mountains to the north. &#10; For joggers and cyclists, there is a nature path between the &#10; building and the river.&lt;/p&gt; &lt;p&gt;The interior of the building is designed with &#10; employee comfort in mind. It includes a snooker table, a gym, &#10; shower rooms, and several televisions. Balconies with a river &#10; view overlook the outdoor patio, which is used for summer &#10; lunches.&lt;/p&gt; &lt;p&gt;With the wonders of nature at its door, Cadex &#10; offers its staff a tranquil alternative to the noise and hustle &#10; of crowded city streets. And yet, the location is within easy &#10; reach of Vancouver’s downtown, is central to the surrounding &#10; suburban areas and is close to Vancouver International Airport.&lt;/p&gt; &lt;p&gt;&lt;img width="430" height="320" src="https://technick.net/img/guide_bpw2/c18_01.jpg" v:shapes="_x0000_i1025" border="0" alt="" /&gt;&lt;/p&gt; &lt;p class="caption"&gt;Figure&amp;nbsp;18-1:&amp;nbsp; Cadex headquarters in Richmond, &#10; Canada.&lt;br /&gt; &lt;span class="caption-sub"&gt;With the wonders of nature at its &#10; door, Cadex offers its staff a tranquil alternative to the &#10; noise and hustle of crowded city streets.&lt;/span&gt;&lt;/p&gt;&lt;h4&gt;18.4 Customer Comments&lt;/h4&gt; &lt;p&gt;A manager who is in charge of manufacturing and &#10; warranties for a large mobile phone provider writes: “I feel &#10; that by having the ability to analyze and condition our customer’s &#10; batteries, we have also increased our battery sales. We now &#10; recommend that all customers stop by and allow us to condition &#10; their batteries at least once every six months. Many customers &#10; will buy another battery to use while their pack is being &#10; conditioned. The customers feel that the maintenance program &#10; enables them to achieve longer battery life. Providing battery &#10; conditioning service has helped us increase customer loyalty &#10; and satisfaction, which in turn helps our bottom line in this &#10; competitive industry.” &lt;/p&gt; &lt;p&gt;When setting up a battery refurbishing service, the quality &#10; of battery analyzers is of importance. A manager in charge &#10; of battery warranty with a leading mobile phone manufacturer &#10; commented: “With the Cadex&lt;i&gt; 7000 Series&lt;/i&gt; analyzers, our &#10; team was able to achieve a 90&amp;nbsp;percent recovery rate for &#10; all warranty batteries, compared to just 60&amp;nbsp;percent before &#10; the Cadex analyzers were brought on stream. The savings were &#10; absolutely immense.”&lt;/p&gt; &lt;p&gt;Another Regional Service Manager for a mobile phone provider &#10; wrote: “The recovery rate of batteries has been far better &#10; than expected. We used to run them on our old equipment and &#10; if they failed we would then run them on the Cadex. Over 50&amp;nbsp;percent &#10; of the batteries would pass our target capacity of 80&amp;nbsp;percent. &#10; That in itself saved us a tremendous amount of expense. It &#10; enables us to return the batteries to the customer for further &#10; use.” &lt;/p&gt; &lt;p&gt;These above mentioned reports are mostly based on servicing &#10; nickel-based batteries. The recovery rate is expected to be &#10; lower with the Li-ion batteries, which are considered &#10; maintenance free. But to everyone’s amazement, lithium-based &#10; batteries enjoy a similar recovery rate, especially in the &#10; mobile phone market. Here, the cause of failure is not memory-based, &#10; especially during the warranty period. Lack of customer preparation &#10; and failure to understand the behavior of a battery as a portable &#10; energy source may be to blame. The true reason for the failures &#10; may never be known.&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>18. Beginnings and Horizons 4</title><link>https://technick.net/guides/electronics/bpw/c18_04/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c18_04/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c18_03"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/c18_05"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h4&gt;18.5 Cadex Products&lt;/h4&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;Cadex products are built with one goal in mind &#10; — to make batteries run longer. Cadex has realized the importance &#10; of battery care and is offering equipment to charge, test, &#10; monitor, and restore batteries.&lt;/p&gt; &lt;p&gt;Cadex’s core competence is engineering. Over &#10; 25&amp;nbsp;percent of the Cadex staff is active in the Engineering &#10; Department. Existing products are improved on a continual &#10; basis, and new and creative products are added to adjust to &#10; the changing demands of battery users. Key products include:&lt;/p&gt; &lt;p&gt;&lt;img src="https://technick.net/img/guide_bpw2/c18_02.jpg" width="350" height="327" border="0" alt="" /&gt;&lt;/p&gt; &lt;p&gt;&lt;span class="caption"&gt;Figure&amp;nbsp;18-2:&amp;nbsp; Cadex &#10; &lt;i&gt;7200&lt;/i&gt; battery analyzer.&lt;/span&gt;&lt;br /&gt; &lt;span class="caption-sub"&gt;This compact two-station battery &#10; analyzer brings battery maintenance within reach of all battery &#10; users.&lt;/span&gt;&lt;/p&gt; &lt;p&gt;&lt;img width="350" height="295" src="https://technick.net/img/guide_bpw2/c18_03.jpg" v:shapes="_x0000_i1034" border="0" alt="" /&gt;&lt;/p&gt; &lt;p style="'&lt;span&#10; style='" styleref="" s=""&gt;"&amp;gt;&lt;span class="caption"&gt;18-3:&amp;nbsp; Cadex &lt;i&gt;7400&lt;/i&gt; battery &#10; analyzer.&lt;/span&gt;&lt;br /&gt; &lt;span class="caption-sub"&gt;Provision to service&lt;i&gt; &lt;/i&gt;four &#10; batteries simultaneously increases the service throughput. &#10; The Cadex &lt;i&gt;7400&lt;/i&gt; offers parallel printer port and USP &#10; for easy interface to a PC.&lt;/span&gt;&lt;/p&gt; &lt;p&gt;&lt;b&gt;Cadex&lt;i&gt; 7000 Series&lt;/i&gt;&lt;/b&gt;&lt;i&gt; &lt;/i&gt;battery &#10; analyzers solve the common battery problems of uncertain service &#10; and short life. Pre-configured ‘Snap Lock’ adapters enable &#10; quick interface with all major batteries for wireless communications &#10; devices, laptops, biomedical equipment, video cameras and &#10; other portable devices. Irregular batteries connect by universal &#10; cables that can be programmed with the analyzer’s menu function. &#10; The analyzer supports Li-ion/Polymer, NiMH, NiCd and &#10; Sealed Lead Acid (SLA) batteries.&lt;/p&gt; &lt;p&gt;The Cadex &lt;i&gt;7000 Series&lt;/i&gt; features the self-learning &#10; Cadex &lt;i&gt;Quicktest&lt;/i&gt;™&amp;nbsp;program that performs an in-depth &#10; battery diagnosis in three minutes. Other programs include: &#10; &lt;i&gt;‘Boost’&lt;/i&gt; to wake up low voltage batteries; &lt;i&gt;‘Auto’ &#10; &lt;/i&gt;to recondition weak batteries and &lt;i&gt;‘Prime’&lt;/i&gt; to format &#10; new batteries. In addition, &lt;i&gt;‘Self-Discharge’&lt;/i&gt; verifies &#10; charge retention; &lt;i&gt;‘CycleLife’&lt;/i&gt; tests longevity and &lt;i&gt;‘Custom’&lt;/i&gt; &#10; enables user-defined programs. The Cadex &lt;i&gt;7200 &lt;/i&gt;services &#10; two batteries simultaneously; the Cadex &lt;i&gt;7400 &lt;/i&gt;accommodates&amp;nbsp;four.&lt;/p&gt; &lt;p&gt;The battery voltage is programmable from 1.2&amp;nbsp;to &#10; 15V with a current range of 100mA to 24A. If set high, the &#10; analyzer automatically reduces the current to remain within &#10; the 4A per station handling capabilities. With a printer, &#10; service reports and battery labels can be generated. The unit &#10; operates as stand-alone or with&amp;nbsp;a&amp;nbsp;PC.&lt;/p&gt; &lt;p&gt;&lt;img width="350" height="207" src="https://technick.net/img/guide_bpw2/c18_04.jpg" v:shapes="_x0000_i1035" border="0" alt="" /&gt;&lt;/p&gt; &lt;p class="caption"&gt;Figure&amp;nbsp;18-4:&amp;nbsp; Cadex &lt;i&gt;Batteryshop&lt;/i&gt;™.&lt;br /&gt; &lt;span class="caption-sub"&gt;This Windows-based software allows &#10; untrained users to perform accurate and expedient battery &#10; tests. With the same system, a design engineer can collect &#10; valuable battery information running customized test programs.&lt;/span&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>18. Beginnings and Horizons 5</title><link>https://technick.net/guides/electronics/bpw/c18_05/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/bpw/c18_05/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/electronics/bpw/c18_04"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/bpw/00_toc"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt; &lt;/p&gt;&lt;p&gt;&lt;b&gt;Cadex &lt;i&gt;Batteryshop™&lt;/i&gt;&lt;/b&gt; software provides &#10; a simple, yet powerful PC interface to control and monitor &#10; the Cadex &lt;i&gt;7000&lt;/i&gt; &lt;i&gt;Series&lt;/i&gt; battery analyzers. Running &#10; on Windows&amp;nbsp;95, 98 and NT, the software enables untrained &#10; staff to test batteries as part of customer service. In addition, &#10; Cadex &lt;i&gt;Batteryshop&lt;/i&gt;™ schedules periodic maintenance for &#10; fleet owners and assists battery manufacturers with quality &#10; control.&lt;/p&gt; &lt;p&gt;Cadex&lt;i&gt; Batteryshop™&lt;/i&gt; includes a database &#10; of over 2000&amp;nbsp;common battery models. Each battery listing &#10; contains the configuration code (C-code), the data that sets &#10; the analyzer to the correct parameters. A growing number of &#10; the battery listings also include matrices to perform Cadex &#10; &lt;i&gt;Quicktest&lt;/i&gt;&lt;i&gt;™&lt;/i&gt;.&lt;/p&gt; &lt;p&gt;Point and click technology selects the battery &#10; and programs the Cadex &lt;i&gt;7000 Series&lt;/i&gt; analyzer. Scanning &#10; the battery’s model number, if a bar code label is available, &#10; also programs the analyzer. Cadex &lt;i&gt;Batteryshop&lt;/i&gt;™ supports &#10; up to 120&amp;nbsp;Cadex &lt;i&gt;7000 Series&lt;/i&gt; battery analyzers. &#10; The test results can be displayed on screen in real time graphs &#10; and printed in customized reports.&lt;/p&gt; &lt;table border="0" cellspacing="0" cellpadding="0"&gt; &lt;tr&gt; &#10; &lt;td width="260"&gt; &#10; &lt;p&gt;&lt;img src="https://technick.net/img/guide_bpw2/c18_05.jpg" width="348" height="413" border="0" alt="" /&gt;&lt;/p&gt; &lt;p&gt;&lt;span class="caption"&gt;Figure&amp;nbsp;18-5:&amp;nbsp; &#10; The Cadex &lt;i&gt;SM1&lt;/i&gt; battery charger.&lt;/span&gt;&lt;br /&gt; &lt;span class="caption-sub"&gt;This charger accommodates &#10; the widely used 202 format. Other batteries that fit &#10; the bay are the 2020, 1030, 1020, 210, 201, 36, 35, &#10; 30, 17 and 15. The Cadex &lt;i&gt;SM1&lt;/i&gt; charger supports &#10; ‘smart’ and ‘dumb’ batteries.&lt;/span&gt;&lt;/p&gt; &lt;/td&gt; &lt;/tr&gt; &lt;/table&gt; &lt;p&gt;&lt;b&gt;Cadex&lt;i&gt; Smart Series&lt;/i&gt;&lt;/b&gt; battery chargers &#10; offer the consumer a continuous supply of freshly charged &#10; batteries. Conforming to the SMBus Level 3, the Cadex &lt;i&gt;Smart &#10; Series&lt;/i&gt; chargers accommodate Li-ion, NiMH and NiCd &#10; batteries. The charge time is 2&amp;nbsp;to&amp;nbsp;3&amp;nbsp;hours. &#10; If faulty batteries are identified, the charge is halted. &#10; On compatible footprint, the chargers also accommodate ‘dumb’ &#10; batteries. Typical uses are mobile computing, biomedical and &#10; survey devices.&lt;/p&gt; &lt;p&gt;The Cadex&lt;i&gt; SM1 &lt;/i&gt;charger is compact and charges &#10; one battery at a time. The Cadex&lt;i&gt; SM2+ &lt;/i&gt;charger services &#10; two packs simultaneously and doubles as conditioner and quality &#10; control system. The charger reads the data stored in the SMBus &#10; battery, calculates the previous power delivered and compares &#10; the results with the target capacity setting. Adjustable to &#10; 60, 70 and 80&amp;nbsp;percent, the charger flags batteries that &#10; fall below the set capacity reading.&lt;/p&gt; &lt;p&gt;&lt;img src="https://technick.net/img/guide_bpw2/c18_06.jpg" width="354" height="424" border="0" alt="" /&gt;&lt;/p&gt; &lt;p class="caption"&gt;Figure&amp;nbsp;18-6:&amp;nbsp; The Cadex &lt;i&gt;SM2+&lt;/i&gt; battery &#10; charger.&lt;br /&gt; &lt;span class="caption-sub"&gt;In addition to the features offered &#10; on the Cadex &lt;i&gt;SM1&lt;/i&gt; charger, this unit serves as charger, &#10; quality control system and battery conditioner. SMBus batteries &#10; with low state-of-health are identified. Conditioning and &#10; calibration occurs by pressing a button.&lt;/span&gt;&lt;/p&gt; &lt;p class="caption"&gt;&lt;img src="https://technick.net/img/guide_bpw2/c18_07.jpg" width="400" height="276" border="0" alt="" /&gt;&lt;/p&gt; &lt;p class="caption"&gt;Figure&amp;nbsp;18-7:&amp;nbsp; Cadex &lt;i&gt;UCC1&lt;/i&gt;, &lt;i&gt;MCC2&lt;/i&gt; &#10; and &lt;i&gt;UCC6&lt;/i&gt;.&lt;br /&gt; &lt;span class="caption-sub"&gt;The Cadex &lt;i&gt;UCC&lt;/i&gt; &lt;i&gt;Series&lt;/i&gt; &#10; chargers feature interchangeable battery adapters. The Cadex &#10; &lt;i&gt;MCC2&lt;/i&gt; serves both as desktop and mobile charger.&lt;/span&gt;&lt;/p&gt; &lt;p&gt;&lt;b&gt;Cadex&lt;i&gt; Universal Conditioning Chargers (UCC)&lt;/i&gt;&lt;/b&gt;&lt;i&gt; &#10; &lt;/i&gt;offer battery users an alternate source of chargers to &#10; those provided by the original equipment manufacturer (OEM). &#10; Available in one, two and six bay configurations, the chargers &#10; feature intelligent battery adapters. This concept allows &#10; easy adaptation to a variety of battery types without compromising &#10; charge performance.&lt;/p&gt; &lt;p&gt;The adapters allow service of different battery &#10; types in one unit. Reconfiguration to other battery types &#10; can be done in the field; the one and six-bay chargers are &#10; desktop and wall-mountable. The two-bay unit also serves as &#10; a vehicular charger built to military shock and vibration &#10; specifications.&lt;/p&gt; &lt;p&gt;&lt;b&gt;Custom Battery Chargers&lt;/b&gt; — Cadex designs &#10; and&lt;b&gt; &lt;/b&gt;manufactures a wide variety of custom chargers &#10; to serve public safety, law enforcement, emergency response, &#10; healthcare, mobile computing, broadcast and defence applications. &#10; Cadex covers all aspects of product development, from circuit &#10; design to power supply, from plastic housing to mechanical &#10; battery interface, to testing and manufacturing.&lt;/p&gt; &lt;p&gt;&lt;b&gt;Custom Battery Packs&lt;/b&gt;&lt;i&gt; — &lt;/i&gt;Cadex completes the &#10; line of portable power source by offering specialty battery &#10; packs. To provide added safety, Cadex has the capability of &#10; designing specialty protection circuits for lithium ion chemistries &#10; and other battery systems.&lt;/p&gt; &lt;/blockquote&gt;</description></item><item><title>18. Gradient Descent</title><link>https://technick.net/guides/theory/edft/018/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/edft/018/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/filters/"&gt;Introduction to Digital Filters with Audio Applications&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, Copyright &amp;#169; &lt;i&gt;2017-11-26&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/edft/017"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/000"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/022"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/019"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;Gradient Descent&lt;/h3&gt;&lt;p&gt;&lt;a href="http://mathworld.wolfram.com/Convex.html" target="_blank"&gt;Concavity&lt;/a&gt; is valuable in connection with the &lt;i&gt;&lt;a href="http://mathworld.wolfram.com/Gradient.html" target="_blank"&gt;Gradient&lt;/a&gt; Method&lt;/i&gt; of&#10;minimizing &lt;!-- MATH&#10; $J({\hat \theta})$&#10; --&gt;&lt;img width="41" height="45" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img400.gif" alt="$J({\" at="" heta="" /&gt; with respect to &lt;img width="14" height="23" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img402.gif" alt="${\" at="" heta="" /&gt;.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;The &lt;i&gt;gradient&lt;/i&gt;&lt;a name="2630"&gt;&lt;/a&gt; of the error measure &lt;!-- MATH&#10; $J({\hat \theta})$&#10; --&gt;&lt;img width="41" height="45" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img400.gif" alt="$J({\" at="" heta="" /&gt; is defined as the &lt;!-- MATH&#10; ${\hat N}\times 1$&#10; --&gt;&lt;img width="54" height="44" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img403.gif" alt="${\" at="" imes="" /&gt; column vector&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;{J^\prime}({\hat \theta})\isdef \frac{\partial J(\theta)}{\partial \theta}({\hat \theta}) \isdef \left[&#10;&#9;\frac{\partial}{\partial \theta}{J(\theta)}{b_0}\left({\hat b}_0\right),&#10;&#9;\frac{\partial}{\partial \theta}{J(\theta)}{b_1}\left({\hat b}_1\right), \ldots\,,&#10;&#9;\frac{\partial}{\partial \theta}{J(\theta)}{b_{n_b}}\left({\hat b}_{n_b}\right),&#10;&#9;\frac{\partial}{\partial \theta}{J(\theta)}{a_1}\left({\hat a}_1\right), \ldots\,,&#10;&#9;\frac{\partial}{\partial \theta}{J(\theta)}{a_{n_a}}\left({\hat a}_{n_a}\right)\right]^T.&#10;\end{displaymath}&#10; --&gt;&lt;img width="1011" height="64" border="0" src="https://technick.net/img/guide_edft/guide_edft_img404.gif" alt="\" egin="" isplaymath="" prime="" at="" heta="" sdef="" rac="" artial="" heta="" p="" eta="" theta="" a="" a="a" left="" at="" a="a" right="" ight="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;The &lt;i&gt;Gradient Method&lt;/i&gt;&lt;a name="2659"&gt;&lt;/a&gt; (Cauchy) is defined as follows.&lt;/p&gt;&lt;p&gt;Given &lt;!-- MATH&#10; ${\hat \theta}_0\in{\hat \Theta}$&#10; --&gt;&lt;img width="59" height="45" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img405.gif" alt="${\" at="" heta="" n="" at="" heta="" /&gt;, compute&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;{\hat \theta}_{n+1} = {\hat \theta}_n - t_n {J^\prime}({\hat \theta}_n),\qquad n=1,2,\ldots\,,&#10;\end{displaymath}&#10; --&gt;&lt;img width="348" height="36" border="0" src="https://technick.net/img/guide_edft/guide_edft_img406.gif" alt="\" egin="" isplaymath="" at="" heta="" hat="" heta="" t="" j="" rime="" at="" heta="" qquad="" dots="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where &lt;!-- MATH&#10; ${J^\prime}({\hat \theta}_n)$&#10; --&gt;&lt;img width="53" height="45" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img407.gif" alt="${J^\" rime="" at="" heta="" /&gt; is the &lt;i&gt;gradient&lt;/i&gt; of &lt;img width="17" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img408.gif" alt="$J$" /&gt; at &lt;!-- MATH&#10; ${\hat \theta}_n$&#10; --&gt;&lt;img width="22" height="45" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img409.gif" alt="${\" at="" heta="" /&gt;, and&lt;img width="58" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img410.gif" alt="$t_n\" n\re="" /&gt; is chosen as the smallest nonnegative local minimizer of&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\Phi_n(t) \isdef J\left({\hat \theta}_n-t{J^\prime}({\hat \theta}_n)\right).&#10;\end{displaymath}&#10; --&gt;&lt;img width="227" height="42" border="0" src="https://technick.net/img/guide_edft/guide_edft_img411.gif" alt="\" egin="" isplaymath="" hi="" t="" sdef="" eft="" at="" heta="" t="" prime="" at="" heta="" right="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Cauchy originally proposed to find the value of &lt;img width="55" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img412.gif" alt="$t_n\" eq="" /&gt; which gave a global&#10;minimum of &lt;img width="49" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img413.gif" alt="$\" hi="" t="" /&gt;. This, however, is not always feasible in practice.&lt;p&gt;Some general results regarding the Gradient Method are given below.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Theorem. &lt;/b&gt;If &lt;!-- MATH&#10; ${\hat \theta}_0$&#10; --&gt;&lt;img width="21" height="45" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img414.gif" alt="${\" at="" heta="" /&gt; is a local minimizer of &lt;!-- MATH&#10; $J({\hat \theta})$&#10; --&gt;&lt;img width="41" height="45" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img400.gif" alt="$J({\" at="" heta="" /&gt;, and&#10;&lt;!-- MATH&#10; ${J^\prime}({\hat \theta}_0)$&#10; --&gt;&lt;img width="52" height="45" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img415.gif" alt="${J^\" rime="" at="" heta="" /&gt; exists, then &lt;!-- MATH&#10; ${J^\prime}({\hat \theta}_0)=0$&#10; --&gt;&lt;img width="87" height="45" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img416.gif" alt="${J^\" rime="" at="" heta="" /&gt;.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Theorem. &lt;/b&gt;The gradient method is a &lt;i&gt;&lt;a href="https://technick.net/guides/theory/edft/018"&gt;descent&lt;/a&gt;&lt;/i&gt; method, i.e.,&#10;&#9; &lt;!-- MATH&#10; $J({\hat \theta}_{n+1})\leq J({\hat \theta}_n)$&#10; --&gt;&lt;img width="136" height="45" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img417.gif" alt="$J({\" at="" heta="" leq="" at="" heta="" /&gt;.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;&lt;!-- MATH&#10; $J:{\hat \Theta}\rightarrow \Re ^1$&#10; --&gt;&lt;img width="98" height="23" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img418.gif" alt="$J:{\" at="" heta="" ightarrow="" e="" /&gt;, &lt;!-- MATH&#10; ${\hat \Theta}\subset\Re ^{\hat N}$&#10; --&gt;&lt;img width="71" height="46" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img419.gif" alt="${\" at="" heta="" ubset\re="" at="" /&gt;, is&#10;said to be in the class &lt;!-- MATH&#10; ${\cal C}_k({\hat \Theta})$&#10; --&gt;&lt;img width="52" height="44" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img420.gif" alt="${\" al="" hat="" heta="" /&gt; if all &lt;img width="15" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img361.gif" alt="$k$" /&gt;th order partial&#10;derivatives of &lt;!-- MATH&#10; $J({\hat \theta})$&#10; --&gt;&lt;img width="41" height="45" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img400.gif" alt="$J({\" at="" heta="" /&gt; with respect to the components of &lt;img width="14" height="23" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img402.gif" alt="${\" at="" heta="" /&gt; are&#10;continuous on &lt;img width="19" height="23" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img401.gif" alt="${\" at="" heta="" /&gt;.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;The &lt;i&gt;Hessian&lt;/i&gt;&lt;a name="2693"&gt;&lt;/a&gt; &lt;!-- MATH&#10; ${J^{\prime\prime}}({\hat \theta})$&#10; --&gt;&lt;img width="49" height="45" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img421.gif" alt="${J^{\" rime\prime="" at="" heta="" /&gt;of &lt;img width="17" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img408.gif" alt="$J$" /&gt; at &lt;img width="14" height="23" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img402.gif" alt="${\" at="" heta="" /&gt; is defined as the &lt;a href="https://ccrma.stanford.edu/~jos//dft/Matrices.html" target="_blank"&gt;matrix&lt;/a&gt;of second-order partial derivatives,&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;{J^{\prime\prime}}({\hat \theta}) [i,j] \isdef &#10; \frac{\partial^2 J(\theta)}{\partial \theta[i]\partial \theta[j]} ({\hat \theta}),&#10;\end{displaymath}&#10; --&gt;&lt;img width="231" height="58" border="0" src="https://technick.net/img/guide_edft/guide_edft_img422.gif" alt="\" egin="" isplaymath="" prime\prime="" at="" heta="" i="" isdef="" rac="" art="" heta="" artial="" heta="" i="" artial="" heta="" hat="" heta="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where &lt;img width="31" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img423.gif" alt="$\" heta="" i="" /&gt; denotes the &lt;img width="11" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img424.gif" alt="$i$" /&gt;th component of &lt;img width="14" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img92.gif" alt="$\" heta="" /&gt;,&#10;&lt;!-- MATH&#10; $i=1,\ldots\,,{\hat N}={n_a}+{n_b}+1$&#10; --&gt;&lt;img width="225" height="44" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img425.gif" alt="$i=1,\" dots="" at="" a="a" n="" b="" /&gt;, and &lt;img width="39" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img426.gif" alt="$[i,j]$" /&gt; denotes the matrix entry at&#10;the &lt;img width="11" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img424.gif" alt="$i$" /&gt;th row and &lt;img width="14" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img427.gif" alt="$j$" /&gt;th column.&lt;p&gt;The Hessian of every element of &lt;!-- MATH&#10; ${\cal C}_2({\hat \Theta})$&#10; --&gt;&lt;img width="51" height="44" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img428.gif" alt="${\" al="" at="" heta="" /&gt; is a &lt;i&gt;symmetric&#10;matrix&lt;/i&gt; [&lt;a href="https://technick.net/guides/theory/edft/023#Williamson"&gt;Williamson &lt;em&gt;et&amp;nbsp;al.&lt;/em&gt;&amp;nbsp;1972&lt;/a&gt;]. This is because continuous second-order&#10;partials satisfy &lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\frac{\partial^2}{\partial x_1\partial x_2} = \frac{\partial^2}{\partial&#10;x_2\partial x_1} .&#10;\end{displaymath}&#10; --&gt;&lt;img width="166" height="56" border="0" src="https://technick.net/img/guide_edft/guide_edft_img429.gif" alt="\" egin="" isplaymath="" rac="" artial="" artial="" artial="" rac="" artial="" artial="" artial="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;b&gt;Theorem. &lt;/b&gt;If &lt;!-- MATH&#10; $J\in {\cal C}_1({\hat \Theta})$&#10; --&gt;&lt;img width="87" height="44" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img430.gif" alt="$J\" n="" al="" at="" heta="" /&gt;, then any cluster point&#10;&lt;!-- MATH&#10; ${\hat \theta}_\infty$&#10; --&gt;&lt;img width="28" height="45" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img431.gif" alt="${\" at="" heta="" nfty="" /&gt; of the gradient sequence &lt;!-- MATH&#10; ${\hat \theta}_n$&#10; --&gt;&lt;img width="22" height="45" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img409.gif" alt="${\" at="" heta="" /&gt; is necessarily a&lt;i&gt;stationary point&lt;/i&gt;&lt;a name="2713"&gt;&lt;/a&gt;, i.e., &lt;!-- MATH&#10; ${J^\prime}({\hat \theta}_\infty)=0$&#10; --&gt;&lt;img width="93" height="45" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img432.gif" alt="${J^\" rime="" at="" heta="" nfty="" /&gt;.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Theorem. &lt;/b&gt;Let &lt;!-- MATH&#10; $\overline{{\hat \Theta}}$&#10; --&gt;&lt;img width="19" height="26" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img433.gif" alt="$\" verline="" at="" heta="" /&gt; denote the &lt;a href="http://mathworld.wolfram.com/Convex.html" target="_blank"&gt;concave&lt;/a&gt; hull of&#10;&lt;!-- MATH&#10; ${\hat \Theta}\subset\Re ^{\hat N}$&#10; --&gt;&lt;img width="71" height="46" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img419.gif" alt="${\" at="" heta="" ubset\re="" at="" /&gt;. If &lt;!-- MATH&#10; $J\in {\cal C}_2({\hat \Theta})$&#10; --&gt;&lt;img width="87" height="44" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img434.gif" alt="$J\" n="" al="" at="" heta="" /&gt;, and there exist&#10;positive constants &lt;img width="13" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img317.gif" alt="$c$" /&gt; and &lt;img width="20" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img104.gif" alt="$C$" /&gt; such that&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;c\left\|\,\eta\,\right\|^2\leq \eta^T {J^{\prime\prime}}({\hat \theta}) \eta \leq C\left\|\,\eta\,\right\|^2,&#10;\end{displaymath}&#10; --&gt;&lt;a name="eq:tmp"&gt;&lt;/a&gt;&lt;a name="eq:tmp"&gt;&lt;/a&gt;&lt;img width="273" height="36" border="0" src="https://technick.net/img/guide_edft/guide_edft_img435.gif" alt="\" egin="" isplaymath="" left\vert="" ta="" ight\vert="" eq="" ta="" j="" rime\prime="" at="" heta="" ta="" eq="" eft\vert="" ta="" ight\vert="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;for all &lt;!-- MATH&#10; ${\hat \theta}\in{\hat \Theta}$&#10; --&gt;&lt;img width="52" height="45" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img436.gif" alt="${\" at="" heta="" n="" at="" heta="" /&gt; and for all &lt;!-- MATH&#10; $\eta\in\Re ^{{\hat N}}$&#10; --&gt;&lt;img width="65" height="46" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img437.gif" alt="$\" ta\in\re="" at="" /&gt;, then the gradient&#10;method beginning with any point in &lt;img width="19" height="23" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img401.gif" alt="${\" at="" heta="" /&gt; converges to a point &lt;!-- MATH&#10; ${\hat \theta}^\ast$&#10; --&gt;&lt;img width="21" height="23" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img438.gif" alt="${\" at="" heta="" st="" /&gt;.&#10;Moreover, &lt;!-- MATH&#10; ${\hat \theta}^\ast$&#10; --&gt;&lt;img width="21" height="23" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img438.gif" alt="${\" at="" heta="" st="" /&gt; is the unique global minimizer of &lt;img width="17" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img408.gif" alt="$J$" /&gt; in&#10;&lt;!-- MATH&#10; $\Re ^{{\hat N}}$&#10; --&gt;&lt;img width="31" height="24" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img439.gif" alt="$\" e="" at="" /&gt;.&lt;p&gt;By the &lt;a href="http://mathworld.wolfram.com/topics/Norms.html" target="_blank"&gt;norm&lt;/a&gt; equivalence theorem [&lt;a href="https://technick.net/guides/theory/edft/023#Ortega"&gt;Ortega&amp;nbsp;1972&lt;/a&gt;], Eq.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/edft/018#eq:tmp"&gt;5&lt;/a&gt;) is satisfied whenever&#10;&lt;!-- MATH&#10; ${J^{\prime\prime}}({\hat \theta})$&#10; --&gt;&lt;img width="49" height="45" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img421.gif" alt="${J^{\" rime\prime="" at="" heta="" /&gt; is a &lt;i&gt;norm&lt;/i&gt; on &lt;img width="19" height="23" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img401.gif" alt="${\" at="" heta="" /&gt; for each &lt;!-- MATH&#10; ${\hat \theta}\in{\hat \Theta}$&#10; --&gt;&lt;img width="52" height="45" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img436.gif" alt="${\" at="" heta="" n="" at="" heta="" /&gt;. Since&#10;&lt;!-- MATH&#10; ${J^{\prime\prime}}$&#10; --&gt;&lt;img width="25" height="19" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img440.gif" alt="${J^{\" rime\prime="" /&gt; belongs to &lt;!-- MATH&#10; ${\cal C}_2({\hat \Theta})$&#10; --&gt;&lt;img width="51" height="44" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img428.gif" alt="${\" al="" at="" heta="" /&gt;, it is a symmetric matrix. It is also&#10;bounded since it is continuous over a compact set. Thus a sufficient&#10;requirement is that &lt;!-- MATH&#10; ${J^{\prime\prime}}$&#10; --&gt;&lt;img width="25" height="19" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img440.gif" alt="${J^{\" rime\prime="" /&gt; be &lt;i&gt;positive definite&lt;/i&gt; on &lt;img width="19" height="23" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img401.gif" alt="${\" at="" heta="" /&gt;. Positive&#10;definiteness of &lt;!-- MATH&#10; ${J^{\prime\prime}}$&#10; --&gt;&lt;img width="25" height="19" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img440.gif" alt="${J^{\" rime\prime="" /&gt; can be viewed as ``positive curvature'' of &lt;img width="17" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img408.gif" alt="$J$" /&gt; at&#10;each point of &lt;img width="19" height="23" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img401.gif" alt="${\" at="" heta="" /&gt; which corresponds to &lt;i&gt;strict concavity&lt;/i&gt; of &lt;img width="17" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img408.gif" alt="$J$" /&gt; on&lt;img width="19" height="23" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img401.gif" alt="${\" at="" heta="" /&gt;.&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>19. Taylor's Theorem</title><link>https://technick.net/guides/theory/edft/019/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/edft/019/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/filters/"&gt;Introduction to Digital Filters with Audio Applications&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, Copyright &amp;#169; &lt;i&gt;2017-11-26&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/edft/018"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/000"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/022"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/020"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;Taylor's Theorem&lt;/h3&gt;&lt;p&gt;&lt;b&gt;Theorem. &lt;/b&gt; (Taylor) Every &lt;a href="http://mathworld.wolfram.com/Functional.html" target="_blank"&gt;functional&lt;/a&gt; &lt;!-- MATH&#10; $J:\Re ^{\hat N}\mapsto\Re ^1$&#10; --&gt;&lt;img width="110" height="24" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img441.gif" alt="$J:\" e="" at="" apsto\re="" /&gt; in&#10;&lt;!-- MATH&#10; ${\cal C}_2(\Re ^{\hat N})$&#10; --&gt;&lt;img width="64" height="46" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img442.gif" alt="${\" al="" e="" at="" /&gt; has the representation &lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;J({\hat \theta}+\eta) = J({\hat \theta}) + J^\prime({\hat \theta}) \eta + \frac{1}{ 2} &#10;\eta^T J^{\prime\prime}({\hat \theta}+\lambda\eta) \eta&#10;\end{displaymath}&#10; --&gt;&lt;img width="394" height="50" border="0" src="https://technick.net/img/guide_edft/guide_edft_img443.gif" alt="\" egin="" isplaymath="" hat="" heta="" ta="" hat="" heta="" prime="" at="" eta="" prime\prime="" at="" heta="" ambda\eta="" ta="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;for some &lt;img width="16" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img444.gif" alt="$\" ambda="" /&gt; between &lt;img width="14" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img288.gif" alt="$0$" /&gt; and &lt;img width="14" height="16" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img154.gif" alt="$1$" /&gt;, where &lt;!-- MATH&#10; $J^\prime({\hat \theta})$&#10; --&gt;&lt;img width="45" height="45" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img445.gif" alt="$J^\" rime="" at="" heta="" /&gt; is the &#10;&lt;!-- MATH&#10; ${\hat N}\times 1$&#10; --&gt;&lt;img width="54" height="44" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img403.gif" alt="${\" at="" imes="" /&gt; &lt;a href="http://mathworld.wolfram.com/Gradient.html" target="_blank"&gt;gradient&lt;/a&gt;vector evaluated at &lt;!-- MATH&#10; ${\hat \theta}\in\Re ^n$&#10; --&gt;&lt;img width="60" height="45" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img446.gif" alt="${\" at="" heta="" n\re="" /&gt;, and &#10;&lt;!-- MATH&#10; $J^{\prime\prime}({\hat \theta})$&#10; --&gt;&lt;img width="49" height="45" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img447.gif" alt="$J^{\" rime\prime="" at="" heta="" /&gt; is the &lt;!-- MATH&#10; ${\hat N}\times{\hat N}$&#10; --&gt;&lt;img width="62" height="44" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img448.gif" alt="${\" at="" imes="" at="" /&gt;Hessian &lt;a href="https://ccrma.stanford.edu/~jos//dft/Matrices.html" target="_blank"&gt;matrix&lt;/a&gt; of &lt;img width="17" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img408.gif" alt="$J$" /&gt; at &lt;img width="14" height="23" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img402.gif" alt="${\" at="" heta="" /&gt;, i.e.,&lt;br /&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray}&#10;J^\prime({\hat \theta}) &amp;\isdef &amp; \frac{\partial J(\theta)}{\partial \theta}({\hat \theta}) \\&#10;J^{\prime\prime}({\hat \theta}) &amp;\isdef &amp; \frac{\partial^2 J(\theta)}{\partial {\hat \theta}^2}({\hat \theta})&#10;\end{eqnarray}&#10; --&gt;&lt;table align="CENTER" cellpadding="0" width="100%"&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&lt;img width="50" height="50" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img449.gif" alt="$\" isplaystyle="" rime="" at="" heta="" /&gt;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="21" height="49" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img74.gif" alt="$\" extstyle="" sdef="" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="88" height="69" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img450.gif" alt="$\" isplaystyle="" rac="" artial="" heta="" artial="" heta="" at="" heta="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(52)&lt;/td&gt;&lt;/tr&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&lt;img width="54" height="50" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img451.gif" alt="$\" isplaystyle="" rime\prime="" at="" heta="" /&gt;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="21" height="49" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img74.gif" alt="$\" extstyle="" sdef="" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="96" height="71" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img452.gif" alt="$\" isplaystyle="" rac="" artial="" theta="" artial="" at="" heta="" at="" heta="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(53)&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;b&gt;Proof. &lt;/b&gt;See Goldstein [&lt;a href="https://technick.net/guides/theory/edft/023#Goldstein"&gt;Goldstein&amp;nbsp;1967&lt;/a&gt;] p. 119. The Taylor infinite series &#10;is treated in Williamson and Crowell [&lt;a href="https://technick.net/guides/theory/edft/023#Williamson"&gt;Williamson &lt;em&gt;et&amp;nbsp;al.&lt;/em&gt;&amp;nbsp;1972&lt;/a&gt;]. The present form is&#10;typically more useful for computing bounds on the error incurred by&#10;neglecting higher order terms in the Taylor expansion.&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>2. A CLOSER LOOK</title><link>https://technick.net/guides/hardware/umg/02_000/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/umg/02_000/</guid><description>&lt;hr /&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/hardware/umg/01_005"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/02_001"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt;&lt;a name="TOC"&gt;&lt;/a&gt;&lt;h3&gt;2. A CLOSER LOOK&lt;/h3&gt;&lt;/p&gt;&lt;p&gt;&lt;ul&gt;&lt;li&gt;&lt;a href="https://technick.net/guides/hardware/umg/02_001"&gt;2.1. WHAT MEMORY LOOKS LIKE&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href="https://technick.net/guides/hardware/umg/02_002"&gt;2.2. WHERE MEMORY COMES FROM&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href="https://technick.net/guides/hardware/umg/02_003"&gt;2.3. WHERE MEMORY GOES IN THE COMPUTER&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/p&gt;&lt;/blockquote&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/hardware/umg/01_005"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/02_001"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;</description></item><item><title>2. Principles of ESD Control</title><link>https://technick.net/guides/electronics/esd/002/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/esd/002/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/electronics/esd/001"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/esd/000"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/esd/003"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;2. Principles of ESD &#10;Control&lt;/h3&gt;&lt;p&gt;In &lt;i&gt;&lt;a href="https://technick.net/guides/electronics/esd/001"&gt;Part One&lt;/a&gt;&lt;/i&gt;, we &#10;discussed the basics of electrostatic charge, discharge, types of failures, ESD &#10;events, and device sensitivity. We summarized this discussion as follows:&lt;/p&gt;&lt;ol&gt; &lt;li&gt;Virtually all materials, even conductors, can be triboelectrically &#10; charged. &#10; &lt;/li&gt;&lt;li&gt;The level of charge is affected by material type, speed of contact and &#10; separation, humidity, and several other factors. &#10; &lt;/li&gt;&lt;li&gt;Electrostatic discharge can create catastrophic or latent failures in &#10; electronic components. &#10; &lt;/li&gt;&lt;li&gt;Electrostatic discharge can occur throughout the manufacturing, test, &#10; shipping, handling, or operational processes. &#10; &lt;/li&gt;&lt;li&gt;Component damage can occur as the result of a discharge from the component &#10; as well as a direct discharge to the component. &#10; &lt;/li&gt;&lt;li&gt;Components vary significantly in their sensitivity to ESD. &lt;/li&gt;&lt;/ol&gt;&lt;p&gt;With this basic understanding of ESD and its impact on your environment, you &#10;can then begin to develop an effective ESD control program. In this column and &#10;the next, we will focus on basic Principles of ESD control.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Basic Principles of Static Control&lt;br /&gt;&lt;/b&gt;Sometimes, controlling &#10;electrostatic discharge (ESD) in the electronics environment seems to be a &#10;formidable challenge. However, the task of designing and implementing ESD &#10;control programs becomes less complex if we focus on just four basic Principles &#10;of control. In doing so, we also need to keep in mind the ESD corollary to &#10;Murphy’s law, "no matter what we do, static charge will try to find a way to &#10;discharge."&lt;/p&gt;&lt;p&gt;&lt;b&gt;1. Design In Immunity&lt;br /&gt;&lt;/b&gt;The first Principle is to &lt;i&gt;design products &#10;and assemblies to be as immune as reasonable&lt;/i&gt; from the effects of ESD. This &#10;involves such steps as using less static sensitive devices or providing &#10;appropriate input protection on devices, boards, assemblies, and equipment. For &#10;engineers and designers, the paradox is that advancing product technology &#10;requires smaller and more complex geometries that often are more susceptible to &#10;ESD.&lt;/p&gt;&lt;p&gt;&lt;b&gt;2. Eliminate and Reduce Generation&lt;br /&gt;&lt;/b&gt;Obviously, product design isn’t &#10;the whole answer. The second Principle of control is to &lt;i&gt;eliminate or reduce &#10;the generation and accumulation of electrostatic charge&lt;/i&gt; in the first place. &#10;It’s fairly basic: no charge -- no discharge. We begin by reducing as many &#10;static generating processes or materials, such as the contact and separation of &#10;dissimilar materials and common plastics, as possible from the work environment. &#10;We keep other processes and materials at the same electrostatic potential. &#10;Electrostatic discharge does not occur between materials kept at the same &#10;potential or at zero potential. We provide ground paths, such as wrist straps, &#10;flooring and worksurfaces, to reduce charge generation and accumulation.&lt;/p&gt;&lt;p&gt;&lt;b&gt;3. Dissipate and Neutralize&lt;br /&gt;&lt;/b&gt;Because we simply can’t eliminate all &#10;generation of static in the environment, our third Principle is to &lt;i&gt;safely &#10;dissipate or neutralize those electrostatic charges&lt;/i&gt; that do occur. Proper &#10;grounding and the use of conductive or dissipative materials play major roles. &#10;For example, workers who "carry" a charge into the work environment can rid &#10;themselves of that charge when they attach a wrist strap or when they step on an &#10;ESD floor mat while wearing ESD control footwear. The charge goes to ground &#10;rather than being discharged into a sensitive part. To prevent damaging a &#10;charged device, the rate of discharge can be controlled with static dissipative &#10;materials.&lt;/p&gt;&lt;p&gt;For some objects, such as common plastics and other insulators, grounding &#10;does not remove an electrostatic charge because there is no conductive pathway. &#10;Typically, ionization is used to neutralize charges on these insulating &#10;materials. The ionization process generates negative and positive ions that are &#10;attracted to the surface of a charged object, thereby effectively neutralizing &#10;the charge.&lt;/p&gt;&lt;p&gt;&lt;b&gt;4. Protect Products&lt;br /&gt;&lt;/b&gt;Our final ESD control Principle is to &lt;i&gt;prevent discharges that do occur from reaching susceptible parts and &#10;assemblies&lt;/i&gt;. One way is to provide our parts and assemblies with proper &#10;grounding or shunting that will "dissipate" any discharge away from the product. &#10;A second method is to package and transport susceptible devices in proper &#10;packaging and materials handling products. These materials may effectively &#10;shield the product from charge, as well as reduce the generation of charge &#10;caused by any movement of product within the container.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Elements of an Effective ESD Control Program&lt;br /&gt;&lt;/b&gt;While these four &#10;principles may seem rather basic, they can guide us in the selection of &#10;appropriate materials and procedures to use in effectively controlling ESD. In &#10;most circumstances, effective programs will involve all of these principles. No &#10;single procedure or product will do the whole job, rather effective static &#10;control requires a full ESD control program.&lt;/p&gt;&lt;p&gt;How to we develop and maintain a program that puts these basic principles &#10;into practice? How do we start? What is the process? What do we do first? Ask a &#10;dozen experts and you may get a dozen different answers. But, if you dig a &#10;little deeper, you will find that most of the answers center around similar key &#10;elements. You will also find that starting and maintaining an ESD control &#10;program is similar to many other business activities and projects. Although each &#10;company is unique in terms of its ESD control needs, there are at least 9 &#10;critical elements to successfully developing and implementing an effective ESD &#10;control program.&lt;/p&gt;&lt;p&gt;&lt;b&gt;1. Establish an ESD Coordinator and ESD Teams. &lt;br /&gt;&lt;/b&gt;As the &#10;problem-solving style of the decade, the team approach particularly applies to &#10;ESD because the problems and the solutions cross various functions, departments, &#10;divisions and even suppliers in most companies. Team composition includes line &#10;employees as well as department heads or other management personnel. ESD teams &#10;or committees help assure a variety of viewpoints, the availability of the &#10;needed expertise, and commitment to success. An active ESD committee helps unify &#10;the effort and brings additional expertise to the project. Committee or team &#10;membership should include representation from areas such as engineering, &#10;manufacturing, field service, training, and quality.&lt;/p&gt;&lt;p&gt;Heading this team effort is an ESD Program Coordinator. Ideally this &#10;responsibility should be a full-time job. However, we seldom operate in an ideal &#10;environment and you may have to settle for the function to be a major &#10;responsibility of an individual. The ESD coordinator is responsible for &#10;developing, budgeting, and administering the program. The coordinator also &#10;serves as the company’s internal ESD consultant to all areas.&lt;/p&gt;&lt;p&gt;&lt;b&gt;2. Identify Your Losses. &lt;br /&gt;&lt;/b&gt;Before seeking solutions to your &#10;problems, you will need to determine the extent of your losses to ESD. These &#10;losses may be reflected in receiving reports, QA and QC records, customer &#10;returns, in-plant yields, failure analysis reports, and other data that you may &#10;already have or that you need to gather. This information not only identifies &#10;the magnitude of the problem, but helps to pinpoint and prioritize areas that &#10;need attention. &lt;/p&gt;&lt;p&gt;Document your actual and potential ESD losses in terms of DOA components, &#10;rework, customer returns, and failures during final test and inspection. Use &#10;data from outside sources or the results of your pilot program for additional &#10;support. Develop estimates of the savings to be realized from implementing an &#10;ESD control program.&lt;/p&gt;&lt;p&gt;&lt;b&gt;3. Evaluate Your Facility, Processes and Needs&lt;br /&gt;&lt;/b&gt;Your next step is to &#10;gain a thorough understanding of your environment and its impact on ESD. Armed &#10;with your loss and sensitivity data, you can evaluate your facility, looking for &#10;areas and procedures that may be contributing to your defined ESD problems. Be &#10;on the lookout for things such as static generating materials and personnel &#10;handling procedures for ESD-sensitive items. &lt;/p&gt;&lt;p&gt;Document your processes. Observe the movement of people and materials through &#10;the areas. Note those areas that would appear to have the greatest potential for &#10;ESD problems. Remember, that ESD can occur in the warehouse just as it can in &#10;the assembly areas. Then conduct a thorough facility survey or audit. Measure &#10;personnel, equipment, and materials to identify the presence of electrostatic &#10;fields in your environment.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;b&gt;4. Identify ESD Sensitive Items&lt;br /&gt;&lt;/b&gt;You will also want to identify &#10;those items (components, assemblies, and finished products) that are sensitive &#10;to ESD and the level of their sensitivity. You can test these items yourself, &#10;use data from suppliers, or rely on published data for similar items.&lt;/p&gt;&lt;p&gt;&lt;b&gt;5. Build Justification for the Program&lt;br /&gt;&lt;/b&gt;Once you understand your &#10;environment and the impact that ESD has on your products and services, you then &#10;build justification for your ESD control program. You may even need to conduct a &#10;pilot program if the experience of other companies is not sufficient to help &#10;prove your point.&lt;/p&gt;&lt;p&gt;&lt;b&gt;6. Get the Support of Top Management&lt;br /&gt;&lt;/b&gt;To be successful, an ESD &#10;program requires the support of your top management, at the highest level &#10;possible. What level of commitment is required? Recently, the CEO of a major &#10;electronics manufacturer was asked to leave the production area when he failed &#10;to wear the ESD control smock required by the company’s ESD procedures. He did &#10;so willingly and returned later wearing the proper apparel.&lt;/p&gt;&lt;p&gt;That’s the type of commitment you would like to achieve. To obtain it, your &#10;program justification will need to emphasize quality and reliability, the costs &#10;of ESD damage, the impact of ESD on customer service and product performance. &#10;Prepare a short corporate policy statement on ESD control. Have top management &#10;co-sign it with the ESD coordinator. Periodically, reaffirm the policy statement &#10;and management’s commitment to it.&lt;/p&gt;&lt;p&gt;&lt;b&gt;7. Establish and Implement Procedures and Specifications&lt;br /&gt;&lt;/b&gt;Now you &#10;can develop and implement the appropriate procedures that will help solve the &#10;ESD problems you have identified in your company. Prepare and distribute written &#10;procedures and specifications so that everyone has a clear understanding of what &#10;is to be done. Fully documented procedures will help you with ISO 9000 &#10;certification as well.&lt;/p&gt;&lt;p&gt;&lt;b&gt;8. Train Personnel&lt;br /&gt;&lt;/b&gt;Train and retrain your personnel in ESD and your &#10;company’s ESD control program and procedures. Proper training for line personnel &#10;is especially important. They are often the ones who have to live with the &#10;procedures on a day to day basis. A thorough understanding of what is expected &#10;and why will have a significant positive impact on proper long-term &#10;implementation.&lt;/p&gt;&lt;p&gt;&lt;b&gt;9. Review, Audit, Analyze, Report, Feedback, Improve&lt;br /&gt;&lt;/b&gt;Developing and &#10;implementing the program itself is obvious. What might not be so obvious is the &#10;need to continually review, audit, analyze, feedback and improve. You will be &#10;asked to continually identify the return on investment of the program and to &#10;justify the savings realized. Technological changes will dictate improvements &#10;and modifications. Feedback to employees and top management is essential. &#10;Management commitment will need reinforcement.&lt;/p&gt;&lt;p&gt;Remember to provide both reporting and feedback to management, the ESD team, &#10;and other employees. Management will want to know that their investment in time &#10;and money is yielding a return in terms of quality, reliability and profits. &#10;Team members need a pat on the back for a job well done and need to know where &#10;to put their next efforts. Other employees will want to know that the procedures &#10;you have asked them to follow are indeed worthwhile. Conduct periodic &#10;evaluations of your program and audits of your facility. You will find out if &#10;your program is successful and is giving you the expected return. You will spot &#10;weaknesses in the program and shore them up. You will discover whether the &#10;procedures are being followed.&lt;/p&gt;&lt;p&gt;As you find areas that need work, be sure to make the necessary adjustments &#10;to keep the program on track.&lt;/p&gt;&lt;p&gt;Four principles of static control and nine key elements to program &#10;development and implementation: your guideposts for effective ESD control &#10;programs. &lt;br /&gt;In &lt;i&gt;&lt;a href="https://technick.net/guides/electronics/esd/003"&gt;Part &#10;Three&lt;/a&gt;&lt;/i&gt;, we’ll take a close look at specific procedures and materials that &#10;become part of your program. &lt;/p&gt;&lt;b&gt;For Additional Information&lt;/b&gt; &lt;dir&gt;&lt;dir&gt;&lt;p&gt;Dangelmayer, Theodore, &lt;i&gt;ESD Program Management: A Realistic Approach to &#10;Continuous, Measurable Improvement in Static Control&lt;/i&gt;, Van Nostrand Reinhold, &#10;1999.&lt;/p&gt;&lt;p&gt;ESD ADV-2.0-1994, &lt;i&gt;ESD Control Handbook&lt;/i&gt;, ESD Association, Rome, NY.&lt;/p&gt;&lt;p&gt;Halperin, Stephen A., "Facility Evaluation: Isolating Environmental ESD &#10;Issues," &lt;i&gt;EOS/ESD Symposium Proceedings&lt;/i&gt;, 1980, ESD Association, Rome, &#10;NY&lt;/p&gt;&lt;/dir&gt;&lt;/dir&gt;&lt;/blockquote&gt;</description></item><item><title>2.1. WHAT MEMORY LOOKS LIKE</title><link>https://technick.net/guides/hardware/umg/02_001/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/umg/02_001/</guid><description>&lt;hr /&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/hardware/umg/02_000"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/02_002"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt;&lt;a name="TOC"&gt;&lt;/a&gt;&lt;h3&gt;2.1. WHAT MEMORY LOOKS LIKE&lt;/h3&gt;&lt;/p&gt;&lt;p&gt;Memory comes in a variety of sizes and shapes. In general, it looks like a flat green stick with little black cubes on it. Obviously, there's a lot more to memory than that. The illustration below shows a typical memory module and points out some of its most important features.&lt;br /&gt;&lt;br /&gt;&lt;div align="center"&gt;&lt;img src="https://technick.net/img/guide_umg/guide_umg_007.jpg" width="364" height="297" border="0" alt="" /&gt;&lt;br /&gt;A closer look at a 168-pin SDRAM DIMM.&lt;/div&gt;&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;h4&gt;PCB(PRINTED CIRCUIT BOARD)&lt;/h4&gt;The green board that all the memory chips sit on is actually made up of several layers. Each layer contains traces and circuitry, which facilitate the movement of data. In general, higher quality memory modules use PCBs with more layers. The more layers a PCB has, the more space there is between traces. The more space there is between traces, the lesser the chance of noise interference. This makes the module much more reliable. &lt;/p&gt;&lt;p&gt;&lt;h4&gt;DRAM (DYNAMIC RANDOM ACCESS MEMORY)&lt;/h4&gt;DRAM is the most common form of RAM. It's called "dynamic" RAM because it can only hold data for a short period of time and must be refreshed periodically. Most memory chips have black or chrome coating, or packaging, to protect their circuitry. The following section titled "Chip Packaging" shows pictures of chips housed in different types of chip packages. &lt;/p&gt;&lt;p&gt;&lt;h4&gt;CONTACT FINGERS&lt;/h4&gt;The contact fingers, sometimes referred to as "connectors" or "leads," plug into the memory socket on the system board, enabling information to travel from the system board to the memory module and back. On some memory modules, these leads are plated with tin while on others, the leads are made of gold. To learn more about the type of metal on the contacts, refer to the section titled, "Tin versus Gold" on page 67. &lt;/p&gt;&lt;p&gt;&lt;h4&gt;INTERNAL TRACE LAYER&lt;/h4&gt;The magnifying glass shows a layer of the PCB stripped away to reveal the traces etched in the board. Traces are like roads the data travels on. The width and curvature of these traces as well as the distance between them affect both the speed and the reliability of the overall module. Experienced designers arrange, or "lay out," the traces to maximize speed and reliability and minimize interference. &lt;/p&gt;&lt;p&gt;&lt;h4&gt;CHIP PACKAGING&lt;/h4&gt;The term "chip packaging" refers to the material coating around the actual silicon. Today's most common packaging is called TSOP (Thin Small Outline Package). Some earlier chip designs used DIP (Dual In-line Package) packaging and SOJ (Small Outline J-lead). Newer chips, such as RDRAM use CSP (Chip Scale Package). Take a look at the different chip packages below, so you can see how they differ. &lt;/p&gt;&lt;p&gt;&lt;h4&gt;DIP (DUAL IN-LINE PACKAGE)&lt;/h4&gt;When it was common for memory to be installed directly on the computer's system board, the DIP-style DRAM package was extremely popular. DIPs are through-hole components, which means they install in holes extending into the surface of the PCB. They can be soldered in place or installed in sockets.&lt;br /&gt;&lt;div align="center"&gt;&lt;img src="https://technick.net/img/guide_umg/guide_umg_008.jpg" width="170" height="150" border="0" alt="DIP" /&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;h4&gt;SOJ (SMALL OUTLINE J-LEAD)&lt;/h4&gt;SOJ packages got their name because the pins coming out of the chip are shaped like the letter "J". SOJs are surface-mount components - that is, they mount directly onto the surface of the PCB.&lt;br /&gt;&lt;div align="center"&gt;&lt;img src="https://technick.net/img/guide_umg/guide_umg_009.jpg" width="182" height="153" border="0" alt="SOJ" /&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;h4&gt;TSOP (THIN SMALL OUTLINE PACKAGE)&lt;/h4&gt;TSOP packaging, another surface-mount design, got its name because the package was much thinner than the SOJ design. TSOPs were first used to make thin credit card modules for notebook computers.&lt;br /&gt;&lt;div align="center"&gt;&lt;img src="https://technick.net/img/guide_umg/guide_umg_010.jpg" width="187" height="130" border="0" alt="TSOP" /&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;h4&gt;CSP (CHIP SCALE PACKAGE)&lt;/h4&gt;Unlike DIP, SOJ, and TSOP packaging, CSP packaging doesn't use pins to connect the chip to the board. Instead, electrical connections to the board are through a BGA (Ball Grid Array) on the underside of the package. RDRAM (Rambus DRAM) chips utilize this type of packaging.&lt;br /&gt;&lt;div align="center"&gt;&lt;img src="https://technick.net/img/guide_umg/guide_umg_011.jpg" width="379" height="126" border="0" alt="CSP" /&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;h4&gt;CHIP STACKING&lt;/h4&gt;For some higher capacity modules, it is necessary to stack chips on top of one another to fit them all on the PCB. Chips can be "stacked" either internally or externally. "Externally" stacked chip arrangements are visible, whereas "internally" stacked chip arrangements are not.&lt;br /&gt;&lt;div align="center"&gt;&lt;img src="https://technick.net/img/guide_umg/guide_umg_012.jpg" width="357" height="195" border="0" alt="Example of externally stacked chips" /&gt;&lt;br /&gt;Example of externally stacked chips.&lt;/div&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>2.2. WHERE MEMORY COMES FROM</title><link>https://technick.net/guides/hardware/umg/02_002/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/umg/02_002/</guid><description>&lt;hr /&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/hardware/umg/02_001"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/02_003"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt;&lt;a name="TOC"&gt;&lt;/a&gt;&lt;h3&gt;2.2. WHERE MEMORY COMES FROM&lt;/h3&gt;&lt;/p&gt;&lt;p&gt;&lt;h4&gt;MAKING THE CHIP&lt;/h4&gt;Amazing but true: memory starts out as common beach sand. Sand contains silicon, which is the primary component in the manufacture of semiconductors, or "chips." Silicon is extracted from sand, melted, pulled, cut, ground, and polished into silicon wafers. During the chip-making process, intricate circuit patterns are imprinted on the chips through a variety of techniques. Once this is complete, the chips are tested and die-cut. The good chips are separated out and proceed through a stage called "bonding": this process establishes connections between the chip and the gold or tin leads, or pins. Once the chips are bonded, they're packaged in hermetically sealed plastic or ceramic casings. After inspection, they're ready for sale. &lt;/p&gt;&lt;p&gt;&lt;h4&gt;MAKING THE MEMORY MODULE&lt;/h4&gt;This is where memory module manufacturers enter the picture. There are three major components that make up a memory module: the memory chips, PCB, and other "on-board" elements such as resistors and capacitors. Design engineers use CAD (computer aided design) programs to design the PCB. Building a high-quality board requires careful consideration of the placement and the trace length of every signal line. The basic process of PCB manufacture is very similar to that of the memory chips. Masking, layering, and etching techniques create copper traces on the surface of the board. After the PCB is produced, the module is ready for assembly. Automated systems perform surface-mount and through-hole assembly of the components onto the PCB. The attachment is made with solder paste, which is then heated and cooled to form a permanent bond. Modules that pass inspection are packaged and shipped for installation into a computer.&lt;br /&gt;&lt;br /&gt;&lt;div align="center"&gt;&lt;img src="https://technick.net/img/guide_umg/guide_umg_013.jpg" width="577" height="117" border="0" alt="" /&gt;&lt;/div&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>2.3. WHERE MEMORY GOES IN THE COMPUTER</title><link>https://technick.net/guides/hardware/umg/02_003/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/umg/02_003/</guid><description>&lt;hr /&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/hardware/umg/02_002"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/03_000"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt;&lt;a name="TOC"&gt;&lt;/a&gt;&lt;h3&gt;2.3. WHERE MEMORY GOES IN THE COMPUTER&lt;/h3&gt;&lt;/p&gt;&lt;p&gt;Originally, memory chips were connected directly to the computer's motherboard or system board. But then space on the board became an issue. The solution was to solder memory chips to a small modular circuit board - that is, a removable module that inserts into a socket on the motherboard. This module design was called a SIMM (single in-line memory module), and it saved a lot of space on the motherboard. For example, a set of four SIMMs might contain a total of 80 memory chips and take up about 9 square inches of surface area on the motherboard. Those same 80 chips installed flat on the motherboard would take up more than 21 square inches on the motherboard. &lt;br /&gt;&lt;br /&gt;These days, almost all memory comes in the form of memory modules and is installed in sockets located on the system motherboard. Memory sockets are easy to spot because they are normally the only sockets of their size on the board. Because it's critical to a computer's performance for information to travel quickly between memory and the processor(s), the sockets for memory are typically located near the CPU. &lt;/p&gt;</description></item><item><title>20. Newton's Method</title><link>https://technick.net/guides/theory/edft/020/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/edft/020/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/filters/"&gt;Introduction to Digital Filters with Audio Applications&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, Copyright &amp;#169; &lt;i&gt;2017-11-26&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/edft/019"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/000"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/022"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/021"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;Newton's Method&lt;/h3&gt;&lt;p&gt;The &lt;a href="http://mathworld.wolfram.com/Gradient.html" target="_blank"&gt;gradient&lt;/a&gt; method is based on the first-order term in the Taylor&#10;expansion for &lt;!-- MATH&#10; $J({\hat \theta})$&#10; --&gt;&lt;img width="41" height="45" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img400.gif" alt="$J({\" at="" heta="" /&gt;. By taking a second-order term as well and&#10;solving the quadratic minimization problem iteratively, &lt;i&gt;&lt;a href="https://technick.net/guides/theory/edft/020"&gt;Newton's&#10;method&lt;/a&gt;&lt;/i&gt; for &lt;a href="http://mathworld.wolfram.com/Functional.html" target="_blank"&gt;functional&lt;/a&gt; minimization is obtained. Essentially,Newton's method requires the error surface to be close to&lt;i&gt;quadratic&lt;/i&gt;, and its effectiveness is directly tied to the&#10;accuracy of this assumption. For most problems, the error surface can&#10;be well approximated by a quadratic form near the solution. For this&#10;reason, Newton's method tends to give very rapid (``quadratic'')&#10;convergence in the last stages of iteration.&lt;/p&gt;&lt;p&gt;Newton's method is derived as follows: The Taylor expansion of&lt;img width="41" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img453.gif" alt="$J(\" heta="" /&gt; about &lt;img width="14" height="23" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img402.gif" alt="${\" at="" heta="" /&gt; gives&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;J({\hat \theta}^\ast ) = J({\hat \theta}) + J^\prime({\hat \theta}) \left({\hat \theta}^\ast -{\hat \theta}\right)+ \frac{1}{&#10;2}&#10;\left({\hat \theta}^\ast -{\hat \theta}\right)^T {J^{\prime\prime}}\left(\lambda{\hat \theta}^\ast +\overline{\lambda}{\hat \theta}\right)&#10;\left({\hat \theta}^\ast -{\hat \theta}\right),&#10;\end{displaymath}&#10; --&gt;&lt;img width="609" height="50" border="0" src="https://technick.net/img/guide_edft/guide_edft_img454.gif" alt="\" egin="" isplaymath="" hat="" heta="" st="" hat="" heta="" prime="" at="" heta="" ight="" eft="" at="" heta="" st="" at="" heta="" ight="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;for some &lt;!-- MATH&#10; $0\leq\lambda\leq 1$&#10; --&gt;&lt;img width="85" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img380.gif" alt="$0\" eq="" ambda="" eq="" /&gt;,&#10;where &lt;!-- MATH&#10; $\overline{\lambda}\isdef 1-\lambda$&#10; --&gt;&lt;img width="84" height="44" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img455.gif" alt="$\" verline="" ambda="" sdef="" ambda="" /&gt;.&#10;It is now necessary to assume that &#10;&lt;!-- MATH&#10; ${J^{\prime\prime}}\left(\lambda{\hat \theta}^\ast +\overline{\lambda}{\hat \theta}\right)\approx {J^{\prime\prime}}({\hat \theta})$&#10; --&gt;&lt;img width="187" height="46" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img456.gif" alt="${J^{\" rime\prime="" eft="" ambda="" at="" heta="" st="" verline="" ambda="" at="" heta="" ight="" pprox="" prime\prime="" at="" heta="" /&gt;.&#10;Differentiating with respect to &lt;!-- MATH&#10; ${\hat \theta}^\ast$&#10; --&gt;&lt;img width="21" height="23" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img438.gif" alt="${\" at="" heta="" st="" /&gt;, where &lt;!-- MATH&#10; $J({\hat \theta}^\ast )$&#10; --&gt;&lt;img width="48" height="45" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img457.gif" alt="$J({\" at="" heta="" st="" /&gt; is presumed to be&#10;minimum, this becomes&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;0 = 0 + J^\prime({\hat \theta}) + {J^{\prime\prime}}({\hat \theta})&#10;\left({\hat \theta}^\ast -{\hat \theta}\right).&#10;\end{displaymath}&#10; --&gt;&lt;img width="279" height="42" border="0" src="https://technick.net/img/guide_edft/guide_edft_img458.gif" alt="\" egin="" isplaymath="" prime="" at="" heta="" prime\prime="" at="" heta="" eft="" at="" heta="" st="" at="" heta="" ight="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Solving for &lt;!-- MATH&#10; ${\hat \theta}^\ast$&#10; --&gt;&lt;img width="21" height="23" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img438.gif" alt="${\" at="" heta="" st="" /&gt; yields&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;{\hat \theta}^\ast = {\hat \theta}- [{J^{\prime\prime}}({\hat \theta})]^{-1} J^\prime({\hat \theta}).&#10;\end{displaymath}&#10; --&gt;&lt;a name="eq:Newton"&gt;&lt;/a&gt;&lt;a name="eq:Newton"&gt;&lt;/a&gt;&lt;img width="210" height="36" border="0" src="https://technick.net/img/guide_edft/guide_edft_img459.gif" alt="\" egin="" isplaymath="" at="" heta="" st="{\hat" theta="" prime\prime="" at="" heta="" prime="" at="" heta="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Applying Eq.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/edft/020#eq:Newton"&gt;7&lt;/a&gt;) iteratively, we obtain the following.&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;&lt;i&gt;Newton's method&lt;/i&gt;&lt;a name="2818"&gt;&lt;/a&gt; is defined by &lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;{\hat \theta}_{n+1} = {\hat \theta}_n - [{J^{\prime\prime}}({\hat \theta}_n)]^{-1} J^\prime({\hat \theta}_n),&#10;\quad n=1,2,\ldots\,,&#10;\end{displaymath}&#10; --&gt;&lt;a name="eq:NewtonSeq"&gt;&lt;/a&gt;&lt;a name="eq:NewtonSeq"&gt;&lt;/a&gt;&lt;img width="400" height="36" border="0" src="https://technick.net/img/guide_edft/guide_edft_img460.gif" alt="\" egin="" isplaymath="" at="" heta="" hat="" heta="" j="" rime\prime="" ta="" j="" rime="" at="" heta="" quad="" dots="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where &lt;!-- MATH&#10; ${\hat \theta}_0$&#10; --&gt;&lt;img width="21" height="45" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img414.gif" alt="${\" at="" heta="" /&gt; is given as an initial condition.&lt;p&gt;When &lt;!-- MATH&#10; ${J^{\prime\prime}}\left(\lambda{\hat \theta}^\ast +\overline{\lambda}{\hat \theta}\right)= {J^{\prime\prime}}({\hat \theta})$&#10; --&gt;&lt;img width="187" height="46" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img461.gif" alt="${J^{\" rime\prime="" eft="" ambda="" at="" heta="" st="" verline="" ambda="" at="" heta="" ight="" prime\prime="" at="" heta="" /&gt;, the&#10;answer is obtained after the first iteration. In particular, when the&#10;error surface &lt;!-- MATH&#10; $J({\hat \theta})$&#10; --&gt;&lt;img width="41" height="45" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img400.gif" alt="$J({\" at="" heta="" /&gt; is a &lt;i&gt;quadratic form&lt;/i&gt; in &lt;img width="14" height="23" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img402.gif" alt="${\" at="" heta="" /&gt;, Newton's&#10;method produces &lt;!-- MATH&#10; ${\hat \theta}^\ast$&#10; --&gt;&lt;img width="21" height="23" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img438.gif" alt="${\" at="" heta="" st="" /&gt; in one iteration, i.e., &lt;!-- MATH&#10; ${\hat \theta}_1={\hat \theta}^\ast$&#10; --&gt;&lt;img width="63" height="45" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img462.gif" alt="${\" at="" heta="" at="" heta="" st="" /&gt; for&#10;every &lt;!-- MATH&#10; ${\hat \theta}_0$&#10; --&gt;&lt;img width="21" height="45" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img414.gif" alt="${\" at="" heta="" /&gt;.&lt;/p&gt;&lt;p&gt;For Newton's method, there is the following general result on the&#10;existence of a critical point (i.e. a point at which the gradient&#10;vanishes) within a sphere of a &lt;a href="http://mathworld.wolfram.com/BanachSpace.html" target="_blank"&gt;Banach space&lt;/a&gt;.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Theorem. &lt;/b&gt; (Kantorovich)&#10;Let &lt;!-- MATH&#10; ${\hat \theta}_0$&#10; --&gt;&lt;img width="21" height="45" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img414.gif" alt="${\" at="" heta="" /&gt; be a point in &lt;img width="19" height="23" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img401.gif" alt="${\" at="" heta="" /&gt; for which &lt;!-- MATH&#10; $[{J^{\prime\prime}}({\hat \theta}_0)]^{-1}$&#10; --&gt;&lt;img width="84" height="45" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img463.gif" alt="$[{J^{\" rime\prime="" at="" heta="" /&gt; &#10;exists, and set&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;R_0 \isdef \left\|\,[{J^{\prime\prime}}({\hat \theta}_0)]^{-1}{J^\prime}({\hat \theta}_0)\,\right\|.&#10;\end{displaymath}&#10; --&gt;&lt;img width="226" height="42" border="0" src="https://technick.net/img/guide_edft/guide_edft_img464.gif" alt="\" egin="" isplaymath="" isdef="" eft\vert="" prime\prime="" at="" heta="" prime="" at="" heta="" ight\vert="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Let &lt;img width="17" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img378.gif" alt="$S$" /&gt; denote the sphere &lt;!-- MATH&#10; $\{{\hat \theta}\in{\hat \Theta}such that&#10; ||\,{\hat \theta}-{\hat \theta}_0\,|| \leq 2R_0\}$&#10; --&gt;&lt;img width="276" height="45" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img465.gif" alt="$\" hat="" heta="" n="" at="" heta="" uch="" at="" ert\vert="" at="" heta="" at="" heta="" ert\vert="" eq="" /&gt;. Set &lt;!-- MATH&#10; $C_0= ||\,{J^{\prime\prime}}({\hat \theta}_0)\,||$&#10; --&gt;&lt;img width="129" height="45" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img466.gif" alt="$C_0= \" ert\vert="" prime\prime="" at="" heta="" ert\vert="" /&gt;. If there&#10;exists a number&lt;img width="25" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img467.gif" alt="$M$" /&gt; such that &lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\left\|\,{J^{\prime\prime}}({\hat \theta}_1)-{J^{\prime\prime}}({\hat \theta}_2)\,\right\| \leq \frac{M\left\|\,{\hat \theta}_1-{\hat \theta}_2\,\right\|}{ 2},&#10;\end{displaymath}&#10; --&gt;&lt;img width="314" height="61" border="0" src="https://technick.net/img/guide_edft/guide_edft_img468.gif" alt="\" egin="" isplaymath="" eft\vert="" prime\prime="" at="" heta="" prime\p="" eft\vert="" at="" heta="" at="" heta="" ight\vert="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;for &lt;!-- MATH&#10; ${\hat \theta}_1,{\hat \theta}_2$&#10; --&gt;&lt;img width="46" height="45" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img469.gif" alt="${\" at="" heta="" at="" heta="" /&gt; in &lt;img width="17" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img378.gif" alt="$S$" /&gt;, and such that &lt;!-- MATH&#10; $C_0 R_0 M \isdef h_0\leq&#10;1/2$&#10; --&gt;&lt;img width="164" height="44" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img470.gif" alt="$C_0 R_0 M \" sdef="" eq="" /&gt;, then &lt;!-- MATH&#10; ${J^\prime}({\hat \theta})=0$&#10; --&gt;&lt;img width="80" height="45" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img471.gif" alt="${J^\" rime="" at="" heta="" /&gt; for some &lt;img width="14" height="23" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img402.gif" alt="${\" at="" heta="" /&gt; in &lt;img width="17" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img378.gif" alt="$S$" /&gt;, and the Newton&#10;sequence Eq.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/edft/020#eq:NewtonSeq"&gt;7&lt;/a&gt;) converges to it. Furthermore, the rate of&#10;convergence is quadratic, satisfying&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\left\|\,{\hat \theta}^\ast -{\hat \theta}_n\,\right\|\leq 2^{-n+1}(2h_0)^{2^n-1}R_0.&#10;\end{displaymath}&#10; --&gt;&lt;img width="278" height="42" border="0" src="https://technick.net/img/guide_edft/guide_edft_img472.gif" alt="\" egin="" isplaymath="" eft\vert="" at="" heta="" st="" at="" heta="" right\vert\leq="" h="" r="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;b&gt;Proof. &lt;/b&gt;See Goldstein [&lt;a href="https://technick.net/guides/theory/edft/023#Goldstein"&gt;Goldstein&amp;nbsp;1967&lt;/a&gt;], p. 143.&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>21. Maxims of Signal Processing</title><link>https://technick.net/guides/theory/edft/021/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/edft/021/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/filters/"&gt;Introduction to Digital Filters with Audio Applications&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, Copyright &amp;#169; &lt;i&gt;2017-11-26&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/edft/020"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/000"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/022"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/022"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;Maxims of Signal Processing&lt;/h3&gt;&lt;p&gt;&lt;ol&gt;&lt;li&gt;Every technique is equivalent to the same operation, once you&#10;really understand it.&lt;p&gt;&lt;/p&gt;&lt;/li&gt;&lt;li&gt;If one technique is superior to another, it is due to more&#10;averaging.&lt;p&gt;&lt;/p&gt;&lt;/li&gt;&lt;li&gt;With sufficiently sophisticated processing, it is no longer&#10;necessary to have any input data.&lt;p&gt;&lt;/p&gt;&lt;/li&gt;&lt;li&gt;Almost all unusual or interesting results are ultimately found to&#10;be artifacts of the processing.&lt;p&gt;&lt;/p&gt;&lt;/li&gt;&lt;/ol&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>22. Index</title><link>https://technick.net/guides/theory/edft/022/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/edft/022/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/filters/"&gt;Introduction to Digital Filters with Audio Applications&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, Copyright &amp;#169; &lt;i&gt;2017-11-26&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/edft/021"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/000"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/023"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;Index&lt;/h3&gt;&lt;dl compact="compact"&gt;&lt;dt&gt;&lt;strong&gt;&lt;img width="14" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_edft/guide_edft_img1.gif" alt="$z$" /&gt;-transform&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/011#2386"&gt;Convolution Representation&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;&lt;img width="27" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img323.gif" alt="$Lp$" /&gt; &lt;a href="http://mathworld.wolfram.com/topics/Norms.html" target="_blank"&gt;norms&lt;/a&gt;&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/015#2506"&gt;Specific Norms&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;&lt;img width="20" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img355.gif" alt="$lp$" /&gt; norms&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/015#2539"&gt;Specific Norms&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;&lt;a href="https://ccrma.stanford.edu/~jos//log/Logarithms.html" target="_blank"&gt;amplitude&lt;/a&gt; response&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/012#2427"&gt;Frequency Response&lt;/a&gt; | &lt;a href="https://technick.net/guides/theory/edft/012#2440"&gt;Frequency Response&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;&lt;a href="http://mathworld.wolfram.com/BanachSpace.html" target="_blank"&gt;Banach Space&lt;/a&gt;&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/014#2489"&gt;Vector Space Concepts&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;Cauchy sequence&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/014#2492"&gt;Vector Space Concepts&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;&lt;a href="https://technick.net/guides/theory/edft/010"&gt;causal&lt;/a&gt;&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/010#2365"&gt;Difference Equation&lt;/a&gt; | &lt;a href="https://technick.net/guides/theory/edft/015#2537"&gt;Specific Norms&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;Chebyshev norm&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/015#2527"&gt;Specific Norms&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;cluster point&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/016#2602"&gt;Concavity (Convexity)&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;&lt;a href="http://mathworld.wolfram.com/Convex.html" target="_blank"&gt;concave&lt;/a&gt;&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/016#2579"&gt;Concavity (Convexity)&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;&lt;a href="http://mathworld.wolfram.com/ConvexFunction.html" target="_blank"&gt;concave error surface&lt;/a&gt;&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/017#2606"&gt;Concave Norms&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;concave &lt;a href="http://mathworld.wolfram.com/Functional.html" target="_blank"&gt;functional&lt;/a&gt;&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/016#2589"&gt;Concavity (Convexity)&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;concave hull&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/016#2605"&gt;Concavity (Convexity)&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;convergence, existence of minimizer&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/017#2614"&gt;Concave Norms&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;convergence, global&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/017#2611"&gt;Concave Norms&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;&lt;a href="https://technick.net/guides/theory/edft/010"&gt;difference equation&lt;/a&gt;&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/010#2347"&gt;Difference Equation&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;difference equation coefficients&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/010#2357"&gt;Difference Equation&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;&lt;a href="https://technick.net/guides/theory/edft/010"&gt;filter&lt;/a&gt;&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/008#2321"&gt;Introduction to Digital Filter&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;filter coefficients&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/010#2359"&gt;Difference Equation&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;filter delay for amplitude envelopes&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/013#1748"&gt;Phase Delay and Group&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;&lt;a href="https://technick.net/guides/theory/edft/010"&gt;filter order&lt;/a&gt;&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/010#2367"&gt;Difference Equation&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;filter power response&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/012#2442"&gt;Frequency Response&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;filter time delay&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/013#2457"&gt;Phase Delay and Group&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;&lt;a href="https://technick.net/guides/theory/edft/012"&gt;frequency response&lt;/a&gt;&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/012#2423"&gt;Frequency Response&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;Frobenious norm&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/015#2541"&gt;Specific Norms&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;functional&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/016#2582"&gt;Concavity (Convexity)&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;global convergence, conditions for&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/017#2610"&gt;Concave Norms&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;global minimizer&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/016#2599"&gt;Concavity (Convexity)&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;&lt;a href="http://mathworld.wolfram.com/Gradient.html" target="_blank"&gt;gradient&lt;/a&gt;&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/018#2630"&gt;Gradient Descent&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;Gradient Method&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/018#2659"&gt;Gradient Descent&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;&lt;a href="https://technick.net/guides/theory/edft/013"&gt;group delay&lt;/a&gt;&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/013#2462"&gt;Phase Delay and Group&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;Hankel &lt;a href="https://ccrma.stanford.edu/~jos//dft/Matrices.html" target="_blank"&gt;matrix&lt;/a&gt;&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/015#2568"&gt;Specific Norms&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;Hankel norm&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/015#2572"&gt;Specific Norms&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;Hessian&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/018#2693"&gt;Gradient Descent&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;&lt;a href="https://technick.net/guides/theory/edft/010#2321"&gt;impulse&lt;/a&gt;&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/010#2377"&gt;Difference Equation&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;impulse response&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/010#2380"&gt;Difference Equation&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;induced norm&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/015#2546"&gt;Specific Norms&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;linear&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/009#2330"&gt;Linearity and Time-Invariance&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;linear filter&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/009#2325"&gt;Linearity and Time-Invariance&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;linear functional&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/016#2585"&gt;Concavity (Convexity)&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;linear space&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/014#2469"&gt;Vector Space Concepts&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;local minimizer&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/016#2596"&gt;Concavity (Convexity)&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;&lt;a href="https://technick.net/guides/theory/edft/009"&gt;LTI&lt;/a&gt; filters&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/009#2344"&gt;Linearity and Time-Invariance&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;metric space&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/014#2466"&gt;Vector Space Concepts&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;&lt;a href="https://technick.net/guides/theory/edft/020"&gt;Newton's method&lt;/a&gt;&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/020#2818"&gt;Newton's Method&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;norm&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/014#2479"&gt;Vector Space Concepts&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;normed linear space&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/014#2477"&gt;Vector Space Concepts&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;outer disk&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/001#2121"&gt;Positive Real Functions&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;&lt;a href="https://technick.net/guides/theory/edft/013"&gt;phase delay&lt;/a&gt;&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/013#2455"&gt;Phase Delay and Group&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;phase response&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/012#2429"&gt;Frequency Response&lt;/a&gt; | &lt;a href="https://technick.net/guides/theory/edft/012#2446"&gt;Frequency Response&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;phase response at zero frequency&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/013#1742"&gt;Phase Delay and Group&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;&lt;a href="https://technick.net/guides/theory/edft/001"&gt;positive real&lt;/a&gt;&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/001#2116"&gt;Positive Real Functions&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;pseudo-norm&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/014#2484"&gt;Vector Space Concepts&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;real filter&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/010#2361"&gt;Difference Equation&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;root mean square norm&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/015#2518"&gt;Specific Norms&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;&lt;a href="https://technick.net/guides/theory/edft/003"&gt;Schur function&lt;/a&gt;&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/003#2243"&gt;Relation to Schur Functions&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;signal&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/008#2318"&gt;Introduction to Digital Filter&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;spectral norm&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/015#2566"&gt;Specific Norms&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;&lt;a href="https://technick.net/guides/theory/edft/010#2327"&gt;stable&lt;/a&gt;&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/010#2383"&gt;Difference Equation&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;stationary point&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/018#2713"&gt;Gradient Descent&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;strictly concave functional&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/016#2591"&gt;Concavity (Convexity)&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;time-invariant&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/009#2340"&gt;Linearity and Time-Invariance&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;transfer function&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/011#2392"&gt;Convolution Representation&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;uniform norm&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/015#2529"&gt;Specific Norms&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;uniformly concave&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/016#2593"&gt;Concavity (Convexity)&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;weighted &lt;img width="27" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_edft/guide_edft_img323.gif" alt="$Lp$" /&gt; norms&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/edft/015#2511"&gt;Specific Norms&lt;/a&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dl&gt;&lt;/blockquote&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/edft/021"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/000"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/023"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;</description></item><item><title>23. Bibliography</title><link>https://technick.net/guides/theory/edft/023/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/edft/023/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/filters/"&gt;Introduction to Digital Filters with Audio Applications&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, Copyright &amp;#169; &lt;i&gt;2017-11-26&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/edft/022"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/000"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/022"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/024"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;Bibliography&lt;/h3&gt;&lt;dl compact="compact"&gt;&lt;dd&gt;&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="AstromB"&gt; Astrom&amp;nbsp;1970&lt;/a&gt;&lt;dd&gt;Astrom, K.&amp;nbsp;J. 1970.&lt;br /&gt;&lt;em&gt;Introduction to Stochastic &lt;a href="http://mathworld.wolfram.com/ControlTheory.html" target="_blank"&gt;Control Theory&lt;/a&gt;&lt;/em&gt;.&lt;br /&gt;New York: Academic Press.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="Brune"&gt; Brune&amp;nbsp;1931&lt;/a&gt;&lt;dd&gt;Brune, O. 1931.&lt;br /&gt;``Synthesis of a finite two terminal network whose driving point&#10; &lt;a href="https://ccrma.stanford.edu/~jos//book2000/Impedance.html" target="_blank"&gt;impedance&lt;/a&gt; is a prescribed function of frequency.''&lt;br /&gt;&lt;em&gt;Pages 191-236 of:&lt;/em&gt; &lt;em&gt;J. Math. and Phys.&lt;/em&gt;, vol. 10.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="Churchill"&gt; Churchill&amp;nbsp;1960&lt;/a&gt;&lt;dd&gt;Churchill, R.&amp;nbsp;V. 1960.&lt;br /&gt;&lt;em&gt;Complex Variables and Applications&lt;/em&gt;.&lt;br /&gt;New York: McGraw-Hill.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="GeninB"&gt; Genin&amp;nbsp;1981&lt;/a&gt;&lt;dd&gt;Genin, Y. 1981 (Aug).&lt;br /&gt;``An Introduction to the Model Reduction Problem with Hankel &lt;a href="http://mathworld.wolfram.com/topics/Norms.html" target="_blank"&gt;Norm&lt;/a&gt; Criterion.''&lt;br /&gt;&lt;em&gt;In:&lt;/em&gt; &lt;em&gt;Proc. European Conf. Circuit Theory and Design, The&#10; Hague&lt;/em&gt;.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="Goldstein"&gt; Goldstein&amp;nbsp;1967&lt;/a&gt;&lt;dd&gt;Goldstein, A.&amp;nbsp;A. 1967.&lt;br /&gt;&lt;em&gt;Constructive Real Analysis&lt;/em&gt;.&lt;br /&gt;New York: Harper and Row.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="Golub"&gt; Golub and Van Loan&amp;nbsp;1989&lt;/a&gt;&lt;dd&gt;Golub, G.&amp;nbsp;H., and C.&amp;nbsp;F. Van Loan. 1989.&lt;br /&gt;&lt;em&gt;&lt;a href="https://ccrma.stanford.edu/~jos//dft/Matrices.html" target="_blank"&gt;Matrix&lt;/a&gt; Computations, 2nd Edition&lt;/em&gt;.&lt;br /&gt;Baltimore: The Johns Hopkins University Press.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="MG"&gt; Markel and Gray&amp;nbsp;1976&lt;/a&gt;&lt;dd&gt;Markel, J.&amp;nbsp;D., and A.&amp;nbsp;H. Gray. 1976.&lt;br /&gt;&lt;em&gt;Linear Prediction of Speech&lt;/em&gt;.&lt;br /&gt;New York: Springer Verlag.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="Nehari"&gt; Nehari&amp;nbsp;1952&lt;/a&gt;&lt;dd&gt;Nehari, Z. 1952.&lt;br /&gt;&lt;em&gt;Conformal Mapping&lt;/em&gt;.&lt;br /&gt;New York: Dover.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="Ortega"&gt; Ortega&amp;nbsp;1972&lt;/a&gt;&lt;dd&gt;Ortega, J.&amp;nbsp;M. 1972.&lt;br /&gt;&lt;em&gt;Numerical Analysis&lt;/em&gt;.&lt;br /&gt;New York: Academic Press.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="Papoulis"&gt; Papoulis&amp;nbsp;1977&lt;/a&gt;&lt;dd&gt;Papoulis, A. 1977.&lt;br /&gt;&lt;em&gt;Signal Analysis&lt;/em&gt;.&lt;br /&gt;New York: McGraw-Hill.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="RabinerAndGold"&gt; Rabiner and Gold&amp;nbsp;1975&lt;/a&gt;&lt;dd&gt;Rabiner, L.&amp;nbsp;R., and B.&amp;nbsp;Gold. 1975.&lt;br /&gt;&lt;em&gt;Theory and Application of &lt;a href="http://www.dsptutor.freeuk.com/" target="_blank"&gt;Digital Signal Processing&lt;/a&gt;&lt;/em&gt;.&lt;br /&gt;Englewood Cliffs, NJ: Prentice-Hall, Inc.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="RoadsMM"&gt; Roads&amp;nbsp;1989&lt;/a&gt;&lt;dd&gt;Roads, C. (ed). 1989.&lt;br /&gt;&lt;em&gt;The Music Machine&lt;/em&gt;.&lt;br /&gt;Cambridge, MA: MIT Press.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="Royden"&gt; Royden&amp;nbsp;1968&lt;/a&gt;&lt;dd&gt;Royden, H.&amp;nbsp;L. 1968.&lt;br /&gt;&lt;em&gt;Real Analysis&lt;/em&gt;.&lt;br /&gt;New York: Macmillan.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="Rudin"&gt; Rudin&amp;nbsp;1964&lt;/a&gt;&lt;dd&gt;Rudin, W. 1964.&lt;br /&gt;&lt;em&gt;Principles of Mathematical Analysis&lt;/em&gt;.&lt;br /&gt;New York: McGraw-Hill.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="JOSFP"&gt; Smith&amp;nbsp;1985&lt;/a&gt;&lt;dd&gt;Smith, J.&amp;nbsp;O. 1985.&lt;br /&gt;``Introduction to &lt;a href="https://technick.net/guides/theory/edft/000"&gt;Digital Filter Theory&lt;/a&gt;.''.&lt;br /&gt;&lt;em&gt;In:&lt;/em&gt; Strawn, J. (ed), &lt;em&gt;Digital Audio Signal Processing: An&#10; Anthology&lt;/em&gt;.&lt;br /&gt;Los Altos, California: William Kaufmann, Inc. a shortened version&#10; appears in [&lt;a href="https://technick.net/guides/theory/edft/023#RoadsMM"&gt;Roads&amp;nbsp;1989&lt;/a&gt;]. Also available as &lt;a href="http://www.stanford.edu/" target="_blank"&gt;Stanford University&lt;/a&gt; Department&#10; of Music Technical Report STAN-M-20, April 1985.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="MADW"&gt; Smith&amp;nbsp;1987&lt;/a&gt;&lt;dd&gt;Smith, J.&amp;nbsp;O. 1987.&lt;br /&gt;&lt;em&gt;Music Applications of &lt;a href="https://ccrma.stanford.edu/~jos//swgt/Digital_Waveguide.html" target="_blank"&gt;Digital Waveguides&lt;/a&gt;&lt;/em&gt;.&lt;br /&gt;Tech. rept. STAN-M-39. CCRMA, Music Department, &lt;a href="http://www.stanford.edu/" target="_blank"&gt;Stanford University&lt;/a&gt;. a&#10; compendium containing four related papers and presentation overheads on&#10; &lt;a href="https://ccrma.stanford.edu/~jos//swgt/Digital_Waveguide.html" target="_blank"&gt;digital waveguide&lt;/a&gt; reverberation, synthesis, and &lt;a href="https://technick.net/guides/theory/edft/010"&gt;filtering&lt;/a&gt;. CCRMA technical&#10; reports can be ordered by calling (415)723-4971 or by sending an email&#10; request to &lt;a href="mailto:info@ccrma.stanford.edu"&gt;info@ccrma.stanford.edu&lt;/a&gt;.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="VV"&gt;Van Valkenburg&amp;nbsp;1960&lt;/a&gt;&lt;dd&gt;Van Valkenburg, M.&amp;nbsp;E. 1960.&lt;br /&gt;&lt;em&gt;Introduction to Modern Network Synthesis&lt;/em&gt;.&lt;br /&gt;New York: John Wiley and Sons, Inc.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="Williamson"&gt; Williamson &lt;em&gt;et&amp;nbsp;al.&lt;/em&gt;&amp;nbsp;1972&lt;/a&gt;&lt;dd&gt;Williamson, R.&amp;nbsp;E., R.&amp;nbsp;H. Crowell, and H.&amp;nbsp;F. Trotter. 1972.&lt;br /&gt;&lt;em&gt;Calculus of Vector Functions&lt;/em&gt;.&lt;br /&gt;Englewood Cliffs, NJ: Prentice-Hall.&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dl&gt;&lt;/blockquote&gt;</description></item><item><title>24. About this document</title><link>https://technick.net/guides/theory/edft/024/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/edft/024/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/filters/"&gt;Introduction to Digital Filters with Audio Applications&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, Copyright &amp;#169; &lt;i&gt;2017-11-26&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/edft/023"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/000"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/022"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;About this document...&lt;/h3&gt;&lt;p&gt;This document is a new HTML formatted version published by permission of:&lt;br /&gt;&lt;br /&gt;"&lt;a href="https://ccrma.stanford.edu/~jos//filters/" target="_blank"&gt;&lt;b&gt;Elementary Digital Filter Theory&lt;/b&gt;&lt;/a&gt;"&#10; by &lt;a href="https://ccrma.stanford.edu/~jos//" target="_blank"&gt;&lt;b&gt;Julius O. Smith III&lt;/b&gt;&lt;/a&gt;,&lt;br /&gt;Adpated from &lt;strong&gt;"Techniques for &lt;a href="http://www.dsptutor.freeuk.com/dfilt1.html" target="_blank"&gt;Digital Filter&lt;/a&gt;Design and System Identification, with Application to the Violin",&lt;br /&gt;&lt;/strong&gt; Julius O. Smith III, Ph.D. Dissertation, Center for Computer Research in Music and Acoustics (CCRMA), Department&#10;of Electrical Engineering, &lt;a href="http://www.stanford.edu/" target="_blank"&gt;Stanford University&lt;/a&gt;, June 1983...&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Copyright &amp;copy; &lt;i&gt;2000-09-19&lt;/i&gt; by &lt;a href="https://ccrma.stanford.edu/~jos//" target="_blank"&gt; Julius O. Smith III&lt;/a&gt;&lt;/b&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;h4&gt;This document is also available in other formats:&lt;/h4&gt;Download PDF version (filters.pdf)&lt;br /&gt;Download compressed PostScript version (filters.ps.gz)&lt;br /&gt;Order the &lt;a href="https://ccrma.stanford.edu/~jos//ccrmapubs.html" target="_blank"&gt;whole thesis&lt;/a&gt; containing this material.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;h4&gt;Notes from original HTML document (&lt;a href="https://ccrma.stanford.edu/~jos//filters" target="_blank"&gt;https://ccrma.stanford.edu/~jos//filters&lt;/a&gt;):&lt;/h4&gt;&lt;font size="-1"&gt;This document was generated using the&lt;font color="blue"&gt;&lt;strong&gt;LaTeX&lt;/strong&gt;2&lt;tt&gt;HTML&lt;/tt&gt;&lt;/font&gt; translator Version 99.2beta6 (1.42)(patched)&lt;p&gt;Copyright &amp;copy; 1993, 1994, 1995, 1996,&lt;font color="blue"&gt;Nikos Drakos&lt;/font&gt;, &#10;Computer Based Learning Unit, University of Leeds.&lt;br /&gt;Copyright &amp;copy; 1997, 1998, 1999, 2000&lt;font color="blue"&gt;Ross Moore&lt;/font&gt;, &#10;Mathematics Department, Macquarie University, Sydney.&lt;ul&gt;&lt;li&gt;The &lt;strong&gt;Makefiles&lt;/strong&gt; and &lt;strong&gt;.latex2html-init&lt;/strong&gt; file used to generate this website are available at&lt;a href="https://ccrma.stanford.edu/~jos//webpub/" target="_blank"&gt;&lt;font color="blue"&gt;&lt;b&gt;https://ccrma.stanford.edu/~jos//webpub/&lt;/b&gt;&lt;/font&gt;&lt;/a&gt;.&lt;/li&gt;&lt;li&gt;Hypertext links installed from a&#10;&#9; &lt;font color="blue"&gt;master glossary&lt;/font&gt; prepared using the &lt;a href="http://www.opendictionary.org" target="_blank"&gt;&lt;i&gt;&lt;font color="blue"&gt;&lt;b&gt;Open Dictionary&lt;/b&gt;&lt;/font&gt;&lt;/i&gt;&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/p&gt;&lt;/font&gt;.&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>25. Footnotes</title><link>https://technick.net/guides/theory/edft/025/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/edft/025/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/filters/"&gt;Introduction to Digital Filters with Audio Applications&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, Copyright &amp;#169; &lt;i&gt;2017-11-26&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="javascript:parent.main.history.back()"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/000"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/022"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;Footnotes&lt;/h3&gt;&lt;dl&gt;&lt;dt&gt;&lt;a name="foot5368"&gt;...&#10;disk.&lt;/a&gt;&lt;dd&gt;&lt;pre&gt;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&lt;/pre&gt;&lt;dt&gt;&lt;a name="foot5929"&gt;...&#10;sequence&lt;/a&gt;&lt;dd&gt;&lt;pre&gt;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&lt;/pre&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dl&gt;&lt;/blockquote&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="javascript:parent.main.history.back()"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/000"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/edft/022"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;</description></item><item><title>3. An Overview of ESD Control Procedures and Materials</title><link>https://technick.net/guides/electronics/esd/003/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/esd/003/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/electronics/esd/002"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/esd/000"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/esd/004"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;3. An Overview of ESD Control Procedures and Materials&lt;/h3&gt;&lt;p&gt;In &lt;i&gt;&lt;a href="https://technick.net/guides/electronics/esd/002"&gt;Part Two---Principles of &#10;ESD Control&lt;/a&gt;&lt;/i&gt; we introduced four principles of static control and nine key &#10;elements of ESD program development and implementation. In &lt;i&gt;Part Three&lt;/i&gt;, we &#10;will cover some of the primary specific static control procedures and materials &#10;that become part of your program. First, a quick review.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Basic Principles of Static Control&lt;/b&gt;&lt;br /&gt;We suggested that static control &#10;programs become more effective and less complex if we focus on just four basic &#10;principles of static control as follows:&lt;/p&gt;&lt;ol&gt; &lt;li&gt;&lt;b&gt;Design In Immunity&lt;/b&gt; by designing products and assemblies to be as &#10; immune as reasonable from the effects of ESD. &#10; &lt;/li&gt;&lt;li&gt;&lt;b&gt;Eliminate and Reduce Generation&lt;/b&gt; by reducing and eliminating static &#10; generating processes, keeping processes and materials at the same &#10; electrostatic potential, and by providing appropriate ground paths to reduce &#10; charge generation and accumulation. &#10; &lt;/li&gt;&lt;li&gt;&lt;b&gt;Dissipate and Neutralize&lt;/b&gt; by grounding, ionization, and the use of &#10; conductive and dissipative static control materials. &#10; &lt;/li&gt;&lt;li&gt;&lt;b&gt;Protect Products from ESD&lt;/b&gt; with proper grounding or shunting and the &#10; use of static control packaging and materials handling products. &lt;/li&gt;&lt;/ol&gt;&lt;p&gt;In most facilities, our static control efforts center around the last three &#10;principles. In this column we will concentrate on the primary materials and &#10;procedures that eliminate and reduce generation, dissipate and neutralize &#10;charges, or protect sensitive products from ESD.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Identifying the Problem Areas &lt;br /&gt;&lt;/b&gt;You may also recall from our &#10;previous article that we suggested that there were at least nine critical &#10;elements to successfully developing and implementing an effective ESD control &#10;program. Selecting appropriate static control materials and developing and &#10;implementing effective procedures begins with two of these critical &#10;elements:&lt;/p&gt;&lt;ul&gt; &lt;li&gt;Identifying and classifying ESD sensitive items used in your facility. &#10; &lt;/li&gt;&lt;li&gt;Evaluating your facility and processes to determine the areas that need to &#10; be protected. &lt;/li&gt;&lt;/ul&gt;&lt;p&gt;One of the first questions answered with this information is "Which areas of &#10;our facility need ESD protection?" Often you will find that there are more areas &#10;that require protection than you originally thought, usually wherever ESDS &#10;devices are handled. Typical areas requiring ESD protection are shown in Table &#10;1.&lt;/p&gt;&lt;div align="center"&gt;&lt;table cellspacing="2" cellpadding="7" border="1"&gt; &lt;tbody&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;&lt;b&gt;Table 1&lt;br /&gt;&lt;/b&gt;&lt;b&gt;Typical Facility Areas Requiring ESD &#10; Protection&lt;/b&gt; &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;Receiving &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;Inspection &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;Stores and warehouses &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;Assembly &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;Test and inspection &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;Research and development &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;Packaging &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;Field service repair &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;Offices and laboratories &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;Clean rooms &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/tbody&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;b&gt;Personnel and Moving Equipment&lt;/b&gt;&lt;br /&gt;&lt;img height="217" alt="man walking" src="https://technick.net/img/guide_esd/walking3.gif" width="180" border="0" /&gt; &lt;br /&gt;In many facilities, people are one of the prime generators of &#10;static electricity. The simple act of walking around or repairing a board can &#10;generate several thousand volts on the human body. If not properly controlled, &#10;this static charge can easily discharge into a static sensitive device—a human &#10;body model (HBM) discharge.&lt;/p&gt;&lt;p align="right"&gt;&lt;img height="75" alt="ESD" src="https://technick.net/img/guide_esd/esd2.gif" width="89" border="0" /&gt; &lt;/p&gt;&lt;p align="left"&gt;Even in highly automated assembly and test processes, people still &#10;handle static sensitive devices…in the warehouse, in repair, in the lab, in &#10;transport. For this reason, static control programs place considerable emphasis &#10;on controlling personnel generated electrostatic discharge. Similarly, the &#10;movement of carts and other wheeled equipment through the facility also can &#10;generate static charges that can transfer to the products being transported on &#10;this equipment. &lt;/p&gt;&lt;p&gt;&lt;img height="113" alt="wriststrap" src="https://technick.net/img/guide_esd/wstrap1.gif" width="150" border="0" /&gt; &lt;br /&gt;&lt;b&gt;Wrist Straps&lt;/b&gt;&lt;br /&gt;Typically, the primary means of controlling static &#10;charge on personnel is with a wrist strap. When properly worn and connected to &#10;ground, a wrist strap keeps the person wearing it near ground potential. Because &#10;the person and other grounded objects in the work area are at or near the same &#10;potential, there can be no hazardous discharge between them. In addition, static &#10;charges are safely dissipated from the person to ground and do not &#10;accumulate.&lt;/p&gt;&lt;p&gt;Wrist straps have two major components, the cuff that goes around the &#10;person’s wrist and the ground cord that connects the cuff to the common point &#10;ground. Most wrist straps have a current limiting resistor molded into the &#10;ground cord head on the end that connects to the cuff. The resistor most &#10;commonly used is a one megohm, 1/4 watt with a working voltage rating of 250 &#10;volts.&lt;/p&gt;&lt;p&gt;Wrist straps should be tested on a regular basis. Daily testing or continuous &#10;monitoring is recommended.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Floors, Floor Mats, Floor Finishes&lt;br /&gt;&lt;/b&gt;A second method of controlling &#10;electrostatic charge on personnel is with the use of ESD protective floors in &#10;conjunction with ESD control footwear or footstraps. The combination of floor &#10;materials and footwear provides a ground path for the dissipation of &#10;electrostatic charge, thus reducing the charge accumulation on personnel and &#10;other objects to safe levels. In addition to dissipating charge, some floor &#10;materials (and floor finishes) also reduce triboelectric charging. The use of &#10;floor materials is especially appropriate in those areas where increased &#10;personnel mobility is necessary. In addition, floor materials can minimize &#10;charge accumulation on chairs, carts, walking stackers, lift trucks and other &#10;objects that move across the floor. However, those items require dissipative or &#10;conductive casters or wheels to make electrical contact with the floor.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Shoes, Grounders, Casters&lt;br /&gt;&lt;/b&gt;Used in combination with ESD protective &#10;floor materials, static control shoes, grounders, casters and wheels provide the &#10;necessary electrical contact between the person or object and the floor &#10;material. Insulative footwear, casters, or wheels prevent static charges from &#10;flowing from the body to the floor to ground. &lt;/p&gt;&lt;p&gt;&lt;b&gt;Clothing &lt;br /&gt;&lt;/b&gt;Clothing is a consideration in some ESD protective areas, &#10;especially in clean rooms and very dry environments. Clothing materials can &#10;generate electrostatic charges when they contact and separate from other objects &#10;and the clothing itself. These charges may discharge into sensitive components &#10;or create electrostatic fields that may induce charges on the human body. &#10;Although a person may be grounded, that does not mean that insulative clothing &#10;fabrics can dissipate a charge to that person's skin and then to ground. &#10;Clothing usually is electrically insulated or isolated from the body. Grounded &#10;static control garments are intended to minimize the effects of electrostatic &#10;fields or charges that may be present on a person’s clothing.&lt;/p&gt;&lt;p align="center"&gt;&lt;img height="277" alt="Typical Work Station" src="https://technick.net/img/guide_esd/work.gif" width="425" border="1" /&gt;&lt;br /&gt;Figure 1--Typical ESD Workstation&lt;/p&gt;&lt;p align="left"&gt;&lt;b&gt;Workstations and Worksurfaces&lt;/b&gt;&lt;br /&gt;Worksurfaces and &#10;workstations are important parts of an ESD protective program. Many ESDS devices &#10;and assemblies are handled, assembled or repaired at workstations. &lt;/p&gt;&lt;p&gt;An ESD protective workstation refers to the work area of a single individual &#10;that is constructed and equipped with materials and equipment to limit damage to &#10;ESD sensitive items. It may be a stand-alone station in a stockroom, warehouse, &#10;or assembly area, or in a field location such as a computer bay in commercial &#10;aircraft. A workstation also may be located in a controlled area such as a clean &#10;room.&lt;/p&gt;&lt;p&gt;The workstation provides a means for connecting all worksurfaces, fixtures, &#10;handling equipment, and grounding devices to a common point ground. In addition, &#10;there may be provision for connecting additional personal grounding devices, &#10;equipment, and accessories such as constant ground monitors and ionizers. The &#10;key ESD control elements comprising most workstations are a static dissipative &#10;worksurface, a means of grounding personnel (usually a wrist strap), a common &#10;grounding connection, and appropriate signage and labeling. A typical &#10;workstation is shown in Figure 1.&lt;/p&gt;&lt;p&gt;Static protective worksurfaces with a resistance to ground of 106 to 109 &#10;provide a surface that is at the same electrical potential as other ESD &#10;protective items in the workstation. They also provide an electrical path to &#10;ground for the controlled dissipation of any static potentials on materials that &#10;contact the surface. The worksurface also helps define a specific work area in &#10;which ESD sensitive devices may be safely handled. The worksurface is connected &#10;to the common point ground.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Production Equipment and Production Aids&lt;br /&gt;&lt;/b&gt;Although personnel &#10;generated static is typically the primary ESD culprit in many environments, &#10;automated manufacturing and test equipment can also pose an ESD problem. For &#10;example, a device may become charged from sliding down the feeder. If the device &#10;then contacts the insertion head or another conductive surface, a rapid &#10;discharge occurs from the device to the metal object--a Charged Device Model &#10;(CDM) event.&lt;/p&gt;&lt;p&gt;In addition, various production aids may also pose an ESD problem. Production &#10;aids are those materials, tools and fixtures that help to produce finished &#10;products but do not become part of the finished product. Some examples are hand &#10;tools, soldering irons, tapes, solvents, and so forth.&lt;/p&gt;&lt;p&gt;Grounding is the primary means of controlling static charge on many &#10;production aids and equipment. The metal chassis or conductive enclosure of &#10;equipment that uses utility power is required by the National Electrical Code to &#10;be connected to the equipment ground (the green wire) in order to carry fault &#10;currents. This ground connection also will function for ESD purposes. All &#10;electrical tools and equipment used to process ESD sensitive hardware require &#10;the 3 prong grounded type AC plug. Hand tools that are not electrically powered, &#10;i.e., pliers, wire cutters, and tweezers, are usually grounded through the ESD &#10;worksurface and the (grounded) person using the conductive tools. Holding &#10;fixtures should be made of conductive or static dissipative materials when &#10;possible. If a conductive fixture is not sitting on a ESD worksurface or handled &#10;by a grounded person, a separate ground wire may be required. For those items &#10;that are composed of insulative materials, the use of ionization or application &#10;of topical antistats may be required to control generation and accumulation of &#10;static charges.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Packaging and Materials Handling&lt;br /&gt;&lt;/b&gt;Direct protection of ESDS devices &#10;from electrostatic discharge is provided by packaging materials such as bags, &#10;corrugated, and rigid or semi-rigid packages. The primary use of these items is &#10;to protect the product when it leaves the facility, usually when shipped to a &#10;customer. In addition, materials handling products such as tote boxes and other &#10;containers primarily provide protection during inter or intra facility &#10;transport.&lt;/p&gt;&lt;p&gt;The main ESD function of these packaging and materials handling products is &#10;to limit the possible impact of ESD from triboelectric charge generation, direct &#10;discharge, and electrostatic fields. The initial consideration is to have low &#10;charging materials (antistatic) in contact with ESD sensitive items. For &#10;example, the antistatic property would control triboelectric charge resulting &#10;from sliding a board or component into the package or container. A second &#10;requirement is that the material provide protection from direct electrostatic &#10;discharge as well as shield from electrostatic fields.&lt;/p&gt;&lt;p&gt;Many materials are available that provide all three benefits: antistatic, &#10;discharge protection, and electric field suppression. The inside of these &#10;packaging materials have an antistatic layer, but also have an outer layer with &#10;a surface resistance generally in the dissipative range.&lt;/p&gt;&lt;p&gt;A material’s antistatic properties are not necessarily predicted by its &#10;resistance or resistivity. However, resistance or resistivity measurements help &#10;define the material’s ability to provide electrostatic shielding or charge &#10;dissipation. Electrostatic shielding attenuates electrostatic fields on the &#10;surface of a package in order to prevent a difference in electrical potential &#10;from existing inside the package. Electrostatic shielding is provided by &#10;materials that have a surface resistance equal to or less than 1.0 x 10E3 when &#10;tested according to EOS/ESD-S11.11 or a volume resistivity of equal to or less &#10;than 1.0 x 10E3 ohm-cm when tested according to the methods of EIA 541. In &#10;addition, shielding may be provided by packaging materials that provide an air &#10;gap between the package and the product.&lt;/p&gt;&lt;p&gt;Dissipative materials provide charge dissipation characteristics. These &#10;materials have a surface resistance greater than 1.0 x 10E4 but less than or &#10;equal to 1.0 x 10E11 when tested according to EOS/ESD-S11.11 or a volume &#10;resistivity greater than 1.0 x 10E5 ohm-cm but less than or equal to 1.0 x 10E12 &#10;ohm-cm when tested according to the methods of EIA 541. Be aware that the very &#10;wide range of resistance and resistivity results in a wide range of &#10;performance.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Grounding&lt;br /&gt;&lt;/b&gt;In our discussion to this point, we have seen how &#10;important grounding is to effective ESD control. Consequently, effective ESD &#10;grounds are of critical importance in any operation, and ESD grounding should be &#10;clearly defined and regularly evaluated.&lt;/p&gt;&lt;p&gt;ESD Association Standard ANSI EOS/ESD 6.1-&lt;i&gt;Grounding&lt;/i&gt; recommends a &#10;two-step procedure for grounding ESD protective equipment.&lt;/p&gt;&lt;p&gt;The first step is to ground all components of the work area (worksurfaces, &#10;people, equipment, etc.) to the same electrical ground point called the "common &#10;point ground." This common point ground is defined as a "system or method for &#10;connecting two or more grounding conductors to the same electrical &#10;potential."&lt;/p&gt;&lt;p align="left"&gt;&lt;img height="100" alt="Common Ground Point" src="https://technick.net/img/guide_esd/cpground.gif" width="100" align="middle" border="0" /&gt; Figure 2--Common Point Ground Symbol &lt;/p&gt;&lt;p align="left"&gt;This ESD common point ground should be properly identified. ESD &#10;Association standard EOS/ESD S8.1-1993 recommends the use of the symbol in &#10;Figure 2 to identify the common point ground.&lt;/p&gt;&lt;p&gt;The second step is to connect the common point ground to the equipment ground &#10;or the third wire (green) electrical ground connection. This is the preferred &#10;ground connection because all electrical equipment at the workstation is already &#10;connected to this ground. Connecting the ESD control materials or equipment to &#10;the equipment ground brings all components of the workstation to the same &#10;electrical potential. If a soldering iron used to repair an ESDS item were &#10;connected to the electrical ground and the surface containing the ESDS item were &#10;connected to an auxiliary ground, a difference in electrical potential could &#10;exist between the iron and the ESDS item. This difference in potential could &#10;cause damage to the item.&lt;/p&gt;&lt;p&gt;Any auxiliary grounds (water pipe, building frame, ground stake) present and &#10;used at the workstation must be bonded to the equipment ground to minimize &#10;differences in potential between the two grounds.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Ionization&lt;br /&gt;&lt;/b&gt;As we have seen, the primary method of static charge &#10;control is direct connection to ground for conductors, static dissipative &#10;materials, and personnel. However, a complete static control program must also &#10;deal with isolated conductors that cannot be grounded, insulating materials &#10;(e.g., most common plastics). Topical antistats often are used to dissipate &#10;static charges from these items under some circumstances&lt;/p&gt;&lt;p&gt;More frequently, however, air ionization can neutralize the static charge on &#10;insulated and isolated objects by charging the molecules of the gases of the &#10;surrounding air. Whatever static charge is present on objects in the work &#10;environment will be neutralized by attracting opposite polarity charges from the &#10;air. Because it uses only the air that is already present in the work &#10;environment, air ionization may be employed even in clean rooms where chemical &#10;sprays and some static dissipative materials are not usable.&lt;/p&gt;&lt;p&gt;Air ionization is not a replacement for grounding methods. It is one &#10;component of a complete static control program. Ionizers are used when it is not &#10;possible to properly ground everything and as backup to other static control &#10;methods. In clean rooms, air ionization may be one of the few methods of static &#10;control available.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Clean Room Requirements&lt;br /&gt;&lt;/b&gt;While the basic methods of static control &#10;discussed here are applicable in most environments, there are characteristics of &#10;the semiconductor manufacturing process that require special considerations.&lt;/p&gt;&lt;p&gt;Many objects integral to the semiconductor manufacturing process (quartz, &#10;glass, plastic, and ceramic) are inherently charge generating. Because these &#10;materials are insulators, this charge cannot be removed easily by grounding. &#10;Many static control materials contain carbon particles or surfactant additives &#10;that sometimes restrict their use in clean rooms. The need for personnel &#10;mobility and the use of clean room garments often make the use of wrist straps &#10;difficult. In these circumstances, ionization and flooring/footwear systems &#10;become key weapons against static charge.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Identification&lt;br /&gt;&lt;/b&gt;A final element in our static control program is the &#10;use of appropriate symbols to identify static sensitive devices and assemblies, &#10;as well as products intended to control ESD. The traditional symbols &#10;traditionally used to identify ESDS parts or ESD control materials have been &#10;replaced with newer, more appropriate symbols. ESD Association &lt;i&gt;Standard ANSI &#10;ESD S8.1-1993 — ESD Awareness Symbols&lt;/i&gt; provides two symbols for ESD &#10;identification.&lt;/p&gt;&lt;p&gt;Figure 3--ESD Susceptibility Symbol&lt;img height="100" alt="ESD Symbol" src="https://technick.net/img/guide_esd/esdsym21.gif" width="100" align="middle" border="0" /&gt;&lt;/p&gt;&lt;p&gt;The ESD Susceptibility Symbol (Figure 3), consists of a triangle, a reaching &#10;hand, and a slash through the reaching hand. The triangle means "caution" and &#10;the slash through the reaching hand means "Don’t touch." Because of its broad &#10;usage, the hand in the triangle has become associated with ESD and the symbol &#10;literally translates to "ESD sensitive stuff, don’t touch."&lt;/p&gt;&lt;p&gt;The ESD Susceptibility Symbol is applied directly to integrated circuits, &#10;boards, and assemblies that are static sensitive. It indicates that handling or &#10;use of this item may result in damage from ESD if proper precautions are not &#10;taken. If desired, the sensitivity level of the item may be added to the &#10;label.&lt;/p&gt;&lt;p&gt;&lt;img height="75" alt="ESD Symbol" src="https://technick.net/img/guide_esd/esdsym22.gif" width="100" align="middle" border="0" /&gt;Figure 4-- ESD Protective Symbol &lt;/p&gt;&lt;p&gt;The ESD Protective Symbol (Figure 4), consists of the reaching hand in the &#10;triangle. An arc around the triangle replaces the slash. This "umbrella" means &#10;protection. The symbol indicates ESD protective material. It is applied to mats, &#10;chairs, wrist straps, garments, packaging, and other items that provide ESD &#10;protection. It also may be used on equipment such as hand tools, conveyor belts, &#10;or automated handlers that is especially designed or modified to provide ESD &#10;control.&lt;/p&gt;&lt;p&gt;Neither symbol is applied on ESD test equipment, footwear checkers, wrist &#10;strap testers, resistance or resistivity meters or similar items that are used &#10;for ESD purposes, but which do not provide actual protection.&lt;/p&gt;&lt;p&gt;&lt;a href="http://www.esda.org/standards.php#symbols" target="_blank"&gt;Click here to download &#10;copies of these two symbols or the common point ground symbol.&lt;/a&gt;&lt;/p&gt;&lt;p&gt;&lt;b&gt;Summary&lt;br /&gt;&lt;/b&gt;Effective static control programs require a variety of &#10;procedures and materials. In this column, we have provided a brief overview of &#10;the most commonly used elements of a program. Additional in-depth discussion of &#10;individual materials and procedures can be found in publications such as the ESD &#10;Handbook published by the ESD Association.&lt;/p&gt;&lt;p&gt;Your program is up and running. How do you determine whether it is effective? &#10;How do you make sure your employees follow it? In &lt;i&gt;&lt;a href="https://technick.net/guides/electronics/esd/004"&gt;Part 4&lt;/a&gt;&lt;/i&gt;, we will cover the &#10;topics of Auditing and Training.&lt;/p&gt;&lt;p&gt;&lt;b&gt;For Additional Information&lt;/b&gt;&lt;/p&gt;&lt;p align="justify"&gt;&lt;a href="http://www.esda.org/standards.php" terget="_blank"&gt;ESD Association &#10;Standards&lt;/a&gt;&lt;/p&gt;&lt;ul&gt; &lt;li&gt;&lt;i&gt;ESD-STM1.1—Evaluation, Acceptance, and Functional Testing of Wrist &#10; Straps.&lt;/i&gt; &#10; &lt;/li&gt;&lt;li&gt;&lt;i&gt;ANSI EOS/ESD S3.1—Ionization &lt;/i&gt; &lt;/li&gt;&lt;li&gt;&lt;i&gt;ESD STM 4.1 (Revised)--ESD Protective Worksurfaces—Resistance &#10; Measursements&lt;/i&gt; &#10; &lt;/li&gt;&lt;li&gt;&lt;i&gt;ESD STM4.2—Worksurfaces - Charge Dissipation Characteristics&lt;/i&gt; &#10; &lt;/li&gt;&lt;li&gt;&lt;i&gt;ANSI EOS/ESD S6.1—Grounding -- Recommended Practice&lt;/i&gt; &#10; &lt;/li&gt;&lt;li&gt;&lt;i&gt;ANSI ESD S7.1—Floor Materials — Resistive Characterization of Materials &#10; &lt;/i&gt; &lt;/li&gt;&lt;li&gt;&lt;i&gt;ANSI ESD S8.1—ESD Awareness Symbols&lt;/i&gt; &#10; &lt;/li&gt;&lt;li&gt;&lt;i&gt;ESD S9.1—Resistive Characterization of Footwear&lt;/i&gt; &#10; &lt;/li&gt;&lt;li&gt;&lt;i&gt;ANSI ESD S11.11—Surface Resistance Measurement of Static Dissipative &#10; Planar Materials &lt;/i&gt; &lt;/li&gt;&lt;li&gt;&lt;i&gt;ANSI ESD S11.31—Evaluating the Performance of Electrostatic Discharge &#10; Shielding Bags&lt;/i&gt; &#10; &lt;/li&gt;&lt;li&gt;&lt;i&gt;ANSI/ESD 20.20—Electrostatic Discharge Control Program&lt;/i&gt; &#10; &lt;/li&gt;&lt;li&gt;&lt;i&gt;ESD STM2.1—Garments&lt;/i&gt; &#10; &lt;/li&gt;&lt;li&gt;&lt;i&gt;ESD STM12.1—Seating-Resistive Characterization&lt;/i&gt; &#10; &lt;/li&gt;&lt;li&gt;&lt;i&gt;ESD STM97.1—Floor Materials and Footwear – Resistance Measurement in &#10; Combination with a Person.&lt;/i&gt; &#10; &lt;/li&gt;&lt;li&gt;&lt;i&gt;ESD STM97.2-1999&lt;/i&gt;—&lt;i&gt;Floor Materials and Footwear – Voltage &#10; Measurement in Combination with a Person.&lt;/i&gt; &#10; &lt;/li&gt;&lt;li&gt;&lt;i&gt;ESD DSP 3.3—Periodic Verification of Air Ionizers&lt;/i&gt; &#10; &lt;/li&gt;&lt;li&gt;&lt;i&gt;ESD ADV53.1— ESD Protective Workstations&lt;/i&gt; &#10; &lt;/li&gt;&lt;li&gt;&lt;i&gt;ESD ADV2.0--ESD Handbook&lt;/i&gt; &lt;/li&gt;&lt;/ul&gt;&lt;p&gt;&lt;b&gt;Other Standards&lt;/b&gt;&lt;/p&gt;&lt;ul&gt; &lt;li&gt;&lt;i&gt;EIA-541, Packaging of Electronic Products for Shipment&lt;/i&gt;, &lt;a target="_blank" href="http://www.eia.org/" target="_blank"&gt;Electronic Industries Alliance&lt;/a&gt; &#10; &lt;/li&gt;&lt;/ul&gt;&lt;/blockquote&gt;</description></item><item><title>3. HOW MEMORY WORKS</title><link>https://technick.net/guides/hardware/umg/03_000/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/umg/03_000/</guid><description>&lt;hr /&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/hardware/umg/02_003"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/03_001"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt;&lt;a name="TOC"&gt;&lt;/a&gt;&lt;h3&gt;3. HOW MEMORY WORKS&lt;/h3&gt;&lt;/p&gt;&lt;p&gt;Earlier, we talked about how memory holds information in a place where the CPU can get to it quickly. Let's look at that process in more detail. &lt;br /&gt;&lt;br /&gt;&lt;ul&gt;&lt;li&gt;&lt;a href="https://technick.net/guides/hardware/umg/03_001"&gt;3.1. HOW MEMORYWORKS WITH THE PROCESSOR&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href="https://technick.net/guides/hardware/umg/03_002"&gt;3.2. MAXIMIZING PERFORMANCE&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/p&gt;&lt;/blockquote&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/hardware/umg/02_003"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/03_001"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;</description></item><item><title>3.1. HOW MEMORYWORKS WITH THE PROCESSOR</title><link>https://technick.net/guides/hardware/umg/03_001/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/umg/03_001/</guid><description>&lt;hr /&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/hardware/umg/03_000"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/03_002"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt;&lt;a name="TOC"&gt;&lt;/a&gt;&lt;h3&gt;3.1. HOW MEMORYWORKS WITH THE PROCESSOR&lt;/h3&gt;&lt;/p&gt;&lt;p&gt;&lt;div align="center"&gt;&lt;img src="https://technick.net/img/guide_umg/guide_umg_015.jpg" width="465" height="358" border="0" alt="" /&gt;&lt;br /&gt;&lt;br /&gt;Main components of a computer system.&lt;/div&gt;&lt;/p&gt;&lt;p&gt;The CPU is often referred to as the brain of the computer. This is where all the actual computing is done. &lt;/p&gt;&lt;p&gt;The chipset supports the CPU. It usually contains several "controllers" which govern how information travels between the processor and other components in the system. Some systems have more than one chipset. &lt;/p&gt;</description></item><item><title>3.2. MAXIMIZING PERFORMANCE</title><link>https://technick.net/guides/hardware/umg/03_002/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/umg/03_002/</guid><description>&lt;hr /&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/hardware/umg/03_001"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/04_000"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt;&lt;a name="TOC"&gt;&lt;/a&gt;&lt;h3&gt;3.2. MAXIMIZING PERFORMANCE&lt;/h3&gt;&lt;/p&gt;&lt;p&gt;Computer processor speeds have been increasing rapidly over the past several years. Increasing the speed of the processor increases the overall performance of the computer. However, the processor is only one part of the computer, and it still relies on other components in a system to complete functions. Because all the information the CPU will process must be written to or read from memory, the overall performance of a system is dramatically affected by how fast information can travel between the CPU and main memory.&lt;br /&gt;&lt;br /&gt;So, faster memory technologies contribute a great deal to overall system performance. But increasing the speed of the memory itself is only part of the solution. The time it takes for information to travel between memory and the processor is typically longer than the time it takes for the processor to perform its functions. The technologies and innovations described in this section are designed to speed up the communication process between memory and the processor.&lt;/p&gt; &lt;p&gt;&lt;h4&gt;CACHE MEMORY&lt;/h4&gt;Cache memory is a relatively small amount (normally less than 1MB) of high speed memory that resides very close to the CPU. Cache memory is designed to supply the CPU with the most frequently requested data and instructions. Because retriev-ing data from cache takes a fraction of the time that it takes to access it from main memory, having cache memory can save a lot of time. If the information is not in cache, it still has to be retrieved from main memory, but checking cache memory takes so little time, it's worth it. This is analogous to checking your refrigerator for the food you need before running to the store to get it: it's likely that what you need is there; if not, it only took a moment to check.&lt;br /&gt;&lt;br /&gt;The concept behind caching is the "80/20" rule, which states that of all the programs, information, and data on your computer, about 20% of it is used about 80% of the time. (This 20% data might include the code required for sending or deleting email, saving a file onto your hard drive, or simply recognizing which keys you've touched on your keyboard.) Conversely, the remaining 80% of the data in your system gets used about 20% of the time. Cache memory makes sense because there's a good chance that the data and instructions the CPU is using now will be needed again. &lt;/p&gt;&lt;p&gt;&lt;h4&gt;HOW CACHE MEMORY WORKS&lt;/h4&gt;Cache memory is like a "hot list" of instructions needed by the CPU. The memory controller saves in cache each instruction the CPU requests; each time the CPU gets an instruction it needs from cache - called a "cache hit" - that instruction moves to the top of the "hot list." When cache is full and the CPU calls for a new instruction, the system overwrites the data in cache that hasn't been used for the longest period of time. This way, the high priority information that's used continuously stays in cache, while the less frequently used information drops out. &lt;/p&gt;&lt;p&gt;&lt;h4&gt;LEVELS OF CACHE&lt;/h4&gt;Today, most cache memory is incorporated into the processor chip itself; however, other configurations are possible. In some cases, a system may have cache located inside the processor, just outside the processor on the motherboard, and/or it may have a memory cache socket near the CPU, which can contain a cache memory module. Whatever the configuration, any cache memory component is assigned a "level" according to its proximity to the processor. For example, the cache that is closest to the processor is called Level 1 (L1) Cache, the next level of cache is numbered L2, then L3, and so on. Computers often have other types of caching in addition to cache memory. For example, sometimes the system uses main memory as a cache for the hard drive. While we won't discuss these scenarios here, it's important to note that the term cache can refer specifically to memory and to other storage technologies as well.&lt;br /&gt;&lt;br /&gt;You might wonder: if having cache memory near the processor is so beneficial, why isn't cache memory used for all of main memory? For one thing, cache memory typically uses a type of memory chip called SRAM (Static RAM), which is more expensive and requires more space per megabyte than the DRAM typically used for main memory. Also, while cache memory does improve overall system performance, it does so up to a point. The real benefit of cache memory is in storing the most frequently-used instructions. A larger cache would hold more data, but if that data isn't needed frequently, there's little benefit to having it near the processor.&lt;br /&gt;&lt;br /&gt;It can take as long as 195ns for main memory to satisfy a memory request from the CPU. External cache can satisfy a memory request from the CPU in as little as 45ns. &lt;div align="center"&gt;&lt;img src="https://technick.net/img/guide_umg/guide_umg_019.jpg" width="346" height="281" border="0" alt="" /&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;h4&gt;SYSTEM BOARD LAYOUT&lt;/h4&gt;As you've probably figured out, the placement of memory modules on the system board has a direct effect on system performance. Because local memory must hold all the information the CPU needs to process, the speed at which the data can travel between memory and the CPU is critical to the overall performance of the system. And because exchanges of information between the CPU and memory are so intricately timed, the distance between the processor and the memory becomes another critical factor in performance. &lt;/p&gt;&lt;p&gt;&lt;h4&gt;INTERLEAVING&lt;/h4&gt;The term interleaving refers to a process in which the CPU alternates communication between two or more memory banks. Interleaving technology is typically used in larger systems such as servers and workstations. Here's how it works: every time the CPU addresses a memory bank, the bank needs about one clock cycle to "reset" itself. The CPU can save processing time by addressing a second bank while the first bank is resetting. Interleaving can also function within the memory chips themselves to improve performance. For example, the memory cells inside SDRAM chip are divided into two independent cell banks, which can be activated simultaneously. Interleaving between the two cell banks produces a continuous flow of data. This cuts down the length of the memory cycle and results in faster transfer rates. &lt;/p&gt;&lt;p&gt;&lt;h4&gt;BURSTING&lt;/h4&gt;Bursting is another time-saving technology. The purpose of bursting is to provide the CPU with additional data from memory based on the likelihood that it will be needed. So, instead of the CPU retrieving information from memory one piece of at a time, it grabs a block of information from several consecutive addresses in memory. This saves time because there's a statistical likelihood that the next data address the processor will request will be sequential to the previous one. This way, the CPU gets the instructions it needs without having to send an individual request for each one. Bursting can work with many different types of memory and can function when reading or writing data.&lt;br /&gt;&lt;br /&gt;Both bursting and pipelining became popular at about the same time that EDO technology became available. EDO chips that featured these functions were called "Burst EDO" or "Pipeline Burst EDO" chips. &lt;/p&gt;&lt;p&gt;&lt;h4&gt;PIPELINING&lt;/h4&gt;Pipelining is a computer processing technique where a task is divided into a series of stages with some of the work completed at each stage. Through the division of a larger task into smaller, overlapping tasks, pipelining is used to improve performance beyond what is possible with non-pipelined processing. Once the flow through a pipeline is started, execution rate of the instructions is high, in spite of the number of stages through which they progress. &lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>4. Auditing and Training</title><link>https://technick.net/guides/electronics/esd/004/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/esd/004/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/electronics/esd/003"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/esd/000"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/esd/005"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;4. Auditing and &#10;Training&lt;/h3&gt;&lt;p&gt;Your static control program is up and running. How do you determine whether &#10;it is effective? How do you make sure your employees follow it? Previously, we &#10;suggested that there were at least nine critical elements to successfully &#10;developing and implementing an effective ESD control program. In &lt;i&gt;Part &#10;Four&lt;/i&gt;, we will focus on two more of these elements: training and &#10;auditing.&lt;/p&gt;&lt;p align="center"&gt;&lt;b&gt;Personnel Training&lt;/b&gt;&lt;/p&gt;&lt;p align="left"&gt;&lt;b&gt;&lt;/b&gt;The procedures are in place. The materials are in use. But, &#10;your ESD control program just does not seem to yield the expected results. &#10;Failures declined initially, but they have begun reversing direction. Or perhaps &#10;there was little improvement at all. The solutions might not be apparent in &#10;inspection reports of incoming ESD materials. Nor in the wrist strap log-in &#10;sheets. Sometimes simply turning the pages of the calendar will provide &#10;significant clues. When was the last time your employees attended an ESD &#10;training program? In fact, have your employees been trained at all?&lt;/p&gt;&lt;p&gt;In large companies or small, it is hard to underestimate the role of training &#10;in an ESD control program. There is significant evidence to support the &#10;contribution of training to the success of the program (References 1, 5, 9, 10, &#10;14, 15, 16). We would not send employees to the factory floor without the proper &#10;soldering skills or the knowledge to operate the automated insertion equipment. &#10;We should provide them with the same skill level regarding ESD control &#10;procedures.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Elements of Effective Training Programs &lt;br /&gt;&lt;/b&gt;Although individual &#10;requirements cause training programs to vary from company to company, there are &#10;several common threads that run through the successful programs.&lt;/p&gt;&lt;p&gt;&lt;b&gt;&lt;u&gt;1 -- Successful training programs cover all affected employees. &lt;br /&gt;&lt;/u&gt;&lt;/b&gt;Obviously we train the line employees who test their wrist straps or &#10;place finished products in static protective packaging. But we also include &#10;department heads, upper management, and executive personnel in the process. &#10;Typically they are responsible for the day-to-day supervision and administration &#10;of the program or they provide leadership and support. The training will vary &#10;for these different groups, but awareness and understanding at all levels is &#10;key. &lt;/p&gt;&lt;p&gt;&lt;b&gt;&lt;u&gt;2 -- Effective training is comprehensive and &#10;consistent.&lt;br /&gt;&lt;/u&gt;&lt;/b&gt;Training not only covers specific procedures, but also &#10;the physics of the problem and the benefits of the program as well. Consistent &#10;content across various groups, plants, and even countries (adjusted for cultural &#10;differences, of course) reduces confusion and helps assure conformance.&lt;/p&gt;&lt;p&gt;&lt;b&gt;&lt;u&gt;3 -- Use a variety of training tools and techniques. &lt;br /&gt;&lt;/u&gt;&lt;/b&gt;Combine live instruction with training videos or interactive CD-ROM &#10;programs. Effective training involves employees in the process. Reinforce the &#10;message with demonstrations of ESD events and their impact. Bulletin boards, &#10;newsletters, and posters provide additional reminders and reinforcement.&lt;/p&gt;&lt;p&gt;&lt;b&gt;&lt;u&gt;4 -- Test, certify and retrain.&lt;br /&gt;&lt;/u&gt;&lt;/b&gt;Your training should assure &#10;material retention and emphasize the importance of the effort. If properly &#10;implemented, testing and certification motivates and builds employee pride. &#10;Retraining is an ongoing process that reinforces, reminds, and provides &#10;opportunities for implementing new or improved procedures. &lt;/p&gt;&lt;p&gt;&lt;b&gt;&lt;u&gt;5 -- Feedback, auditing, and measurement.&lt;br /&gt;&lt;/u&gt;&lt;/b&gt;Motivate and &#10;provide the mechanism for program improvement. Sharing yield or productivity &#10;data with employees demonstrates the effectiveness of the program and of their &#10;efforts. Tracking these same numbers can indicate that it’s time for retraining &#10;or whether modifications are required in the training program.&lt;/p&gt;&lt;p&gt;Design and delivery of an effective ESD training program can be just as &#10;important as the procedures and materials used in your ESD control program. A &#10;training program that is built on identifiable and measurable performance goals &#10;helps assure employee understanding, implementation and success.&lt;/p&gt;&lt;p align="center"&gt;&lt;b&gt;Auditing&lt;/b&gt;&lt;/p&gt;&lt;p&gt;Developing and implementing an ESD control program itself is obvious. What &#10;might not be so obvious is the need to continually review, audit, analyze, &#10;feedback and improve. You will be asked to continually identify the program’s &#10;return on investment and to justify the savings realized. Technological changes &#10;will dictate improvements and modifications. Feedback to employees and top &#10;management is essential. Management commitment will need reinforcement.&lt;/p&gt;&lt;p&gt;Like training, regular auditing becomes a key ingredient in the successful &#10;management of ESD control programs. The mere presence of the auditing process &#10;spurs compliance with program procedures. It helps strengthen management’s &#10;commitment. Audit reports trigger corrective action and help foster continuous &#10;improvement.&lt;/p&gt;&lt;p&gt;The benefits to be gained from regular auditing of our ESD control procedures &#10;are numerous. They allow us to prevent problems before they occur rather than &#10;always fighting fires. They allow us to readily identify problems and take &#10;corrective action. They identify areas in which our programs may be weak and &#10;provide us with information required for continuous improvement. They allow us &#10;to leverage limited resources effectively. They help us determine when our &#10;employees need to be retrained. They help us improve yields, productivity, and &#10;capacity. And they help us bind our ESD program together into a successful &#10;effort.&lt;/p&gt;&lt;p&gt;An ESD audit measures performance to the defined standards and procedures of &#10;the ESD control program. Typically, we think of an ESD audit as a periodic &#10;review and inspection of the ESD work area covering use of the correct packaging &#10;materials, wearing of wrist straps, following defined procedures, and similar &#10;items. However, a good audit program is a bit more complicated.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Types of Audits&lt;br /&gt;&lt;/b&gt;There are several types of ESD audits: the &lt;i&gt;work &#10;place&lt;/i&gt; audit, &lt;i&gt;program management &lt;/i&gt;audits, and &lt;i&gt;quality process&lt;/i&gt; &#10;checking. Each type is distinctively different and each is vitally important to &#10;the success of the ESD program&lt;/p&gt;&lt;p&gt;&lt;i&gt;Program management&lt;/i&gt; audits measure how well a program is managed and &#10;how strong management commitment is. The program management audit emphasizes &#10;factors such as the existence of an effective implementation plan, realistic &#10;program requirements, ESD training programs, regular audits, and other critical &#10;factors of program management. The program management audit typically is &#10;conducted by a survey specifically tailored to the factors being reviewed. &#10;Because it’s a survey, the audit can be conducted without actually visiting the &#10;site. The results of this audit indirectly measure work place compliance and are &#10;particularly effective as a means of self-assessment for small companies as well &#10;as large global corporations.&lt;/p&gt;&lt;p&gt;&lt;i&gt;Quality process&lt;/i&gt; checking applies classical statistical quality control &#10;procedures to the ESD process and is performed by operations personnel. This is &#10;not a periodic audit, but rather daily maintenance of the program. Visual and &#10;electrical checks of the procedures and materials, wrist strap testing for &#10;example, are used to monitor the quality of the ESD control process. Checking is &#10;done on a daily, weekly or monthly basis.&lt;/p&gt;&lt;p&gt;Trend charts and detailed records trigger process adjustments and corrective &#10;action. They help assure that specified procedures are followed on a regular &#10;basis. The records are essential for quality control purposes, corrective action &#10;and compliance with ISO-9000.&lt;/p&gt;&lt;p&gt;&lt;i&gt;Work area&lt;/i&gt; audits verify that program procedures are followed and that &#10;ESD control materials and equipment are within specification or are functioning &#10;properly. Audits are performed on a regular basis, often monthly, and utilize &#10;sampling techniques and statistical analysis of the results. The use of detailed &#10;checklists and a single auditor assures that all items are covered and that the &#10;audits are performed consistently over time.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Basic Auditing Instrumentation&lt;br /&gt;&lt;/b&gt;Special instrumentation will be &#10;required to conduct work area audits. The specific instrumentation will depend &#10;on what you are trying to measure, the precision you require and the &#10;sophistication of your static control and material evaluation program. However, &#10;as a minimum, you will need an &lt;i&gt;electrostatic field meter&lt;/i&gt;, a &lt;i&gt;wide range &#10;resistance meter&lt;/i&gt;, a&lt;i&gt; ground/circuit tester,&lt;/i&gt; and appropriate electrodes &#10;and accessories. Additional instrumentation might include a charge plate &#10;monitor, footwear and wrist strap testers, chart recorders and timing devices, &#10;discharge simulators, and ESD event detectors&lt;i&gt;.&lt;/i&gt;&lt;/p&gt;&lt;p&gt;Although this equipment must be accurate, it need not be as sophisticated as &#10;laboratory instruments. The audit is intended to verify basic functions and not &#10;as a full qualification of ESD control equipment or materials. Remember, you &#10;want the right tool for job. Just as you would not buy a hammer if you are were &#10;planning to saw wood, you would not purchase an electrometer to measure static &#10;voltages on a production line. If you are making measurements according to &#10;specific standards, be sure the instrumentation meets the specifications of &#10;these standards.&lt;/p&gt;&lt;p&gt;With a hand held&lt;i&gt; &lt;/i&gt;&lt;b&gt;electrostatic field meter, &lt;/b&gt;you can measure the &#10;presence of electrostatic charge in your environment allowing you to identify &#10;problem areas and monitor your ESD control program. These instruments measure &#10;the electrostatic field associated with a charged object. Many field meters &#10;simply measure the gross level of the electrostatic field and should be used as &#10;general indicators of the presence of a charge and the approximate level of this &#10;charge. Others will provide more precise measurement for material evaluation and &#10;comparison.&lt;/p&gt;&lt;p&gt;For greater precision in facility measurements or for laboratory evaluation, &#10;a &lt;b&gt;charge plate monitor&lt;/b&gt; can be attached to some field meters or connected &#10;to a voltmeter in the laboratory. With these additional tools you can evaluate &#10;the performance of flooring materials or balance ionizing equipment, for &#10;example.&lt;/p&gt;&lt;p&gt;Because resistance is one of the key factors in evaluating ESD control &#10;materials, a wide range &lt;b&gt;resistance meter&lt;/b&gt; becomes a crucial instrument. &#10;Most resistance measurements are made at 100 volts, and some at 10 volts. The &#10;equipment you choose should be capable of applying these voltages to the &#10;materials being tested. In addition, the meter should be capable of measuring &#10;resistance ranges of 10&lt;sup&gt;5&lt;/sup&gt; to 10&lt;sup&gt;11&lt;/sup&gt; ohms. With the proper &#10;electrodes and cables, you will be able to measure the resistance of flooring &#10;materials, worksurfaces, equipment, furniture, garments, and some packaging &#10;materials.&lt;/p&gt;&lt;p&gt;The final instrument is a &lt;b&gt;ground/circuit tester.&lt;/b&gt; With this device you &#10;can measure the continuity of your ESD grounds and also check the impedance as &#10;well as neutral to ground shorts.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Areas, Processes, and Materials to be Audited&lt;br /&gt;&lt;/b&gt;In our last column we &#10;stated that ESD protection was required wherever "wherever ESDS devices are &#10;handled." Obviously, our audits need to include these same areas. Table 1 &#10;indicates some of the physical areas that require ESD protection and auditing of &#10;the program.&lt;/p&gt;&lt;div align="center"&gt;&lt;table cellspacing="2" cellpadding="7" border="1"&gt; &lt;tbody&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;&lt;b&gt;Table 1&lt;br /&gt;Typical Facility Areas To Be &#10; Audited&lt;/b&gt;&lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;Receiving &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;Inspection &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;Stores and Warehouses &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;Assembly &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;Test and Inspection &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;Research and Development &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;Packaging &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;Field Service Repair &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;Offices and Laboratories &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;Clean Rooms &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/tbody&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;Similarly, we need to conduct work area and program management audits all of &#10;the various processes, materials, and procedures that are used in our ESD &#10;control programs. Some of these are shown in Table 2.&lt;/p&gt;&lt;div align="center"&gt;&lt;table cellspacing="2" cellpadding="7" border="1"&gt; &lt;tbody&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;&lt;b&gt;Table 2&lt;br /&gt;Typical Processes, Materials and Procedures &#10; &lt;br /&gt;To Be Audited&lt;/b&gt; &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;Personnel &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;Moving Equipment (Carts, lift trucks) &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;Wrist Straps &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;Floors, Floor Mats, Floor Finishes &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;Shoes, Grounders, Casters &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;Clothing &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;Workstations &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;Worksurfaces &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;Packaging and Materials Handling &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;Ionization &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;Grounding &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;Production Equipment &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;Production Aids (Soldering irons, fixtures, etc.) &#10; &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;Labeling and Identification &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;Purchasing Specifications and Requisitions &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;ESD Control Program Procedures and Specifications &#10; &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;ESD Measurement and Test Equipment &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;Personnel Training &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;Engineering Specifications and Drawings &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/tbody&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;b&gt;Check Lists&lt;br /&gt;&lt;/b&gt;Check lists can be helpful tools for conducting work &#10;place and program audits. However, it is important that ESD control program &#10;requirements are well documented and accessible to avoid a tendency for &#10;checklists becoming &lt;i&gt;de facto&lt;/i&gt; lists of requirements. Table 3 indicates the &#10;type of questions and information that might be included in an auditing check &#10;list. Your own check lists, of course, will be based on your specific needs and &#10;program requirements. They should conform to your actual ESD control procedures &#10;and specifications and they should be consistent with any requirements you may &#10;have for ISO 9000.&lt;/p&gt;&lt;p&gt;In addition to check lists, you will use various forms for recording the &#10;measurements you make: resistance, voltage generation, etc. Part of your audit &#10;will also include the daily logs used on the factory floor such as those used &#10;for wrist strap checking.&lt;/p&gt;&lt;table cellspacing="2" cellpadding="5" border="1"&gt; &lt;tbody&gt; &lt;tr&gt; &lt;td colspan="4"&gt; &lt;p align="center"&gt;&lt;b&gt;Table 3&lt;br /&gt;Sample Audit Check List&lt;br /&gt;ESD Control &#10; Program&lt;/b&gt;&lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td colspan="4"&gt; &lt;dir&gt; &lt;p&gt;&lt;b&gt;Function/Area Audited: &lt;/b&gt;Personnel &lt;/p&gt;&lt;/dir&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td colspan="4"&gt; &lt;dir&gt; &lt;p&gt;Date:&lt;/p&gt; &lt;p&gt;Auditor: &lt;/p&gt;&lt;/dir&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;dir&gt; &lt;p align="center"&gt;&lt;b&gt;Audit Questions&lt;/b&gt; &lt;/p&gt;&lt;/dir&gt;&lt;/td&gt; &lt;td&gt; &lt;dir&gt; &lt;p align="center"&gt;&lt;b&gt;Y&lt;/b&gt; &lt;/p&gt;&lt;/dir&gt;&lt;/td&gt; &lt;td&gt; &lt;dir&gt; &lt;p align="center"&gt;&lt;b&gt;N&lt;/b&gt; &lt;/p&gt;&lt;/dir&gt;&lt;/td&gt; &lt;td&gt; &lt;dir&gt; &lt;p align="center"&gt;&lt;b&gt;Comments&lt;/b&gt; &lt;/p&gt;&lt;/dir&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;dir&gt; &lt;p&gt;1. Where ESD protective flooring is used for personnel grounding, are &#10; foot grounding devices or conductive footwear worn? &lt;/p&gt;&lt;/dir&gt;&lt;/td&gt; &lt;td&gt;&amp;nbsp;&lt;/td&gt; &lt;td&gt;&amp;nbsp;&lt;/td&gt; &lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;dir&gt; &lt;p&gt;2. Where conductive floors and footwear are used for personnel &#10; grounding, do personnel check continuity to ground upon entering the area? &#10; &lt;/p&gt;&lt;/dir&gt;&lt;/td&gt; &lt;td&gt;&amp;nbsp;&lt;/td&gt; &lt;td&gt;&amp;nbsp;&lt;/td&gt; &lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;dir&gt; &lt;p&gt;3. Are personnel wearing grounded wrist straps at the ESD protective &#10; workstations? &lt;/p&gt;&lt;/dir&gt;&lt;/td&gt; &lt;td&gt;&amp;nbsp;&lt;/td&gt; &lt;td&gt;&amp;nbsp;&lt;/td&gt; &lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;dir&gt; &lt;p&gt;4. Are personnel checking wrist straps for continuity or using a &#10; continuous ground monitor? &lt;/p&gt;&lt;/dir&gt;&lt;/td&gt; &lt;td&gt;&amp;nbsp;&lt;/td&gt; &lt;td&gt;&amp;nbsp;&lt;/td&gt; &lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;dir&gt; &lt;p&gt;5. Where continuous ground monitors are not used, are wrist straps &#10; checked and logged routinely and at frequent intervals? &lt;/p&gt;&lt;/dir&gt;&lt;/td&gt; &lt;td&gt;&amp;nbsp;&lt;/td&gt; &lt;td&gt;&amp;nbsp;&lt;/td&gt; &lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;dir&gt; &lt;p&gt;6. Are wriststrap checkers and continuous ground monitors checked and &#10; maintained periodically? &lt;/p&gt;&lt;/dir&gt;&lt;/td&gt; &lt;td&gt;&amp;nbsp;&lt;/td&gt; &lt;td&gt;&amp;nbsp;&lt;/td&gt; &lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;dir&gt; &lt;p&gt;7. Do wrist straps and foot grounders fit correctly? &lt;/p&gt;&lt;/dir&gt;&lt;/td&gt; &lt;td&gt;&amp;nbsp;&lt;/td&gt; &lt;td&gt;&amp;nbsp;&lt;/td&gt; &lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;dir&gt; &lt;p&gt;8. Are wrist straps and foot grounders working correctly? &lt;/p&gt;&lt;/dir&gt;&lt;/td&gt; &lt;td&gt;&amp;nbsp;&lt;/td&gt; &lt;td&gt;&amp;nbsp;&lt;/td&gt; &lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;dir&gt; &lt;p&gt;9. Are wrist strap cords checked, on the person, at the workstation? &#10; &lt;/p&gt;&lt;/dir&gt;&lt;/td&gt; &lt;td&gt;&amp;nbsp;&lt;/td&gt; &lt;td&gt;&amp;nbsp;&lt;/td&gt; &lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;dir&gt; &lt;p&gt;10. Are disposable foot grounders limited to one time use? &lt;/p&gt;&lt;/dir&gt;&lt;/td&gt; &lt;td&gt;&amp;nbsp;&lt;/td&gt; &lt;td&gt;&amp;nbsp;&lt;/td&gt; &lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;dir&gt; &lt;p&gt;11. Are test records for wrist straps and foot grounders kept and &#10; maintained? &lt;/p&gt;&lt;/dir&gt;&lt;/td&gt; &lt;td&gt;&amp;nbsp;&lt;/td&gt; &lt;td&gt;&amp;nbsp;&lt;/td&gt; &lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;dir&gt; &lt;p&gt;12. When required, are ESD protective garments correctly worn? &#10; &lt;/p&gt;&lt;/dir&gt;&lt;/td&gt; &lt;td&gt;&amp;nbsp;&lt;/td&gt; &lt;td&gt;&amp;nbsp;&lt;/td&gt; &lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;dir&gt; &lt;p&gt;13. Are nonessential personal items kept out of ESD controlled areas? &#10; &lt;/p&gt;&lt;/dir&gt;&lt;/td&gt; &lt;td&gt;&amp;nbsp;&lt;/td&gt; &lt;td&gt;&amp;nbsp;&lt;/td&gt; &lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;dir&gt; &lt;p&gt;14. Are finger cots and gloves being used on ESD sensitive hardware &#10; made of ESD protective material, or treated to be ESD protective? &#10; &lt;/p&gt;&lt;/dir&gt;&lt;/td&gt; &lt;td&gt;&amp;nbsp;&lt;/td&gt; &lt;td&gt;&amp;nbsp;&lt;/td&gt; &lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;dir&gt; &lt;p&gt;15. Are personnel working in the ESD controlled area currently &#10; certified or escorted? &lt;/p&gt;&lt;/dir&gt;&lt;/td&gt; &lt;td&gt;&amp;nbsp;&lt;/td&gt; &lt;td&gt;&amp;nbsp;&lt;/td&gt; &lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;dir&gt; &lt;p&gt;16. Are all personnel with access to the ESD controlled area trained? &#10; &lt;/p&gt;&lt;/dir&gt;&lt;/td&gt; &lt;td&gt;&amp;nbsp;&lt;/td&gt; &lt;td&gt;&amp;nbsp;&lt;/td&gt; &lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;dir&gt; &lt;p&gt;17. Are ESD Control requirements imposed on visitors? &lt;/p&gt;&lt;/dir&gt;&lt;/td&gt; &lt;td&gt;&amp;nbsp;&lt;/td&gt; &lt;td&gt;&amp;nbsp;&lt;/td&gt; &lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;/tr&gt;&lt;/tbody&gt;&lt;/table&gt;&lt;p&gt;&lt;b&gt;Reporting, Corrective Action&lt;br /&gt;&lt;/b&gt;Upon completion of the auditing &#10;process, Reports should be prepared and distributed in a timely manner. Details &#10;of the audits need to be fully documented for ISO-9000. As with all audits, it &#10;is essential to implement corrective action if deficiencies are discovered. &#10;Trends need to be tracked and analyzed to help establish corrective action, &#10;which may include retraining of personnel, revision of requirement documents or &#10;processes, or modification of the existing facility.&lt;/p&gt;&lt;p&gt;&amp;nbsp;&lt;/p&gt;&lt;p align="left"&gt;&lt;b&gt;Conclusion&lt;br /&gt;&lt;/b&gt;Auditing and training are key elements in &#10;maintaining an effective ESD control program. They help assure that procedures &#10;are properly implemented and can provide a management tool to gauge program &#10;effectiveness and make continuous improvement.&lt;/p&gt;&lt;p&gt;&lt;b&gt;For Further Reference&lt;/b&gt;&lt;/p&gt;&lt;ol&gt; &lt;li&gt;"A Successful ESD Training Program," L. Snow and G. T. Dangelmayer, &#10; &lt;i&gt;EOS/ESD Symposium Proceedings, 1994,&lt;/i&gt; ESD Association, Rome, NY &#10; &lt;/li&gt;&lt;li&gt;"A Systematic ESD Program Revisited," G. T. Dangelmayer, &lt;i&gt;EOS/ESD &#10; Symposium Proceedings, 1992,&lt;/i&gt; ESD Association, Rome, NY &#10; &lt;/li&gt;&lt;li&gt;"Auditing—The Essential Binding Force," G.T. Dangelmayer, EOS/ESD &#10; Symposium Tutorial, 1996 &#10; &lt;/li&gt;&lt;li&gt;"Developing and Maintaining an Effective ESD Training Program," F. Dinger, &#10; &lt;i&gt;EOS/ESD Symposium Proceedings, 1988,&lt;/i&gt; ESD Association, Rome, NY &#10; &lt;/li&gt;&lt;li&gt;"Effectiveness of ESD Training Using Multimedia," G. Smalanskas, J. Mason, &#10; &lt;i&gt;EOS/ESD Symposium Proceedings, 1995,&lt;/i&gt; ESD Association, Rome, NY &#10; &lt;/li&gt;&lt;li&gt;"Employee Training for Successful ESD Control," G. T. Dangelmayer, E. S. &#10; Jesby, &lt;i&gt;EOS/ESD Symposium Proceedings, 1985,&lt;/i&gt; ESD Association, Rome, NY &#10; &lt;/li&gt;&lt;li&gt;"ESD Demonstrations to Increase Engineering and Manufacturing Awareness," &#10; G. Baumgartner, &lt;i&gt;EOS/ESD Symposium Proceedings, 1996,&lt;/i&gt; ESD Association, &#10; Rome, NY &#10; &lt;/li&gt;&lt;li&gt;&lt;i&gt;Fundamentals of ESD Evaluation and Auditing, &lt;/i&gt;S. Halperin, Regional &#10; ESD Tutorial, 1998&lt;i&gt;ESD Program Management: A Realistic Approach to &#10; Continuous Improvement in Static Control,&lt;/i&gt; G. T. Dangelmayer, Van Nostrand &#10; Reinhold, 1999 &#10; &lt;/li&gt;&lt;li&gt;"Implementation of Computer-Based ESD Training: A Case Study Comparing the &#10; Computer Approach with Traditional Classroom Techniques," J. Woodward-Jack, H. &#10; Sommerfeld, &lt;i&gt;EOS/ESD Symposium Proceedings, 1991,&lt;/i&gt; ESD Association, Rome, &#10; NY &#10; &lt;/li&gt;&lt;li&gt;"Implementing an ESD Program in a Multi-National Company: A Cross-Cultural &#10; Experience," W. H. Tan, &lt;i&gt;EOS/ESD Symposium Proceedings, 1994,&lt;/i&gt; ESD &#10; Association, Rome, NY &#10; &lt;/li&gt;&lt;li&gt;"Internal Quality Auditing and ESD Control," D. H. Smith and C.D. Rier, &#10; &lt;i&gt;EOS/ESD Symposium Proceedings, 1986,&lt;/i&gt; ESD Association, Rome, NY &#10; &lt;/li&gt;&lt;li&gt;"Modular ESD Certification Training Program," M. Berkowitz, B. Hamel, &#10; &lt;i&gt;EOS/ESD Symposium Proceedings, 1989,&lt;/i&gt; ESD Association, Rome, NY &#10; &lt;/li&gt;&lt;li&gt;"The Production Operator: Weak Link or Warrior in the ESD Battle?", G. E. &#10; Hansel, &lt;i&gt;EOS/ESD Symposium Proceedings, 1983, &lt;/i&gt;ESD Association, Rome, NY &#10; &lt;/li&gt;&lt;li&gt;"Tracking Results of an ESD Control Program Within a Telecommunications &#10; Service Company," R. J. Zezulka, &lt;i&gt;EOS/ESD Symposium Proceedings, 1989, &#10; &lt;/i&gt;ESD Association, Rome, NY &#10; &lt;/li&gt;&lt;li&gt;"You’ve Implemented An ESD Program -- What’s Next?", W. Y. McFarland, R. &#10; A. Brin, &lt;i&gt;EOS/ESD Symposium Proceedings, 1993, &lt;/i&gt;ESD Association, Rome, NY &#10; &lt;/li&gt;&lt;li&gt;&lt;i&gt;ESD ADV2.0--ESD Handbook,&lt;/i&gt; ESD Association, Rome, NY &#10; &lt;/li&gt;&lt;li&gt;&lt;i&gt;ANSI/ESD 20.20—Electrostatic Discharge Control Program,&lt;/i&gt; ESD &#10; Association, Rome, NY &lt;/li&gt;&lt;/ol&gt;&lt;/blockquote&gt;</description></item><item><title>4. HOW MUCH MEMORY IS ON A MODULE?</title><link>https://technick.net/guides/hardware/umg/04_000/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/umg/04_000/</guid><description>&lt;hr /&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/hardware/umg/03_002"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/04_001"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt;&lt;a name="TOC"&gt;&lt;/a&gt;&lt;h3&gt;4. HOW MUCH MEMORY IS ON A MODULE?&lt;/h3&gt;&lt;/p&gt;&lt;p&gt;Up to now, we've discussed some of the technical attributes of memory and how memory functions in a system. What's left are the technical details - the "bits and bytes," as they say. This section covers the binary numbering system, which forms the basis of computing, and calculation of a memory module's capacity. &lt;br /&gt;&lt;br /&gt;&lt;ul&gt;&lt;li&gt;&lt;a href="https://technick.net/guides/hardware/umg/04_001"&gt;4.1. BITS AND BYTES&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href="https://technick.net/guides/hardware/umg/04_002"&gt;4.2. CPU AND MEMORY REQUIREMENTS&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href="https://technick.net/guides/hardware/umg/04_003"&gt;4.3. CALCULATING THE CAPACITY OF A MODULE&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href="https://technick.net/guides/hardware/umg/04_004"&gt;4.4. STACKING&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>4.1. BITS AND BYTES</title><link>https://technick.net/guides/hardware/umg/04_001/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/umg/04_001/</guid><description>&lt;hr /&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/hardware/umg/04_000"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/04_002"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt;&lt;a name="TOC"&gt;&lt;/a&gt;&lt;h3&gt;4.1. BITS AND BYTES&lt;/h3&gt;&lt;/p&gt;&lt;p&gt;Computers speak in a "code" called machine language, which uses only two numerals: 0 and 1. Different combinations of 0s and 1s form what are called binary numbers. These binary numbers form instructions for the chips and microprocessors that drive computing devices - such as computers, printers, hard disk drives, and so on. You may have heard the terms "bit" and "byte." Both of these are units of information that are important to computing. The term bit is short for "binary digit." As the name suggests, a bit represents a single digit in a binary number; a bit is the smallest unit of information used in computing and can have a value of either 1 or a 0. A byte consists of 8 bits. Almost all specifications of your computer's capabilities are represented in bytes. For example, memory capacity, data-transfer rates, and data-storage capacity are all measured in bytes or multiples thereof (such as kilobytes, megabytes, or gigabytes).&lt;br /&gt;&lt;br /&gt;This discussion of bits and bytes becomes very relevant when it comes to computing devices and components working together. Here, we'll address specifically how bits and bytes form the basis of measuring memory component performance and interaction with other devices like the CPU. &lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>4.2. CPU AND MEMORY REQUIREMENTS</title><link>https://technick.net/guides/hardware/umg/04_002/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/umg/04_002/</guid><description>&lt;hr /&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/hardware/umg/04_001"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/04_003"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt;&lt;a name="TOC"&gt;&lt;/a&gt;&lt;h3&gt;4.2. CPU AND MEMORY REQUIREMENTS&lt;/h3&gt;&lt;/p&gt;&lt;p&gt;A computer's CPU (central processing unit) processes data in 8-bit chunks. Those chunks, as we learned in the previous section, are commonly referred to as bytes. Because a byte is the fundamental unit of processing, the CPU's processing power is often described in terms of the maximum number of bytes it can process at any given time. For example, Pentium and PowerPC microprocessors currently are 64-bit CPUs, which means they can simultaneously process 64 bits, or 8 bytes, at a time.&lt;br /&gt;&lt;br /&gt;Each transaction between the CPU and memory is called a bus cycle. The number of data bits a CPU can transfer during a single bus cycle affects a computer's performance and dictates what type of memory the computer requires. Most desktop computers today use 168-pin DIMMs, which support 64-bit data paths. Earlier 72-pin SIMMs supported 32-bit data paths, and were originally used with 32-bit CPUs. When 32-bit SIMMs were used with 64-bit processors, they had to be installed in pairs, with each pair of modules making up a memory bank. The CPU communicated with the bank of memory as one logical unit.&lt;br /&gt;&lt;br /&gt;Interestingly, RIMM modules, which are newer than DIMMs, use smaller 16-bit data paths; however they transmit information very rapidly, sending several packets of data at a time. RIMM modules use pipelining technology to send four 16-bit packets at a time to a 64-bit CPU, so information still gets processed in 64-bit chunks. &lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>4.3. CALCULATING THE CAPACITY OF A MODULE</title><link>https://technick.net/guides/hardware/umg/04_003/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/umg/04_003/</guid><description>&lt;hr /&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/hardware/umg/04_002"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/04_004"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt;&lt;a name="TOC"&gt;&lt;/a&gt;&lt;h3&gt;4.3. CALCULATING THE CAPACITY OF A MODULE&lt;/h3&gt;&lt;/p&gt;&lt;p&gt;Memory holds the information that the CPU needs to process. The capacity of&#10;memory chips and modules are described in &lt;b&gt;megabits&lt;/b&gt; (millions of bits) and&lt;b&gt;megabytes&lt;/b&gt; (millions of bytes). When trying to figure out how much memory you&#10;have on a module, there are two important things to remember:&lt;br /&gt;&lt;br /&gt;A module consists of a group of chips. If you add together the capacities of all the chips&#10;on the module, you get the total capacity of the module. Exceptions to this rule are:&lt;br /&gt;&lt;br /&gt;&lt;ul&gt;&lt;li&gt;If some of the capacity is being used for another function, such as error checking.&lt;br /&gt;&lt;br /&gt;&lt;/li&gt;&lt;li&gt;If some of the capacity is not being used, for example some chips may have extra&#10;rows to be used as back-ups. (This isn't common.)&lt;/li&gt;&lt;/ul&gt;While chip capacity is usually expressed in megabits, module capacity is expressed in&#10;megabytes. This can get confusing, especially since many people unknowingly use the&#10;word "bit" when they mean "byte" and vice versa. To help make it clear, we'll adopt the&#10;following standards in this book:&lt;br /&gt;&lt;br /&gt;When we talk about the amount of memory on a module, we'll use the term&#10;"module capacity"; when we are referring to chips, we'll use the term "chip&#10;density". Module capacity will be measured in megabytes (MB) with both&#10;letters capital, and chip density will be measured in megabits (Mbit), and we'll&#10;spell out the word "bit" in small letters.&lt;/p&gt;&lt;p&gt;&lt;table border="1"&gt;&lt;tr&gt;&lt;th&gt;COMPONENT&lt;/th&gt;&lt;th&gt;CAPACITY EXPRESSION&lt;/th&gt;&lt;th&gt;CAPACITY UNITS&lt;/th&gt;&lt;th&gt;EXAMPLE&lt;/th&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Chips&lt;/td&gt;&lt;td&gt;Chip Density&lt;/td&gt;&lt;td&gt;Mbit (megabits)&lt;/td&gt;&lt;td&gt;64Mbit&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Memory Modules&lt;/td&gt;&lt;td&gt;Module Capacity&lt;/td&gt;&lt;td&gt;MB (megabytes)&lt;/td&gt;&lt;td&gt;64MB&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/p&gt;&lt;p&gt;&lt;h4&gt;CHIP DENSITY&lt;/h4&gt;Each memory chip is a matrix of tiny cells. Each cell holds one bit of information.&#10;Memory chips are often described by how much information they can hold. We call&#10;this chip density. You may have encountered examples of chip densities, such as&#10;"64Mbit SDRAM" or "8M by 8". A 64Mbit chip has 64 million cells and is capable&#10;of holding 64 million bits of data. The expression "8M by 8" describes one kind of&#10;64Mbit chip in more detail.&lt;br /&gt;&lt;br /&gt;In the memory industry, DRAM chip densities are often described by their cell organi-zation.&#10;The first number in the expression indicates the depth of the chip (in locations)&#10;and the second number indicates the width of the chip (in bits). If you multiply the&#10;depth by the width, you get the density of the chip. Here are some examples:&lt;/p&gt;&lt;p&gt;&lt;h4&gt;CURRENT AVAILABLE CHIP TECHNOLOGY&lt;/h4&gt;&lt;table border="1"&gt;&lt;tr&gt;&lt;td&gt;&lt;/td&gt;&lt;th&gt;CHIP DEPTH&lt;br /&gt;IN MILLIONS&lt;br /&gt;OF LOCATIONS&lt;/th&gt;&lt;th&gt;CHIP WIDTH&lt;br /&gt;IN BITS&lt;/th&gt;&lt;th&gt;CHIP DENSITY =&lt;br /&gt;DEPTH x WIDTH&lt;/th&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;16Mbit Chips&lt;/b&gt;&lt;br /&gt;4Mx4&lt;br /&gt;1Mx16&lt;br /&gt;2Mx8&lt;br /&gt;16MxI&lt;/td&gt;&lt;td&gt;&lt;br /&gt;&lt;br /&gt;4&lt;br /&gt;1&lt;br /&gt;2&lt;br /&gt;16&lt;/td&gt;&lt;td&gt;&lt;br /&gt;&lt;br /&gt;4&lt;br /&gt;16&lt;br /&gt;8&lt;br /&gt;1&lt;/td&gt;&lt;td&gt;&lt;br /&gt;&lt;br /&gt;16&lt;br /&gt;16&lt;br /&gt;16&lt;br /&gt;16&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;64Mbit Chips&lt;/b&gt;&lt;br /&gt;4Mx16&lt;br /&gt;8Mx8&lt;br /&gt;16Mx4&lt;/td&gt;&lt;td&gt;&lt;br /&gt;&lt;br /&gt;4&lt;br /&gt;8&lt;br /&gt;16&lt;/td&gt;&lt;td&gt;&lt;br /&gt;&lt;br /&gt;16&lt;br /&gt;8&lt;br /&gt;4&lt;/td&gt;&lt;td&gt;&lt;br /&gt;&lt;br /&gt;64&lt;br /&gt;64&lt;br /&gt;64&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;128Mbit Chips&lt;/b&gt;&lt;br /&gt;8Mx16&lt;br /&gt;16Mx8&lt;br /&gt;32Mx4&lt;/td&gt;&lt;td&gt;&lt;br /&gt;&lt;br /&gt;8&lt;br /&gt;16&lt;br /&gt;32&lt;/td&gt;&lt;td&gt;&lt;br /&gt;&lt;br /&gt;16&lt;br /&gt;8&lt;br /&gt;4&lt;/td&gt;&lt;td&gt;&lt;br /&gt;&lt;br /&gt;128&lt;br /&gt;128&lt;br /&gt;128&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;256Mbit Chips&lt;/b&gt;&lt;br /&gt;32Mx8&lt;/td&gt;&lt;td&gt;&lt;br /&gt;&lt;br /&gt;32&lt;/td&gt;&lt;td&gt;&lt;br /&gt;&lt;br /&gt;8&lt;/td&gt;&lt;td&gt;&lt;br /&gt;&lt;br /&gt;256&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/p&gt;&lt;p&gt;&lt;h4&gt;MODULE CAPACITY&lt;/h4&gt;&lt;br /&gt;&lt;br /&gt;It's easy to calculate the capacity of a memory module if you know the capacities of&#10;the chips on it. If there are eight 64Mbit chips, it's a 512Mbit module. However,&#10;because the capacity of a module is described in megabytes, not megabits, you have&#10;to convert bits to bytes. To do this, divide the number of bits by 8. In the case of &#10;the 512Mbit module:&lt;br /&gt;&lt;pre&gt;&#10;&lt;pre&gt;&lt;code&gt; 512Mbits&#10;&lt;/code&gt;&lt;/pre&gt;&#10;&lt;p&gt;&amp;mdash;&amp;mdash;&amp;mdash;&amp;mdash;&amp;mdash;&amp;ndash; = 64MB&#10;8 bits per byte&lt;/pre&gt;&lt;/p&gt;&lt;p&gt;You may hear standard memory modules in the industry being described as:&#10;&amp;ldquo;4Mx32&amp;rdquo; (that is, &amp;ldquo;4 Meg by 32&amp;rdquo;), or &amp;ldquo;16Mx64&amp;rdquo; (&amp;ldquo;16 Meg by 64&amp;rdquo;). In these cases,&#10;you can calculate the capacity of the module exactly as if it were a chip:&lt;/p&gt;&lt;pre&gt;&lt;/p&gt;&#10;&lt;p&gt;4Mx32 is 128Mbits. 16Mx64 is 1024Mbits.&lt;/p&gt;&#10;&lt;pre&gt;&lt;code&gt; 128Mbits 1024Mbits&#10;&lt;/code&gt;&lt;/pre&gt;&#10;&lt;p&gt;&amp;mdash;&amp;mdash;&amp;mdash;&amp;mdash;&amp;mdash;&amp;ndash; = 16MB module &amp;mdash;&amp;mdash;&amp;mdash;&amp;mdash;&amp;mdash;&amp;ndash; = 128MB module&#10;8 bits per byte 8 bits per byte&lt;/pre&gt;&lt;p&gt;Here are some additional examples:&lt;/p&gt;&lt;p&gt;&lt;h4&gt;STANDARD MODULE TYPES&lt;/h4&gt;&lt;table border="1"&gt;&lt;tr&gt;&lt;td&gt;&lt;/td&gt;&lt;th&gt;STANDARD&lt;/th&gt;&lt;th&gt;MODULE DEPTH&lt;br /&gt; IN LOCATIONS&lt;/th&gt;&lt;th&gt;MODULE WIDTH&lt;br /&gt; IN DATA BITS&lt;/th&gt;&lt;th&gt;CAPACITY IN&lt;br /&gt; MBITS = DEPTH X WIDTH&lt;/th&gt;&lt;th&gt;CAPACITY IN&lt;br /&gt; MB = MBITS/8&lt;/th&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;72-Pin&lt;/b&gt;&lt;/td&gt;&lt;td&gt;1Mx32&lt;br /&gt;2Mx32&lt;br /&gt;4Mx32&lt;br /&gt;8Mx32&lt;br /&gt;16Mx32&lt;br /&gt;32Mx32&lt;/td&gt;&lt;td&gt;1&lt;br /&gt;2&lt;br /&gt;4&lt;br /&gt;8&lt;br /&gt;16&lt;br /&gt;32&lt;/td&gt;&lt;td&gt;32&lt;br /&gt;32&lt;br /&gt;32&lt;br /&gt;32&lt;br /&gt;32&lt;br /&gt;32&lt;/td&gt;&lt;td&gt;32&lt;br /&gt;64&lt;br /&gt;128&lt;br /&gt;256&lt;br /&gt;512&lt;br /&gt;1024&lt;/td&gt;&lt;td&gt;4&lt;br /&gt;8&lt;br /&gt;16&lt;br /&gt;32&lt;br /&gt;64&lt;br /&gt;128&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;b&gt;168-Pin&lt;/b&gt;&lt;/td&gt;&lt;td&gt;2Mx64&lt;br /&gt;4Mx64&lt;br /&gt;8Mx64&lt;br /&gt;16Mx64&lt;br /&gt;32Mx64&lt;/td&gt;&lt;td&gt;2&lt;br /&gt;4&lt;br /&gt;8&lt;br /&gt;16&lt;br /&gt;32&lt;/td&gt;&lt;td&gt;64&lt;br /&gt;64&lt;br /&gt;64&lt;br /&gt;64&lt;br /&gt;64&lt;/td&gt;&lt;td&gt;128&lt;br /&gt;256&lt;br /&gt;512&lt;br /&gt;1024&lt;br /&gt;2048&lt;/td&gt;&lt;td&gt;16&lt;br /&gt;32&lt;br /&gt;64&lt;br /&gt;128&lt;br /&gt;256&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/p&gt;&lt;p&gt;As we mentioned earlier, there&amp;rsquo;s only room for a certain number of chips on a PCB. Based&#10;on an industry standard 168-pin DIMM, the largest capacity module manufacturers can&#10;make using 64Mbit chips is 128MB; with 128Mbit chips, the largest module possible is&#10;256MB; and with 256Mbit chips, the largest module possible is 512MB.&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>4.4. STACKING</title><link>https://technick.net/guides/hardware/umg/04_004/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/umg/04_004/</guid><description>&lt;hr /&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/hardware/umg/04_003"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/05_000"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt;&lt;a name="TOC"&gt;&lt;/a&gt;&lt;h3&gt;4.4. STACKING&lt;/h3&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;Many large servers and workstations require higher capacity modules in order to&#10;reach system memory capacities of several gigabytes or more. There are two ways to&#10;increase the capacity of a module. Manufacturers can stack chips on top of one&#10;another, or they can stack boards.&lt;/p&gt;&lt;p&gt;&lt;h4&gt;CHIP STACKING&lt;/h4&gt;&lt;br /&gt;With chip stacking, two chips are stacked together and occupy the space that one&#10;chip would normally take up. In some cases, the stacking is done internally at the&#10;chip manufacturing plant and can actually appear to be one chip. In other cases the&#10;chips are stacked externally. The example below shows two externally stacked chips.&lt;br /&gt;&lt;br /&gt;&lt;div align="center"&gt;&lt;img src="https://technick.net/img/guide_umg/guide_umg_012.jpg" width="357" height="195" border="0" alt="" /&gt;&lt;br /&gt;Example of externally stacked chips.&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;h4&gt;BOARD STACKING&lt;/h4&gt;&lt;br /&gt;As you might expect, board stacking involves putting two memory module printed&#10;circuit boards (PCBs) together. With board stacking, a secondary board mounts onto&#10;the primary board, which fits into the memory socket on the system motherboard.&lt;br /&gt;&lt;br /&gt;&lt;div align="center"&gt;&lt;img src="https://technick.net/img/guide_umg/guide_umg_021.jpg" width="459" height="290" border="0" alt="" /&gt;&lt;br /&gt;Example of a stacked module.&lt;/div&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>5. Device Sensitivity and Testing</title><link>https://technick.net/guides/electronics/esd/005/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/esd/005/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/electronics/esd/004"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/esd/000"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/esd/006"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;5. Device Sensitivity &#10;and Testing&lt;/h3&gt;&lt;p&gt;In &lt;i&gt;&lt;a href="https://technick.net/guides/electronics/esd/002"&gt;Part Two&lt;/a&gt;&lt;/i&gt;, we &#10;indicated that one of the key elements in a successful static control program &#10;was the identification of those items (components, assemblies, and finished &#10;products) that are sensitive to ESD and the level of their sensitivity. Damage &#10;to an ESDS device by the ESD event is determined by the device's ability to &#10;dissipate the energy of the discharge or withstand the current levels involved. &#10;This is known as device "ESD sensitivity" or "ESD susceptibility". &lt;/p&gt;&lt;p&gt;Some devices may be more readily damaged by discharges occurring within &#10;automated equipment, while others may be more prone to damage from handling by &#10;personnel. In this article we will cover the models and test procedures used to &#10;characterize, determine, and classify the sensitivity of components to ESD. &#10;These test procedures are based on the three primary models of ESD events: Human &#10;Body Model (HBM), Machine Model (MM), and Charged Device Model (CDM). The models &#10;used to perform component testing cannot replicate the full spectrum of all &#10;possible ESD events. Nevertheless, these models have been proven to be &#10;successful in reproducing over 95% of all ESD field failure signatures. With the &#10;use of standardized test procedures, the industry can&lt;/p&gt;&lt;ol&gt; &lt;li&gt;Develop and measure suitable on-chip protection. &#10; &lt;/li&gt;&lt;li&gt;Enable comparisons to be made between devices. &#10; &lt;/li&gt;&lt;li&gt;Provide a system of ESD sensitivity classification to assist in the ESD &#10; design and monitoring requirements of the manufacturing and assembly &#10; environments. &#10; &lt;/li&gt;&lt;li&gt;Have documented test procedures to ensure reliable and repeatable results. &#10; &lt;/li&gt;&lt;/ol&gt;&lt;p&gt;&lt;b&gt;&lt;u&gt;Human Body Model&lt;br /&gt;&lt;/u&gt;&lt;/b&gt;One of the most common causes of &#10;electrostatic damage is the direct transfer of electrostatic charge through a &#10;significant series resistor from the human body or from a charged material to &#10;the electrostatic discharge sensitive (ESDS) device. When one walks across a &#10;floor, an electrostatic charge accumulates on the body. Simple contact of a &#10;finger to the leads of an ESDS device or assembly allows the body to discharge, &#10;possibly causing device damage. The model used to simulate this event is the &#10;Human Body Model (HBM).&lt;/p&gt;&lt;p&gt;The Human Body Model is the oldest and most commonly used model for &#10;classifying device sensitivity to ESD. The HBM testing model represents the &#10;discharge from the fingertip of a standing individual delivered to the device. &#10;It is modeled by a 100 pF capacitor discharged through a switching component and &#10;a 1.5kW series resistor into the component. This model, which dates from the &#10;nineteenth century, was developed for investigating explosive gas mixtures in &#10;mines. It was adopted by the military in MIL-STD-883 Method 3015, and is also &#10;used in ESD Association standard &lt;i&gt;ESD STM5.1-1998&lt;/i&gt; &lt;i&gt;Revised: &#10;Electrostatic Discharge Sensitivity Testing -- Human Body Model.&lt;/i&gt; The Human &#10;Body Model circuit is presented in Figure 1.&lt;/p&gt;&lt;p align="center"&gt;&lt;img height="162" alt="HMB circuit" src="https://technick.net/img/guide_esd/hbmcir.gif" width="250" align="middle" border="0" /&gt;&lt;br /&gt;Figure 1: Typical Human Body Model Circuit&lt;/p&gt;&lt;p&gt;Testing for HBM sensitivity is typically performed using automated test &#10;systems. The device is placed in the test system and contacted through a relay &#10;matrix. ESD zaps are applied and the post stress I-V current traces are reviewed &#10;to see if the devices fail. The ESD Association HBM test standard was recently &#10;revised to include several technical changes. First, the number of zaps per &#10;stress level and polarity has been reduced from 3 to 1. Also, the minimum time &#10;interval between zaps has been reduced from 1 second to 300 milliseconds. The &#10;changes reduce the HBM qualification test time.&lt;/p&gt;&lt;p&gt;The second technical change is a revision in the HBM tester specifications. &#10;The maximum rise time for an HBM wave form measured through a 500 ohm load was &#10;increased from 20 to 25 nanoseconds. This will allow HBM test equipment &#10;manufacturers to build high pin count testers that typically have a higher &#10;parasitic test board capacitance that slows down the 500 ohm wave form.&lt;/p&gt;&lt;p&gt;&lt;b&gt;&lt;u&gt;Machine Model&lt;br /&gt;&lt;/u&gt;&lt;/b&gt;A discharge similar to the HBM event also can &#10;occur from a charged conductive object, such as a metallic tool or fixture. &#10;Originating in Japan as the result of trying to create a worst-case HBM event, &#10;the model is known as the Machine Model. This ESD model consists of a 200 pF &#10;capacitor discharged directly into a component with no series resistor. &lt;/p&gt;&lt;p&gt;As a worst-case human body model, the Machine Model may be over severe. &#10;However, there are real-world situations that this model represents, for example &#10;the rapid discharge from a charged board assembly or from the charged cables of &#10;an automatic tester.&lt;/p&gt;&lt;p&gt;Testing of devices for MM sensitivity using ESD Association standard &lt;i&gt;ESD &#10;STM5.2-1999 (Revised): Electrostatic Discharge Sensitivity Testing -- Machine &#10;Model&lt;/i&gt; is similar to HBM testing. The test equipment is the same, but the &#10;test head is slightly different. The MM version does not have a 1,500 ohm &#10;resistor, but otherwise the test board and the socket are the same as for HBM &#10;testing.&lt;/p&gt;&lt;p align="center"&gt;&lt;img height="162" alt="MM circuit" src="https://technick.net/img/guide_esd/mmcir.gif" width="250" border="0" /&gt;&lt;br /&gt;Figure 2: Typical Machine Model Circuit&lt;/p&gt;&lt;p&gt;&lt;b&gt;&lt;u&gt;Charged Device Model Testing&lt;br /&gt;&lt;/u&gt;&lt;/b&gt;The transfer of charge &lt;i&gt;from&lt;/i&gt; an ESDS device is also an ESD event. A device may become charged, &#10;for example, from sliding down the feeder in an automated assembler. If it then &#10;contacts the insertion head or another conductive surface, a rapid discharge may &#10;occur from the device to the metal object. This event is known as the Charged &#10;Device Model (CDM) event, and can be more destructive than the HBM for some &#10;devices. Although the duration of the discharge is very short--often less than &#10;one nanosecond--the peak current can reach several tens of amperes.&lt;/p&gt;&lt;p&gt;Several test methods have been explored to duplicate the real-world CDM event &#10;and provide a suitable test method that duplicates the types of failure that &#10;have been observed in CDM caused field failures. Current work in the area is &#10;concentrating on two separate CDM test methods. One is termed CDM and best &#10;replicates the real world charged device event. The other addresses devices that &#10;are inserted in a socket and then charged and discharged in the socket. It is &#10;termed the socketed discharge model (SDM).&lt;/p&gt;&lt;p&gt;A draft standard for &lt;i&gt;CDM (ESD DS5.3.1-1996—Device Testing: Charged Device &#10;Model)&lt;/i&gt; was published in 1996. It is anticipated that the standard will be &#10;published as a full standard early in 2000. The test procedure involves placing &#10;the device on a field plate with its leads pointing up, then charging it and &#10;discharging the device. Figure 3 illustrates a typical CDM test circuit.&lt;/p&gt;&lt;p align="center"&gt;&lt;img height="200" alt="CDM" src="https://technick.net/img/guide_esd/cdm.gif" width="269" border="0" /&gt;&lt;br /&gt;Figure 3: Typical Charged Device Model Test&lt;/p&gt;&lt;p align="left"&gt;SDM testing is similar to testing for HBM and MM sensitivity. The &#10;device is placed in a socket, charged from a high-voltage source and then &#10;discharged. This procedure is still a work in process and still has a number of &#10;limitations including too great a dependency on the specific design of the SDM &#10;tester. A technical paper on SDM testing was presented by the ESD Association &#10;SDM Device Testing standards working group at the October 1998 EOS/ESD &#10;Symposium.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Device Sensitivity Classification&lt;br /&gt;&lt;/b&gt;Each of the device testing &#10;methods includes a classification system for defining the component sensitivity &#10;to the specified model (See Tables 1, 2, and 3). These classification systems &#10;have a number of advantages. They allow easy grouping and comparing of &#10;components according to their ESD sensitivity and the classification gives you &#10;an indication of the level of ESD protection that is required for the &#10;component.&lt;/p&gt;&lt;p align="center"&gt;Table 1 &lt;br /&gt;ESDS Component Sensitivity Classification - Human &#10;Body Model &lt;br /&gt;(Per ESD STM5.1-1998) &lt;br /&gt;&lt;/p&gt;&lt;div align="center"&gt;&lt;table cellspacing="1" cellpadding="7" border="1"&gt; &lt;tbody&gt; &lt;tr&gt; &lt;td&gt; &lt;p&gt;&lt;b&gt;Class&lt;/b&gt; &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;&lt;b&gt;Voltage Range&lt;/b&gt; &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p&gt;Class 0 &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;&amp;lt;250 volts &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p&gt;Class 1A &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;250 volts to &amp;lt;500 volts &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p&gt;Class 1B &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;500 volts to &amp;lt; 1,000 volts &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p&gt;Class 1C &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;1000 volts to &amp;lt; 2,000 volts &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p&gt;Class 2 &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;2000 volts to &amp;lt; 4,000 volts &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p&gt;Class 3A &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;4000 volts to &amp;lt; 8000 volts &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p&gt;Class 3B &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;&amp;gt;= 8000 volts &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/tbody&gt;&lt;/table&gt;&lt;/div&gt;&lt;p align="center"&gt;Table 2 &lt;br /&gt;ESDS Component Sensitivity Classification - Machine &#10;Model &lt;br /&gt;(Per ANSI/ESD-S5.2-1999) &lt;/p&gt;&lt;div align="center"&gt;&lt;table cellspacing="1" cellpadding="7" border="1"&gt; &lt;tbody&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;&lt;b&gt;Class&lt;/b&gt; &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;&lt;b&gt;Voltage Range&lt;/b&gt; &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;Class M1 &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;&amp;lt;100 volts &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;Class M2 &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;100 volts to &amp;lt;200 volts &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;Class M3 &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;200 volts to &amp;lt;400 volts &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;Class M4 &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;&amp;gt; or = 400 volts &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/tbody&gt;&lt;/table&gt;&lt;/div&gt;&lt;p align="center"&gt;Table 3 &lt;br /&gt;ESDS Component Sensitivity Classification - Charged &#10;Device Model &lt;br /&gt;(Per EOS/ESD-DS5.3-1996) &lt;/p&gt;&lt;div align="center"&gt;&lt;table cellspacing="1" cellpadding="7" border="1"&gt; &lt;tbody&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;&lt;b&gt;Class&lt;/b&gt; &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;&lt;b&gt;Voltage Range&lt;/b&gt; &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;Class C1 &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;&amp;lt;125 volts &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;Class C2 &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;125 volts to &amp;lt;250 volts &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;Class C3 &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;250 volts to &amp;lt;500 volts &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;Class C4 &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;500 volts to &amp;lt;1,000 volts &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;Class C5 &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;1,000 volts to &amp;lt;1,500 volts &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;Class C6 &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;1,500 volts to &amp;lt;2,000 volts &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt; &lt;p align="center"&gt;Class C7 &lt;/p&gt;&lt;/td&gt; &lt;td&gt; &lt;p align="center"&gt;=&amp;gt;2,000 volts &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/tbody&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;A fully characterized component should be classified using all three models: &#10;Human Body Model, Machine Model, and Charged Device Model. For example, a fully &#10;characterized component may have the following: Class 1B (500 volts to &amp;lt;1000 &#10;volts HBM), Class M1 (&amp;lt;100 volts MM), and Class C3 (500 volts to &amp;lt;1000 &#10;volts CDM). This would alert a potential user of the component to the need for a &#10;controlled environment, whether assembly and manufacturing operations are &#10;performed by human beings or machines.&lt;/p&gt;&lt;p&gt;A word of caution, however. These classification systems and component &#10;sensitivity test results function as guides, not necessarily as absolutes. The &#10;events defined by the test data produce narrowly restrictive data that must be &#10;carefully considered and judiciously used. The three ESD models represent &#10;discrete points used in an attempt to characterize ESD vulnerability. The data &#10;points are informative and useful, but to arbitrarily extrapolate the data into &#10;a real world scenario can be misleading. The true utility of the data is in &#10;comparing one device with another and to provide a starting point for developing &#10;your ESD control programs.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Summary&lt;br /&gt;&lt;/b&gt;Device failure models and device test methods define the &#10;sensitivity of the electronic devices and assemblies to be protected from the &#10;effects of ESD. With this key information, you can design more effective ESD &#10;control programs.&lt;/p&gt;&lt;p align="left"&gt;&lt;b&gt;For Further Reference&lt;/b&gt;&lt;/p&gt;&lt;ul&gt; &lt;li&gt;Avery, L.R., "Beyond MIL HBM Testing - How to Evaluate the Real Capability &#10; of Protection Structures, &lt;i&gt;EOS/ESD Symposium Proceedings,&lt;/i&gt; &lt;i&gt;1991&lt;/i&gt;, &#10; ESD Association, Rome, NY. &#10; &lt;/li&gt;&lt;li&gt;Avery, L.R., "Charged Device Model Testing: Trying to Duplicate Reality," &#10; &lt;i&gt;EOS/ESD Symposium Proceedings,&lt;/i&gt; &lt;i&gt;1987&lt;/i&gt;, ESD Association, Rome, NY. &#10; &lt;/li&gt;&lt;li&gt;Chaine, M., Verhaege, K., Avery, L., Kelly, M., Gieser, H., Bock, K., &#10; Henry, L.G., Meuse, T., Brodbeck, T., Barth, J., "Investigation into Socketed &#10; CEM (SDM) Tester Parasitics," &lt;i&gt;EOS/ESD Symposium Proceedings, 1998&lt;/i&gt;, ESD &#10; Association, Rome, NY. &#10; &lt;/li&gt;&lt;li&gt;&lt;i&gt;EOS/ESD DS5.3-1996: Electrostatic Discharge Sensitivity Testing - &#10; Charged Device Model.&lt;/i&gt; ESD Association, Rome, NY. &#10; &lt;/li&gt;&lt;li&gt;&lt;i&gt;ESD STM5.2-1999 (Revised): Electrostatic Discharge Sensitivity Testing &#10; -- Machine Model. &lt;/i&gt;ESD Association, Rome, NY. &#10; &lt;/li&gt;&lt;li&gt;&lt;i&gt;ESD STM5.1-1998&lt;/i&gt; &lt;i&gt;Revised: Electrostatic Discharge Sensitivity &#10; Testing -- Human Body Model.&lt;/i&gt; ESD Association, Rome, NY. &#10; &lt;/li&gt;&lt;li&gt;Geiser, H., and Haunschild, M., "Very Fast Transmission Line Pulsing of &#10; Integrated Structures and the Charged Device Model," &lt;i&gt;EOS/ESD Symposium &#10; Proceedings,&lt;/i&gt; &lt;i&gt;1996&lt;/i&gt;, ESD Association, Rome, NY. &#10; &lt;/li&gt;&lt;li&gt;Hyatt, Hugh, Calvin, Hugh, and Mellberg, Hans, "A Closer Look at the Human &#10; ESD Event," &lt;i&gt;EOS/ESD Symposium Proceedings,&lt;/i&gt; &lt;i&gt;1981&lt;/i&gt;, ESD &#10; Association, Rome, NY. &#10; &lt;/li&gt;&lt;li&gt;Kelly, M., et al, "A Comparison of Electrostatic Discharge Models and &#10; Failure Signatures for CMOS Integrated Circuit Devices," &lt;i&gt;EOS/ESD Symposium &#10; Proceedings,&lt;/i&gt; &lt;i&gt;1995&lt;/i&gt;, ESD Association, Rome, NY. &#10; &lt;/li&gt;&lt;li&gt;Pierce, Donald C., "Critical Issues Regarding ESD Sensitivity &#10; Classification Testing," &lt;i&gt;EOS/ESD Symposium Proceedings,&lt;/i&gt; &lt;i&gt;1987&lt;/i&gt;, &#10; ESD Association, Rome, NY. &#10; &lt;/li&gt;&lt;li&gt;Renninger, Robert G., "Mechanisms of Charged-Device Electrostatic &#10; Discharges," &lt;i&gt;EOS/ESD Symposium Proceedings,&lt;/i&gt; &lt;i&gt;1991&lt;/i&gt;. ESD &#10; Association, Rome, NY. &#10; &lt;/li&gt;&lt;li&gt;Russ, Christian., et al, "A Compact Model for the Grounded-Gate nMOS &#10; Behavior Under CDM ESD Stress," &lt;i&gt;EOS/ESD Symposium Proceedings,&lt;/i&gt; &#10; &lt;i&gt;1996&lt;/i&gt;, ESD Association, Rome, NY. &#10; &lt;/li&gt;&lt;li&gt;Verhaege, Koen, "Component Level ESD Testing," Review Paper, &#10; &lt;i&gt;Microelectronics Reliability Journal&lt;/i&gt;, 1998. &#10; &lt;/li&gt;&lt;li&gt;Verhaege, Koen., et al " Analysis of HBM ESD Testers and Specifications &#10; Using a 4&lt;sup&gt;th&lt;/sup&gt; Order Lumped Element Model," &lt;i&gt;EOS/ESD Symposium &#10; Proceedings,&lt;/i&gt; &lt;i&gt;1993&lt;/i&gt;, ESD Association, Rome, NY. &#10; &lt;/li&gt;&lt;li&gt;Verhaege, Koen., et al, "Recommendations to Further Improvements of HBM &#10; ESD Component Level Test Specifications," &lt;i&gt;EOS/ESD Symposium &#10; Proceedings,&lt;/i&gt; &lt;i&gt;1996&lt;/i&gt;, ESD Association, Rome, NY. &#10; &lt;/li&gt;&lt;li&gt;Wada, Tetsuaki. "Study of ESD Evaluation Methods for Charged Device &#10; Model," &lt;i&gt;EOS/ESD Symposium Proceedings,&lt;/i&gt; &lt;i&gt;1995&lt;/i&gt;, ESD Association, &#10; Rome, NY. &lt;/li&gt;&lt;/ul&gt;&lt;/blockquote&gt;</description></item><item><title>5. DIFFERENT KINDS OF MEMORY</title><link>https://technick.net/guides/hardware/umg/05_000/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/umg/05_000/</guid><description>&lt;hr /&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/hardware/umg/04_004"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/05_001"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt;&lt;a name="TOC"&gt;&lt;/a&gt;&lt;h3&gt;5. DIFFERENT KINDS OF MEMORY&lt;/h3&gt;&lt;/p&gt;&lt;p&gt;Some people like to know a lot about the computer systems they own - or are considering buying - just because. They're like that. It's what makes them tick. Some people never find out about their systems and like it that way. Still other people - most of us, in fact - find out about their systems when they have to - when something goes wrong, or when they want to upgrade it. It's important to note that making a choice about a computer system - and its memory features - will affect the experience and satisfaction you derive from the system. This chapter is here to make you smarter about memory so that you can get more out of the system you're purchasing or upgrading.&lt;br /&gt;&lt;br /&gt;&lt;ul&gt;&lt;li&gt;&lt;a href="https://technick.net/guides/hardware/umg/05_001"&gt;5.1. MODULE FORM FACTORS&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href="https://technick.net/guides/hardware/umg/05_002"&gt;5.2. MAJOR CHIP TECHNOLOGIES&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href="https://technick.net/guides/hardware/umg/05_003"&gt;5.3. MEMORY TECHNOLOGIES FOR VIDEO OR GRAPHICS PROCESSING&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href="https://technick.net/guides/hardware/umg/05_004"&gt;5.4. OTHER MEMORY TECHNOLOGIES YOU MAY HAVE HEARD ABOUT&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href="https://technick.net/guides/hardware/umg/05_005"&gt;5.5. ERROR CHECKING&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href="https://technick.net/guides/hardware/umg/05_006"&gt;5.6. OTHER SPECIFICATIONS&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>5.1. MODULE FORM FACTORS</title><link>https://technick.net/guides/hardware/umg/05_001/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/umg/05_001/</guid><description>&lt;hr /&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/hardware/umg/05_000"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/05_002"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt;&lt;a name="TOC"&gt;&lt;/a&gt;&lt;h3&gt;5.1. MODULE FORM FACTORS&lt;/h3&gt;&lt;/p&gt;&lt;p&gt;The easiest way to categorize memory is by &lt;b&gt;form factor&lt;/b&gt;. The form factor of &#10;any memory module describes its size and pin configuration. Most computer systems&#10;have memory sockets that can accept only one form factor. Some computer systems&#10;are designed with more than one type of memory socket, allowing a choice between&#10;two or more form factors. Such designs are usually a result of transitional periods&#10;in the industry when it's not clear which form factors will gain predominance or be&#10;more available.&lt;/p&gt;&lt;p&gt;&lt;h4&gt;SIMMS&lt;/h4&gt;&lt;br /&gt;As previously mentioned, the term &lt;b&gt;SIMM&lt;/b&gt; stands for &lt;b&gt;Single In-Line Memory Module&lt;/b&gt;. With SIMMs, memory chips are soldered onto a &#10;modular printed circuit board (PCB), which inserts into a socket on the system board.&lt;br /&gt;&lt;br /&gt;The first SIMMs transferred 8 bits of data at a time. Later, as CPUs began to read&#10;data in 32-bit chunks, a wider SIMM was developed, which could supply 32 bits&#10;of data at a time. The easiest way to differentiate between these two different kinds&#10;of SIMMs was by the number of pins, or connectors. The earlier modules had 30&#10;pins and the later modules had 72 pins. Thus, they became commonly referred to&#10;as 30-pin SIMMs and 72-pin SIMMs.&lt;br /&gt;&lt;br /&gt;Another important difference between 30-pin and 72-pin SIMMs is that 72-pin&#10;SIMMs are 3/4 of an inch (about 1.9 centimeters) longer than the 30-pin SIMMs&#10;and have a notch in the lower middle of the PCB. The graphic below compares the&#10;two types of SIMMs and indicates their data widths.&lt;br /&gt;&lt;br /&gt;&lt;div align="center"&gt;&lt;img src="https://technick.net/img/guide_umg/guide_umg_022.jpg" width="346" height="254" border="0" alt="" /&gt;&lt;br /&gt;&lt;br /&gt;Comparison of a 30-pin and a 72-pin SIMM&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;h4&gt;DIMMS&lt;/h4&gt;&lt;br /&gt;&lt;br /&gt;Dual In-line Memory Modules, or &lt;b&gt;DIMMs&lt;/b&gt;, closely resemble SIMMs. Like SIMMs,&#10;most DIMMs install vertically into expansion sockets. The principal difference&#10;between the two is that on a SIMM, pins on opposite sides of the board are "tied&#10;together" to form one electrical contact; on a DIMM, opposing pins remain electrically&#10;isolated to form two separate contacts.&lt;br /&gt;&lt;br /&gt;168-pin DIMMs transfer 64 bits of data at a time and are typically used in computer&#10;configurations that support a 64-bit or wider memory bus. Some of the physical&#10;differences between 168-pin DIMMs and 72-pin SIMMs include: the length of&#10;module, the number of notches on the module, and the way the module installs in&#10;the socket. Another difference is that many 72-pin SIMMs install at a slight angle,&#10;whereas 168-pin DIMMs install straight into the memory socket and remain&#10;completely vertical in relation to the system motherboard. The illustration below&#10;compares a 168-pin DIMM to a 72-pin SIMM.&lt;br /&gt;&lt;br /&gt;&lt;div align="center"&gt;&lt;img src="https://technick.net/img/guide_umg/guide_umg_023.jpg" width="388" height="247" border="0" alt="" /&gt;&lt;br /&gt;&lt;br /&gt;Comparison of a 72-pin SIMM and a 168-pin DIMM.&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;h4&gt;SO DIMMS&lt;/h4&gt;&lt;br /&gt;&lt;br /&gt;A type of memory commonly used in notebook computers is called SO DIMM or&#10;Small Outline DIMM. The principal difference between a SO DIMM and a DIMM is&#10;that the SO DIMM, because it is intended for use in notebook computers, is&#10;significantly smaller than the standard DIMM. The 72-pin SO DIMM is 32 bits wide&#10;and the 144-pin SO DIMM is 64 bits wide.&lt;br /&gt;&lt;br /&gt;&lt;div align="center"&gt;&lt;img src="https://technick.net/img/guide_umg/guide_umg_024.jpg" width="454" height="117" border="0" alt="" /&gt;&lt;br /&gt;&lt;br /&gt;Comparison of a 72-pin SO DIMM and a 144-pin SO DIMM.&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;h4&gt;RIMMS AND SO-RIMMS&lt;/h4&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;RIMM&lt;/b&gt; is the trademarked name for a Direct Rambus memory module. RIMMs look&#10;similar to DIMMs, but have a different pin count. RIMMs transfer data in 16-bit chunks.&#10;The faster access and transfer speed generates more heat. An aluminum sheath, called&#10;a &lt;b&gt;heat spreader&lt;/b&gt;, covers the module to protect the chips from overheating.&lt;br /&gt;&lt;br /&gt;A 184-pin Direct Rambus RIMM shown with heat spreaders pulled away.&lt;br /&gt;&lt;br /&gt;&lt;div align="center"&gt;&lt;img src="https://technick.net/img/guide_umg/guide_umg_025.jpg" width="474" height="247" border="0" alt="" /&gt;&lt;br /&gt;&lt;br /&gt;An &lt;b&gt;SO-RIMM&lt;/b&gt; looks similar to an SO DIMM, but it uses Rambus technology.&lt;br /&gt;&lt;br /&gt;&lt;img src="https://technick.net/img/guide_umg/guide_umg_026.jpg" width="217" height="214" border="0" alt="" /&gt;&lt;br /&gt;&lt;br /&gt;A 160-pin SO-RIMM module.&lt;/div&gt; &lt;/p&gt;&lt;p&gt;&lt;h4&gt;FLASH MEMORY&lt;/h4&gt;Flash memory is a solid-state, non-volatile, rewritable memory that functions like&#10;RAM and a hard disk drive combined. Flash memory stores bits of electronic data&#10;in memory cells, just like DRAM, but it also works like a hard-disk drive in that&#10;when the power is turned off, the data remains in memory. Because of its high&#10;speed, durability, and low voltage requirements, flash memory is ideal for use&#10;in many applications - such as digital cameras, cell phones, printers, handheld&#10;computers, pagers, and audio recorders.&lt;br /&gt;&lt;br /&gt;&lt;div align="center"&gt;&lt;img src="https://technick.net/img/guide_umg/guide_umg_028.jpg" width="383" height="345" border="0" alt="" /&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;h4&gt;PC CARD AND CREDIT CARD MEMORY&lt;/h4&gt;&lt;br /&gt;&lt;br /&gt;Before SO DIMMs became popular, most notebook memory was developed using&#10;proprietary designs. It is always more cost-effective for a system manufacturer to use&#10;standard components, and at one point, it became popular to use the same "credit&#10;card" like packaging for memory that is used on PC Cards today. Because the modules&#10;looked like PC Cards, many people thought the memory cards were the same as PC&#10;Cards, and could fit into PC Card slots. At the time, this memory was described as&#10;"Credit Card Memory" because the form factor was the approximate size of a credit&#10;card. Because of its compact form factor, credit card memory was ideal for notebook&#10;applications where space is limited.&lt;br /&gt;&lt;br /&gt;PC Cards use an input/output protocol that used to be referred&#10;to as PCMCIA (Personal Computer Memory Card International Association). This standard&#10;is designed for attaching input/output devices such as network adapters, fax/modems, &#10;or hard drives to notebook computers. Because PC Card memory resembles the types of&#10;cards designed for use in a notebook computer's PC Card slot, some people have &#10;mistakenly thought that the memory modules could be used in the PC Card slot. To&#10;date, RAM has not been packaged on a PCMCIA card because the technology doesn't &#10;allow the processor to communicate quickly enough with memory. Currently, the most &#10;common type of memory on PC Card modules is Flash memory.&lt;br /&gt;&lt;br /&gt;&lt;div align="center"&gt;&lt;img src="https://technick.net/img/guide_umg/guide_umg_027.jpg" width="310" height="185" border="0" alt="" /&gt;&lt;br /&gt;&lt;/div&gt;On the surface, credit card memory does not resemble a typical memory module &#10;configuration. However, on the inside you will find standard TSOP memory chips.&lt;br /&gt;&lt;br /&gt;This section presents the most common memory technologies used for main memory:&#10;This road map offers an overview of the evolution of memory.&lt;br /&gt;&lt;br /&gt;&lt;table border="1"&gt;&lt;tr&gt;&lt;td&gt;&lt;font face="Verdana, Ariel" size="2"&gt;&lt;b&gt;YEAR INTRODUCED&lt;/b&gt;&lt;/font&gt;&lt;/td&gt;&lt;td&gt;&lt;font face="Verdana, Ariel" size="2"&gt;&lt;b&gt;TECHNOLOGY&lt;/b&gt;&lt;/font&gt;&lt;/td&gt;&lt;td&gt;&lt;font face="Verdana, Ariel" size="2"&gt;&lt;b&gt;SPEED LIMIT&lt;/b&gt;&lt;/font&gt;&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;font face="Verdana, Ariel" size="1"&gt;1987&lt;/font&gt;&lt;/td&gt;&lt;td&gt;&lt;font face="Verdana, Ariel" size="1"&gt;FPM&lt;/font&gt;&lt;/td&gt;&lt;td&gt;&lt;font face="Verdana, Ariel" size="1"&gt;50ns&lt;/font&gt;&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;font face="Verdana, Ariel" size="1"&gt;1995&lt;/font&gt;&lt;/td&gt;&lt;td&gt;&lt;font face="Verdana, Ariel" size="1"&gt;EDO&lt;/font&gt;&lt;/td&gt;&lt;td&gt;&lt;font face="Verdana, Ariel" size="1"&gt;50ns&lt;/font&gt;&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;font face="Verdana, Ariel" size="1"&gt;1997&lt;/font&gt;&lt;/td&gt;&lt;td&gt;&lt;font face="Verdana, Ariel" size="1"&gt;PC66 SDRAM&lt;/font&gt;&lt;/td&gt;&lt;td&gt;&lt;font face="Verdana, Ariel" size="1"&gt;66MHz&lt;/font&gt;&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;font face="Verdana, Ariel" size="1"&gt;1998&lt;/font&gt;&lt;/td&gt;&lt;td&gt;&lt;font face="Verdana, Ariel" size="1"&gt;PC100 SDRAM&lt;/font&gt;&lt;/td&gt;&lt;td&gt;&lt;font face="Verdana, Ariel" size="1"&gt;100MHz&lt;/font&gt;&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;font face="Verdana, Ariel" size="1"&gt;1999&lt;/font&gt;&lt;/td&gt;&lt;td&gt;&lt;font face="Verdana, Ariel" size="1"&gt;RDRAM&lt;/font&gt;&lt;/td&gt;&lt;td&gt;&lt;font face="Verdana, Ariel" size="1"&gt;800MHz&lt;/font&gt;&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;font face="Verdana, Ariel" size="1"&gt;1999/2000&lt;/font&gt;&lt;/td&gt;&lt;td&gt;&lt;font face="Verdana, Ariel" size="1"&gt;PC133 SRAM&lt;/font&gt;&lt;/td&gt;&lt;td&gt;&lt;font face="Verdana, Ariel" size="1"&gt;133MHz (VCM option)&lt;/font&gt;&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;&lt;font face="Verdana, Ariel" size="1"&gt;2000&lt;/font&gt;&lt;/td&gt;&lt;td&gt;&lt;font face="Verdana, Ariel" size="1"&gt;DDR SDRAM&lt;/font&gt;&lt;/td&gt;&lt;td&gt;&lt;font face="Verdana, Ariel" size="1"&gt;266MHz&lt;/font&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>5.2. MAJOR CHIP TECHNOLOGIES</title><link>https://technick.net/guides/hardware/umg/05_002/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/umg/05_002/</guid><description>&lt;hr /&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/hardware/umg/05_001"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/05_003"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt;&lt;a name="TOC"&gt;&lt;/a&gt;&lt;h3&gt;5.2. MAJOR CHIP TECHNOLOGIES&lt;/h3&gt;&lt;/p&gt;&lt;p&gt;It's usually pretty easy to tell memory module form factors apart because of physical differences. Most module form factors can support various memory technologies so, it's possible for two modules to appear to be the same when, in fact, they're not. For example, a 168-pin DIMM can be used for EDO, Synchronous DRAM, or some other type of memory. The only way to tell precisely what kind of memory a module contains is to interpret the marking on the chips. Each DRAM chip manufacturer has different markings and part numbers to identify the chip technology. &lt;/p&gt;&lt;p&gt;&lt;h4&gt;FAST PAGE MODE (FPM)&lt;/h4&gt; &#10;At one time, FPM was the most common form of DRAM found in computers. In fact, it was so common that people simply called it "DRAM," leaving off the "FPM". FPM offered an advantage over earlier memory technologies because it enabled faster access to data located within the same row. &lt;/p&gt;&lt;p&gt;&lt;h4&gt;EXTENDED DATA OUT (EDO)&lt;/h4&gt;In 1995, EDO became the next memory innovation. It was similar to FPM, but with a slight modification that allowed consecutive memory accesses to occur much faster. This meant the memory controller could save time by cutting out a few steps in the addressing process. EDO enabled the CPU to access memory 10 to 15% faster than with FPM. &lt;/p&gt;&lt;p&gt;&lt;h4&gt;SYNCHRONOUS DRAM (SDRAM)&lt;/h4&gt;In late 1996, SDRAM began to appear in systems. Unlike previous technologies, SDRAM is designed to synchronize itself with the timing of the CPU. This enables the memory controller to know the exact clock cycle when the requested data will be ready, so the CPU no longer has to wait between memory accesses. SDRAM chips also take advantage of interleaving and burst mode functions, which make memory retrieval even faster. SDRAM modules come in several different speeds so as to synchronize to the clock speeds of the systems they'll be used in. For example, PC66 SDRAM runs at 66MHz, PC100 SDRAM runs at 100MHz, PC133 SDRAM runs at 133MHz, and so on. Faster SDRAM speeds such as 200MHz and 266MHz are currently in development. &lt;/p&gt;&lt;p&gt;&lt;h4&gt;DOUBLE DATA RATE SYNCHRONOUS DRAM (DDR SDRAM)&lt;/h4&gt;DDR SDRAM, is a next-generation SDRAM technology. It allows the memory chip to perform transactions on both the rising and falling edges of the clock cycle. For example, with DDR SDRAM, a 100 or 133MHz memory bus clock rate yields an effective data rate of 200MHz or 266MHz. Systems using DDR SDRAM are expected to ship at the end of the year 2000. &lt;/p&gt;&lt;p&gt;&lt;h4&gt;DIRECT RAMBUS&lt;/h4&gt;Direct Rambus is a new DRAM architecture and interface standard that challenges traditional main memory designs. Direct Rambus technology is extraordinarily fast compared to older memory technologies. It transfers data at speeds up to 800MHz over a narrow 16-bit bus called a Direct Rambus Channel. This high-speed clock rate is possible due to a feature called "double clocked," which allows operations to occur on both the rising and falling edges of the clock cycle. Also, each memory device on an RDRAM module provides up to 1.6 gigabytes per second of bandwidth - twice the bandwidth available with current 100MHz SDRAM. &lt;br /&gt;&lt;br /&gt;In addition to chip technologies designed for use in main memory, there are also specialty memory technologies that have been developed for video applications. &lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>5.3. MEMORY TECHNOLOGIES FOR VIDEO OR GRAPHICS PROCESSING</title><link>https://technick.net/guides/hardware/umg/05_003/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/umg/05_003/</guid><description>&lt;hr /&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/hardware/umg/05_002"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/05_004"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt;&lt;a name="TOC"&gt;&lt;/a&gt;&lt;h3&gt;5.3. MEMORY TECHNOLOGIES FOR VIDEO OR GRAPHICS PROCESSING&lt;/h3&gt;&lt;/p&gt;&lt;p&gt;&lt;h4&gt;VIDEO RAM (VRAM)&lt;/h4&gt;VRAM is a video version of FPM technology. VRAM typically has two ports instead of one, which allows the memory to allocate one channel to refreshing the screen while the other is focused on changing the images on the screen. This works much more efficiently than regular DRAM when it comes to video applications. However, since video memory chips are used in much lower quantities than main memory chips, they tend to be more expensive. So, a system designer may choose to use regular DRAM in a video subsystem, depending on whether cost or performance is the design objective. &lt;/p&gt;&lt;p&gt;&lt;h4&gt;WINDOW RAM (WRAM)&lt;/h4&gt;WRAM is another type of dual-ported memory also used in graphics-intensive systems. It differs slightly from VRAM in that its dedicated display port is smaller and it supports EDO features. &lt;/p&gt;&lt;p&gt;&lt;h4&gt;SYNCHRONOUS GRAPHICS RAM (SGRAM)&lt;/h4&gt;SGRAM is a video-specific extension of SDRAM that includes graphics-specific read/write features. SGRAM also allows data to be retrieved and modified in blocks, instead of individually. This reduces the number of reads and writes that memory must perform and increases the performance of the graphics controller by making the process more efficient. &lt;/p&gt;&lt;p&gt;&lt;h4&gt;BASE RAMBUS AND CONCURRENT RAMBUS&lt;/h4&gt;Before it even became a contender for main memory, Rambus technology was actually used in video memory. The current Rambus main memory technology is called Direct Rambus. Two earlier forms of Rambus are Base Rambus and Concurrent Rambus. These forms of Rambus have been used in specialty video applications in some workstations and video game systems like Nintendo 64 for several years. &lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>5.4. OTHER MEMORY TECHNOLOGIES YOU MAY HAVE HEARD ABOUT</title><link>https://technick.net/guides/hardware/umg/05_004/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/umg/05_004/</guid><description>&lt;hr /&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/hardware/umg/05_003"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/05_005"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt;&lt;a name="TOC"&gt;&lt;/a&gt;&lt;h3&gt;5.4. OTHER MEMORY TECHNOLOGIES YOU MAY HAVE HEARD ABOUT&lt;/h3&gt;&lt;/p&gt;&lt;p&gt;&lt;h4&gt;ENHANCED SDRAM (ESDRAM)&lt;/h4&gt;In order to increase the speed and efficiency of standard memory modules, some manufacturers have incorporated a small amount of SRAM directly into the chip, effectively creating an on-chip cache. ESDRAM is essentially SDRAM, plus a small amount of SRAM cache, which allows for burst operations of up to 200MHz. Just as with external cache memory, the goal of cache DRAM is to hold the most frequently used data in the SRAM cache to minimize accesses to the slower DRAM. One advantage of on-chip SRAM is that it enables a wider bus between the SRAM and DRAM, effectively increasing the bandwidth and speed of the DRAM.&#10; &lt;/p&gt;&lt;p&gt;&lt;h4&gt;FAST CYCLE RAM (FCRAM)&lt;/h4&gt;FCRAM, co-developed by Toshiba and Fujitsu, is intended for specialty applications such as high-end servers, printers, and telecommunications switching systems. It includes memory array segmentation and internal pipelining that speed random access and reduce power consumption. &lt;/p&gt;&lt;p&gt;&lt;h4&gt;SYNCLINK DRAM (SLDRAM)&lt;/h4&gt;Though considered obsolete today, SLDRAM was developed by a consortium of DRAM manufacturers as an alternative to Rambus technology in the late 1990s. &lt;/p&gt;&lt;p&gt;&lt;h4&gt;VIRTUAL CHANNEL MEMORY (VCM)&lt;/h4&gt;Developed by NEC, VCM allows different "blocks" of memory to interface inde-pendently with the memory controller, each with its own buffer. This way, different system tasks can be assigned their own "virtual channels," and information related to one function does not share buffer space with other tasks occurring at the same time, making operations more efficient. &lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>5.5. ERROR CHECKING</title><link>https://technick.net/guides/hardware/umg/05_005/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/umg/05_005/</guid><description>&lt;hr /&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/hardware/umg/05_004"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/05_006"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt;&lt;a name="TOC"&gt;&lt;/a&gt;&lt;h3&gt;5.5. ERROR CHECKING&lt;/h3&gt;&lt;/p&gt;&lt;p&gt;Ensuring the integrity of data stored in memory is an important aspect of memory&#10;design. Two primary means of accomplishing this are &lt;b&gt;parity&lt;/b&gt; and &lt;b&gt;error correction code (ECC)&lt;/b&gt;.&lt;br /&gt;&lt;br /&gt;Historically, &lt;b&gt;parity&lt;/b&gt; has been the most commonly used data integrity method. &#10;Parity can detect - but not correct - single-bit errors. &lt;b&gt;Error Correction Code (ECC)&lt;/b&gt; &#10;is a more comprehensive method of data integrity checking that can detect and correct&#10;single-bit errors.&lt;br /&gt;&lt;br /&gt;Fewer and fewer PC manufacturers are supporting data integrity checking in their&#10;designs. This is due to a couple of factors. First, by eliminating support for parity&#10;memory, which is more expensive than standard memory, manufacturers can lower the&#10;price of their computers. Fortunately, this trend is complemented by the second&#10;factor: that is, the increased quality of memory components available from certain&#10;manufacturers and, as a result, the relative infrequency of memory errors.&lt;br /&gt;&lt;br /&gt;The type of data integrity checking depends on how a given computer system will&#10;be used. If the computer is to play a critical role - as a server, for example - then a&#10;computer that supports data integrity checking is an ideal choice. In general:&lt;br /&gt;&lt;br /&gt;&lt;ul&gt;&lt;li&gt;Most computers designed for use as high-end servers support ECC memory.&lt;/li&gt;&lt;li&gt;Most low-cost computers designed for use at home or for small businesses support&#10;non-parity memory.&lt;/li&gt;&lt;/ul&gt;&lt;/p&gt;</description></item><item><title>5.6. OTHER SPECIFICATIONS</title><link>https://technick.net/guides/hardware/umg/05_006/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/umg/05_006/</guid><description>&lt;hr /&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/hardware/umg/05_005"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/06_000"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt;&lt;a name="TOC"&gt;&lt;/a&gt;&lt;h3&gt;5.6. OTHER SPECIFICATIONS&lt;/h3&gt;&lt;/p&gt;&lt;p&gt;In addition to form factors, memory technologies, and error checking methods, there &#10;are several other specifications important to understanding and selecting memory &#10;products.&lt;/p&gt;&lt;p&gt;&lt;h4&gt;SPEED&lt;/h4&gt;The speed of memory components and modules is one of the most important&#10;factors in optimizing a memory configuration. In fact, all computer systems specify&#10;a memory component speed. Ensuring memory compatibility requires conforming&#10;to this specification. This section covers three measurements of memory component&#10;and module speed: access time, megahertz, and bytes per second.&lt;/p&gt;</description></item><item><title>6. ESD Standards</title><link>https://technick.net/guides/electronics/esd/006/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/esd/006/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/electronics/esd/005"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/esd/000"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/esd/007"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;6. ESD Standards&lt;/h3&gt;&lt;p&gt;In a world that is characterized by &lt;i&gt;change&lt;/i&gt;, the ESD industry seems to &#10;have jumped into the swirling eddy head-first. Control programs have mushroomed. &#10;Black has been replaced by green, blue and gold. Shielding bags dominate the &#10;warehouse. Ionizers exist along side wrist straps and ground cords. An early &#10;history of "smoke and mirrors," magic and lofty claims of performance is rapidly &#10;and safely being relegated to the past.&lt;/p&gt;&lt;p&gt;Today, meeting the complex challenge of reducing ESD losses requires more &#10;than reliance on faith alone. Users require a way to legitimately evaluate and &#10;compare competing brands and types of products. They need objective confirmation &#10;that their ESD control program provides effective solutions to their unique ESD &#10;problems. &lt;/p&gt;&lt;p&gt;That’s where standards come into play. They help define the sensitivity of &#10;the products manufactured and used. They help define the performance &#10;requirements for various ESD control instruments and tools. Standards are &#10;playing an ever increasing role in reducing marketplace confusion in the &#10;manufacture, evaluation, and selection of ESD control products and programs.&lt;/p&gt;&lt;p&gt;&lt;b&gt;The Who and Why of Standards&lt;br /&gt;&lt;/b&gt;Who uses ESD standards? Manufacturers &#10;of ESD control products; users of ESD control products; and third party testers &#10;of ESD control products.&lt;/p&gt;&lt;p&gt;Why use ESD standards? They help assure consistency of ESD sensitive products &#10;and consistency of ESD control products and services. They provide a means of &#10;objective evaluation and comparison among competitive ESD control products. They &#10;help reduce conflicts between users and suppliers of ESD control products. They &#10;help in auditing ESD control programs. And, they help reduce confusion in the &#10;marketplace.&lt;/p&gt;&lt;p&gt;In the United States, the use of standards is voluntary, although their use &#10;can be written into contracts or purchasing agreements between buyer and seller. &#10;In most of the rest of the world, the use of standards, where they exist, is &#10;compulsory.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Key Standards and Organizations&lt;br /&gt;&lt;/b&gt;Just 20 years ago, there were &#10;relatively few reliable ESD standards and few ESD standards development &#10;organizations. Today’s ESD standards landscape is not only witnessing an &#10;increase in the number of standards, but also increasing cooperation among the &#10;organizations that develop them.&lt;/p&gt;&lt;p&gt;Today’s standards fall into three main groups. First, there are those that &#10;provide ESD program guidance or requirements. These include documents such as &lt;i&gt;ANSI ESD S20.20-1999--Standard for the Development of an ESD Control Program, &#10;ANSI/ESD S8.1-ESD Awareness Symbols; ESD ADV2.0-ESD Handbook; EIA &#10;625-Requirements for Handling Electrostatic Discharge Sensitive Devices; or &#10;EN100015-Protection of Electrostatic Sensitive Devices.&lt;/i&gt; &lt;/p&gt;&lt;p&gt;A second group covers requirements for specific products or procedures such &#10;as packaging or grounding. Typical standards in this group are &lt;i&gt;ANSI/ESD &#10;S6.1-Grounding;&lt;/i&gt; or&lt;i&gt; EIA 541-Packaging of Electronic Products for &#10;Shipment&lt;/i&gt;.&lt;/p&gt;&lt;p&gt;A third group of documents covers the standardized test methods used to &#10;evaluate products and materials. Historically, the electronics industry has &#10;relied largely on test methods established for other industries or even other &#10;materials (&lt;i&gt;ASTM-257-DC Resistance or Conductance of Insulating &#10;Materials&lt;/i&gt;). Today, however, specific test method standards focus on ESD in &#10;the electronics environment, largely as a result of the ESD Association’s &#10;activity. These include standards such as &lt;i&gt;ESD S5.1-Device Testing, Human Body &#10;Model&lt;/i&gt; and &lt;i&gt;ANSI/ESD S7.1: Floor Materials -- Resistive &#10;Characterization&lt;/i&gt; to cite just a few.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Who Develops Standards?&lt;br /&gt;&lt;/b&gt;Standards development and usage is a &#10;cooperative effort among all organizations and individuals affected by &#10;standards. There are several key ESD standards development organizations.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Military Standards&lt;br /&gt;&lt;/b&gt;Traditionally the U.S. military developed and &#10;issued specific standards and specifications with regard to ESD control. Once a &#10;primary developer of ESD standards, US military agencies are taking a less &#10;proactive approach, relying on commercially developed standards rather than &#10;developing standards themselves. For example, the ESD Association has received &#10;the assignment from the Department of Defense to convert MIL-STD-1686 into a &#10;commercial standard. Among current military standards, &lt;i&gt;MIL-STD-1686 - &#10;Electrostatic Discharge Control Program&lt;/i&gt; and&lt;i&gt; MIL-HDBK-263 - Electrostatic &#10;Discharge Control Handbook&lt;/i&gt; are the predominant documents. The 1686 standard &#10;requires vendors to classify the ESD susceptibility of their components and have &#10;an ESD control program in place. The accompanying 263 Handbook provides &#10;guidelines and suggestions for ESD control programs and procedures.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Electronic Industries Alliance/JEDEC&lt;br /&gt;&lt;/b&gt;The Electronic Industry &#10;Alliance (EIA) and EIA’s Joint Electronics Development Engineering Council &#10;(JEDEC) are also active in standards development. &lt;i&gt;EIA 541 -- Packaging &#10;Material Standards for ESD Sensitive Items&lt;/i&gt; specifies test methods for the &#10;evaluation of packaging materials for protection of ESDS parts during shipment. &#10;JEDEC’s &lt;i&gt;EIA 625 Requirements for Handling Electrostatic-Discharge-Sensitive &#10;(ESDS) Devices&lt;/i&gt; establishes methods for semiconductor manufacturers, &#10;distributors, processing and testing facilities and users to use in protecting &#10;components that have human body model sensitivities of 200 volts or greater.&lt;/p&gt;&lt;p&gt;&lt;b&gt;ESD Association&lt;br /&gt;&lt;/b&gt;The ESD Association has been a focal point for the &#10;development of ESD standards in recent years. An ANSI-Accredited Standards &#10;Development Organization, the Association is charged with the development of ESD &#10;standards and test methods. It also represents the US on the International &#10;Electrotechnical Commission Technical Committee 101-Electrostatics.&lt;/p&gt;&lt;p&gt;The ESD Association has published 27 standards documents and 4 technical &#10;reports. These voluntary standards cover the areas of material requirements, &#10;electrostatic sensitivity, and test methodology for evaluating ESD control &#10;materials and products. In addition to standards documents, the Association also &#10;publishes a number of informational advisories.&lt;/p&gt;&lt;p&gt;&lt;b&gt;ESD Association Standards Classifications and Definitions&lt;br /&gt;&lt;/b&gt;There are &#10;four types of ESD Association standards documents with specific clarity of &#10;definition. The four document categories are consistent with other standards &#10;development organizations. These four categories are defined below.&lt;/p&gt;&lt;p&gt;&lt;b&gt;&lt;i&gt;&lt;b&gt;Standard&lt;/b&gt;&lt;/i&gt;:&lt;/b&gt; A precise statement of a set of requirements &#10;to be satisfied by a material, product, system or process that also specifies &#10;the procedures for determining whether each of the requirements is &#10;satisfied.&lt;/p&gt;&lt;p&gt;&lt;b&gt;&lt;i&gt;&lt;b&gt;Standard Test Method:&lt;/b&gt;&lt;/i&gt;&lt;/b&gt; A definitive procedure for the &#10;identification, measurement and evaluation of one or more qualities, &#10;characteristics or properties of a material, product, system or process that &#10;yields a reproducible test result.&lt;/p&gt;&lt;p&gt;&lt;i&gt;&lt;b&gt;Standard Practice:&lt;/b&gt;&lt;/i&gt; A procedure for performing one or more &#10;operations or functions that may or may not yield a test result. Note: If a test &#10;result is obtained, it may not be reproducible between labs.&lt;/p&gt;&lt;p&gt;&lt;i&gt;&lt;b&gt;Technical Report:&lt;/b&gt;&lt;/i&gt; A collection of technical data or test &#10;results published as an informational reference on a specific material, product, &#10;system, or process.&lt;/p&gt;&lt;p&gt;As new documents are approved and issued, they will be designated into one of &#10;these four new categories. Existing documents are being reviewed and will be &#10;reclassified as appropriate.&lt;/p&gt;&lt;p&gt;&lt;b&gt;International Standards&lt;br /&gt;&lt;/b&gt;The international community, led by the &#10;European-based International Electrotechnical Commission, has also climbed on &#10;board the standards express. Europe’s CENELEC has issued a European &#10;electrostatic standard&lt;i&gt; EN100015 - Protection of Electrostatic Sensitive &#10;Devices&lt;/i&gt; that was adopted as a European Norm. Additional work by the IEC to &#10;will result in a comprehensive series of standards that may someday be the &#10;successor to EN100015. &lt;/p&gt;&lt;p&gt;Japan also has released its proposed version of a national electrostatic &#10;Standard, which also shares many aspects of the European and U.S. documents.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Organizational Cooperation&lt;br /&gt;&lt;/b&gt;Perhaps one of the more intriguing &#10;changes in ESD standards has been the organizational cooperation developing &#10;between various groups. In revising &lt;i&gt;EIA541&lt;/i&gt;, the EIA and the ESD &#10;Association have implemented a cooperative effort to update the standard. &lt;/p&gt;&lt;p&gt;Another cooperative effort is underway between the ESD Association and the &#10;U.S. Department of Defense. The ESD Association prepared a commercial version of &lt;i&gt;MIL-STD-1686&lt;/i&gt;. It is anticipated that defense agencies will use that &#10;commercial version as a reference.&lt;/p&gt;&lt;p&gt;Internationally, European standards development organizations and the ESD &#10;Association have developed working relationships that result in an expanded &#10;review of proposed documents, greater input, and closer harmonization of &#10;standards that impact the international electronics community.&lt;/p&gt;&lt;p&gt;For users of ESD standards, this increased cooperation will have a &#10;significant impact. First, we should see standards that are technically improved &#10;due to broader input. Second, we should see fewer conflicts between different &#10;standards. Finally, we should see less duplication of effort.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Summary&lt;br /&gt;&lt;/b&gt;For the electronics community, the rapid propagation of ESD &#10;standards and continuing change in the standards environment mean greater &#10;availability of the technical references that will help improve ESD control &#10;programs. There will be recommendations to help set up effective programs. There &#10;will be test methods and specifications to help users of ESD control materials &#10;evaluate and select products that are applicable to their specific needs. And &#10;there will be guidelines for vendors of ESD products and materials to help them &#10;develop products that meet the real needs of their customers.&lt;/p&gt;&lt;p&gt;Standards will continue to fuel change in the international ESD &#10;community.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Principle ESD Standards&lt;/b&gt;&lt;/p&gt;&lt;p&gt;&lt;b&gt;U.S. Military/Department of Defense&lt;br /&gt;&lt;/b&gt;&lt;i&gt;MIL-STD-1686C :&lt;/i&gt; &lt;i&gt;Electrostatic Discharge Control Program for Protection of Electrical and &#10;Electronic Parts, Assemblies and Equipment (Excluding Electrically Initiated &#10;Explosive Devices&lt;b&gt;)&lt;br /&gt;&lt;/b&gt;&lt;/i&gt;This military standard establishes requirements &#10;for ESD Control Programs. It applies to U.S. military agencies, contractors, &#10;subcontractors, suppliers and vendors. It requires the establishment, &#10;implementation and documentation of ESD control programs for static sensitive &#10;devices, but does NOT mandate or preclude the use of any specific ESD control &#10;materials, products, or procedures. It is being updated and converted to a &#10;commercial standard by the ESD Association.&lt;/p&gt;&lt;p&gt;&lt;i&gt;MIL-HBDK-263B: Electrostatic Discharge Control Handbook for Protection of &#10;Electrical and Electronic Parts, Assemblies and Equipment (Excluding &#10;Electrically Initiated Explosive Devices)&lt;br /&gt;&lt;/i&gt;This document provides &#10;guidance, but NOT mandatory requirements, for the establishment and &#10;implementation of an electrostatic discharge control program in accordance with &#10;the requirements of MIL-STD-1686. &lt;/p&gt;&lt;p&gt;&lt;i&gt;MIL-PRF 87893—Workstation, Electrostatic Discharge (ESD) &#10;Control&lt;br /&gt;&lt;/i&gt;This document defines the requirements for ESD protective &#10;workstations.&lt;/p&gt;&lt;p&gt;&lt;i&gt;MIL-B-81705—Barrier Materials, Flexible, Electrostatic Protective, Heat &#10;Sealable&lt;br /&gt;&lt;/i&gt;This documents defines requirements for ESD protective flexible &#10;packaging materials.&lt;/p&gt;&lt;p&gt;&lt;i&gt;MIL-STD-129—Marking for Shipment and Storage&lt;br /&gt;&lt;/i&gt;Covers procedures for &#10;marketing and labeling ESD sensitive items.&lt;/p&gt;&lt;p&gt;&lt;b&gt;EIA/JEDEC&lt;br /&gt;&lt;/b&gt;&lt;i&gt;EIA541—Packaging Material Standards for ESD Sensitive &#10;Items&lt;br /&gt;&lt;/i&gt;This document covers packaging materials and definitions of &#10;material types for ESD sensitive items.&lt;/p&gt;&lt;p&gt;&lt;i&gt;EIA-625: Requirements for Handling Electrostatic-Discharge-Sensitive &#10;(ESDS) Devices&lt;br /&gt;&lt;/i&gt;This voluntary standard establishes minimum requirements &#10;for ESD control methods and materials used to protect electronic devices that &#10;have human body model sensitivities of 200 volts or greater. It is applicable to &#10;semiconductor manufacturers, semiconductor distributors, semiconductor &#10;processing and testing facilities, and semiconductor users. It is currently &#10;being revised and updated with a reduced scope.&lt;/p&gt;&lt;p&gt;&lt;b&gt;International/European&lt;br /&gt;&lt;/b&gt;&lt;i&gt;EN100015: Protection of Electrostatic &#10;Sensitive Devices&lt;br /&gt;&lt;/i&gt;Adopted in 1992 and 1993, this European Norm covers ESD &#10;handling practices for electronic devices. &lt;/p&gt;&lt;p&gt;&lt;b&gt;ESD Association&lt;/b&gt;&lt;/p&gt;&lt;p&gt;&lt;b&gt;Standards Documents&lt;br /&gt;&lt;/b&gt;&lt;i&gt;&lt;b&gt;Standards, Standard Test Methods and &#10;Standard Practices&lt;/b&gt;&lt;/i&gt;&lt;i&gt; have completed the industry comment and review &#10;process, and the document has been approved by the Standards Committee as a &#10;Final Standard Document.&lt;/i&gt;&lt;/p&gt;&lt;p&gt;&lt;i&gt;ESD S1.1—1998: Evaluation, Acceptance, and Functional Testing of Wrist &#10;Straps.&lt;br /&gt;&lt;/i&gt;A successor to the EOS/ESD S1.0, this document establishes test &#10;methods for evaluating the electrical and mechanical characteristics of wrist &#10;straps. It includes improved test methods and performance limits for evaluation, &#10;acceptance, and functional testing of wrist straps.&lt;/p&gt;&lt;p&gt;&lt;i&gt;ESD STM2.1—1997: Resistance Test Method for Electrostatic Discharge &#10;Protective Garments&lt;br /&gt;&lt;/i&gt;This Standard Test Method provides test methods for &#10;measuring the electrical resistance of garments used to control electrostatic &#10;discharge. It covers procedures for measuring sleeve-to-sleeve and &#10;point-to-point resistance.&lt;/p&gt;&lt;p&gt;&lt;i&gt;ANSI EOS/ESD S3.1-1991: Ionization &lt;br /&gt;&lt;/i&gt;Test methods and procedures for &#10;evaluating and selecting air ionization equipment and systems are covered in &#10;this standard. The document establishes measurement techniques to determine ion &#10;balance and charge neutralization time for ionizers.&lt;/p&gt;&lt;p&gt;&lt;i&gt;ESD S4.1- 1997(Revised): Worksurfaces – Resistance &#10;Measurements&lt;br /&gt;&lt;/i&gt;This Standard establishes test methods for measuring the &#10;electrical resistance of worksurface materials used at workstations for &#10;protection of ESD susceptible items. It includes methods for evaluating and &#10;selecting materials, and testing new worksurface installations and previously &#10;installed worksurfaces.&lt;/p&gt;&lt;p&gt;&lt;i&gt;ESD STM4.2-1998: Worksurfaces - Charge Dissipation &#10;Characteristics&lt;br /&gt;&lt;/i&gt;This Standard Test Method provides a test method to &#10;measure the electrostatic charge dissipation characteristics of worksurfaces &#10;used for ESD control. The procedure is designed for use in a laboratory &#10;environment for qualification, evaluation or acceptance of worksurfaces.&lt;/p&gt;&lt;p&gt;&lt;i&gt;ESD STM5.1-1998&lt;/i&gt; &lt;i&gt;Revised: Electrostatic Discharge Sensitivity &#10;Testing -- Human Body Model&lt;br /&gt;&lt;/i&gt;This Standard Test Method updates and revises &#10;an existing Standard. It establishes a procedure for testing, evaluating and &#10;classifying the ESD sensitivity of components to the defined Human Body Model &#10;(HBM).&lt;/p&gt;&lt;p&gt;&lt;i&gt;ESD STM5.2-1999 (Revised): Electrostatic Discharge Sensitivity Testing -- &#10;Machine Model&lt;br /&gt;&lt;/i&gt;This Standard establishes a test procedure for evaluating &#10;the ESD sensitivity of components to a defined Machine Model. It also provides a &#10;system of classifying the sensitivity of these components. The component damage &#10;caused by the Machine Model is often similar to that caused by the Human Body &#10;Model, but it occurs at a significantly lower voltage.&lt;/p&gt;&lt;p&gt;&lt;i&gt;ESD S6.1-1999: Grounding -- Recommended Practice&lt;br /&gt;&lt;/i&gt;This Standard &#10;recommends the parameters, procedures, and types of materials needed to &#10;establish an ESD grounding system for the protection of electronic hardware from &#10;ESD damage. This system is used for personnel grounding devices, worksurfaces, &#10;chairs, carts, floors, and other related equipment.&lt;/p&gt;&lt;p&gt;&lt;i&gt;ANSI ESD S7.1-1994: Floor Materials -- Resistive Characterization of &#10;Materials &lt;br /&gt;&lt;/i&gt;Measurement of the electrical resistance of various floor &#10;materials such as floor coverings, mats, and floor finishes is covered in this &#10;document. It provides test methods for qualifying floor materials before &#10;installation or application and for evaluating and monitoring materials after &#10;installation or application.&lt;/p&gt;&lt;p&gt;&lt;i&gt;ANSI ESD S8.1-1993: ESD Awareness Symbols&lt;br /&gt;&lt;/i&gt;Three types of ESD &#10;awareness symbols are established by this document. The first one is to be used &#10;on a device or assembly to indicate that it is susceptible to electrostatic &#10;charge. The second is to be used on items and materials intended to provide &#10;electrostatic protection. The third symbol indicates the common point ground&lt;/p&gt;&lt;p&gt;&lt;i&gt;ESD S9.1-1995: Resistive Characterization of Footwear&lt;br /&gt;&lt;/i&gt;This Standard &#10;defines a test method for measuring the electrical resistance of shoes used for &#10;ESD control in the electronics environment.&lt;/p&gt;&lt;p&gt;&lt;i&gt;ANSI ESD S11.11-1993: Surface Resistance Measurement of Static Dissipative &#10;Planar Materials &lt;br /&gt;&lt;/i&gt;This Standard defines a direct current test method for &#10;measuring electrical resistance. The Standard is designed specifically for &#10;static dissipative planar materials used in packaging of ESD sensitive devices &#10;and components.&lt;/p&gt;&lt;p&gt;&lt;i&gt;ANSI ESD S11.31-1994: Evaluating the Performance of Electrostatic &#10;Discharge Shielding Bags &lt;br /&gt;&lt;/i&gt;This Standard provides a method for testing and &#10;determining the shielding capabilities of electrostatic shielding bags.&lt;/p&gt;&lt;p&gt;&lt;i&gt;ESD STM12.1-1997: Seating-Resistive Characterization&lt;br /&gt;&lt;/i&gt;This Standard &#10;provides test methods for measuring the electrical resistance of seating used to &#10;control ESD. The test methods can be used for qualification testing as well as &#10;for evaluating and monitoring seating after installation. It covers all types of &#10;seating, including chairs and stools.&lt;/p&gt;&lt;p&gt;&lt;i&gt;ANSI ESD S20.20-1999: Standard for the development of an ESD Control &#10;Program&lt;br /&gt;&lt;/i&gt;This Standard provides administrative, technical requirements and &#10;guidance for establishing, implementing and maintaining an ESD Control &#10;Program.&lt;/p&gt;&lt;p&gt;&lt;i&gt;ESD STM97.1-1999: Floor Materials and Footwear – Resistance Measurement in &#10;Combination with a Person.&lt;br /&gt;&lt;/i&gt;This Standard Test Method provides for &#10;measuring the electrical resistance of floor materials, footwear and personnel &#10;together, as a system.&lt;/p&gt;&lt;p&gt;&lt;i&gt;ESD STM97.2-1999: Floor Materials and Footwear – Voltage Measurement in &#10;Combination with a Person.&lt;br /&gt;&lt;/i&gt;This Standard Test Method provides for &#10;measuring the electrostatic voltage on a person in combination with floor &#10;materials and footwear, as a system.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Draft Documents&lt;br /&gt;&lt;/b&gt;&lt;i&gt;&lt;b&gt;Draft&lt;/b&gt;&lt;/i&gt;&lt;i&gt; documents have not yet &#10;completed an industry comment and review stage necessary before being issued as &#10;full standards documents. Draft documents are subject to revision before being &#10;approved as full standards documents.&lt;/i&gt;&lt;/p&gt;&lt;p&gt;&lt;i&gt;ESD DSP3.3—1997: Periodic Verification of Air Ionizers.&lt;br /&gt;&lt;/i&gt;This Draft &#10;Standard practice provides a measurement technique to periodically determine ion &#10;balance and charge neutralization time for ionizers in actual use locations.&lt;/p&gt;&lt;p&gt;&lt;i&gt;EOS/ESD DS5.3-1996: Electrostatic Discharge Sensitivity Testing - Charged &#10;Device Model &lt;br /&gt;&lt;/i&gt;This Draft Standard establishes a test method for &#10;evaluating the ESD sensitivity of active and passive components to a defined &#10;charged device model.&lt;/p&gt;&lt;p&gt;&lt;i&gt;ESD DSP10.1-1999: Automated Handling Equipment&lt;br /&gt;&lt;/i&gt;This draft Standard &#10;Practice provides test methods for evaluating the ESD ground integrity; charge &#10;generation and charge accumulation on devices in automated handling &#10;equipment&lt;/p&gt;&lt;p&gt;&lt;i&gt;ESD DS11.12-1996: Volume Resistance Measurement of Static Dissipative &#10;Planar Materials&lt;br /&gt;&lt;/i&gt;This Draft Standard provides test methods for measuring &#10;the volume resistance of static dissipative, planar materials.&lt;/p&gt;&lt;p&gt;&lt;i&gt;ESD DS13.1-1999: Measuring Electrical Potential from Electrical Soldering &#10;&amp;amp; Desoldering Hand Tools&lt;br /&gt;&lt;/i&gt;This Draft Standard provides Test Methods &#10;for measuring the electrical leakage and tip to ground reference point &#10;resistance of electric soldering/desoldering hand tolls. It also provides &#10;parameters for EOS safe soldering operations.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Advisory Documents&lt;br /&gt;&lt;/b&gt;&lt;i&gt;&lt;b&gt;Advisory&lt;/b&gt; Documents are not Standards, &#10;but provide general information for the industry or additional information to &#10;aid in better understanding of Association Standards.&lt;/i&gt;&lt;/p&gt;&lt;p&gt;&lt;i&gt;ESD ADV1.0-1994: Glossary of Terms&lt;br /&gt;&lt;/i&gt;Definitions and explanations of &#10;various terms used in Association Standards and documents are covered in this &#10;Advisory. It also includes other terms commonly used in the ESD industry.&lt;/p&gt;&lt;p&gt;&lt;i&gt;ESD ADV2.0-1994: ESD Handbook&lt;br /&gt;&lt;/i&gt;The &lt;i&gt;ESD Handbook&lt;/i&gt; is a complete &#10;guide to static control in the work place. Nineteen chapters cover ESD basics, &#10;control procedures, auditing, symbols, device testing, standards.&lt;/p&gt;&lt;p&gt;&lt;i&gt;ESD ADV3.2-1995: Selection and Acceptance of Air Ionizers&lt;br /&gt;&lt;/i&gt;This &#10;Advisory document provides end users with guidelines for creating a performance &#10;specification for selecting air ionization systems. It reviews four types of air &#10;ionizers and discusses applications, test method references, and general design, &#10;performance and safety requirements.&lt;/p&gt;&lt;p&gt;&lt;i&gt;ESD ADV11.2-1995: Triboelectric Charge Accumulation Testing&lt;br /&gt;&lt;/i&gt;The &#10;complex phenomenon of triboelectric charging is discussed in this Advisory. It &#10;covers the theory and effects of tribocharging. It reviews procedures and &#10;problems associated with various test methods that are often used to evaluate &#10;triboelectrification characteristics. The test methods reviewed indicate gross &#10;levels of charge and polarity, but are unrepeatable if used to give more exact &#10;values in real world situations.&lt;/p&gt;&lt;p&gt;&lt;i&gt;ESD ADV53.1-1995: ESD Protective Workstations&lt;br /&gt;&lt;/i&gt;This Advisory &#10;document defines the minimum requirements for a basic ESD protective workstation &#10;used in ESD sensitive areas. It provides a test method for evaluating and &#10;monitoring workstations. It defines workstations as having the following &#10;components: support structure, static dissipative worksurface, a means of &#10;grounding personnel, and any attached shelving or drawers.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Sources of Standards &lt;/b&gt;&lt;/p&gt;&lt;ul&gt; &lt;li&gt;&lt;b&gt;&lt;/b&gt;ESD Association, 7900 Turin Road, Building 3, Suite 2, Rome, NY &#10; 13440. Phone: 315-339-6937. Fax: +1 315-339-6793. Web Site: &lt;a href="http://www.esda.org/" target="_blank"&gt;http://www.esda.org/&lt;/a&gt; &#10; &lt;/li&gt;&lt;li&gt;Electronic Industries Alliance/JEDEC, 2001 Pennsylvania Ave., NW, &#10; Washington, DC 20006. Phone: 202-457-4900. Fax: 202-457-4985. Web Site: &lt;a href="http://www.eia.org/" target="_blank"&gt;http://www.eia.org/&lt;/a&gt; &#10; &lt;/li&gt;&lt;li&gt;HIS Global Engineering Documents, 15 Inverness Way East, Englewood, CO &#10; 80112. Phone: 800-854-7179. Fax: 303-397-2740. Web Site: &lt;a href="http://global.ihs.com/" target="_blank"&gt;http://global.ihs.com/&lt;/a&gt; &#10; &lt;/li&gt;&lt;li&gt;International Electrotechnical Commission, 3, rue de Varembe, Case postale &#10; 131, 1211 Geneva 20, Switzerland. Fax: 41-22-919-0300. Web Site: &lt;a href="http://www.iec.ch/" target="_blank"&gt;http://www.iec.ch/&lt;/a&gt; &#10; &lt;/li&gt;&lt;li&gt;Military Standards, Naval Publications and Forms Center, 5801 Tabor &#10; Avenue, Philadelphia, PA 19120. &lt;/li&gt;&lt;/ul&gt;&lt;dir&gt;&lt;/dir&gt;&lt;/blockquote&gt;</description></item><item><title>6. WHAT TO CONSIDER WHEN BUYING MEMORY</title><link>https://technick.net/guides/hardware/umg/06_000/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/umg/06_000/</guid><description>&lt;hr /&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/hardware/umg/05_006"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/06_001"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt;&lt;a name="TOC"&gt;&lt;/a&gt;&lt;h3&gt;6. WHAT TO CONSIDER WHEN BUYING MEMORY&lt;/h3&gt;&lt;/p&gt;&lt;p&gt;One of the quickest and easiest ways to identify the right memory modules and&#10;expansion options for your computer is to use a memory configurator. Like some&#10;of the other major memory manufacturers, Kingston makes a memory configurator&#10;available. You can access Kingston's configurator through their home page at&#10;www.kingston.com.&lt;br /&gt;&lt;br /&gt;The most important thing to ensure when buying memory is compatibility with&#10;your system. In addition, you'll need to decide how much memory you need and&#10;beyond that lie considerations of price, quality, availability, service, and warranty.&#10;This section helps you address these important decision factors and helps you&#10;answer questions like these:&lt;br /&gt;&lt;br /&gt;&lt;ul&gt;&lt;li&gt;How much memory do I need?&lt;/li&gt;&lt;li&gt;How much memory will my system recognize?&lt;/li&gt;&lt;li&gt;What kind of memory is compatible with my system?&lt;/li&gt;&lt;li&gt;How many sockets are open and how should I fill them?&lt;/li&gt;&lt;li&gt;How do I determine the quality of memory?&lt;/li&gt;&lt;li&gt;What should I know about memory prices?&lt;/li&gt;&lt;li&gt;What other issues should I consider?&lt;/li&gt;&lt;/ul&gt;&lt;br /&gt;&lt;br /&gt;&lt;ul&gt;&lt;li&gt;&lt;a href="https://technick.net/guides/hardware/umg/06_001"&gt;6.1. COMPATIBILITY&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href="https://technick.net/guides/hardware/umg/06_002"&gt;6.2. HOW TO READ A BANK SCHEMA&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href="https://technick.net/guides/hardware/umg/06_003"&gt;6.3. QUALITY&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href="https://technick.net/guides/hardware/umg/06_004"&gt;6.4. PRICING AND AVAILABILITY&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>6.1. COMPATIBILITY</title><link>https://technick.net/guides/hardware/umg/06_001/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/umg/06_001/</guid><description>&lt;hr /&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/hardware/umg/06_000"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/06_002"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt;&lt;a name="TOC"&gt;&lt;/a&gt;&lt;h3&gt;6.1. COMPATIBILITY&lt;/h3&gt;&lt;/p&gt;&lt;p&gt;As mentioned earlier, compatibility of memory components with your computer&#10;system is arguably the most important factor to consider when upgrading memory.&#10;This section can get you started; it also makes frequent mention of the advantages&#10;of using a memory configurator.&lt;/p&gt;&lt;p&gt;&lt;h4&gt;WHAT KIND OF MEMORY IS COMPATIBLE WITH MY SYSTEM?&lt;/h4&gt;The easiest way to determine what type of memory goes with your system is to&#10;consult with your system documentation. If you need further assistance, consult a&#10;memory configurator available from many sources, including Kingston. Kingston&#10;and other brand-name memory companies offer such a tool to help you find the&#10;right memory configuration for your system.&lt;br /&gt;&lt;br /&gt;With Kingston's configurator, you can search by five different criteria:&lt;br /&gt;&lt;br /&gt;&lt;ul&gt;&lt;li&gt;System manufacturer/model&lt;/li&gt;&lt;li&gt;Computer model name&lt;/li&gt;&lt;li&gt;Memory module part number (Kingston, distributor, manufacturer)&lt;/li&gt;&lt;li&gt;Specification&lt;/li&gt;&lt;li&gt;Generic memory&lt;/li&gt;&lt;/ul&gt;To access Kingston's Memory Configurator, click here&lt;/p&gt;&lt;p&gt;&lt;h4&gt;WHAT IF I CAN'T FIND MY SYSTEM IN A MEMORY CONFIGURATOR?&lt;/h4&gt;If you can't find your system in the memory configuration programs, you can still&#10;find out what kind of memory you need by consulting the manual that came with&#10;your system. In most cases, the manual will provide basic specifications such as the&#10;speed and technology of the memory you need. This information is usually enough&#10;to choose a module by specification. If you don't feel you have enough information,&#10;you can call your system manufacturer or Kingston's toll-free technical support&#10;number for assistance.&lt;/p&gt;&lt;p&gt;&lt;h4&gt;HOW MANY SOCKETS DO I HAVE OPEN?&lt;/h4&gt;You may or may not have an idea what the inside of your computer looks like and how&#10;memory is configured. You may have opened up your computer when you bought it to&#10;see the configuration inside, or you may have looked at a configuration diagram in your&#10;user's manual. Even if you have no idea of the memory configuration of your system,&#10;you can use Kingston's memory configuration tools to find out. For each system, the&#10;configuration includes a diagram, called a &lt;b&gt;bank schema&lt;/b&gt;, which indicates how the&#10;memory sockets are arranged in your system and what the basic configuration rules are.&#10;The simple tutorial on the next page outlines how to use a bank schema diagram to&#10;determine the number of sockets in your system and how to fill them.&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>6.2. HOW TO READ A BANK SCHEMA</title><link>https://technick.net/guides/hardware/umg/06_002/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/umg/06_002/</guid><description>&lt;hr /&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/hardware/umg/06_001"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/06_003"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt;&lt;a name="TOC"&gt;&lt;/a&gt;&lt;h3&gt;6.2. HOW TO READ A BANK SCHEMA&lt;/h3&gt;A bank schema is a diagram of rows and columns that shows the number of&#10;memory sockets in your system. This diagram is a theoretical bank layout and not&#10;an actual system board layout; it is designed to help you quickly determine configuration&#10;requirements when adding memory modules.&lt;br /&gt;&lt;br /&gt;In a bank schema, each &lt;img src="https://technick.net/img/guide_umg/guide_umg_030.gif" width="37" height="9" border="0" alt="" /&gt; represents a &lt;b&gt;memory socket&lt;/b&gt;:&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Example:&lt;/b&gt; &lt;img src="https://technick.net/img/guide_umg/guide_umg_030.gif" width="37" height="9" border="0" alt="" /&gt; &lt;img src="https://technick.net/img/guide_umg/guide_umg_030.gif" width="37" height="9" border="0" alt="" /&gt; &lt;img src="https://technick.net/img/guide_umg/guide_umg_030.gif" width="37" height="9" border="0" alt="" /&gt; &lt;img src="https://technick.net/img/guide_umg/guide_umg_030.gif" width="37" height="9" border="0" alt="" /&gt; = 4 memory sockets&lt;br /&gt;&lt;br /&gt;Each column in the diagram represents a &lt;b&gt;memory bank&lt;/b&gt;. The number of " "&#10;symbols in a column represents the number of memory sockets in a bank.&#10;Upgrading is performed one bank at a time. For example, if there are four columns&#10;with two &lt;img src="https://technick.net/img/guide_umg/guide_umg_030.gif" width="37" height="9" border="0" alt="" /&gt; in each column, upgrading is done two modules at a time. However,&#10;if there is just a single row of &lt;img src="https://technick.net/img/guide_umg/guide_umg_030.gif" width="37" height="9" border="0" alt="" /&gt;, upgrading may be performed one module at a time.&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Examples:&lt;/b&gt;&lt;br /&gt;&lt;br /&gt;8 sockets = &lt;img src="https://technick.net/img/guide_umg/guide_umg_030.gif" width="37" height="9" border="0" alt="" /&gt; &lt;img src="https://technick.net/img/guide_umg/guide_umg_030.gif" width="37" height="9" border="0" alt="" /&gt; &lt;img src="https://technick.net/img/guide_umg/guide_umg_030.gif" width="37" height="9" border="0" alt="" /&gt; &lt;img src="https://technick.net/img/guide_umg/guide_umg_030.gif" width="37" height="9" border="0" alt="" /&gt; &lt;img src="https://technick.net/img/guide_umg/guide_umg_030.gif" width="37" height="9" border="0" alt="" /&gt; &lt;img src="https://technick.net/img/guide_umg/guide_umg_030.gif" width="37" height="9" border="0" alt="" /&gt; &lt;img src="https://technick.net/img/guide_umg/guide_umg_030.gif" width="37" height="9" border="0" alt="" /&gt; &lt;img src="https://technick.net/img/guide_umg/guide_umg_030.gif" width="37" height="9" border="0" alt="" /&gt;&lt;br /&gt;(Modules may be installed one at a time in any combination)&lt;br /&gt;&lt;br /&gt;&lt;table&gt;&lt;tr&gt;&lt;td&gt;&lt;font face="Veranda" size="2"&gt;8 sockets (4 banks of 2) =&lt;/font&gt;&lt;/td&gt;&lt;td&gt;&lt;img src="https://technick.net/img/guide_umg/guide_umg_030.gif" width="37" height="9" border="0" alt="" /&gt; &lt;img src="https://technick.net/img/guide_umg/guide_umg_030.gif" width="37" height="9" border="0" alt="" /&gt; &lt;img src="https://technick.net/img/guide_umg/guide_umg_030.gif" width="37" height="9" border="0" alt="" /&gt; &lt;img src="https://technick.net/img/guide_umg/guide_umg_030.gif" width="37" height="9" border="0" alt="" /&gt;&lt;br /&gt; &lt;img src="https://technick.net/img/guide_umg/guide_umg_030.gif" width="37" height="9" border="0" alt="" /&gt; &lt;img src="https://technick.net/img/guide_umg/guide_umg_030.gif" width="37" height="9" border="0" alt="" /&gt; &lt;img src="https://technick.net/img/guide_umg/guide_umg_030.gif" width="37" height="9" border="0" alt="" /&gt; &lt;img src="https://technick.net/img/guide_umg/guide_umg_030.gif" width="37" height="9" border="0" alt="" /&gt; &lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;(Modules must be installed two at a time)&lt;br /&gt;&lt;br /&gt;&lt;table width="445" border="0"&gt;&lt;tr&gt;&lt;td&gt;&lt;font face="Veranda" size="2"&gt;4 sockets (1 bank of 4) =&lt;/font&gt;&lt;/td&gt;&lt;td&gt;&lt;img src="https://technick.net/img/guide_umg/guide_umg_030.gif" width="37" height="9" border="0" alt="" /&gt; &lt;br /&gt;&lt;img src="https://technick.net/img/guide_umg/guide_umg_030.gif" width="37" height="9" border="0" alt="" /&gt; &lt;br /&gt;&lt;img src="https://technick.net/img/guide_umg/guide_umg_030.gif" width="37" height="9" border="0" alt="" /&gt; &lt;br /&gt;&lt;img src="https://technick.net/img/guide_umg/guide_umg_030.gif" width="37" height="9" border="0" alt="" /&gt; &lt;/td&gt;&lt;td&gt;&lt;font face="Veranda" size="2"&gt;(Modules must be installed four &lt;br /&gt;at a time)&lt;/font&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;br /&gt;The &lt;b&gt;standard memory&lt;/b&gt; (base amount that the system was shipped with) appears in&#10;the diagram as either &lt;b&gt;removable&lt;/b&gt; or &lt;b&gt;non-removable&lt;/b&gt;.&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Removable memory&lt;/b&gt; comes in the form of modules that fit into memory sockets,&#10;and, if desired, can be removed and replaced with modules of higher capacity.&#10;Removable memory is represented by a "&lt;img src="https://technick.net/img/guide_umg/guide_umg_031.gif" width="37" height="12" border="0" alt="" /&gt;" &#10;symbol with a number next to it: &lt;img src="https://technick.net/img/guide_umg/guide_umg_031.gif" width="37" height="12" border="0" alt="" /&gt; 4 &lt;img src="https://technick.net/img/guide_umg/guide_umg_030.gif" width="37" height="9" border="0" alt="" /&gt; that a 4MB module is in the first socket and that the second socket is empty.&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Non-removable memory&lt;/b&gt; usually comes in the form of memory chips soldered&#10;directly onto the system board. It is represented in the bank schema in brackets:&#10;[_4MB_] indicates 4MB of non-removable memory soldered onto the board and two available &#10;memory sockets.&lt;br /&gt;&lt;br /&gt;If your system is not included in the configurator, you may be able to find out how&#10;many sockets are in the system and how many are filled by pressing the F1 key during&#10;system startup. If your system supports this, a screen will appear that indicates how&#10;many memory sockets are in the system, which ones are filled and which are open, and&#10;what capacity modules are in each socket. If pressing the F1 key during startup doesn't&#10;produce this result, check your computer's system manual for more information.&lt;br /&gt;&lt;br /&gt;As a last resort, you can open your computer and take a look at the sockets.&#10;(Important Note: Before removing the cover of your computer, refer to the&#10;computer's system manual and warranty information for instructions and other&#10;relevant information.) If you do open the computer, you may be able to identify&#10;"bank labels" that indicate whether memory are installed in pairs. Bank numbering&#10;typically begins with 0 instead of 1. So, if you have two banks, the first bank will&#10;be labeled "bank 0", and the second bank will be labeled "bank 1."&lt;br /&gt;&lt;br /&gt;&lt;/p&gt;</description></item><item><title>6.3. QUALITY</title><link>https://technick.net/guides/hardware/umg/06_003/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/umg/06_003/</guid><description>&lt;hr /&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/hardware/umg/06_002"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/06_004"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt;&lt;a name="TOC"&gt;&lt;/a&gt;&lt;h3&gt;6.3. QUALITY&lt;/h3&gt;&lt;/p&gt;&lt;p&gt;As with any type of product, memory can vary in the quality from one manufacturer&#10;to another. In general, the larger, more established brand name companies are more&#10;consistent in adhering to tight design specifications, using high-quality components,&#10;and establishing certified quality control processes for manufacturing and thorough&#10;testing. That's not to say that lower-quality modules don't work fine - they may be&#10;the right solution, depending on how hard you work your system. In deciding the&#10;level of quality you require, consider the following:&lt;br /&gt;&lt;br /&gt;&lt;ol&gt;&lt;li&gt;If the memory you buy doesn't perform well, will you be comfortable returning&#10;it for a replacement? Would you have the time to deal with removing the&#10;memory and waiting a couple of days to a week to get the situation resolved?&lt;br /&gt;&lt;br /&gt;&lt;/li&gt;&lt;li&gt;When memory is of low quality, you often experience intermittent problems,&#10;such as the computer "freezing" unexpectedly, or having frequent errors. How&#10;often do you save your work, and if you were to lose your work, how much&#10;would that cost you? If you use your computer to play games, read email, and&#10;surf the Internet, such interruptions and losses may not be a big problem. But if&#10;you're running a business, losing a few hours of work could be a serious matter.&lt;br /&gt;&lt;br /&gt;&lt;/li&gt;&lt;li&gt;The biggest risk with unreliable memory is data corruption: that is, some bits&#10;of data may change or be read incorrectly. The result of data corruption could&#10;be as harmless as a syntax error in a document, or as potentially serious as a&#10;miscalculation in a spreadsheet. How important is the accuracy of the work&#10;you do on your computer? Again, if you use your computer for gaming, writing&#10;letters, and the Internet, it may not be a problem. But if you're managing your&#10;finances, you may want to do all you can to assure the reliability of your data.&lt;br /&gt;&lt;br /&gt;&lt;/li&gt;&lt;li&gt;Just like all products, the quality and durability you require depends on how&#10;you use it. Computer applications that require a lot of memory usually work&#10;the memory very hard. These applications often work better with memory that&#10;exceeds the system's speed and reliability specifications. If you're working in&#10;multimedia or using heavy number-crunching programs, the chance of a&#10;lower-quality memory module failing is greater than if you're only doing light&#10;work, such as simple word processing.&lt;/li&gt;&lt;/ol&gt;&lt;/p&gt;</description></item><item><title>6.4. PRICING AND AVAILABILITY</title><link>https://technick.net/guides/hardware/umg/06_004/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/umg/06_004/</guid><description>&lt;hr /&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/hardware/umg/06_003"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/07_000"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt;&lt;a name="TOC"&gt;&lt;/a&gt;&lt;h3&gt;6.4. PRICING AND AVAILABILITY&lt;/h3&gt;&lt;/p&gt;&lt;p&gt;This section contains information that helps make sense of the fluctuations that can occur in the memory market.&lt;/p&gt; &lt;p&gt;&lt;h4&gt;THE DRAM CHIP MARKET&lt;/h4&gt;Memory modules are made with DRAM chips, which are manufactured in mass quantities in enormous fabrication plants (often referred to as "fabs"). Fabs can take up to two years to build and require substantial capital investment: approximately $3 billion per plant. These time and cost factors directly affect on the ability of the memory market to adjust quickly to fluctuations in supply and demand. When demand for memory chips increases, chip manufacturers typically do not respond immediately because the investment required to add more capacity is substantial and may not pay off, especially if all the competitors are doing so at the same time. Therefore, the immediate effect is that prices rise as manufacturers assess whether the increase on demand is temporary or substantial enough to warrant investment. By the same token, when there is an oversupply situation in the market, chip manufacturers are willing to sustain losses for a long time while prices fall to below breakeven levels. This is because in many cases it costs more money to shut a plant down than to continue to produce and sell chips at below cost. Also, the longer a manufacturer can hold on, the greater the chance of "being there" to reap the rewards when competitors reduce capacity and the market turns around again. &lt;/p&gt;&lt;p&gt;&lt;h4&gt;WHY MEMORY PRICES FLUCTUATE&lt;/h4&gt;There are several factors that can affect memory prices. A few of these include: demand, DRAM manufacturing levels, inventory in the marketplace, time of the year, new operating system releases, and computer sales. All these things can affect memory prices at different times, either separately or simultaneously. &lt;br /&gt;&lt;br /&gt;The most important thing to keep in mind when buying memory is that the price of 256MB today will most likely be different than the price of 256MB next quarter. The best rule of thumb is to compare memory prices close to your time of purchase. When doing price comparisons, it's more important to make sure you are making equivalent comparisons on module types than how the actual price per MB varies over time. If there are shortages in the market it's most important to be sure that what appears to be a "great deal" isn't a "short-cut" module built from off-spec components. In an oversupply market, you're much more likely to get a great price, but keep in mind that many manufacturers are losing money and may take shortcuts on testing and other expensive production quality measures to compensate. Refer to the quality section above for more details on this. &lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>7. Bibliography</title><link>https://technick.net/guides/electronics/esd/007/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/electronics/esd/007/</guid><description>&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/electronics/esd/006"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/electronics/esd/000"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;7. Bibliography&lt;/h3&gt;&lt;p&gt;Key Device and Design Papers EOS/ESD Symposium Proceedings &lt;/p&gt;&lt;p&gt;The following list contains some of the most significant papers on silicon &#10;device ESD phenomena and protection design from past proceedings of the EOS/ESD &#10;Symposium. After a careful review, the papers were selected based on their &#10;original contribution to the field and their effectiveness in advancing the &#10;understanding of ESD device phenomena. These papers provide further &#10;understanding of the concepts as well as implementation and practical use. This &#10;collection of articles will allow new researchers interested in the field to &#10;quickly gather pertinent information. The papers are categorized according to &#10;the topic of interest. A brief statement on the significance of each paper also &#10;is provided.&lt;/p&gt;&lt;p&gt;Copies of the papers may be purchased from the ESD Association&lt;/p&gt;&lt;p&gt;Compiled by: Charvaka Duvvury, May 2000 &lt;/p&gt;&lt;table border="1" cellspacing="1" cellpadding="2"&gt; &lt;tbody&gt; &lt;tr valign="top"&gt; &lt;td colspan="5" bgcolor="#dbe7ff"&gt; &lt;p&gt;&amp;nbsp;&lt;/p&gt; &lt;p align="center"&gt;&lt;b&gt;Section A: Device Phenomena&lt;/b&gt;&lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr valign="top"&gt; &lt;th width="38"&gt; &lt;p&gt;&lt;b&gt;Year&lt;/b&gt;&lt;/p&gt;&lt;/th&gt; &lt;th width="53"&gt; &lt;p&gt;&lt;b&gt;Pages&lt;/b&gt;&lt;/p&gt;&lt;/th&gt; &lt;th width="87"&gt; &lt;p&gt;&lt;b&gt;Authors&lt;/b&gt;&lt;/p&gt;&lt;/th&gt; &lt;th width="147"&gt; &lt;p&gt;&lt;b&gt;Title&lt;/b&gt;&lt;/p&gt;&lt;/th&gt; &lt;th width="128"&gt; &lt;p&gt;&lt;b&gt;Significance&lt;/b&gt;&lt;/p&gt;&lt;/th&gt;&lt;/tr&gt; &lt;tr valign="top"&gt; &lt;td width="38"&gt; &lt;p&gt;1981&lt;b&gt;&lt;/b&gt;&lt;/p&gt;&lt;/td&gt; &lt;td width="53"&gt; &lt;p&gt;120-131&lt;b&gt;&lt;/b&gt;&lt;/p&gt;&lt;/td&gt; &lt;td width="87"&gt; &lt;p&gt;Pierce &amp;amp; Durgin&lt;b&gt;&lt;/b&gt;&lt;/p&gt;&lt;/td&gt; &lt;td width="147"&gt; &lt;p&gt;An Overview of Electrical Overstress on Semiconductor &#10; Devices&lt;b&gt;&lt;/b&gt;&lt;/p&gt;&lt;/td&gt; &lt;td width="128"&gt; &lt;p&gt;Failure physics under ESD and EOS&lt;b&gt;&lt;/b&gt;&lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr valign="top"&gt; &lt;td width="38"&gt; &lt;p&gt;1983&lt;b&gt;&lt;/b&gt;&lt;/p&gt;&lt;/td&gt; &lt;td width="53"&gt; &lt;p&gt;181-184&lt;b&gt;&lt;/b&gt;&lt;/p&gt;&lt;/td&gt; &lt;td width="87"&gt; &lt;p&gt;Duvvury et al.&lt;b&gt;&lt;/b&gt;&lt;/p&gt;&lt;/td&gt; &lt;td width="147"&gt; &lt;p&gt;A Summary of Effective Electrostatic Discharge Protection Circuits for &#10; MOS Memories and Their Observed Failure Modes&lt;b&gt;&lt;/b&gt;&lt;/p&gt;&lt;/td&gt; &lt;td width="128"&gt; &lt;p&gt;Study of npn turn- on of NMOS during ESD and basic ESD design issues &#10; &lt;b&gt;&lt;/b&gt;&lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr valign="top"&gt; &lt;td width="38"&gt; &lt;p&gt;1985&lt;b&gt;&lt;/b&gt;&lt;/p&gt;&lt;/td&gt; &lt;td width="53"&gt; &lt;p&gt;67-76 &lt;b&gt;&lt;/b&gt;&lt;/p&gt;&lt;/td&gt; &lt;td width="87"&gt; &lt;p&gt;Pierce&lt;b&gt;&lt;/b&gt;&lt;/p&gt;&lt;/td&gt; &lt;td width="147"&gt; &lt;p&gt;Electro-thermomigration as an Electrical Overstress Mechanism &#10; &lt;b&gt;&lt;/b&gt;&lt;/p&gt;&lt;/td&gt; &lt;td width="128"&gt; &lt;p&gt;Study of junction spiking for longer pulses&lt;b&gt;&lt;/b&gt;&lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr valign="top"&gt; &lt;td width="38"&gt; &lt;p&gt;1988&lt;b&gt;&lt;/b&gt;&lt;/p&gt;&lt;/td&gt; &lt;td width="53"&gt; &lt;p&gt;201-205 &lt;b&gt;&lt;/b&gt;&lt;/p&gt;&lt;/td&gt; &lt;td width="87"&gt; &lt;p&gt;Rountree et al.&lt;b&gt;&lt;/b&gt;&lt;/p&gt;&lt;/td&gt; &lt;td width="147"&gt; &lt;p&gt;A Process-Tolerant Input Protection Circuit for Advanced CMOS Processes &#10; &lt;b&gt;&lt;/b&gt;&lt;/p&gt;&lt;/td&gt; &lt;td width="128"&gt; &lt;p&gt;SCR design and analysis &lt;b&gt;&lt;/b&gt;&lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr valign="top"&gt; &lt;td width="38"&gt; &lt;p&gt;1989&lt;b&gt;&lt;/b&gt;&lt;/p&gt;&lt;/td&gt; &lt;td width="53"&gt; &lt;p&gt;167-174 &lt;b&gt;&lt;/b&gt;&lt;/p&gt;&lt;/td&gt; &lt;td width="87"&gt; &lt;p&gt;Polgreen &amp;amp; Chatterjee &lt;b&gt;&lt;/b&gt;&lt;/p&gt;&lt;/td&gt; &lt;td width="147"&gt; &lt;p&gt;Improving the ESD Failure Threshold of Silicided nMOS Transistors by &#10; Ensuring Uniform Current Flow &lt;b&gt;&lt;/b&gt;&lt;/p&gt;&lt;/td&gt; &lt;td width="128"&gt; &lt;p&gt;Fundamentals of multifinger NMOS behavior under ESD&lt;b&gt;&lt;/b&gt;&lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr valign="top"&gt; &lt;td width="38"&gt; &lt;p&gt;1989&lt;b&gt;&lt;/b&gt;&lt;/p&gt;&lt;/td&gt; &lt;td width="53"&gt; &lt;p&gt;136-144 &lt;b&gt;&lt;/b&gt;&lt;/p&gt;&lt;/td&gt; &lt;td width="87"&gt; &lt;p&gt;Krieger&lt;b&gt;&lt;/b&gt;&lt;/p&gt;&lt;/td&gt; &lt;td width="147"&gt; &lt;p&gt;The Dynamics of Electrostatic Discharge Prior to Bipolar Action Related &#10; Snap-back &lt;b&gt;&lt;/b&gt;&lt;/p&gt;&lt;/td&gt; &lt;td width="128"&gt; &lt;p&gt;Theoretical analysis of MOS bipolar turn-on during ESD&lt;b&gt;&lt;/b&gt;&lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr valign="top"&gt; &lt;td width="38"&gt; &lt;p&gt;1995&lt;/p&gt;&lt;/td&gt; &lt;td width="53"&gt; &lt;p&gt;162-174 &lt;/p&gt;&lt;/td&gt; &lt;td width="87"&gt; &lt;p&gt;Duvvury &amp;amp; Amerasekera &lt;/p&gt;&lt;/td&gt; &lt;td width="147"&gt; &lt;p&gt;Advanced CMOS Device Trigger Mechanisms During CDM &lt;/p&gt;&lt;/td&gt; &lt;td width="128"&gt; &lt;p&gt;Device behavior and simulations analysis under fast CDM &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr valign="top"&gt; &lt;td width="38"&gt; &lt;p&gt;1999&lt;/p&gt;&lt;/td&gt; &lt;td width="53"&gt; &lt;p&gt;1-10 &lt;/p&gt;&lt;/td&gt; &lt;td width="87"&gt; &lt;p&gt;Mergens&lt;/p&gt;&lt;/td&gt; &lt;td width="147"&gt; &lt;p&gt;Analysis and Compact Modeling of Lateral DMOS Power Devices Under ESD &#10; Stress &lt;/p&gt;&lt;/td&gt; &lt;td width="128"&gt; &lt;p&gt;Significant work in power device ESD phenomenon &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr valign="top"&gt; &lt;td colspan="5" bgcolor="#dbe7ff"&gt; &lt;p&gt;&amp;nbsp;&lt;/p&gt; &lt;p align="center"&gt;&lt;b&gt;Section B: Process &amp;amp; Technology Effects &#10; &lt;/b&gt;&lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr valign="top"&gt; &lt;td width="38"&gt; &lt;p&gt;&lt;b&gt;Year&lt;/b&gt;&lt;/p&gt;&lt;/td&gt; &lt;td width="53"&gt; &lt;p&gt;&lt;b&gt;Pages&lt;/b&gt;&lt;/p&gt;&lt;/td&gt; &lt;td width="87"&gt; &lt;p&gt;&lt;b&gt;Authors&lt;/b&gt;&lt;/p&gt;&lt;/td&gt; &lt;td width="147"&gt; &lt;p&gt;&lt;b&gt;Title&lt;/b&gt;&lt;/p&gt;&lt;/td&gt; &lt;td width="128"&gt; &lt;p&gt;&lt;b&gt;Significance&lt;/b&gt;&lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr valign="top"&gt; &lt;td width="38"&gt; &lt;p&gt;1987&lt;b&gt;&lt;/b&gt;&lt;/p&gt;&lt;/td&gt; &lt;td width="53"&gt; &lt;p&gt;252-257 &lt;/p&gt;&lt;/td&gt; &lt;td width="87"&gt; &lt;p&gt;Fong &amp;amp; Hu &lt;/p&gt;&lt;/td&gt; &lt;td width="147"&gt; &lt;p&gt;The Effects of High Electric Field Transients on Thin Gate Oxide &#10; MOSFETs &lt;/p&gt;&lt;/td&gt; &lt;td width="128"&gt; &lt;p&gt;Oxide breakdown behavior under ESD pulses &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr valign="top"&gt; &lt;td width="38"&gt; &lt;p&gt;1988&lt;/p&gt;&lt;/td&gt; &lt;td width="53"&gt; &lt;p&gt;212-219 &lt;/p&gt;&lt;/td&gt; &lt;td width="87"&gt; &lt;p&gt;Chen&lt;/p&gt;&lt;/td&gt; &lt;td width="147"&gt; &lt;p&gt;Effects of Interconnect Process and Snapback Voltage on the ESD Failure &#10; Threshold of NMOS Transistors &lt;/p&gt;&lt;/td&gt; &lt;td width="128"&gt; &lt;p&gt;The first detailed study of NMOS ESD behavior with process &#10; changes&lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr valign="top"&gt; &lt;td width="38"&gt; &lt;p&gt;1990&lt;/p&gt;&lt;/td&gt; &lt;td width="53"&gt; &lt;p&gt;143-150 &lt;/p&gt;&lt;/td&gt; &lt;td width="87"&gt; &lt;p&gt;Amerasekera et al.&lt;/p&gt;&lt;/td&gt; &lt;td width="147"&gt; &lt;p&gt;An Analysis of Low Voltage ESD Damage in Advanced CMOS Processes &lt;/p&gt;&lt;/td&gt; &lt;td width="128"&gt; &lt;p&gt;Study on the impact drain engineering on ESD damage&lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr valign="top"&gt; &lt;td width="38"&gt; &lt;p&gt;1993&lt;/p&gt;&lt;/td&gt; &lt;td width="53"&gt; &lt;p&gt;117-122 &lt;/p&gt;&lt;/td&gt; &lt;td width="87"&gt; &lt;p&gt;Kuper et al.&lt;/p&gt;&lt;/td&gt; &lt;td width="147"&gt; &lt;p&gt;Suppression of Soft ESD Failures in a Submicron CMOS Process &lt;/p&gt;&lt;/td&gt; &lt;td width="128"&gt; &lt;p&gt;Analysis of the effects of LDD on ESD performance&lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr valign="top"&gt; &lt;td width="38"&gt; &lt;p&gt;1994&lt;/p&gt;&lt;/td&gt; &lt;td width="53"&gt; &lt;p&gt;237-245 &lt;/p&gt;&lt;/td&gt; &lt;td width="87"&gt; &lt;p&gt;Amerasekera &amp;amp; Duvvury &lt;/p&gt;&lt;/td&gt; &lt;td width="147"&gt; &lt;p&gt;The Impact of Technology Scaling on ESD Robustness and Protection &#10; Circuit Design &lt;/p&gt;&lt;/td&gt; &lt;td width="128"&gt; &lt;p&gt;Analysis to establish ESD trends with scaling&lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr valign="top"&gt; &lt;td width="38"&gt; &lt;p&gt;1997&lt;/p&gt;&lt;/td&gt; &lt;td width="53"&gt; &lt;p&gt;308-315 &lt;/p&gt;&lt;/td&gt; &lt;td width="87"&gt; &lt;p&gt;Bock et al. &lt;/p&gt;&lt;/td&gt; &lt;td width="147"&gt; &lt;p&gt;Influence of Well Profile and Gate Length on the ESD Performance of a &#10; Fully Silicided 0.25 &amp;micro;m CMOS Technology &lt;/p&gt;&lt;/td&gt; &lt;td width="128"&gt; &lt;p&gt;Study of substrate process on ESD&lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr valign="top"&gt; &lt;td width="38"&gt; &lt;p&gt;1997&lt;/p&gt;&lt;/td&gt; &lt;td width="53"&gt; &lt;p&gt;316-329 &lt;/p&gt;&lt;/td&gt; &lt;td width="87"&gt; &lt;p&gt;Voldman et al.&lt;/p&gt;&lt;/td&gt; &lt;td width="147"&gt; &lt;p&gt;ESD Robustness and Scaling Implications of Aluminum and Copper &#10; Interconnects in Advanced Semiconductor Technology &lt;/p&gt;&lt;/td&gt; &lt;td width="128"&gt; &lt;p&gt;Current carrying capability of metal interconnects under ESD conditions &#10; &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr valign="top"&gt; &lt;td width="38"&gt; &lt;p&gt;1998&lt;/p&gt;&lt;/td&gt; &lt;td width="53"&gt; &lt;p&gt;161-169 &lt;/p&gt;&lt;/td&gt; &lt;td width="87"&gt; &lt;p&gt;Gupta et al. &lt;/p&gt;&lt;/td&gt; &lt;td width="147"&gt; &lt;p&gt;ESD-Related Process Effects in Mixed Voltage Sub-0.50 &amp;micro;m Technologies &#10; &lt;/p&gt;&lt;/td&gt; &lt;td width="128"&gt; &lt;p&gt;Study of process parameters on npn characteristics &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr valign="top"&gt; &lt;td width="38"&gt; &lt;p&gt;1999&lt;/p&gt;&lt;/td&gt; &lt;td width="53"&gt; &lt;p&gt;95-104 &lt;/p&gt;&lt;/td&gt; &lt;td width="87"&gt; &lt;p&gt;Bock&lt;/p&gt;&lt;/td&gt; &lt;td width="147"&gt; &lt;p&gt;Influence of Gate Length on ESD Performance for Deep Submicron CMOS &#10; Technology &lt;/p&gt;&lt;/td&gt; &lt;td width="128"&gt; &lt;p&gt;A new phenomenon for future technologies&lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr valign="top"&gt; &lt;td colspan="5" bgcolor="#dbe7ff"&gt; &lt;p&gt;&amp;nbsp;&lt;/p&gt; &lt;p align="center"&gt;&lt;b&gt;Section C: Design Methods &lt;/b&gt;&lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr valign="top"&gt; &lt;td width="38"&gt; &lt;p&gt;&lt;b&gt;Year&lt;/b&gt;&lt;/p&gt;&lt;/td&gt; &lt;td width="53"&gt; &lt;p&gt;&lt;b&gt;Pages&lt;/b&gt;&lt;/p&gt;&lt;/td&gt; &lt;td width="87"&gt; &lt;p&gt;&lt;b&gt;Authors&lt;/b&gt;&lt;/p&gt;&lt;/td&gt; &lt;td width="147"&gt; &lt;p&gt;&lt;b&gt;Title&lt;/b&gt;&lt;/p&gt;&lt;/td&gt; &lt;td width="128"&gt; &lt;p&gt;&lt;b&gt;Significance&lt;/b&gt;&lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr valign="top"&gt; &lt;td width="38"&gt; &lt;p&gt;1980&lt;/p&gt;&lt;/td&gt; &lt;td width="53"&gt; &lt;p&gt;73-80 &lt;/p&gt;&lt;/td&gt; &lt;td width="87"&gt; &lt;p&gt;Keller &lt;/p&gt;&lt;/td&gt; &lt;td width="147"&gt; &lt;p&gt;Protection of MOS Integrated Circuits from Destruction by Electrostatic &#10; Discharge &lt;/p&gt;&lt;/td&gt; &lt;td width="128"&gt; &lt;p&gt;Fundamentals of ESD protection design &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr valign="top"&gt; &lt;td width="38"&gt; &lt;p&gt;1981&lt;/p&gt;&lt;/td&gt; &lt;td width="53"&gt; &lt;p&gt;90-96 &lt;/p&gt;&lt;/td&gt; &lt;td width="87"&gt; &lt;p&gt;Hulett&lt;/p&gt;&lt;/td&gt; &lt;td width="147"&gt; &lt;p&gt;On-Chip Protection of High Density NMOS Devices &lt;/p&gt;&lt;/td&gt; &lt;td width="128"&gt; &lt;p&gt;Layout effects of ESD protection design &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr valign="top"&gt; &lt;td width="38"&gt; &lt;p&gt;1988&lt;/p&gt;&lt;/td&gt; &lt;td width="53"&gt; &lt;p&gt;220-227 &lt;/p&gt;&lt;/td&gt; &lt;td width="87"&gt; &lt;p&gt;Maloney&lt;/p&gt;&lt;/td&gt; &lt;td width="147"&gt; &lt;p&gt;Designing MOS Inputs and Outputs to Avoid Oxide Failure in the Charged &#10; Device Model &lt;/p&gt;&lt;/td&gt; &lt;td width="128"&gt; &lt;p&gt;Failure phenomena &amp;amp; design techniques for CDM protection&lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr valign="top"&gt; &lt;td width="38"&gt; &lt;p&gt;1991&lt;/p&gt;&lt;/td&gt; &lt;td width="53"&gt; &lt;p&gt;88-97 &lt;/p&gt;&lt;/td&gt; &lt;td width="87"&gt; &lt;p&gt;Duvvury &amp;amp; Rountree &lt;/p&gt;&lt;/td&gt; &lt;td width="147"&gt; &lt;p&gt;A Synthesis of Input Protection Scheme &lt;/p&gt;&lt;/td&gt; &lt;td width="128"&gt; &lt;p&gt;Analysis and design using discrete ESD device elements&lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr valign="top"&gt; &lt;td width="38"&gt; &lt;p&gt;1995&lt;/p&gt;&lt;/td&gt; &lt;td width="53"&gt; &lt;p&gt;1-12 &lt;/p&gt;&lt;/td&gt; &lt;td width="87"&gt; &lt;p&gt;Maloney &amp;amp; Dabral&lt;/p&gt;&lt;/td&gt; &lt;td width="147"&gt; &lt;p&gt;Novel Clamp Circuits for IC Power Supply Protection &lt;/p&gt;&lt;/td&gt; &lt;td width="128"&gt; &lt;p&gt;Protection scheme designs using diode elements in complex circuit &#10; approach&lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr valign="top"&gt; &lt;td width="38"&gt; &lt;p&gt;1995&lt;/p&gt;&lt;/td&gt; &lt;td width="53"&gt; &lt;p&gt;43-61 &lt;/p&gt;&lt;/td&gt; &lt;td width="87"&gt; &lt;p&gt;Voldman et al. &lt;/p&gt;&lt;/td&gt; &lt;td width="147"&gt; &lt;p&gt;Analysis of Snubber-Clamped Diode-String Mixed Voltage Interface ESD &#10; Protection Network for Advanced Microprocessors &lt;/p&gt;&lt;/td&gt; &lt;td width="128"&gt; &lt;p&gt;Detailed work on the operation and modeling of diodes&lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr valign="top"&gt; &lt;td width="38"&gt; &lt;p&gt;1997&lt;/p&gt;&lt;/td&gt; &lt;td width="53"&gt; &lt;p&gt;230-239 &lt;/p&gt;&lt;/td&gt; &lt;td width="87"&gt; &lt;p&gt;Chen et al. &lt;/p&gt;&lt;/td&gt; &lt;td width="147"&gt; &lt;p&gt;Design Methodology for Optimizing Gate-Driven ESD Protection Circuits &#10; In Submicron CMOS Processes &lt;/p&gt;&lt;/td&gt; &lt;td width="128"&gt; &lt;p&gt;Issues related to gate modulated MOS protection &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr valign="top"&gt; &lt;td width="38"&gt; &lt;p&gt;1999&lt;/p&gt;&lt;/td&gt; &lt;td width="53"&gt; &lt;p&gt;62-69 &lt;/p&gt;&lt;/td&gt; &lt;td width="87"&gt; &lt;p&gt;Smith &lt;/p&gt;&lt;/td&gt; &lt;td width="147"&gt; &lt;p&gt;An Anti-snapback Circuit Technique for Inhibiting Parasitic Bipolar &#10; Conduction During EOS/ESD Events &lt;/p&gt;&lt;/td&gt; &lt;td width="128"&gt; &lt;p&gt;A new design method without using npn snapback in NMOS&lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr valign="top"&gt; &lt;td colspan="5" bgcolor="#dbe7ff"&gt; &lt;p&gt;&amp;nbsp;&lt;/p&gt; &lt;p align="center"&gt;&lt;b&gt;Section D: Simulations/Modeling&lt;/b&gt;&lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr valign="top"&gt; &lt;td width="38"&gt; &lt;p&gt;&lt;b&gt;Year&lt;/b&gt;&lt;/p&gt;&lt;/td&gt; &lt;td width="53"&gt; &lt;p&gt;&lt;b&gt;Pages&lt;/b&gt;&lt;/p&gt;&lt;/td&gt; &lt;td width="87"&gt; &lt;p&gt;&lt;b&gt;Authors&lt;/b&gt;&lt;/p&gt;&lt;/td&gt; &lt;td width="147"&gt; &lt;p&gt;&lt;b&gt;Title&lt;/b&gt;&lt;/p&gt;&lt;/td&gt; &lt;td width="128"&gt; &lt;p&gt;&lt;b&gt;Significance&lt;/b&gt;&lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr valign="top"&gt; &lt;td width="38"&gt; &lt;p&gt;1982&lt;/p&gt;&lt;/td&gt; &lt;td width="53"&gt; &lt;p&gt;56-61 &lt;/p&gt;&lt;/td&gt; &lt;td width="87"&gt; &lt;p&gt;Pierce&lt;/p&gt;&lt;/td&gt; &lt;td width="147"&gt; &lt;p&gt;Modeling Metalization Burnout of Integrated Circuits &lt;/p&gt;&lt;/td&gt; &lt;td width="128"&gt; &lt;p&gt;A model for pulse width dependence of failure current density &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr valign="top"&gt; &lt;td width="38"&gt; &lt;p&gt;1986&lt;/p&gt;&lt;/td&gt; &lt;td width="53"&gt; &lt;p&gt;41-47 &lt;/p&gt;&lt;/td&gt; &lt;td width="87"&gt; &lt;p&gt;Scott et al.&lt;/p&gt;&lt;/td&gt; &lt;td width="147"&gt; &lt;p&gt;A Lumped Element Model for Simulation of ESD Failures in Silicon &#10; Devices &lt;/p&gt;&lt;/td&gt; &lt;td width="128"&gt; &lt;p&gt;Theoretical model that studied the effect of contact resistance for ESD &#10; &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr valign="top"&gt; &lt;td width="38"&gt; &lt;p&gt;1988&lt;/p&gt;&lt;/td&gt; &lt;td width="53"&gt; &lt;p&gt;137-146 &lt;/p&gt;&lt;/td&gt; &lt;td width="87"&gt; &lt;p&gt;Pierce&lt;/p&gt;&lt;/td&gt; &lt;td width="147"&gt; &lt;p&gt;Electrical Overstress Testing of a 256K UVEPROM to Rectangular and &#10; Double Exponential Pulse &lt;/p&gt;&lt;/td&gt; &lt;td width="128"&gt; &lt;p&gt;Modeling work that allows conversion to different types of &#10; waveforms&lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr valign="top"&gt; &lt;td width="38"&gt; &lt;p&gt;1993&lt;/p&gt;&lt;/td&gt; &lt;td width="53"&gt; &lt;p&gt;73-80 &lt;/p&gt;&lt;/td&gt; &lt;td width="87"&gt; &lt;p&gt;Lin&lt;/p&gt;&lt;/td&gt; &lt;td width="147"&gt; &lt;p&gt;ESD Sensitivity and VLSI Technology Trends: Thermal Breakdown and &#10; Dielectric Breakdown &lt;/p&gt;&lt;/td&gt; &lt;td width="128"&gt; &lt;p&gt;Theoretical model to predict thermal and oxide breakdown &#10; sensitivities&lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr valign="top"&gt; &lt;td width="38"&gt; &lt;p&gt;1996&lt;/p&gt;&lt;/td&gt; &lt;td width="53"&gt; &lt;p&gt;265-275 &lt;/p&gt;&lt;/td&gt; &lt;td width="87"&gt; &lt;p&gt;Beebe &lt;/p&gt;&lt;/td&gt; &lt;td width="147"&gt; &lt;p&gt;Methodology for Layout Design and Optimization of ESD Protection &#10; Transistors &lt;/p&gt;&lt;/td&gt; &lt;td width="128"&gt; &lt;p&gt;Analytical study of NMOS layout for ESD performance &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr valign="top"&gt; &lt;td colspan="5" bgcolor="#dbe7ff"&gt; &lt;p&gt;&amp;nbsp;&lt;/p&gt; &lt;p align="center"&gt;&lt;b&gt;Section E: Measurement/Characterization&lt;/b&gt;&lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr valign="top"&gt; &lt;td width="38"&gt; &lt;p&gt;&lt;b&gt;Year&lt;/b&gt;&lt;/p&gt;&lt;/td&gt; &lt;td width="53"&gt; &lt;p&gt;&lt;b&gt;Pages&lt;/b&gt;&lt;/p&gt;&lt;/td&gt; &lt;td width="87"&gt; &lt;p&gt;&lt;b&gt;Authors&lt;/b&gt;&lt;/p&gt;&lt;/td&gt; &lt;td width="147"&gt; &lt;p&gt;&lt;b&gt;Title&lt;/b&gt;&lt;/p&gt;&lt;/td&gt; &lt;td width="128"&gt; &lt;p&gt;&lt;b&gt;Significance&lt;/b&gt;&lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr valign="top"&gt; &lt;td width="38"&gt; &lt;p&gt;1985&lt;b&gt;&lt;/b&gt;&lt;/p&gt;&lt;/td&gt; &lt;td width="53"&gt; &lt;p&gt;49-54 &lt;/p&gt;&lt;/td&gt; &lt;td width="87"&gt; &lt;p&gt;Maloney &amp;amp; Khurana &lt;/p&gt;&lt;/td&gt; &lt;td width="147"&gt; &lt;p&gt;Transmission Line Pulsing Techniques for Circuit Modeling of ESD &#10; Phenomena &lt;/p&gt;&lt;/td&gt; &lt;td width="128"&gt; &lt;p&gt;A pulsed method to measure ESD data &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr valign="top"&gt; &lt;td width="38"&gt; &lt;p&gt;1989&lt;b&gt;&lt;/b&gt;&lt;/p&gt;&lt;/td&gt; &lt;td width="53"&gt; &lt;p&gt;59-71 &lt;/p&gt;&lt;/td&gt; &lt;td width="87"&gt; &lt;p&gt;Renninger et al.&lt;/p&gt;&lt;/td&gt; &lt;td width="147"&gt; &lt;p&gt;A Field-Induced Charged Device Model Simulator &lt;/p&gt;&lt;/td&gt; &lt;td width="128"&gt; &lt;p&gt;Description and operation of the CDM simulator&lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr valign="top"&gt; &lt;td width="38"&gt; &lt;p&gt;1990&lt;b&gt;&lt;/b&gt;&lt;/p&gt;&lt;/td&gt; &lt;td width="53"&gt; &lt;p&gt;119-130 &lt;/p&gt;&lt;/td&gt; &lt;td width="87"&gt; &lt;p&gt;Roozendaal et al. &lt;/p&gt;&lt;/td&gt; &lt;td width="147"&gt; &lt;p&gt;Standard ESD Testing of Integrated Circuits &lt;/p&gt;&lt;/td&gt; &lt;td width="128"&gt; &lt;p&gt;A comprehensive study of testers and parasitics&lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr valign="top"&gt; &lt;td width="38"&gt; &lt;p&gt;1992&lt;b&gt;&lt;/b&gt;&lt;/p&gt;&lt;/td&gt; &lt;td width="53"&gt; &lt;p&gt;129-134 &lt;/p&gt;&lt;/td&gt; &lt;td width="87"&gt; &lt;p&gt;Maloney&lt;/p&gt;&lt;/td&gt; &lt;td width="147"&gt; &lt;p&gt;Integrated Circuit Metal in the Charged Device Model: Bootstrap &#10; Heating, Melt Damage and Scaling Laws &lt;/p&gt;&lt;/td&gt; &lt;td width="128"&gt; &lt;p&gt;Metal heating under CDM events&lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr valign="top"&gt; &lt;td width="38"&gt; &lt;p&gt;1993&lt;b&gt;&lt;/b&gt;&lt;/p&gt;&lt;/td&gt; &lt;td width="53"&gt; &lt;p&gt;129-137 &lt;/p&gt;&lt;/td&gt; &lt;td width="87"&gt; &lt;p&gt;Verhaege et al. &lt;/p&gt;&lt;/td&gt; &lt;td width="147"&gt; &lt;p&gt;Analysis of HBM ESD Testers and Specifications Using 4th Order Lumped &#10; Element Model &lt;/p&gt;&lt;/td&gt; &lt;td width="128"&gt; &lt;p&gt;Analysis of HBM with parasitics&lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr valign="top"&gt; &lt;td width="38"&gt; &lt;p&gt;1998&lt;b&gt;&lt;/b&gt;&lt;/p&gt;&lt;/td&gt; &lt;td width="53"&gt; &lt;p&gt;170-176 &lt;/p&gt;&lt;/td&gt; &lt;td width="87"&gt; &lt;p&gt;Notermans et al. &lt;/p&gt;&lt;/td&gt; &lt;td width="147"&gt; &lt;p&gt;Pitfalls When Correlating TLP, HBM, and MM Testing &lt;/p&gt;&lt;/td&gt; &lt;td width="128"&gt; &lt;p&gt;Gives proper method to interpret data from pulse testing &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr valign="top"&gt; &lt;td width="38"&gt; &lt;p&gt;1999&lt;/p&gt;&lt;/td&gt; &lt;td width="53"&gt; &lt;p&gt;28-37 &lt;/p&gt;&lt;/td&gt; &lt;td width="87"&gt; &lt;p&gt;Wolf&lt;/p&gt;&lt;/td&gt; &lt;td width="147"&gt; &lt;p&gt;Analyzing the Switching Behavior of ESD Protection Transistors by Very &#10; Fast Transmission Line Pulsing&lt;/p&gt;&lt;/td&gt; &lt;td width="128"&gt; &lt;p&gt;A new test method to understand ESD behavior &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr valign="top"&gt; &lt;td width="38"&gt; &lt;p&gt;1999&lt;/p&gt;&lt;/td&gt; &lt;td width="53"&gt; &lt;p&gt;212-224&lt;/p&gt;&lt;/td&gt; &lt;td width="87"&gt; &lt;p&gt;Voldman&lt;/p&gt;&lt;/td&gt; &lt;td width="147"&gt; &lt;p&gt;A Strategy for Characterization and Evaluation of ESD Robustness of &#10; CMOS Semiconductor Technologies &lt;/p&gt;&lt;/td&gt; &lt;td width="128"&gt; &lt;p&gt;The first paper to present ESD layout methods &lt;/p&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/tbody&gt;&lt;/table&gt;&lt;/blockquote&gt;</description></item><item><title>7. HOW TO INSTALL MEMORY</title><link>https://technick.net/guides/hardware/umg/07_000/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/umg/07_000/</guid><description>&lt;hr /&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/hardware/umg/06_004"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/07_001"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt;&lt;a name="TOC"&gt;&lt;/a&gt;&lt;h3&gt;7. HOW TO INSTALL MEMORY&lt;/h3&gt;&lt;/p&gt;&lt;p&gt;Congratulations! You have new memory for your computer. Now you have to install it. This chapter will guide you through the basics of memory module installation and refer you to resources that can help with problems.&lt;br /&gt;&lt;br /&gt;&lt;ul&gt;&lt;li&gt;&lt;a href="https://technick.net/guides/hardware/umg/07_001"&gt;7.1. BEFORE YOU INSTALL&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href="https://technick.net/guides/hardware/umg/07_002"&gt;7.2. IMPORTANT THINGS TO KEEP IN MIND&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href="https://technick.net/guides/hardware/umg/07_003"&gt;7.3. INSTALLING THE MEMORY&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/p&gt;&lt;/blockquote&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/hardware/umg/06_004"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/07_001"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;</description></item><item><title>7.1. BEFORE YOU INSTALL</title><link>https://technick.net/guides/hardware/umg/07_001/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/umg/07_001/</guid><description>&lt;hr /&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/hardware/umg/07_000"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/07_002"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt;&lt;a name="TOC"&gt;&lt;/a&gt;&lt;h3&gt;7.1. BEFORE YOU INSTALL&lt;/h3&gt;&lt;/p&gt;&lt;p&gt;Before you start, make sure you have the following: &lt;ol&gt;&lt;li&gt;Your computer manual. To install memory, you must open the computer box (chassis) and locate the memory sockets. You may need to unplug cables and peripherals, and re-install them afterward. The manual will most likely provide instructions specific to your computer.&lt;br /&gt;&lt;br /&gt;&lt;/li&gt;&lt;li&gt;A small screwdriver. Most computer chassis assemble with screws. The screwdriver also comes in handy if the notches on memory sockets are too tiny for your fingers. &lt;/li&gt;&lt;/ol&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>7.2. IMPORTANT THINGS TO KEEP IN MIND</title><link>https://technick.net/guides/hardware/umg/07_002/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/umg/07_002/</guid><description>&lt;hr /&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/hardware/umg/07_001"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/07_003"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt;&lt;a name="TOC"&gt;&lt;/a&gt;&lt;h3&gt;7.2. IMPORTANT THINGS TO KEEP IN MIND&lt;/h3&gt;&lt;/p&gt;&lt;p&gt;&lt;h4&gt;ESD DAMAGE&lt;/h4&gt;Electro-Static Discharge (ESD) is a frequent causes of damage to the memory module. ESD is the result of handling the module without first properly grounding yourself and thereby dissipating static electricity from your body or clothing. If you have a grounded wrist strap, wear it. If you don't, before touching electronic components - especially your new memory module - make sure you first touch an unpainted, grounded metal object. Most convenient is the metal frame inside the computer. In addition, always handle the module by the edges. If ESD damages memory, problems may not show up immediately and may be difficult to diagnose. &lt;br /&gt;&lt;br /&gt;&lt;div align="center"&gt;&lt;img src="https://technick.net/img/guide_umg/guide_umg_032.jpg" width="139" height="181" border="0" alt="" /&gt;&lt;br /&gt;&lt;br /&gt;Wearing a grounded wrist strap can prevent ESD damage. &lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;h4&gt;SWITCHING OFF THE POWER&lt;/h4&gt;Before opening the chassis, always power-off your computer and all attached peripherals. Leaving power on can cause permanent electrical damage to your computer and its components. &lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>7.3. INSTALLING THE MEMORY</title><link>https://technick.net/guides/hardware/umg/07_003/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/umg/07_003/</guid><description>&lt;hr /&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/hardware/umg/07_002"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/08_000"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt;&lt;a name="TOC"&gt;&lt;/a&gt;&lt;h3&gt;7.3. INSTALLING THE MEMORY&lt;/h3&gt;&lt;/p&gt;&lt;p&gt;The vast majority of computers today have memory sockets that accept the following&#10;industry-standard memory modules:&lt;br /&gt;&lt;br /&gt;Desktops, Workstations and Servers&lt;br /&gt;&lt;br /&gt;&lt;ul&gt;&lt;li&gt;72-pin SIMM&lt;/li&gt;&lt;li&gt;168-pin DIMM&lt;/li&gt;&lt;li&gt;184-pin RIMM&lt;/li&gt;&lt;/ul&gt;Notebooks and Mobile Computers&lt;br /&gt;&lt;br /&gt;&lt;ul&gt;&lt;li&gt;144-pin SO DIMM&lt;/li&gt;&lt;/ul&gt;Although sockets may be in different places on different computers, installation is&#10;the same. Consult the computer owner's manual to find out whether the memory&#10;sits on an expansion card or on the motherboard, and whether internal computer&#10;components must be moved to gain access.&lt;br /&gt;&lt;br /&gt;In the section below are installation instructions for the standard modules listed&#10;above, followed by installation instructions for some of the more popular proprietary&#10;memory modules. If the computer requires proprietary memory, or the instructions&#10;below don't seem to apply to your situation, phone Kingston Technology's Technical&#10;Support Group at (800) 435-0640.&lt;/p&gt;&lt;p&gt;&lt;h4&gt;INSTALLING A 72-PIN SIMM&lt;/h4&gt;&lt;div align="center"&gt;&lt;img src="https://technick.net/img/guide_umg/guide_umg_033.jpg" width="338" height="250" border="0" alt="" /&gt;&lt;br /&gt;&lt;br /&gt;Installation of a 72-pin SIMM.&lt;/div&gt;&lt;ol&gt;&lt;li&gt;Place your computer's power switch in the off position and disconnect the AC&#10;power cord.&lt;br /&gt;&lt;br /&gt;&lt;/li&gt;&lt;li&gt;Follow the instructions in your owner's manual that describe how to locate&#10;your computer's memory expansion sockets.&lt;br /&gt;&lt;br /&gt;&lt;/li&gt;&lt;li&gt;Before touching any electronic components or opening the package containing your&#10;new module(s), make sure you first touch an unpainted, grounded metal object to&#10;discharge any static electricity you may have stored on your body or clothing.&lt;br /&gt;&lt;br /&gt;&lt;/li&gt;&lt;li&gt;Handle your new module(s) carefully; do not flex or bend the module(s). Always&#10;grasp the module by its edges.&lt;br /&gt;&lt;br /&gt;&lt;/li&gt;&lt;li&gt;As shown in the illustration, the module and the expansion socket are keyed. A&#10;small plastic bridge in the socket must align with the curved notch in the module.&#10;The bridge ensures the module can only be plugged into the socket one way.&lt;br /&gt;&lt;br /&gt;&lt;/li&gt;&lt;li&gt;Insert the module into the socket at a slight angle. Make sure the module is&#10;completely seated in the socket. If you're having problems inserting the module&#10;into the socket, stop and examine both the module and the socket; make sure&#10;the notch in the module is properly aligned with the keyed plastic bridge in&#10;the socket. Do not force the module into the socket. If too much force is used,&#10;both the socket and module could be damaged.&lt;br /&gt;&lt;br /&gt;&lt;/li&gt;&lt;li&gt;Once you are satisfied the module is seated properly in the socket, rotate the module&#10;upward until the clips at each end of the expansion socket click into place.&lt;br /&gt;&lt;br /&gt;&lt;/li&gt;&lt;li&gt;After all modules have been installed, close the computer, plug in the AC&#10;power cord, and reinstall any other cables that may have been disconnected&#10;during the installation process.&lt;/li&gt;&lt;/ol&gt;&lt;/p&gt;&lt;p&gt;&lt;h4&gt;INSTALLING A 168-PIN DIMM&lt;/h4&gt;&lt;div align="center"&gt;&lt;img src="https://technick.net/img/guide_umg/guide_umg_034.jpg" width="352" height="270" border="0" alt="" /&gt;&lt;br /&gt;&lt;br /&gt;Installation of a 168-pin DIMM.&lt;/div&gt;&lt;ol&gt;&lt;li&gt;Locate the memory expansion sockets on the computer's motherboard. If all&#10;the sockets are full, you will need to remove smaller capacity modules to allow&#10;room for higher capacity modules.&lt;br /&gt;&lt;br /&gt;&lt;/li&gt;&lt;li&gt;For some installations, DIMM memory can be installed in any available expansion&#10;slot. Other installations may require the memory to be installed in a particular&#10;sequence based on the module's capacity. Check your owner's manual to determine&#10;the correct installation sequence for your configuration.&lt;br /&gt;&lt;br /&gt;&lt;/li&gt;&lt;li&gt;Insert the module into an available expansion socket as shown in the illustration.&#10;Note how the module is keyed to the socket. This ensures the module can be&#10;plugged into the socket one way only. Firmly press the module into position,&#10;making certain the module is completely seated in the socket. Repeat this&#10;procedure for any additional modules you are installing.&lt;br /&gt;&lt;br /&gt;&lt;/li&gt;&lt;li&gt;Most 168-pin DIMM modules have ejector tabs similar to those shown in the&#10;illustration. The ejector tabs are used only when you need to remove a module.&#10;By pressing down on the ejector tabs, the module will pop up from the socket&#10;and it can be removed.&lt;/li&gt;&lt;/ol&gt;&lt;/p&gt;&lt;p&gt;&lt;h4&gt;INSTALLING A 184-PIN RIMM&lt;/h4&gt;&lt;div align="center"&gt;&lt;img src="https://technick.net/img/guide_umg/guide_umg_035.jpg" width="357" height="294" border="0" alt="" /&gt;&lt;br /&gt;&lt;br /&gt;Installation of a 184-pin RIMM. RIMMs install into &lt;b&gt;RIMM connectors&lt;/b&gt;. Currently,&#10;there are two connectors on the computer board, and each must contain a&#10;RIMM or a &lt;b&gt;C-RIMM (continuity RIMM)&lt;/b&gt;. C-RIMMs do not contain memory devices.&#10;They are inexpensive pass-through modules that provide a continuous channel for &#10;the signal.&lt;/div&gt;&lt;ol&gt;&lt;li&gt;Turn off the computer and disconnect the AC power cord.&lt;br /&gt;&lt;br /&gt;&lt;/li&gt;&lt;li&gt;Locate your computer's memory expansion sockets by following the instruc-tions&#10;in your owner's manual.&lt;br /&gt;&lt;br /&gt;&lt;/li&gt;&lt;li&gt;Before touching any electronic components, make sure you first touch an&#10;unpainted, grounded metal object to discharge any static electricity stored on&#10;your clothing or body.&lt;br /&gt;&lt;br /&gt;&lt;/li&gt;&lt;li&gt;If all the sockets are full, you will need to remove smaller capacity modules to&#10;allow room for higher capacity modules.&lt;br /&gt;&lt;br /&gt;&lt;/li&gt;&lt;li&gt;The ejector tabs shown in the illustration are used to remove a module. By&#10;pushing outward on the ejector tabs, the module will pop up from the socket&#10;and it can then be removed.&lt;br /&gt;&lt;br /&gt;&lt;/li&gt;&lt;li&gt;For most installations, Rambus modules can be installed in any available&#10;expansion socket, but any empty sockets must contain a continuity module as&#10;shown in the illustration. Note that some modes may use a specific installation&#10;sequence for Rambus modules (e.g. Rambus dual-channel configurations); see&#10;your owner's manual for more details.&lt;br /&gt;&lt;br /&gt;&lt;/li&gt;&lt;li&gt;Insert the module into an available expansion socket as shown in the illustration.&#10;Note how the module is keyed to the socket. This ensures the module can be&#10;plugged into the socket one way only. Firmly press the module into position,&#10;making certain the module is completely seated in the socket. The ejector tabs at&#10;each end of the socket will automatically snap into the locked position. Repeat&#10;this procedure for any additional modules are installing.&lt;br /&gt;&lt;br /&gt;&lt;/li&gt;&lt;li&gt;Once the module or modules have been installed, close the computer.&lt;/li&gt;&lt;/ol&gt;&lt;/p&gt;&lt;p&gt;&lt;h4&gt;EXAMPLES OF NOTEBOOK MEMORY INSTALLATION&lt;/h4&gt;&lt;div align="center"&gt;&lt;img src="https://technick.net/img/guide_umg/guide_umg_036.jpg" width="676" height="169" border="0" alt="" /&gt;&lt;/div&gt;&lt;br /&gt;&lt;br /&gt;Although more and more notebooks accept standard SO DIMM memory modules, many&#10;still require proprietary modules having unique form factors. No standard&#10;dictates where the memory should be installed in the notebook. Because notebooks &#10;differ greatly in how memory is installed, you should consult your computer manual &#10;for specific instructions.This example shows a typical 144-pin SO DIM installation.&lt;ol&gt;&lt;li&gt;Always turn off your computer and remove the rechargeable battery pack&#10;before installing the memory.&lt;br /&gt;&lt;br /&gt;&lt;/li&gt;&lt;li&gt;Insert the module into the socket at a slight angle (approximately 30 degrees).&#10;Note that the socket and module are both keyed, which means the module can&#10;be installed one way only.&lt;br /&gt;&lt;br /&gt;&lt;/li&gt;&lt;li&gt;To seat the module into the socket, apply firm, even pressure to each end of the&#10;module (see the arrows) until you feel it slip down into the socket. If you are&#10;having problems getting the module to seat properly, try rocking the module up&#10;and down slightly, while continuing to apply pressure. When properly seated,&#10;the contact fingers on the edge of the module will almost completely disappear&#10;inside the socket.&lt;br /&gt;&lt;br /&gt;&lt;/li&gt;&lt;li&gt;With the module properly seated in the socket, rotate the module downward,&#10;as indicated in the illustration. Continue pressing downward until the clips at&#10;each end of the socket lock into position. With most sockets, you will hear a&#10;distinctive click, indicating the module is correctly locked into position.&lt;/li&gt;&lt;/ol&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>8. TROUBLESHOOTING MEMORY PROBLEMS</title><link>https://technick.net/guides/hardware/umg/08_000/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/umg/08_000/</guid><description>&lt;hr /&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/hardware/umg/07_003"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/08_001"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt;&lt;a name="TOC"&gt;&lt;/a&gt;&lt;h3&gt;8. TROUBLESHOOTING MEMORY PROBLEMS&lt;/h3&gt;&lt;/p&gt;&lt;p&gt;&lt;ul&gt;&lt;li&gt;&lt;a href="https://technick.net/guides/hardware/umg/08_001"&gt;8.1. COMMON MEMORY PROBLEMS&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href="https://technick.net/guides/hardware/umg/08_002"&gt;8.2. BASIC TROUBLESHOOTING&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href="https://technick.net/guides/hardware/umg/08_003"&gt;8.3. WHEN THE PROBLEM OCCURS&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href="https://technick.net/guides/hardware/umg/08_004"&gt;8.4. HANDLING SPECIFIC PROBLEMS&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href="https://technick.net/guides/hardware/umg/08_005"&gt;8.5. STILL NEED HELP?&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/p&gt;&lt;/blockquote&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/hardware/umg/07_003"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/08_001"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;</description></item><item><title>8.1. COMMON MEMORY PROBLEMS</title><link>https://technick.net/guides/hardware/umg/08_001/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/umg/08_001/</guid><description>&lt;hr /&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/hardware/umg/08_000"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/08_002"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt;&lt;a name="TOC"&gt;&lt;/a&gt;&lt;h3&gt;8.1. COMMON MEMORY PROBLEMS&lt;/h3&gt;&lt;/p&gt;&lt;p&gt;When you have a problem with memory, the cause is usually one of three things:&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Improper Configuration:&lt;/b&gt; You have the wrong part for your computer or did not&#10;follow the configuration rules.&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Improper Installation:&lt;/b&gt; The memory may not be seated correctly, a socket is bad, or&#10;the socket may need cleaning.&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Defective Hardware:&lt;/b&gt; The memory module itself is defective.&lt;br /&gt;&lt;br /&gt;The fact that many computer problems manifest themselves as memory problems&#10;makes troubleshooting difficult. For example, a problem with the motherboard or&#10;software may produce a memory error message.&lt;br /&gt;&lt;br /&gt;This chapter is designed to help you figure out if you have a memory problem, and&#10;if so, what kind of problem it is, so you can get to a solution as quickly as possible.&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>8.2. BASIC TROUBLESHOOTING</title><link>https://technick.net/guides/hardware/umg/08_002/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/umg/08_002/</guid><description>&lt;hr /&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/hardware/umg/08_001"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/08_003"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt;&lt;a name="TOC"&gt;&lt;/a&gt;&lt;h3&gt;8.2. BASIC TROUBLESHOOTING&lt;/h3&gt;&lt;/p&gt;&lt;p&gt;The following basic steps apply to almost all situations:&lt;br /&gt;&lt;br /&gt;&lt;ol&gt;&lt;li&gt;&lt;b&gt;Make sure you have the right memory part for your computer.&lt;/b&gt;At the manufacturer's Web site you can look up the part number. Many memory&#10;manufacturers have configurators, which indicate the compatibilities of your&#10;module. If not, phone the memory manufacturer, consult your computer manual,&#10;or phone the computer manufacturer.&lt;br /&gt;&lt;br /&gt;&lt;/li&gt;&lt;li&gt;&lt;b&gt;Confirm that you configured the memory correctly.&lt;/b&gt;Many computers require module installation in banks of equal-capacity&#10;modules. Some computers require the highest capacity module to be in the&#10;lowest labeled bank. Other computers require that all sockets be filled; still&#10;others require single-banked memory. These are only a few examples of&#10;special configuration requirements. If you have a name-brand computer, visit&#10;Kingston's Web site (www.kingston.com) or use our upgrade manual to look up&#10;configuration rules specific to your computer. You can also contact technical&#10;support for your memory or computer manufacturer.&lt;br /&gt;&lt;br /&gt;&lt;/li&gt;&lt;li&gt;&lt;b&gt;Re-install the module.&lt;/b&gt;Push the module firmly into the socket. In most cases you hear a click when&#10;the module is in position. To make sure you have a module all the way in the&#10;socket, compare the height of the module to the height of other modules in&#10;neighboring sockets.&lt;br /&gt;&lt;br /&gt;&lt;/li&gt;&lt;li&gt;&lt;b&gt;Swap modules.&lt;/b&gt;Remove the new memory and see whether the problem disappears. Remove the&#10;old memory, reinstall the new, and see whether the problem persists. Try the&#10;memory in different sockets. Swapping reveals whether the problem is a particular&#10;memory module or socket, or whether two types of memory aren't compatible.&lt;br /&gt;&lt;br /&gt;&lt;/li&gt;&lt;li&gt;&lt;b&gt;Clean the socket and pins on the memory module.&lt;/b&gt;Use a soft cloth to wipe the pins on the module. Use a PC vacuum or compressed&#10;air to blow dust off the socket. Do NOT use solvent, which may corrode the&#10;metal or prevent the leads from making full contact. Flux Off is a cleaner&#10;used specifically for contacts. You can purchase it at electronics or computer&#10;equipment stores.&lt;br /&gt;&lt;br /&gt;&lt;/li&gt;&lt;li&gt;&lt;b&gt;Update the BIOS.&lt;/b&gt;Computer manufacturers update BIOS information frequently and post revisions&#10;on their Web sites. Make sure you have the most recent BIOS for your computer.&#10;This applies especially when you have recently installed new software or you are&#10;significantly upgrading memory.&lt;/li&gt;&lt;/ol&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>8.3. WHEN THE PROBLEM OCCURS</title><link>https://technick.net/guides/hardware/umg/08_003/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/umg/08_003/</guid><description>&lt;hr /&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/hardware/umg/08_002"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/08_004"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt;&lt;a name="TOC"&gt;&lt;/a&gt;&lt;h3&gt;8.3. WHEN THE PROBLEM OCCURS&lt;/h3&gt;&lt;/p&gt;&lt;p&gt;When the problem occurs is a clue as to the cause.&lt;br /&gt;&lt;br /&gt;For example, your response to a memory error message depends on whether:&lt;br /&gt;&lt;br /&gt;&lt;ol&gt;&lt;li&gt;You have just bought a new computer.&lt;/li&gt;&lt;li&gt;You have just installed new memory.&lt;/li&gt;&lt;li&gt;You have just installed new software or a new operating system.&lt;/li&gt;&lt;li&gt;You have just installed or removed hardware.&lt;/li&gt;&lt;li&gt;Your computer has been running fine and you've made no other recent changes.&lt;/li&gt;&lt;/ol&gt;&lt;br /&gt;Here are rules to get started:&lt;br /&gt;&lt;br /&gt;&lt;b&gt;YOU'VE JUST BOUGHT A NEW COMPUTER&lt;/b&gt;&lt;br /&gt;&lt;br /&gt;If you have just purchased a new computer and it is producing memory errors, the&#10;problem could be related to anything, including a bad computer board. In this case,&#10;you need to troubleshoot the entire computer, including memory. Because the&#10;computer dealer will have configured memory and run system tests before shipping,&#10;they can best help.&lt;br /&gt;&lt;br /&gt;&lt;b&gt;YOU'VE JUST INSTALLED NEW MEMORY&lt;/b&gt;&lt;br /&gt;&lt;br /&gt;If you have just installed new memory, the first possibility is that you installed&#10;incorrect parts. Double-check the part numbers. Confirm that you have configured&#10;and installed the memory correctly.&lt;br /&gt;&lt;br /&gt;&lt;b&gt;YOU'VE INSTALLED NEW SOFTWARE OR OPERATING SYSTEM&lt;/b&gt;&lt;br /&gt;&lt;br /&gt;Newer software or operating systems tend to push memory harder than older operating&#10;systems. Sometimes memory that worked fine prior to a software installation&#10;begins producing errors once it runs memory-intensive software. New software also&#10;has bugs, and beta versions are notorious for producing memory errors. In these&#10;cases, your first step should be to ensure you have the latest BIOS and service&#10;patches for your software. Otherwise contact the memory vendor. A technical&#10;support representative may have experience with other software incidents and can&#10;walk you through more-detailed troubleshooting.&lt;br /&gt;&lt;br /&gt;&lt;b&gt;YOU'VE INSTALLED OR REMOVED HARDWARE&lt;/b&gt;&lt;br /&gt;&lt;br /&gt;If you have just installed or removed hardware and suddenly receive memory error&#10;messages, the first place to look is in the computer itself. A connection may have&#10;come loose during the installation or the new hardware may be defective; in either&#10;case the errors are manifesting themselves as memory problems. Make sure you&#10;have the latest drivers and firmware. Most hardware manufacturers will post&#10;updates on their Web sites.&lt;br /&gt;&lt;br /&gt;&lt;b&gt;UNEXPECTED PROBLEMS&lt;/b&gt;&lt;br /&gt;&lt;br /&gt;If your system has been running fine, but suddenly starts to produce memory errors,&#10;and crash or lock up frequently, the chance of a hardware failure is more likely, since&#10;configuration and installation problems show up as soon as the computer turns on.&#10;Sometimes you can get memory problems if your computer is overheating, if you are&#10;having a problem with your power supply, or if corrosion has developed between&#10;the memory module and the socket, weakening the connection.&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>8.4. HANDLING SPECIFIC PROBLEMS</title><link>https://technick.net/guides/hardware/umg/08_004/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/umg/08_004/</guid><description>&lt;hr /&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/hardware/umg/08_003"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/08_005"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt;&lt;a name="TOC"&gt;&lt;/a&gt;&lt;h3&gt;8.4. HANDLING SPECIFIC PROBLEMS&lt;/h3&gt;&lt;/p&gt;&lt;p&gt;Here is a list of the most common ways the computer informs you of a memory problem.&lt;br /&gt;&lt;br /&gt;&lt;ol&gt;&lt;li&gt;The computer won't boot, merely beeps.&lt;br /&gt;&lt;br /&gt;&lt;/li&gt;&lt;li&gt;The computer boots but the screen is blank.&lt;br /&gt;&lt;br /&gt;&lt;/li&gt;&lt;li&gt;The computer boots but the screen is blank.&lt;br /&gt;&lt;br /&gt;&lt;/li&gt;&lt;li&gt;The computer reports a memory error.&lt;ol&gt;&lt;li type="a"&gt;Memory mismatch error&lt;/li&gt;&lt;li type="a"&gt;Memory parity interrupt at xxxxx&lt;/li&gt;&lt;li type="a"&gt;Memory address error at xxxxx&lt;/li&gt;&lt;li type="a"&gt;Memory failure at xxxxx, read xxxxx, expecting xxxxx&lt;/li&gt;&lt;li type="a"&gt;Memory verify error at xxxxx&lt;/li&gt;&lt;/ol&gt;&lt;br /&gt;&lt;br /&gt;&lt;/li&gt;&lt;li&gt;The computer has other problems caused by memory.&lt;ol&gt;&lt;li type="a"&gt;The computer intermittently reports errors, crashes frequently,&#10;&#9;&#9;or spontaneously reboots.&lt;/li&gt;&lt;li type="a"&gt;Registry Errors&lt;/li&gt;&lt;li type="a"&gt;General-protection faults, page faults, and exception errors&lt;/li&gt;&lt;/ol&gt;&lt;br /&gt;&lt;/li&gt;&lt;li&gt;The server system manager reports a memory error.&lt;/li&gt;&lt;/ol&gt;&lt;br /&gt;The following translations help you understand what the computer means when it&#10;gives you one of these signals.&lt;br /&gt;&lt;br /&gt;&lt;ol&gt;&lt;li&gt;&lt;b&gt;Computer won't boot, merely beeps.&lt;/b&gt;&lt;br /&gt;Every time the computer starts, it takes inventory of hardware. Inventory&#10;consists of the computer BIOS recognizing, acknowledging, and in some cases,&#10;assigning addresses to, the components in the computer. If the computer won't&#10;boot, the CPU is unable to communicate with hardware. The cause can be&#10;improper installation or failure of the BIOS to recognize hardware.&#10;Follow basic troubleshooting, paying special attention to whether the memory&#10;module is completely installed and that you have the latest version of the BIOS.&lt;br /&gt;&lt;br /&gt;&lt;/li&gt;&lt;li&gt;&lt;b&gt;Computer boots but doesn't recognize all the installed memory.&lt;/b&gt;When the computer boots, a part of the process is counting memory. On some&#10;machines the count appears on the screen and on others is masked. If the&#10;count is masked, from the computer set-up menu see how much memory the&#10;computer thinks it has. If the computer counts to or lists a number less than&#10;the memory you installed, the computer hasn't recognized all the memory.&lt;br /&gt;&lt;br /&gt;Sometimes the computer will recognize only part of a module. This is almost&#10;always due to using the wrong kind of memory. For example, if your computer&#10;accepts only single-banked memory and you have installed dual-banked, the&#10;computer will read only half the memory on the module. Sometimes the&#10;computer will accept only modules containing memory chips with specific&#10;organizations. For example, the VX chipset doesn't work well with 64 Mbit chips.&lt;br /&gt;&lt;br /&gt;In many computers the maximum amount of memory the computer can&#10;recognize is lower than the maximum amount you can physically install. For&#10;example, your computer may have three sockets, each of which can hold a&#10;128MB module. If you filled every socket with 128MB, you would have 384MB&#10;of memory. However, your computer may recognize a maximum of 256MB. In&#10;most cases you can avoid this problem by consulting your computer manual or&#10;a memory configuration Web site before purchasing memory. Or visit the&#10;Kingston Web site.&lt;br /&gt;&lt;br /&gt;&lt;/li&gt;&lt;li&gt;&lt;b&gt;The computer boots but the screen is blank.&lt;/b&gt;The most common reason for a blank screen is a dislodged card, memory&#10;not fully seated, or memory the computer doesn't support. Confirm that the&#10;memory is installed properly and that other components in the computer were&#10;not accidentally disconnected or dislodged while you installed memory.&lt;br /&gt;&lt;br /&gt;Double-check that you have the right part number for the computer. If you have&#10;nonparity memory in a computer that requires error-checking memory, or&#10;SDRAM memory in a computer that supports only EDO, the screen may be&#10;blank at boot up.&lt;br /&gt;&lt;br /&gt;&lt;/li&gt;&lt;li&gt;&lt;b&gt;The computer reports a memory error.&lt;/b&gt;&lt;br /&gt;&lt;b&gt;Memory mismatch error:&lt;/b&gt; This is not actually an error. Some computers require&#10;you to tell them that it's OK to have a new amount of memory. Use the set-up&#10;menu to tell the computer. Follow the prompts, enter the new amount, select&#10;Save, and exit.&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Computer memory or address errors:&lt;/b&gt; All of the following errors, and those&#10;similar to them, indicate that the computer has a problem with memory:&lt;br /&gt;&lt;br /&gt;&lt;ul&gt;&lt;li&gt;Memory parity interrupt at xxxxx&lt;/li&gt;&lt;li&gt;Memory address error at xxxxx&lt;/li&gt;&lt;li&gt;Memory failure at xxxxx, read xxxxx, expecting xxxxx&lt;/li&gt;&lt;li&gt;Memory verification error at xxxxx&lt;/li&gt;&lt;/ul&gt;&lt;br /&gt;&lt;br /&gt;Typically the computer will perform a simple memory test as it boots. The&#10;computer will write information to memory and read it back. If the computer&#10;doesn't get what it was expecting, then it will report an error and sometimes&#10;give the address where the error occurred.&lt;br /&gt;&lt;br /&gt;Such errors normally indicate a problem with a memory module but can&#10;sometimes indicate a defective motherboard or incompatibility between old&#10;and new memory. To verify that the new memory is causing the problem,&#10;remove the new memory and see whether the problem goes away. Then&#10;remove the old memory and install only the new memory. If the error persists,&#10;phone the memory manufacturer and ask for a replacement.&lt;br /&gt;&lt;br /&gt;&lt;/li&gt;&lt;li&gt;&lt;b&gt;The computer has other problems caused by memory.&lt;/b&gt;&lt;br /&gt;&lt;b&gt;The Computer Intermittently Reports Errors, Crashes Frequently, or&#10;Spontaneously Reboots:&lt;/b&gt; Because of the large number of causes, these problems&#10;are difficult to diagnose. Possible causes are ESD (Electro-static Discharge),&#10;overheating, corrosion, or a faulty power supply. If you suspect ESD damage,&#10;contact the memory manufacturer and ask for a replacement. Before you install&#10;new memory, see page 85 for information on how to prevent ESD. If you suspect&#10;corrosion, clean the memory contacts and the sockets as explained on page 96.&#10;If you suspect the power supply, you will have to do overall computer&#10;troubleshooting with a focus on the power supply.&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Registry Errors:&lt;/b&gt; Windows writes a large portion of the registry to RAM.&#10;Sometimes defective memory will cause registry errors. Windows reports a&#10;registry error and prompts you to restart and restore. If the prompts repeat,&#10;remove your newly installed memory and restart the computer. If the errors&#10;disappear, ask the memory manufacturer for replacement modules.&lt;br /&gt;&lt;br /&gt;&lt;b&gt;General-Protection Faults, Page Faults, and Exception Errors:&lt;/b&gt; The most common&#10;cause is software. For example, one application may not have released the&#10;memory after quitting or occupies the same memory addresses as another. In&#10;these cases, rebooting should solve the problem. If the computer suddenly&#10;displays general-protection faults, exception errors, or page faults after you&#10;have installed new memory, remove the new memory and see whether the&#10;errors stop. If they occur only when the new memory is installed, contact the&#10;memory manufacturer for assistance.&lt;br /&gt;&lt;br /&gt;&lt;/li&gt;&lt;li&gt;&lt;b&gt;The server system manager reports a memory error.&lt;/b&gt;Most servers ship with system managers that monitor component utilization&#10;and test for abnormalities. Some of these system managers count soft errors in&#10;memory. Soft errors have been corrected by ECC memory. If the rate of soft&#10;errors is higher than specifications, however, the system manager issues a&#10;pre-failure warning. This warning enables the network administrator to replace&#10;the memory and prevent system downtime.&lt;br /&gt;&lt;br /&gt;If the system manager on your server issues a pre-failure warning or other&#10;memory error, ask your memory manufacturer for a replacement. If the system&#10;manager continues to issue errors after memory replacement, make sure you&#10;have the latest BIOS, software service patches, and firmware. The chance of&#10;receiving two bad memory modules in a row is low. Contact the memory&#10;manufacturer for compatibility troubleshooting. Sometimes the server does not&#10;work well with certain types of memory chips or certain memory designs.&lt;/li&gt;&lt;/ol&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>8.5. STILL NEED HELP?</title><link>https://technick.net/guides/hardware/umg/08_005/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/umg/08_005/</guid><description>&lt;hr /&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/hardware/umg/08_004"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/09_000"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt;&lt;a name="TOC"&gt;&lt;/a&gt;&lt;h3&gt;8.5. STILL NEED HELP?&lt;/h3&gt;&lt;/p&gt;&lt;p&gt;Most memory manufacturers have FAQ or Q-and-A sections on their Web sites. There&#10;are also troubleshooting areas on the Web site of the computer manufacturer. If you&#10;can't find anything online, phone technical support for the computer or memory manufacturer.&#10;The next section gives information about Kingston and how to reach us.&lt;/p&gt;&lt;/blockquote&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/hardware/umg/08_004"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/09_000"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;</description></item><item><title>9. MORE ABOUT KINGSTON</title><link>https://technick.net/guides/hardware/umg/09_000/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/umg/09_000/</guid><description>&lt;hr /&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/hardware/umg/08_005"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/09_001"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt;&lt;a name="TOC"&gt;&lt;/a&gt;&lt;h3&gt;9. MORE ABOUT KINGSTON&lt;/h3&gt;&lt;/p&gt;&lt;p&gt;&lt;ul&gt;&lt;li&gt;&lt;a href="https://technick.net/guides/hardware/umg/09_001"&gt;9.1. COMPANY OVERVIEW&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href="https://technick.net/guides/hardware/umg/09_002"&gt;9.2. HOW TO REACH KINGSTON&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href="https://technick.net/guides/hardware/umg/09_003"&gt;9.3. WHY KINGSTON?&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/p&gt;&lt;/blockquote&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/hardware/umg/08_005"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/09_001"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;</description></item><item><title>9.1. COMPANY OVERVIEW</title><link>https://technick.net/guides/hardware/umg/09_001/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/umg/09_001/</guid><description>&lt;hr /&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/hardware/umg/09_000"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/09_002"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt;&lt;a name="TOC"&gt;&lt;/a&gt;&lt;h3&gt;9.1. COMPANY OVERVIEW&lt;/h3&gt;&lt;/p&gt;&lt;p&gt;Founded in 1987, Kingston Technology is the world's largest independent manu-facturer&#10;of memory products. At the close of 1998, Kingston had sales in excess of&#10;$1.5 billion. Worldwide, the company presently staffs four manufacturing sites on&#10;four continents and six international sales and marketing facilities.&lt;br /&gt;&lt;br /&gt;Kingston manufactures memory products that consistently meet or exceed the&#10;industry's stringent standards, possessing both the skill and equipment necessary&#10;to create the best modules in the marketplace.&lt;br /&gt;&lt;br /&gt;The personal philosophy of company founders John Tu and David Sun, has been&#10;permanently imprinted into the corporate culture. From the company founders to&#10;the employees and ultimately, to the consumer, a special "magic" is infused into&#10;every product. At Kingston, it is the people that make the difference.&lt;br /&gt;&lt;br /&gt;The Kingston spirit reflects an individual commitment...&lt;br /&gt;&lt;br /&gt;&lt;b&gt;CORE VALUES&lt;/b&gt;&lt;br /&gt;&lt;br /&gt;&lt;ul&gt;&lt;b&gt;Respect&lt;/b&gt; for one another in our culturally diverse environment&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Loyalty&lt;/b&gt; to our long-term partnerships&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Flexibility&lt;/b&gt; and &lt;b&gt;adaptability&lt;/b&gt; in responding to our customers' needs&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Investing in our employees&lt;/b&gt; to continuously improve our most valuable resource&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Having fun&lt;/b&gt; working in the company of friends&lt;/ul&gt;&lt;br /&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>9.2. HOW TO REACH KINGSTON</title><link>https://technick.net/guides/hardware/umg/09_002/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/umg/09_002/</guid><description>&lt;hr /&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/hardware/umg/09_001"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/09_003"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt;&lt;a name="TOC"&gt;&lt;/a&gt;&lt;h3&gt;9.2. HOW TO REACH KINGSTON&lt;/h3&gt;&lt;/p&gt;&lt;p&gt;&lt;b&gt;HOW TO REACH KINGSTON&lt;/b&gt;&lt;br /&gt;&lt;table border="0" width="430" cellpadding="1" cellspacing="0"&gt;&lt;tr&gt;&lt;td colspan="2"&gt;&lt;b&gt;&lt;br /&gt;&lt;br /&gt;U.S. HEADQUARTERS&lt;/b&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt;&lt;td&gt;Kingston Technology Company&lt;/td&gt;&lt;td&gt;Toll Free: +1 (877) KINGSTON&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;17600 Newhope Street&lt;/td&gt;&lt;td&gt;Tel: +1 (714) 435-2600&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Fountain Valley, CA 92708&lt;/td&gt;&lt;td&gt;Fax: +1 (714) 435-2699&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;USA&lt;/td&gt;&lt;td&gt;Internet: www.kingston.com&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;br /&gt;&lt;br /&gt;&lt;table border="1"&gt;&lt;tr&gt;&lt;td valign="top"&gt;&lt;b&gt;MEMORY-U.S.&lt;/b&gt;&lt;/td&gt;&lt;td&gt;&lt;img src="blank.gif" width="100" height="1" /&gt;&lt;br clear="all" /&gt;&lt;b&gt;PHONE/FAX NUMBER&lt;/b&gt;&lt;/td&gt;&lt;td valign="top"&gt;&lt;b&gt;EMAIL ADDRESS&lt;/b&gt;&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td valign="top"&gt;Memory Sales&lt;/td&gt;&lt;td valign="top"&gt;+1(877)KINGSTON&lt;br /&gt;+1(714)435-2699&lt;/td&gt;&lt;td valign="top"&gt;sales@kingston.com&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td valign="top"&gt;High-end Memory &lt;br /&gt;Sales&lt;/td&gt;&lt;td valign="top"&gt;+1(888)435-5446&lt;br /&gt;+1(714)435-2618&lt;/td&gt;&lt;td valign="top"&gt;specialtygroup-hem@kingston.com&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td valign="top"&gt;ValueRam Sales&lt;/td&gt;&lt;td valign="top"&gt;+1(877)435-8726&lt;br /&gt;+1(714)445-3496&lt;/td&gt;&lt;td valign="top"&gt;valueram@kingston.com&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td valign="top"&gt;Flash Memory Sales&lt;/td&gt;&lt;td valign="top"&gt;+1(888)822-6315&lt;br /&gt;+1(714)438-1879&lt;/td&gt;&lt;td valign="top"&gt;customer_sales_support@kingston.com&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td valign="top"&gt;Technical Support&lt;/td&gt;&lt;td valign="top"&gt;+1(800)435-0640&lt;br /&gt;+1(714)424-3939&lt;/td&gt;&lt;td valign="top"&gt;tech_support@kingston.com&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td valign="top"&gt;RMA&lt;/td&gt;&lt;td valign="top"&gt;+1(800)337-3719&lt;br /&gt;+1(714)435-2643&lt;/td&gt;&lt;td valign="top"&gt;rma@kingston.com&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td valign="top"&gt;&lt;b&gt;MEMORY-INTL.&lt;br /&gt;(Supporting All &lt;br /&gt;Regions Except &lt;br /&gt;Europe)&lt;/b&gt;&lt;/td&gt;&lt;td valign="top"&gt;&lt;b&gt;PHONE/FAX NUMBER&lt;/b&gt;&lt;/td&gt;&lt;td valign="top"&gt;&lt;b&gt;EMAIL ADDRESS&lt;/b&gt;&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td valign="top"&gt;Memory Sales&lt;br /&gt;(in English)&lt;/td&gt;&lt;td valign="top"&gt;+1(714)437-3334&lt;br /&gt;+1(714)438-1820&lt;/td&gt;&lt;td valign="top"&gt;intlsales@kingston.com&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td valign="top"&gt;Technical Support &lt;br /&gt;(in English)&lt;/td&gt;&lt;td valign="top"&gt;+1(800)435-0640&lt;br /&gt;+1(714)424-3939&lt;/td&gt;&lt;td valign="top"&gt;tech_support@kingston.com&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td valign="top"&gt;Technical Support &lt;br /&gt;(in Spanish)&lt;/td&gt;&lt;td valign="top"&gt;+1(888)822-6316&lt;br /&gt;+1(714)424-3939&lt;/td&gt;&lt;td valign="top"&gt;soporte_technico@kingston.com&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td valign="top"&gt;RMA (in Spanish)&lt;/td&gt;&lt;td valign="top"&gt;+1(714)437-3334&lt;br /&gt;+1(714)438-1820&lt;/td&gt;&lt;td valign="top"&gt;export_coordinator@kingston.com&lt;/td&gt;&lt;/tr&gt;&lt;!--&#9;&lt;tr&gt;&#10;&#9;&#9;&lt;td valign="top"&gt;&lt;b&gt;PERIPHERAL PRODUCTS&lt;/b&gt;&lt;/td&gt;&#10;&#9;&#9;&lt;td valign="top"&gt;&lt;b&gt;PHONE/FAX NUMBER&lt;/b&gt;&lt;/td&gt;&#10;&#9;&#9;&lt;td valign="top"&gt;&lt;b&gt;EMAIL ADDRESS&lt;/b&gt;&lt;/td&gt;&#10;&#9;&lt;/tr&gt;&#10;&#9;&lt;tr&gt;&#10;&#9;&#9;&lt;td valign="top"&gt;Networking Sales&lt;/td&gt;&#10;&#9;&#9;&lt;td valign="top"&gt;+1(800)435-2620&lt;br&gt;+1(714)438-1879&lt;/td&gt;&#10;&#9;&#9;&lt;td valign="top"&gt;network_sales@kingston.com&lt;/td&gt;&#10;&#9;&lt;/tr&gt; &#10;&#9;&lt;tr&gt;&#10;&#9;&#9;&lt;td valign="top"&gt;PC Enhancement &lt;br&gt;Sales&lt;/td&gt;&#10;&#9;&#9;&lt;td valign="top"&gt;+1(888)435-5170&lt;br&gt;+1(714)438-1879&lt;/td&gt;&#10;&#9;&#9;&lt;td valign="top"&gt;peripheral_sales@kingston.com&lt;/td&gt;&#10;&#9;&lt;/tr&gt;&#10;&#9;&lt;tr&gt;&#10;&#9;&#9;&lt;td valign="top"&gt;Technical Support&lt;/td&gt;&#10;&#9;&#9;&lt;td valign="top"&gt;+1(714)424-3930&lt;br&gt;+1(714)437-3310&lt;/td&gt;&#10;&#9;&#9;&lt;td valign="top"&gt;tech_support@kingston.com&lt;/td&gt;&#10;&#9;&lt;/tr&gt; &#10;&#9;&lt;tr&gt;&#10;&#9;&#9;&lt;td valign="top"&gt;RMA&lt;/td&gt;&#10;&#9;&#9;&lt;td valign="top"&gt;+1(800)337-3719&lt;br&gt;+1(714)435-2643&lt;/td&gt;&#10;&#9;&#9;&lt;td valign="top"&gt;rma@kingston.com&lt;/td&gt;&#10;&#9;&lt;/tr&gt; --&gt;&lt;tr&gt;&lt;td valign="top"&gt;&lt;b&gt;STORCASE TECHNOLOGY, INC.&lt;/b&gt;&lt;/td&gt;&lt;td valign="top"&gt;&lt;b&gt;PHONE/FAX NUMBER&lt;/b&gt;&lt;/td&gt;&lt;td valign="top"&gt;&lt;b&gt;EMAIL ADDRESS&lt;/b&gt;&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td valign="top"&gt;StorCase Sales&lt;/td&gt;&lt;td valign="top"&gt;+1(800)435-0642&lt;br /&gt;+1(714)438-1847&lt;/td&gt;&lt;td valign="top"&gt;info@storcase.com&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td valign="top"&gt;StorCase Technical &lt;br /&gt;Support&lt;/td&gt;&lt;td valign="top"&gt;+1(714)438-1858&lt;br /&gt;+1(714)438-1847&lt;/td&gt;&lt;td valign="top"&gt;tech_support@storcase.com&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;br /&gt;&lt;br /&gt;&lt;table border="0" width="430" cellpadding="1" cellspacing="0"&gt;&lt;tr&gt;&lt;td colspan="2"&gt;&lt;b&gt;&lt;br /&gt;&lt;br /&gt;EUROPEAN HEADQUARTERS&lt;/b&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt;&lt;td&gt;Kingston Technology Europe, Inc.&lt;/td&gt;&lt;td&gt;Tel: +44 (0) 1932 738 888&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Kingston Court&lt;/td&gt;&lt;td&gt;Fax: +44 (0) 1932 738 880&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Sunbury-on-Thames&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;Middlesex TW16 7EP&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td&gt;England&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;table border="0" width="430" cellpadding="1" cellspacing="0"&gt;&lt;tr&gt;&lt;td colspan="2"&gt;&lt;b&gt;&lt;br /&gt;&lt;br /&gt;EUROPEAN BRANCH OFFICES&lt;/b&gt;&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt;&lt;td valign="top"&gt;&lt;img src="blank.gif" width="215" height="1" alt="" /&gt;&lt;br clear="all" /&gt;Kingston Technology GmbH&lt;br /&gt;Hoferstrasse 1&lt;br /&gt;81737 Munich&lt;/td&gt;&lt;td valign="top"&gt;&lt;img src="blank.gif" width="215" height="1" alt="" /&gt;&lt;br clear="all" /&gt;Tel: +49 89 627 1560&lt;br /&gt;Telefax: +49 49 89 627 15660&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td valign="top"&gt;&lt;img src="blank.gif" width="215" height="1" alt="" /&gt;&lt;br clear="all" /&gt;Kingston Technology France&lt;br /&gt;171A, Avenue Charles De Gaulle&lt;/td&gt;&lt;td valign="top"&gt;&lt;img src="blank.gif" width="215" height="1" alt="" /&gt;&lt;br clear="all" /&gt;Tel: +33 1 46 43 9530&lt;br /&gt;Tel: 0800 90 57 01 (Toll-free Customer Service within France)&lt;br /&gt;Telefax: +33 1 46 43 9535&lt;br /&gt;Telecopie: 0800 90 09 10 (Toll-free within France)&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>9.3. WHY KINGSTON?</title><link>https://technick.net/guides/hardware/umg/09_003/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/umg/09_003/</guid><description>&lt;hr /&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;a href="https://technick.net/guides/hardware/umg/09_002"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/00_toc"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/hardware/umg/10_000"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt;&lt;a name="TOC"&gt;&lt;/a&gt;&lt;h3&gt;9.3. WHY KINGSTON?&lt;/h3&gt;&lt;/p&gt;&lt;p&gt;&lt;b&gt;ISO 9001 CERTIFICATION&lt;/b&gt;&lt;br /&gt;&lt;br /&gt;Kingston is ISO 9001 certified as part of a continuing global effort to assure customers&#10;the highest quality service and products.&lt;br /&gt;&lt;br /&gt;&lt;b&gt;EXCEPTIONAL QUALITY&lt;/b&gt;&lt;br /&gt;&lt;br /&gt;In addition to our ISO 9001 certification, we have established an extensive DCAT&#10;(Design, Components, Assembly, and Test) quality-control process to ensure total&#10;product reliability.&lt;br /&gt;&lt;br /&gt;&lt;b&gt;PROVEN INDUSTRY LEADER&lt;/b&gt;&lt;br /&gt;&lt;br /&gt;Kingston has been making memory modules since 1987.&lt;br /&gt;&lt;br /&gt;&lt;b&gt;100% PRODUCT TESTING&lt;/b&gt;&lt;br /&gt;&lt;br /&gt;Kingston tests every memory module before shipping. Our customized test equipment&#10;is so comprehensive that it can test every cell on every chip on every module-on a&#10;64MB module, that's 512 million cells!&lt;br /&gt;&lt;br /&gt;&lt;b&gt;PREMIUM COMPONENTS&lt;/b&gt;&lt;br /&gt;&lt;br /&gt;Kingston buys 100% of its memory chips from top-tier DRAM suppliers.&lt;br /&gt;&lt;br /&gt;&lt;b&gt;FREE TECHNICAL SUPPORT&lt;/b&gt;&lt;br /&gt;&lt;br /&gt;Technical support professionals are available to answer your call 24 hours a day,&#10;7 days a week at (800) 435-0640. Average wait time is less than 1 minute.&lt;br /&gt;&lt;br /&gt;&lt;b&gt;KINGSTON'S LIFETIME WARRANTY&lt;/b&gt;&lt;br /&gt;&lt;br /&gt;With a lifetime warranty on all Kingston memory upgrades, network adapters, and&#10;processor upgrades, you have the most comprehensive warranty in the industry.&lt;br /&gt;&lt;br /&gt;&lt;b&gt;FREE EVALUATION UNITS&lt;/b&gt;&lt;br /&gt;&lt;br /&gt;Kingston offers a free 30-day product evaluation program to qualified corporate &#10;customers.&lt;br /&gt;&lt;br /&gt;&lt;b&gt;100% COMPATIBILITY GUARANTEE&lt;/b&gt;&lt;br /&gt;&lt;br /&gt;Kingston guarantees all memory products to be compatible with the system or family&#10;of systems for which they're designed.&lt;br /&gt;&lt;br /&gt;&lt;b&gt;OVERNIGHT PRODUCT REPLACEMENT&lt;/b&gt;&lt;br /&gt;&lt;br /&gt;In the unlikely event your Kingston product needs repair or replacement, we will&#10;cross-ship a replacement product to you overnight (in most cases).&lt;br /&gt;&lt;br /&gt;&lt;b&gt;FREE LITERATURE&lt;/b&gt;&lt;br /&gt;&lt;br /&gt;Kingston is committed to educating customers on memory and related technology.&#10;White papers, memory bits, and other informative tools are available free of charge&#10;in electronic and printed formats. Send requests to webmaster@kingston.com.&lt;br /&gt;&lt;br /&gt;&lt;b&gt;CORPORATE ALLIANCE PROGRAM (CAP)&lt;/b&gt;&lt;br /&gt;&lt;br /&gt;As an extension of Kingston's service commitment, we offer Corporate Alliance&#10;membership to qualified IT professionals. Benefits include a dedicated Kingston&#10;representative, use of the Partner Purchase Program, on site tech support training,&#10;and special pricing.&lt;br /&gt;&lt;br /&gt;&lt;b&gt;FIELD SUPPORT&lt;/b&gt;&lt;br /&gt;&lt;br /&gt;Kingston's field sales team is available for regional and on-site customer support.&#10;To find a representative in your area, go to www.kingston.com/contact/field.asp.&lt;br /&gt;&lt;br /&gt;&lt;b&gt;USER-FRIENDLY WEB SITE&lt;/b&gt;&lt;br /&gt;&lt;br /&gt;Kingston's Web site &lt;b&gt;&lt;a href="http://www.kingston.com" target="_blank"&gt;www.kingston.com&lt;/a&gt;&lt;/b&gt; has the latest information on industry&#10;trends, promotions, product releases, and more.&lt;br /&gt;&lt;br /&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Device Servers: Network-Enabling Nearly Any Device</title><link>https://technick.net/guides/hardware/net/device_servers/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/net/device_servers/</guid><description>&lt;p&gt;&lt;h4&gt;Terminal and Print Servers -- Traditional Applications&lt;/h4&gt; &lt;/p&gt;&lt;p&gt;Despite many of &#10;the advancements of the computer industry, there still exist a great &#10;many applications where serial I/O devices are the best or only solution. &#10;Terminal/print/serial servers have long been the best method for networking &#10;simple terminals, bar code readers, scanners or printers. Input devices &#10;attached to a serial port on a server can reach any host supporting &#10;the same protocols as that server. Printers can be shared over the network &#10;in the same manner, with a job from one protocol following a job from &#10;another. In the case of the print server that has multiple ports, jobs &#10;coming from hosts supporting different protocols can even print simultaneously.&lt;/p&gt;</description></item><item><title>Ethernet Tutorial Part I: Networking Basics</title><link>https://technick.net/guides/hardware/net/ethernet_01/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/net/ethernet_01/</guid><description>&lt;hr /&gt;&lt;a name="siunitsmain"&gt;&lt;/a&gt; &#10;&lt;p&gt;As companies rely on applications &#10;like electronic mail and database management for core business operations, &#10;computer networking becomes increasingly more important. This tutorial &#10;helps to explain Ethernet and Fast Ethernet, which are two of the &#10;most popular technologies used in networking.&lt;/p&gt; &lt;h4&gt;LANs (Local Area Networks)&lt;/h4&gt; &lt;p&gt;A network is any collection &#10;of independent computers that communicate with one another over a &#10;shared network medium. LANs are networks usually confined to &#10;a geographic area, such as a single building or a college campus. &#10;LANs can be small, linking as few as three computers, but often link &#10;hundreds of computers used by thousands of people. The development of standard networking protocols and media has resulted in worldwide proliferation of LANs throughout business and educational organizations.&lt;/p&gt;</description></item><item><title>Ethernet Tutorial Part II: Adding Speed</title><link>https://technick.net/guides/hardware/net/ethernet_02/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/net/ethernet_02/</guid><description>&lt;p&gt;&lt;a name="siunitsmain"&gt;&lt;/a&gt; &lt;hr /&gt;&lt;p&gt;While repeaters allow LANs&#10;to extend beyond normal distance limitations, they still limit the number&#10;of nodes that can be supported. Bridges and switches, however, allow&#10;LANs to grow significantly larger by virtue of their ability to support&#10;full Ethernet segments on each port. Additionally, bridges and switches&#10;selectively filter network traffic to only those packets needed on each&#10;segment - this significantly increases throughput on each segment and&#10;on the overall network. By providing better performance and more flexibility&#10;for network topologies, bridges and switches will continue to gain popularity&#10;among network managers.&lt;/p&gt;</description></item><item><title>Ethernet Tutorial Part III: Sharing Devices</title><link>https://technick.net/guides/hardware/net/ethernet_03/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/net/ethernet_03/</guid><description>&lt;p&gt;&lt;a name="siunitsmain"&gt;&lt;/a&gt; &lt;hr /&gt;&lt;p&gt;&lt;h4&gt;Device Servers&lt;/h4&gt; &lt;/p&gt;&lt;p&gt;A &lt;b&gt;device server&lt;/b&gt; is defined&#10;as a specialized, network-based hardware device designed&#10;to perform a single or specialized set of server functions. It is characterized&#10;by a minimal operating architecture that requires no per seat network&#10;operating system license, and client access that is independent of any&#10;operating system or proprietary protocol. In addition the device server is&#10;a &amp;ldquo;closed box,&amp;rdquo; delivering extreme ease of installation, minimal&#10;maintenance, and can be managed by the client remotely via a Web browser.&lt;/p&gt;</description></item><item><title>Guide to Using Fast Ethernet</title><link>https://technick.net/guides/hardware/net/fast_ethernet/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/net/fast_ethernet/</guid><description>&lt;p&gt;&lt;a name="siunitsmain"&gt;&lt;/a&gt;&lt;hr /&gt;&lt;p&gt;The demand for higher transmission speeds for near-term network growth has been realized by the new Fast Ethernet specification (IEEE 802.3u) known as 100BASE-T. This new LAN standard has raised the Ethernet speed limit from 10 Megabits per second to 100 Megabits per second with only minimal changes to the existing cable structure. The building blocks of today&amp;rsquo;s networks call out for a mixture of legacy 10BASE-T Ethernet networks and Fast Ethernet. &lt;/p&gt;</description></item><item><title>Music 320 Background Reader Mathematics of the Discrete Fourier Transform (DFT)</title><link>https://technick.net/guides/theory/dft/default/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/default/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/preface"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;p&gt;&lt;h1 align="CENTER"&gt;Music 320 Background Reader&lt;br /&gt;Mathematics of the Discrete Fourier Transform (&lt;a href="https://technick.net/guides/theory/dft/dft"&gt;DFT&lt;/a&gt;)&lt;/h1&gt;&lt;/p&gt;&lt;p align="CENTER"&gt;&lt;strong&gt;&lt;a name="tex2html1" href="https://ccrma.stanford.edu/~jos/"&gt;Julius O. Smith III&lt;/a&gt;(&lt;a name="tex2html2" href="mailto:jos@ccrma.stanford.edu"&gt;jos@ccrma.stanford.edu&lt;/a&gt;) &lt;br /&gt;Center for Computer Research in Music &#10;&lt;p&gt;and Acoustics (CCRMA)&lt;br /&gt;Department of Music,Stanford University&lt;br /&gt;Stanford, California 94305&lt;/strong&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;hr /&gt;&lt;!--Table of Child-Links--&gt;&lt;a name="CHILD_LINKS"&gt;&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html128" href="https://technick.net/guides/theory/dft/preface"&gt;Preface&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html129" href="https://technick.net/guides/theory/dft/outline"&gt;Outline&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html130" href="https://technick.net/guides/theory/dft/introduction_dft"&gt;Introduction to the DFT&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html131" href="https://technick.net/guides/theory/dft/dft"&gt;The DFT&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html132" href="https://technick.net/guides/theory/dft/mathematics_dft"&gt;Mathematics of the DFT&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html133" href="https://technick.net/guides/theory/dft/dft_math_outline"&gt;DFT Math Outline&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html134" href="https://technick.net/guides/theory/dft/introduction_complex_number"&gt;Introduction to Complex Numbers&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html135" href="https://technick.net/guides/theory/dft/factoring_polynomial_with"&gt;Factoring a Polynomial with Real Roots&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html136" href="https://technick.net/guides/theory/dft/quadratic_formula"&gt;The Quadratic Formula&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html137" href="https://technick.net/guides/theory/dft/complex_roots"&gt;Complex Roots&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html138" href="https://technick.net/guides/theory/dft/fundamental_theorem_algebra"&gt;The Fundamental Theorem of Algebra&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html139" href="https://technick.net/guides/theory/dft/complex_numbers"&gt;Complex Numbers&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html140" href="https://technick.net/guides/theory/dft/complex_plane"&gt;The Complex Plane&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html141" href="https://technick.net/guides/theory/dft/more_notation_terminology"&gt;More Notation and Terminology&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html142" href="https://technick.net/guides/theory/dft/elementary_relationships"&gt;Elementary Relationships&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html143" href="https://technick.net/guides/theory/dft/euler_s_formula"&gt;Euler&amp;rsquo;s Formula&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html144" href="https://technick.net/guides/theory/dft/de_moivre_s_theorem"&gt;De Moivre&amp;rsquo;s Theorem&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html145" href="https://technick.net/guides/theory/dft/numerical_tools_matlab"&gt;Numerical Tools in Matlab&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html146" href="https://technick.net/guides/theory/dft/numerical_tools_mathematica"&gt;Numerical Tools in Mathematica&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html147" href="https://technick.net/guides/theory/dft/proof_euler_s_identity"&gt;Proof of Euler&amp;rsquo;s Identity&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html148" href="https://technick.net/guides/theory/dft/euler_s_theorem"&gt;Euler&amp;rsquo;s Theorem&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html149" href="https://technick.net/guides/theory/dft/positive_integer_exponents"&gt;Positive Integer Exponents&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html150" href="https://technick.net/guides/theory/dft/properties_exponents"&gt;Properties of Exponents&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html151" href="https://technick.net/guides/theory/dft/exponent_zero"&gt;The Exponent Zero&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html152" href="https://technick.net/guides/theory/dft/negative_exponents"&gt;Negative Exponents&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html153" href="https://technick.net/guides/theory/dft/rational_exponents"&gt;Rational Exponents&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html154" href="https://technick.net/guides/theory/dft/special_case_mth"&gt;Special Case: The Mth Roots of Unity&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html155" href="https://technick.net/guides/theory/dft/real_exponents"&gt;Real Exponents&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html156" href="https://technick.net/guides/theory/dft/first_look_at"&gt;A First Look at Taylor Series&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html157" href="https://technick.net/guides/theory/dft/imaginary_exponents"&gt;Imaginary Exponents&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html158" href="https://technick.net/guides/theory/dft/derivatives_f_x_a_x"&gt;Derivatives of f(x)=a^x&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html159" href="https://technick.net/guides/theory/dft/back_e"&gt;Back to &lt;i&gt;e&lt;/i&gt;&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html160" href="https://technick.net/guides/theory/dft/sidebar_mathematica"&gt;Sidebar on Mathematica&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html161" href="https://technick.net/guides/theory/dft/back_e_j_theta"&gt;Back to e^(j theta)&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html162" href="https://technick.net/guides/theory/dft/informal_derivation_taylor"&gt;Informal Derivation of &lt;i&gt;Taylor Series Expansion&lt;/i&gt;&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html163" href="https://technick.net/guides/theory/dft/derivation_taylor_series"&gt;Derivation of Taylor Series Expansion with Remainder&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html164" href="https://technick.net/guides/theory/dft/formal_statement_taylor_s"&gt;Formal Statement of Taylor&amp;rsquo;s Theorem&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html165" href="https://technick.net/guides/theory/dft/weierstrass_polynomial_appr"&gt;The Weierstrass (Polynomial) Approximation Theorem&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html166" href="https://technick.net/guides/theory/dft/further_notes_differentiabi"&gt;Further Notes on Differentiability of Audio Signals&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html167" href="https://technick.net/guides/theory/dft/logarithms_decibels_number"&gt;Logarithms, Decibels, and Number Systems&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html168" href="https://technick.net/guides/theory/dft/logarithms"&gt;Logarithms&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html169" href="https://technick.net/guides/theory/dft/changing_base"&gt;Changing the Base&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html170" href="https://technick.net/guides/theory/dft/logarithms_negative_imagina"&gt;Logarithms of Negative and Imaginary Numbers&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html171" href="https://technick.net/guides/theory/dft/decibels"&gt;Decibels&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html172" href="https://technick.net/guides/theory/dft/properties_db_scales"&gt;Properties of DB Scales&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html173" href="https://technick.net/guides/theory/dft/specific_db_scales"&gt;Specific DB Scales&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html174" href="https://technick.net/guides/theory/dft/dbm_scale"&gt;DBm Scale&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html175" href="https://technick.net/guides/theory/dft/dbv_scale"&gt;DBV Scale&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html176" href="https://technick.net/guides/theory/dft/db_spl"&gt;DB SPL&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html177" href="https://technick.net/guides/theory/dft/db_display"&gt;DB for Display&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html178" href="https://technick.net/guides/theory/dft/dynamic_range"&gt;Dynamic Range&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html179" href="https://technick.net/guides/theory/dft/linear_number_systems"&gt;Linear Number Systems for Digital Audio&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html180" href="https://technick.net/guides/theory/dft/pulse_code_modulation"&gt;Pulse Code Modulation (PCM)&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html181" href="https://technick.net/guides/theory/dft/binary_integer_fixed_point"&gt;Binary Integer Fixed-Point Numbers&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html182" href="https://technick.net/guides/theory/dft/one_s_complement_fixed_poin"&gt;One&amp;rsquo;s Complement Fixed-Point Format&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html183" href="https://technick.net/guides/theory/dft/two_s_complement_fixed_poin"&gt;Two&amp;rsquo;s Complement Fixed-Point Format&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html184" href="https://technick.net/guides/theory/dft/general_formula_two_s_compl"&gt;General Formula for Two&amp;rsquo;s-Complement,&#10;Integer Fixed-Point Numbers&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html185" href="https://technick.net/guides/theory/dft/little_endian_formula"&gt;&amp;lsquo;&amp;lsquo;Little Endian&amp;rsquo;&amp;rsquo; Formula for Two&amp;rsquo;s-Complement,&#10;Integer Fixed-Point Numbers&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html186" href="https://technick.net/guides/theory/dft/fractional_binary_fixed_poi"&gt;Fractional Binary Fixed-Point Numbers&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html187" href="https://technick.net/guides/theory/dft/how_many_bits"&gt;How Many Bits are Enough for Digital Audio?&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html188" href="https://technick.net/guides/theory/dft/when_do_we"&gt;When Do We Have to Swap Bytes When Changing Computers?&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html189" href="https://technick.net/guides/theory/dft/logarithmic_number_systems"&gt;Logarithmic Number Systems for Digital Audio&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html190" href="https://technick.net/guides/theory/dft/floating_point_numbers"&gt;Floating-Point Numbers&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html191" href="https://technick.net/guides/theory/dft/logarithmic_fixed_point_num"&gt;Logarithmic Fixed-Point Numbers&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html192" href="https://technick.net/guides/theory/dft/law_companding"&gt;&lt;img width="14" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img5.png" alt="$\" u="u" /&gt;-Law Companding&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html193" href="https://technick.net/guides/theory/dft/appendix_a_round_off"&gt;Appendix A: Round-Off Error Variance&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html194" href="https://technick.net/guides/theory/dft/appendix_b_electrical"&gt;Appendix B: Electrical Engineering 101&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html195" href="https://technick.net/guides/theory/dft/sinusoids_exponentials"&gt;Sinusoids and Exponentials&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html196" href="https://technick.net/guides/theory/dft/sinusoids"&gt;Sinusoids&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html197" href="https://technick.net/guides/theory/dft/example_sinusoids"&gt;Example Sinusoids&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html198" href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;Why Sinusoids are Important&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html199" href="https://technick.net/guides/theory/dft/in_phase_quadrature_sinusoi"&gt;In-Phase and Quadrature Sinusoidal Components&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html200" href="https://technick.net/guides/theory/dft/sinusoids_at_same"&gt;Sinusoids at the Same Frequency&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html201" href="https://technick.net/guides/theory/dft/constructive_destructive_in"&gt;Constructive and Destructive Interference of Sinusoids&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html202" href="https://technick.net/guides/theory/dft/exponentials"&gt;Exponentials&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html203" href="https://technick.net/guides/theory/dft/why_exponentials_are"&gt;Why Exponentials are Important&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html204" href="https://technick.net/guides/theory/dft/audio_decay_time"&gt;Audio Decay Time (&lt;img width="23" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img8.png" alt="$t_{60}$" /&gt;)&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html205" href="https://technick.net/guides/theory/dft/complex_sinusoids"&gt;Complex Sinusoids&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html206" href="https://technick.net/guides/theory/dft/circular_motion"&gt;Circular Motion&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html207" href="https://technick.net/guides/theory/dft/projection_circular_motion"&gt;Projection of Circular Motion&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html208" href="https://technick.net/guides/theory/dft/positive_negative_frequenci"&gt;Positive and Negative Frequencies&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html209" href="https://technick.net/guides/theory/dft/analytic_signal_hilbert"&gt;The Analytic Signal and Hilbert Transform Filters&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html210" href="https://technick.net/guides/theory/dft/generalized_complex_sinusoi"&gt;Generalized Complex Sinusoids&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html211" href="https://technick.net/guides/theory/dft/sampled_sinusoids"&gt;Sampled Sinusoids&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html212" href="https://technick.net/guides/theory/dft/powers"&gt;Powers of &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt;&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html213" href="https://technick.net/guides/theory/dft/why_generalized_complex"&gt;Why (Generalized) Complex Sinusoids are Important&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html214" href="https://technick.net/guides/theory/dft/comparing_analog_digital"&gt;Comparing Analog and Digital Complex Planes&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html215" href="https://technick.net/guides/theory/dft/mathematica_selected_plots"&gt;Mathematica for Selected Plots&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html216" href="https://technick.net/guides/theory/dft/acknowledgement"&gt;Acknowledgement&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html217" href="https://technick.net/guides/theory/dft/geometric_signal_theory"&gt;Geometric Signal Theory&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html218" href="https://technick.net/guides/theory/dft/dft"&gt;The DFT&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html219" href="https://technick.net/guides/theory/dft/signals_vectors"&gt;Signals as Vectors&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html220" href="https://technick.net/guides/theory/dft/example_vector_view"&gt;An Example Vector View: &lt;img width="48" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img19.png" alt="$N=2$" /&gt;&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html221" href="https://technick.net/guides/theory/dft/vector_addition"&gt;Vector Addition&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html222" href="https://technick.net/guides/theory/dft/vector_subtraction"&gt;Vector Subtraction&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html223" href="https://technick.net/guides/theory/dft/signal_metrics"&gt;Signal Metrics&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html224" href="https://technick.net/guides/theory/dft/other_norms"&gt;Other Norms&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html225" href="https://technick.net/guides/theory/dft/inner_product"&gt;The Inner Product&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html226" href="https://technick.net/guides/theory/dft/linearity_inner_product"&gt;Linearity of the Inner Product&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html227" href="https://technick.net/guides/theory/dft/norm_induced_inner"&gt;Norm Induced by the Inner Product&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html228" href="https://technick.net/guides/theory/dft/cauchy_schwarz_inequality"&gt;Cauchy-Schwarz Inequality&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html229" href="https://technick.net/guides/theory/dft/triangle_inequality"&gt;Triangle Inequality&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html230" href="https://technick.net/guides/theory/dft/triangle_difference_inequal"&gt;Triangle Difference Inequality&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html231" href="https://technick.net/guides/theory/dft/vector_cosine"&gt;Vector Cosine&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html232" href="https://technick.net/guides/theory/dft/orthogonality"&gt;Orthogonality&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html233" href="https://technick.net/guides/theory/dft/pythagorean_theorem_n_space"&gt;The Pythagorean Theorem in N-Space&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html234" href="https://technick.net/guides/theory/dft/projection"&gt;Projection&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html235" href="https://technick.net/guides/theory/dft/signal_reconstruction_proje"&gt;Signal Reconstruction from Projections&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html236" href="https://technick.net/guides/theory/dft/example_changing_coordinate"&gt;An Example of Changing Coordinates in 2D&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html237" href="https://technick.net/guides/theory/dft/general_conditions"&gt;General Conditions&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html238" href="https://technick.net/guides/theory/dft/gram_schmidt_orthogonalizat"&gt;Gram-Schmidt Orthogonalization&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html239" href="https://technick.net/guides/theory/dft/appendix_matlab_examples"&gt;Appendix: Matlab Examples&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html240" href="https://technick.net/guides/theory/dft/discrete_fourier_transform"&gt;The Discrete Fourier Transform (DFT) Derived&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html241" href="https://technick.net/guides/theory/dft/dft_derived"&gt;The DFT Derived&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html242" href="https://technick.net/guides/theory/dft/geometric_series"&gt;Geometric Series&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html243" href="https://technick.net/guides/theory/dft/orthogonality_sinusoids"&gt;Orthogonality of Sinusoids&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html244" href="https://technick.net/guides/theory/dft/orthogonality_dft_sinusoids"&gt;Orthogonality of the DFT Sinusoids&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html245" href="https://technick.net/guides/theory/dft/norm_dft_sinusoids"&gt;Norm of the DFT Sinusoids&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html246" href="https://technick.net/guides/theory/dft/orthonormal_sinusoidal_set"&gt;An Orthonormal Sinusoidal Set&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html247" href="https://technick.net/guides/theory/dft/discrete_fourier_transform"&gt;The Discrete Fourier Transform (DFT)&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html248" href="https://technick.net/guides/theory/dft/frequencies_cracks"&gt;Frequencies in the &amp;lsquo;&amp;lsquo;Cracks&amp;rsquo;&amp;rsquo;&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html249" href="https://technick.net/guides/theory/dft/normalized_dft"&gt;Normalized DFT&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html250" href="https://technick.net/guides/theory/dft/length_2_dft"&gt;The Length 2 DFT&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html251" href="https://technick.net/guides/theory/dft/matrix_formulation_dft"&gt;Matrix Formulation of the DFT&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html252" href="https://technick.net/guides/theory/dft/matrices"&gt;Matrices&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html253" href="https://technick.net/guides/theory/dft/matrix_multiplication"&gt;Matrix Multiplication&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html254" href="https://technick.net/guides/theory/dft/dft_matrix"&gt;The DFT Matrix&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html255" href="https://technick.net/guides/theory/dft/matlab_examples"&gt;Matlab Examples&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html256" href="https://technick.net/guides/theory/dft/figure_7_2"&gt;Figure 7.2&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html257" href="https://technick.net/guides/theory/dft/figure_7_3"&gt;Figure 7.3&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html258" href="https://technick.net/guides/theory/dft/dft_matrix"&gt;DFT Matrix&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html259" href="https://technick.net/guides/theory/dft/fourier_theorems_dft"&gt;Fourier Theorems for the DFT&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html260" href="https://technick.net/guides/theory/dft/dft_its_inverse"&gt;The DFT and its Inverse&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html261" href="https://technick.net/guides/theory/dft/notation_terminology"&gt;Notation and Terminology&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html262" href="https://technick.net/guides/theory/dft/modulo_indexing_periodic"&gt;Modulo Indexing, Periodic Extension&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html263" href="https://technick.net/guides/theory/dft/signal_operators"&gt;Signal Operators&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html264" href="https://technick.net/guides/theory/dft/flip_operator"&gt;Flip Operator&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html265" href="https://technick.net/guides/theory/dft/shift_operator"&gt;Shift Operator&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html266" href="https://technick.net/guides/theory/dft/convolution"&gt;Convolution&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html267" href="https://technick.net/guides/theory/dft/graphical_convolution"&gt;Graphical Convolution&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html268" href="https://technick.net/guides/theory/dft/polynomial_multiplication"&gt;Polynomial Multiplication&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html269" href="https://technick.net/guides/theory/dft/multiplication_decimal_numb"&gt;Multiplication of Decimal Numbers&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html270" href="https://technick.net/guides/theory/dft/correlation"&gt;Correlation&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html271" href="https://technick.net/guides/theory/dft/stretch_operator"&gt;Stretch Operator&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html272" href="https://technick.net/guides/theory/dft/zero_padding"&gt;Zero Padding&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html273" href="https://technick.net/guides/theory/dft/repeat_operator"&gt;Repeat Operator&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html274" href="https://technick.net/guides/theory/dft/decimation_operator"&gt;Decimation Operator&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html275" href="https://technick.net/guides/theory/dft/alias_operator"&gt;Alias Operator&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html276" href="https://technick.net/guides/theory/dft/even_odd_functions"&gt;Even and Odd Functions&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html277" href="https://technick.net/guides/theory/dft/fourier_theorems"&gt;The Fourier Theorems&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html278" href="https://technick.net/guides/theory/dft/linearity"&gt;Linearity&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html279" href="https://technick.net/guides/theory/dft/conjugation_reversal"&gt;Conjugation and Reversal&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html280" href="https://technick.net/guides/theory/dft/symmetry"&gt;Symmetry&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html281" href="https://technick.net/guides/theory/dft/shift_theorem"&gt;Shift Theorem&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html282" href="https://technick.net/guides/theory/dft/linear_phase_terms"&gt;Linear Phase Terms&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html283" href="https://technick.net/guides/theory/dft/application_shift_theorem"&gt;Application of the Shift Theorem to FFT Windows&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html284" href="https://technick.net/guides/theory/dft/convolution_theorem"&gt;Convolution Theorem&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html285" href="https://technick.net/guides/theory/dft/dual_convolution_theorem"&gt;Dual of the Convolution Theorem&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html286" href="https://technick.net/guides/theory/dft/correlation_theorem"&gt;Correlation Theorem&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html287" href="https://technick.net/guides/theory/dft/power_theorem"&gt;Power Theorem&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html288" href="https://technick.net/guides/theory/dft/rayleigh_energy_theorem"&gt;Rayleigh Energy Theorem (Parseval&amp;rsquo;s Theorem)&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html289" href="https://technick.net/guides/theory/dft/stretch_theorem_repeat"&gt;Stretch Theorem (Repeat Theorem)&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html290" href="https://technick.net/guides/theory/dft/decimation_theorem_aliasing"&gt;Decimation Theorem (Aliasing Theorem)&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html291" href="https://technick.net/guides/theory/dft/zero_padding_theorem"&gt;Zero Padding Theorem&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html292" href="https://technick.net/guides/theory/dft/bandlimited_interpolation_t"&gt;Bandlimited Interpolation in Time&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html293" href="https://technick.net/guides/theory/dft/conclusions"&gt;Conclusions&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html294" href="https://technick.net/guides/theory/dft/acknowledgement"&gt;Acknowledgement&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html295" href="https://technick.net/guides/theory/dft/appendix_a_linear"&gt;Appendix A: Linear Time-Invariant Filters and Convolution&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html296" href="https://technick.net/guides/theory/dft/lti_filters_convolution"&gt;LTI Filters and the Convolution Theorem&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html297" href="https://technick.net/guides/theory/dft/appendix_b_introductory"&gt;Appendix B: Introductory Statistical Signal Processing&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html298" href="https://technick.net/guides/theory/dft/cross_correlation"&gt;Cross-Correlation&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html299" href="https://technick.net/guides/theory/dft/applications_cross_correlat"&gt;Applications of Cross-Correlation&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html300" href="https://technick.net/guides/theory/dft/autocorrelation"&gt;Autocorrelation&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html301" href="https://technick.net/guides/theory/dft/coherence"&gt;Coherence&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html302" href="https://technick.net/guides/theory/dft/appendix_c_mathematica_matl"&gt;Appendix C: Mathematica/Matlab Examples&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html303" href="https://technick.net/guides/theory/dft/appendix_d_similarity"&gt;Appendix D: The Similarity Theorem&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html304" href="https://technick.net/guides/theory/dft/example_applications_dft"&gt;Example Applications of the DFT&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html305" href="https://technick.net/guides/theory/dft/spectrum_analysis_sinusoid"&gt;Spectrum Analysis of a Sinusoid: Windowing, Zero-Padding, and the FFT&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html306" href="https://technick.net/guides/theory/dft/example_1_fft"&gt;Example 1: FFT of a Simple Sinusoid&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html307" href="https://technick.net/guides/theory/dft/example_2_fft"&gt;Example 2: FFT of a Not-So-Simple Sinusoid&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html308" href="https://technick.net/guides/theory/dft/example_3_fft"&gt;Example 3: FFT of a Zero-Padded Sinusoid&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html309" href="https://technick.net/guides/theory/dft/example_4_blackman"&gt;Example 4: Blackman Window&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html310" href="https://technick.net/guides/theory/dft/example_5_use"&gt;Example 5: Use of the Blackman Window&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html311" href="https://technick.net/guides/theory/dft/example_6_hanning_windowed"&gt;Example 6: Hanning-Windowed Complex Sinusoid&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html312" href="https://technick.net/guides/theory/dft/spectral_phase"&gt;Spectral Phase&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html313" href="https://technick.net/guides/theory/dft/basic_tutorial_sampling"&gt;A Basic Tutorial on Sampling Theory&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html314" href="https://technick.net/guides/theory/dft/introduction"&gt;Introduction&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html315" href="https://technick.net/guides/theory/dft/reconstruction_samples_pict"&gt;Reconstruction from Samples&amp;ndash;Pictorial Version&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html316" href="https://technick.net/guides/theory/dft/reconstruction_samples_the"&gt;Reconstruction from Samples&amp;ndash;The Math&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html317" href="https://technick.net/guides/theory/dft/aliasing_sampled_continuous"&gt;Aliasing of Sampled Continuous-Time Signals&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html318" href="https://technick.net/guides/theory/dft/shannon_s_sampling_theorem"&gt;Shannon&amp;rsquo;s Sampling Theorem&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html319" href="https://technick.net/guides/theory/dft/figuring_out_sampling"&gt;Figuring Out Sampling Theory by Playing Around with Complex Sinusoids&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html320" href="https://technick.net/guides/theory/dft/what_frequencies_are"&gt;What frequencies are representable by a geometric sequence?&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html321" href="https://technick.net/guides/theory/dft/recovering_continuous_time_"&gt;Recovering a Continuous-Time Signal from its Samples&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html322" href="https://technick.net/guides/theory/dft/method_1_additive"&gt;Method 1: Additive Synthesis&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html323" href="https://technick.net/guides/theory/dft/does_it_work"&gt;Does it Work?&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html324" href="https://technick.net/guides/theory/dft/introduction_digital_filter"&gt;Introduction to Digital Filter Analysis&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html325" href="https://technick.net/guides/theory/dft/motivating_example_overview"&gt;Motivating Example and Overview&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html326" href="https://technick.net/guides/theory/dft/fir_filters"&gt;FIR Filters&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html327" href="https://technick.net/guides/theory/dft/convolution_representation"&gt;Convolution Representation&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html328" href="https://technick.net/guides/theory/dft/finiteness"&gt;Finiteness&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html329" href="https://technick.net/guides/theory/dft/causal_fir_filters"&gt;Causal FIR Filters&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html330" href="https://technick.net/guides/theory/dft/transfer_function"&gt;Transfer Function&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html331" href="https://technick.net/guides/theory/dft/order"&gt;Order&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html332" href="https://technick.net/guides/theory/dft/biquad_section"&gt;The BiQuad Section&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html333" href="https://technick.net/guides/theory/dft/digital_filter_theory"&gt;Digital Filter Theory Summary&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html334" href="https://technick.net/guides/theory/dft/linearity_time_invariance"&gt;Linearity and Time-Invariance&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html335" href="https://technick.net/guides/theory/dft/difference_equation"&gt;Difference Equation&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html336" href="https://technick.net/guides/theory/dft/convolution_representation_"&gt;Convolution Representation of LTI Filters&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html337" href="https://technick.net/guides/theory/dft/frequency_response"&gt;Frequency Response&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html338" href="https://technick.net/guides/theory/dft/phase_delay_group"&gt;Phase Delay and Group Delay&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html339" href="https://technick.net/guides/theory/dft/bibliography"&gt;Bibliography&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html340" href="https://technick.net/guides/theory/dft/dft_index"&gt;Index&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html341" href="https://technick.net/guides/theory/dft/about_this_document"&gt;About this document &amp;hellip;&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;!--End of Table of Child-Links--&gt;&lt;/p&gt;&#10;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/preface"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Network Switching Tutorial</title><link>https://technick.net/guides/hardware/net/switching/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/hardware/net/switching/</guid><description>&lt;p&gt;&lt;a name="siunitsmain"&gt;&lt;/a&gt; &lt;hr /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;Switches are great, they add network capacity and speed, but they are not a cure-all. How can you tell if your network will benefit from switching? And how do you add switches to your network design for the most benefit? This tutorial is written to answer these questions. Along the way we&amp;rsquo;ll describe how switches work, and how they both harm and benefit your networking strategy. And we¹ll discuss different network types, so you can profile your network and gauge the potential benefit of switching for your environment.&lt;/p&gt;</description></item><item><title>00. Table Of Content</title><link>https://technick.net/guides/theory/dft/r320/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/r320/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/preface"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;Table Of Content&lt;/h3&gt;&lt;p&gt;&lt;!--Table of Child-Links--&gt;&lt;a name="CHILD_LINKS"&gt;&lt;/a&gt;&lt;ul&gt;&#10;&lt;li&gt;&lt;a name="tex2html128" href="https://technick.net/guides/theory/dft/preface"&gt;Preface&lt;/a&gt;&lt;ul&gt;&#10;&lt;li&gt;&lt;a name="tex2html129" href="https://technick.net/guides/theory/dft/outline"&gt;Outline&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html130" href="https://technick.net/guides/theory/dft/introduction_dft"&gt;Introduction to the DFT&lt;/a&gt;&lt;ul&gt;&#10;&lt;li&gt;&lt;a name="tex2html131" href="https://technick.net/guides/theory/dft/dft"&gt;The DFT&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html132" href="https://technick.net/guides/theory/dft/mathematics_dft"&gt;Mathematics of the DFT&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html133" href="https://technick.net/guides/theory/dft/dft_math_outline"&gt;DFT Math Outline&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html134" href="https://technick.net/guides/theory/dft/introduction_complex_number"&gt;Introduction to Complex Numbers&lt;/a&gt;&lt;ul&gt;&#10;&lt;li&gt;&lt;a name="tex2html135" href="https://technick.net/guides/theory/dft/factoring_polynomial_with"&gt;Factoring a Polynomial with Real Roots&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html136" href="https://technick.net/guides/theory/dft/quadratic_formula"&gt;The Quadratic Formula&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html137" href="https://technick.net/guides/theory/dft/complex_roots"&gt;Complex Roots&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html138" href="https://technick.net/guides/theory/dft/fundamental_theorem_algebra"&gt;The Fundamental Theorem of Algebra&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html139" href="https://technick.net/guides/theory/dft/complex_numbers"&gt;Complex Numbers&lt;/a&gt;&lt;ul&gt;&#10;&lt;li&gt;&lt;a name="tex2html140" href="https://technick.net/guides/theory/dft/complex_plane"&gt;The Complex Plane&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html141" href="https://technick.net/guides/theory/dft/more_notation_terminology"&gt;More Notation and Terminology&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html142" href="https://technick.net/guides/theory/dft/elementary_relationships"&gt;Elementary Relationships&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html143" href="https://technick.net/guides/theory/dft/euler_s_formula"&gt;Euler's Formula&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html144" href="https://technick.net/guides/theory/dft/de_moivre_s_theorem"&gt;De Moivre's Theorem&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html145" href="https://technick.net/guides/theory/dft/numerical_tools_matlab"&gt;Numerical Tools in Matlab&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html146" href="https://technick.net/guides/theory/dft/numerical_tools_mathematica"&gt;Numerical Tools in Mathematica&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html147" href="https://technick.net/guides/theory/dft/proof_euler_s_identity"&gt;Proof of Euler's Identity&lt;/a&gt;&lt;ul&gt;&#10;&lt;li&gt;&lt;a name="tex2html148" href="https://technick.net/guides/theory/dft/euler_s_theorem"&gt;Euler's Theorem&lt;/a&gt;&lt;ul&gt;&#10;&lt;li&gt;&lt;a name="tex2html149" href="https://technick.net/guides/theory/dft/positive_integer_exponents"&gt;Positive Integer Exponents&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html150" href="https://technick.net/guides/theory/dft/properties_exponents"&gt;Properties of Exponents&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html151" href="https://technick.net/guides/theory/dft/exponent_zero"&gt;The Exponent Zero&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html152" href="https://technick.net/guides/theory/dft/negative_exponents"&gt;Negative Exponents&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html153" href="https://technick.net/guides/theory/dft/rational_exponents"&gt;Rational Exponents&lt;/a&gt;&lt;ul&gt;&#10;&lt;li&gt;&lt;a name="tex2html154" href="https://technick.net/guides/theory/dft/special_case_mth"&gt;Special Case: The Mth Roots of Unity&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html155" href="https://technick.net/guides/theory/dft/real_exponents"&gt;Real Exponents&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html156" href="https://technick.net/guides/theory/dft/first_look_at"&gt;A First Look at Taylor Series&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html157" href="https://technick.net/guides/theory/dft/imaginary_exponents"&gt;Imaginary Exponents&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html158" href="https://technick.net/guides/theory/dft/derivatives_f_x_a_x"&gt;Derivatives of f(x)=a^x&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html159" href="https://technick.net/guides/theory/dft/back_e"&gt;Back to &lt;i&gt;e&lt;/i&gt;&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html160" href="https://technick.net/guides/theory/dft/sidebar_mathematica"&gt;Sidebar on Mathematica&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html161" href="https://technick.net/guides/theory/dft/back_e_j_theta"&gt;Back to e^(j theta)&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html162" href="https://technick.net/guides/theory/dft/informal_derivation_taylor"&gt;Informal Derivation of &lt;i&gt;Taylor Series Expansion&lt;/i&gt;&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html163" href="https://technick.net/guides/theory/dft/derivation_taylor_series"&gt;Derivation of Taylor Series Expansion with Remainder&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html164" href="https://technick.net/guides/theory/dft/formal_statement_taylor_s"&gt;Formal Statement of Taylor's Theorem&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html165" href="https://technick.net/guides/theory/dft/weierstrass_polynomial_appr"&gt;The Weierstrass (Polynomial) Approximation Theorem&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html166" href="https://technick.net/guides/theory/dft/further_notes_differentiabi"&gt;Further Notes on Differentiability of Audio Signals&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html167" href="https://technick.net/guides/theory/dft/logarithms_decibels_number"&gt;Logarithms, Decibels, and Number Systems&lt;/a&gt;&lt;ul&gt;&#10;&lt;li&gt;&lt;a name="tex2html168" href="https://technick.net/guides/theory/dft/logarithms"&gt;Logarithms&lt;/a&gt;&lt;ul&gt;&#10;&lt;li&gt;&lt;a name="tex2html169" href="https://technick.net/guides/theory/dft/changing_base"&gt;Changing the Base&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html170" href="https://technick.net/guides/theory/dft/logarithms_negative_imagina"&gt;Logarithms of Negative and Imaginary Numbers&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html171" href="https://technick.net/guides/theory/dft/decibels"&gt;Decibels&lt;/a&gt;&lt;ul&gt;&#10;&lt;li&gt;&lt;a name="tex2html172" href="https://technick.net/guides/theory/dft/properties_db_scales"&gt;Properties of DB Scales&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html173" href="https://technick.net/guides/theory/dft/specific_db_scales"&gt;Specific DB Scales&lt;/a&gt;&lt;ul&gt;&#10;&lt;li&gt;&lt;a name="tex2html174" href="https://technick.net/guides/theory/dft/dbm_scale"&gt;DBm Scale&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html175" href="https://technick.net/guides/theory/dft/dbv_scale"&gt;DBV Scale&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html176" href="https://technick.net/guides/theory/dft/db_spl"&gt;DB SPL&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html177" href="https://technick.net/guides/theory/dft/db_display"&gt;DB for Display&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html178" href="https://technick.net/guides/theory/dft/dynamic_range"&gt;Dynamic Range&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html179" href="https://technick.net/guides/theory/dft/linear_number_systems"&gt;Linear Number Systems for Digital Audio&lt;/a&gt;&lt;ul&gt;&#10;&lt;li&gt;&lt;a name="tex2html180" href="https://technick.net/guides/theory/dft/pulse_code_modulation"&gt;Pulse Code Modulation (PCM)&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html181" href="https://technick.net/guides/theory/dft/binary_integer_fixed_point"&gt;Binary Integer Fixed-Point Numbers&lt;/a&gt;&lt;ul&gt;&#10;&lt;li&gt;&lt;a name="tex2html182" href="https://technick.net/guides/theory/dft/one_s_complement_fixed_poin"&gt;One's Complement Fixed-Point Format&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html183" href="https://technick.net/guides/theory/dft/two_s_complement_fixed_poin"&gt;Two's Complement Fixed-Point Format&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html184" href="https://technick.net/guides/theory/dft/general_formula_two_s_compl"&gt;General Formula for Two's-Complement, Integer Fixed-Point Numbers&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html185" href="https://technick.net/guides/theory/dft/little_endian_formula"&gt;''Little Endian'' Formula for Two's-Complement,&#10;Integer Fixed-Point Numbers&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html186" href="https://technick.net/guides/theory/dft/fractional_binary_fixed_poi"&gt;Fractional Binary Fixed-Point Numbers&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html187" href="https://technick.net/guides/theory/dft/how_many_bits"&gt;How Many Bits are Enough for Digital Audio?&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html188" href="https://technick.net/guides/theory/dft/when_do_we"&gt;When Do We Have to Swap Bytes When Changing Computers?&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html189" href="https://technick.net/guides/theory/dft/logarithmic_number_systems"&gt;Logarithmic Number Systems for Digital Audio&lt;/a&gt;&lt;ul&gt;&#10;&lt;li&gt;&lt;a name="tex2html190" href="https://technick.net/guides/theory/dft/floating_point_numbers"&gt;Floating-Point Numbers&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html191" href="https://technick.net/guides/theory/dft/logarithmic_fixed_point_num"&gt;Logarithmic Fixed-Point Numbers&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html192" href="https://technick.net/guides/theory/dft/law_companding"&gt;&lt;img width="14" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img5.png" alt="$\" u="u" /&gt;-Law Companding&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html193" href="https://technick.net/guides/theory/dft/appendix_a_round_off"&gt;Appendix A: Round-Off Error Variance&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html194" href="https://technick.net/guides/theory/dft/appendix_b_electrical"&gt;Appendix B: Electrical Engineering 101&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html195" href="https://technick.net/guides/theory/dft/sinusoids_exponentials"&gt;Sinusoids and Exponentials&lt;/a&gt;&lt;ul&gt;&#10;&lt;li&gt;&lt;a name="tex2html196" href="https://technick.net/guides/theory/dft/sinusoids"&gt;Sinusoids&lt;/a&gt;&lt;ul&gt;&#10;&lt;li&gt;&lt;a name="tex2html197" href="https://technick.net/guides/theory/dft/example_sinusoids"&gt;Example Sinusoids&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html198" href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;Why Sinusoids are Important&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html199" href="https://technick.net/guides/theory/dft/in_phase_quadrature_sinusoi"&gt;In-Phase and Quadrature Sinusoidal Components&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html200" href="https://technick.net/guides/theory/dft/sinusoids_at_same"&gt;Sinusoids at the Same Frequency&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html201" href="https://technick.net/guides/theory/dft/constructive_destructive_in"&gt;Constructive and Destructive Interference of Sinusoids&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html202" href="https://technick.net/guides/theory/dft/exponentials"&gt;Exponentials&lt;/a&gt;&lt;ul&gt;&#10;&lt;li&gt;&lt;a name="tex2html203" href="https://technick.net/guides/theory/dft/why_exponentials_are"&gt;Why Exponentials are Important&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html204" href="https://technick.net/guides/theory/dft/audio_decay_time"&gt;Audio Decay Time (&lt;img width="23" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img8.png" alt="$t_{60}$" /&gt;)&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html205" href="https://technick.net/guides/theory/dft/complex_sinusoids"&gt;Complex Sinusoids&lt;/a&gt;&lt;ul&gt;&#10;&lt;li&gt;&lt;a name="tex2html206" href="https://technick.net/guides/theory/dft/circular_motion"&gt;Circular Motion&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html207" href="https://technick.net/guides/theory/dft/projection_circular_motion"&gt;Projection of Circular Motion&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html208" href="https://technick.net/guides/theory/dft/positive_negative_frequenci"&gt;Positive and Negative Frequencies&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html209" href="https://technick.net/guides/theory/dft/analytic_signal_hilbert"&gt;The Analytic Signal and Hilbert Transform Filters&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html210" href="https://technick.net/guides/theory/dft/generalized_complex_sinusoi"&gt;Generalized Complex Sinusoids&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html211" href="https://technick.net/guides/theory/dft/sampled_sinusoids"&gt;Sampled Sinusoids&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html212" href="https://technick.net/guides/theory/dft/powers"&gt;Powers of &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt;&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html213" href="https://technick.net/guides/theory/dft/why_generalized_complex"&gt;Why (Generalized) Complex Sinusoids are Important&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html214" href="https://technick.net/guides/theory/dft/comparing_analog_digital"&gt;Comparing Analog and Digital Complex Planes&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html215" href="https://technick.net/guides/theory/dft/mathematica_selected_plots"&gt;Mathematica for Selected Plots&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html216" href="https://technick.net/guides/theory/dft/acknowledgement"&gt;Acknowledgement&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html217" href="https://technick.net/guides/theory/dft/geometric_signal_theory"&gt;Geometric Signal Theory&lt;/a&gt;&lt;ul&gt;&#10;&lt;li&gt;&lt;a name="tex2html218" href="https://technick.net/guides/theory/dft/dft"&gt;The DFT&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html219" href="https://technick.net/guides/theory/dft/signals_vectors"&gt;Signals as Vectors&lt;/a&gt;&lt;ul&gt;&#10;&lt;li&gt;&lt;a name="tex2html220" href="https://technick.net/guides/theory/dft/example_vector_view"&gt;An Example Vector View: &lt;img width="48" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img19.png" alt="$N=2$" /&gt;&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html221" href="https://technick.net/guides/theory/dft/vector_addition"&gt;Vector Addition&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html222" href="https://technick.net/guides/theory/dft/vector_subtraction"&gt;Vector Subtraction&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html223" href="https://technick.net/guides/theory/dft/signal_metrics"&gt;Signal Metrics&lt;/a&gt;&lt;ul&gt;&#10;&lt;li&gt;&lt;a name="tex2html224" href="https://technick.net/guides/theory/dft/other_norms"&gt;Other Norms&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html225" href="https://technick.net/guides/theory/dft/inner_product"&gt;The Inner Product&lt;/a&gt;&lt;ul&gt;&#10;&lt;li&gt;&lt;a name="tex2html226" href="https://technick.net/guides/theory/dft/linearity_inner_product"&gt;Linearity of the Inner Product&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html227" href="https://technick.net/guides/theory/dft/norm_induced_inner"&gt;Norm Induced by the Inner Product&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html228" href="https://technick.net/guides/theory/dft/cauchy_schwarz_inequality"&gt;Cauchy-Schwarz Inequality&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html229" href="https://technick.net/guides/theory/dft/triangle_inequality"&gt;Triangle Inequality&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html230" href="https://technick.net/guides/theory/dft/triangle_difference_inequal"&gt;Triangle Difference Inequality&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html231" href="https://technick.net/guides/theory/dft/vector_cosine"&gt;Vector Cosine&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html232" href="https://technick.net/guides/theory/dft/orthogonality"&gt;Orthogonality&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html233" href="https://technick.net/guides/theory/dft/pythagorean_theorem_n_space"&gt;The Pythagorean Theorem in N-Space&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html234" href="https://technick.net/guides/theory/dft/projection"&gt;Projection&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html235" href="https://technick.net/guides/theory/dft/signal_reconstruction_proje"&gt;Signal Reconstruction from Projections&lt;/a&gt;&lt;ul&gt;&#10;&lt;li&gt;&lt;a name="tex2html236" href="https://technick.net/guides/theory/dft/example_changing_coordinate"&gt;An Example of Changing Coordinates in 2D&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html237" href="https://technick.net/guides/theory/dft/general_conditions"&gt;General Conditions&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html238" href="https://technick.net/guides/theory/dft/gram_schmidt_orthogonalizat"&gt;Gram-Schmidt Orthogonalization&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html239" href="https://technick.net/guides/theory/dft/appendix_matlab_examples"&gt;Appendix: Matlab Examples&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html240" href="https://technick.net/guides/theory/dft/discrete_fourier_transform"&gt;The Discrete Fourier Transform (DFT) Derived&lt;/a&gt;&lt;ul&gt;&#10;&lt;li&gt;&lt;a name="tex2html241" href="https://technick.net/guides/theory/dft/dft_derived"&gt;The DFT Derived&lt;/a&gt;&lt;ul&gt;&#10;&lt;li&gt;&lt;a name="tex2html242" href="https://technick.net/guides/theory/dft/geometric_series"&gt;Geometric Series&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html243" href="https://technick.net/guides/theory/dft/orthogonality_sinusoids"&gt;Orthogonality of Sinusoids&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html244" href="https://technick.net/guides/theory/dft/orthogonality_dft_sinusoids"&gt;Orthogonality of the DFT Sinusoids&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html245" href="https://technick.net/guides/theory/dft/norm_dft_sinusoids"&gt;Norm of the DFT Sinusoids&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html246" href="https://technick.net/guides/theory/dft/orthonormal_sinusoidal_set"&gt;An Orthonormal Sinusoidal Set&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html247" href="https://technick.net/guides/theory/dft/discrete_fourier_transform"&gt;The Discrete Fourier Transform (DFT)&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html248" href="https://technick.net/guides/theory/dft/frequencies_cracks"&gt;Frequencies in the ''Cracks''&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html249" href="https://technick.net/guides/theory/dft/normalized_dft"&gt;Normalized DFT&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html250" href="https://technick.net/guides/theory/dft/length_2_dft"&gt;The Length 2 DFT&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html251" href="https://technick.net/guides/theory/dft/matrix_formulation_dft"&gt;Matrix Formulation of the DFT&lt;/a&gt;&lt;ul&gt;&#10;&lt;li&gt;&lt;a name="tex2html252" href="https://technick.net/guides/theory/dft/matrices"&gt;Matrices&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html253" href="https://technick.net/guides/theory/dft/matrix_multiplication"&gt;Matrix Multiplication&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html254" href="https://technick.net/guides/theory/dft/dft_matrix"&gt;The DFT Matrix&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html255" href="https://technick.net/guides/theory/dft/matlab_examples"&gt;Matlab Examples&lt;/a&gt;&lt;ul&gt;&#10;&lt;li&gt;&lt;a name="tex2html256" href="https://technick.net/guides/theory/dft/figure_7_2"&gt;Figure&amp;nbsp;7.2&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html257" href="https://technick.net/guides/theory/dft/figure_7_3"&gt;Figure&amp;nbsp;7.3&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html258" href="https://technick.net/guides/theory/dft/dft_matrix"&gt;DFT Matrix&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html259" href="https://technick.net/guides/theory/dft/fourier_theorems_dft"&gt;Fourier Theorems for the DFT&lt;/a&gt;&lt;ul&gt;&#10;&lt;li&gt;&lt;a name="tex2html260" href="https://technick.net/guides/theory/dft/dft_its_inverse"&gt;The DFT and its Inverse&lt;/a&gt;&lt;ul&gt;&#10;&lt;li&gt;&lt;a name="tex2html261" href="https://technick.net/guides/theory/dft/notation_terminology"&gt;Notation and Terminology&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html262" href="https://technick.net/guides/theory/dft/modulo_indexing_periodic"&gt;Modulo Indexing, Periodic Extension&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html263" href="https://technick.net/guides/theory/dft/signal_operators"&gt;Signal Operators&lt;/a&gt;&lt;ul&gt;&#10;&lt;li&gt;&lt;a name="tex2html264" href="https://technick.net/guides/theory/dft/flip_operator"&gt;Flip Operator&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html265" href="https://technick.net/guides/theory/dft/shift_operator"&gt;Shift Operator&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html266" href="https://technick.net/guides/theory/dft/convolution"&gt;Convolution&lt;/a&gt;&lt;ul&gt;&#10;&lt;li&gt;&lt;a name="tex2html267" href="https://technick.net/guides/theory/dft/graphical_convolution"&gt;Graphical Convolution&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html268" href="https://technick.net/guides/theory/dft/polynomial_multiplication"&gt;Polynomial Multiplication&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html269" href="https://technick.net/guides/theory/dft/multiplication_decimal_numb"&gt;Multiplication of Decimal Numbers&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html270" href="https://technick.net/guides/theory/dft/correlation"&gt;Correlation&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html271" href="https://technick.net/guides/theory/dft/stretch_operator"&gt;Stretch Operator&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html272" href="https://technick.net/guides/theory/dft/zero_padding"&gt;Zero Padding&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html273" href="https://technick.net/guides/theory/dft/repeat_operator"&gt;Repeat Operator&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html274" href="https://technick.net/guides/theory/dft/decimation_operator"&gt;Decimation Operator&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html275" href="https://technick.net/guides/theory/dft/alias_operator"&gt;Alias Operator&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html276" href="https://technick.net/guides/theory/dft/even_odd_functions"&gt;Even and Odd Functions&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html277" href="https://technick.net/guides/theory/dft/fourier_theorems"&gt;The Fourier Theorems&lt;/a&gt;&lt;ul&gt;&#10;&lt;li&gt;&lt;a name="tex2html278" href="https://technick.net/guides/theory/dft/linearity"&gt;Linearity&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html279" href="https://technick.net/guides/theory/dft/conjugation_reversal"&gt;Conjugation and Reversal&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html280" href="https://technick.net/guides/theory/dft/symmetry"&gt;Symmetry&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html281" href="https://technick.net/guides/theory/dft/shift_theorem"&gt;Shift Theorem&lt;/a&gt;&lt;ul&gt;&#10;&lt;li&gt;&lt;a name="tex2html282" href="https://technick.net/guides/theory/dft/linear_phase_terms"&gt;Linear Phase Terms&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html283" href="https://technick.net/guides/theory/dft/application_shift_theorem"&gt;Application of the Shift Theorem to FFT Windows&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html284" href="https://technick.net/guides/theory/dft/convolution_theorem"&gt;Convolution Theorem&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html285" href="https://technick.net/guides/theory/dft/dual_convolution_theorem"&gt;Dual of the Convolution Theorem&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html286" href="https://technick.net/guides/theory/dft/correlation_theorem"&gt;Correlation Theorem&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html287" href="https://technick.net/guides/theory/dft/power_theorem"&gt;Power Theorem&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html288" href="https://technick.net/guides/theory/dft/rayleigh_energy_theorem"&gt;Rayleigh Energy Theorem (Parseval's Theorem)&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html289" href="https://technick.net/guides/theory/dft/stretch_theorem_repeat"&gt;Stretch Theorem (Repeat Theorem)&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html290" href="https://technick.net/guides/theory/dft/decimation_theorem_aliasing"&gt;Decimation Theorem (Aliasing Theorem)&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html291" href="https://technick.net/guides/theory/dft/zero_padding_theorem"&gt;Zero Padding Theorem&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html292" href="https://technick.net/guides/theory/dft/bandlimited_interpolation_t"&gt;Bandlimited Interpolation in Time&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html293" href="https://technick.net/guides/theory/dft/conclusions"&gt;Conclusions&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html294" href="https://technick.net/guides/theory/dft/acknowledgement"&gt;Acknowledgement&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html295" href="https://technick.net/guides/theory/dft/appendix_a_linear"&gt;Appendix A: Linear Time-Invariant Filters and Convolution&lt;/a&gt;&lt;ul&gt;&#10;&lt;li&gt;&lt;a name="tex2html296" href="https://technick.net/guides/theory/dft/lti_filters_convolution"&gt;LTI Filters and the Convolution Theorem&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html297" href="https://technick.net/guides/theory/dft/appendix_b_introductory"&gt;Appendix B: Introductory Statistical Signal Processing&lt;/a&gt;&lt;ul&gt;&#10;&lt;li&gt;&lt;a name="tex2html298" href="https://technick.net/guides/theory/dft/cross_correlation"&gt;Cross-Correlation&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html299" href="https://technick.net/guides/theory/dft/applications_cross_correlat"&gt;Applications of Cross-Correlation&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html300" href="https://technick.net/guides/theory/dft/autocorrelation"&gt;Autocorrelation&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html301" href="https://technick.net/guides/theory/dft/coherence"&gt;Coherence&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html302" href="https://technick.net/guides/theory/dft/appendix_c_mathematica_matl"&gt;Appendix C: Mathematica/Matlab Examples&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html303" href="https://technick.net/guides/theory/dft/appendix_d_similarity"&gt;Appendix D: The Similarity Theorem&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html304" href="https://technick.net/guides/theory/dft/example_applications_dft"&gt;Example Applications of the DFT&lt;/a&gt;&lt;ul&gt;&#10;&lt;li&gt;&lt;a name="tex2html305" href="https://technick.net/guides/theory/dft/spectrum_analysis_sinusoid"&gt;Spectrum Analysis of a Sinusoid: Windowing, Zero-Padding, and the FFT&lt;/a&gt;&lt;ul&gt;&#10;&lt;li&gt;&lt;a name="tex2html306" href="https://technick.net/guides/theory/dft/example_1_fft"&gt;Example 1: FFT of a Simple Sinusoid&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html307" href="https://technick.net/guides/theory/dft/example_2_fft"&gt;Example 2: FFT of a Not-So-Simple Sinusoid&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html308" href="https://technick.net/guides/theory/dft/example_3_fft"&gt;Example 3: FFT of a Zero-Padded Sinusoid&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html309" href="https://technick.net/guides/theory/dft/example_4_blackman"&gt;Example 4: Blackman Window&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html310" href="https://technick.net/guides/theory/dft/example_5_use"&gt;Example 5: Use of the Blackman Window&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html311" href="https://technick.net/guides/theory/dft/example_6_hanning_windowed"&gt;Example 6: Hanning-Windowed Complex Sinusoid&lt;/a&gt;&lt;ul&gt;&#10;&lt;li&gt;&lt;a name="tex2html312" href="https://technick.net/guides/theory/dft/spectral_phase"&gt;Spectral Phase&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html313" href="https://technick.net/guides/theory/dft/basic_tutorial_sampling"&gt;A Basic Tutorial on Sampling Theory&lt;/a&gt;&lt;ul&gt;&#10;&lt;li&gt;&lt;a name="tex2html314" href="https://technick.net/guides/theory/dft/introduction"&gt;Introduction&lt;/a&gt;&lt;ul&gt;&#10;&lt;li&gt;&lt;a name="tex2html315" href="https://technick.net/guides/theory/dft/reconstruction_samples_pict"&gt;Reconstruction from Samples--Pictorial Version&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html316" href="https://technick.net/guides/theory/dft/reconstruction_samples_the"&gt;Reconstruction from Samples--The Math&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html317" href="https://technick.net/guides/theory/dft/aliasing_sampled_continuous"&gt;Aliasing of Sampled Continuous-Time Signals&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html318" href="https://technick.net/guides/theory/dft/shannon_s_sampling_theorem"&gt;Shannon's Sampling Theorem&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html319" href="https://technick.net/guides/theory/dft/figuring_out_sampling"&gt;Figuring Out Sampling Theory by Playing Around with Complex Sinusoids&lt;/a&gt;&lt;ul&gt;&#10;&lt;li&gt;&lt;a name="tex2html320" href="https://technick.net/guides/theory/dft/what_frequencies_are"&gt;What frequencies are representable by a geometric sequence?&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html321" href="https://technick.net/guides/theory/dft/recovering_continuous_time_"&gt;Recovering a Continuous-Time Signal from its Samples&lt;/a&gt;&lt;ul&gt;&#10;&lt;li&gt;&lt;a name="tex2html322" href="https://technick.net/guides/theory/dft/method_1_additive"&gt;Method 1: Additive Synthesis&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html323" href="https://technick.net/guides/theory/dft/does_it_work"&gt;Does it Work?&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html324" href="https://technick.net/guides/theory/dft/introduction_digital_filter"&gt;Introduction to Digital Filter Analysis&lt;/a&gt;&lt;ul&gt;&#10;&lt;li&gt;&lt;a name="tex2html325" href="https://technick.net/guides/theory/dft/motivating_example_overview"&gt;Motivating Example and Overview&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html326" href="https://technick.net/guides/theory/dft/fir_filters"&gt;FIR Filters&lt;/a&gt;&lt;ul&gt;&#10;&lt;li&gt;&lt;a name="tex2html327" href="https://technick.net/guides/theory/dft/convolution_representation"&gt;Convolution Representation&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html328" href="https://technick.net/guides/theory/dft/finiteness"&gt;Finiteness&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html329" href="https://technick.net/guides/theory/dft/causal_fir_filters"&gt;Causal FIR Filters&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html330" href="https://technick.net/guides/theory/dft/transfer_function"&gt;Transfer Function&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html331" href="https://technick.net/guides/theory/dft/order"&gt;Order&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html332" href="https://technick.net/guides/theory/dft/biquad_section"&gt;The BiQuad Section&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html333" href="https://technick.net/guides/theory/dft/digital_filter_theory"&gt;Digital Filter Theory Summary&lt;/a&gt;&lt;ul&gt;&#10;&lt;li&gt;&lt;a name="tex2html334" href="https://technick.net/guides/theory/dft/linearity_time_invariance"&gt;Linearity and Time-Invariance&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html335" href="https://technick.net/guides/theory/dft/difference_equation"&gt;Difference Equation&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html336" href="https://technick.net/guides/theory/dft/convolution_representation_"&gt;Convolution Representation of LTI Filters&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html337" href="https://technick.net/guides/theory/dft/frequency_response"&gt;Frequency Response&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html338" href="https://technick.net/guides/theory/dft/phase_delay_group"&gt;Phase Delay and Group Delay&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html339" href="https://technick.net/guides/theory/dft/bibliography"&gt;Bibliography&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html340" href="https://technick.net/guides/theory/dft/dft_index"&gt;Index&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a name="tex2html341" href="https://technick.net/guides/theory/dft/about_this_document"&gt;About this document ...&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;!--End of Table of Child-Links--&gt;&#10;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/preface"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Index</title><link>https://technick.net/guides/theory/dft/dft_index/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/dft_index/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/bibliography"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/about_this_document"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION001400000000000000000"&gt;Index&lt;/a&gt;&lt;/h2&gt;&lt;dl compact="compact"&gt;&lt;dt&gt;&lt;strong&gt;20 &lt;a href="https://technick.net/guides/theory/dft/decibels"&gt;dB&lt;/a&gt; boost&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/properties_db_scales#5370"&gt;Properties of DB Scales&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;3 dB boost&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/properties_db_scales#5372"&gt;Properties of DB Scales&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/convolution"&gt;convolution&lt;/a&gt;&lt;/b&gt;&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/convolution_representation_#18803"&gt;Convolution Representation of LTI&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;&lt;a href="https://technick.net/guides/theory/dft/decimation_theorem_aliasing"&gt;Aliasing&lt;/a&gt;&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/alias_operator#13858"&gt;Alias Operator&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;aliasing operator&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/alias_operator#13871"&gt;Alias Operator&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;&lt;a href="https://technick.net/guides/theory/dft/logarithms"&gt;amplitude&lt;/a&gt; response&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/lti_filters_convolution#14528"&gt;LTI Filters and the&lt;/a&gt; | &lt;a href="https://technick.net/guides/theory/dft/frequency_response#18872"&gt;Frequency Response&lt;/a&gt; | &lt;a href="https://technick.net/guides/theory/dft/frequency_response#18885"&gt;Frequency Response&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;anti-aliasing lowpass filter&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/alias_operator#13916"&gt;Alias Operator&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;antilog&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/logarithms#5317"&gt;Logarithms&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;antilogarithm&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/logarithms#5315"&gt;Logarithms&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;antisymmetric functions&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/even_odd_functions#13930"&gt;Even and Odd Functions&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;average power&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/appendix_a_round_off#5556"&gt;Appendix A: Round-Off Error&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;base&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/logarithms#5313"&gt;Logarithms&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;base &lt;img width="12" height="13" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img76.png" alt="$2$" /&gt; logarithm&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/logarithms#5322"&gt;Logarithms&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;base &lt;img width="20" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img332.png" alt="$10$" /&gt; logarithm&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/logarithms#5323"&gt;Logarithms&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;bel&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/decibels#5345"&gt;Decibels&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;bin number&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/frequencies_cracks#11530"&gt;Frequencies in the ''Cracks''&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;binary&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/binary_integer_fixed_point#5418"&gt;Binary Integer Fixed-Point Numbers&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;binary digits&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/binary_integer_fixed_point#5420"&gt;Binary Integer Fixed-Point Numbers&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;bits&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/binary_integer_fixed_point#5421"&gt;Binary Integer Fixed-Point Numbers&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;canonical with respect to delay&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/order#18721"&gt;Order&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;causal&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/causal_fir_filters#18714"&gt;Causal FIR Filters&lt;/a&gt; | &lt;a href="https://technick.net/guides/theory/dft/difference_equation#18782"&gt;Difference Equation&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;characteristic of the logarithm&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/logarithms#5327"&gt;Logarithms&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;coefficient of projection&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/discrete_fourier_transform#11471"&gt;The Discrete Fourier Transform&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;column-vector&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/matrices#11641"&gt;Matrices&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;comb-filter&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/constructive_destructive_in#6907"&gt;Constructive and Destructive Interference&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;common logarithm&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/logarithms#5319"&gt;Logarithms&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;commutativity of convolution&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/convolution#13671"&gt;Convolution&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;companding&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/dynamic_range#5415"&gt;Dynamic Range&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;complex &lt;a href="https://technick.net/guides/theory/dft/matrices"&gt;matrix&lt;/a&gt;&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/matrices#11609"&gt;Matrices&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;complex matrix transpose&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/matrices#11612"&gt;Matrices&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;convolution&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/convolution#13664"&gt;Convolution&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;convolution operator ''&lt;img width="12" height="13" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1034.png" alt="$\" st="" /&gt;''&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/convolution_representation#18710"&gt;Convolution Representation&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;convolution representation&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/appendix_a_linear#14513"&gt;Appendix A: Linear Time-Invariant&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;&lt;a href="https://technick.net/guides/theory/dft/correlation"&gt;correlation&lt;/a&gt; operator&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/correlation#13710"&gt;Correlation&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;cross-talk&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/frequencies_cracks#11520"&gt;Frequencies in the ''Cracks''&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;cyclic convolution&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/convolution#13670"&gt;Convolution&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;&lt;a href="https://technick.net/guides/theory/dft/decibels"&gt;dB scale&lt;/a&gt;&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/decibels#5355"&gt;Decibels&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;&lt;a href="https://technick.net/guides/theory/dft/decibels"&gt;decibel&lt;/a&gt;&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/decibels#5343"&gt;Decibels&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;decimal numbers&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/binary_integer_fixed_point#5423"&gt;Binary Integer Fixed-Point Numbers&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;&lt;a href="https://technick.net/guides/theory/dft/dft"&gt;DFT&lt;/a&gt; as a &lt;a href="http://www.dsptutor.freeuk.com/dfilt1.php"&gt;digital filter&lt;/a&gt;&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/frequencies_cracks#11496"&gt;Frequencies in the ''Cracks''&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;&lt;a href="https://technick.net/guides/theory/dft/dft_matrix"&gt;DFT matrix&lt;/a&gt;&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/dft_matrix#11857"&gt;The DFT Matrix&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;difference equation&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/difference_equation#18764"&gt;Difference Equation&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;difference equation coefficients&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/difference_equation#18774"&gt;Difference Equation&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;digit&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/binary_integer_fixed_point#5424"&gt;Binary Integer Fixed-Point Numbers&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;digital filter&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/appendix_a_linear#14492"&gt;Appendix A: Linear Time-Invariant&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;&lt;a href="https://technick.net/guides/theory/dft/dft"&gt;Discrete Fourier Transform&lt;/a&gt;&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/dft_its_inverse#13570"&gt;The DFT and its&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;Discrete Fourier Transform (DFT)&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/dft#2536"&gt;The DFT&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;&lt;a href="https://technick.net/guides/theory/dft/dynamic_range"&gt;dynamic range&lt;/a&gt;&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/dynamic_range#5410"&gt;Dynamic Range&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;dynamic range of magnetic tape&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/dynamic_range#5413"&gt;Dynamic Range&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;energy&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/decibels#5349"&gt;Decibels&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;&lt;a href="https://technick.net/guides/theory/dft/proof_euler_s_identity"&gt;Euler's Formula&lt;/a&gt;&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/euler_s_formula#3067"&gt;Euler's Formula&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;&lt;a href="https://technick.net/guides/theory/dft/proof_euler_s_identity"&gt;Euler's Theorem&lt;/a&gt;&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/euler_s_theorem#3937"&gt;Euler's Theorem&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;&lt;a href="https://technick.net/guides/theory/dft/even_odd_functions"&gt;even functions&lt;/a&gt;&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/even_odd_functions#13922"&gt;Even and Odd Functions&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;expected value&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/appendix_a_round_off#5537"&gt;Appendix A: Round-Off Error&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;fast convolution&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/convolution_theorem#14227"&gt;Convolution Theorem&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;filter&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/digital_filter_theory#18738"&gt;Digital Filter Theory Summary&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;filter coefficients&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/difference_equation#18776"&gt;Difference Equation&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;filter delay for amplitude envelopes&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/phase_delay_group#18640"&gt;Phase Delay and Group&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;filter order&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/difference_equation#18784"&gt;Difference Equation&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;filter power response&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/frequency_response#18887"&gt;Frequency Response&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;filter time delay&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/phase_delay_group#18902"&gt;Phase Delay and Group&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;finite-impulse-response filter&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/fir_filters#18695"&gt;FIR Filters&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;FIR filter&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/fir_filters#18696"&gt;FIR Filters&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;&lt;a href="https://technick.net/guides/theory/dft/flip_operator"&gt;flip operator&lt;/a&gt;&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/flip_operator#13614"&gt;Flip Operator&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;Fourier Dual&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/dual_convolution_theorem#14229"&gt;Dual of the Convolution&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;frequency bin&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/frequencies_cracks#11528"&gt;Frequencies in the ''Cracks''&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;frequency response&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/lti_filters_convolution#14517"&gt;LTI Filters and the&lt;/a&gt; | &lt;a href="https://technick.net/guides/theory/dft/frequency_response#18868"&gt;Frequency Response&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;frequency-domain aliasing&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/alias_operator#13860"&gt;Alias Operator&lt;/a&gt; | &lt;a href="https://technick.net/guides/theory/dft/alias_operator#13884"&gt;Alias Operator&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;geometric sequence&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/geometric_series#11401"&gt;Geometric Series&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;&lt;a href="https://technick.net/guides/theory/dft/geometric_series"&gt;geometric series&lt;/a&gt;&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/geometric_series#11403"&gt;Geometric Series&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;group delay&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/phase_delay_group#18907"&gt;Phase Delay and Group&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;Hermitian spectra&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/symmetry#14104"&gt;Symmetry&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;Hermitian symmetry&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/conjugation_reversal#14093"&gt;Conjugation and Reversal&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;Hermitian transpose&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/matrices#11614"&gt;Matrices&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;hex&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/binary_integer_fixed_point#5429"&gt;Binary Integer Fixed-Point Numbers&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;hexadecimal&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/binary_integer_fixed_point#5428"&gt;Binary Integer Fixed-Point Numbers&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;ideal bandlimited interpolation&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/zero_padding_theorem#14381"&gt;Zero Padding Theorem&lt;/a&gt; | &lt;a href="https://technick.net/guides/theory/dft/bandlimited_interpolation_t#14456"&gt;Bandlimited Interpolation in Time&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;ideal lowpass filtering operation in the frequency domain&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/bandlimited_interpolation_t#14454"&gt;Bandlimited Interpolation in Time&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;identity matrix&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/matrix_multiplication#11744"&gt;Matrix Multiplication&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;IDFT&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/dft_its_inverse#13578"&gt;The DFT and its&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;impulse response&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/appendix_a_linear#14511"&gt;Appendix A: Linear Time-Invariant&lt;/a&gt; | &lt;a href="https://technick.net/guides/theory/dft/fir_filters#18698"&gt;FIR Filters&lt;/a&gt; | &lt;a href="https://technick.net/guides/theory/dft/difference_equation#18797"&gt;Difference Equation&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;impulse signal&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/appendix_a_linear#14503"&gt;Appendix A: Linear Time-Invariant&lt;/a&gt; | &lt;a href="https://technick.net/guides/theory/dft/fir_filters#18700"&gt;FIR Filters&lt;/a&gt; | &lt;a href="https://technick.net/guides/theory/dft/difference_equation#18794"&gt;Difference Equation&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;indicator function&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/linear_phase_terms#14199"&gt;Linear Phase Terms&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;Intensity&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/decibels#5347"&gt;Decibels&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;intensity level&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/db_spl#5397"&gt;DB SPL&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;interpolation operator&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/zero_padding_theorem#14390"&gt;Zero Padding Theorem&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;inverse DFT&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/dft#2541"&gt;The DFT&lt;/a&gt; | &lt;a href="https://technick.net/guides/theory/dft/dft_its_inverse#13576"&gt;The DFT and its&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;inverse DFT matrix&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/dft_matrix#11864"&gt;The DFT Matrix&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;irrational number&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/real_exponents#3959"&gt;Real Exponents&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;JND&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/decibels#5368"&gt;Decibels&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;just-noticeable difference&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/decibels#5367"&gt;Decibels&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;lag&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/correlation#13721"&gt;Correlation&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;lagged product&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/correlation#13724"&gt;Correlation&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;length &lt;img width="21" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img201.png" alt="$M$" /&gt; even rectangular windowing operation&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/bandlimited_interpolation_t#14436"&gt;Bandlimited Interpolation in Time&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;linear&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/linearity_time_invariance#18747"&gt;Linearity and Time-Invariance&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;linear filter&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/linearity_time_invariance#18742"&gt;Linearity and Time-Invariance&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;&lt;a href="https://technick.net/guides/theory/dft/linear_phase_terms"&gt;linear phase&lt;/a&gt; FFT windows&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/application_shift_theorem#14203"&gt;Application of the Shift&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;linear phase signal&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/linear_phase_terms#14197"&gt;Linear Phase Terms&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;&lt;a href="https://technick.net/guides/theory/dft/linear_phase_terms"&gt;linear phase term&lt;/a&gt;&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/shift_theorem#14190"&gt;Shift Theorem&lt;/a&gt; | &lt;a href="https://technick.net/guides/theory/dft/linear_phase_terms#14193"&gt;Linear Phase Terms&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;linear transformation&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/matrix_multiplication#11782"&gt;Matrix Multiplication&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;logarithm&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/logarithms#5310"&gt;Logarithms&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;loudness&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/db_spl#5391"&gt;DB SPL&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;LTI filters&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/linearity_time_invariance#18761"&gt;Linearity and Time-Invariance&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;main lobe&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/frequencies_cracks#11507"&gt;Frequencies in the ''Cracks''&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;mantissa&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/logarithms#5329"&gt;Logarithms&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;matrix&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/matrices#11589"&gt;Matrices&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;matrix columns&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/matrices#11596"&gt;Matrices&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;&lt;a href="https://technick.net/guides/theory/dft/matrix_multiplication"&gt;matrix multiplication&lt;/a&gt;&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/matrix_multiplication#11662"&gt;Matrix Multiplication&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;matrix rows&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/matrices#11594"&gt;Matrices&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;matrix transpose&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/matrices#11600"&gt;Matrices&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;mean&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/appendix_a_round_off#5533"&gt;Appendix A: Round-Off Error&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;mean of a random variable&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/appendix_a_round_off#5532"&gt;Appendix A: Round-Off Error&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;mean of a signal&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/appendix_a_round_off#5535"&gt;Appendix A: Round-Off Error&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;mean square&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/appendix_a_round_off#5552"&gt;Appendix A: Round-Off Error&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;modulo&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/modulo_indexing_periodic#13608"&gt;Modulo Indexing, Periodic Extension&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;moments&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/appendix_a_round_off#5543"&gt;Appendix A: Round-Off Error&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;multiplication of large numbers&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/logarithms#5331"&gt;Logarithms&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;multiplying two numbers convolves their digits&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/multiplication_decimal_numb#13706"&gt;Multiplication of Decimal Numbers&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;natural logarithm&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/logarithms#5325"&gt;Logarithms&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;non-commutativity of matrix multiplication&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/matrix_multiplication#11731"&gt;Matrix Multiplication&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;normalized &lt;i&gt;inverse&lt;/i&gt; DFT matrix&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/dft_matrix#11880"&gt;The DFT Matrix&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;&lt;a href="https://technick.net/guides/theory/dft/normalized_dft"&gt;normalized DFT&lt;/a&gt; matrix&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/dft_matrix#11875"&gt;The DFT Matrix&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;normalized DFT &lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;sinusoids&lt;/a&gt;&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/orthonormal_sinusoidal_set#11457"&gt;An Orthonormal Sinusoidal Set&lt;/a&gt; | &lt;a href="https://technick.net/guides/theory/dft/normalized_dft#11532"&gt;Normalized DFT&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;normalized frequency&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/dft_its_inverse#13586"&gt;The DFT and its&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;octal&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/binary_integer_fixed_point#5426"&gt;Binary Integer Fixed-Point Numbers&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;&lt;a href="https://technick.net/guides/theory/dft/even_odd_functions"&gt;odd functions&lt;/a&gt;&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/even_odd_functions#13928"&gt;Even and Odd Functions&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;order&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/order#18718"&gt;Order&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;&lt;a href="https://technick.net/guides/theory/dft/orthogonality"&gt;orthogonal&lt;/a&gt;&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/dft_matrix#11896"&gt;The DFT Matrix&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;&lt;a href="https://technick.net/guides/theory/dft/orthogonality"&gt;orthogonality&lt;/a&gt; of sinusoids&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/orthogonality_sinusoids#11411"&gt;Orthogonality of Sinusoids&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;orthonormal&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/dft_matrix#11889"&gt;The DFT Matrix&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;&lt;a href="https://technick.net/guides/theory/dft/pulse_code_modulation"&gt;PCM&lt;/a&gt;&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/pulse_code_modulation#5417"&gt;Pulse Code Modulation (PCM)&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;periodic&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/modulo_indexing_periodic#13597"&gt;Modulo Indexing, Periodic Extension&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;&lt;a href="https://technick.net/guides/theory/dft/modulo_indexing_periodic"&gt;periodic extension&lt;/a&gt;&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/frequencies_cracks#11522"&gt;Frequencies in the ''Cracks''&lt;/a&gt; | &lt;a href="https://technick.net/guides/theory/dft/modulo_indexing_periodic#13599"&gt;Modulo Indexing, Periodic Extension&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;phase delay&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/phase_delay_group#18900"&gt;Phase Delay and Group&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;phase response&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/lti_filters_convolution#14532"&gt;LTI Filters and the&lt;/a&gt; | &lt;a href="https://technick.net/guides/theory/dft/frequency_response#18874"&gt;Frequency Response&lt;/a&gt; | &lt;a href="https://technick.net/guides/theory/dft/frequency_response#18891"&gt;Frequency Response&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;phase response at zero frequency&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/phase_delay_group#18634"&gt;Phase Delay and Group&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;phon amplitude scale&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/db_spl#5395"&gt;DB SPL&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;polar form&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/rational_exponents#3957"&gt;Rational Exponents&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;&lt;a href="https://technick.net/guides/theory/dft/weierstrass_polynomial_appr"&gt;polynomial approximation&lt;/a&gt;&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/derivation_taylor_series#4015"&gt;Derivation of Taylor Series&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;power&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/decibels#5351"&gt;Decibels&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;pressure&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/decibels#5353"&gt;Decibels&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;primitive &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt;th &lt;a href="https://technick.net/guides/theory/dft/special_case_mth"&gt;root of unity&lt;/a&gt;&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/orthogonality_sinusoids#11424"&gt;Orthogonality of Sinusoids&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;rational&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/rational_exponents#3953"&gt;Rational Exponents&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;real filter&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/difference_equation#18778"&gt;Difference Equation&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;rectangular window&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/frequencies_cracks#11526"&gt;Frequencies in the ''Cracks''&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;rms level&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/appendix_a_round_off#5558"&gt;Appendix A: Round-Off Error&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;roots of unity&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/orthogonality_sinusoids#11413"&gt;Orthogonality of Sinusoids&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;row-vector&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/matrices#11647"&gt;Matrices&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;sample mean&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/appendix_a_round_off#5541"&gt;Appendix A: Round-Off Error&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;sample variance&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/appendix_a_round_off#5554"&gt;Appendix A: Round-Off Error&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;second central moment&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/appendix_a_round_off#5549"&gt;Appendix A: Round-Off Error&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;sensation level&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/db_spl#5399"&gt;DB SPL&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;&lt;a href="https://technick.net/guides/theory/dft/shift_operator"&gt;shift operator&lt;/a&gt;&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/shift_operator#13635"&gt;Shift Operator&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;sidelobes&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/frequencies_cracks#11505"&gt;Frequencies in the ''Cracks''&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;signal&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/digital_filter_theory#18735"&gt;Digital Filter Theory Summary&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;signal dynamic range&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/dynamic_range#5412"&gt;Dynamic Range&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;&lt;a href="https://technick.net/guides/theory/dft/appendix_d_similarity"&gt;similarity theorem&lt;/a&gt;&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/appendix_d_similarity#14606"&gt;Appendix D: The Similarity&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;sinc function&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/frequencies_cracks#11500"&gt;Frequencies in the ''Cracks''&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;skew-Hermitian&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/conjugation_reversal#14096"&gt;Conjugation and Reversal&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;sone amplitude scale&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/db_spl#5393"&gt;DB SPL&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;Sound Pressure Level&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/db_spl#5374"&gt;DB SPL&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;spectral leakage&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/frequencies_cracks#11518"&gt;Frequencies in the ''Cracks''&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;spectrum&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/discrete_fourier_transform#11460"&gt;The Discrete Fourier Transform&lt;/a&gt; | &lt;a href="https://technick.net/guides/theory/dft/dft_its_inverse#13568"&gt;The DFT and its&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;SPL&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/db_spl#5375"&gt;DB SPL&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;square matrix&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/matrices#11598"&gt;Matrices&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;stable&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/difference_equation#18800"&gt;Difference Equation&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;standard deviation&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/appendix_a_round_off#5560"&gt;Appendix A: Round-Off Error&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;Stretch Operator&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/correlation#13725"&gt;no title&lt;/a&gt; | &lt;a href="https://technick.net/guides/theory/dft/stretch_operator#13725"&gt;Stretch Operator&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;symmetric functions&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/even_odd_functions#13924"&gt;Even and Odd Functions&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;&lt;a href="https://technick.net/guides/theory/dft/first_look_at"&gt;Taylor Series Expansion&lt;/a&gt;&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/back_e_j_theta#4004"&gt;no title&lt;/a&gt; | &lt;a href="https://technick.net/guides/theory/dft/informal_derivation_taylor#4004"&gt;Informal Derivation of &lt;i&gt;Taylor&lt;/i&gt;&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;time-domain aliasing&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/alias_operator#13882"&gt;Alias Operator&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;time-invariant&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/linearity_time_invariance#18757"&gt;Linearity and Time-Invariance&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;Toeplitz&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/matrix_multiplication#11786"&gt;Matrix Multiplication&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;transfer function&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/transfer_function#18716"&gt;Transfer Function&lt;/a&gt; | &lt;a href="https://technick.net/guides/theory/dft/convolution_representation_#18815"&gt;Convolution Representation of LTI&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;transform pair&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/notation_terminology#13588"&gt;Notation and Terminology&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;transpose of a &lt;a href="https://technick.net/guides/theory/dft/matrix_multiplication"&gt;matrix product&lt;/a&gt;&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/matrix_multiplication#11733"&gt;Matrix Multiplication&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;unilateral &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt; transform&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/convolution_representation_#18807"&gt;Convolution Representation of LTI&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;unit pulse signal&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/appendix_a_linear#14504"&gt;Appendix A: Linear Time-Invariant&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;unitary&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/dft_matrix#11891"&gt;The DFT Matrix&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;variance&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/appendix_a_round_off#5547"&gt;Appendix A: Round-Off Error&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;window&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/frequencies_cracks#11524"&gt;Frequencies in the ''Cracks''&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;Zero padding&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/zero_padding#13753"&gt;Zero Padding&lt;/a&gt;&lt;dt&gt;&lt;strong&gt;zero phase signal&lt;/strong&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/symmetry#14166"&gt;Symmetry&lt;/a&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dl&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/bibliography"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/about_this_document"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Preface</title><link>https://technick.net/guides/theory/dft/preface/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/preface/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/outline"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00100000000000000000"&gt;Preface&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;This chapter is an outgrowth of my course entitled''Introduction to Digital Signal Processing&#10;and the Discrete Fourier Transform&#10;(DFT)which I have&#10;given at the Center for Computer Research in Music and Acoustics&#10;(CCRMA) every year for the past 16 years. The course was created&#10;primarily as a first course in &lt;a href="http://www.dsptutor.freeuk.com/default.php"&gt;digital signal processing&lt;/a&gt; for entering&#10;Music Ph.D. students. As a result, the only prerequisite is a good&#10;high-school math background. Calculus exposure is desirable, but not&#10;required.&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;hr /&gt;&lt;!--Table of Child-Links--&gt;&lt;a name="CHILD_LINKS"&gt;&lt;strong&gt;Subsections&lt;/strong&gt;&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html354" href="https://technick.net/guides/theory/dft/outline"&gt;Outline&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;!--End of Table of Child-Links--&gt;&#10;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/outline"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Outline</title><link>https://technick.net/guides/theory/dft/outline/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/outline/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/preface"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/introduction_dft"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00110000000000000000"&gt;Outline&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;Below is an overview of the chapters.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;ul&gt;&lt;li&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/introduction_dft"&gt;Introduction to the DFT&lt;/a&gt;&lt;/b&gt; &lt;br /&gt;This chapter introduces the Discrete Fourier Transform (&lt;a href="https://technick.net/guides/theory/dft/dft"&gt;DFT&lt;/a&gt;) and&#10;points out the elements which will be discussed in this reader.&lt;p&gt;&lt;/p&gt;&lt;/li&gt;&lt;li&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/introduction_complex_number"&gt;Introduction to Complex Numbers&lt;/a&gt;&lt;/b&gt; &lt;br /&gt;This chapter provides an introduction to &lt;a href="https://technick.net/guides/theory/dft/introduction_complex_number"&gt;complex numbers&lt;/a&gt;, factoring&#10;polynomials, the &lt;a href="https://technick.net/guides/theory/dft/quadratic_formula"&gt;quadratic formula&lt;/a&gt;, the &lt;a href="https://technick.net/guides/theory/dft/complex_plane"&gt;complex plane&lt;/a&gt;, &lt;a href="https://technick.net/guides/theory/dft/proof_euler_s_identity"&gt;Euler's&#10;formula&lt;/a&gt;, and an overview of numerical facilities for complex numbers&#10;in &lt;a href="http://www.mathworks.com/access/helpdesk/help/techdoc/basics/getstarted.shtml"&gt;Matlab&lt;/a&gt; and &lt;a href="https://technick.net/guides/theory/dft/sidebar_mathematica"&gt;Mathematica&lt;/a&gt;.&lt;p&gt;&lt;/p&gt;&lt;/li&gt;&lt;li&gt;&lt;b&gt;Proof of &lt;a href="https://technick.net/guides/theory/dft/proof_euler_s_identity"&gt;Euler's Identity&lt;/a&gt;&lt;/b&gt; &lt;br /&gt;This chapter for Music 320 outlines the proof of Euler's Identity&#10;which is an important tool for working with complex numbers. It is one of&#10;the critical elements of the DFT definition that we need to understand.&lt;p&gt;&lt;/p&gt;&lt;/li&gt;&lt;li&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/logarithms_decibels_number"&gt;Logarithms, Decibels, and Number Systems&lt;/a&gt;&lt;/b&gt; &lt;br /&gt;This chapter provides an introduction to logarithms (real and complex),&lt;a href="https://technick.net/guides/theory/dft/decibels"&gt;decibels&lt;/a&gt;, and number systems such as binary integer &lt;a href="https://technick.net/guides/theory/dft/binary_integer_fixed_point"&gt;fixed-point&lt;/a&gt;, fractional&#10;fixed-point, &lt;a href="https://technick.net/guides/theory/dft/one_s_complement_fixed_poin"&gt;one's complement&lt;/a&gt;, two's complement, &lt;a href="https://technick.net/guides/theory/dft/logarithmic_fixed_point_num"&gt;logarithmic fixed-point&lt;/a&gt;,&lt;img width="14" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img5.png" alt="$\" u="u" /&gt;-law, and &lt;a href="https://technick.net/guides/theory/dft/floating_point_numbers"&gt;floating-point number&lt;/a&gt; formats.&lt;p&gt;&lt;/p&gt;&lt;/li&gt;&lt;li&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/sinusoids_exponentials"&gt;Sinusoids and Exponentials&lt;/a&gt;&lt;/b&gt; &lt;br /&gt;This chapter provides an introduction to &lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;sinusoids&lt;/a&gt;, &lt;a href="https://technick.net/guides/theory/dft/exponentials"&gt;exponentials&lt;/a&gt;, complex&#10;sinusoids, &lt;img width="23" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img8.png" alt="$t_{60}$" /&gt;, in-phase and &lt;a href="https://technick.net/guides/theory/dft/in_phase_quadrature_sinusoi"&gt;quadrature&lt;/a&gt; sinusoidal components, the&lt;a href="https://technick.net/guides/theory/dft/analytic_signal_hilbert"&gt;analytic signal&lt;/a&gt;, positive and &lt;a href="https://technick.net/guides/theory/dft/positive_negative_frequenci"&gt;negative frequencies&lt;/a&gt;, constructive and&lt;a href="https://technick.net/guides/theory/dft/constructive_destructive_in"&gt;destructive interference&lt;/a&gt;, invariance of sinusoidal frequency in linear&#10;time-invariant systems, circular motion as the vector sum of in-phase and&#10;quadrature sinusoidal motions, sampled sinusoids, generating sampled&#10;sinusoids from powers of &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt;, and plot examples using Mathematica.&lt;p&gt;&lt;/p&gt;&lt;/li&gt;&lt;li&gt;&lt;b&gt;The Discrete Fourier Transform (DFT) Derived&lt;/b&gt; &lt;br /&gt;This chapter derives the Discrete Fourier Transform (DFT) as a projection of&#10;a length &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; signal &lt;img width="30" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img44.png" alt="$x(\" dot="" /&gt; onto the set of &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; sampled complex&#10;sinusoids generated by the &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; &lt;a href="https://technick.net/guides/theory/dft/special_case_mth"&gt;roots of unity&lt;/a&gt;.&lt;p&gt;&lt;/p&gt;&lt;/li&gt;&lt;li&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/fourier_theorems_dft"&gt;Fourier Theorems for the DFT&lt;/a&gt;&lt;/b&gt; &lt;br /&gt;This chapter derives various &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/fourier_theorems"&gt;Fourier theorems&lt;/a&gt;&lt;/i&gt; for the case of the DFT.&#10;Included are symmetry relations, the &lt;a href="https://technick.net/guides/theory/dft/shift_theorem"&gt;shift theorem&lt;/a&gt;, &lt;a href="https://technick.net/guides/theory/dft/convolution_theorem"&gt;convolution theorem&lt;/a&gt;,&lt;a href="https://technick.net/guides/theory/dft/correlation_theorem"&gt;correlation theorem&lt;/a&gt;, &lt;a href="https://technick.net/guides/theory/dft/power_theorem"&gt;power theorem&lt;/a&gt;, and theorems pertaining to interpolation&#10;and downsampling. Applications related to certain theorems are outlined,&#10;including linear time-invariant filtering, sampling rate conversion, and&lt;a href="https://technick.net/guides/theory/dft/appendix_b_introductory"&gt;statistical signal processing&lt;/a&gt;.&lt;p&gt;&lt;/p&gt;&lt;/li&gt;&lt;li&gt;&lt;b&gt;Example Applications of the DFT&lt;/b&gt; &lt;br /&gt;This chapter goes through some practical examples of FFT analysis in&#10;Matlab. The various Fourier theorems provide a ''thinking&#10;vocabulary'' for understanding elements of spectral analysis.&lt;p&gt;&lt;/p&gt;&lt;/li&gt;&lt;li&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/basic_tutorial_sampling"&gt;A Basic Tutorial on Sampling Theory&lt;/a&gt;&lt;/b&gt; &lt;br /&gt;This appendix provides a basic tutorial on sampling theory. &lt;a href="https://technick.net/guides/theory/dft/aliasing_sampled_continuous"&gt;Aliasing&#10;due to sampling&lt;/a&gt; of continuous-time signals is characterized&#10;mathematically. &lt;a href="https://technick.net/guides/theory/dft/shannon_s_sampling_theorem"&gt;Shannon's sampling theorem&lt;/a&gt; is proved. A pictorial&#10;representation of continuous-time signal reconstruction from&#10;discrete-time samples is given.&lt;p&gt;&lt;/p&gt;&lt;/li&gt;&lt;li&gt;&lt;b&gt;Introduction to Digital Filter Theory&lt;/b&gt; &lt;br /&gt;This appendix provides an introduction to the most basic elements of&lt;a href="https://technick.net/guides/theory/dft/introduction_digital_filter"&gt;digital filter theory&lt;/a&gt;. Definitions are given for &lt;i&gt;linearity&lt;/i&gt;,&lt;i&gt;time-invariance&lt;/i&gt; and four basic representations of &lt;a href="http://www.dsptutor.freeuk.com/dfilt1.php"&gt;digital&#10;filters&lt;/a&gt;: the &lt;i&gt;difference equation coefficients, impulse response,&#10;transfer function,&lt;/i&gt; and &lt;i&gt;frequency response&lt;/i&gt;. Next the concepts&#10;of &lt;i&gt;phase delay&lt;/i&gt; and &lt;i&gt;group delay&lt;/i&gt; are defined. This&#10;material is a subset of that in [&lt;a href="https://technick.net/guides/theory/dft/bibliography#JOSFP"&gt;1&lt;/a&gt;].&lt;p&gt;&lt;/p&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/preface"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/introduction_dft"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Introduction to the DFT</title><link>https://technick.net/guides/theory/dft/introduction_dft/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/introduction_dft/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/outline"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00200000000000000000"&gt;Introduction to the DFT&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;This chapter introduces the Discrete Fourier Transform (&lt;a href="https://technick.net/guides/theory/dft/dft"&gt;DFT&lt;/a&gt;)&#10;and points out the elements which will be discussed in the Music 320 Background Reader.&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;hr /&gt;&lt;!--Table of Child-Links--&gt;&lt;a name="CHILD_LINKS"&gt;&lt;strong&gt;Subsections&lt;/strong&gt;&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html377" href="https://technick.net/guides/theory/dft/dft"&gt;The DFT&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html378" href="https://technick.net/guides/theory/dft/mathematics_dft"&gt;Mathematics of the DFT&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html379" href="https://technick.net/guides/theory/dft/dft_math_outline"&gt;DFT Math Outline&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;!--End of Table of Child-Links--&gt;&#10;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/outline"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>The DFT</title><link>https://technick.net/guides/theory/dft/dft/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/dft/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/introduction_dft"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/signals_vectors"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00710000000000000000"&gt;The DFT&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;For a length &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; complex sequence &lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img50.png" alt="$x(n)$" /&gt;, &lt;!-- MATH&#10; $n=0,1,2,\ldots,N-1$&#10; --&gt;&lt;img width="150" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img677.png" alt="$n=0,1,2,\" dots="" /&gt;, the&lt;i&gt;discrete Fourier transform&lt;/i&gt; (&lt;a href="https://technick.net/guides/theory/dft/dft"&gt;DFT&lt;/a&gt;) is defined by &lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;X(\omega_k) \isdef \sum_{n=0}^{N-1}x(n) e^{-j\omega_k t_n} = \sum_{n=0}^{N-1}x(n) e^{-j 2\pi kn/N}, &#10;&#9;\quad k=0,1,2,\ldots N-1&#10;\end{displaymath}&#10; --&gt;&lt;img width="543" height="62" border="0" src="https://technick.net/img/guide_dft/img678.png" alt="\" egin="" isplaymath="" omega="" isdef="" um="" n-1="" x="" n="" e="" omega="" n="" n="0}^{N-1}x(n)" e="" pi="" n="" uad="" dots="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;t_n &amp;\isdef &amp; nT = \mbox{$n$th sampling instant (sec)} \\&#10;\omega_k &amp;\isdef &amp; k\Omega = \mbox{$k$th frequency sample (rad/sec)} \\&#10;T &amp;\isdef &amp; 1/f_s = \mbox{time sampling interval (sec)} \\&#10;\Omega &amp;\isdef &amp; 2\pi f_s/N = \mbox{frequency sampling interval (sec)}&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="403" height="118" border="0" src="https://technick.net/img/guide_dft/img679.png" alt="\" egin="" qnarray="" n="" sdef="" t="\mbox{$n$th" sampling="" stant="" ec="" m="" sdef="" i="" s="" mbox="" frequency="" ampling="" terval="" ec="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;We are now in a position to have a full understanding of the transform &lt;i&gt;kernel&lt;/i&gt;:&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;e^{-j\omega_k t_n} = \cos(\omega_k t_n) - j \sin(\omega_k t_n)&#10;\end{displaymath}&#10; --&gt;&lt;img width="255" height="31" border="0" src="https://technick.net/img/guide_dft/img680.png" alt="\" egin="" isplaymath="" j\omega="" n="" os="" mega="" n="" sin="" mega="" n="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;The kernel consists of samples of a complex &lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;sinusoid&lt;/a&gt; at &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; discrete&#10;frequencies &lt;img width="22" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img681.png" alt="$\" mega="" /&gt; uniformly spaced between &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img38.png" alt="$0$" /&gt; and the &lt;a href="https://technick.net/guides/theory/dft/shannon_s_sampling_theorem"&gt;sampling rate&lt;/a&gt;&lt;!-- MATH&#10; $\omega_s \isdef 2\pi f_s$&#10; --&gt;&lt;img width="74" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img682.png" alt="$\" mega="" s="" sdef="" i="" s="" /&gt;. All that remains is to understand the purpose&#10;and function of the summation over &lt;img width="14" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img51.png" alt="$n$" /&gt; of the pointwise product of &lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img50.png" alt="$x(n)$" /&gt;times each complex sinusoid. We will learn that this can be interpreted as&#10;an &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/inner_product"&gt;inner product&lt;/a&gt;&lt;/i&gt; operation which computes the &lt;i&gt;coefficient of&#10;projection&lt;/i&gt; of the signal &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; onto the complex sinusoid &lt;!-- MATH&#10; $\cos(\omega_k t_n)&#10;+ j \sin(\omega_k t_n)$&#10; --&gt;&lt;img width="164" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img683.png" alt="$\" os="" mega="" n="" sin="" mega="" n="" /&gt;. As such, &lt;img width="49" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img684.png" alt="$X(\" mega="" /&gt;, the DFT at frequency&lt;img width="22" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img681.png" alt="$\" mega="" /&gt;, is a measure of the &lt;a href="https://technick.net/guides/theory/dft/logarithms"&gt;amplitude&lt;/a&gt; and phase of the complex sinusoid&#10;at that frequency which is present in the input signal &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt;. This is the&#10;basic function of all transform summations (in discrete time) and integrals&#10;(in continuous time) and their kernels.&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/introduction_dft"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/signals_vectors"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Mathematics of the DFT</title><link>https://technick.net/guides/theory/dft/mathematics_dft/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/mathematics_dft/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/dft"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_math_outline"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00220000000000000000"&gt;Mathematics of the DFT&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;In the signal processing literature, it is common to write the &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;DFT&lt;/a&gt; in the&#10;more pure form obtained by setting &lt;img width="45" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img48.png" alt="$T=1$" /&gt; in the previous definition:&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;X(k) &amp;\isdef &amp; \sum_{n=0}^{N-1}x(n)e^{-j{2\pi n k/N}}, \qquad k=0,1,2,\ldots,N-1\\&#10;x(n) &amp;=&amp; \frac{1}{N}\sum_{k=0}^{N-1}X(k)e^{j{2\pi n k/N}}, \qquad n=0,1,2,\ldots,N-1&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="454" height="124" border="0" src="https://technick.net/img/guide_dft/img49.png" alt="\" egin="" qnarray="" k="" sdef="" um="" n-1="" x="" n="" e="" j="" pi="" n="" quad="" um="" n-1="" x="" k="" e="" j="" pi="" n="" quad="" dots="" end="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where &lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img50.png" alt="$x(n)$" /&gt; denotes the input signal at time (sample) &lt;img width="14" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img51.png" alt="$n$" /&gt;, and &lt;img width="40" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img52.png" alt="$X(k)$" /&gt;denotes the &lt;img width="13" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img53.png" alt="$k$" /&gt;th spectral sample.&lt;a name="tex2html7" href="https://technick.net/guides/theory/dft/footnode#foot2492"&gt;&lt;sup&gt;1.1&lt;/sup&gt;&lt;/a&gt; This form is the simplest&#10;mathematically while the previous form is the easier to think about&#10;physically.&lt;p&gt;There are two remaining symbols in the DFT that we have not yet defined:&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;j &amp;\isdef &amp; \sqrt{-1} \\&#10;e &amp;\isdef &amp; \lim_{n\to\infty} \left(1+\frac{1}{n}\right)^{n} &#10;&#9;= 2.71828182845905\ldots&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="362" height="80" border="0" src="https://technick.net/img/guide_dft/img58.png" alt="\" egin="" qnarray="" isdef="" qrt="" isdef="" im="" to\infty="" eft="" rac="" right="" ldots="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;The first, &lt;img width="66" height="35" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img59.png" alt="$j=\" qrt="" /&gt;, is the basis for &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/introduction_complex_number"&gt;complex numbers&lt;/a&gt;&lt;/i&gt;. As a&#10;result, complex numbers will be the first topic we cover in this course&#10;(but only to the extent needed to understand the DFT).&lt;p&gt;The second, &lt;!-- MATH&#10; $e = 2.718\ldots$&#10; --&gt;&lt;img width="90" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img60.png" alt="$e = 2.718\" dots="" /&gt;, is a transcendental number defined by the&#10;above limit. In this course we will derive &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img61.png" alt="$e$" /&gt; and talk about why it comes&#10;up.&lt;/p&gt;&lt;p&gt;Note that not only do we have complex numbers to contend with, but we have&#10;them appearing in exponents, as in&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;s_k(n) \isdef e^{j{2\pi n k/N}}&#10;\end{displaymath}&#10; --&gt;&lt;img width="129" height="31" border="0" src="https://technick.net/img/guide_dft/img62.png" alt="\" egin="" isplaymath="" s="" n="" sdef="" pi="" n="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;We will systematically develop what we mean by &lt;a href="https://technick.net/guides/theory/dft/imaginary_exponents"&gt;imaginary exponents&lt;/a&gt; in order&#10;that such mathematical expressions are well defined.&lt;p&gt;With &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img61.png" alt="$e$" /&gt;, &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img63.png" alt="$j$" /&gt;, and imaginary exponents understood, we can go on to prove &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/proof_euler_s_identity"&gt;Euler's Identity&lt;/a&gt;&lt;/i&gt;:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;e^{j\theta} = \cos(\theta) + j\sin(\theta)&#10;\end{displaymath}&#10; --&gt;&lt;img width="167" height="31" border="0" src="https://technick.net/img/guide_dft/img64.png" alt="\" egin="" isplaymath="" j\theta="" os="" heta="" sin="" heta="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Euler's Identity is the key to understanding the meaning of expressions like&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;s_k(t_n) \isdef e^{j\omega_k t_n}= \cos(\omega_k t_n) + j\sin(\omega_k t_n)&#10;\end{displaymath}&#10; --&gt;&lt;img width="314" height="31" border="0" src="https://technick.net/img/guide_dft/img65.png" alt="\" egin="" isplaymath="" s="" t="" isdef="" omega="" n="" os="" mega="" n="" sin="" mega="" n="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;We'll see that such an expression defines a &lt;i&gt;sampled complex&lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;sinusoid&lt;/a&gt;&lt;/i&gt;, and we'll talk about sinusoids in some detail, from an audio&#10;perspective.&lt;p&gt;Finally, we need to understand what the summation over &lt;img width="14" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img51.png" alt="$n$" /&gt; is doing in the&#10;definition of the DFT. We'll learn that it should be seen as the&#10;computation of the &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/inner_product"&gt;inner product&lt;/a&gt;&lt;/i&gt; of the signals &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; and &lt;img width="19" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img66.png" alt="$s_k$" /&gt;, so&#10;that we may write the DFT using inner-product notation as&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;X(k) \isdef \left&lt;x,s_k\right&gt;&#10;\end{displaymath}&#10; --&gt;&lt;img width="109" height="31" border="0" src="https://technick.net/img/guide_dft/img67.png" alt="\" egin="" isplaymath="" k="" sdef="" eft="" t="" s="s" k\right="" t="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where &lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;s_k(n) \isdef e^{j{2\pi n k/N}}&#10;\end{displaymath}&#10; --&gt;&lt;img width="129" height="31" border="0" src="https://technick.net/img/guide_dft/img62.png" alt="\" egin="" isplaymath="" s="" n="" sdef="" pi="" n="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;is the sampled complex sinusoid at (normalized) radian frequency &lt;!-- MATH&#10; $\omega_k =2\pi&#10;k/N$&#10; --&gt;&lt;img width="91" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img57.png" alt="$\" mega="" pi="" n="" /&gt;, and the inner product operation is defined by&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\left&lt;x,y\right&gt; \isdef \sum_{n=0}^{N-1}x(n) \overline{y(n)}&#10;\end{displaymath}&#10; --&gt;&lt;img width="164" height="62" border="0" src="https://technick.net/img/guide_dft/img68.png" alt="\" egin="" isplaymath="" eft="" t="" y\right="" t="" sdef="" um="" n-1="" x="" n="" overline="" n="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;We will show that the inner product of &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; with the &lt;img width="13" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img53.png" alt="$k$" /&gt;th ''basis&#10;sinusoid'' &lt;img width="19" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img66.png" alt="$s_k$" /&gt; is a measure of ''how much'' of &lt;img width="19" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img66.png" alt="$s_k$" /&gt; is present in &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt;and at ''what phase'' (since it is a complex number).&lt;p&gt;After the foregoing, the inverse DFT can be understood as the&lt;i&gt;weighted sum of projections&lt;/i&gt; of &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; onto &lt;!-- MATH&#10; $\{s_k\}_{k=0}^{N-1}$&#10; --&gt;&lt;img width="64" height="36" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img69.png" alt="$\" s="s" k\="" n-1="" /&gt;, i.e.,&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;x(n) \isdef \sum_{k=0}^{N-1}{\tilde X}(k) s_k(n)&#10;\end{displaymath}&#10; --&gt;&lt;img width="170" height="62" border="0" src="https://technick.net/img/guide_dft/img70.png" alt="\" egin="" isplaymath="" n="" sdef="" um="" n-1="" tilde="" k="" s="" n="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;{\tilde X}_k \isdef \frac{X(k)}{N}&#10;\end{displaymath}&#10; --&gt;&lt;img width="89" height="44" border="0" src="https://technick.net/img/guide_dft/img71.png" alt="\" egin="" isplaymath="" ilde="" isdef="" rac="" k="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;is the (actual) &lt;i&gt;coefficient of projection&lt;/i&gt; of&lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; onto &lt;img width="19" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img66.png" alt="$s_k$" /&gt;. Referring &#10;to the whole signal &lt;!-- MATH&#10; $x\isdef x(\cdot)$&#10; --&gt;&lt;img width="60" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img72.png" alt="$x\" sdef="" dot="" /&gt; as a whole, the &#10;IDFT can be written as&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;x \isdef \sum_{k=0}^{N-1}{\tilde X}_k s_k&#10;\end{displaymath}&#10; --&gt;&lt;img width="105" height="62" border="0" src="https://technick.net/img/guide_dft/img73.png" alt="\" egin="" isplaymath="" isdef="" um="" n-1="" tilde="" k="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Note that both the &lt;i&gt;basis sinusoids&lt;/i&gt; &lt;img width="19" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img66.png" alt="$s_k$" /&gt; and their coefficients of&#10;projection &lt;img width="25" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img74.png" alt="${\" ilde="" /&gt; are &lt;i&gt;complex&lt;/i&gt;.&lt;p&gt;Having completely understood the DFT and its inverse mathematically, we go&#10;on to proving various &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/fourier_theorems"&gt;Fourier Theorems&lt;/a&gt;&lt;/i&gt;, such as the ''&lt;a href="https://technick.net/guides/theory/dft/shift_theorem"&gt;shift&#10;theorem&lt;/a&gt;,'' the ''&lt;a href="https://technick.net/guides/theory/dft/convolution_theorem"&gt;convolution theorem&lt;/a&gt;,'' and ''Parsevals' theorem.'' The&#10;Fourier theorems provide a basic thinking vocabulary for working with&#10;signals in the time and frequency domains. They can be used to answer&#10;questions like &lt;blockquote&gt;What happens in the frequency domain if I do this in the time domain?&lt;/blockquote&gt;</description></item><item><title>DFT Math Outline</title><link>https://technick.net/guides/theory/dft/dft_math_outline/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/dft_math_outline/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/mathematics_dft"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/introduction_complex_number"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00230000000000000000"&gt;DFT Math Outline&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;In summary, understanding the &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;DFT&lt;/a&gt; takes us through the following topics:&lt;ol&gt;&lt;li&gt;&lt;a href="https://technick.net/guides/theory/dft/introduction_complex_number"&gt;Complex numbers&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href="https://technick.net/guides/theory/dft/imaginary_exponents"&gt;Complex exponents&lt;/a&gt;&lt;/li&gt;&lt;li&gt;Why &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img61.png" alt="$e$" /&gt;?&lt;/li&gt;&lt;li&gt;&lt;a href="https://technick.net/guides/theory/dft/proof_euler_s_identity"&gt;Euler's formula&lt;/a&gt;&lt;/li&gt;&lt;li&gt;Projecting signals onto signals via the &lt;a href="https://technick.net/guides/theory/dft/inner_product"&gt;inner product&lt;/a&gt;&lt;/li&gt;&lt;li&gt;The DFT as the coefficient of projection of a signal &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; onto &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; &lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;sinusoids&lt;/a&gt;&lt;/li&gt;&lt;li&gt;The IDFT as a weighted sum of the &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; projections&lt;/li&gt;&lt;li&gt;Various &lt;a href="https://technick.net/guides/theory/dft/fourier_theorems"&gt;Fourier theorems&lt;/a&gt;&lt;/li&gt;&lt;li&gt;Elementary time-frequency pairs&lt;/li&gt;&lt;li&gt;Practical &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;spectrum analysis&lt;/a&gt; in &lt;a href="http://www.mathworks.com/access/helpdesk/help/techdoc/basics/getstarted.shtml"&gt;Matlab&lt;/a&gt;&lt;/li&gt;&lt;/ol&gt;&lt;/p&gt;&lt;p&gt;We will additionally discuss practical aspects of working with sinusoids,&#10;such as &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/decibels"&gt;decibels&lt;/a&gt;&lt;/i&gt; (&lt;a href="https://technick.net/guides/theory/dft/decibels"&gt;dB&lt;/a&gt;) and display techniques.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/mathematics_dft"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/introduction_complex_number"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Introduction to Complex Numbers</title><link>https://technick.net/guides/theory/dft/introduction_complex_number/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/introduction_complex_number/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/dft_math_outline"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/factoring_polynomial_with"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00300000000000000000"&gt;Introduction to Complex Numbers&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;This chapter provides an &lt;a href="https://technick.net/guides/theory/dft/introduction_complex_number"&gt;introduction to complex numbers&lt;/a&gt;, factoring&#10;polynomials, the &lt;a href="https://technick.net/guides/theory/dft/quadratic_formula"&gt;quadratic formula&lt;/a&gt;, the &lt;a href="https://technick.net/guides/theory/dft/complex_plane"&gt;complex plane&lt;/a&gt;, &lt;a href="https://technick.net/guides/theory/dft/proof_euler_s_identity"&gt;Euler's&#10;formula&lt;/a&gt;, and an overview of numerical facilities for &lt;a href="https://technick.net/guides/theory/dft/introduction_complex_number"&gt;complex numbers&lt;/a&gt;in &lt;a href="http://www.mathworks.com/access/helpdesk/help/techdoc/basics/getstarted.shtml"&gt;Matlab&lt;/a&gt; and &lt;a href="https://technick.net/guides/theory/dft/sidebar_mathematica"&gt;Mathematica&lt;/a&gt;.&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;hr /&gt;&lt;!--Table of Child-Links--&gt;&lt;a name="CHILD_LINKS"&gt;&lt;strong&gt;Subsections&lt;/strong&gt;&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html426" href="https://technick.net/guides/theory/dft/factoring_polynomial_with"&gt;Factoring a Polynomial with Real Roots&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html427" href="https://technick.net/guides/theory/dft/quadratic_formula"&gt;The Quadratic Formula&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html428" href="https://technick.net/guides/theory/dft/complex_roots"&gt;Complex Roots&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html429" href="https://technick.net/guides/theory/dft/fundamental_theorem_algebra"&gt;The Fundamental Theorem of Algebra&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html430" href="https://technick.net/guides/theory/dft/complex_numbers"&gt;Complex Numbers&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html431" href="https://technick.net/guides/theory/dft/complex_plane"&gt;The Complex Plane&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html432" href="https://technick.net/guides/theory/dft/more_notation_terminology"&gt;More Notation and Terminology&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html433" href="https://technick.net/guides/theory/dft/elementary_relationships"&gt;Elementary Relationships&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html434" href="https://technick.net/guides/theory/dft/euler_s_formula"&gt;Euler's Formula&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html435" href="https://technick.net/guides/theory/dft/de_moivre_s_theorem"&gt;De Moivre's Theorem&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html436" href="https://technick.net/guides/theory/dft/numerical_tools_matlab"&gt;Numerical Tools in Matlab&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html437" href="https://technick.net/guides/theory/dft/numerical_tools_mathematica"&gt;Numerical Tools in Mathematica&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;!--End of Table of Child-Links--&gt;&#10;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/dft_math_outline"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/factoring_polynomial_with"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Factoring a Polynomial with Real Roots</title><link>https://technick.net/guides/theory/dft/factoring_polynomial_with/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/factoring_polynomial_with/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/introduction_complex_number"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/quadratic_formula"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00310000000000000000"&gt;Factoring a Polynomial with Real Roots&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;Remember ''factoring polynomials''? Consider the second-order polynomial&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;p(x) = x^2-5x+6&#10;\end{displaymath}&#10; --&gt;&lt;img width="146" height="31" border="0" src="https://technick.net/img/guide_dft/img75.png" alt="\" egin="" isplaymath="" p="" x="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;It is second-order because the highest power of &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; is &lt;img width="12" height="13" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img76.png" alt="$2$" /&gt; (only&#10;non-negative integer powers are allowed). The polynomial is also &lt;i&gt;monic&lt;/i&gt; because its leading coefficient, the coefficient of &lt;img width="20" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img77.png" alt="$x^2$" /&gt;, is &lt;img width="12" height="13" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img78.png" alt="$1$" /&gt;.&#10;Since it is second order, there are at most two real &lt;i&gt;roots&lt;/i&gt; (or &lt;i&gt;zeros&lt;/i&gt;) of the polynomial. Suppose they are denoted &lt;img width="20" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img79.png" alt="$x_1$" /&gt; and &lt;img width="20" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img80.png" alt="$x_2$" /&gt;. Then&#10;we have &lt;img width="70" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img81.png" alt="$p(x_1)=0$" /&gt; and &lt;img width="70" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img82.png" alt="$p(x_2)=0$" /&gt;, and we can write&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;p(x) = (x-x_1)(x-x_2)&#10;\end{displaymath}&#10; --&gt;&lt;img width="181" height="31" border="0" src="https://technick.net/img/guide_dft/img83.png" alt="\" egin="" isplaymath="" p="" x-x="" x="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;This is the &lt;i&gt;factored form&lt;/i&gt; of the monic polynomial &lt;img width="34" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img84.png" alt="$p(x)$" /&gt;.&#10;(For a non-monic polynomial, we may simply divide all coefficients&#10;by the first to make it monic, and this doesn't affect the zeros.)&#10;Multiplying out the symbolic factored form gives&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;p(x) = (x-x_1)(x-x_2) = x^2 - x (x_1 + x_2) + x_1 x_2&#10;\end{displaymath}&#10; --&gt;&lt;img width="383" height="31" border="0" src="https://technick.net/img/guide_dft/img85.png" alt="\" egin="" isplaymath="" p="" x-x="" x="" x="" x="" x="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Comparing with the original polynomial, we find we must have&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;x_1+x_2 &amp;=&amp; 5 \\&#10;x_1 x_2 &amp;=&amp; 6&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="115" height="55" border="0" src="https://technick.net/img/guide_dft/img86.png" alt="\" egin="" qnarray="" x="" x="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;This is a system of two equations in two unknowns. Unfortunately, it is a&lt;i&gt;nonlinear&lt;/i&gt; system of two equations in two&#10;unknowns.&lt;a name="tex2html8" href="https://technick.net/guides/theory/dft/footnode#foot2945"&gt;&lt;sup&gt;2.1&lt;/sup&gt;&lt;/a&gt;Nevertheless, because it is so small, the&#10;equations are easily solved. In beginning algebra, we did them by hand.&#10;However, nowadays we can use a computer program such as &lt;a href="https://technick.net/guides/theory/dft/sidebar_mathematica"&gt;Mathematica&lt;/a&gt;:&lt;pre&gt;&#10;In[]:=&#10; Solve[{x1+x2==5, x1 x2 == 6}, {x1,x2}]&#10;Out[]:&#10; {{x1 -&amp;gt; 2, x2 -&amp;gt; 3}, {x1 -&amp;gt; 3, x2 -&amp;gt; 2}}&lt;/pre&gt;Note that the two lists of substitutions points out that&#10;it doesn't matter which root is 2 and which is 3.&#10;In summary, the factored form of this simple example is&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;p(x) = x^2-5x+6 = (x-x_1)(x-x_2) = (x-2)(x-3)&#10;\end{displaymath}&#10; --&gt;&lt;img width="425" height="31" border="0" src="https://technick.net/img/guide_dft/img96.png" alt="\" egin="" isplaymath="" p="" x="" x-x="" x="" x-3="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Note that polynomial factorization rewrites a monic &lt;img width="14" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img51.png" alt="$n$" /&gt;th-order polynomial&#10;as the product of &lt;img width="14" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img51.png" alt="$n$" /&gt; &lt;i&gt;first-order&lt;/i&gt; monic polynomials, each of which&#10;contributes one zero (root) to the product. This factoring business is&#10;often used when working with &lt;i&gt;&lt;a href="http://www.dsptutor.freeuk.com/dfilt1.php"&gt;digital filters&lt;/a&gt;&lt;/i&gt;.&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/introduction_complex_number"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/quadratic_formula"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>The Quadratic Formula</title><link>https://technick.net/guides/theory/dft/quadratic_formula/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/quadratic_formula/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/factoring_polynomial_with"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/complex_roots"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00320000000000000000"&gt;The Quadratic Formula&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;The general second-order polynomial is&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;p(x) \isdef a x^2 + b x + c&#10;\end{displaymath}&#10; --&gt;&lt;img width="152" height="31" border="0" src="https://technick.net/img/guide_dft/img97.png" alt="\" egin="" isplaymath="" p="" isdef="" b="b" c="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where the coefficients&lt;img width="40" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img98.png" alt="$a,b,c$" /&gt; are any real numbers, and we assume &lt;img width="42" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img99.png" alt="$a\" eq="" /&gt; since otherwise&#10;it would not be second order. Some experiments plotting &lt;img width="34" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img84.png" alt="$p(x)$" /&gt; for different&#10;values of the coefficients leads one to guess that the curve is always a&#10;scaled and translated &lt;i&gt;parabola&lt;/i&gt;. The canonical parabola centered&#10;at &lt;img width="51" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img100.png" alt="$x=x_0$" /&gt; is given by&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;y(x) = d(x-x_0)^2 + e&#10;\end{displaymath}&#10; --&gt;&lt;img width="166" height="31" border="0" src="https://technick.net/img/guide_dft/img101.png" alt="\" egin="" isplaymath="" x="" x-x="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where &lt;img width="12" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img102.png" alt="$d$" /&gt; determines the width and &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img61.png" alt="$e$" /&gt; provides an arbitrary vertical&#10;offset. If we can find &lt;img width="50" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img103.png" alt="$d,e,x_0$" /&gt; in terms of &lt;img width="40" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img98.png" alt="$a,b,c$" /&gt; for any quadratic&#10;polynomial, then we can easily factor the polynomial. This is called&#10;''completing the square.'' Multiplying out &lt;img width="34" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img104.png" alt="$y(x)$" /&gt;, we get&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;y(x) = d(x-x_0)^2 + e = d x^2 -2 d x_0 x + d x_0^2 + e&#10;\end{displaymath}&#10; --&gt;&lt;img width="362" height="31" border="0" src="https://technick.net/img/guide_dft/img105.png" alt="\" egin="" isplaymath="" x="" x-x="" d="" d="" d="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Equating coefficients of like powers of &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; gives&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;d &amp;=&amp; a\\&#10;-2 d x_0 &amp;=&amp; b \quad\Rightarrow\quad x_0 = -b/(2a) \\&#10;d x_0^2 + e &amp;=&amp; c \quad\Rightarrow\quad e = c - b^2/(4a)&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="291" height="84" border="0" src="https://technick.net/img/guide_dft/img106.png" alt="\" egin="" qnarray="" a\\="" b="b" quad\rightarrow\quad="" b="" a="" e="" quad\rightarrow\quad="" b="b" a="a" end="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Using these answers, any second-order polynomial &lt;!-- MATH&#10; $p(x) = a x^2 + b x + c$&#10; --&gt;&lt;img width="141" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img107.png" alt="$p(x) = a x^2 + b x + c$" /&gt;can be rewritten as a scaled, translated parabola&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;p(x) = a\left(x+\frac{b}{2a}\right)^2 + \left(c - \frac{b^2}{4a}\right).&#10;\end{displaymath}&#10; --&gt;&lt;img width="263" height="53" border="0" src="https://technick.net/img/guide_dft/img108.png" alt="\" egin="" isplaymath="" p="" a\left="" frac="" b="" a="" ight="" eft="" frac="" b="" a="" ight="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;In this form, the roots are easily found by solving &lt;img width="63" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img109.png" alt="$p(x)=0$" /&gt; to get&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\fbox{$\displaystyle x = \frac{-b \pm \sqrt{b^2 - 4ac}}{2a}$}&#10;\end{displaymath}&#10; --&gt;&lt;img width="170" height="59" border="0" src="https://technick.net/img/guide_dft/img110.png" alt="\" egin="" isplaymath="" box="" isplaystyle="" rac="" b="" m="" qrt="" b="" c="" a="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;This is the general &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/quadratic_formula"&gt;quadratic formula&lt;/a&gt;&lt;/i&gt;. It was obtained by simple&#10;algebraic manipulation of the original polynomial. There is only one&#10;''catch.'' What happens when &lt;img width="61" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img111.png" alt="$b^2 - 4ac$" /&gt; is negative? This introduces the&#10;square root of a negative number which we could insist ''does not exist.''&#10;Alternatively, we could invent &lt;a href="https://technick.net/guides/theory/dft/introduction_complex_number"&gt;complex numbers&lt;/a&gt; to accommodate it.&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/factoring_polynomial_with"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/complex_roots"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Complex Roots</title><link>https://technick.net/guides/theory/dft/complex_roots/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/complex_roots/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/quadratic_formula"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/fundamental_theorem_algebra"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00330000000000000000"&gt;Complex Roots&lt;/a&gt;&lt;/h1&gt;&lt;p&gt; &lt;div align="CENTER"&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:parabola"&gt;&lt;/a&gt;&lt;a name="3010"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure 2.1:&lt;/strong&gt;An example parabola defined by &lt;!-- MATH&#10; $p(x) = x^2 + 4$&#10; --&gt;&lt;img width="99" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1.png" alt="$p(x) = x^2 + 4$" /&gt;.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; $\scalebox{0.5}{\includegraphics{eps/parabola.eps}}$&#10; --&gt;&lt;img width="383" height="307" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img112.png" alt="\" calebox="" ncludegraphics="" ps="" arabola="" ps="" /&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;&lt;p&gt;As a simple example, let &lt;img width="42" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img113.png" alt="$a=1$" /&gt;, &lt;img width="40" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img114.png" alt="$b=0$" /&gt;, and &lt;img width="40" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img115.png" alt="$c=4$" /&gt;, i.e.,&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;p(x) = x^2 + 4&#10;\end{displaymath}&#10; --&gt;&lt;img width="106" height="31" border="0" src="https://technick.net/img/guide_dft/img116.png" alt="\" egin="" isplaymath="" p="" x="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;As shown in Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/complex_roots#fig:parabola"&gt;2.1&lt;/a&gt;, this is a parabola centered at &lt;img width="42" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img117.png" alt="$x=0$" /&gt; (where&lt;img width="62" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img118.png" alt="$p(0)=4$" /&gt;) and reaching upward to positive infinity, never going below &lt;img width="12" height="13" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img119.png" alt="$4$" /&gt;.&#10;It has no zeros. On the other hand, the &lt;a href="https://technick.net/guides/theory/dft/quadratic_formula"&gt;quadratic formula&lt;/a&gt; says that the&#10;''roots'' are given formally by &lt;!-- MATH&#10; $x=\pm\sqrt{-4} = \pm 2 \sqrt{-1}$&#10; --&gt;&lt;img width="155" height="35" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img120.png" alt="$x=\" m\sqrt="" m="" qrt="" /&gt;. The&#10;square root of any negative number &lt;img width="40" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img121.png" alt="$c&amp;lt;0$" /&gt; can be expressed as&#10;&lt;!-- MATH&#10; $\sqrt{\left|c\right|}\sqrt{-1}$&#10; --&gt;&lt;img width="69" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img122.png" alt="$\" qrt="" eft\vert="" ight\vert="" qrt="" /&gt;, so the only new algebraic object is &lt;img width="38" height="35" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img123.png" alt="$\" qrt="" /&gt;.&#10;Let's give it a name:&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\fbox{$\displaystyle j \isdef \sqrt{-1}$}&#10;\end{displaymath}&#10; --&gt;&lt;img width="81" height="40" border="0" src="https://technick.net/img/guide_dft/img124.png" alt="\" egin="" isplaymath="" box="" isplaystyle="" sdef="" qrt="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Then, formally, the roots of of &lt;img width="48" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img125.png" alt="$x^2 + 4$" /&gt; are &lt;img width="32" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img126.png" alt="$\" m="" /&gt;, and we can formally&#10;express the polynomial in terms of its roots as&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;p(x) = (x+2j)(x-2j)&#10;\end{displaymath}&#10; --&gt;&lt;img width="180" height="31" border="0" src="https://technick.net/img/guide_dft/img127.png" alt="\" egin="" isplaymath="" p="" x="" x-2j="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;We can think of these as ''imaginary roots'' in the sense that square roots&#10;of negative numbers don't really exist, or we can extend the concept of&#10;''roots'' to allow for &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/introduction_complex_number"&gt;complex numbers&lt;/a&gt;&lt;/i&gt;, that is, numbers of the form&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;z = x + j y&#10;\end{displaymath}&#10; --&gt;&lt;img width="81" height="30" border="0" src="https://technick.net/img/guide_dft/img128.png" alt="\" egin="" isplaymath="" x="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; and &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img13.png" alt="$y$" /&gt; are real numbers, and &lt;img width="60" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img129.png" alt="$j^2\" sdef="" /&gt;.&lt;p&gt;It can be checked that all algebraic operations for real&#10;numbers&lt;a name="tex2html10" href="https://technick.net/guides/theory/dft/footnode#foot2796"&gt;&lt;sup&gt;2.2&lt;/sup&gt;&lt;/a&gt; apply equally well to complex numers. Both real numbers and&#10;complex numbers are examples of a mathematical &lt;i&gt;field&lt;/i&gt;. Fields are&lt;i&gt;closed&lt;/i&gt; with respect to multiplication and addition, and all the rules&#10;of algebra we use in manipulating polynomials with real coefficients (and&#10;roots) carry over unchanged to polynomials with complex coefficients and&#10;roots. In fact, the rules of algebra become simpler for complex numbers&#10;because, as discussed in the next section, we can &lt;i&gt;always&lt;/i&gt; factor&#10;polynomials completely over the field of complex numbers while we cannot do&#10;this over the reals (as we saw in the example &lt;img width="99" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1.png" alt="$p(x) = x^2 + 4$" /&gt;).&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/quadratic_formula"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/fundamental_theorem_algebra"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>The Fundamental Theorem of Algebra</title><link>https://technick.net/guides/theory/dft/fundamental_theorem_algebra/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/fundamental_theorem_algebra/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/complex_roots"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/complex_numbers"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00340000000000000000"&gt;The Fundamental Theorem of Algebra&lt;/a&gt;&lt;/h1&gt;&lt;blockquote&gt;&lt;img width="443" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img130.png" alt="\" box="" mph="" very="" th-order="" lynomial="" ssesses="" actly="" complex="" ots="" /&gt;&lt;/blockquote&gt;This is a very powerful algebraic tool. It says that given any polynomial&lt;p&gt;&lt;/p&gt;</description></item><item><title>Complex Numbers</title><link>https://technick.net/guides/theory/dft/complex_numbers/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/complex_numbers/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/fundamental_theorem_algebra"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/complex_plane"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00350000000000000000"&gt;Complex Numbers&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;This section introduces various notation and terms associated with &lt;a href="https://technick.net/guides/theory/dft/introduction_complex_number"&gt;complex&#10;numbers&lt;/a&gt;. As discussed above, complex numbers are devised by introducing&#10;the square-root of &lt;img width="24" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img134.png" alt="$-1$" /&gt; as a primitive new algebraic object among real&#10;numbers and manipulating it symbolically as if it were a real number&#10;itself:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;j \isdef \sqrt{-1}&#10;\end{displaymath}&#10; --&gt;&lt;img width="70" height="30" border="0" src="https://technick.net/img/guide_dft/img135.png" alt="\" egin="" isplaymath="" isdef="" qrt="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Mathemeticians and physicists often use &lt;img width="10" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img136.png" alt="$i$" /&gt; instead of &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img63.png" alt="$j$" /&gt; as &lt;img width="38" height="35" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img123.png" alt="$\" qrt="" /&gt;.&#10;The use of &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img63.png" alt="$j$" /&gt; is common in engineering where &lt;img width="10" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img136.png" alt="$i$" /&gt; is more often used for&#10;electrical current.&lt;p&gt;As mentioned above, for any negative number &lt;img width="40" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img121.png" alt="$c&amp;lt;0$" /&gt;, we have &lt;!-- MATH&#10; $\sqrt{c} =&#10;\sqrt{(-1)(-c)} = j\sqrt{\left|c\right|}$&#10; --&gt;&lt;img width="186" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img137.png" alt="$\" qrt="" sqrt="" j\sqrt="" eft\vert="" ight\vert="" /&gt;, where &lt;!-- MATH&#10; $\left|c\right|$&#10; --&gt;&lt;img width="20" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img138.png" alt="$\" eft\vert="" ight\vert="" /&gt; denotes the absolute&#10;value of &lt;img width="11" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img139.png" alt="$c$" /&gt;. Thus, every square root of a negative number can be&#10;expressed as &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img63.png" alt="$j$" /&gt; times the square root of a positive number.&lt;/p&gt;&lt;p&gt;By definition, we have&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;j^0 &amp;=&amp; 1 \\&#10;j^1 &amp;=&amp; j \\&#10;j^2 &amp;=&amp; -1 \\&#10;j^3 &amp;=&amp; -j\\&#10;j^4 &amp;=&amp; 1 \\&#10; &amp;\cdots&amp;&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="95" height="158" border="0" src="https://technick.net/img/guide_dft/img140.png" alt="\" egin="" qnarray="" j="" j="" j\\="" dots="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;and so on. Thus, the sequence &lt;!-- MATH&#10; $x(n)\isdef j^n$&#10; --&gt;&lt;img width="72" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img141.png" alt="$x(n)\" sdef="" /&gt;, &lt;!-- MATH&#10; $n=0,1,2,\ldots$&#10; --&gt;&lt;img width="99" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img142.png" alt="$n=0,1,2,\" dots="" /&gt; is a&#10;periodic sequence with period &lt;img width="12" height="13" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img119.png" alt="$4$" /&gt;, since &lt;!-- MATH&#10; $j^{n+4}=j^n j^4=j^n$&#10; --&gt;&lt;img width="126" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img143.png" alt="$j^{n+4}=j^n j^4=j^n$" /&gt;. (We'll&#10;learn later that the sequence &lt;img width="20" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img144.png" alt="$j^n$" /&gt; is a sampled complex &lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;sinusoid&lt;/a&gt; havingfrequency equal to one fourth the &lt;a href="https://technick.net/guides/theory/dft/shannon_s_sampling_theorem"&gt;sampling rate&lt;/a&gt;.)&lt;p&gt;Every &lt;i&gt;complex number&lt;/i&gt; &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt; can be written as&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;z = x + j y&#10;\end{displaymath}&#10; --&gt;&lt;img width="81" height="30" border="0" src="https://technick.net/img/guide_dft/img128.png" alt="\" egin="" isplaymath="" x="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; and &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img13.png" alt="$y$" /&gt; are real numbers.&#10;We call &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; the &lt;i&gt;real part&lt;/i&gt; and&lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img13.png" alt="$y$" /&gt; the &lt;i&gt;imaginary part&lt;/i&gt;.&#10;We may also use the notation&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;\mbox{re}\left\{z\right\} &amp;=&amp; x \qquad \mbox{(''the real part of $z=x+jy$\ is $x$'')} \\&#10;\mbox{im}\left\{z\right\} &amp;=&amp; y \qquad \mbox{(''the imaginary part of $z=x+jy$\ is $y$'')}&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="457" height="57" border="0" src="https://technick.net/img/guide_dft/img145.png" alt="\" egin="" qnarray="" box="" e="" eft\="" right\="" qquad="" box="" q\lq="" e="" al="" rt="" qquad="" box="" q\lq="" e="" aginary="" rt="" z="x+jy$\" is="" end="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Note that the real numbers are the subset of the complex numbers having&#10;a zero imaginary part (&lt;img width="42" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img146.png" alt="$y=0$" /&gt;).&lt;p&gt;The rule for &lt;i&gt;complex multiplication&lt;/i&gt; follows directly from the definition&#10;of the imaginary unit &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img63.png" alt="$j$" /&gt;:&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;z_1 z_2 &amp;\isdef &amp; (x_1 + j y_1) (x_2 + j y_2) \\&#10; &amp;=&amp; x_1 x_2 + j x_1 y_2 + j y_1 x_2 + j^2 y_1 y_2 \\&#10; &amp;=&amp; (x_1 x_2 - y_1 y_2) + j (x_1 y_2 + y_1 x_2)&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="317" height="84" border="0" src="https://technick.net/img/guide_dft/img147.png" alt="\" egin="" qnarray="" z="" sdef="" j="" j="" x="" y="" x="" y="" j="" y="" x="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;In some mathematics texts, complex numbers &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt; are defined as ordered pairs&#10;of real numbers &lt;img width="41" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img148.png" alt="$(x,y)$" /&gt;, and algebraic operations such as multiplication&#10;are defined more formally as operations on ordered pairs, e.g., &lt;!-- MATH&#10; $(x_1,y_1)&#10;\cdot (x_2,y_2) \isdef (x_1 x_2 - y_1 y_2, x_1 y_2 + y_1 x_2)$&#10; --&gt;&lt;img width="321" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img149.png" alt="$(x_1,y_1)&#10;\" dot="" y="" sdef="" x="" y="" y="" x="" /&gt;. However, such&#10;formality tends to obscure the underlying simplicity of complex numbers as&#10;a straightforward extension of real numbers to include &lt;img width="66" height="35" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img59.png" alt="$j=\" qrt="" /&gt;.&lt;p&gt;It is important to realize that complex numbers can be treated&#10;algebraically just like real numbers. That is, they can be added,&#10;subtracted, multiplied, divided, etc., using exactly the same rules of&#10;algebra (since both real and complex numbers are mathematical&lt;i&gt;fields&lt;/i&gt;). It is often preferable to think of complex numbers as&#10;being the true and proper setting for algebraic operations, with real&#10;numbers being the limited subset for which &lt;img width="42" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img146.png" alt="$y=0$" /&gt;.&lt;/p&gt;&lt;p&gt;To explore further the magical world of complex variables,&#10;see any textbook such as [&lt;a href="https://technick.net/guides/theory/dft/bibliography#Churchill"&gt;4&lt;/a&gt;,&lt;a href="https://technick.net/guides/theory/dft/bibliography#LePage"&gt;5&lt;/a&gt;].&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;hr /&gt;&lt;!--Table of Child-Links--&gt;&lt;a name="CHILD_LINKS"&gt;&lt;strong&gt;Subsections&lt;/strong&gt;&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html498" href="https://technick.net/guides/theory/dft/complex_plane"&gt;The Complex Plane&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html499" href="https://technick.net/guides/theory/dft/more_notation_terminology"&gt;More Notation and Terminology&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html500" href="https://technick.net/guides/theory/dft/elementary_relationships"&gt;Elementary Relationships&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html501" href="https://technick.net/guides/theory/dft/euler_s_formula"&gt;Euler's Formula&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html502" href="https://technick.net/guides/theory/dft/de_moivre_s_theorem"&gt;De Moivre's Theorem&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;!--End of Table of Child-Links--&gt;&#10;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/fundamental_theorem_algebra"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/complex_plane"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>The Complex Plane</title><link>https://technick.net/guides/theory/dft/complex_plane/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/complex_plane/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/complex_numbers"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/more_notation_terminology"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00351000000000000000"&gt;The Complex Plane&lt;/a&gt;&lt;/h2&gt;&lt;p&gt; &lt;div align="CENTER"&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:ComplexPlane"&gt;&lt;/a&gt;&lt;a name="3033"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure 2.2:&lt;/strong&gt;Plotting a &lt;a href="https://technick.net/guides/theory/dft/introduction_complex_number"&gt;complex number&lt;/a&gt; as a point in the&lt;a href="https://technick.net/guides/theory/dft/complex_plane"&gt;complex plane&lt;/a&gt;.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; $\scalebox{0.5}{\includegraphics{eps/ComplexPlane.eps}}$&#10; --&gt;&lt;img width="271" height="189" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img150.png" alt="\" calebox="" ncludegraphics="" ps="" omplexplane="" ps="" /&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;We can plot complex numbers &lt;img width="78" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img15.png" alt="$z = x + jy$" /&gt; in a plane as ordered pairs &lt;img width="41" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img148.png" alt="$(x,y)$" /&gt;,&#10;as shown in Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/complex_plane#fig:ComplexPlane"&gt;2.2&lt;/a&gt;. The &lt;i&gt;complex plane&lt;/i&gt; is any 2D graph&#10;in which the horizontal axis is the &lt;i&gt;real part&lt;/i&gt; and the vertical axis&#10;is the &lt;i&gt;imaginary part&lt;/i&gt; of a complex number or function. As an&#10;example, the number &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img63.png" alt="$j$" /&gt; has coordinates &lt;img width="39" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img151.png" alt="$(0,1)$" /&gt; in the complex plane while&#10;the number &lt;img width="12" height="13" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img78.png" alt="$1$" /&gt; has coordinates &lt;img width="39" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img152.png" alt="$(1,0)$" /&gt;.&lt;/p&gt;&lt;p&gt;Plotting &lt;img width="78" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img15.png" alt="$z = x + jy$" /&gt; as the point &lt;img width="41" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img148.png" alt="$(x,y)$" /&gt; in the complex plane can be viewed&#10;as a plot in &lt;i&gt;Cartesian&lt;/i&gt; or &lt;i&gt;rectilinear&lt;/i&gt; coordinates. We can also&#10;express complex numbers in terms of &lt;i&gt;polar coordinates&lt;/i&gt; as an ordered&#10;pair &lt;img width="38" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img153.png" alt="$(r,\" heta="" /&gt;, where &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img154.png" alt="$r$" /&gt; is the distance from the origin &lt;img width="39" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img155.png" alt="$(0,0)$" /&gt; to the&#10;number being plotted, and &lt;img width="12" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img156.png" alt="$\" heta="" /&gt; is the angle of the number relative to&#10;the positive real coordinate axis (the line defined by &lt;img width="42" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img146.png" alt="$y=0$" /&gt; and &lt;img width="42" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img157.png" alt="$x&amp;gt;0$" /&gt;).&#10;(See Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/complex_plane#fig:ComplexPlane"&gt;2.2&lt;/a&gt;.)&lt;/p&gt;&lt;p&gt;Using elementary &lt;i&gt;geometry&lt;/i&gt;, it is quick to show that conversion from&#10;rectangular to polar coordinates is accomplished by the formulas&lt;div align="CENTER"&gt;&lt;img width="157" height="61" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img158.png" alt="\" box="" egin="" inipage="" n="" space="" n="" egin="" qnarray="" sqrt="" y="" heta="" an="" x="" nd="" qnarray="" nd="" inipage="" /&gt;&lt;/div&gt;The first equation follows immediately from the &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/pythagorean_theorem_n_space"&gt;Pythagorean theorem&lt;/a&gt;&lt;/i&gt;,&#10;while the second follows immediately from the definition of the &lt;i&gt;tangent&lt;/i&gt; function. Similarly, conversion from polar to rectangular&#10;coordinates is simply&lt;div align="CENTER"&gt;&lt;img width="157" height="57" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img159.png" alt="\" box="" egin="" inipage="" n="" space="" n="" egin="" qnarray="" r\="" os="" heta="" r\="" in="" heta="" nd="" qnarray="" nd="" inipage="" /&gt;&lt;/div&gt;These follow immediately from the definitions of cosine and sine, respectively,&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/complex_numbers"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/more_notation_terminology"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>More Notation and Terminology</title><link>https://technick.net/guides/theory/dft/more_notation_terminology/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/more_notation_terminology/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/complex_plane"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/elementary_relationships"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00352000000000000000"&gt;More Notation and Terminology&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;It's already been mentioned that the rectilinear coordinates of a &lt;a href="https://technick.net/guides/theory/dft/introduction_complex_number"&gt;complex&#10;number&lt;/a&gt; &lt;img width="78" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img15.png" alt="$z = x + jy$" /&gt; in the &lt;a href="https://technick.net/guides/theory/dft/complex_plane"&gt;complex plane&lt;/a&gt; are called the &lt;i&gt;real part&lt;/i&gt; and&lt;i&gt;imaginary part&lt;/i&gt;, respectively.&lt;/p&gt;&lt;p&gt;We also have special notation and various names for the radius and angle&#10;of a complex number &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt; expressed in polar coordinates &lt;img width="38" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img153.png" alt="$(r,\" heta="" /&gt;:&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;r &amp;\isdef &amp; \left|z\right| = \sqrt{x^2 + y^2} = \mbox{\emph{modulus},&#10;\emph{magnitude},&#10;\emph{absolute value},&#10;or \emph{radius} of $z$} \\&#10;\theta &amp;\isdef &amp; \angle{z} = \tan^{-1}{y/x} = \mbox{\emph{angle}, \emph{argument},&#10; or \emph{phase} of $z$}&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="581" height="60" border="0" src="https://technick.net/img/guide_dft/img160.png" alt="\" egin="" qnarray="" isdef="" eft\vert="" ight\vert="\sqrt{x^2" y="" box="" box="" mph="" ngle="" mph="" rgument="" r="" mph="" hase="" f="" end="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;The &lt;i&gt;complex conjugate&lt;/i&gt; of &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt; is denoted &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img161.png" alt="$\" verline="" /&gt; and is defined by&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\overline{z} \isdef x - j y&#10;\end{displaymath}&#10; --&gt;&lt;img width="81" height="30" border="0" src="https://technick.net/img/guide_dft/img162.png" alt="\" egin="" isplaymath="" verline="" isdef="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where, of course, &lt;img width="78" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img163.png" alt="$z\" sdef="" y="" /&gt;. Sometimes you'll see the notation&lt;img width="20" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img164.png" alt="$z^\" st="" /&gt; in place of &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img161.png" alt="$\" verline="" /&gt;, but we won't use that here.&lt;p&gt;&lt;/p&gt;&lt;p&gt;In general, you can always obtain the complex conjugate of any expression&#10;by simply replacing &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img63.png" alt="$j$" /&gt; with &lt;img width="24" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img165.png" alt="$-j$" /&gt;. In the complex plane, this is a &lt;i&gt;vertical flip&lt;/i&gt; about the real axis; in other words, complex conjugation&#10;replaces each point in the complex plane by its &lt;i&gt;mirror image&lt;/i&gt; on the&#10;other side of the &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; axis.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/complex_plane"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/elementary_relationships"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Elementary Relationships</title><link>https://technick.net/guides/theory/dft/elementary_relationships/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/elementary_relationships/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/more_notation_terminology"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/euler_s_formula"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00353000000000000000"&gt;Elementary Relationships&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;From the above definitions, one can quickly verify&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;z+\overline{z} &amp;=&amp; 2 \, \mbox{re}\left\{z\right\} \\&#10;z-\overline{z} &amp;=&amp; 2 j\, \mbox{im}\left\{z\right\} \\&#10;z\overline{z} &amp;=&amp; \left|z\right|^2&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="157" height="86" border="0" src="https://technick.net/img/guide_dft/img166.png" alt="\" egin="" qnarray="" overline="" mbox="" e="" eft\="" right\="" overl="" eft\="" right\="" overline="" left\vert="" ight\vert="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Let's verify the third relationship which states that a &lt;a href="https://technick.net/guides/theory/dft/introduction_complex_number"&gt;complex number&lt;/a&gt;multiplied by its conjugate is equal to its magnitude squared:&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;z \overline{z} \isdef (x+jy)(x-jy) = x^2-(jy)^2 = x^2 + y^2 \isdef |z|^2 ,&#10;\end{displaymath}&#10; --&gt;&lt;img width="403" height="31" border="0" src="https://technick.net/img/guide_dft/img167.png" alt="\" egin="" isplaymath="" overline="" isdef="" jy="" jy="" jy="" y="" sdef="" ert="" ert="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/more_notation_terminology"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/euler_s_formula"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Euler's Formula</title><link>https://technick.net/guides/theory/dft/euler_s_formula/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/euler_s_formula/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/elementary_relationships"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/de_moivre_s_theorem"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00354000000000000000"&gt;Euler's Formula&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;Since &lt;img width="78" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img15.png" alt="$z = x + jy$" /&gt; is the algebraic expression of &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt; in terms of its&#10;rectangular coordinates, the corresponding expression in terms of its polar&#10;coordinates is&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;z = r\cos(\theta) + j\,r\sin(\theta).&#10;\end{displaymath}&#10; --&gt;&lt;img width="181" height="31" border="0" src="https://technick.net/img/guide_dft/img168.png" alt="\" egin="" isplaymath="" r\cos="" theta="" j\="" sin="" heta="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;There is another, more powerful representation of &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt; in terms of its&#10;polar coordinates. In order to define it, we must introduce &lt;i&gt;Euler's&#10;Formula&lt;/i&gt;&lt;a name="3067"&gt;&lt;/a&gt;:&lt;br /&gt;&lt;div align="RIGHT"&gt;&lt;!-- MATH&#10; \begin{equation}&#10;\fbox{$\displaystyle e^{j\theta}=\cos(\theta)+j\sin(\theta)$}&#10;\end{equation}&#10; --&gt;&lt;table width="100%" align="CENTER"&gt;&lt;tr valign="MIDDLE"&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;a name="eq:euler"&gt;&lt;/a&gt;&lt;img width="181" height="39" border="0" src="https://technick.net/img/guide_dft/img169.png" alt="\" egin="" isplaymath="" box="" isplaystyle="" theta="" os="" heta="" sin="" heta="" nd="" isplaymath="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(2.1)&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;A proof of &lt;a href="https://technick.net/guides/theory/dft/proof_euler_s_identity"&gt;Euler's identity&lt;/a&gt; is given in the next chapter. &#10;Just note for the moment&#10;that for &lt;img width="41" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img170.png" alt="$\" heta="0$" /&gt;, we have &lt;!-- MATH&#10; $e^{j0}=\cos(0)+j\sin(0)=1+j0=1$&#10; --&gt;&lt;img width="250" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img171.png" alt="$e^{j0}=\" os="" sin="" /&gt;, as expected.&#10;Before, the only algebraic representation of a &lt;a href="https://technick.net/guides/theory/dft/introduction_complex_number"&gt;complex number&lt;/a&gt; we had was&lt;img width="78" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img15.png" alt="$z = x + jy$" /&gt;, which fundamentally uses Cartesian (rectilinear) coordinates in&#10;the &lt;a href="https://technick.net/guides/theory/dft/complex_plane"&gt;complex plane&lt;/a&gt;. Euler's identity gives us an alternative algebraic&#10;representation in terms of polar coordinates in the complex plane:&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\fbox{$\displaystyle z = re^{j\theta}$}&#10;\end{displaymath}&#10; --&gt;&lt;img width="76" height="35" border="0" src="https://technick.net/img/guide_dft/img172.png" alt="\" egin="" isplaymath="" box="" isplaystyle="" e="" theta="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;This representation often simplifies manipulations of complex numbers,&#10;especially when they are multiplied together. Simple rules of exponents&#10;can often be used in place of more difficult trigonometric identities.&#10;In the simplest case,&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;z_1 z_2 = \left(r_1 e^{j \theta_1}\right)&#10;&#9;\left(r_2 e^{j \theta_2}\right)&#10;&#9;= \left(r_1 r_2\right)\left(e^{j \theta_1} e^{j \theta_2}\right)&#10;&#9;= r_1 r_2 e^{j \left(\theta_1 + \theta_2\right)}&#10;\end{displaymath}&#10; --&gt;&lt;img width="444" height="33" border="0" src="https://technick.net/img/guide_dft/img173.png" alt="\" egin="" isplaymath="" z="" eft="" e="" theta="" ight="" eft="" e="" t="" a="" ight="" r="" j="" eft="" heta="" heta="" ight="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;A corollary of Euler's identity is obtained by setting &lt;img width="43" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img174.png" alt="$\" heta="\pi$" /&gt; to get&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;e^{j\pi} + 1 = 0&#10;\end{displaymath}&#10; --&gt;&lt;img width="87" height="28" border="0" src="https://technick.net/img/guide_dft/img175.png" alt="\" egin="" isplaymath="" j\pi="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;This has been called the ''most beautiful formula in mathematics'' due to&#10;the extremely simple form in which the fundamental constants &lt;img width="57" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img176.png" alt="$e, j, \" i="i" /&gt;, and &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img38.png" alt="$0$" /&gt; all appear.&lt;p&gt;For another example of manipulating the polar form of a complex number,&#10;let's again verify &lt;!-- MATH&#10; $z\overline{z} = \left|z\right|^2$&#10; --&gt;&lt;img width="66" height="38" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img177.png" alt="$z\" verline="" left\vert="" ight\vert="" /&gt;, as we did above, but this&#10;time using polar form:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;z \overline{z} = r e^{j \theta} r e^{-j \theta} = r^2 e^0 = r^2 = |z|^2 .&#10;\end{displaymath}&#10; --&gt;&lt;img width="264" height="31" border="0" src="https://technick.net/img/guide_dft/img178.png" alt="\" egin="" isplaymath="" overline="" r="" theta="" j="" heta="" e="" vert="" ert="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;We can now add a fourth line to that set of examples:&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;z/\overline{z} = \frac{r e^{j \theta}}{r e^{-j \theta}} = e^{j2\theta} = &#10;&#9;e^{j2\angle{z}}&#10;\end{displaymath}&#10; --&gt;&lt;img width="213" height="46" border="0" src="https://technick.net/img/guide_dft/img179.png" alt="\" egin="" isplaymath="" overline="" frac="" j="" heta="" j="" heta="" j2\theta="" j2\angle="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;Euler's identity can be used to derive formulas for sine and cosine in&#10;terms of &lt;img width="25" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img3.png" alt="$e^{j\" heta="" /&gt;:&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;e^{j \theta} + \overline{e^{j \theta}}&amp;=&amp;e^{j \theta} + e^{-j \theta}\\&#10;&amp;=&amp;\left[\cos(\theta) + j \sin(\theta)\right] + \left[\cos(\theta) - j \sin(\theta)\right]\\&#10;&amp;=&amp;2\cos(\theta),&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="399" height="84" border="0" src="https://technick.net/img/guide_dft/img180.png" alt="\" egin="" qnarray="" j="" heta="" verline="" j="" heta="" j="" heta="" j="" eft="" os="" heta="" sin="" heta="" ight="" os="" heta="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Similarly, &lt;!-- MATH&#10; $e^{j \theta} - \overline{e^{j \theta}} = 2j\, \sin(\theta)$&#10; --&gt;&lt;img width="146" height="38" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img181.png" alt="$e^{j \" heta="" verline="" j="" heta="" sin="" heta="" /&gt;, and&#10;we have&lt;div align="CENTER"&gt;&lt;img width="169" height="84" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img182.png" alt="\" box="" egin="" inipage="" n="" space="" n="" egin="" qnarray="" os="" heta="" j="" heta="" j="" heta="" isplaystyle="" end="" qnarray="" nd="" inipage="" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/elementary_relationships"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/de_moivre_s_theorem"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>De Moivre's Theorem</title><link>https://technick.net/guides/theory/dft/de_moivre_s_theorem/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/de_moivre_s_theorem/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/euler_s_formula"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/numerical_tools_matlab"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00355000000000000000"&gt;De Moivre's Theorem&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;As a more complicated example of the value of the polar form, we'll prove&lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/de_moivre_s_theorem"&gt;De Moivre's theorem&lt;/a&gt;&lt;/i&gt;:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\left[\cos(\theta) + j \sin(\theta)\right] ^n =&#10;\cos(n\theta) + j \sin(n\theta)&#10;\end{displaymath}&#10; --&gt;&lt;img width="306" height="31" border="0" src="https://technick.net/img/guide_dft/img183.png" alt="\" egin="" isplaymath="" eft="" os="" heta="" sin="" heta="" ight="" cos="" n\theta="" j="" in="" theta="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Working this out using sum-of-angle identities from trigonometry is&#10;laborious. However, using &lt;a href="https://technick.net/guides/theory/dft/proof_euler_s_identity"&gt;Euler's identity&lt;/a&gt;, De Moivre's theorem simply&#10;''falls out'':&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\left[\cos(\theta) + j \sin(\theta)\right] ^n =&#10;\left[e^{j\theta}\right] ^n = e^{j\theta n} =&#10;\cos(n\theta) + j \sin(n\theta)&#10;\end{displaymath}&#10; --&gt;&lt;img width="431" height="33" border="0" src="https://technick.net/img/guide_dft/img184.png" alt="\" egin="" isplaymath="" eft="" os="" heta="" sin="" heta="" ight="" left="" e="" j\theta="" right="" n="e^{j\theta" n="" os="" theta="" sin="" theta="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Moreover, by the power of the method used to show the result,&lt;img width="14" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img51.png" alt="$n$" /&gt; can be any real number, not just an integer.&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/euler_s_formula"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/numerical_tools_matlab"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Numerical Tools in Matlab</title><link>https://technick.net/guides/theory/dft/numerical_tools_matlab/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/numerical_tools_matlab/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/de_moivre_s_theorem"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/numerical_tools_mathematica"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00360000000000000000"&gt;Numerical Tools in Matlab&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;In &lt;a href="http://www.mathworks.com/access/helpdesk/help/techdoc/basics/getstarted.shtml"&gt;Matlab&lt;/a&gt;, root-finding is always numerical:&lt;a name="tex2html12" href="https://technick.net/guides/theory/dft/footnode#foot2922"&gt;&lt;sup&gt;2.3&lt;/sup&gt;&lt;/a&gt;&lt;pre&gt;&#10;&amp;gt;&amp;gt; % polynomial = array of coefficients in Matlab&#10;&amp;gt;&amp;gt; p = [1 0 0 0 5 7]; % p(x) = x^5 + 5*x + 7&#10;&amp;gt;&amp;gt; format long; % print double-precision&#10;&amp;gt;&amp;gt; roots(p) % print out the roots of p(x)&#10;&lt;p&gt;ans =&#10;1.30051917307206 + 1.10944723819596i&#10;1.30051917307206 - 1.10944723819596i&#10;-0.75504792501755 + 1.27501061923774i&#10;-0.75504792501755 - 1.27501061923774i&#10;-1.09094249610903&lt;/pre&gt;&lt;/p&gt;&lt;p&gt;Matlab has the following primitives for &lt;a href="https://technick.net/guides/theory/dft/introduction_complex_number"&gt;complex numbers&lt;/a&gt;:&lt;pre&gt;&#10;&amp;gt;&amp;gt; help j&lt;/p&gt;&#10;&lt;p&gt;J Imaginary unit.&#10;The variables i and j both initially have the value sqrt(-1)&#10;for use in forming complex quantities. For example, the&#10;expressions 3+2i, 3+2&lt;em&gt;i, 3+2i, 3+2&lt;/em&gt;j and 3+2*sqrt(-1).&#10;all have the same value. However, both i and j may be&#10;assigned other values, often in FOR loops and as subscripts.&lt;/p&gt;&#10;&lt;pre&gt;&lt;code&gt; See also I.&#10; Built-in function.&#10; Copyright (c) 1984-92 by The MathWorks, Inc.&#10;&lt;/code&gt;&lt;/pre&gt;&#10;&lt;p&gt;&amp;gt;&amp;gt; sqrt(-1)&lt;/p&gt;&#10;&lt;p&gt;ans =&#10;0 + 1.0000i&lt;/p&gt;&#10;&lt;p&gt;&amp;gt;&amp;gt; help real&lt;/p&gt;&#10;&lt;p&gt;REAL Complex real part.&#10;REAL(X) is the real part of X.&lt;/p&gt;&#10;&lt;pre&gt;&lt;code&gt; See also IMAG, CONJ, ANGLE, ABS.&#10;&lt;/code&gt;&lt;/pre&gt;&#10;&lt;p&gt;&amp;gt;&amp;gt; help imag&lt;/p&gt;&#10;&lt;p&gt;IMAG Complex imaginary part.&#10;IMAG(X) is the imaginary part of X.&#10;See I or J to enter complex numbers.&lt;/p&gt;&#10;&lt;pre&gt;&lt;code&gt; See also REAL, CONJ, ANGLE, ABS.&#10;&lt;/code&gt;&lt;/pre&gt;&#10;&lt;p&gt;&amp;gt;&amp;gt; help conj&lt;/p&gt;&#10;&lt;p&gt;CONJ Complex conjugate.&#10;CONJ(X) is the complex conjugate of X.&lt;/p&gt;&#10;&lt;p&gt;&amp;gt;&amp;gt; help abs&lt;/p&gt;&#10;&lt;p&gt;ABS Absolute value and string to numeric conversion.&#10;ABS(X) is the absolute value of the elements of X. When&#10;X is complex, ABS(X) is the complex modulus (magnitude) of&#10;the elements of X.&lt;/p&gt;&#10;&lt;pre&gt;&lt;code&gt; See also ANGLE, UNWRAP.&#10;&#10; ABS(S), where S is a MATLAB string variable, returns the&#10; numeric values of the ASCII characters in the string.&#10; It does not change the internal representation, only the&#10; way it prints.&#10; See also SETSTR.&#10;&lt;/code&gt;&lt;/pre&gt;&#10;&lt;p&gt;&amp;gt;&amp;gt; help angle&lt;/p&gt;&#10;&lt;p&gt;ANGLE Phase angle.&#10;ANGLE(H) returns the phase angles, in radians, of a &lt;a href="https://technick.net/guides/theory/dft/matrices"&gt;matrix&lt;/a&gt; with&#10;complex elements.&lt;/p&gt;&#10;&lt;pre&gt;&lt;code&gt; See also ABS, UNWRAP.&amp;lt;/pre&amp;gt;&amp;lt;/p&amp;gt;&amp;lt;p&amp;gt;Note how helpful the ''See also'' information is in Matlab.&amp;lt;/p&amp;gt;&amp;lt;p&amp;gt;Let's run through a few elementary manipulations of complex&#10;&lt;/code&gt;&lt;/pre&gt;&#10;&lt;p&gt;numbers in Matlab:&lt;pre&gt;&#10;&amp;gt;&amp;gt; x = 1; % Every symbol must have a value in Matlab&#10;&amp;gt;&amp;gt; y = 2;&#10;&amp;gt;&amp;gt; z = x + j * y&lt;/p&gt;&#10;&lt;p&gt;z =&#10;1.0000 + 2.0000i&lt;/p&gt;&#10;&lt;p&gt;&amp;gt;&amp;gt; 1/z&lt;/p&gt;&#10;&lt;p&gt;ans =&#10;0.2000 - 0.4000i&lt;/p&gt;&#10;&lt;p&gt;&amp;gt;&amp;gt; z^2&lt;/p&gt;&#10;&lt;p&gt;ans =&#10;-3.0000 + 4.0000i&lt;/p&gt;&#10;&lt;p&gt;&amp;gt;&amp;gt; conj(z)&lt;/p&gt;&#10;&lt;p&gt;ans =&#10;1.0000 - 2.0000i&lt;/p&gt;&#10;&lt;p&gt;&amp;gt;&amp;gt; z*conj(z)&lt;/p&gt;&#10;&lt;p&gt;ans =&#10;5&lt;/p&gt;&#10;&lt;p&gt;&amp;gt;&amp;gt; abs(z)^2&lt;/p&gt;&#10;&lt;p&gt;ans =&#10;5.0000&lt;/p&gt;&#10;&lt;p&gt;&amp;gt;&amp;gt; norm(z)^2&lt;/p&gt;&#10;&lt;p&gt;ans =&#10;5.0000&lt;/p&gt;&#10;&lt;p&gt;&amp;gt;&amp;gt; angle(z)&lt;/p&gt;&#10;&lt;p&gt;ans =&#10;1.1071&lt;/pre&gt;&lt;/p&gt;&lt;p&gt;Now let&amp;rsquo;s do polar form:&lt;pre&gt;&#10;&amp;gt;&amp;gt; r = abs(z)&lt;/p&gt;&#10;&lt;p&gt;r =&#10;2.2361&lt;/p&gt;&#10;&lt;p&gt;&amp;gt;&amp;gt; theta = angle(z)&lt;/p&gt;&#10;&lt;p&gt;theta =&#10;1.1071&lt;/p&gt;&#10;&lt;p&gt;&amp;gt;&amp;gt; r * exp(j * theta)&lt;/p&gt;&#10;&lt;p&gt;ans =&#10;1.0000 + 2.0000i&lt;/p&gt;&#10;&lt;p&gt;&amp;gt;&amp;gt; z&lt;/p&gt;&#10;&lt;p&gt;z =&#10;1.0000 + 2.0000i&lt;/p&gt;&#10;&lt;p&gt;&amp;gt;&amp;gt; z/abs(z)&lt;/p&gt;&#10;&lt;p&gt;ans =&#10;0.4472 + 0.8944i&lt;/p&gt;&#10;&lt;p&gt;&amp;gt;&amp;gt; exp(j*theta)&lt;/p&gt;&#10;&lt;p&gt;ans =&#10;0.4472 + 0.8944i&lt;/p&gt;&#10;&lt;p&gt;&amp;gt;&amp;gt; z/conj(z)&lt;/p&gt;&#10;&lt;p&gt;ans =&#10;-0.6000 + 0.8000i&lt;/p&gt;&#10;&lt;p&gt;&amp;gt;&amp;gt; exp(2&lt;em&gt;j&lt;/em&gt;theta)&lt;/p&gt;&#10;&lt;p&gt;ans =&#10;-0.6000 + 0.8000i&lt;/p&gt;&#10;&lt;p&gt;&amp;gt;&amp;gt; imag(log(z/abs(z)))&lt;/p&gt;&#10;&lt;p&gt;ans =&#10;1.1071&lt;/p&gt;&#10;&lt;p&gt;&amp;gt;&amp;gt; theta&lt;/p&gt;&#10;&lt;p&gt;theta =&#10;1.1071&lt;/p&gt;&#10;&lt;p&gt;&amp;gt;&amp;gt;&lt;/pre&gt;&lt;/p&gt;&lt;p&gt;Some manipulations involving two complex numbers:&lt;pre&gt;&#10;&amp;gt;&amp;gt; x1 = 1;&#10;&amp;gt;&amp;gt; x2 = 2;&#10;&amp;gt;&amp;gt; y1 = 3;&#10;&amp;gt;&amp;gt; y2 = 4;&#10;&amp;gt;&amp;gt; z1 = x1 + j * y1;&#10;&amp;gt;&amp;gt; z2 = x2 + j * y2;&#10;&amp;gt;&amp;gt; z1&lt;/p&gt;&#10;&lt;p&gt;z1 =&#10;1.0000 + 3.0000i&lt;/p&gt;&#10;&lt;p&gt;&amp;gt;&amp;gt; z2&lt;/p&gt;&#10;&lt;p&gt;z2 =&#10;2.0000 + 4.0000i&lt;/p&gt;&#10;&lt;p&gt;&amp;gt;&amp;gt; z1*z2&lt;/p&gt;&#10;&lt;p&gt;ans =&#10;-10.0000 +10.0000i&lt;/p&gt;&#10;&lt;p&gt;&amp;gt;&amp;gt; z1/z2&lt;/p&gt;&#10;&lt;p&gt;ans =&#10;0.7000 + 0.1000i&lt;/pre&gt;&lt;/p&gt;&lt;p&gt;Another thing to note about Matlab is that the transpose operator '&#10;(for vectors and &lt;a href="https://technick.net/guides/theory/dft/matrices"&gt;matrices&lt;/a&gt;) conjugates as well as transposes. Use .'&#10;to transpose without conjugation:&lt;pre&gt;&#10;&amp;gt;&amp;gt;x = [1:4]*j&lt;/p&gt;&#10;&lt;p&gt;x =&#10;0 + 1.0000i 0 + 2.0000i 0 + 3.0000i 0 + 4.0000i&lt;/p&gt;&#10;&lt;p&gt;&amp;gt;&amp;gt; x'&lt;/p&gt;&#10;&lt;p&gt;ans =&#10;0 - 1.0000i&#10;0 - 2.0000i&#10;0 - 3.0000i&#10;0 - 4.0000i&lt;/p&gt;&#10;&lt;p&gt;&amp;gt;&amp;gt; x.'&lt;/p&gt;&#10;&lt;p&gt;ans =&#10;0 + 1.0000i&#10;0 + 2.0000i&#10;0 + 3.0000i&#10;0 + 4.0000i&lt;/p&gt;&#10;&lt;p&gt;&amp;gt;&amp;gt;&lt;/pre&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/de_moivre_s_theorem"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;  &lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;  &lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;  &lt;a href="https://technick.net/guides/theory/dft/numerical_tools_mathematica"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Numerical Tools in Mathematica</title><link>https://technick.net/guides/theory/dft/numerical_tools_mathematica/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/numerical_tools_mathematica/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/numerical_tools_matlab"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/proof_euler_s_identity"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00370000000000000000"&gt;Numerical Tools in Mathematica&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;In &lt;a href="https://technick.net/guides/theory/dft/sidebar_mathematica"&gt;Mathematica&lt;/a&gt;, we can find the roots of simple polynomials in closed&#10;form, while larger polynomials can be factored numerically in either&lt;a href="http://www.mathworks.com/access/helpdesk/help/techdoc/basics/getstarted.shtml"&gt;Matlab&lt;/a&gt; or Mathematica. Look to Mathematica to provide the most&#10;sophisticated symbolic mathematical manipulation, and look for Matlab&#10;to provide the best numerical algorithms, as a general rule.&lt;/p&gt;&lt;p&gt;One way to implicitly find the roots of a polynomial is to &lt;i&gt;factor&lt;/i&gt; it&#10;in Mathematica:&lt;pre&gt;&#10;In[1]:&#10; p[x_] := x^2 + 5 x + 6&#10;In[2]:&#10; Factor[p[x]]&#10;Out[2]:&#10; (2 + x)*(3 + x)&lt;/pre&gt;Factor[] works only with exact Integers or Rational coefficients, not with&#10;Real numbers.&lt;/p&gt;&lt;p&gt;Alternatively, we can explicitly solve for the roots of low-order&#10;polynomials in Mathematica:&lt;pre&gt;&#10;In[1]:&#10; p[x_] := a x^2 + b x + c&#10;In[2]:&#10; Solve[p[x]==0,x]&#10;Out[2]:&#10; {{x -&amp;gt; (-(b/a) + (b^2/a^2 - (4*c)/a)^(1/2))/2},&#10; {x -&amp;gt; (-(b/a) - (b^2/a^2 - (4*c)/a)^(1/2))/2}}&lt;/pre&gt;&lt;/p&gt;&lt;p&gt;Closed-form solutions work for polynomials of order one through four.&#10;Higher orders, in general, must be dealt with numerically, as shown below:&lt;pre&gt;&#10;In[1]:&#10; p[x_] := x^5 + 5 x + 7&#10;In[2]:&#10; Solve[p[x]==0,x]&#10;Out[2]:&#10; {ToRules[Roots[5*x + x^5 == -7, x]]}&#10;In[3]:&#10; N[Solve[p[x]==0,x]]&#10;Out[3]:&#10; {{x -&amp;gt; -1.090942496109028},&#10; {x -&amp;gt; -0.7550479250175501 - 1.275010619237742*I},&#10; {x -&amp;gt; -0.7550479250175501 + 1.275010619237742*I},&#10; {x -&amp;gt; 1.300519173072064 - 1.109447238195959*I},&#10; {x -&amp;gt; 1.300519173072064 + 1.109447238195959*I}}&lt;/pre&gt;&lt;/p&gt;&lt;p&gt;Mathematica has the following primitives for dealing with &lt;a href="https://technick.net/guides/theory/dft/introduction_complex_number"&gt;complex numbers&lt;/a&gt;(The ''?'' operator returns a short description of the symbol to its right):&lt;pre&gt;&#10;In[1]:&#10; ?I&#10;Out[1]:&#10; I represents the imaginary unit Sqrt[-1].&#10;In[2]:&#10; ?Re&#10;Out[2]:&#10; Re[z] gives the real part of the complex number z.&#10;In[3]:&#10; ?Im&#10;Out[3]:&#10; Im[z] gives the imaginary part of the complex number z.&#10;In[4]:&#10; ?Conj*&#10;Out[4]:&#10; Conjugate[z] gives the complex conjugate of the complex number z.&#10;In[5]:&#10; ?Abs&#10;Out[5]:&#10; Abs[z] gives the absolute value of the real or complex number z.&#10;In[6]:&#10; ?Arg&#10;Out[6]:&#10; Arg[z] gives the argument of z.&lt;/pre&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/numerical_tools_matlab"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/proof_euler_s_identity"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Proof of Euler's Identity</title><link>https://technick.net/guides/theory/dft/proof_euler_s_identity/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/proof_euler_s_identity/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/numerical_tools_mathematica"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/euler_s_theorem"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00400000000000000000"&gt;Proof of Euler's Identity&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;This chapter outlines the proof of &lt;a href="https://technick.net/guides/theory/dft/proof_euler_s_identity"&gt;Euler's Identity&lt;/a&gt;, which is an&#10;important tool for working with &lt;a href="https://technick.net/guides/theory/dft/introduction_complex_number"&gt;complex numbers&lt;/a&gt;. It is one of the&#10;critical elements of the &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;DFT&lt;/a&gt; definition that we need to understand.&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;hr /&gt;&lt;!--Table of Child-Links--&gt;&lt;a name="CHILD_LINKS"&gt;&lt;strong&gt;Subsections&lt;/strong&gt;&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html595" href="https://technick.net/guides/theory/dft/euler_s_theorem"&gt;Euler's Theorem&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html596" href="https://technick.net/guides/theory/dft/positive_integer_exponents"&gt;Positive Integer Exponents&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html597" href="https://technick.net/guides/theory/dft/properties_exponents"&gt;Properties of Exponents&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html598" href="https://technick.net/guides/theory/dft/exponent_zero"&gt;The Exponent Zero&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html599" href="https://technick.net/guides/theory/dft/negative_exponents"&gt;Negative Exponents&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html600" href="https://technick.net/guides/theory/dft/rational_exponents"&gt;Rational Exponents&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html601" href="https://technick.net/guides/theory/dft/special_case_mth"&gt;Special Case: The Mth Roots of Unity&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html602" href="https://technick.net/guides/theory/dft/real_exponents"&gt;Real Exponents&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html603" href="https://technick.net/guides/theory/dft/first_look_at"&gt;A First Look at Taylor Series&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html604" href="https://technick.net/guides/theory/dft/imaginary_exponents"&gt;Imaginary Exponents&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html605" href="https://technick.net/guides/theory/dft/derivatives_f_x_a_x"&gt;Derivatives of f(x)=a^x&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html606" href="https://technick.net/guides/theory/dft/back_e"&gt;Back to &lt;i&gt;e&lt;/i&gt;&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html607" href="https://technick.net/guides/theory/dft/sidebar_mathematica"&gt;Sidebar on Mathematica&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html608" href="https://technick.net/guides/theory/dft/back_e_j_theta"&gt;Back to e^(j theta)&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html609" href="https://technick.net/guides/theory/dft/informal_derivation_taylor"&gt;Informal Derivation of &lt;i&gt;Taylor Series Expansion&lt;/i&gt;&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html610" href="https://technick.net/guides/theory/dft/derivation_taylor_series"&gt;Derivation of Taylor Series Expansion with Remainder&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html611" href="https://technick.net/guides/theory/dft/formal_statement_taylor_s"&gt;Formal Statement of Taylor's Theorem&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html612" href="https://technick.net/guides/theory/dft/weierstrass_polynomial_appr"&gt;The Weierstrass (Polynomial) Approximation Theorem&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html613" href="https://technick.net/guides/theory/dft/further_notes_differentiabi"&gt;Further Notes on Differentiability of Audio Signals&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;!--End of Table of Child-Links--&gt;&#10;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/numerical_tools_mathematica"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/euler_s_theorem"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Euler's Theorem</title><link>https://technick.net/guides/theory/dft/euler_s_theorem/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/euler_s_theorem/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/proof_euler_s_identity"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/positive_integer_exponents"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00410000000000000000"&gt;Euler's Theorem&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;&lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/proof_euler_s_identity"&gt;Euler's Theorem&lt;/a&gt;&lt;/i&gt;&lt;a name="3937"&gt;&lt;/a&gt; (or ''identity'' or ''formula'') is&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;e^{j\theta} = \cos(\theta) + j\sin(\theta) \qquad\qquad \mbox{(Euler's Identity)}&#10;\end{displaymath}&#10; --&gt;&lt;img width="370" height="31" border="0" src="https://technick.net/img/guide_dft/img185.png" alt="\" egin="" isplaymath="" j\theta="" os="" heta="" sin="" heta="" quad\qquad="" box="" uler="" s="" entity="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;To ''prove'' this, we must first define what we mean by ''&lt;img width="25" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img3.png" alt="$e^{j\" heta="" /&gt;.''&#10;(The right-hand side is assumed to be understood.) Since &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img61.png" alt="$e$" /&gt; is just a&#10;particular number, we only really have to explain what we mean by &lt;a href="https://technick.net/guides/theory/dft/imaginary_exponents"&gt;imaginary&#10;exponents&lt;/a&gt;. (We'll also see where &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img61.png" alt="$e$" /&gt; comes from in the process.)&#10;Imaginary exponents will be obtained as a generalization of &lt;a href="https://technick.net/guides/theory/dft/real_exponents"&gt;real exponents&lt;/a&gt;.&#10;Therefore, our first task is to define exactly what we mean by &lt;img width="21" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img186.png" alt="$a^x$" /&gt;, where&lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; is any real number, and &lt;img width="42" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img187.png" alt="$a&amp;gt;0$" /&gt; is any positive real number.&lt;p&gt;&lt;br /&gt;&lt;hr /&gt;&lt;!--Table of Child-Links--&gt;&lt;a name="CHILD_LINKS"&gt;&lt;strong&gt;Subsections&lt;/strong&gt;&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html626" href="https://technick.net/guides/theory/dft/positive_integer_exponents"&gt;Positive Integer Exponents&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html627" href="https://technick.net/guides/theory/dft/properties_exponents"&gt;Properties of Exponents&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html628" href="https://technick.net/guides/theory/dft/exponent_zero"&gt;The Exponent Zero&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html629" href="https://technick.net/guides/theory/dft/negative_exponents"&gt;Negative Exponents&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html630" href="https://technick.net/guides/theory/dft/rational_exponents"&gt;Rational Exponents&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html631" href="https://technick.net/guides/theory/dft/special_case_mth"&gt;Special Case: The Mth Roots of Unity&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html632" href="https://technick.net/guides/theory/dft/real_exponents"&gt;Real Exponents&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html633" href="https://technick.net/guides/theory/dft/first_look_at"&gt;A First Look at Taylor Series&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html634" href="https://technick.net/guides/theory/dft/imaginary_exponents"&gt;Imaginary Exponents&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html635" href="https://technick.net/guides/theory/dft/derivatives_f_x_a_x"&gt;Derivatives of f(x)=a^x&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html636" href="https://technick.net/guides/theory/dft/back_e"&gt;Back to &lt;i&gt;e&lt;/i&gt;&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html637" href="https://technick.net/guides/theory/dft/sidebar_mathematica"&gt;Sidebar on Mathematica&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html638" href="https://technick.net/guides/theory/dft/back_e_j_theta"&gt;Back to e^(j theta)&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;!--End of Table of Child-Links--&gt;&#10;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/proof_euler_s_identity"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/positive_integer_exponents"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Positive Integer Exponents</title><link>https://technick.net/guides/theory/dft/positive_integer_exponents/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/positive_integer_exponents/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/euler_s_theorem"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/properties_exponents"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00411000000000000000"&gt;Positive Integer Exponents&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;The ''original'' definition of exponents which ''actually makes sense''&#10;applies only to positive integer exponents:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\fbox{$\displaystyle a^n \isdef \underbrace{a\cdot a \cdot a \cdot \cdots \cdot a}_{\mbox{$n$\ times}}$}&#10;\end{displaymath}&#10; --&gt;&lt;img width="163" height="66" border="0" src="https://technick.net/img/guide_dft/img188.png" alt="\" egin="" isplaymath="" box="" isplaystyle="" isdef="" nderbrace="" cdot="" dot="" dot="" dots="" dot="" box="" times="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where &lt;img width="42" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img187.png" alt="$a&amp;gt;0$" /&gt; is real. &lt;p&gt;Generalizing this definition involves first noting its abstract&#10;mathematical properties, and then making sure these properties are&#10;preserved in the generalization.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/euler_s_theorem"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/properties_exponents"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Properties of Exponents</title><link>https://technick.net/guides/theory/dft/properties_exponents/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/properties_exponents/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/positive_integer_exponents"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/exponent_zero"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00412000000000000000"&gt;Properties of Exponents&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;From the basic definition of positive integer exponents, we have&lt;dl compact="compact"&gt;&lt;dt&gt;(1)&lt;/dt&gt;&lt;dd&gt;&lt;!-- MATH&#10; $a^{n_1} a^{n_2} = a^{n_1 + n_2}$&#10; --&gt;&lt;img width="119" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img189.png" alt="$a^{n_1} a^{n_2} = a^{n_1 + n_2}$" /&gt;&lt;/dd&gt;&lt;dt&gt;(2)&lt;/dt&gt;&lt;dd&gt;&lt;!-- MATH&#10; $\left(a^{n_1}\right)^{n_2} = a^{n_1 n_2}$&#10; --&gt;&lt;img width="113" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img190.png" alt="$\" eft="" a="" right="" a="a" n="" /&gt;&lt;/dd&gt;&lt;/dl&gt;Note that property (2) implies property (1). We list&#10;it explicitly for convenience below.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/positive_integer_exponents"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/exponent_zero"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>The Exponent Zero</title><link>https://technick.net/guides/theory/dft/exponent_zero/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/exponent_zero/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/properties_exponents"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/negative_exponents"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00413000000000000000"&gt;The Exponent Zero&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;What should &lt;img width="20" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img191.png" alt="$a^0$" /&gt; be? Multiplying it by &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img192.png" alt="$a$" /&gt; gives&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;a^0 \cdot a = a^0 a^1 = a^{0+1} = a^1 = a&#10;\end{displaymath}&#10; --&gt;&lt;img width="228" height="26" border="0" src="https://technick.net/img/guide_dft/img193.png" alt="\" egin="" isplaymath="" a="" dot="" a="" a="" a="" a="" a="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;by property (1) of exponents. Solving &lt;!-- MATH&#10; $a^0 \cdot a = a$&#10; --&gt;&lt;img width="69" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img194.png" alt="$a^0 \" dot="" a="" /&gt; for &lt;img width="20" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img191.png" alt="$a^0$" /&gt; then&#10;gives&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\fbox{$\displaystyle a^0 = 1$}&#10;\end{displaymath}&#10; --&gt;&lt;img width="62" height="34" border="0" src="https://technick.net/img/guide_dft/img195.png" alt="\" egin="" isplaymath="" box="" isplaystyle="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Again, we must have &lt;img width="42" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img187.png" alt="$a&amp;gt;0$" /&gt; for this to make sense.&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/properties_exponents"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/negative_exponents"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Negative Exponents</title><link>https://technick.net/guides/theory/dft/negative_exponents/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/negative_exponents/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/exponent_zero"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/rational_exponents"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00414000000000000000"&gt;Negative Exponents&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;What should &lt;img width="30" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img196.png" alt="$a^{-1}$" /&gt; be? Multiplying it by &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img192.png" alt="$a$" /&gt; gives&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;a^{-1} \cdot a = a^{-1} a^1 = a^{-1+1} = a^0 = 1&#10;\end{displaymath}&#10; --&gt;&lt;img width="260" height="26" border="0" src="https://technick.net/img/guide_dft/img197.png" alt="\" egin="" isplaymath="" a="" dot="" a="" a="" a="" a="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Solving &lt;!-- MATH&#10; $a^{-1} \cdot a = 1$&#10; --&gt;&lt;img width="79" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img198.png" alt="$a^{-1} \" dot="" /&gt; for &lt;img width="30" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img196.png" alt="$a^{-1}$" /&gt; then gives&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\fbox{$\displaystyle a^{-1} = \frac{1}{a}$}&#10;\end{displaymath}&#10; --&gt;&lt;img width="77" height="54" border="0" src="https://technick.net/img/guide_dft/img199.png" alt="\" egin="" isplaymath="" box="" isplaystyle="" rac="" a="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;Similarly, we obtain&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\fbox{$\displaystyle a^{-M} = \frac{1}{a^M}$}&#10;\end{displaymath}&#10; --&gt;&lt;img width="101" height="54" border="0" src="https://technick.net/img/guide_dft/img200.png" alt="\" egin="" isplaymath="" box="" isplaystyle="" frac="" a="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;for all integer values of &lt;img width="21" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img201.png" alt="$M$" /&gt;, i.e., &lt;!-- MATH&#10; $\forall M\in{\cal Z}$&#10; --&gt;&lt;img width="62" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img202.png" alt="$\" orall="" n="" al="" /&gt;.&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/exponent_zero"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/rational_exponents"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Rational Exponents</title><link>https://technick.net/guides/theory/dft/rational_exponents/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/rational_exponents/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/negative_exponents"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/special_case_mth"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00415000000000000000"&gt;Rational Exponents&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;A &lt;i&gt;rational&lt;/i&gt;&lt;a name="3953"&gt;&lt;/a&gt; number is a real number that can be expressed as&#10;a ratio of two &lt;i&gt;integers&lt;/i&gt;:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;x = \frac{L}{M}, \quad L\in{\cal Z},\; M\in{\cal Z}&#10;\end{displaymath}&#10; --&gt;&lt;img width="196" height="43" border="0" src="https://technick.net/img/guide_dft/img203.png" alt="\" egin="" isplaymath="" frac="" l="" m="" quad="" n="" al="" in="" al="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Applying property (2) of exponents, we have&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;a^x = a^{L/M} = \left(a^{\frac{1}{M}}\right)^L&#10;\end{displaymath}&#10; --&gt;&lt;img width="163" height="43" border="0" src="https://technick.net/img/guide_dft/img204.png" alt="\" egin="" isplaymath="" a="" a="" l="" m="" left="" a="" rac="" right="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Thus, the only thing new is &lt;img width="39" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img205.png" alt="$a^{1/M}$" /&gt;. Since&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\left(a^{\frac{1}{M}}\right)^M = a^{\frac{M}{M}} = a&#10;\end{displaymath}&#10; --&gt;&lt;img width="143" height="43" border="0" src="https://technick.net/img/guide_dft/img206.png" alt="\" egin="" isplaymath="" eft="" a="" rac="" right="" a="" frac="" m="" m="" a="a" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;we see that &lt;img width="39" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img205.png" alt="$a^{1/M}$" /&gt; is the &lt;img width="21" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img201.png" alt="$M$" /&gt;th root of &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img192.png" alt="$a$" /&gt;. &#10;This is sometimes written&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;a^{\frac{1}{M}} \isdef \sqrt[M]{a}&#10;\end{displaymath}&#10; --&gt;&lt;img width="82" height="30" border="0" src="https://technick.net/img/guide_dft/img207.png" alt="\" egin="" isplaymath="" a="" rac="" isdef="" qrt="" a="a" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;The &lt;img width="21" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img201.png" alt="$M$" /&gt;th root of a real (or complex) number is not unique. As we all&#10;know, square roots give two values (e.g., &lt;img width="67" height="36" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img208.png" alt="$\" qrt="" m2="" /&gt;). In the general case&#10;of &lt;img width="21" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img201.png" alt="$M$" /&gt;th roots, there are &lt;img width="21" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img201.png" alt="$M$" /&gt; distinct values, in general.&lt;p&gt;How do we come up with &lt;img width="21" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img201.png" alt="$M$" /&gt; &lt;i&gt;different&lt;/i&gt; numbers which when raised to&#10;the &lt;img width="21" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img201.png" alt="$M$" /&gt;th power will yield &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img192.png" alt="$a$" /&gt;? The answer is to consider &lt;i&gt;complex&lt;/i&gt;numbers in &lt;i&gt;polar form&lt;/i&gt;&lt;a name="3957"&gt;&lt;/a&gt;. By &lt;a href="https://technick.net/guides/theory/dft/proof_euler_s_identity"&gt;Euler's Identity&lt;/a&gt;, the real number &lt;img width="42" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img187.png" alt="$a&amp;gt;0$" /&gt;can be expressed, for any integer &lt;img width="13" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img53.png" alt="$k$" /&gt;, as &lt;!-- MATH&#10; $a \cdot e^{j 2\pi k} = a \cdot&#10;\cos(2\pi k) + j \cdot a \cdot \sin(2\pi k) = a + j\cdot a\cdot 0 = a$&#10; --&gt;&lt;img width="403" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img209.png" alt="$a \" dot="" pi="" a="" dot="" os="" i="" cdot="" dot="" in="" i="" a="" cdot="" dot="" a="" /&gt;.&#10;Using this form for &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img192.png" alt="$a$" /&gt;, the number &lt;img width="39" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img205.png" alt="$a^{1/M}$" /&gt; can be written as&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;a^{\frac{1}{M}} = a^{\frac{1}{M}} e^{j\frac{k}{M}2\pi}&#10;\end{displaymath}&#10; --&gt;&lt;img width="123" height="26" border="0" src="https://technick.net/img/guide_dft/img210.png" alt="\" egin="" isplaymath="" a="" rac="" a="a" frac="" e="" frac="" m="" i="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;We can now see that we get a &lt;i&gt;different &lt;a href="https://technick.net/guides/theory/dft/introduction_complex_number"&gt;complex number&lt;/a&gt;&lt;/i&gt; for each&#10;&lt;!-- MATH&#10; $k=0,1,2,3,\ldots,M-1$&#10; --&gt;&lt;img width="167" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img211.png" alt="$k=0,1,2,3,\" dots="" /&gt;. When &lt;img width="51" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img212.png" alt="$k=M$" /&gt;, we get the same thing as when &lt;img width="42" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img213.png" alt="$k=0$" /&gt;.&#10;When &lt;img width="79" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img214.png" alt="$k=M+1$" /&gt;, we get the same thing as when &lt;img width="42" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img215.png" alt="$k=1$" /&gt;, and so on, so there are&#10;only &lt;img width="21" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img201.png" alt="$M$" /&gt; cases using this construct. The &lt;img width="21" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img201.png" alt="$M$" /&gt;th root for &lt;img width="42" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img215.png" alt="$k=1$" /&gt; can be&#10;called the ''primitive &lt;img width="21" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img201.png" alt="$M$" /&gt;th root of &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img192.png" alt="$a$" /&gt;'', since integer powers of it give&#10;all of the others.&lt;p&gt;&lt;br /&gt;&lt;hr /&gt;&lt;!--Table of Child-Links--&gt;&lt;a name="CHILD_LINKS"&gt;&lt;strong&gt;Subsections&lt;/strong&gt;&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html699" href="https://technick.net/guides/theory/dft/special_case_mth"&gt;Special Case: The Mth Roots of Unity&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;!--End of Table of Child-Links--&gt;&#10;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/negative_exponents"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/special_case_mth"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Special Case: The Mth Roots of Unity</title><link>https://technick.net/guides/theory/dft/special_case_mth/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/special_case_mth/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/rational_exponents"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/real_exponents"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;&lt;a name="SECTION00415100000000000000"&gt;Special Case: The Mth Roots of Unity&lt;/a&gt;&lt;/h3&gt;&lt;p&gt;If &lt;img width="42" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img113.png" alt="$a=1$" /&gt;, we have&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;1^{\frac{k}{M}} = e^{j\frac{k}{M}2\pi}, \quad k=0,1,2,3,\ldots,M-1&#10;\end{displaymath}&#10; --&gt;&lt;img width="301" height="30" border="0" src="https://technick.net/img/guide_dft/img216.png" alt="\" egin="" isplaymath="" rac="" m="" j\frac="" m="" i="" uad="" dots="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;The &lt;img width="21" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img201.png" alt="$M$" /&gt;th &lt;a href="https://technick.net/guides/theory/dft/special_case_mth"&gt;roots of unity&lt;/a&gt; play an important role in the Discrete Fourier&#10;Transform. They are so important that they often have a special notation&#10;in the signal processing literature:&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;W_M \isdef e^{j\frac{2\pi}{M}}&#10;\end{displaymath}&#10; --&gt;&lt;img width="86" height="29" border="0" src="https://technick.net/img/guide_dft/img217.png" alt="\" egin="" isplaymath="" m="" sdef="" frac="" i="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;In this notation, the &lt;img width="21" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img201.png" alt="$M$" /&gt; roots of unity can be expressed simply as&lt;img width="33" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img218.png" alt="$W_M^k$" /&gt;, for &lt;!-- MATH&#10; $k=0,1,2,\ldots,M-1$&#10; --&gt;&lt;img width="152" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img219.png" alt="$k=0,1,2,\" dots="" /&gt;.&lt;p&gt;We may also call &lt;img width="33" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img220.png" alt="$W_M$" /&gt; the &lt;i&gt;generator&lt;/i&gt; of the mathematical&lt;i&gt;group&lt;/i&gt; consisting of the &lt;img width="21" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img201.png" alt="$M$" /&gt;th roots of unity and their products.&lt;/p&gt;&lt;p&gt;We will learn later that the &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt;th roots of unity are used to generate all&#10;the &lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;sinusoids&lt;/a&gt; used by the &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;DFT&lt;/a&gt; and its inverse. The &lt;img width="13" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img53.png" alt="$k$" /&gt;th sinusoid&#10;is given by&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;W_N^{kn} = e^{j2\pi k n/N} \isdef e^{j\omega_k t_n} &#10;= \cos(\omega_k t_n) + j \sin(\omega_k t_n),&#10;&#9;\quad n=0,1,2,\ldots,N-1&#10;\end{displaymath}&#10; --&gt;&lt;img width="582" height="31" border="0" src="https://technick.net/img/guide_dft/img221.png" alt="\" egin="" isplaymath="" n="" n="" j2\pi="" n="" sdef="" omega="" n="" os="" mega="" n="" sin="" mega="" n="" uad="" dots="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where &lt;!-- MATH&#10; $\omega_k \isdef 2\pi k/NT$&#10; --&gt;&lt;img width="103" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img222.png" alt="$\" mega="" isdef="" i="" t="" /&gt;, &lt;img width="61" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img223.png" alt="$t_n \" sdef="" /&gt;, and &lt;img width="16" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img224.png" alt="$T$" /&gt; is the &lt;a href="https://technick.net/guides/theory/dft/shannon_s_sampling_theorem"&gt;sampling&#10;interval&lt;/a&gt; in seconds.&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/rational_exponents"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/real_exponents"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Real Exponents</title><link>https://technick.net/guides/theory/dft/real_exponents/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/real_exponents/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/special_case_mth"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/first_look_at"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00416000000000000000"&gt;Real Exponents&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;The closest we can actually get to most real numbers is to compute a&lt;i&gt;rational number&lt;/i&gt; that is as close as we need. It can be shown that&#10;rational numbers are &lt;i&gt;dense&lt;/i&gt; in the real numbers; that is,&#10;between every two real numbers there is a rational number, and between&#10;every two rational numbers is a real number. An&lt;i&gt;irrational&lt;/i&gt;&lt;a name="3959"&gt;&lt;/a&gt; number can be defined as any real&#10;number having a non-repeating decimal expansion. For example,&lt;img width="25" height="36" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img225.png" alt="$\" qrt="" /&gt; is an irrational real number whose decimal expansion starts&#10;out as&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\sqrt{2} = &#10;1.4142135623730950488016887242096980785696718753769480731766797379907324784621070\ldots&#10;\end{displaymath}&#10; --&gt;&lt;img width="778" height="28" border="0" src="https://technick.net/img/guide_dft/img226.png" alt="\" egin="" isplaymath="" qrt="" dots="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;(computed via &lt;tt&gt;N[Sqrt[2],80]&lt;/tt&gt; in &lt;a href="https://technick.net/guides/theory/dft/sidebar_mathematica"&gt;Mathematica&lt;/a&gt;). Every truncated,&#10;rounded, or repeating expansion is a &lt;i&gt;rational&lt;/i&gt; number. That is, it&#10;can be rewritten as an integer divided by another integer. For example,&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;1.414 = \frac{1,414}{1000}&#10;\end{displaymath}&#10; --&gt;&lt;img width="108" height="42" border="0" src="https://technick.net/img/guide_dft/img227.png" alt="\" egin="" isplaymath="" rac="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;and, using &lt;!-- MATH&#10; $\overline{\mbox{overbar}}$&#10; --&gt;&lt;img width="56" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img228.png" alt="$\" verline="" box="" verbar="" /&gt; to denote the repeating part of a&#10;decimal expansion,&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;x = 0.\overline{123} &#10;\quad\Rightarrow\quad 1000x = 123.\overline{123} = 123 + x&#10;\quad\Rightarrow\quad 999x = 123&#10;\quad\Rightarrow\quad x = \frac{123}{999}&#10;\end{displaymath}&#10; --&gt;&lt;img width="617" height="42" border="0" src="https://technick.net/img/guide_dft/img229.png" alt="\" egin="" isplaymath="" overline="" quad\rightarrow\quad="" ove="" rrow\quad="" quad\rightarrow\quad="" rac="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Other examples of irrational numbers include&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;\pi &amp;=&amp; 3.1415926535897932384626433832795028841971693993751058209749445923078164062862090\ldots \\&#10; e &amp;=&amp; 2.7182818284590452353602874713526624977572470936999595749669676277240766303535476\ldots&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="791" height="53" border="0" src="https://technick.net/img/guide_dft/img230.png" alt="\" egin="" qnarray="" i="" dots="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;Let &lt;img width="22" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img231.png" alt="${\" at="" /&gt; denote the &lt;img width="14" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img51.png" alt="$n$" /&gt;-digit decimal expansion of an arbitrary real&#10;number &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt;. Then &lt;img width="22" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img231.png" alt="${\" at="" /&gt; is a rational number (some integer over &lt;img width="29" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img232.png" alt="$10^n$" /&gt;).&#10;We can say&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\lim_{n\to\infty} {\hat x}_n = x&#10;\end{displaymath}&#10; --&gt;&lt;img width="93" height="39" border="0" src="https://technick.net/img/guide_dft/img233.png" alt="\" egin="" isplaymath="" im="" to\infty="" at="" x="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Since &lt;!-- MATH&#10; $a^{{\hat x}_n}$&#10; --&gt;&lt;img width="28" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img234.png" alt="$a^{{\" at="" /&gt; is defined for all &lt;img width="14" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img51.png" alt="$n$" /&gt;, it is straightforward to define&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;a^x \isdef \lim_{n\to\infty} a^{{\hat x}_n}&#10;\end{displaymath}&#10; --&gt;&lt;img width="106" height="39" border="0" src="https://technick.net/img/guide_dft/img235.png" alt="\" egin="" isplaymath="" a="" isdef="" im="" to\infty="" a="" at="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/special_case_mth"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/first_look_at"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>A First Look at Taylor Series</title><link>https://technick.net/guides/theory/dft/first_look_at/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/first_look_at/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/real_exponents"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/imaginary_exponents"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00417000000000000000"&gt;A First Look at Taylor Series&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;Any ''smooth'' function &lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img236.png" alt="$f(x)$" /&gt; can be expanded in the form of a &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/first_look_at"&gt;Taylor&#10;series&lt;/a&gt;&lt;/i&gt;:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;f(x) = f(x_0) + \frac{f^\prime(x_0)}{1}(x-x_0) &#10;&#9;+ \frac{f^{\prime\prime}(x_0)}{1\cdot 2}(x-x_0)^2 &#10;&#9;+ \frac{f^{\prime\prime\prime}(x_0)}{1\cdot 2\cdot 3}(x-x_0)^3 &#10;&#9;+ \cdots .&#10;\end{displaymath}&#10; --&gt;&lt;img width="584" height="44" border="0" src="https://technick.net/img/guide_dft/img237.png" alt="\" egin="" isplaymath="" x="" x="" rac="" prime="" x-x="" rac="" rime\prime\prime="" cdot="" dot="" x="" dots="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;This can be written more compactly as&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;f(x) = \sum_{n=0}^\infty \frac{f^{(n)}(x_0)}{n!}(x-x_0)^n .&#10;\end{displaymath}&#10; --&gt;&lt;img width="231" height="58" border="0" src="https://technick.net/img/guide_dft/img238.png" alt="\" egin="" isplaymath="" x="" um="" infty="" rac="" n="" n="" x="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;An informal derivation of this formula for &lt;img width="49" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img239.png" alt="$x_0=0$" /&gt; is given in&#10;&amp;sect;&lt;a href="https://technick.net/guides/theory/dft/informal_derivation_taylor#sec:A"&gt;3.2&lt;/a&gt; and &amp;sect;&lt;a href="https://technick.net/guides/theory/dft/derivation_taylor_series#sec:B"&gt;3.3&lt;/a&gt;. Clearly, since many&#10;derivatives are involved, a &lt;a href="https://technick.net/guides/theory/dft/first_look_at"&gt;Taylor series expansion&lt;/a&gt; is only possible&#10;when the function is so smooth that it can be differentiated again and&#10;again. Fortunately for us, all audio signals can be defined so as to&#10;be in that category. This is because hearing is bandlimited to&lt;img width="20" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img240.png" alt="$20$" /&gt; kHz, and any sum of &lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;sinusoids&lt;/a&gt; up to some maximum frequency, i.e.,&#10;any audible signal, is infinitely differentiable. (Recall that&#10;&lt;!-- MATH&#10; $\sin^\prime(x)=\cos(x)$&#10; --&gt;&lt;img width="114" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img241.png" alt="$\" in="" rime="" cos="" /&gt; and &lt;!-- MATH&#10; $\cos^\prime(x)=-\sin(x)$&#10; --&gt;&lt;img width="129" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img242.png" alt="$\" os="" rime="" sin="" /&gt;, etc.). See&#10;&amp;sect;&lt;a href="https://technick.net/guides/theory/dft/further_notes_differentiabi#sec:E"&gt;3.6&lt;/a&gt; for more on this topic.&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/real_exponents"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/imaginary_exponents"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Imaginary Exponents</title><link>https://technick.net/guides/theory/dft/imaginary_exponents/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/imaginary_exponents/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/first_look_at"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/derivatives_f_x_a_x"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00418000000000000000"&gt;Imaginary Exponents&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;We may define &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/imaginary_exponents"&gt;imaginary exponents&lt;/a&gt;&lt;/i&gt; the same way that all sufficiently&#10;smooth real-valued functions of a real variable are generalized to the&#10;complex case--using &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/first_look_at"&gt;Taylor series&lt;/a&gt;&lt;/i&gt;. A &lt;a href="https://technick.net/guides/theory/dft/first_look_at"&gt;Taylor series expansion&lt;/a&gt; is&#10;just a polynomial (possibly of infinitely high order), and polynomials&#10;involve only addition, multiplication, and division. Since these&#10;elementary operations are also defined for &lt;a href="https://technick.net/guides/theory/dft/introduction_complex_number"&gt;complex numbers&lt;/a&gt;, any smooth&#10;function of a real variable &lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img236.png" alt="$f(x)$" /&gt; may be generalized to a function of a&#10;complex variable &lt;img width="34" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img243.png" alt="$f(z)$" /&gt; by simply substituting the complex variable&lt;img width="78" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img15.png" alt="$z = x + jy$" /&gt; for the real variable &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; in the Taylor series expansion.&lt;/p&gt;&lt;p&gt;Let &lt;!-- MATH&#10; $f(x) \isdef a^x$&#10; --&gt;&lt;img width="73" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img244.png" alt="$f(x) \" sdef="" /&gt;, where &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img192.png" alt="$a$" /&gt; is any positive real number. The Taylor&#10;series expansion expansion about &lt;img width="49" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img239.png" alt="$x_0=0$" /&gt; (''Maclaurin series''),&#10;generalized to the complex case is then&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;a^z \isdef f(0)+f^\prime(0)(z) + \frac{f^{\prime\prime}(0)}{2}z^2 + \frac{f^{\prime\prime\prime}(0)z^3}{3!} + \cdots&#10;\cdots&#10;\end{displaymath}&#10; --&gt;&lt;img width="393" height="46" border="0" src="https://technick.net/img/guide_dft/img245.png" alt="\" egin="" isplaymath="" a="" isdef="" prime="" frac="" prime\prime="" frac="" prime\prime\prime="" cdots="" dots="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;which is well defined (although we should make sure the series &lt;i&gt;converges&lt;/i&gt; for every finite &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt;). We have &lt;!-- MATH&#10; $f(0) \isdef a^0 = 1$&#10; --&gt;&lt;img width="100" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img246.png" alt="$f(0) \" sdef="" /&gt;, so&#10;the first term is no problem. But what is &lt;img width="38" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img247.png" alt="$f^\" rime="" /&gt;? In other&#10;words, what is the derivative of &lt;img width="21" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img186.png" alt="$a^x$" /&gt; at &lt;img width="42" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img117.png" alt="$x=0$" /&gt;? Once we find the&#10;successive derivatives of &lt;!-- MATH&#10; $f(x) \isdef a^x$&#10; --&gt;&lt;img width="73" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img244.png" alt="$f(x) \" sdef="" /&gt; at &lt;img width="42" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img117.png" alt="$x=0$" /&gt;, we will be done with&#10;the definition of &lt;img width="20" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img248.png" alt="$a^z$" /&gt; for any complex &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt;.&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/first_look_at"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/derivatives_f_x_a_x"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Derivatives of f(x)=a^x</title><link>https://technick.net/guides/theory/dft/derivatives_f_x_a_x/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/derivatives_f_x_a_x/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/imaginary_exponents"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/back_e"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00419000000000000000"&gt;Derivatives of f(x)=a^x&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;Let's apply the definition of differentiation and see what happens:&lt;/p&gt;&lt;p&gt;&lt;/p&gt;</description></item><item><title>Back to e</title><link>https://technick.net/guides/theory/dft/back_e/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/back_e/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/derivatives_f_x_a_x"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/sidebar_mathematica"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION004110000000000000000"&gt;Back to &lt;i&gt;e&lt;/i&gt;&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;Above, we defined &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img61.png" alt="$e$" /&gt; as the particular real number satisfying&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\lim_{\delta\to 0} \frac{e^\delta-1}{\delta} \isdef 1 .&#10;\end{displaymath}&#10; --&gt;&lt;img width="118" height="47" border="0" src="https://technick.net/img/guide_dft/img255.png" alt="\" egin="" isplaymath="" im="" elta\to="" rac="" delta-1="" elta="" sdef="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;which gave us &lt;!-- MATH&#10; $(a^x)^\prime = a^x$&#10; --&gt;&lt;img width="75" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img265.png" alt="$(a^x)^\" rime="a^x$" /&gt; when &lt;img width="41" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img254.png" alt="$a=e$" /&gt;. From this expression,&#10;we have, as &lt;img width="44" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img251.png" alt="$\" elta\to="" /&gt;, &#10; &lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;e^\delta - 1 &amp; \rightarrow &amp; \delta \\&#10;\Rightarrow \qquad e^\delta &amp; \rightarrow &amp; 1+\delta \\&#10;\Rightarrow \qquad e &amp; \rightarrow &amp; (1+\delta)^{1/\delta},&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="203" height="84" border="0" src="https://technick.net/img/guide_dft/img266.png" alt="\" egin="" qnarray="" delta="" ightarrow="" elta="" ightarrow="" quad="" ightarrow="" quad="" ightarrow="" elta="" elta="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;or,&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\fbox{$\displaystyle e \isdef \lim_{\delta\to0} (1+\delta)^{1/\delta}$}&#10;\end{displaymath}&#10; --&gt;&lt;img width="146" height="50" border="0" src="https://technick.net/img/guide_dft/img267.png" alt="\" egin="" isplaymath="" box="" isplaystyle="" sdef="" im="" elta\to0="" elta="" elta="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;This is one way to define &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img61.png" alt="$e$" /&gt;. Another way to arrive at the same&#10;definition is to ask what logarithmic base &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img61.png" alt="$e$" /&gt; gives that the derivative of&lt;img width="53" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img268.png" alt="$\" og="" x="" /&gt; is &lt;img width="29" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img269.png" alt="$1/x$" /&gt;. We denote &lt;img width="53" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img268.png" alt="$\" og="" x="" /&gt; by &lt;img width="39" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img270.png" alt="$\" n="" /&gt;. &lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/derivatives_f_x_a_x"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/sidebar_mathematica"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Sidebar on Mathematica</title><link>https://technick.net/guides/theory/dft/sidebar_mathematica/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/sidebar_mathematica/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/back_e"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/back_e_j_theta"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION004111000000000000000"&gt;Sidebar on Mathematica&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;&lt;a href="https://technick.net/guides/theory/dft/sidebar_mathematica"&gt;Mathematica&lt;/a&gt; is a handy tool for cranking out any number of digits intranscendental numbers such as &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img61.png" alt="$e$" /&gt;:&lt;pre&gt;&#10;In[]:&#10; N[E,50]&#10;Out[]:&#10; 2.7182818284590452353602874713526624977572470937&lt;/pre&gt;Alternatively, we can compute &lt;!-- MATH&#10; $(1+\delta)^{1/\delta}$&#10; --&gt;&lt;img width="72" height="36" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img271.png" alt="$(1+\" elta="" elta="" /&gt; for small &lt;img width="12" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img272.png" alt="$\" elta="" /&gt;:&lt;pre&gt;&#10;In[]:&#10; (1+delta)^(1/delta) /. delta-&amp;gt;0.001&#10;Out[]:&#10; 2.716923932235594&#10;In[]:&#10; (1+delta)^(1/delta) /. delta-&amp;gt;0.0001&#10;Out[]:&#10; 2.718145926824926&#10;In[]:&#10; (1+delta)^(1/delta) /. delta-&amp;gt;0.00001&#10;Out[]:&#10; 2.718268237192297&lt;/pre&gt;What happens if we just go for it and set delta to zero?&lt;pre&gt;&#10;In[]:&#10; (1+delta)^(1/delta) /. delta-&amp;gt;0&#10; 1&#10;Power::infy: Infinite expression - encountered.&#10; 0&#10;Infinity::indt: &#10; ComplexInfinity&#10; Indeterminate expression 1 encountered.&#10;Indeterminate&lt;/pre&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/back_e"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/back_e_j_theta"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Back to e^(j theta)</title><link>https://technick.net/guides/theory/dft/back_e_j_theta/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/back_e_j_theta/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/sidebar_mathematica"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/informal_derivation_taylor"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION004112000000000000000"&gt;Back to e^(j theta)&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;We've now defined &lt;img width="20" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img248.png" alt="$a^z$" /&gt; for any positive real number &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img192.png" alt="$a$" /&gt; and any &lt;a href="https://technick.net/guides/theory/dft/introduction_complex_number"&gt;complex&#10;number&lt;/a&gt; &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt;. Setting &lt;img width="41" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img254.png" alt="$a=e$" /&gt; and &lt;img width="49" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img273.png" alt="$z=j\" heta="" /&gt; gives us the special case we&#10;need for &lt;a href="https://technick.net/guides/theory/dft/proof_euler_s_identity"&gt;Euler's identity&lt;/a&gt;. Since &lt;img width="19" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img274.png" alt="$e^z$" /&gt; is its own derivative, the &lt;a href="https://technick.net/guides/theory/dft/first_look_at"&gt;Taylor&#10;series expansion&lt;/a&gt; for for &lt;img width="72" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img275.png" alt="$f(x)=e^x$" /&gt; is the simplest series there could be:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;e^x = \sum_{n=0}^\infty \frac{x^n}{n!} &#10;&#9;= 1 + x + \frac{x^2}{2} + \frac{x^3}{3!} + \cdots&#10;\end{displaymath}&#10; --&gt;&lt;img width="286" height="58" border="0" src="https://technick.net/img/guide_dft/img276.png" alt="\" egin="" isplaymath="" x="\sum_{n=0}^\infty" frac="" n="" x="" rac="" frac="" cdots="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;The simplicity comes about because &lt;img width="82" height="36" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img277.png" alt="$f^{(n)}(0)=1$" /&gt; for all &lt;img width="14" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img51.png" alt="$n$" /&gt; and because&#10;we chose to expand about the point &lt;img width="42" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img117.png" alt="$x=0$" /&gt;. We of course define&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;e^{j\theta} \isdef \sum_{n=0}^\infty \frac{(j\theta)^n}{n!} &#10;&#9;= 1 + j\theta - \theta^2/2 - j\theta^3/3! + \cdots&#10;\end{displaymath}&#10; --&gt;&lt;img width="356" height="58" border="0" src="https://technick.net/img/guide_dft/img278.png" alt="\" egin="" isplaymath="" j\theta="" sdef="" um="" infty="" rac="" theta="" n="" theta="" heta="" theta="" dots="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Note that all even order terms are real while all odd order terms are&#10;imaginary. Separating out the real and imaginary parts gives&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;\mbox{re}\left\{e^{j\theta}\right\} &amp;=&amp; 1 - \theta^2/2 + \theta^4/4! - \cdots \\&#10;\mbox{im}\left\{e^{j\theta}\right\} &amp;=&amp; \theta - \theta^3/3! + \theta^5/5! - \cdots&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="285" height="62" border="0" src="https://technick.net/img/guide_dft/img279.png" alt="\" egin="" qnarray="" box="" e="" eft\="" j\theta="" ight\="" heta="" het="" theta="" ight\="" heta="" heta="" heta="" dots="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;Comparing the Maclaurin expansion for &lt;img width="25" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img3.png" alt="$e^{j\" heta="" /&gt; with that of&lt;img width="46" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img280.png" alt="$\" os="" heta="" /&gt; and &lt;img width="44" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img281.png" alt="$\" in="" heta="" /&gt; proves Euler's identity. Recall that&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;\frac{d}{d\theta}\cos(\theta) &amp;=&amp; -\sin(\theta) \\&#10;\frac{d}{d\theta}\sin(\theta) &amp;=&amp; \cos(\theta)&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="176" height="87" border="0" src="https://technick.net/img/guide_dft/img282.png" alt="\" egin="" qnarray="" rac="" d\theta="" os="" heta="" in="" heta="" rac="" d\theta="" in="" heta="" os="" heta="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;so that&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;\left.\frac{d^n}{d\theta^n}\cos(\theta)\right|_{\theta=0} &#10;&#9;&amp;=&amp; \left\{\begin{array}{ll}&#10;&#9;(-1)^{n/2}, &amp; n\;\mbox{even} \\&#10;&#9;0, &amp; n\;\mbox{odd} \\&#10;&#9;\end{array}&#10;&#9;\right. \\&#10;\left.\frac{d^n}{d\theta^n}\sin(\theta)\right|_{\theta=0} &#10;&#9;&amp;=&amp; \left\{\begin{array}{ll}&#10;&#9;(-1)^{(n-1)/2}, &amp; n\;\mbox{odd} \\&#10;&#9;0, &amp; n\;\mbox{even} \\&#10;&#9;\end{array}&#10;&#9;\right.&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="342" height="101" border="0" src="https://technick.net/img/guide_dft/img283.png" alt="\" egin="" qnarray="" eft="" rac="" n="" theta="" cos="" heta="" ight\vert="" heta="0}..." n\="" box="" dd="" mbox="" ven="" nd="" rray="" ight="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Plugging into the general &lt;a href="https://technick.net/guides/theory/dft/informal_derivation_taylor"&gt;Maclaurin series&lt;/a&gt; gives&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;\cos(\theta) &amp;=&amp; \sum_{n=0}^\infty \frac{f^{(n)}(0)}{n!}\theta^n \\&#10;&#9; &amp;=&amp; \sum_{\stackrel{n\geq 0}{n\;\mbox{even}}}^\infty&#10;&#9;&#9;&#9;\frac{(-1)^{n/2}}{n!} \theta^n \\&#10;\sin(\theta) &amp;=&amp; \sum_{\stackrel{n\geq 0}{n\;\mbox{odd}}}^\infty&#10;&#9;&#9;&#9;\frac{(-1)^{(n-1)/2}}{n!} \theta^n&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="250" height="203" border="0" src="https://technick.net/img/guide_dft/img284.png" alt="\" egin="" qnarray="" os="" heta="" um="" infty="" rac="" n="" theta="" q="" mbox="" dd="" nfty="" rac="" n="" heta="" end="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Separating the Maclaurin expansion for &lt;img width="25" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img3.png" alt="$e^{j\" heta="" /&gt; into its even and odd&#10;terms (real and imaginary parts) gives&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;e^{j\theta} \isdef \sum_{n=0}^\infty \frac{(j\theta)^n}{n!}&#10; = \sum_{\stackrel{n\geq 0}{n\;\mbox{even}}}^\infty&#10; \frac{(-1)^{n/2}}{n!} \theta^n &#10; + j \sum_{\stackrel{n\geq 0}{n\;\mbox{odd}}}^\infty&#10; \frac{(-1)^{(n-1)/2}}{n!} \theta^n&#10; = \cos(\theta) + j\sin(\theta)&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="608" height="75" border="0" src="https://technick.net/img/guide_dft/img285.png" alt="\" egin="" qnarray="" j\theta="" sdef="" um="" infty="" rac="" theta="" n="" ac="" n="" heta="" cos="" theta="" j\sin="" heta="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;thus proving Euler's identity.&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/sidebar_mathematica"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/informal_derivation_taylor"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Informal Derivation of Taylor Series Expansion</title><link>https://technick.net/guides/theory/dft/informal_derivation_taylor/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/informal_derivation_taylor/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/back_e_j_theta"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/derivation_taylor_series"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00420000000000000000"&gt;&lt;/a&gt;&lt;a name="4004"&gt;&lt;/a&gt;&lt;a name="sec:A"&gt;&lt;/a&gt;&lt;br /&gt;Informal Derivation of &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/first_look_at"&gt;Taylor Series Expansion&lt;/a&gt;&lt;/i&gt;&lt;/h1&gt;&lt;p&gt;We have a function &lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img236.png" alt="$f(x)$" /&gt; and we want to approximate it using an&lt;img width="14" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img51.png" alt="$n$" /&gt;th-order &lt;i&gt;polynomial&lt;/i&gt;:&lt;br /&gt;&lt;/p&gt;</description></item><item><title>Derivation of Taylor Series Expansion with Remainder</title><link>https://technick.net/guides/theory/dft/derivation_taylor_series/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/derivation_taylor_series/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/informal_derivation_taylor"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/formal_statement_taylor_s"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00430000000000000000"&gt;&lt;/a&gt;&lt;a name="sec:B"&gt;&lt;/a&gt;&lt;br /&gt;Derivation of &lt;a href="https://technick.net/guides/theory/dft/first_look_at"&gt;Taylor Series Expansion&lt;/a&gt; with Remainder&lt;/h1&gt;&lt;p&gt;We repeat the derivation of the preceding section, but this time we &#10;treat the error term more carefully.&lt;/p&gt;&lt;p&gt;Again we want to approximate &lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img236.png" alt="$f(x)$" /&gt; with an &lt;img width="14" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img51.png" alt="$n$" /&gt;th-order &lt;i&gt;polynomial&lt;/i&gt;:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;f(x) = f_0 + f_1 x + f_2 x^2 + \cdots + f_n x^n + R_{n+1}(x)&#10;\end{displaymath}&#10; --&gt;&lt;img width="363" height="31" border="0" src="https://technick.net/img/guide_dft/img286.png" alt="\" egin="" isplaymath="" x="" f="" f="" cdots="" n="" r="" x="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;img width="62" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img287.png" alt="$R_{n+1}(x)$" /&gt; is the ''remainder term'' which we will no longer assume is&#10;zero.&lt;p&gt;Our problem is to find &lt;!-- MATH&#10; $\{f_i\}_{i=0}^{n}$&#10; --&gt;&lt;img width="54" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img288.png" alt="$\" f="" i="0}^{n}$" /&gt; so as to minimize &lt;img width="62" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img287.png" alt="$R_{n+1}(x)$" /&gt;over some interval &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img301.png" alt="$I$" /&gt; containing &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt;. There are many ''optimality&#10;criteria'' we could choose. The one that falls out naturally here is&#10;called ''Pad&amp;eacute;'' approximation. Pad&amp;eacute; approximation sets the error value&#10;and its first &lt;img width="14" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img51.png" alt="$n$" /&gt; derivatives to zero at a single chosen point, which we&#10;take to be &lt;img width="42" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img117.png" alt="$x=0$" /&gt;. Since all &lt;img width="41" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img302.png" alt="$n+1$" /&gt; ''degrees of freedom'' in the polynomial&#10;coefficients &lt;img width="17" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img291.png" alt="$f_i$" /&gt; are used to set derivatives to zero at one point, the&#10;approximation is termed ''maximally flat'' at that point. Pad&amp;eacute;&#10;approximation comes up often in signal processing. For example, it is the&#10;sense in which Butterworth lowpass filters are optimal. (Their frequencyreponses are maximally flat at dc.) Also, Lagrange interpolation filters&#10;can be shown to maximally flat at dc in the frequency domain.&lt;/p&gt;&lt;p&gt;Setting &lt;img width="42" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img117.png" alt="$x=0$" /&gt; in the above &lt;a href="https://technick.net/guides/theory/dft/weierstrass_polynomial_appr"&gt;polynomial approximation&lt;/a&gt; produces&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;f(0) = f_0 + R_{n+1}(0) = f_0&#10;\end{displaymath}&#10; --&gt;&lt;img width="196" height="31" border="0" src="https://technick.net/img/guide_dft/img303.png" alt="\" egin="" isplaymath="" f="" n="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where we have used the fact that the error is to be exactly zero&#10;at &lt;img width="42" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img117.png" alt="$x=0$" /&gt;.&lt;p&gt;Differentiating the polynomial approximation and setting &lt;img width="42" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img117.png" alt="$x=0$" /&gt; gives&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;f^\prime(0) = f_1 + R^\prime_{n+1}(0) = f_1&#10;\end{displaymath}&#10; --&gt;&lt;img width="201" height="32" border="0" src="https://technick.net/img/guide_dft/img304.png" alt="\" egin="" isplaymath="" prime="" r="" rime="" f="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where we have used the fact that we also want the &lt;i&gt;slope&lt;/i&gt;of the error to be exactly zero at &lt;img width="42" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img117.png" alt="$x=0$" /&gt;.&lt;p&gt;In the same way, we find &lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;f^{(k)}(0) = k! \cdot f_k + R^{(k)}_{n+1}(0) = k! \cdot f_k&#10;\end{displaymath}&#10; --&gt;&lt;img width="271" height="33" border="0" src="https://technick.net/img/guide_dft/img305.png" alt="\" egin="" isplaymath="" k="" cdot="" r="" n="" cdot="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;for &lt;!-- MATH&#10; $k=2,3,4,\ldots,n$&#10; --&gt;&lt;img width="117" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img306.png" alt="$k=2,3,4,\" dots="" /&gt;, and the first &lt;img width="14" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img51.png" alt="$n$" /&gt;derivatives of the remainder term are all zero.&#10;Solving these relations for the desired constants yields&#10;the &lt;img width="14" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img51.png" alt="$n$" /&gt;th-order Taylor series expansion of &lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img236.png" alt="$f(x)$" /&gt; about the point&lt;img width="42" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img117.png" alt="$x=0$" /&gt;&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;f(x) = \sum_{k=0}^n \frac{f^{(k)}(0)}{k!} x^k + R_{n+1}(x)&#10;\end{displaymath}&#10; --&gt;&lt;img width="246" height="59" border="0" src="https://technick.net/img/guide_dft/img307.png" alt="\" egin="" isplaymath="" x="" um="" n="" rac="" k="" x="" r="" x="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;as before, but now we better understand the remainder term.&lt;p&gt;From this derivation, it is clear that the approximation error (remainder&#10;term) is smallest in the vicinity of &lt;img width="42" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img117.png" alt="$x=0$" /&gt;. &lt;i&gt;All degrees of freedom&lt;/i&gt;in the polynomial coefficients were devoted to minimizing the approximation&#10;error and its derivatives at &lt;img width="42" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img117.png" alt="$x=0$" /&gt;. As you might expect, the approximation&#10;error generally worsens as &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; gets farther away from &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img38.png" alt="$0$" /&gt;.&lt;/p&gt;&lt;p&gt;To obtain a more &lt;i&gt;uniform&lt;/i&gt; approximation over some interval &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img301.png" alt="$I$" /&gt; in&lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt;, other kinds of error criteria may be employed. This is classically&#10;called ''economization of series,'' but nowadays we may simply call it&lt;i&gt;polynomial approximation&lt;/i&gt;&lt;a name="4015"&gt;&lt;/a&gt; under different error criteria. In &lt;tt&gt;&lt;a href="http://www.mathworks.com/access/helpdesk/help/techdoc/basics/getstarted.shtml"&gt;Matlab&lt;/a&gt;&lt;/tt&gt;, the function &lt;tt&gt;polyfit(x,y,n)&lt;/tt&gt; will find the coefficients of a&#10;polynomial &lt;img width="34" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img84.png" alt="$p(x)$" /&gt; of degree &lt;tt&gt;n&lt;/tt&gt; that fits the data &lt;tt&gt;y&lt;/tt&gt; over the&#10;points &lt;tt&gt;x&lt;/tt&gt; in a least-squares sense. That is, it minimizes&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\left\|\,R_{n+1}\,\right\|^2 \isdef \sum_{i=1}^{n_x} \left|y(i) - p(x(i))\right|^2&#10;\end{displaymath}&#10; --&gt;&lt;img width="241" height="59" border="0" src="https://technick.net/img/guide_dft/img308.png" alt="\" egin="" isplaymath="" eft\vert\="" n="" ight\vert="" sdef="" um="" n="" x="" left\vert="" i="" p="" i="i" right\vert="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where &lt;!-- MATH&#10; $n_x \isdef {\tt length(x)}$&#10; --&gt;&lt;img width="114" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img309.png" alt="$n_x \" sdef="" t="tt" ength="" /&gt;.&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/informal_derivation_taylor"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/formal_statement_taylor_s"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Formal Statement of Taylor's Theorem</title><link>https://technick.net/guides/theory/dft/formal_statement_taylor_s/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/formal_statement_taylor_s/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/derivation_taylor_series"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/weierstrass_polynomial_appr"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00440000000000000000"&gt;&lt;/a&gt;&lt;a name="sec:C"&gt;&lt;/a&gt;&lt;br /&gt;Formal Statement of &lt;a href="https://technick.net/guides/theory/dft/formal_statement_taylor_s"&gt;Taylor's Theorem&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;Let &lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img236.png" alt="$f(x)$" /&gt; be continuous on a real interval &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img301.png" alt="$I$" /&gt; containing &lt;img width="20" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img310.png" alt="$x_0$" /&gt; (and &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt;),&#10;and let &lt;img width="54" height="36" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img311.png" alt="$f^{(n)}(x)$" /&gt; exist at &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; and &lt;!-- MATH&#10; $f^{(n+1)}(\xi)$&#10; --&gt;&lt;img width="68" height="36" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img312.png" alt="$f^{(n+1)}(\" i="i" /&gt; be continuous for&#10;all &lt;img width="39" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img313.png" alt="$\" i\in="" /&gt;. Then we have the following &lt;a href="https://technick.net/guides/theory/dft/first_look_at"&gt;Taylor series expansion&lt;/a&gt;:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;f(x) = f(x_0) + \frac{1}{1}f^\prime(x_0)(x-x_0) &#10;&#9;+ \frac{1}{1\cdot 2}f^{\prime\prime}(x_0)(x-x_0)^2&#10;&#9;+ \frac{1}{1\cdot 2\cdot 3}f^{\prime\prime\prime}(x_0)(x-x_0)^3&#10;&#9;+ \cdots&#10;&#9;+ \frac{1}{n!}f^{(n+1)}(x_0)(x-x_0)^n&#10;&#9;+ R_{n+1}(x)&#10;\end{displaymath}&#10; --&gt;&lt;img width="946" height="42" border="0" src="https://technick.net/img/guide_dft/img314.png" alt="\" egin="" isplaymath="" x="" x="" rac="" prime="" x-x="" rac="" dots="" rac="" f="" x="" x="" r="" x="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where &lt;img width="62" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img287.png" alt="$R_{n+1}(x)$" /&gt; is called the remainder term.&#10;There exists &lt;img width="12" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img315.png" alt="$\" i="i" /&gt; between &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; and &lt;img width="20" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img310.png" alt="$x_0$" /&gt; such that&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;R_{n+1}(x) = \frac{f^{(n+1)}(\xi)}{(n+1)!}(x-x_0)^{n+1}&#10;\end{displaymath}&#10; --&gt;&lt;img width="252" height="51" border="0" src="https://technick.net/img/guide_dft/img316.png" alt="\" egin="" isplaymath="" n="" frac="" n="" i="" x-x="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;In particular, if &lt;!-- MATH&#10; $|f^{(n+1)}|\leq M$&#10; --&gt;&lt;img width="96" height="36" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img317.png" alt="$\" ert="" vert\leq="" /&gt; in &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img301.png" alt="$I$" /&gt;, then&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;R_{n+1}(x) \leq \frac{M |x-x_0|^{n+1}}{(n+1)!}&#10;\end{displaymath}&#10; --&gt;&lt;img width="196" height="50" border="0" src="https://technick.net/img/guide_dft/img318.png" alt="\" egin="" isplaymath="" n="" leq="" rac="" vert="" vert="" n="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;which is normally small when &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; is close to &lt;img width="20" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img310.png" alt="$x_0$" /&gt;.&lt;p&gt;When &lt;img width="49" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img239.png" alt="$x_0=0$" /&gt;, the &lt;a href="https://technick.net/guides/theory/dft/first_look_at"&gt;Taylor series&lt;/a&gt; reduces to what is called a &lt;a href="https://technick.net/guides/theory/dft/informal_derivation_taylor"&gt;Maclaurin&#10;series&lt;/a&gt;.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/derivation_taylor_series"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/weierstrass_polynomial_appr"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>The Weierstrass (Polynomial) Approximation Theorem</title><link>https://technick.net/guides/theory/dft/weierstrass_polynomial_appr/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/weierstrass_polynomial_appr/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/formal_statement_taylor_s"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/further_notes_differentiabi"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00450000000000000000"&gt;&lt;/a&gt;&lt;a name="sec:D"&gt;&lt;/a&gt;&lt;br /&gt;The Weierstrass (Polynomial) Approximation Theorem&lt;/h1&gt;&lt;p&gt;Let &lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img236.png" alt="$f(x)$" /&gt; be continuous on a real interval &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img301.png" alt="$I$" /&gt;. Then for any &lt;img width="40" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img319.png" alt="$\" psilon="" t="" /&gt;,&#10;there exists an &lt;img width="14" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img51.png" alt="$n$" /&gt;th-order polynomial &lt;img width="60" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img320.png" alt="$P_n(f,x)$" /&gt;, where &lt;img width="14" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img51.png" alt="$n$" /&gt; depends on&lt;img width="11" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img321.png" alt="$\" psilon="" /&gt;, such that&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\left|P_n(f,x) - f(x)\right| &lt; \epsilon&#10;\end{displaymath}&#10; --&gt;&lt;img width="157" height="31" border="0" src="https://technick.net/img/guide_dft/img322.png" alt="\" egin="" isplaymath="" eft\vert="" f="" f="" right\vert="" t="" psilon="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;for all &lt;img width="41" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img323.png" alt="$x\" n="" /&gt;.&lt;p&gt;Thus, any continuous function can be approximated arbitrarily well by means&#10;of a polynomial. Furthermore, an infinite-order polynomial can yield an&#10;error-free approximation. Of course, to compute the polynomial&#10;coefficients using a &lt;a href="https://technick.net/guides/theory/dft/first_look_at"&gt;Taylor series expansion&lt;/a&gt;, the function must also be&#10;differentiable of all orders throughout &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img301.png" alt="$I$" /&gt;.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/formal_statement_taylor_s"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/further_notes_differentiabi"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Further Notes on Differentiability of Audio Signals</title><link>https://technick.net/guides/theory/dft/further_notes_differentiabi/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/further_notes_differentiabi/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/weierstrass_polynomial_appr"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/logarithms_decibels_number"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00460000000000000000"&gt;&lt;/a&gt;&lt;a name="sec:E"&gt;&lt;/a&gt;&lt;br /&gt;Further Notes on Differentiability of Audio Signals&lt;/h1&gt;&lt;p&gt;As mentioned earlier, every audio signal can be regarded as infinitely&#10;differentiable due to the finite bandwidth of human hearing. One of&#10;the Fourier properties we will learn later in this course is that&lt;i&gt;a signal cannot be both time limited and frequency limited.&lt;/i&gt;Therefore, by conceptually ''lowpass filtering'' every audio signal to&#10;reject all frequencies above &lt;img width="20" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img240.png" alt="$20$" /&gt; kHz, we implicitly make every audio&#10;signal last forever! Another way of saying this is that the ''ideal&#10;lowpass filter `rings' forever''. Such fine points do not concern us&#10;in practice, but they are important for fully understanding the&#10;underlying theory. Since, in reality, signals can be said to have a&#10;true beginning and end, we must admit in practice that all signals we&#10;work with have infinite-bandwidth at turn-on and turn-off&#10;transients.&lt;a name="tex2html13" href="https://technick.net/guides/theory/dft/footnode#foot3876"&gt;&lt;sup&gt;3.1&lt;/sup&gt;&lt;/a&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/weierstrass_polynomial_appr"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/logarithms_decibels_number"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Logarithms, Decibels, and Number Systems</title><link>https://technick.net/guides/theory/dft/logarithms_decibels_number/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/logarithms_decibels_number/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/further_notes_differentiabi"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/logarithms"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00500000000000000000"&gt;Logarithms, Decibels, and Number Systems&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;This chapter provides an introduction to logarithms (real and complex),&lt;a href="https://technick.net/guides/theory/dft/decibels"&gt;decibels&lt;/a&gt;, and number systems such as binary integer &lt;a href="https://technick.net/guides/theory/dft/binary_integer_fixed_point"&gt;fixed-point&lt;/a&gt;, fractional&#10;fixed-point, &lt;a href="https://technick.net/guides/theory/dft/one_s_complement_fixed_poin"&gt;one's complement&lt;/a&gt;, &lt;a href="https://technick.net/guides/theory/dft/general_formula_two_s_compl"&gt;two's complement&lt;/a&gt;, &lt;a href="https://technick.net/guides/theory/dft/logarithmic_fixed_point_num"&gt;logarithmic fixed-point&lt;/a&gt;,&lt;img width="14" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img5.png" alt="$\" u="u" /&gt;-law, and &lt;a href="https://technick.net/guides/theory/dft/floating_point_numbers"&gt;floating-point number&lt;/a&gt; formats.&lt;/p&gt;&lt;p&gt;&lt;i&gt;&lt;img width="20" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img324.png" alt="$\" l="" /&gt; FIXME: HERE HERE HERE&lt;img width="20" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img325.png" alt="$\" g="" /&gt;&lt;/i&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;hr /&gt;&lt;!--Table of Child-Links--&gt;&lt;a name="CHILD_LINKS"&gt;&lt;strong&gt;Subsections&lt;/strong&gt;&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html862" href="https://technick.net/guides/theory/dft/logarithms"&gt;Logarithms&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html863" href="https://technick.net/guides/theory/dft/changing_base"&gt;Changing the Base&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html864" href="https://technick.net/guides/theory/dft/logarithms_negative_imagina"&gt;Logarithms of Negative and Imaginary Numbers&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html865" href="https://technick.net/guides/theory/dft/decibels"&gt;Decibels&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html866" href="https://technick.net/guides/theory/dft/properties_db_scales"&gt;Properties of DB Scales&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html867" href="https://technick.net/guides/theory/dft/specific_db_scales"&gt;Specific DB Scales&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html868" href="https://technick.net/guides/theory/dft/dbm_scale"&gt;DBm Scale&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html869" href="https://technick.net/guides/theory/dft/dbv_scale"&gt;DBV Scale&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html870" href="https://technick.net/guides/theory/dft/db_spl"&gt;DB SPL&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html871" href="https://technick.net/guides/theory/dft/db_display"&gt;DB for Display&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html872" href="https://technick.net/guides/theory/dft/dynamic_range"&gt;Dynamic Range&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html873" href="https://technick.net/guides/theory/dft/linear_number_systems"&gt;Linear Number Systems for Digital Audio&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html874" href="https://technick.net/guides/theory/dft/pulse_code_modulation"&gt;Pulse Code Modulation (PCM)&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html875" href="https://technick.net/guides/theory/dft/binary_integer_fixed_point"&gt;Binary Integer Fixed-Point Numbers&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html876" href="https://technick.net/guides/theory/dft/one_s_complement_fixed_poin"&gt;One's Complement Fixed-Point Format&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html877" href="https://technick.net/guides/theory/dft/two_s_complement_fixed_poin"&gt;Two's Complement Fixed-Point Format&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html878" href="https://technick.net/guides/theory/dft/general_formula_two_s_compl"&gt;General Formula for Two's-Complement, &#10;&#9;Integer Fixed-Point Numbers&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html879" href="https://technick.net/guides/theory/dft/little_endian_formula"&gt;''Little Endian'' Formula for Two's-Complement,&#10;Integer Fixed-Point Numbers&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html880" href="https://technick.net/guides/theory/dft/fractional_binary_fixed_poi"&gt;Fractional Binary Fixed-Point Numbers&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html881" href="https://technick.net/guides/theory/dft/how_many_bits"&gt;How Many Bits are Enough for Digital Audio?&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html882" href="https://technick.net/guides/theory/dft/when_do_we"&gt;When Do We Have to Swap Bytes When Changing Computers?&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html883" href="https://technick.net/guides/theory/dft/logarithmic_number_systems"&gt;Logarithmic Number Systems for Digital Audio&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html884" href="https://technick.net/guides/theory/dft/floating_point_numbers"&gt;Floating-Point Numbers&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html885" href="https://technick.net/guides/theory/dft/logarithmic_fixed_point_num"&gt;Logarithmic Fixed-Point Numbers&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html886" href="https://technick.net/guides/theory/dft/law_companding"&gt;&lt;img width="14" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img5.png" alt="$\" u="u" /&gt;-Law Companding&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html887" href="https://technick.net/guides/theory/dft/appendix_a_round_off"&gt;Appendix A: Round-Off Error Variance&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html888" href="https://technick.net/guides/theory/dft/appendix_b_electrical"&gt;Appendix B: Electrical Engineering 101&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;!--End of Table of Child-Links--&gt;&#10;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/further_notes_differentiabi"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/logarithms"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Logarithms</title><link>https://technick.net/guides/theory/dft/logarithms/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/logarithms/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/logarithms_decibels_number"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/changing_base"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00510000000000000000"&gt;Logarithms&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;A &lt;i&gt;logarithm&lt;/i&gt;&lt;a name="5310"&gt;&lt;/a&gt; &lt;img width="82" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img326.png" alt="$y=\" og="" b="" /&gt; is fundamentally an &lt;i&gt;exponent&lt;/i&gt;&lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img13.png" alt="$y$" /&gt; applied to a specific &lt;i&gt;base&lt;/i&gt;&lt;a name="5313"&gt;&lt;/a&gt; &lt;img width="11" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img327.png" alt="$b$" /&gt;. That is, &lt;img width="49" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img328.png" alt="$x = b^y$" /&gt;. The&#10;term ''logarithm'' can be abbreviated as ''log''. The base &lt;img width="11" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img327.png" alt="$b$" /&gt; is&#10;chosen to be a positive real number, and we normally only take logs of&#10;positive real numbers &lt;img width="42" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img157.png" alt="$x&amp;gt;0$" /&gt; (although it is ok to say that the log of&lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img38.png" alt="$0$" /&gt; is &lt;img width="32" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img329.png" alt="$-\" nfty="" /&gt;). The inverse of a logarithm is called an&lt;i&gt;antilogarithm&lt;/i&gt;&lt;a name="5315"&gt;&lt;/a&gt; or &lt;i&gt;antilog&lt;/i&gt;&lt;a name="5317"&gt;&lt;/a&gt;.&lt;/p&gt;&lt;p&gt;For any positive number &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt;, we have&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;x = b^{\log_b(x)}&#10;\end{displaymath}&#10; --&gt;&lt;img width="84" height="26" border="0" src="https://technick.net/img/guide_dft/img330.png" alt="\" egin="" isplaymath="" b="" log="" b="" x="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;for any valid base &lt;img width="40" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img331.png" alt="$b&amp;gt;0$" /&gt;. This is just an identity arising from the&#10;definition of the logarithm, but it is sometimes useful in&#10;manipulating formulas.&lt;p&gt;When the base is not specified, it is normally assumed to be &lt;img width="20" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img332.png" alt="$10$" /&gt;,&#10;i.e., &lt;!-- MATH&#10; $\log(x) \isdef \log_{10}(x)$&#10; --&gt;&lt;img width="123" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img333.png" alt="$\" og="" isdef="" og="" /&gt;. This is the &lt;i&gt;common&#10;logarithm&lt;/i&gt;&lt;a name="5319"&gt;&lt;/a&gt;.&lt;/p&gt;&lt;p&gt;Base 2 and base &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img61.png" alt="$e$" /&gt; logarithms have their own special notation:&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;\ln(x) &amp;\isdef &amp; \log_e(x) \\&#10;\lg(x) &amp;\isdef &amp; \log_2(x)&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="140" height="60" border="0" src="https://technick.net/img/guide_dft/img334.png" alt="\" egin="" qnarray="" n="" isdef="" og="" x="" g="" isdef="" og="" end="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;(The use of &lt;img width="29" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img335.png" alt="$\" g="" /&gt; for base &lt;img width="12" height="13" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img76.png" alt="$2$" /&gt; logarithm&lt;a name="5322"&gt;&lt;/a&gt;s is common in&#10;computer science. In mathematics, it may denote a base &lt;img width="20" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img332.png" alt="$10$" /&gt;logarithm&lt;a name="5323"&gt;&lt;/a&gt;.) By far the most common bases are &lt;img width="20" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img332.png" alt="$10$" /&gt;, &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img61.png" alt="$e$" /&gt;, and &lt;img width="12" height="13" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img76.png" alt="$2$" /&gt;.&#10;Logs base &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img61.png" alt="$e$" /&gt; are called &lt;i&gt;natural logarithm&lt;/i&gt;&lt;a name="5325"&gt;&lt;/a&gt;s. They are&#10;''natural'' in the sense that&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\frac{d}{dx}\ln(x) = \frac{1}{x}&#10;\end{displaymath}&#10; --&gt;&lt;img width="98" height="43" border="0" src="https://technick.net/img/guide_dft/img336.png" alt="\" egin="" isplaymath="" rac="" dx="" n="" frac="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;while the derivatives of logarithms to other bases are not quite so simple:&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\frac{d}{dx}\log_b(x) = \frac{1}{x\ln(b)}&#10;\end{displaymath}&#10; --&gt;&lt;img width="152" height="48" border="0" src="https://technick.net/img/guide_dft/img337.png" alt="\" egin="" isplaymath="" rac="" dx="" og="" b="" frac="" ln="" b="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;(Prove this as an exercise.) The inverse of the natural logarithm&lt;img width="68" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img338.png" alt="$y=\" n="" /&gt; is of course the &lt;a href="https://technick.net/guides/theory/dft/exponentials"&gt;exponential function&lt;/a&gt; &lt;img width="49" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img339.png" alt="$x=e^y$" /&gt;, and &lt;img width="19" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img340.png" alt="$e^y$" /&gt; is&#10;its own derivative.&lt;p&gt;In general, a logarithm &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img13.png" alt="$y$" /&gt; has an integer part and a fractional part.&#10;The integer part is called the &lt;i&gt;characteristic of the logarithm&lt;/i&gt;&lt;a name="5327"&gt;&lt;/a&gt;,&#10;and the fractional part is called the &lt;i&gt;mantissa&lt;/i&gt;&lt;a name="5329"&gt;&lt;/a&gt;. These terms&#10;were suggested by Henry Briggs in 1624. ''Mantissa'' is a Latin word&#10;meaning ''addition'' or ''make weight''--something added to make up&#10;the weight [&lt;a href="https://technick.net/guides/theory/dft/bibliography#Gullberg97"&gt;6&lt;/a&gt;].&lt;/p&gt;&lt;p&gt;The following &lt;a href="http://www.mathworks.com/access/helpdesk/help/techdoc/basics/getstarted.shtml"&gt;Matlab&lt;/a&gt; code illustrates splitting a natural logarithm&#10;into its characteristic and mantissa:&lt;pre&gt;&#10;&amp;gt;&amp;gt; x = log(3)&#10; x = 1.0986&#10;&amp;gt;&amp;gt; characteristic = floor(x)&#10; characteristic = 1&#10;&amp;gt;&amp;gt; mantissa = x - characteristic&#10; mantissa = 0.0986&#10;&lt;p&gt;&amp;gt;&amp;gt; % Now do a negative-log example&#10;&amp;gt;&amp;gt; x = log(0.05)&#10;x = -2.9957&#10;&amp;gt;&amp;gt; characteristic = floor(x)&#10;characteristic = -3&#10;&amp;gt;&amp;gt; mantissa = x - characteristic&#10;mantissa = 0.0043&lt;/pre&gt;&lt;/p&gt;&lt;p&gt;Logarithms were used in the days before computers to perform&lt;i&gt;multiplication of large numbers&lt;/i&gt;&lt;a name="5331"&gt;&lt;/a&gt;. Since &lt;!-- MATH&#10;$\log(xy) =&#10;\log(x)+\log(y)$&#10;--&gt;&lt;img width="178" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img341.png" alt="$\" og="" y="" og="" log="" /&gt;, one can look up the logs of &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; and &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img13.png" alt="$y$" /&gt; in tables of&#10;logarithms, add them together (which is easier than multiplying), and&#10;look up the antilog of the result to obtain the product &lt;img width="22" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img342.png" alt="$xy$" /&gt;. Log&#10;tables are still used in modern computing environments to replace&#10;expensive multiplies with less-expensive table lookups and additions.&#10;This is a classic tradeoff between memory (for the log tables) and&#10;computation. Nowadays, large numbers are multiplied using FFT&#10;fast-&lt;a href="https://technick.net/guides/theory/dft/convolution"&gt;convolution&lt;/a&gt; techniques.&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;hr /&gt;&lt;!--Table of Child-Links--&gt;&lt;a name="CHILD_LINKS"&gt;&lt;strong&gt;Subsections&lt;/strong&gt;&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html901" href="https://technick.net/guides/theory/dft/changing_base"&gt;Changing the Base&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html902" href="https://technick.net/guides/theory/dft/logarithms_negative_imagina"&gt;Logarithms of Negative and Imaginary Numbers&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;!--End of Table of Child-Links--&gt;&lt;/p&gt;&#10;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/logarithms_decibels_number"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/changing_base"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Changing the Base</title><link>https://technick.net/guides/theory/dft/changing_base/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/changing_base/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/logarithms"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/logarithms_negative_imagina"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00511000000000000000"&gt;Changing the Base&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;By definition, &lt;!-- MATH&#10; $x = b^{\log_b(x)}$&#10; --&gt;&lt;img width="81" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img343.png" alt="$x = b^{\" og="" b="" /&gt;. Taking the log base &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img192.png" alt="$a$" /&gt; of both sides&#10;gives&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\log_a(x) = \log_b(x) \log_a(b)&#10;\end{displaymath}&#10; --&gt;&lt;img width="185" height="31" border="0" src="https://technick.net/img/guide_dft/img344.png" alt="\" egin="" isplaymath="" og="" a="" log="" b="" log="" a="" b="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;which tells how to convert the base from &lt;img width="11" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img327.png" alt="$b$" /&gt; to &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img192.png" alt="$a$" /&gt;, that is, how to&#10;convert the log base &lt;img width="11" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img327.png" alt="$b$" /&gt; of &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; to the log base &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img192.png" alt="$a$" /&gt; of &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt;. (Just&#10;multiply by the log base &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img192.png" alt="$a$" /&gt; of &lt;img width="11" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img327.png" alt="$b$" /&gt;.)&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/logarithms"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/logarithms_negative_imagina"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Logarithms of Negative and Imaginary Numbers</title><link>https://technick.net/guides/theory/dft/logarithms_negative_imagina/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/logarithms_negative_imagina/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/changing_base"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/decibels"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00512000000000000000"&gt;Logarithms of Negative and Imaginary Numbers&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;By &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/proof_euler_s_identity"&gt;Euler's formula&lt;/a&gt;&lt;/i&gt;, &lt;img width="68" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img345.png" alt="$e^{j\" i="i" /&gt;, so that&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\ln(-1) = j\pi&#10;\end{displaymath}&#10; --&gt;&lt;img width="92" height="31" border="0" src="https://technick.net/img/guide_dft/img346.png" alt="\" egin="" isplaymath="" n="" pi="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;from which it follows that for any &lt;img width="42" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img347.png" alt="$x&amp;lt;0$" /&gt;, &lt;!-- MATH&#10; $\ln(x) = j\pi + \ln(|x|)$&#10; --&gt;&lt;img width="140" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img348.png" alt="$\" n="" j\pi="" n="" ert="" ert="" /&gt;.&lt;p&gt;Similarly, &lt;!-- MATH&#10; $e^{j\pi/2} = j$&#10; --&gt;&lt;img width="68" height="36" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img349.png" alt="$e^{j\" i="i" j="" /&gt;, so that&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\ln(j) = j\frac{\pi}{2}&#10;\end{displaymath}&#10; --&gt;&lt;img width="81" height="39" border="0" src="https://technick.net/img/guide_dft/img350.png" alt="\" egin="" isplaymath="" n="" j\frac="" i="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;and for any imaginary number &lt;img width="49" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img351.png" alt="$z = jy$" /&gt;, &lt;!-- MATH&#10; $\ln(z) = j\pi/2 + \ln(y)$&#10; --&gt;&lt;img width="145" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img352.png" alt="$\" n="" j\pi="" n="" /&gt;,&#10;where &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img13.png" alt="$y$" /&gt; is real.&lt;p&gt;Finally, from the polar representation &lt;!-- MATH&#10; $z=r e^{j\theta}$&#10; --&gt;&lt;img width="62" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img353.png" alt="$z=r e^{j\" heta="" /&gt; for&lt;a href="https://technick.net/guides/theory/dft/introduction_complex_number"&gt;complex numbers&lt;/a&gt;,&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\ln(z) \isdef \ln(r e^{j\theta}) = \ln(r) + j\theta&#10;\end{displaymath}&#10; --&gt;&lt;img width="218" height="31" border="0" src="https://technick.net/img/guide_dft/img354.png" alt="\" egin="" isplaymath="" n="" isdef="" n="" j\theta="" n="" j\theta="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where &lt;img width="41" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img355.png" alt="$r&amp;gt;0$" /&gt; and &lt;img width="12" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img156.png" alt="$\" heta="" /&gt; are real. Thus, the log of the magnitude of&#10;a complex number behaves like the log of any positive real number,&#10;while the log of its phase term &lt;img width="25" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img3.png" alt="$e^{j\" heta="" /&gt; extracts its phase&#10;(times &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img63.png" alt="$j$" /&gt;).&lt;p&gt;As an example of the use of logarithms in signal processing, note that&#10;the negative imaginary part of the derivative of the log of a&lt;i&gt;spectrum&lt;/i&gt; &lt;img width="41" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img356.png" alt="$X(\" mega="" /&gt; is defined as the &lt;i&gt;group&#10;delay&lt;/i&gt;&lt;a name="tex2html14" href="https://technick.net/guides/theory/dft/footnode#foot5228"&gt;&lt;sup&gt;4.1&lt;/sup&gt;&lt;/a&gt;of the signal &lt;img width="31" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img357.png" alt="$x(t)$" /&gt;:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;D_x(\omega) \isdef - \mbox{im}\left\{\frac{d}{d\omega} \ln(X(\omega))\right\}&#10;\end{displaymath}&#10; --&gt;&lt;img width="230" height="49" border="0" src="https://technick.net/img/guide_dft/img358.png" alt="\" egin="" isplaymath="" x="" mega="" sdef="" box="" m="" eft\="" rac="" d\omega="" n="" omega="" ight\="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Another usage is in &lt;i&gt;Homomorphic Signal Processing&lt;/i&gt; [&lt;a href="https://technick.net/guides/theory/dft/bibliography#OppenheimAndSchafer"&gt;8&lt;/a&gt;, Chapter&#10;10] in which the multiplicative formants&#10;in vocal spectra are converted to additive low-frequency variations in&#10;the spectrum (with the harmonics being the high-frequency variation in&#10;the spectrum). Thus, the lowpass-filtered log spectrum contains only&#10;the formants, and the complementarily highpass-filtered log spectrum&#10;contains only the fine structure associated with the pitch.&lt;p&gt;&lt;blockquote&gt;&lt;b&gt;Exercise:&lt;/b&gt; Work out the definition of logarithms using a &lt;i&gt;complex&lt;/i&gt; base &lt;img width="11" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img327.png" alt="$b$" /&gt;.&lt;/blockquote&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/changing_base"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/decibels"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Decibels</title><link>https://technick.net/guides/theory/dft/decibels/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/decibels/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/logarithms_negative_imagina"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/properties_db_scales"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00520000000000000000"&gt;Decibels&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;A &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/decibels"&gt;decibel&lt;/a&gt;&lt;/i&gt;&lt;a name="5343"&gt;&lt;/a&gt; (abbreviated &lt;a href="https://technick.net/guides/theory/dft/decibels"&gt;dB&lt;/a&gt;) is defined as one tenth of a&lt;i&gt;bel&lt;/i&gt;&lt;a name="5345"&gt;&lt;/a&gt;. The bel&lt;a name="tex2html15" href="https://technick.net/guides/theory/dft/footnode#foot4779"&gt;&lt;sup&gt;4.2&lt;/sup&gt;&lt;/a&gt; is an &lt;a href="https://technick.net/guides/theory/dft/logarithms"&gt;amplitude&lt;/a&gt; unit&#10;defined for sound as the log (base 10) of the &lt;i&gt;intensity&lt;/i&gt;relative to some &lt;i&gt;reference intensity&lt;/i&gt;,&lt;a name="tex2html16" href="https://technick.net/guides/theory/dft/footnode#foot5230"&gt;&lt;sup&gt;4.3&lt;/sup&gt;&lt;/a&gt; &#10;i.e.,&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\mbox{Amplitude\_in\_bels} = \log_{10}\left(\frac{\mbox{Signal\_Intensity}}{\mbox{Reference\_Intensity}}\right)&#10;\end{displaymath}&#10; --&gt;&lt;img width="377" height="49" border="0" src="https://technick.net/img/guide_dft/img359.png" alt="\" egin="" isplaymath="" box="" mplitude\="" n\="" els="" og="" eft="" rac="" box="" ignal\="" ntensity="" box="" eference\="" ntensity="" ight="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;The choice of reference intensity (or power) defines the particular&#10;choice of &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/decibels"&gt;dB scale&lt;/a&gt;&lt;/i&gt;&lt;a name="5355"&gt;&lt;/a&gt;. Signal intensity, power, and energy are&#10;always proportional to the &lt;i&gt;square&lt;/i&gt; of the signal&lt;i&gt;amplitude&lt;/i&gt;. Thus, we can always translate these energy-related&#10;measures into squared amplitude:&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\mbox{Amplitude\_in\_bels} = &#10;\log_{10}\left(\frac{\mbox{Amplitude}^2}{\mbox{Amplitude}_{\mbox{\small ref}}^2}\right)&#10;= 2\log_{10}\left(\frac{\left|\mbox{Amplitude}\right|}{\left|\mbox{Amplitude}_{\mbox{\small ref}}\right|}\right)&#10;\end{displaymath}&#10; --&gt;&lt;img width="548" height="60" border="0" src="https://technick.net/img/guide_dft/img360.png" alt="\" egin="" isplaymath="" box="" mplitude\="" n\="" els="" og="" eft="" rac="" box="" mp="" t\vert\mbox="" mplitude="" box="" mall="small" ef="" ight\vert="" ight="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Since there are 10 decibels to a bel, we also have&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;\mbox{Amplitude}_{\mbox{\small dB}} &amp;=&amp; &#10;20\log_{10}\left(\frac{\left|\mbox{Amplitude}\right|}{\left|\mbox{Amplitude}_{\mbox{\small ref}}\right|}\right) &#10;= 10\log_{10}\left(\frac{\mbox{Intensity}}{\mbox{Intensity}_{\mbox{\small ref}}}\right)\\&#10;&amp;=&amp; 10\log_{10}\left(\frac{\mbox{Power}}{\mbox{Power}_{\mbox{\small ref}}}\right)&#10;= 10\log_{10}\left(\frac{\mbox{Energy}}{\mbox{Energy}_{\mbox{\small ref}}}\right)&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="551" height="99" border="0" src="https://technick.net/img/guide_dft/img361.png" alt="\" egin="" qnarray="" box="" mplitude="" box="" mall="small" b="b" log="" eft="" ra="" frac="" box="" nergy="" box="" nergy="" box="" mall="small" ef="" ight="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;A &lt;i&gt;just-noticeable difference&lt;/i&gt;&lt;a name="5367"&gt;&lt;/a&gt; (JND&lt;a name="5368"&gt;&lt;/a&gt;) in amplitude level&#10;is on the order of a quarter dB. In the early days of telephony, one&#10;dB was considered a reasonable ''smallest step'' in amplitude, but in&#10;reality, a series of half-dB amplitude steps does not sound very&#10;smooth, while quarter-dB steps do sound pretty smooth. A typical&#10;professional audio &lt;a href="http://www-users.cs.york.ac.uk/~fisher/mkfilter/default.php"&gt;filter-design&lt;/a&gt; specification for ''ripple in the&#10;passband'' is 0.1 dB.&lt;blockquote&gt;&lt;b&gt;Exercise:&lt;/b&gt; Try synthesizing a sawtooth waveform which increases by 1/2&#10;dB a few times per second, and again using 1/4 dB increments. See if you&#10;agree that quarter-dB increments are ''smooth'' enough for you.&lt;/blockquote&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;hr /&gt;&lt;!--Table of Child-Links--&gt;&lt;a name="CHILD_LINKS"&gt;&lt;strong&gt;Subsections&lt;/strong&gt;&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html937" href="https://technick.net/guides/theory/dft/properties_db_scales"&gt;Properties of DB Scales&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html938" href="https://technick.net/guides/theory/dft/specific_db_scales"&gt;Specific DB Scales&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html939" href="https://technick.net/guides/theory/dft/dbm_scale"&gt;DBm Scale&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html940" href="https://technick.net/guides/theory/dft/dbv_scale"&gt;DBV Scale&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html941" href="https://technick.net/guides/theory/dft/db_spl"&gt;DB SPL&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html942" href="https://technick.net/guides/theory/dft/db_display"&gt;DB for Display&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html943" href="https://technick.net/guides/theory/dft/dynamic_range"&gt;Dynamic Range&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;!--End of Table of Child-Links--&gt;&#10;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/logarithms_negative_imagina"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/properties_db_scales"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Properties of DB Scales</title><link>https://technick.net/guides/theory/dft/properties_db_scales/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/properties_db_scales/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/decibels"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/specific_db_scales"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00521000000000000000"&gt;Properties of DB Scales&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;In every kind of &lt;a href="https://technick.net/guides/theory/dft/decibels"&gt;dB&lt;/a&gt;, a &lt;i&gt;factor of 10&lt;/i&gt; in &lt;a href="https://technick.net/guides/theory/dft/logarithms"&gt;amplitude&lt;/a&gt; &lt;i&gt;gain&lt;/i&gt; corresponds&#10;to a &lt;i&gt;20 dB boost&lt;/i&gt;&lt;a name="5370"&gt;&lt;/a&gt; (increase by 20 dB):&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;20\log_{10}\left(\frac{10 \cdot A}{A_{\mbox{\small ref}}}\right)&#10;= \underbrace{20\log_{10}(10)}_{\mbox{$20$\ dB}} + 20\log_{10}\left(\frac{A}{A_{\mbox{\small ref}}}\right)&#10;\end{displaymath}&#10; --&gt;&lt;img width="384" height="67" border="0" src="https://technick.net/img/guide_dft/img362.png" alt="\" egin="" isplaymath="" og="" eft="" rac="" dot="" a="" box="" mall="small" ef="" i="" b="" og="" eft="" rac="" a="" a="" box="" mall="small" ef="" ight="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;and &lt;!-- MATH&#10; $20\log_{10}(10) = 20$&#10; --&gt;&lt;img width="122" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img363.png" alt="$20\" og="" /&gt;, of course.&lt;p&gt;Similarly, a factor of 2 in amplitude gain corresponds&#10;to a 6 dB boost:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;20\log_{10}\left(\frac{2 \cdot A}{A_{\mbox{\small ref}}}\right)&#10;= \underbrace{20\log_{10}(2)}_{\mbox{$6$\ dB}}&#10;+ 20\log_{10}\left(\frac{A}{A_{\mbox{\small ref}}}\right)&#10;\end{displaymath}&#10; --&gt;&lt;img width="366" height="67" border="0" src="https://technick.net/img/guide_dft/img364.png" alt="\" egin="" isplaymath="" og="" eft="" rac="" dot="" a="" box="" mall="small" ef="" ig="" b="" og="" eft="" rac="" a="" a="" box="" mall="small" ef="" ight="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;and &lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;20\log_{10}(2) = 6.0205999\ldots \approx 6 \; \mbox{dB}.&#10;\end{displaymath}&#10; --&gt;&lt;img width="266" height="31" border="0" src="https://technick.net/img/guide_dft/img365.png" alt="\" egin="" isplaymath="" og="" dots="" pprox="" box="" b="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;A &lt;i&gt;doubling of power&lt;/i&gt; corresponds to a &lt;i&gt;3 dB boost&lt;/i&gt;&lt;a name="5372"&gt;&lt;/a&gt;:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;10\log_{10}\left(\frac{2 \cdot A^2}{A^2_{\mbox{\small ref}}}\right)&#10;= \underbrace{10\log_{10}(2)}_{\mbox{$3$\ dB}}&#10;+ 10\log_{10}\left(\frac{A^2}{A^2_{\mbox{\small ref}}}\right)&#10;\end{displaymath}&#10; --&gt;&lt;img width="377" height="72" border="0" src="https://technick.net/img/guide_dft/img366.png" alt="\" egin="" isplaymath="" og="" eft="" rac="" dot="" a="" box="" mall="small" ef="" og="" eft="" rac="" a="" a="" box="" mall="small" ef="" ight="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;and &lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;10\log_{10}(2) = 3.010\ldots \approx 3\;\mbox{dB}.&#10;\end{displaymath}&#10; --&gt;&lt;img width="230" height="31" border="0" src="https://technick.net/img/guide_dft/img367.png" alt="\" egin="" isplaymath="" og="" dots="" pprox="" box="" b="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;Finally, note that the choice of &lt;i&gt;reference&lt;/i&gt; merely determines a&#10;vertical offset in the &lt;a href="https://technick.net/guides/theory/dft/decibels"&gt;dB scale&lt;/a&gt;:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;20\log_{10}\left(\frac{A}{A_{\mbox{\small ref}}}\right)&#10;= 20\log_{10}(A) - \underbrace{20\log_{10}(A_{\mbox{\small ref}})}_{\mbox{constant offset}}&#10;\end{displaymath}&#10; --&gt;&lt;img width="364" height="67" border="0" src="https://technick.net/img/guide_dft/img368.png" alt="\" egin="" isplaymath="" og="" eft="" rac="" a="" a="" box="" mall="small" ef="" ight="" log="" a="" box="" mall="small" ef="" box="" onstant="" fset="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/decibels"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/specific_db_scales"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Specific DB Scales</title><link>https://technick.net/guides/theory/dft/specific_db_scales/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/specific_db_scales/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/properties_db_scales"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dbm_scale"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00522000000000000000"&gt;Specific DB Scales&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;Since we so often rescale our signals to suit various needs (avoiding&#10;overflow, reducing quantization &lt;a href="http://www.treasure-troves.com/physics/noise.php"&gt;noise&lt;/a&gt;, making a nicer plot, etc.),&#10;there seems to be little point in worrying about what the &lt;a href="https://technick.net/guides/theory/dft/decibels"&gt;dB&lt;/a&gt; reference&#10;is--we simply choose it implicitly when we rescale to obtain signal&#10;values in the range we want to see. Nevertheless, a few specific &lt;a href="https://technick.net/guides/theory/dft/decibels"&gt;dB&#10;scales&lt;/a&gt; are worth knowing about.&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;hr /&gt;&lt;!--Table of Child-Links--&gt;&lt;a name="CHILD_LINKS"&gt;&lt;strong&gt;Subsections&lt;/strong&gt;&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html968" href="https://technick.net/guides/theory/dft/dbm_scale"&gt;DBm Scale&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html969" href="https://technick.net/guides/theory/dft/dbv_scale"&gt;DBV Scale&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html970" href="https://technick.net/guides/theory/dft/db_spl"&gt;DB SPL&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html971" href="https://technick.net/guides/theory/dft/db_display"&gt;DB for Display&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;!--End of Table of Child-Links--&gt;&#10;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/properties_db_scales"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dbm_scale"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>DBm Scale</title><link>https://technick.net/guides/theory/dft/dbm_scale/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/dbm_scale/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/specific_db_scales"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dbv_scale"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;&lt;a name="SECTION00522100000000000000"&gt;DBm Scale&lt;/a&gt;&lt;/h3&gt;&lt;p&gt;One common &lt;a href="https://technick.net/guides/theory/dft/decibels"&gt;dB scale&lt;/a&gt; in audio recording is the &lt;a href="https://technick.net/guides/theory/dft/dbm_scale"&gt;dBm scale&lt;/a&gt; in which the&#10;reference power is taken to be a milliwatt (1 mW) dissipated by a 600&lt;a href="http://www.treasure-troves.com/physics/ohm.php"&gt;Ohm&lt;/a&gt; resistor. (See Appendix B for a primer on resistors, voltage,&#10;current, and power.)&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/specific_db_scales"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dbv_scale"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>DBV Scale</title><link>https://technick.net/guides/theory/dft/dbv_scale/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/dbv_scale/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/dbm_scale"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/db_spl"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;&lt;a name="SECTION00522200000000000000"&gt;DBV Scale&lt;/a&gt;&lt;/h3&gt;&lt;p&gt;Another &lt;a href="https://technick.net/guides/theory/dft/decibels"&gt;dB scale&lt;/a&gt; is the dBV scale which sets 0 dBV to 1 volt.&#10;Thus, a 100-volt signal is &lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;20\log_{10}\left(\frac{100V}{1V}\right) = \mbox{40 dBV}&#10;\end{displaymath}&#10; --&gt;&lt;img width="214" height="49" border="0" src="https://technick.net/img/guide_dft/img369.png" alt="\" egin="" isplaymath="" og="" eft="" rac="" v="" ight="" box="" bv="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;and a 1000-volt signal is &lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;20\log_{10}\left(\frac{1000V}{1V}\right) = \mbox{60 dBV}&#10;\end{displaymath}&#10; --&gt;&lt;img width="222" height="49" border="0" src="https://technick.net/img/guide_dft/img370.png" alt="\" egin="" isplaymath="" og="" eft="" rac="" v="" ight="" box="" bv="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Note that the dBV scale is undefined for current or power, unless the&#10;voltage is assumed to be across a standard resistor value, such as 600&lt;a href="http://www.treasure-troves.com/physics/ohm.php"&gt;Ohms&lt;/a&gt;.&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/dbm_scale"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/db_spl"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>DB SPL</title><link>https://technick.net/guides/theory/dft/db_spl/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/db_spl/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/dbv_scale"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/db_display"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;&lt;a name="SECTION00522300000000000000"&gt;DB SPL&lt;/a&gt;&lt;/h3&gt;&lt;p&gt;&lt;i&gt;Sound Pressure Level&lt;/i&gt;&lt;a name="5374"&gt;&lt;/a&gt; (SPL&lt;a name="5375"&gt;&lt;/a&gt;) is defined using a reference&#10;which is approximately the intensity of 1000 Hz &lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;sinusoid&lt;/a&gt; that is just&#10;barely audible (0 ''phons''). In &lt;i&gt;pressure&lt;/i&gt; units:&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;\mbox{$0$\ dB SPL} &amp;\isdef &amp; \mbox{0.0002 $\mu$bar (micro-barometric &#10;&#9;&#9;pressure\footnote{The bar was originally defined as&#10;&#9;&#9;$10^{-6}$\ atmospheres, but now it is defined to be exactly&#10;&#9;&#9;1 $\mbox{dyne}/\mbox{cm}^2$.})} \\&#10;&#9;&amp;=&amp; \mbox{20 $\mu$Pa (micro-Pascals)} \\&#10;&#9;&amp;=&amp; \mbox{$2.9\times 10^{-9}$\ PSI (pounds per square inch)} \\&#10;&#9;&amp;=&amp; 2\times 10^{-4}\, \frac{\mbox{\small dynes}}{\mbox{\small cm}^2} &#10;&#9;&#9;\quad\mbox{(CGS units)} \\&#10;&#9;&amp;=&amp; 2\times 10^{-5}\, \frac{\mbox{\small nt}}{\mbox{\small m}^2} &#10;&#9;&#9;\quad\mbox{(MKS units)}&#10;\end{eqnarray*}&#10; --&gt;&lt;a name="tex2html17" href="https://technick.net/guides/theory/dft/footnode#foot5261"&gt;&lt;img width="441" height="152" border="0" src="https://technick.net/img/guide_dft/img372.png" alt="\" egin="" qnarray="" box="" b="" l="" sdef="" box="" u="" ar="" icro-baro="" ac="" box="" mallnt="" box="" mallm="" uad\mbox="" ks="" its="" nd="" qnarray="" /&gt;&lt;/a&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;In &lt;i&gt;intensity&lt;/i&gt; units:&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;I_0 = 10^{-16} \frac{\mbox{\small W}}{\mbox{\small cm}^2}&#10;\end{displaymath}&#10; --&gt;&lt;img width="113" height="42" border="0" src="https://technick.net/img/guide_dft/img373.png" alt="\" egin="" isplaymath="" i="" rac="" box="" mall="small" mbox="" mall="small" m="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;which corresponds to a root-mean-square (rms) pressure &lt;a href="https://technick.net/guides/theory/dft/logarithms"&gt;amplitude&lt;/a&gt; of &lt;img width="32" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img374.png" alt="$20.4$" /&gt;&lt;img width="14" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img5.png" alt="$\" u="u" /&gt;Pa, or about &lt;img width="20" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img240.png" alt="$20$" /&gt; &lt;img width="14" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img5.png" alt="$\" u="u" /&gt;Pa, as listed above. The &lt;i&gt;wave impedance&lt;/i&gt;of air plays the role of ''resistor'' in relating the pressure- and&#10;intensity-based references exactly analogous to the &lt;a href="https://technick.net/guides/theory/dft/dbm_scale"&gt;dBm&lt;/a&gt; case discussed&#10;above.&lt;p&gt;Since &lt;i&gt;sound&lt;/i&gt; is created by a time-varying pressure, we compute sound&#10;levels in dB-SPL by using the &lt;i&gt;average&lt;/i&gt; intensity (averaged over at&#10;least one period of the lowest frequency contained in the sound).&lt;/p&gt;&lt;p&gt;Table &lt;a href="https://technick.net/guides/theory/dft/db_spl#table:dBlevels"&gt;4.1&lt;/a&gt; gives a list list of common sound levels and their &lt;a href="https://technick.net/guides/theory/dft/decibels"&gt;dB&lt;/a&gt;equivalents&lt;a name="tex2html18" href="https://technick.net/guides/theory/dft/footnode#foot5269"&gt;&lt;sup&gt;4.5&lt;/sup&gt;&lt;/a&gt; [&lt;a href="https://technick.net/guides/theory/dft/bibliography#Pierce"&gt;9&lt;/a&gt;]:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="5387"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption&gt;&lt;strong&gt;Table 4.1:&lt;/strong&gt;Ballpark figures for the dB-SPL level of common sounds.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;table cellpadding="3" border="1" align="CENTER"&gt;&lt;tr&gt;&lt;td align="LEFT"&gt;&lt;b&gt;Sound&lt;/b&gt;&lt;/td&gt;&lt;td align="CENTER"&gt;&lt;b&gt;dB-SPL&lt;/b&gt;&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="LEFT"&gt;Jet engine at 3m&lt;/td&gt;&lt;td align="CENTER"&gt;140&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="LEFT"&gt;Threshold of pain&lt;/td&gt;&lt;td align="CENTER"&gt;130&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="LEFT"&gt;Rock concert&lt;/td&gt;&lt;td align="CENTER"&gt;120&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="LEFT"&gt;Accelerating motorcycle at 5m&lt;/td&gt;&lt;td align="CENTER"&gt;110&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="LEFT"&gt;Pneumatic hammer at 2m&lt;/td&gt;&lt;td align="CENTER"&gt;100&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="LEFT"&gt;Noisy factory&lt;/td&gt;&lt;td align="CENTER"&gt;90&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="LEFT"&gt;Vacuum cleaner&lt;/td&gt;&lt;td align="CENTER"&gt;80&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="LEFT"&gt;Busy traffic&lt;/td&gt;&lt;td align="CENTER"&gt;70&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="LEFT"&gt;Quiet restaurant&lt;/td&gt;&lt;td align="CENTER"&gt;50&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="LEFT"&gt;Residential area at night&lt;/td&gt;&lt;td align="CENTER"&gt;40&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="LEFT"&gt;Empty movie house&lt;/td&gt;&lt;td align="CENTER"&gt;30&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="LEFT"&gt;Rustling of leaves&lt;/td&gt;&lt;td align="CENTER"&gt;20&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="LEFT"&gt;Human breathing (at 3m)&lt;/td&gt;&lt;td align="CENTER"&gt;10&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="LEFT"&gt;Threshold of hearing (good ears)&lt;/td&gt;&lt;td align="CENTER"&gt;0&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;a name="table:dBlevels"&gt;&lt;/a&gt; &lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br /&gt;In my experience, the ''threshold of pain'' is most often defined as 120&#10;dB.&lt;p&gt;The relationship between sound amplitude and actual &lt;i&gt;loudness&lt;/i&gt;&lt;a name="5391"&gt;&lt;/a&gt; is&#10;complex [&lt;a href="https://technick.net/guides/theory/dft/bibliography#StevensAndDavis38"&gt;10&lt;/a&gt;]. Loudness is a perceptual dimension while&#10;sound amplitude is physical. Since loudness sensitivity is closer to&#10;logarithmic than linear in amplitude (especially at moderate to high&#10;loudnesses), we typically use &lt;a href="https://technick.net/guides/theory/dft/decibels"&gt;decibels&lt;/a&gt; to represent sound amplitude,&#10;especially in spectral displays. &lt;/p&gt;&lt;p&gt;The &lt;i&gt;sone amplitude scale&lt;/i&gt;&lt;a name="5393"&gt;&lt;/a&gt; is defined in terms of actual loudness&#10;perception experiments [&lt;a href="https://technick.net/guides/theory/dft/bibliography#StevensAndDavis38"&gt;10&lt;/a&gt;]. At 1kHz and above,&#10;loudness perception is approximately logarithmic above 50 dB SPL or so.&#10;Below that, it tends toward being more linear.&lt;/p&gt;&lt;p&gt;The &lt;i&gt;phon amplitude scale&lt;/i&gt;&lt;a name="5395"&gt;&lt;/a&gt; is simply the &lt;a href="https://technick.net/guides/theory/dft/decibels"&gt;dB scale&lt;/a&gt; at 1kHz&#10;[&lt;a href="https://technick.net/guides/theory/dft/bibliography#StevensAndDavis38"&gt;10&lt;/a&gt;, p.&amp;nbsp;111]. At other frequencies, the amplitude in&#10;phons is defined by following the equal-loudness curve over to 1 kHz and&#10;reading off the level there in dB SPL. In other words, all pure tones have&#10;the same loudness at the same phon level, and 1 kHz is used to set the&#10;reference in dB SPL. Just remember that one phon is one dB-SPL at 1 kHz.&#10;Looking at the Fletcher-Munson equal-loudness curves&#10;[&lt;a href="https://technick.net/guides/theory/dft/bibliography#StevensAndDavis38"&gt;10&lt;/a&gt;, p.&amp;nbsp;124], loudness in phons can be read off &#10;along the vertical line at 1 kHz.&lt;/p&gt;&lt;p&gt;Classically, the &lt;i&gt;intensity level&lt;/i&gt;&lt;a name="5397"&gt;&lt;/a&gt; of a sound wave is its dB SPL&#10;level, measuring the peak time-domain &lt;a href="http://www.treasure-troves.com/physics/pressurewave.php"&gt;pressure-wave&lt;/a&gt; amplitude relative to&lt;img width="44" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img375.png" alt="$10^{-16}$" /&gt; watts per centimeter squared (i.e., there is no consideration of&#10;the frequency domain here at all).&lt;/p&gt;&lt;p&gt;Another classical term still encountered is the &lt;i&gt;sensation level&lt;/i&gt;&lt;a name="5399"&gt;&lt;/a&gt; of&#10;pure tones: The sensation level is the number of dB SPL above the&lt;i&gt;hearing threshold&lt;/i&gt; at that frequency [&lt;a href="https://technick.net/guides/theory/dft/bibliography#StevensAndDavis38"&gt;10&lt;/a&gt;, p.&amp;nbsp;110].&lt;/p&gt;&lt;p&gt;For further information on ''doing it right,'' see, for example,&lt;br /&gt;http://www.measure.demon.co.uk/Acoustics_Software/loudness.php.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/dbv_scale"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/db_display"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>DB for Display</title><link>https://technick.net/guides/theory/dft/db_display/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/db_display/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/db_spl"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dynamic_range"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;&lt;a name="SECTION00522400000000000000"&gt;DB for Display&lt;/a&gt;&lt;/h3&gt;&lt;p&gt;In practical signal processing, it is common to choose the &lt;i&gt;maximum&#10;signal magnitude&lt;/i&gt; as the reference &lt;a href="https://technick.net/guides/theory/dft/logarithms"&gt;amplitude&lt;/a&gt;. That is, we normalize the&#10;signal so that the maximum amplitude is defined as 1, or 0 &lt;a href="https://technick.net/guides/theory/dft/decibels"&gt;dB&lt;/a&gt;. This&#10;convention is also used by ''sound level meters'' in audio recording. When&#10;displaying magnitude spectra, the highest spectral peak is often normalized&#10;to 0 dB. We can then easily read off lower peaks as so many dB below the&#10;highest peak.&lt;/p&gt;&lt;p&gt;Figure&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/db_display#fig:freqdpy"&gt;4.1&lt;/a&gt;b shows a plot of the &lt;a href="http://www.treasure-troves.com/math/fastfouriertransform.php"&gt;Fast Fourier Transform&lt;/a&gt; (FFT)&#10;of ten periods of a ''Kaiser-windowed'' &lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;sinusoid&lt;/a&gt; at &lt;img width="28" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img376.png" alt="$440$" /&gt; Hz. (FFT windowswill be discussed later in this course. For now, just think of the window&#10;as selecting and tapering a finite-duration section of the signal.) Note&#10;that the peak dB magnitude has been normalized to zero, and that the plot&#10;has been clipped at -100 dB.&lt;/p&gt;&lt;p&gt; &lt;div align="CENTER"&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:freqdpy"&gt;&lt;/a&gt;&lt;a name="5404"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure 4.1:&lt;/strong&gt;a) Ten Periods of a Sinusoid and&#10;b) its FFT magnitude.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; $\scalebox{0.8}{\includegraphics{eps/freqdpy.eps}}$&#10; --&gt;&lt;img width="638" height="517" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img377.png" alt="\" calebox="" ncludegraphics="" ps="" reqdpy="" ps="" /&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;&lt;p&gt;Below is the &lt;a href="http://www.mathworks.com/access/helpdesk/help/techdoc/basics/getstarted.shtml"&gt;Matlab&lt;/a&gt; code for producing Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/db_display#fig:freqdpy"&gt;4.1&lt;/a&gt;. Note that it&#10;contains several elements (windows, zero padding, spectral interpolation)&#10;that we will not cover until later. They are included here as ''forward&#10;references'' in order to keep the example realistic and practical, and to&#10;give you an idea of ''how far we have to go'' before we know how to do&#10;practical &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;spectrum analysis&lt;/a&gt;. Otherwise, the example just illustrates&#10;plotting spectra on an arbitrary &lt;a href="https://technick.net/guides/theory/dft/decibels"&gt;dB scale&lt;/a&gt; between convenient limits.&lt;pre&gt;&#10;% Example practical display of the FFT of a synthesized sinusoid&#10;&lt;p&gt;fs = 44100; % &lt;a href="https://technick.net/guides/theory/dft/shannon_s_sampling_theorem"&gt;Sampling rate&lt;/a&gt;&#10;f = 440; % Sinusoidal frequency = A-440&#10;nper = 10; % Number of periods to synthesize&#10;dur = nper/f; % Duration in seconds&#10;T = 1/fs; % &lt;a href="https://technick.net/guides/theory/dft/shannon_s_sampling_theorem"&gt;Sampling period&lt;/a&gt;&#10;t = 0:T:dur; % Discrete-time axis in seconds&#10;L = length(t) % Number of samples to synthesize&#10;ZP = 5; % Zero padding factor (for spectral interpolation)&#10;N = 2^(nextpow2(L*ZP)) % FFT size (power of 2)&lt;/p&gt;&#10;&lt;p&gt;x = cos(2&lt;em&gt;pi&lt;/em&gt;f&lt;em&gt;t); % A sinusoid at A-440 (a &amp;ldquo;row vector&amp;rdquo;)&#10;w = kaiser(L,8); % We&amp;rsquo;ll learn a bit about &amp;ldquo;FFT windows&amp;rdquo; later&#10;xw = x .&lt;/em&gt; w&amp;rsquo;; % Need to transpose w to get a row vector&#10;sound(xw,fs); % Might as well listen to it&#10;xzp = [xw,zeros(1,N-L)];% Zero-padded FFT input buffer&#10;X = fft(xzp); % Spectrum of xw, interpolated by factor ZP&lt;/p&gt;&#10;&lt;p&gt;Xmag = abs(X); % Spectral magnitude&#10;Xdb = 20*log10(Xmag); % Spectral magnitude in dB&lt;/p&gt;&#10;&lt;p&gt;XdbMax = max(Xdb); % Peak dB magnitude&#10;Xdbn = Xdb - XdbMax; % Normalize to 0dB peak&lt;/p&gt;&#10;&lt;p&gt;dBmin = -100; % Don&amp;rsquo;t show anything lower than this&#10;Xdbp = max(Xdbn,dBmin); % Normalized, clipped, dB magnitude spectrum&#10;fmaxp = 2&lt;em&gt;f; % Upper frequency limit of plot, in Hz&#10;kmaxp = fmaxp&lt;/em&gt;N/fs; % Upper frequency limit of plot, in bins&#10;fp = fs*[0:kmaxp]/N; % Frequency axis in Hz&lt;/p&gt;&#10;&lt;p&gt;% Ok, plot it already!&lt;/p&gt;&#10;&lt;p&gt;subplot(2,1,1);&#10;plot(1000*t,xw);&#10;xlabel(&amp;lsquo;Time (ms)&amp;rsquo;);&#10;ylabel(&amp;lsquo;Amplitude&amp;rsquo;);&#10;title(sprintf(&amp;lsquo;a) %d Periods of a %3.0f Hz Sinusoid, Kaiser Windowed&amp;rsquo;,nper,f));&lt;/p&gt;&#10;&lt;p&gt;subplot(2,1,2);&#10;plot(fp,Xdbp(1:kmaxp+1)); grid;&#10;% Plot a dashed line where the peak should be:&#10;hold on; plot([440 440],[dBmin,0],&amp;rsquo;&amp;ndash;&amp;rsquo;); hold off;&#10;xlabel(&amp;lsquo;Frequency (Hz)&amp;rsquo;);&#10;ylabel(&amp;lsquo;Magnitude (dB)&amp;rsquo;);&#10;title(sprintf(&amp;lsquo;b) Interpolated FFT of %d Periods of %3.0f Hz Sinusoid&amp;rsquo;,nper,f));&lt;/pre&gt;&lt;/p&gt;&lt;p&gt;The following more compact Matlab produces essentially the same plot, but&#10;without the nice physical units on the horizontal axes: &lt;pre&gt;&#10;x = cos([0:2&lt;em&gt;pi/20:10&lt;/em&gt;2&lt;em&gt;pi]); % 10 periods of a sinusoid, 20 samples/cycle&#10;L = length(x);&#10;xw = x&amp;rsquo; .&lt;/em&gt; kaiser(L,8);&#10;N = 2^nextpow2(L*5);&#10;X = fft([xw&amp;rsquo;,zeros(1,N-L)]);&lt;/p&gt;&#10;&lt;p&gt;subplot(2,1,1); plot(xw);&#10;xlabel(&amp;lsquo;Time (samples)&amp;rsquo;); ylabel(&amp;lsquo;Amplitude&amp;rsquo;);&#10;title(&amp;lsquo;a) 10 Periods of a Kaiser-Windowed Sinusoid&amp;rsquo;);&lt;/p&gt;&#10;&lt;p&gt;subplot(2,1,2); kmaxp = 2&lt;em&gt;10&lt;/em&gt;5; Xl = 20&lt;em&gt;log10(abs(X(1:kmaxp+1)));&#10;plot([10&lt;/em&gt;5+1,10*5+1],[-100,0],[0:kmaxp],max(Xl - max(Xl),-100)); grid;&#10;xlabel(&amp;lsquo;Frequency (Bins)&amp;rsquo;); ylabel(&amp;lsquo;Magnitude (dB)&amp;rsquo;);&#10;title(&amp;lsquo;b) Interpolated FFT of 10 Periods of Sinusoid&amp;rsquo;);&lt;/pre&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/db_spl"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;  &lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;  &lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;  &lt;a href="https://technick.net/guides/theory/dft/dynamic_range"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Dynamic Range</title><link>https://technick.net/guides/theory/dft/dynamic_range/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/dynamic_range/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/db_display"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/linear_number_systems"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00523000000000000000"&gt;Dynamic Range&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;The &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/dynamic_range"&gt;dynamic range&lt;/a&gt;&lt;/i&gt;&lt;a name="5410"&gt;&lt;/a&gt; of a &lt;i&gt;signal processing system&lt;/i&gt; can be&#10;defined as the maximum &lt;a href="https://technick.net/guides/theory/dft/decibels"&gt;dB&lt;/a&gt; level sustainable without overflow (or other&#10;distortion) minus the dB level of the ''&lt;a href="http://www.treasure-troves.com/physics/noise.php"&gt;noise&lt;/a&gt; floor''. &lt;/p&gt;&lt;p&gt;Similarly, the dynamic range of a &lt;i&gt;signal&lt;/i&gt;&lt;a name="5412"&gt;&lt;/a&gt; can be defined as its maximum &lt;a href="https://technick.net/guides/theory/dft/decibels"&gt;decibel&lt;/a&gt; level minus its average&#10;''noise level'' in dB. For digital signals, the limiting noise is&#10;ideally &lt;i&gt;quantization noise&lt;/i&gt;.&lt;/p&gt;&lt;p&gt;Quantization noise is generally modeled as a uniform random variable&#10;between plus and minus half the least significant bit (since rounding to&#10;the nearest representable sample value is normally used). If &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img378.png" alt="$q$" /&gt; denotes&#10;the quantization interval, then the maximum quantization-error magnitude is&lt;img width="28" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img379.png" alt="$q/2$" /&gt;, and its variance (''noise power'') is &lt;!-- MATH&#10; $\sigma^2_q = q^2/12$&#10; --&gt;&lt;img width="81" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img380.png" alt="$\" igma="" q="" /&gt; (see&#10;Appendix A for a derivation of this value).&lt;/p&gt;&lt;p&gt;The rms level of the quantization noise is therefore &lt;!-- MATH&#10; $\sigma_q =&#10;q/(2\sqrt{3})\approx 0.3 q$&#10; --&gt;&lt;img width="148" height="36" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img381.png" alt="$\" igma="" q="" sqrt="" approx="" q="" /&gt;, or about 60% of the maximum error.&lt;/p&gt;&lt;p&gt;The &lt;i&gt;number system&lt;/i&gt; and &lt;i&gt;number of bits&lt;/i&gt; chosen to represent&#10;signal samples determines their available dynamic range. Signal processing&#10;operations such as &lt;a href="http://www.dsptutor.freeuk.com/dfilt1.php"&gt;digital filtering&lt;/a&gt; may use the same number system as the&#10;input signal, or they may use extra bits in the computations, yielding an&#10;increased ''internal dynamic range''.&lt;/p&gt;&lt;p&gt;Since the threshold of hearing is near 0 dB SPL, and since the ''threshold&#10;of pain'' is often defined as 120 dB SPL, we may say that the dynamic range&#10;of human hearing is approximately 120 dB.&lt;/p&gt;&lt;p&gt;&lt;a name="5413"&gt;&lt;/a&gt;The dynamic range of &lt;i&gt;magnetic tape&lt;/i&gt; is approximately 55 dB. To&#10;increase the dynamic range available for analog recording on magnetic&#10;tape, &lt;i&gt;companding&lt;/i&gt;&lt;a name="5415"&gt;&lt;/a&gt; is often used. ''Dolby A'' adds&#10;approximately 10 dB to the dynamic range that will fit on magnetic&#10;tape (by compressing the signal dynamic range by 10 dB), while DBX&#10;adds 30 dB (at the cost of more ''transient&#10;distortion'').&lt;a name="tex2html22" href="https://technick.net/guides/theory/dft/footnode#foot4955"&gt;&lt;sup&gt;4.6&lt;/sup&gt;&lt;/a&gt; In general, any dynamic range&#10;can be mapped to any other dynamic range, subject only to noise&#10;limitations.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/db_display"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/linear_number_systems"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Linear Number Systems for Digital Audio</title><link>https://technick.net/guides/theory/dft/linear_number_systems/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/linear_number_systems/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/dynamic_range"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/pulse_code_modulation"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00530000000000000000"&gt;Linear Number Systems for Digital Audio&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;This section discusses the most commonly used number formats for digital&#10;audio.&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;hr /&gt;&lt;!--Table of Child-Links--&gt;&lt;a name="CHILD_LINKS"&gt;&lt;strong&gt;Subsections&lt;/strong&gt;&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html1040" href="https://technick.net/guides/theory/dft/pulse_code_modulation"&gt;Pulse Code Modulation (PCM)&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1041" href="https://technick.net/guides/theory/dft/binary_integer_fixed_point"&gt;Binary Integer Fixed-Point Numbers&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html1042" href="https://technick.net/guides/theory/dft/one_s_complement_fixed_poin"&gt;One's Complement Fixed-Point Format&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1043" href="https://technick.net/guides/theory/dft/two_s_complement_fixed_poin"&gt;Two's Complement Fixed-Point Format&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1044" href="https://technick.net/guides/theory/dft/general_formula_two_s_compl"&gt;General Formula for Two's-Complement, &#10;&#9;Integer Fixed-Point Numbers&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1045" href="https://technick.net/guides/theory/dft/little_endian_formula"&gt;''Little Endian'' Formula for Two's-Complement,&#10;Integer Fixed-Point Numbers&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1046" href="https://technick.net/guides/theory/dft/fractional_binary_fixed_poi"&gt;Fractional Binary Fixed-Point Numbers&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1047" href="https://technick.net/guides/theory/dft/how_many_bits"&gt;How Many Bits are Enough for Digital Audio?&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1048" href="https://technick.net/guides/theory/dft/when_do_we"&gt;When Do We Have to Swap Bytes When Changing Computers?&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;!--End of Table of Child-Links--&gt;&#10;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/dynamic_range"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/pulse_code_modulation"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Pulse Code Modulation (PCM)</title><link>https://technick.net/guides/theory/dft/pulse_code_modulation/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/pulse_code_modulation/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/linear_number_systems"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/binary_integer_fixed_point"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00531000000000000000"&gt;Pulse Code Modulation (PCM)&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;The ''standard'' number format for sampled audio signals is officially&#10;called &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/pulse_code_modulation"&gt;Pulse Code Modulation&lt;/a&gt; (&lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/pulse_code_modulation"&gt;PCM&lt;/a&gt;&lt;/i&gt;&lt;a name="5417"&gt;&lt;/a&gt;)&lt;/i&gt;. This term simply&#10;means that each signal sample is interpreted as a ''pulse'' (e.g., a&#10;voltage or current pulse) at a particular &lt;a href="https://technick.net/guides/theory/dft/logarithms"&gt;amplitude&lt;/a&gt; which is binary&#10;encoded, typically in &lt;a href="https://technick.net/guides/theory/dft/general_formula_two_s_compl"&gt;two's complement&lt;/a&gt; binary &lt;a href="https://technick.net/guides/theory/dft/binary_integer_fixed_point"&gt;fixed-point&lt;/a&gt; format&#10;(discussed below). When someons says they are giving you a soundfile&#10;in ''raw binary format'', they pretty much always mean (nowadays)&#10;16-bit, two's-complement PCM data. Most mainstream computer soundfile&#10;formats consist of a ''header'' (containing the length, etc.) followed&#10;by 16-bit two's-complement PCM.&lt;/p&gt;&lt;p&gt;You can normally convert a soundfile from one computer's format to another&#10;by stripping off its header and prepending the header for the new machine&#10;(or simply treating it as raw binary format on the destination computer).&#10;The UNIX ''cat'' command can be used for this, as can the &lt;a href="http://www.emacs.org/default.php"&gt;Emacs&lt;/a&gt; text editor&#10;(which handles binary data just fine). The only issue usually is whether&#10;the bytes have to be swapped (an issue discussed further below).&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/linear_number_systems"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/binary_integer_fixed_point"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Binary Integer Fixed-Point Numbers</title><link>https://technick.net/guides/theory/dft/binary_integer_fixed_point/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/binary_integer_fixed_point/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/pulse_code_modulation"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/one_s_complement_fixed_poin"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00532000000000000000"&gt;Binary Integer Fixed-Point Numbers&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;&lt;a name="5418"&gt;&lt;/a&gt;Most prevalent computer languages only offer two kinds of numbers,&lt;i&gt;floating-point&lt;/i&gt; and &lt;i&gt;integer &lt;a href="https://technick.net/guides/theory/dft/binary_integer_fixed_point"&gt;fixed-point&lt;/a&gt;&lt;/i&gt;. &#10;On present-day computers, all numbers are encoded using &lt;i&gt;binary&#10;digits&lt;/i&gt;&lt;a name="5420"&gt;&lt;/a&gt; (called ''bits&lt;a name="5421"&gt;&lt;/a&gt;'') which are either 1 or&#10;0.&lt;a name="tex2html23" href="https://technick.net/guides/theory/dft/footnode#foot5273"&gt;&lt;sup&gt;4.7&lt;/sup&gt;&lt;/a&gt; In C, C++, and &lt;a href="http://java.sun.com/nav/whatis/default.php"&gt;Java&lt;/a&gt;, floating-point variables&#10;are declared as &lt;tt&gt;float&lt;/tt&gt; (32 bits) or &lt;tt&gt;double&lt;/tt&gt; (64 bits), while&#10;integer fixed-point variables are declared as &lt;tt&gt;short int&lt;/tt&gt;(typically 16 bits and never less), &lt;tt&gt;long int&lt;/tt&gt; (typically 32 bits&#10;and never less), or simply &lt;tt&gt;int&lt;/tt&gt; (typically the same as a &lt;tt&gt;long int&lt;/tt&gt;, but sometimes between short and long). For an 8-bit&#10;integer, one can use the &lt;tt&gt;char&lt;/tt&gt; datatype (8 bits).&lt;/p&gt;&lt;p&gt;Since C was designed to accommodate a wide range of hardware,&#10;including old mini-computers, some lattitude was historically allowed&#10;in the choice of these bit-lengths. The &lt;tt&gt;sizeof&lt;/tt&gt; operator is&#10;officially the ''right way'' for a C program to determine the number&#10;of bytes in various data types at run-time, e.g. &lt;tt&gt;sizeof(long)&lt;/tt&gt;.&#10;(The word &lt;tt&gt;int&lt;/tt&gt; can be omitted after &lt;tt&gt;short&lt;/tt&gt; or &lt;tt&gt;long&lt;/tt&gt;.)&#10;Nowadays, however, &lt;tt&gt;short&lt;/tt&gt;s are always 16 bits (at least on all&#10;the major platforms), &lt;tt&gt;int&lt;/tt&gt;s are 32 bits, and &lt;tt&gt;long&lt;/tt&gt;s are&#10;typically 32 bits on 32-bit computers and 64 bits on 64-bit computers&#10;(although some C/C++ compilers use &lt;tt&gt;long long int&lt;/tt&gt; to declare&#10;64-bit ints). Table &lt;a href="https://technick.net/guides/theory/dft/binary_integer_fixed_point#table:byteSizes"&gt;4.2&lt;/a&gt; gives the lengths currently used by GNUC/C++ compilers (usually called ''&lt;tt&gt;gcc&lt;/tt&gt;'' or ''&lt;tt&gt;cc&lt;/tt&gt;'') on&#10;64-bit processors.&lt;a name="tex2html24" href="https://technick.net/guides/theory/dft/footnode#foot4992"&gt;&lt;sup&gt;4.8&lt;/sup&gt;&lt;/a&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="5450"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption&gt;&lt;strong&gt;Table 4.2:&lt;/strong&gt;Byte sizes of GNU C/C++ data types for 64-bit &#10;&#9;architectures.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;table cellpadding="3" border="1" align="CENTER"&gt;&lt;tr&gt;&lt;td align="CENTER"&gt;&lt;b&gt;Type&lt;/b&gt;&lt;/td&gt;&lt;td align="CENTER"&gt;&lt;b&gt;Bytes&lt;/b&gt;&lt;/td&gt;&lt;td align="LEFT"&gt;&lt;b&gt;Notes&lt;/b&gt;&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="CENTER"&gt;&lt;tt&gt;char &lt;/tt&gt;&lt;/td&gt;&lt;td align="CENTER"&gt;1&lt;/td&gt;&lt;td align="LEFT"&gt;&amp;nbsp;&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="CENTER"&gt;&lt;tt&gt;short &lt;/tt&gt;&lt;/td&gt;&lt;td align="CENTER"&gt;2&lt;/td&gt;&lt;td align="LEFT"&gt;&amp;nbsp;&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="CENTER"&gt;&lt;tt&gt;int &lt;/tt&gt;&lt;/td&gt;&lt;td align="CENTER"&gt;4&lt;/td&gt;&lt;td align="LEFT"&gt;&amp;nbsp;&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="CENTER"&gt;&lt;tt&gt;long &lt;/tt&gt;&lt;/td&gt;&lt;td align="CENTER"&gt;8&lt;/td&gt;&lt;td align="LEFT"&gt;(4 bytes on 32-bit machines)&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="CENTER"&gt;&lt;tt&gt;long long &lt;/tt&gt;&lt;/td&gt;&lt;td align="CENTER"&gt;8&lt;/td&gt;&lt;td align="LEFT"&gt;(may become 16 bytes)&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="CENTER"&gt;&lt;tt&gt;type * &lt;/tt&gt;&lt;/td&gt;&lt;td align="CENTER"&gt;8&lt;/td&gt;&lt;td align="LEFT"&gt;(any pointer)&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="CENTER"&gt;&lt;tt&gt;float &lt;/tt&gt;&lt;/td&gt;&lt;td align="CENTER"&gt;4&lt;/td&gt;&lt;td align="LEFT"&gt;&amp;nbsp;&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="CENTER"&gt;&lt;tt&gt;double &lt;/tt&gt;&lt;/td&gt;&lt;td align="CENTER"&gt;8&lt;/td&gt;&lt;td align="LEFT"&gt;&amp;nbsp;&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="CENTER"&gt;&lt;tt&gt;long double &lt;/tt&gt;&lt;/td&gt;&lt;td align="CENTER"&gt;8&lt;/td&gt;&lt;td align="LEFT"&gt;(may become 10 bytes)&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="CENTER"&gt;&lt;tt&gt;size_t &lt;/tt&gt;&lt;/td&gt;&lt;td align="CENTER"&gt;8&lt;/td&gt;&lt;td align="LEFT"&gt;(type of sizeof())&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="CENTER"&gt;T* - T*&lt;/td&gt;&lt;td align="CENTER"&gt;8&lt;/td&gt;&lt;td align="LEFT"&gt;(pointer arithmetic)&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;a name="table:byteSizes"&gt;&lt;/a&gt; &lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br /&gt;&lt;p&gt;Java, which is designed to be platform independent, defines a &lt;tt&gt;long int&lt;/tt&gt; as &lt;i&gt;equivalent in precision to&lt;/i&gt; 64 bits, an &lt;tt&gt;int&lt;/tt&gt;as 32 bits, a &lt;tt&gt;short int&lt;/tt&gt; as 16 bits, and additionally a &lt;tt&gt;byte&#10;int&lt;/tt&gt; as an 8-bit int. Similarly, the ''Structured Audio Orchestra&#10;Language''&#10;(SAOL)&#10;(pronounced ''sail'')--the sound-synthesis component of the newMPEG-4audio compression standard--requires only that the underlying number&#10;system be at least as accurate as 32-bit &lt;tt&gt;float&lt;/tt&gt;s. All &lt;tt&gt;int&lt;/tt&gt;s&#10;discussed thus far are &lt;i&gt;signed&lt;/i&gt; integer formats. C and C++ also&#10;support &lt;i&gt;unsigned&lt;/i&gt; versions of all &lt;tt&gt;int&lt;/tt&gt; types, and they range&#10;from &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img38.png" alt="$0$" /&gt; to &lt;img width="52" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img386.png" alt="$2^N-1$" /&gt; instead of &lt;img width="53" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img387.png" alt="$-2^{N-1}$" /&gt; to &lt;img width="68" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img388.png" alt="$2^{N-1}-1$" /&gt;, where &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt;is the number of bits. Finally, an &lt;tt&gt;unsigned char&lt;/tt&gt; is often used for&#10;integers that only range between 0 and 255.&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;hr /&gt;&lt;!--Table of Child-Links--&gt;&lt;a name="CHILD_LINKS"&gt;&lt;strong&gt;Subsections&lt;/strong&gt;&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html1073" href="https://technick.net/guides/theory/dft/one_s_complement_fixed_poin"&gt;One's Complement Fixed-Point Format&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1074" href="https://technick.net/guides/theory/dft/two_s_complement_fixed_poin"&gt;Two's Complement Fixed-Point Format&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1075" href="https://technick.net/guides/theory/dft/general_formula_two_s_compl"&gt;General Formula for Two's-Complement, &#10;&#9;Integer Fixed-Point Numbers&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1076" href="https://technick.net/guides/theory/dft/little_endian_formula"&gt;''Little Endian'' Formula for Two's-Complement,&#10;Integer Fixed-Point Numbers&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;!--End of Table of Child-Links--&gt;&#10;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/pulse_code_modulation"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/one_s_complement_fixed_poin"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>One's Complement Fixed-Point Format</title><link>https://technick.net/guides/theory/dft/one_s_complement_fixed_poin/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/one_s_complement_fixed_poin/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/binary_integer_fixed_point"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/two_s_complement_fixed_poin"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;&lt;a name="SECTION00532100000000000000"&gt;One's Complement Fixed-Point Format&lt;/a&gt;&lt;/h3&gt;&lt;p&gt;&lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/one_s_complement_fixed_poin"&gt;One's Complement&lt;/a&gt;&lt;/i&gt; is a particular assignment of bit patterns&#10;to numbers. For example, in the case of 3-bit binary numbers, we have&#10;the assignments shown in Table &lt;a href="https://technick.net/guides/theory/dft/one_s_complement_fixed_poin#table:onesComp"&gt;4.3&lt;/a&gt;.&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="5460"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption&gt;&lt;strong&gt;Table 4.3:&lt;/strong&gt;Three-bit one's-complement binary &lt;a href="https://technick.net/guides/theory/dft/binary_integer_fixed_point"&gt;fixed-point&lt;/a&gt; numbers.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;table cellpadding="3" border="1" align="CENTER"&gt;&lt;tr&gt;&lt;td align="CENTER"&gt;Binary&lt;/td&gt;&lt;td align="CENTER"&gt;Decimal&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="CENTER"&gt;000&lt;/td&gt;&lt;td align="CENTER"&gt;0&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="CENTER"&gt;001&lt;/td&gt;&lt;td align="CENTER"&gt;1&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="CENTER"&gt;010&lt;/td&gt;&lt;td align="CENTER"&gt;2&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="CENTER"&gt;011&lt;/td&gt;&lt;td align="CENTER"&gt;3&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="CENTER"&gt;100&lt;/td&gt;&lt;td align="CENTER"&gt;-3&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="CENTER"&gt;101&lt;/td&gt;&lt;td align="CENTER"&gt;-2&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="CENTER"&gt;110&lt;/td&gt;&lt;td align="CENTER"&gt;-1&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="CENTER"&gt;111&lt;/td&gt;&lt;td align="CENTER"&gt;-0&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;a name="table:onesComp"&gt;&lt;/a&gt; &lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br /&gt;&lt;p&gt;In general, &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt;-bit numbers are assigned to binary counter values in&#10;the ''obvious way'' as integers from 0 to &lt;img width="68" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img388.png" alt="$2^{N-1}-1$" /&gt;, and then the&#10;negative numbers are assigned in reverse order, as shown in the&#10;example.&lt;/p&gt;&lt;p&gt;The term ''one's complement'' refers to the fact that negating a number in&#10;this format is accomplished by simply &lt;i&gt;complementing&lt;/i&gt; the bit pattern&#10;(inverting each bit). &lt;/p&gt;&lt;p&gt;Note that there are two representations for zero (all 0s and all 1s). This&#10;is inconvenient when testing if a number is equal to zero. For this&#10;reason, one's complement is generally not used.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/binary_integer_fixed_point"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/two_s_complement_fixed_poin"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Two's Complement Fixed-Point Format</title><link>https://technick.net/guides/theory/dft/two_s_complement_fixed_poin/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/two_s_complement_fixed_poin/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/one_s_complement_fixed_poin"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/general_formula_two_s_compl"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;&lt;a name="SECTION00532200000000000000"&gt;Two's Complement Fixed-Point Format&lt;/a&gt;&lt;/h3&gt;&lt;p&gt;In &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/general_formula_two_s_compl"&gt;two's complement&lt;/a&gt;&lt;/i&gt;, numbers are negated by complementing the&#10;bit pattern and &lt;i&gt;adding 1&lt;/i&gt;, with overflow ignored. From 0 to&lt;img width="68" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img388.png" alt="$2^{N-1}-1$" /&gt;, positive numbers are assigned to binary values exactly as&#10;in &lt;a href="https://technick.net/guides/theory/dft/one_s_complement_fixed_poin"&gt;one's complement&lt;/a&gt;. The remaining assignments (for the negative&#10;numbers) can be carried out using the two's complement negation rule.&#10;Regenerating the &lt;img width="48" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img389.png" alt="$N=3$" /&gt; example in this way gives Table &lt;a href="https://technick.net/guides/theory/dft/two_s_complement_fixed_poin#table:twoscomp"&gt;4.4&lt;/a&gt;.&lt;/p&gt;</description></item><item><title>General Formula for Two's-Complement, Integer Fixed-Point Numbers</title><link>https://technick.net/guides/theory/dft/general_formula_two_s_compl/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/general_formula_two_s_compl/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/two_s_complement_fixed_poin"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/little_endian_formula"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;&lt;a name="SECTION00532300000000000000"&gt;General Formula for Two's-Complement, &#10;&#9;Integer Fixed-Point Numbers&lt;/a&gt;&lt;/h3&gt;&lt;p&gt;Let &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; denote the (even) number of bits. Then the value of a &lt;a href="https://technick.net/guides/theory/dft/general_formula_two_s_compl"&gt;two's&#10;complement&lt;/a&gt; integer &lt;a href="https://technick.net/guides/theory/dft/binary_integer_fixed_point"&gt;fixed-point&lt;/a&gt; number can be expressed in terms of its&#10;bits &lt;!-- MATH&#10; $\{b_i\}_{i=0}^{N-1}$&#10; --&gt;&lt;img width="61" height="36" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img394.png" alt="$\" b="b" i\="" n-1="" /&gt; as&lt;br /&gt;&lt;/p&gt;</description></item><item><title>Little Endian Formula</title><link>https://technick.net/guides/theory/dft/little_endian_formula/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/little_endian_formula/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/general_formula_two_s_compl"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/fractional_binary_fixed_poi"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;&lt;a name="SECTION00532400000000000000"&gt;''Little Endian'' Formula for Two's-Complement,&#10;Integer Fixed-Point Numbers&lt;/a&gt;&lt;/h3&gt;&lt;p&gt;The formula of the preceding section can be considered ''big endian''&#10;because the bits are labeled ''left to right'' in the word as it is&#10;normally visualized. That is, &lt;img width="18" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img400.png" alt="$b_0$" /&gt; is the &lt;i&gt;most&lt;/i&gt; significant bit&#10;instead of the least significant bit. The ''&lt;a href="https://technick.net/guides/theory/dft/little_endian_formula"&gt;little endian&lt;/a&gt;'' convention&#10;numbers bits in order of their &lt;i&gt;significance&lt;/i&gt; instead.&lt;/p&gt;&lt;p&gt;For the ''little-endian'' formula, we simply reverse the bits&#10;&lt;!-- MATH&#10; $\{b_i\}_{i=0}^{N-1}$&#10; --&gt;&lt;img width="61" height="36" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img394.png" alt="$\" b="b" i\="" n-1="" /&gt; in the previous formula:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;x = - b_{N-1} \cdot 2^{N-1} + \sum_{i=0}^{N - 2} b_i \cdot 2^i,\quad b_i\in\{0,1\}&#10;\end{displaymath}&#10; --&gt;&lt;img width="337" height="62" border="0" src="https://technick.net/img/guide_dft/img409.png" alt="\" egin="" isplaymath="" b="b" n-1="" dot="" sum="" n="" b="" i="" dot="" i="" uad="" in\="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;The binary word is now written&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;x = [b_{N-1} b_{N-2} \cdots b_2 b_1 b_0]&#10;\end{displaymath}&#10; --&gt;&lt;img width="192" height="31" border="0" src="https://technick.net/img/guide_dft/img410.png" alt="\" egin="" isplaymath="" b="" n-1="" b="b" n-2="" dots="" b="" b="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;The actual bits in the word are visualized the same in both big and little&#10;endian labelings. For example, in the three-bit case, a decimal 3 is still&#10;a binary &lt;img width="28" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img411.png" alt="$011$" /&gt; and a decimal -4 is still a binary &lt;img width="28" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img412.png" alt="$100$" /&gt;. Only the&#10;bit-symbol subscripts are different: &lt;img width="46" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img413.png" alt="$b_0 b_1 b_2$" /&gt; vs.&amp;nbsp;&lt;img width="46" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img414.png" alt="$b_2 b_1 b_0$" /&gt;.&lt;p&gt;Note that this representation extends to any ''base'' (currently 2).&#10;For example, positive decimal integers can be expanded as&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;x = d_0 \cdot 10^0 + d_1 \cdot 10^1 + d_2 \cdot 10^2 + \cdots&#10;\end{displaymath}&#10; --&gt;&lt;img width="283" height="29" border="0" src="https://technick.net/img/guide_dft/img415.png" alt="\" egin="" isplaymath="" d="" cdot="" cdot="" cdot="" dots="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;and an &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt;-digit integer is written as &lt;!-- MATH&#10; $d_N d_{N-1}\cdots d_2 d_1 d_0$&#10; --&gt;&lt;img width="131" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img416.png" alt="$d_N d_{N-1}\" dots="" d="" /&gt;.&#10;This type of ''positional notation'' was a major ''breakthrough invention''&#10;in ancient times that greatly facilitated the handling of large numbers.&#10;(Have you ever tried working extensively with Roman numerals?)&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/general_formula_two_s_compl"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/fractional_binary_fixed_poi"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Fractional Binary Fixed-Point Numbers</title><link>https://technick.net/guides/theory/dft/fractional_binary_fixed_poi/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/fractional_binary_fixed_poi/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/little_endian_formula"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/how_many_bits"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00533000000000000000"&gt;Fractional Binary Fixed-Point Numbers&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;In ''&lt;a href="http://www.dsptutor.freeuk.com/default.php"&gt;DSP&lt;/a&gt; chips'' (microprocessors explicitly designed for &lt;a href="http://www.dsptutor.freeuk.com/default.php"&gt;digital signal&#10;processing&lt;/a&gt; applications), the most commonly used &lt;a href="https://technick.net/guides/theory/dft/binary_integer_fixed_point"&gt;fixed-point&lt;/a&gt; format is&lt;i&gt;fractional fixed point&lt;/i&gt;, also in &lt;a href="https://technick.net/guides/theory/dft/general_formula_two_s_compl"&gt;two's complement&lt;/a&gt;.&lt;/p&gt;&lt;p&gt;Quite simply, fractional fixed-point numbers are obtained&#10;from integer fixed-point numbers by dividing them by &lt;img width="40" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img417.png" alt="$2^{N-1}$" /&gt;.&#10;Thus, the only difference is a scaling of the assigned numbers.&#10;In the &lt;img width="48" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img389.png" alt="$N=3$" /&gt; case, we have the correspondences shown in Table &lt;a href="https://technick.net/guides/theory/dft/fractional_binary_fixed_poi#table:fracfp"&gt;4.6&lt;/a&gt;.&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="5494"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption&gt;&lt;strong&gt;Table 4.6:&lt;/strong&gt;Three-bit fractional fixed-point numbers.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;table cellpadding="3" border="1" align="CENTER"&gt;&lt;tr&gt;&lt;td align="CENTER"&gt;Binary&lt;/td&gt;&lt;td align="CENTER"&gt;Decimal&lt;/td&gt;&lt;td align="CENTER"&gt;&amp;nbsp;&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="CENTER"&gt;000&lt;/td&gt;&lt;td align="CENTER"&gt;0&lt;/td&gt;&lt;td align="CENTER"&gt;(0/4)&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="CENTER"&gt;001&lt;/td&gt;&lt;td align="CENTER"&gt;0.25&lt;/td&gt;&lt;td align="CENTER"&gt;(1/4)&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="CENTER"&gt;010&lt;/td&gt;&lt;td align="CENTER"&gt;0.5&lt;/td&gt;&lt;td align="CENTER"&gt;(2/4)&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="CENTER"&gt;011&lt;/td&gt;&lt;td align="CENTER"&gt;0.75&lt;/td&gt;&lt;td align="CENTER"&gt;(3/4)&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="CENTER"&gt;100&lt;/td&gt;&lt;td align="CENTER"&gt;-1&lt;/td&gt;&lt;td align="CENTER"&gt;(-4/4)&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="CENTER"&gt;101&lt;/td&gt;&lt;td align="CENTER"&gt;-0.75&lt;/td&gt;&lt;td align="CENTER"&gt;(-3/4)&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="CENTER"&gt;110&lt;/td&gt;&lt;td align="CENTER"&gt;-0.5&lt;/td&gt;&lt;td align="CENTER"&gt;(-2/4)&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="CENTER"&gt;111&lt;/td&gt;&lt;td align="CENTER"&gt;-0.25&lt;/td&gt;&lt;td align="CENTER"&gt;(-1/4)&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;a name="table:fracfp"&gt;&lt;/a&gt; &lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/little_endian_formula"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/how_many_bits"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>How Many Bits are Enough for Digital Audio?</title><link>https://technick.net/guides/theory/dft/how_many_bits/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/how_many_bits/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/fractional_binary_fixed_poi"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/when_do_we"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00534000000000000000"&gt;How Many Bits are Enough for Digital Audio?&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;Armed with the above knowledge, we can visit the question ''how many bits&#10;are enough'' for digital audio. Since the threshold of hearing is around 0db SPL, the ''threshold of pain'' is around 120 &lt;a href="https://technick.net/guides/theory/dft/decibels"&gt;dB&lt;/a&gt; SPL, and each bit in a&#10;linear &lt;a href="https://technick.net/guides/theory/dft/pulse_code_modulation"&gt;PCM&lt;/a&gt; format is worth about 6 dB of &lt;a href="https://technick.net/guides/theory/dft/dynamic_range"&gt;dynamic range&lt;/a&gt;, we find that we&#10;need &lt;img width="81" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img418.png" alt="$120/6 = 20$" /&gt; bits to represent the full dynamic range of audio in a&#10;linear &lt;a href="https://technick.net/guides/theory/dft/binary_integer_fixed_point"&gt;fixed-point&lt;/a&gt; format. This is a simplestic analysis because it is not&#10;quite right to equate the least-significant bit with the threshold of&#10;hearing; instead, we would like to adjust the &lt;i&gt;quantization &lt;a href="http://www.treasure-troves.com/physics/noise.php"&gt;noise&lt;/a&gt;floor&lt;/i&gt; to just below the threshold of hearing. Since the threshold of&#10;hearing is non-uniform, we would also prefer a &lt;i&gt;shaped&lt;/i&gt; quantization&#10;noise floor (a feat that can be accomplished using &lt;i&gt;filtered error&#10;feedback&lt;/i&gt;&lt;a name="tex2html32" href="https://technick.net/guides/theory/dft/footnode#foot5280"&gt;&lt;sup&gt;4.9&lt;/sup&gt;&lt;/a&gt; Nevertheless, the simplistic result gives an&#10;answer similar to the more careful analysis, and 20 bits is a good number.&#10;However, this still does not provide for&lt;i&gt;headroom&lt;/i&gt; needed in a digital recording scenario. We also need both&#10;headroom and &lt;i&gt;guard bits&lt;/i&gt; on the lower end when we plan to carry&#10;out a lot of signal processing operations, especially &lt;a href="http://www.dsptutor.freeuk.com/dfilt1.php"&gt;digital&#10;filtering&lt;/a&gt;. As an example, a 1024-point FFT (&lt;a href="http://www.treasure-troves.com/math/fastfouriertransform.php"&gt;Fast Fourier Transform&lt;/a&gt;)&#10;can give &lt;a href="https://technick.net/guides/theory/dft/logarithms"&gt;amplitudes&lt;/a&gt; 1024 times the input amplitude (such as in the&#10;case of a constant ''dc'' input signal), thus requiring 10 headroom&#10;bits. In general, 24 fixed-point bits are pretty reasonable to work&#10;with, although you still have to scale very carefully, and 32 bits are&#10;preferable.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/fractional_binary_fixed_poi"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/when_do_we"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>When Do We Have to Swap Bytes When Changing Computers?</title><link>https://technick.net/guides/theory/dft/when_do_we/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/when_do_we/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/how_many_bits"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/logarithmic_number_systems"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00535000000000000000"&gt;When Do We Have to Swap Bytes When Changing Computers?&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;When moving a soundfile from one computer to another, such as from a ''PC''&#10;to a ''Mac'' (Intel processor to Motorola processor), the bytes in each&#10;sound sample have to be &lt;i&gt;swapped&lt;/i&gt;. This is because Motorola&#10;processors are &lt;i&gt;big endian&lt;/i&gt; (bytes are numbered from ''left to right''&#10;in a multi-byte word) while Intel processors are &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/little_endian_formula"&gt;little endian&lt;/a&gt;&lt;/i&gt;. Any&#10;Mac program that supports a soundfile format native to PCs (such as &lt;tt&gt;.wav&lt;/tt&gt; files) will swap the bytes for you. You only have to worry about&#10;swapping the bytes yourself when reading &lt;tt&gt;raw binary&lt;/tt&gt; soundfiles from a&#10;foreign computer, or when digging the sound samples out an ''unsupported''&#10;soundfile format yourself. &lt;/p&gt;&lt;p&gt;Since soundfiles typically contain 16 bit samples (not for any good reason,&#10;as we now know), there are only two bytes in each audio sample. Let L&#10;denote the least-significant byte, and M the most-significant byte. Then a&#10;16-bit word is most naturally written &lt;!-- MATH&#10; $[M,L] = M\cdot 256 + L$&#10; --&gt;&lt;img width="151" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img423.png" alt="$[M,L] = M\" dot="" /&gt;, i.e., the&#10;most-significant byte is most naturally written to the left of the&#10;least-significant byte, analogous to the way we write binary or decimal&#10;integers. This ''most natural'' ordering is used in big-endian processors:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\mbox{M,L, M,L, M,L, ..., M,L}\qquad\mbox{(Big Endian)}&#10;\end{displaymath}&#10; --&gt;&lt;img width="319" height="31" border="0" src="https://technick.net/img/guide_dft/img424.png" alt="\" egin="" isplaymath="" box="" l="" l="" l="" l="" quad\mbox="" ig="big" ndian="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Little-endian machines, on the other hand,&#10;store bytes as&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\mbox{L,M, L,M, L,M, ..., L,M}\qquad\mbox{(Little Endian)}&#10;\end{displaymath}&#10; --&gt;&lt;img width="336" height="31" border="0" src="https://technick.net/img/guide_dft/img425.png" alt="\" egin="" isplaymath="" box="" m="" m="" m="" m="" quad\mbox="" ittle="" dian="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;These orderings are preserved when the sound data are written to a disk file.&lt;p&gt;Since a byte (eight bits) is the small addressable unit in all modern day&#10;processor families, we don't have to additionally reverse the &lt;i&gt;bits&lt;/i&gt;in each byte. In other words, bits are not given explicit ''addresses'' in&#10;memory. They are extracted by means other than simple addressing (such as&#10;masking and shifting operations, table look-up, or by means of specialized&#10;processor instructions).&lt;/p&gt;&lt;p&gt;Table &lt;a href="https://technick.net/guides/theory/dft/when_do_we#table:endian"&gt;4.7&lt;/a&gt; lists popular present-day processors and their&#10;''endianness'':&lt;a name="tex2html33" href="https://technick.net/guides/theory/dft/footnode#foot5109"&gt;&lt;sup&gt;4.10&lt;/sup&gt;&lt;/a&gt;&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="5509"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption&gt;&lt;strong&gt;Table 4.7:&lt;/strong&gt;Byte ordering in the major computing platforms.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;table cellpadding="3" border="1" align="CENTER"&gt;&lt;tr&gt;&lt;td align="LEFT"&gt;Processor Family&lt;/td&gt;&lt;td align="LEFT"&gt;Endian&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="LEFT"&gt;Pentium (Intel)&lt;/td&gt;&lt;td align="LEFT"&gt;Little&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="LEFT"&gt;Alpha (DEC/Compaq)&lt;/td&gt;&lt;td align="LEFT"&gt;Little&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="LEFT"&gt;680x0 (Motorola)&lt;/td&gt;&lt;td align="LEFT"&gt;Big&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="LEFT"&gt;PowerPC (Motorola &amp;amp; IBM)&lt;/td&gt;&lt;td align="LEFT"&gt;Big&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="LEFT"&gt;SPARC (Sun)&lt;/td&gt;&lt;td align="LEFT"&gt;Big&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td align="LEFT"&gt;MIPS (SGI)&lt;/td&gt;&lt;td align="LEFT"&gt;Big&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;a name="table:endian"&gt;&lt;/a&gt; &lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br /&gt;When compiling C or C++ programs under UNIX, there may be a BYTE_ORDER&#10;macro in endian.h or bytesex.h. In other cases, there may be a defined&#10;macro __INTEL__, __LITTLE_ENDIAN__, __BIG_ENDIAN__, or the like.&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/how_many_bits"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/logarithmic_number_systems"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Logarithmic Number Systems for Digital Audio</title><link>https://technick.net/guides/theory/dft/logarithmic_number_systems/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/logarithmic_number_systems/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/when_do_we"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/floating_point_numbers"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00540000000000000000"&gt;Logarithmic Number Systems for Digital Audio&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;Since hearing is approximately logarithmic, it makes sense to represent&#10;sound samples in a logarithmic or semi-logarithmic number format.&lt;a href="https://technick.net/guides/theory/dft/floating_point_numbers"&gt;Floating-point numbers&lt;/a&gt; in a computer are partially logarithmic (the&#10;exponent part), and one can even use an entirely &lt;a href="https://technick.net/guides/theory/dft/logarithmic_fixed_point_num"&gt;logarithmic fixed-point&lt;/a&gt;number system. The &lt;img width="14" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img5.png" alt="$\" u="u" /&gt;-law &lt;a href="https://technick.net/guides/theory/dft/logarithms"&gt;amplitude&lt;/a&gt;-encoding format is linear at small&#10;amplitudes and becomes logarithmic at large amplitudes. This section&#10;discusses these formats.&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;hr /&gt;&lt;!--Table of Child-Links--&gt;&lt;a name="CHILD_LINKS"&gt;&lt;strong&gt;Subsections&lt;/strong&gt;&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html1169" href="https://technick.net/guides/theory/dft/floating_point_numbers"&gt;Floating-Point Numbers&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1170" href="https://technick.net/guides/theory/dft/logarithmic_fixed_point_num"&gt;Logarithmic Fixed-Point Numbers&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1171" href="https://technick.net/guides/theory/dft/law_companding"&gt;&lt;img width="14" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img5.png" alt="$\" u="u" /&gt;-Law Companding&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;!--End of Table of Child-Links--&gt;&#10;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/when_do_we"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/floating_point_numbers"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Floating-Point Numbers</title><link>https://technick.net/guides/theory/dft/floating_point_numbers/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/floating_point_numbers/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/logarithmic_number_systems"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/logarithmic_fixed_point_num"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00541000000000000000"&gt;Floating-Point Numbers&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;&lt;a href="https://technick.net/guides/theory/dft/floating_point_numbers"&gt;Floating-point numbers&lt;/a&gt; consist of an ''exponent,'' ''significand'', and&#10;''sign bit''. For a negative number, we may set the sign bit of the&#10;floating-point word and negate the number to be encoded, leaving only&#10;nonnegative numbers to be considered. Zero is represented by all zeros, so&#10;now we need only consider positive numbers. &lt;/p&gt;&lt;p&gt;The basic idea of floating point &lt;i&gt;encoding&lt;/i&gt; of a binary number is to&lt;i&gt;normalize&lt;/i&gt; the number by &lt;i&gt;shifting&lt;/i&gt; the bits either left or right&#10;until the shifted result lies between 1/2 and 1. (A left-shift by one&#10;place in a binary word corresponds to multiplying by 2, while a right-shift&#10;one place corresponds to dividing by 2.) The number of bit-positions&#10;shifted to normalize the number can be recorded as a signed integer. The&#10;negative of this integer (i.e., the shift required to recover the original&#10;number) is defined as the &lt;i&gt;exponent&lt;/i&gt; of the floating-point encoding.&#10;The normalized number between 1/2 and 1 is called the &lt;i&gt;significand&lt;/i&gt;,&#10;so called because it holds all the ''significant bits'' of the number.&lt;/p&gt;&lt;p&gt;Floating point notation is exactly analogous to ''scientific notation'' for&#10;decimal numbers, e.g., &lt;!-- MATH&#10; $1.2345\times 10^{-9}$&#10; --&gt;&lt;img width="101" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img426.png" alt="$1.2345\" imes="" /&gt;; the number of significant&#10;digits, 5 in this example, is determined by counting digits in the&#10;''significand'' &lt;img width="48" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img427.png" alt="$1.2345$" /&gt;, while the ''order of magnitude'' is determined by&#10;the power of 10 (-9 in this case). In floating-point numbers, the&#10;significand is stored in fractional &lt;a href="https://technick.net/guides/theory/dft/general_formula_two_s_compl"&gt;two's-complement&lt;/a&gt; binary format, and the&#10;exponent is stored as a binary integer. &lt;/p&gt;&lt;p&gt;Since the significand lies in the interval &lt;img width="54" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img428.png" alt="$[1/2,1)$" /&gt;,&lt;a name="tex2html35" href="https://technick.net/guides/theory/dft/footnode#foot5282"&gt;&lt;sup&gt;4.11&lt;/sup&gt;&lt;/a&gt;its most significant bit is always a 1, so it is not actually stored in the&#10;computer word, giving one more significant bit of precision.&lt;/p&gt;&lt;p&gt;Let's now restate the above a little more precisely. Let &lt;img width="42" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img157.png" alt="$x&amp;gt;0$" /&gt; denote a&#10;number to be encoded in floating-point, and let &lt;!-- MATH&#10; ${\tilde x}= x\cdot 2^{-E}$&#10; --&gt;&lt;img width="84" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img430.png" alt="${\" ilde="" cdot="" /&gt;denote the normalized value obtained by shifting &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; either &lt;img width="17" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img431.png" alt="$E$" /&gt; bits to the&#10;right (if &lt;img width="46" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img432.png" alt="$E&amp;gt;0$" /&gt;), or &lt;!-- MATH&#10; $\left|E\right|$&#10; --&gt;&lt;img width="26" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img433.png" alt="$\" eft\vert="" ight\vert="" /&gt; bits to the left (if &lt;img width="46" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img434.png" alt="$E&amp;lt;0$" /&gt;). Then we&#10;have &lt;!-- MATH&#10; $1/2 \leq {\tilde x}&lt; 1$&#10; --&gt;&lt;img width="87" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img435.png" alt="$1/2 \" eq="" ilde="" t="" /&gt;, and &lt;!-- MATH&#10; $x = {\tilde x}\cdot 2^E$&#10; --&gt;&lt;img width="74" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img436.png" alt="$x = {\" ilde="" dot="" /&gt;. The &lt;i&gt;significand&lt;/i&gt;&lt;img width="21" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img201.png" alt="$M$" /&gt; of the floating-point representation for &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; is defined as the binary&#10;encoding of &lt;img width="13" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img437.png" alt="${\" ilde="" /&gt;.&lt;a name="tex2html36" href="https://technick.net/guides/theory/dft/footnode#foot5127"&gt;&lt;sup&gt;4.12&lt;/sup&gt;&lt;/a&gt; It is&#10;often the case that &lt;img width="13" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img437.png" alt="${\" ilde="" /&gt; requires more bits than are available for exact&#10;encoding. Therefore, the significand is typically &lt;i&gt;rounded&lt;/i&gt; (or&#10;truncated) to the value closest to &lt;img width="13" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img437.png" alt="${\" ilde="" /&gt;. Given &lt;img width="31" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img438.png" alt="$N_M$" /&gt; bits for the&#10;significand, the encoding of &lt;img width="13" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img437.png" alt="${\" ilde="" /&gt; can be computed by multiplying it by&lt;img width="35" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img439.png" alt="$2^{N_M}$" /&gt; (left-shifting it &lt;img width="31" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img438.png" alt="$N_M$" /&gt; bits), &lt;i&gt;rounding&lt;/i&gt; to the nearest&#10;integer (or &lt;i&gt;truncating&lt;/i&gt; toward minus infinity--the as implemented by&#10;the &lt;tt&gt;floor()&lt;/tt&gt; function), and encoding the &lt;img width="31" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img438.png" alt="$N_M$" /&gt;-bit result as a binary&#10;(signed) integer.&lt;/p&gt;&lt;p&gt;As a final practical note, exponents in floating-point formats may have a&lt;i&gt;bias&lt;/i&gt;. That is, instead of storing &lt;img width="17" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img431.png" alt="$E$" /&gt; as a binary integer, you may&#10;find a binary encoding of &lt;img width="49" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img440.png" alt="$E-B$" /&gt; where &lt;img width="17" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img441.png" alt="$B$" /&gt; is the bias.&lt;a name="tex2html37" href="https://technick.net/guides/theory/dft/footnode#foot5134"&gt;&lt;sup&gt;4.13&lt;/sup&gt;&lt;/a&gt;&lt;/p&gt;&lt;p&gt;These days, floating-point formats generally follow the IEEE standards set&#10;out for them. A single-precision floating point word is &lt;img width="20" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img442.png" alt="$32$" /&gt; bits (four&#10;bytes) long, consisting of &lt;img width="12" height="13" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img78.png" alt="$1$" /&gt; sign bit, &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img443.png" alt="$8$" /&gt; exponent bits, and &lt;img width="20" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img444.png" alt="$23$" /&gt;significand bits, normally laid out as&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\mbox{ S EEEEEEEE MMMMMMMMMMMMMMMMMMMMMMM}&#10;\end{displaymath}&#10; --&gt;&lt;img width="487" height="26" border="0" src="https://technick.net/img/guide_dft/img445.png" alt="\" egin="" isplaymath="" box="" s="" eeeeee="" mmmmmmmmmmmmmmmmmmmmm="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where S denotes the sign bit, E an exponent bit, and M a significand bit.&#10;Note that in this layout, ordinary integer comparison can be used in the&#10;hardware.&lt;p&gt;A double-precision floating point word is &lt;img width="20" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img446.png" alt="$64$" /&gt; bits (eight bytes) long,&#10;consisting of &lt;img width="12" height="13" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img78.png" alt="$1$" /&gt; sign bit, &lt;img width="20" height="13" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img447.png" alt="$11$" /&gt; exponent bits, and &lt;img width="20" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img448.png" alt="$52$" /&gt; significand bits.&#10;In the Intel Pentium processor, there is also an &lt;i&gt;extended precision&lt;/i&gt;format, used for intermediate results, which is &lt;img width="20" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img449.png" alt="$80$" /&gt; bits (ten bytes)&#10;containing &lt;img width="12" height="13" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img78.png" alt="$1$" /&gt; sign bit, &lt;img width="20" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img450.png" alt="$15$" /&gt; exponent bits, and &lt;img width="20" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img446.png" alt="$64$" /&gt; significand bits. In&#10;Intel processors, the exponent bias is &lt;img width="28" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img451.png" alt="$127$" /&gt; for single-precision&#10;floating-point, &lt;img width="36" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img452.png" alt="$1023$" /&gt; for double-precision, and &lt;img width="44" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img453.png" alt="$16383$" /&gt; for&#10;extended-precision. The single and double precision formats have a&#10;''hidden'' significand bit, while the extended precision format does not.&#10;Thus, the most significant significand bit is always set in extended&#10;precision.&lt;/p&gt;&lt;p&gt;The MPEG-4 audio compression standard (which supports compression using&#10;music synthesis algorithms) specifies that the numerical calculations in&#10;any MPEG-4 audio decoder should be at least as accurate as 32-bit&#10;single-precision floating point.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/logarithmic_number_systems"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/logarithmic_fixed_point_num"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Logarithmic Fixed-Point Numbers</title><link>https://technick.net/guides/theory/dft/logarithmic_fixed_point_num/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/logarithmic_fixed_point_num/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/floating_point_numbers"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/law_companding"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00542000000000000000"&gt;Logarithmic Fixed-Point Numbers&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;In some situations it makes sense to use &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/logarithmic_fixed_point_num"&gt;logarithmic fixed-point&lt;/a&gt;&lt;/i&gt;.&#10;This number format can be regarded as a floating-point format consisting of&#10;an exponent and no explicit significand. However, the exponent is not&#10;interpreted as an integer as it is in floating point. Instead, it has a&#10;fractional part which is a true &lt;i&gt;mantissa&lt;/i&gt;. (The integer part is then&#10;of course the ''characteristic'' of the logarithm.) In other words, a&#10;logarithmic fixed-point number is a binary encoding of the log-base-2 of&#10;the signal-sample magnitude. The sign bit is of course separate.&lt;/p&gt;&lt;p&gt;An example 16-bit logarithmic fixed-point number format suitable for&#10;digital audio consists of one sign bit, a 5-bit characteristic, and a&#10;10-bit mantissa:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\mbox{ S CCCCC MMMMMMMMMM}&#10;\end{displaymath}&#10; --&gt;&lt;img width="246" height="26" border="0" src="https://technick.net/img/guide_dft/img454.png" alt="\" egin="" isplaymath="" box="" s="" ccc="" mmmmmmmm="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;The 5-bit characteristic gives a &lt;a href="https://technick.net/guides/theory/dft/dynamic_range"&gt;dynamic range&lt;/a&gt; of about 6 &lt;a href="https://technick.net/guides/theory/dft/decibels"&gt;dB&lt;/a&gt; &lt;img width="32" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img455.png" alt="$\" imes="" /&gt;= 192 dB. This is an excellent dynamic range for digital audio. (While&#10;120 dB would seem to be enough for audio, consider that when digitally&#10;modeling a brass musical instrument, say, the internal air pressure near&#10;the ''virtual mouthpiece'' can be far higher than what actually reaches the&#10;ears in the audience.)&lt;p&gt;A nice property of logarithmic fixed-point numbers is that multiplies&#10;simply become additions and divisions become subtractions. The hard&#10;elementary operation are now addition and subtraction, and these are&#10;normally done using table lookups to keep them simple.&lt;/p&gt;&lt;p&gt;One ''catch'' when working with logarithmic fixed-point numbers is that you&#10;can't let ''dc'' build up. A wandering dc component will cause the&#10;quantization to be coarse even for low-level ''ac'' signals. It's a good idea&#10;to make sure dc is always filtered out in logarithmic fixed-point.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/floating_point_numbers"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/law_companding"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Law Companding</title><link>https://technick.net/guides/theory/dft/law_companding/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/law_companding/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/logarithmic_fixed_point_num"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/appendix_a_round_off"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00543000000000000000"&gt;&lt;img width="14" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img5.png" alt="$\" u="u" /&gt;-Law Companding&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;A &lt;i&gt;companding&lt;/i&gt; operation &lt;i&gt;compresses&lt;/i&gt; &lt;a href="https://technick.net/guides/theory/dft/dynamic_range"&gt;dynamic range&lt;/a&gt; on encode and&lt;i&gt;expands&lt;/i&gt; dynamic range on decode. In digital telephone networks and&#10;voice modems (currently in use everywhere), standard CODEC&lt;a name="tex2html38" href="https://technick.net/guides/theory/dft/footnode#foot5146"&gt;&lt;sup&gt;4.14&lt;/sup&gt;&lt;/a&gt; chips are used in which audio is&#10;digitized in a simple 8-bit &lt;i&gt;&lt;img width="14" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img5.png" alt="$\" u="u" /&gt;-law format&lt;/i&gt; (or simply ''&lt;a href="https://technick.net/guides/theory/dft/law_companding"&gt;mu-law&lt;/a&gt;'').&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;Given an input sample &lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img50.png" alt="$x(n)$" /&gt; represented in some internal format, such as a&lt;tt&gt;short&lt;/tt&gt;, it is converted to 8-bit mu-law format by the formula&#10;[&lt;a href="https://technick.net/guides/theory/dft/bibliography#RabinerAndSchafer78"&gt;12&lt;/a&gt;]&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;{\hat x}_\mu \isdef Q_\mu\left[\log_2\left(1 + \mu\left|x(n)\right|\right)\right]&#10;\end{displaymath}&#10; --&gt;&lt;img width="212" height="32" border="0" src="https://technick.net/img/guide_dft/img456.png" alt="\" egin="" isplaymath="" at="" u="" sdef="" u\left="" og="" eft="" u\left\vert="" right\vert\right="" ight="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where &lt;img width="34" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img457.png" alt="$Q_\" u="u" /&gt; is a &lt;i&gt;quantizer&lt;/i&gt; which produces a kind of &lt;a href="https://technick.net/guides/theory/dft/logarithmic_fixed_point_num"&gt;logarithmic&#10;fixed-point&lt;/a&gt; number with a 3-bit characteristic and a 4-bit mantissa, using&#10;a small table lookup for the mantissa.&lt;p&gt;As we all know from talking on the telephone, mu-law sounds really quite&#10;good for voice, at least as far as &lt;i&gt;intelligibility&lt;/i&gt; is concerned.&#10;However, because the telephone bandwidth is only around 3 kHz (nominally&#10;200-3200 Hz), there is very little ''bass'' and no ''highs'' in the&#10;spectrum above 4 kHz. This works out fine for intelligibility of voice&#10;because the first three &lt;i&gt;formants&lt;/i&gt; (envelope peaks) in typical speech&#10;spectra occur in this range, and also because the difference in spectral&#10;shape (particularly at high frequencies) between consonants such as&#10;''sss'', ''shshsh'', ''fff'', ''ththth'', etc., are sufficiently preserved&#10;in this range. As a result of the narrow bandwidth provided for speech, it&#10;is sampled at only 8 kHz in standard CODEC chips.&lt;/p&gt;&lt;p&gt;For ''wideband audio'', we like to see &lt;a href="https://technick.net/guides/theory/dft/shannon_s_sampling_theorem"&gt;sampling rates&lt;/a&gt; at least as high as&#10;44.1 kHz, and the latest systems are moving to 96 kHz (mainly becauseoversampling simplifies signal processing requirements in various areas,&#10;not because we can actually hear anything above 20 kHz). In addition, we&#10;like the low end to extend at least down to 20 Hz or so. (The lowest note&#10;on a normally tuned bass guitar is E1 = 41.2 Hz. The lowest note on a&#10;grand piano is A0 = 27.5 Hz.)&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/logarithmic_fixed_point_num"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/appendix_a_round_off"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Appendix A: Round-Off Error Variance</title><link>https://technick.net/guides/theory/dft/appendix_a_round_off/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/appendix_a_round_off/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/law_companding"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/appendix_b_electrical"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00550000000000000000"&gt;Appendix A: Round-Off Error Variance&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;This section shows how to derive that the &lt;a href="http://www.treasure-troves.com/physics/noisepower.php"&gt;noise power&lt;/a&gt; of quantization&#10;error is &lt;img width="43" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img458.png" alt="$q^2/12$" /&gt;, where &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img378.png" alt="$q$" /&gt; is the quantization step size.&lt;/p&gt;&lt;p&gt;Each round-off error in quantization &lt;a href="http://www.treasure-troves.com/physics/noise.php"&gt;noise&lt;/a&gt; &lt;img width="33" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img459.png" alt="$e(n)$" /&gt; is modeled as a uniform&#10;random variable between &lt;img width="40" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img460.png" alt="$-q/2$" /&gt; and &lt;img width="28" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img379.png" alt="$q/2$" /&gt;. It therefore has the &lt;i&gt;&lt;a href="http://www.treasure-troves.com/physics/probabilitydensity.php"&gt;probability density&lt;/a&gt; function&lt;/i&gt; (pdf)&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;p_e(x) = \left\{\begin{array}{ll}&#10;&#9;\frac{1}{q}, &amp; \left|x\right|\leq\frac{q}{2} \\&#10;&#9;0, &amp; \left|x\right|&gt;\frac{q}{2} \\&#10;&#9;\end{array}&#10;&#9;\right.&#10;\end{displaymath}&#10; --&gt;&lt;img width="172" height="52" border="0" src="https://technick.net/img/guide_dft/img461.png" alt="\" egin="" isplaymath="" p="" x="" eft\="" egin="" rray="" l="" rac="" q="" eft\vert="" eft\vert="" ight\vert="" t="" rac="" q="" nd="" rray="" ight="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Thus, the &lt;i&gt;probability&lt;/i&gt; that a given roundoff error &lt;img width="33" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img459.png" alt="$e(n)$" /&gt; lies in the&#10;interval &lt;img width="53" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img462.png" alt="$[x_1,x_2]$" /&gt; is given by&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\int_{x_1}^{x_2} p_e(x) dx = \frac{x_2-x_1}{q}&#10;\end{displaymath}&#10; --&gt;&lt;img width="178" height="50" border="0" src="https://technick.net/img/guide_dft/img463.png" alt="\" egin="" isplaymath="" nt="" x="" p="" x="" x="\frac{x_2-x_1}{q}" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;assuming of course that &lt;img width="20" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img79.png" alt="$x_1$" /&gt; and &lt;img width="20" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img80.png" alt="$x_2$" /&gt; lie in the allowed range &lt;img width="80" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img464.png" alt="$[-q/2,&#10;q/2]$" /&gt;. We might loosely refer to &lt;img width="40" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img465.png" alt="$p_e(x)$" /&gt; as a &lt;i&gt;probability&#10;distribution&lt;/i&gt;, but technically it is a probability &lt;i&gt;density&lt;/i&gt; function,&#10;and to obtain probabilities, we have to integrate over one or more&#10;intervals, as above. We use probability &lt;i&gt;distributions&lt;/i&gt; for variables&#10;which take on &lt;i&gt;discrete&lt;/i&gt; values (such as dice), and we use probability&lt;i&gt;densities&lt;/i&gt; for variables which take on &lt;i&gt;continuous&lt;/i&gt; values (such&#10;as round-off errors).&lt;p&gt;The &lt;i&gt;mean&lt;/i&gt;&lt;a name="5532"&gt;&lt;/a&gt; of a random variable is&#10;defined as&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\mu_e \isdef \int_{-\infty}^{\infty} x p_e(x) dx = 0&#10;\end{displaymath}&#10; --&gt;&lt;img width="182" height="50" border="0" src="https://technick.net/img/guide_dft/img466.png" alt="\" egin="" isplaymath="" u="" isdef="" nt="" nfty="" nfty="" e="" dx="0" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;In our case, the mean is zero because we are assuming the use of&lt;i&gt;rounding&lt;/i&gt; (as opposed to truncation, etc.).&lt;p&gt;&lt;a name="5533"&gt;&lt;/a&gt;The &lt;i&gt;mean of a signal&lt;/i&gt;&lt;a name="5535"&gt;&lt;/a&gt; &lt;img width="33" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img459.png" alt="$e(n)$" /&gt; is the same thing as the&lt;i&gt;expected value&lt;/i&gt;&lt;a name="5537"&gt;&lt;/a&gt; of &lt;img width="33" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img459.png" alt="$e(n)$" /&gt;, which we write as &lt;!-- MATH&#10; ${\cal E}\{e(n)\}$&#10; --&gt;&lt;img width="59" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img467.png" alt="${\" al="" n="" /&gt;.&#10;In general, the expected value of &lt;i&gt;any&lt;/i&gt; function &lt;img width="34" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img468.png" alt="$f(v)$" /&gt; of a&#10;random variable &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img469.png" alt="$v$" /&gt; is given by&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;{\cal E}\{f(v)\} \isdef \int_{-\infty}^{\infty} f(x) p_v(x) dx&#10;\end{displaymath}&#10; --&gt;&lt;img width="218" height="50" border="0" src="https://technick.net/img/guide_dft/img470.png" alt="\" egin="" isplaymath="" al="" v="" sdef="" nt="" nfty="" nfty="" x="" p="" x="" x="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;Since the quantization-noise signal &lt;img width="33" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img459.png" alt="$e(n)$" /&gt; is modeled as a series of&#10;independent, identically distributed (iid) random variables, we can&lt;i&gt;estimate&lt;/i&gt; the mean by &lt;i&gt;averaging&lt;/i&gt; the signal over time.&#10;Such an estimate is called a &lt;i&gt;sample mean&lt;/i&gt;&lt;a name="5541"&gt;&lt;/a&gt;.&lt;/p&gt;&lt;p&gt;Probability distributions are often be characterized by their&lt;i&gt;moments&lt;/i&gt;&lt;a name="5543"&gt;&lt;/a&gt;. The &lt;img width="14" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img51.png" alt="$n$" /&gt;th moment of the pdf &lt;img width="34" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img84.png" alt="$p(x)$" /&gt; is defined as&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\int_{-\infty}^{\infty} x^n p(x) dx&#10;\end{displaymath}&#10; --&gt;&lt;img width="109" height="50" border="0" src="https://technick.net/img/guide_dft/img471.png" alt="\" egin="" isplaymath="" nt="" nfty="" nfty="" n="" dx="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Thus, the mean &lt;!-- MATH&#10; $\mu_x = {\cal E}\{e(n)\}$&#10; --&gt;&lt;img width="98" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img472.png" alt="$\" u="u" x="{\cal" e="" n="" /&gt; is the &lt;i&gt;first&lt;/i&gt; moment of the&#10;pdf. The second moment is simply the expected value of the random variable&#10;squared, i.e., &lt;!-- MATH&#10; ${\cal E}\{e^2(n)\}$&#10; --&gt;&lt;img width="66" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img473.png" alt="${\" al="" n="" /&gt;.&lt;p&gt;The &lt;i&gt;variance&lt;/i&gt;&lt;a name="5547"&gt;&lt;/a&gt; of a random variable &lt;img width="33" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img459.png" alt="$e(n)$" /&gt; is defined as &#10;the&lt;i&gt;second central moment&lt;/i&gt;&lt;a name="5549"&gt;&lt;/a&gt; of the pdf:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\sigma_e^2 \isdef {\cal E}\{[e(n)-\mu_e]^2\} &#10;&#9;= \int_{-\infty}^{\infty} (x-\mu_e)^2 p_e(x) dx&#10;\end{displaymath}&#10; --&gt;&lt;img width="350" height="50" border="0" src="https://technick.net/img/guide_dft/img474.png" alt="\" egin="" isplaymath="" igma="" isdef="" al="" n="" u="" int="" nfty="" nfty="" mu="" p="p" e="" dx="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;''Central'' just means that the moment is evaluated after subtracting out&#10;the &lt;i&gt;mean&lt;/i&gt;, that is, looking at &lt;img width="69" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img475.png" alt="$e(n)-\" u="u" e="" /&gt; instead of &lt;img width="33" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img459.png" alt="$e(n)$" /&gt;. In&#10;the case of round-off errors, the mean is zero, so subtracting out the mean&#10;has no effect. Plugging in the constant pdf for our random variable &lt;img width="33" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img459.png" alt="$e(n)$" /&gt;which we assume is uniformly distributed on &lt;img width="80" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img464.png" alt="$[-q/2,&#10;q/2]$" /&gt;, we obtain the&#10;variance&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\sigma_e^2 = \int_{-q/2}^{q/2} x^2 \frac{1}{q} dx &#10;= \frac{1}{q}\left.\frac{1}{3}x^3\right|_{-q/2}^{q/2}&#10;= \frac{q^2}{12}&#10;\end{displaymath}&#10; --&gt;&lt;img width="293" height="58" border="0" src="https://technick.net/img/guide_dft/img476.png" alt="\" egin="" isplaymath="" igma="" int="" q="" q="" frac="" q="" x="\frac{1..." left="" rac="" right\vert="" q="" q="" rac="" q="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Note that the variance of &lt;img width="33" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img459.png" alt="$e(n)$" /&gt; can be estimated by averaging &lt;img width="41" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img477.png" alt="$e^2(n)$" /&gt;over time, that is, by computing the &lt;i&gt;mean square&lt;/i&gt;&lt;a name="5552"&gt;&lt;/a&gt;. Such an estimate&#10;is called the &lt;i&gt;sample variance&lt;/i&gt;&lt;a name="5554"&gt;&lt;/a&gt;. For sampled physical processes, the&#10;sample variance is proportional to the &lt;i&gt;average power&lt;/i&gt;&lt;a name="5556"&gt;&lt;/a&gt; in the signal.&#10;Finally, the square root of the sample variance (the &lt;i&gt;rms level&lt;/i&gt;&lt;a name="5558"&gt;&lt;/a&gt;) is&#10;sometimes called the &lt;i&gt;standard deviation&lt;/i&gt;&lt;a name="5560"&gt;&lt;/a&gt; of the signal, but this term&#10;is only precise when the random variable has a Gaussian pdf.&lt;p&gt;EE 278 is the starting course on &lt;a href="https://technick.net/guides/theory/dft/appendix_b_introductory"&gt;statistical signal processing&lt;/a&gt; at Stanford&#10;if you are interested in this and related topics. A good text book &#10;on the subject is [&lt;a href="https://technick.net/guides/theory/dft/bibliography#PapoulisRV"&gt;13&lt;/a&gt;].&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/law_companding"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/appendix_b_electrical"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Appendix B: Electrical Engineering 101</title><link>https://technick.net/guides/theory/dft/appendix_b_electrical/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/appendix_b_electrical/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/appendix_a_round_off"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/sinusoids_exponentials"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00560000000000000000"&gt;Appendix B: Electrical Engineering 101&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;The state of an ideal resistor is completely specified by the voltage&#10;across it (call it &lt;img width="17" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img478.png" alt="$V$" /&gt; &lt;i&gt;volts&lt;/i&gt;) and the current passing through it&#10;(&lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img301.png" alt="$I$" /&gt; Amperes, or simply ''amps''). The ratio of voltage to current gives&#10;the value of the resistor (&lt;img width="82" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img479.png" alt="$V/I = R = $" /&gt; resistance in &lt;a href="http://www.treasure-troves.com/physics/ohm.php"&gt;Ohms&lt;/a&gt;). The&#10;fundamental relation between voltage and current in a resistor is called&lt;i&gt;Ohm's Law&lt;/i&gt;:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;V(t) = R \cdot I(t) \qquad \mbox{(Ohm's Law)}&#10;\end{displaymath}&#10; --&gt;&lt;img width="247" height="31" border="0" src="https://technick.net/img/guide_dft/img480.png" alt="\" egin="" isplaymath="" t="" cdot="" qquad="" box="" hm="" s="" w="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where we have indicated also that the voltage and current may vary with time&#10;(while the resistor value normally does not).&lt;p&gt;The electrical &lt;i&gt;power&lt;/i&gt; in &lt;i&gt;watts&lt;/i&gt; dissipated by a resistor R is&#10;given by&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;{\cal P}= V\cdot I = \frac{V^2}{R} = R\cdot I^2&#10;\end{displaymath}&#10; --&gt;&lt;img width="187" height="46" border="0" src="https://technick.net/img/guide_dft/img481.png" alt="\" egin="" isplaymath="" al="" cdot="" rac="" r="" cdot="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where &lt;img width="17" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img478.png" alt="$V$" /&gt; is the voltage and &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img301.png" alt="$I$" /&gt; is the current. Thus, volts times amps&#10;gives watts. Also, volts squared over ohms equals watts, and so on.&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/appendix_a_round_off"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/sinusoids_exponentials"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Sinusoids and Exponentials</title><link>https://technick.net/guides/theory/dft/sinusoids_exponentials/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/sinusoids_exponentials/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/appendix_b_electrical"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/sinusoids"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00600000000000000000"&gt;Sinusoids and Exponentials&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;This chapter provides an introduction to &lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;sinusoids&lt;/a&gt;, &lt;a href="https://technick.net/guides/theory/dft/exponentials"&gt;exponentials&lt;/a&gt;, complex&#10;sinusoids, &lt;img width="23" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img8.png" alt="$t_{60}$" /&gt;, in-phase and &lt;a href="https://technick.net/guides/theory/dft/in_phase_quadrature_sinusoi"&gt;quadrature&lt;/a&gt; sinusoidal components, the&lt;a href="https://technick.net/guides/theory/dft/analytic_signal_hilbert"&gt;analytic signal&lt;/a&gt;, positive and &lt;a href="https://technick.net/guides/theory/dft/positive_negative_frequenci"&gt;negative frequencies&lt;/a&gt;, constructive and&lt;a href="https://technick.net/guides/theory/dft/constructive_destructive_in"&gt;destructive interference&lt;/a&gt;, invariance of sinusoidal frequency in linear&#10;time-invariant systems, circular motion as the vector sum of in-phase and&#10;quadrature sinusoidal motions, sampled sinusoids, generating sampled&#10;sinusoids from powers of &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt;, and plot examples using &lt;a href="https://technick.net/guides/theory/dft/sidebar_mathematica"&gt;Mathematica&lt;/a&gt;.&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;hr /&gt;&lt;!--Table of Child-Links--&gt;&lt;a name="CHILD_LINKS"&gt;&lt;strong&gt;Subsections&lt;/strong&gt;&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html1240" href="https://technick.net/guides/theory/dft/sinusoids"&gt;Sinusoids&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html1241" href="https://technick.net/guides/theory/dft/example_sinusoids"&gt;Example Sinusoids&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1242" href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;Why Sinusoids are Important&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1243" href="https://technick.net/guides/theory/dft/in_phase_quadrature_sinusoi"&gt;In-Phase and Quadrature Sinusoidal Components&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1244" href="https://technick.net/guides/theory/dft/sinusoids_at_same"&gt;Sinusoids at the Same Frequency&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1245" href="https://technick.net/guides/theory/dft/constructive_destructive_in"&gt;Constructive and Destructive Interference of Sinusoids&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1246" href="https://technick.net/guides/theory/dft/exponentials"&gt;Exponentials&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html1247" href="https://technick.net/guides/theory/dft/why_exponentials_are"&gt;Why Exponentials are Important&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1248" href="https://technick.net/guides/theory/dft/audio_decay_time"&gt;Audio Decay Time (&lt;img width="23" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img8.png" alt="$t_{60}$" /&gt;)&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1249" href="https://technick.net/guides/theory/dft/complex_sinusoids"&gt;Complex Sinusoids&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html1250" href="https://technick.net/guides/theory/dft/circular_motion"&gt;Circular Motion&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1251" href="https://technick.net/guides/theory/dft/projection_circular_motion"&gt;Projection of Circular Motion&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1252" href="https://technick.net/guides/theory/dft/positive_negative_frequenci"&gt;Positive and Negative Frequencies&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1253" href="https://technick.net/guides/theory/dft/analytic_signal_hilbert"&gt;The Analytic Signal and Hilbert Transform Filters&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1254" href="https://technick.net/guides/theory/dft/generalized_complex_sinusoi"&gt;Generalized Complex Sinusoids&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1255" href="https://technick.net/guides/theory/dft/sampled_sinusoids"&gt;Sampled Sinusoids&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1256" href="https://technick.net/guides/theory/dft/powers"&gt;Powers of &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt;&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1257" href="https://technick.net/guides/theory/dft/why_generalized_complex"&gt;Why (Generalized) Complex Sinusoids are Important&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1258" href="https://technick.net/guides/theory/dft/comparing_analog_digital"&gt;Comparing Analog and Digital Complex Planes&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1259" href="https://technick.net/guides/theory/dft/mathematica_selected_plots"&gt;Mathematica for Selected Plots&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1260" href="https://technick.net/guides/theory/dft/acknowledgement"&gt;Acknowledgement&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;!--End of Table of Child-Links--&gt;&#10;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/appendix_b_electrical"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/sinusoids"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Sinusoids</title><link>https://technick.net/guides/theory/dft/sinusoids/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/sinusoids/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/sinusoids_exponentials"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/example_sinusoids"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00610000000000000000"&gt;Sinusoids&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;A &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;sinusoid&lt;/a&gt;&lt;/i&gt; is any function of time having the following form:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;x(t) = A \sin(\omega t + \phi)&#10;\end{displaymath}&#10; --&gt;&lt;img width="153" height="31" border="0" src="https://technick.net/img/guide_dft/img482.png" alt="\" egin="" isplaymath="" t="" a="" in="" mega="" hi="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where all variables are real numbers, and &lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;A &amp;=&amp; \mbox{Peak Amplitude (nonnegative)} \\&#10;\omega &amp;=&amp; \mbox{Radian Frequency (rad/sec)} \\&#10; &amp;=&amp; 2\pi f \; \mbox{($f$\ in Hz)}\\&#10;t &amp;=&amp; \mbox{Time (sec)} \\&#10;f &amp;=&amp; \mbox{Frequency (Hz)} \\&#10;\phi &amp;=&amp; \mbox{Phase (radians)}&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="297" height="163" border="0" src="https://technick.net/img/guide_dft/img483.png" alt="\" egin="" qnarray="" a="" box="" eak="" plitude="" onnegative="" mega="" box="" mbox="" requency="" z="" hi="" box="" hase="" adians="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;The term ''peak &lt;a href="https://technick.net/guides/theory/dft/logarithms"&gt;amplitude&lt;/a&gt;'' is often shortened to ''amplitude,'' e.g.,&#10;''the amplitude of the sound was measured to be 5 &lt;a href="http://www.treasure-troves.com/physics/pascal.php"&gt;Pascals&lt;/a&gt;.'' Strictly&#10;speaking, however, the ''amplitude'' of a signal &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; is its instantaneous&#10;value &lt;img width="31" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img357.png" alt="$x(t)$" /&gt; at any time &lt;img width="10" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img484.png" alt="$t$" /&gt;. The peak amplitude &lt;img width="16" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img485.png" alt="$A$" /&gt; satisfies &lt;img width="64" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img486.png" alt="$x(t)\" eq="" /&gt;. The ''instantaneous magnitude'' or simply ''magnitude'' of a signal&lt;img width="31" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img357.png" alt="$x(t)$" /&gt; is given by &lt;img width="40" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img487.png" alt="$\" ert="" vert="" /&gt;, and the peak magnitude is the same thing as&#10;the peak amplitude.&lt;/p&gt;&lt;p&gt;Note that Hz is an abbreviation for Hertz which physically means ''cycles&#10;per second.'' You might also encounter the older (and clearer) notation&#10;''c.p.s.'' for cycles per second.&lt;/p&gt;&lt;p&gt;Since &lt;img width="44" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img281.png" alt="$\" in="" heta="" /&gt; is periodic with period &lt;img width="22" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img40.png" alt="$2\" i="i" /&gt;, the phase &lt;img width="51" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img488.png" alt="$\" hi="" m="" i="" /&gt; is indistinguishable from the phase &lt;img width="14" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img489.png" alt="$\" hi="" /&gt;. As a result, we may&#10;restrict the range of &lt;img width="14" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img489.png" alt="$\" hi="" /&gt; to any length &lt;img width="22" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img40.png" alt="$2\" i="i" /&gt; interval. When needed,&#10;we will choose&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;-\pi \leq \phi &lt; \pi,&#10;\end{displaymath}&#10; --&gt;&lt;img width="95" height="30" border="0" src="https://technick.net/img/guide_dft/img490.png" alt="\" egin="" isplaymath="" i="" eq="" hi="" t="" i="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;i.e., &lt;!-- MATH&#10; $\phi\in[-\pi,\pi)$&#10; --&gt;&lt;img width="82" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img491.png" alt="$\" hi\in="" i="" i="" /&gt;. You may also encounter the convention&#10;&lt;!-- MATH&#10; $\phi\in[0,2\pi)$&#10; --&gt;&lt;img width="76" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img492.png" alt="$\" hi\in="" i="" /&gt;.&lt;p&gt;&lt;br /&gt;&lt;hr /&gt;&lt;!--Table of Child-Links--&gt;&lt;a name="CHILD_LINKS"&gt;&lt;strong&gt;Subsections&lt;/strong&gt;&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html1273" href="https://technick.net/guides/theory/dft/example_sinusoids"&gt;Example Sinusoids&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1274" href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;Why Sinusoids are Important&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1275" href="https://technick.net/guides/theory/dft/in_phase_quadrature_sinusoi"&gt;In-Phase and Quadrature Sinusoidal Components&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1276" href="https://technick.net/guides/theory/dft/sinusoids_at_same"&gt;Sinusoids at the Same Frequency&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1277" href="https://technick.net/guides/theory/dft/constructive_destructive_in"&gt;Constructive and Destructive Interference of Sinusoids&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;!--End of Table of Child-Links--&gt;&#10;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/sinusoids_exponentials"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/example_sinusoids"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Example Sinusoids</title><link>https://technick.net/guides/theory/dft/example_sinusoids/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/example_sinusoids/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/sinusoids"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00611000000000000000"&gt;Example Sinusoids&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;Figure&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/example_sinusoids#fig:sine"&gt;5.1&lt;/a&gt; plots the &lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;sinusoid&lt;/a&gt; &#10;&lt;!-- MATH&#10; $A \sin(2\pi f t + \phi)$&#10; --&gt;&lt;img width="112" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img493.png" alt="$A \" in="" i="" phi="" /&gt;, for &lt;img width="53" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img494.png" alt="$A=10$" /&gt;, &lt;img width="55" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img495.png" alt="$f=2.5$" /&gt;, &lt;img width="60" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img496.png" alt="$\" hi="\pi/4$" /&gt;, and&lt;img width="61" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img497.png" alt="$t\" n="" /&gt;. Study the plot to make sure you understand the effect of&#10;changing each parameter (&lt;a href="https://technick.net/guides/theory/dft/logarithms"&gt;amplitude&lt;/a&gt;, frequency, phase), and also note the&#10;definitions of ''peak-to-peak amplitude'' and ''zero crossings.''&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:sine"&gt;&lt;/a&gt;&lt;a name="6881"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure 5.1:&lt;/strong&gt;An example sinusoid.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; $\includegraphics{eps/sine.eps}$&#10; --&gt;&lt;img width="665" height="319" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img498.png" alt="\" ncludegraphics="" ps="" ine="" ps="" /&gt; &lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;The &lt;a href="https://technick.net/guides/theory/dft/sidebar_mathematica"&gt;Mathematica&lt;/a&gt; code for generating this figure is listed in&#10;&amp;sect;&lt;a href="https://technick.net/guides/theory/dft/mathematica_selected_plots#sec:MMA"&gt;5.4&lt;/a&gt;.&lt;/p&gt;&lt;p&gt;A ''tuning fork'' vibrates approximately sinusoidally. An ''A-440'' tuning&#10;fork oscillates at &lt;img width="28" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img376.png" alt="$440$" /&gt; cycles per second. As a result, a tone recorded&#10;from an ideal A-440 tuning fork is a sinusoid at &lt;img width="59" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img499.png" alt="$f=440$" /&gt; Hz. The amplitude&lt;img width="16" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img485.png" alt="$A$" /&gt; determines how loud it is and depends on how hard we strike the tuning&#10;fork. The phase &lt;img width="14" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img489.png" alt="$\" hi="" /&gt; is set by exactly &lt;i&gt;when&lt;/i&gt; we strike the tuning&#10;fork (and on our choice of when time 0 is). If we record an A-440 tuning&#10;fork on an analog tape recorder, the electrical signal recorded on tape is&#10;of the form&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;x(t) = A \sin(2\pi 440 t + \phi)&#10;\end{displaymath}&#10; --&gt;&lt;img width="187" height="31" border="0" src="https://technick.net/img/guide_dft/img500.png" alt="\" egin="" isplaymath="" t="" a="" in="" i="" phi="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;As another example, the sinusoid at amplitude &lt;img width="12" height="13" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img78.png" alt="$1$" /&gt; and phase &lt;img width="30" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img501.png" alt="$\" i="i" /&gt; (90 degrees)&#10;is simply&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;x(t) = \sin(\omega t + \pi/2) = \cos(\omega t)&#10;\end{displaymath}&#10; --&gt;&lt;img width="233" height="31" border="0" src="https://technick.net/img/guide_dft/img502.png" alt="\" egin="" isplaymath="" t="" in="" mega="" i="" os="" mega="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Thus, &lt;!-- MATH&#10; $\cos(\omega t)$&#10; --&gt;&lt;img width="54" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img503.png" alt="$\" os="" mega="" /&gt; is a sinusoid at phase 90-degrees, while&#10;&lt;!-- MATH&#10; $\sin(\omega t)$&#10; --&gt;&lt;img width="52" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img504.png" alt="$\" in="" mega="" /&gt; is a sinusoid at zero phase. Note, however, that we could&#10;just as well have defined &lt;!-- MATH&#10; $\cos(\omega t)$&#10; --&gt;&lt;img width="54" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img503.png" alt="$\" os="" mega="" /&gt; to be the zero-phase sinusoid&#10;rather than &lt;!-- MATH&#10; $\sin(\omega t)$&#10; --&gt;&lt;img width="52" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img504.png" alt="$\" in="" mega="" /&gt;. It really doesn't matter, except to be&#10;consistent in any given usage. The concept of a ''sinusoidal signal''&#10;is simply that it is equal to a sine or cosine function at some amplitude,&#10;frequency, and phase. It does not matter whether we choose &lt;img width="36" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img505.png" alt="$\" in="" /&gt;or &lt;img width="38" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img506.png" alt="$\" os="" /&gt; in the ''official'' definition of a sinusoid. You may&#10;encounter both definitions. Using &lt;img width="36" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img505.png" alt="$\" in="" /&gt; is nice since&#10;''sinusoid'' in a sense generalizes &lt;img width="36" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img505.png" alt="$\" in="" /&gt;. However, using &lt;img width="38" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img506.png" alt="$\" os="" /&gt; is&#10;nicer when defining a sinusoid to be the real part of a complex sinusoid&#10;(which we'll talk about later).&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/sinusoids"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Why Sinusoids are Important</title><link>https://technick.net/guides/theory/dft/why_sinusoids_are/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/why_sinusoids_are/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/example_sinusoids"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/in_phase_quadrature_sinusoi"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00612000000000000000"&gt;Why Sinusoids are Important&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;&lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;Sinusoids&lt;/a&gt; are fundamental in a variety of ways. &lt;/p&gt;&lt;p&gt;One reason for the importance of sinusoids is that they are &lt;i&gt;fundamental in physics&lt;/i&gt;. Anything that resonates or oscillates produces&#10;quasi-sinusoidal motion. See &lt;i&gt;simple harmonic motion&lt;/i&gt; in any freshman&#10;physics text for an introduction to this topic.&lt;/p&gt;&lt;p&gt;Another reason sinusoids are important is that they are &lt;i&gt;eigenfunctionsof linear systems&lt;/i&gt; (which we'll say more about later). This means that&#10;they are important for the analysis of &lt;i&gt;filters&lt;/i&gt; such as reverberators,&#10;equalizers, certain (but not all) ''effects'', etc.&lt;/p&gt;&lt;p&gt;Perhaps most importantly, from the point of view of computer music&#10;research, is that the human &lt;i&gt;ear&lt;/i&gt; is a kind of &lt;i&gt;spectrum analyzer&lt;/i&gt;.&#10;That is, the chochlea of the inner ear physically splits sound into its&#10;(near) sinusoidal components. This is accomplished by the &lt;i&gt;basilar&#10;membrane&lt;/i&gt; in the inner ear: a sound wave injected at the &lt;i&gt;oval window&lt;/i&gt;(which is connected via the bones of the middle ear to the &lt;i&gt;ear drum&lt;/i&gt;),&#10;travels along the basilar membrane inside the coiled cochlea. The membrane&#10;starts out thick and stiff, and gradually becomes thinner and more&#10;compliant toward its apex (the &lt;i&gt;helicotrema&lt;/i&gt;). A stiff membrane has a&#10;high resonance frequency while a thin, compliant membrane has a low&#10;resonance frequency (assuming comparable mass density, or at least less of&#10;a difference in mass than in compliance). Thus, as the sound wave travels,&#10;each frequency in the sound resonates at a particular &lt;i&gt;place&lt;/i&gt; along the&#10;basilar membrane. The highest frequencies resonate right at the entrance,&#10;while the lowest frequencies travel the farthest and resonate near the&#10;helicotrema. The membrane resonance effectively ''shorts out'' the &lt;a href="https://technick.net/guides/theory/dft/signal_metrics"&gt;signal&#10;energy&lt;/a&gt; at that frequency, and it travels no further. Along the basilar&#10;membrane there are &lt;i&gt;hair cells&lt;/i&gt; which ''feel'' the resonant vibration&#10;and transmit an increased firing rate along the auditory nerve to the&#10;brain. Thus, the ear is very literally a Fourier analyzer for sound,&#10;albeit nonlinear and using ''analysis'' parameters that are difficult to&#10;match exactly. Nevertheless, by looking at spectra (which display the&#10;amount of each sinusoidal frequency present in a sound), we are looking at&#10;a representation much more like what the brain receives when we hear.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/example_sinusoids"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/in_phase_quadrature_sinusoi"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>In-Phase and Quadrature Sinusoidal Components</title><link>https://technick.net/guides/theory/dft/in_phase_quadrature_sinusoi/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/in_phase_quadrature_sinusoi/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/sinusoids_at_same"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00613000000000000000"&gt;In-Phase and Quadrature Sinusoidal Components&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;From the trig identity &lt;!-- MATH&#10; $\sin(A+B)=\sin(A)\cos(B)+\cos(A)\sin(B)$&#10; --&gt;&lt;img width="307" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img507.png" alt="$\" in="" a="" b="" in="" a="" os="" b="" os="" a="" in="" b="" /&gt;, we have&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;x(t) &amp;=&amp; A \sin(\omega t + \phi) = A \sin(\phi + \omega t) \\&#10;&#9;&amp;=&amp;&#9;\left[A \sin(\phi)\right] \cos(\omega t) + &#10;&#9;&#9;\left[A \cos(\phi)\right] \sin(\omega t) \\&#10;&#9;&amp;\isdef &amp; A_1 \cos(\omega t) + A_2 \sin(\omega t)&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="358" height="86" border="0" src="https://technick.net/img/guide_dft/img508.png" alt="\" egin="" qnarray="" t="" a="" in="" mega="" hi="" a="" in="" hi="" mega="" mega="" sdef="" a="" os="" mega="" a="" in="" mega="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;From this we may conclude that every &lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;sinusoid&lt;/a&gt; can be expressed as the sum&#10;of a sine function (phase zero) and a cosine function (phase &lt;img width="30" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img501.png" alt="$\" i="i" /&gt;). If&#10;the sine part is called the ''in-phase'' component, the cosine part can be&#10;called the ''phase-&lt;a href="https://technick.net/guides/theory/dft/in_phase_quadrature_sinusoi"&gt;quadrature&lt;/a&gt;'' component. In general, ''phase&#10;quadrature'' means ''90 degrees out of phase,'' i.e., a relative phase&#10;shift of &lt;img width="42" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img509.png" alt="$\" m\pi="" /&gt;.&lt;p&gt;It is also the case that every sum of an in-phase and quadrature component&#10;can be expressed as a single sinusoid at some &lt;a href="https://technick.net/guides/theory/dft/logarithms"&gt;amplitude&lt;/a&gt; and phase. The&#10;proof is obtained by working the previous derivation backwards.&lt;/p&gt;&lt;p&gt;Figure&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/in_phase_quadrature_sinusoi#fig:quadrature"&gt;5.2&lt;/a&gt; illustrates in-phase and quadrature components&#10;overlaid. Note that they only differ by a relative &lt;img width="20" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img510.png" alt="$90$" /&gt; degree phase&#10;shift. (See &amp;sect;&lt;a href="https://technick.net/guides/theory/dft/mathematica_selected_plots#sec:MMA"&gt;5.4&lt;/a&gt; for the &lt;a href="https://technick.net/guides/theory/dft/sidebar_mathematica"&gt;Mathematica&lt;/a&gt; code for this figure.)&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:quadrature"&gt;&lt;/a&gt;&lt;a name="6890"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure 5.2:&lt;/strong&gt;In-phase and quadrature sinusoidal components.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; $\includegraphics{eps/quadrature.eps}$&#10; --&gt;&lt;img width="451" height="218" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img511.png" alt="\" ncludegraphics="" ps="" uadrature="" ps="" /&gt; &lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/sinusoids_at_same"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Sinusoids at the Same Frequency</title><link>https://technick.net/guides/theory/dft/sinusoids_at_same/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/sinusoids_at_same/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/in_phase_quadrature_sinusoi"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/constructive_destructive_in"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00614000000000000000"&gt;Sinusoids at the Same Frequency&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;An important property of &lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;sinusoids&lt;/a&gt; at a particular frequency is that they&#10;are &lt;i&gt;closed&lt;/i&gt; with respect to addition. In other words, if you take a&#10;sinsusoid, make many copies of it, scale them all by different gains, &#10;delay them all by different amounts, and add them up, you always get a&#10;sinusoid at the same original frequency. This is a nontrivial property.&#10;It obviously holds for any constant signal &lt;img width="59" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img512.png" alt="$x(t)=c$" /&gt; (which we may regard as&#10;a sinusoid at frequency &lt;img width="43" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img513.png" alt="$f=0$" /&gt;), but it is not obvious for &lt;img width="43" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img514.png" alt="$f\" eq="" /&gt; (see&#10;Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/in_phase_quadrature_sinusoi#fig:quadrature"&gt;5.2&lt;/a&gt; and think about the sum of the two waveforms shown&#10;being precisely a sinusoid).&lt;/p&gt;&lt;p&gt;Since every linear, time-invariant (LTI&lt;a name="tex2html41" href="https://technick.net/guides/theory/dft/footnode#foot6859"&gt;&lt;sup&gt;5.1&lt;/sup&gt;&lt;/a&gt;) system (filter)&#10;operates by copying, scaling, delaying, and summing its input signal(s) to&#10;create its output signal(s), it follows that when a sinusoid at a&#10;particular frequency is input to an LTI system, a sinusoid at that same&#10;frequency always appears at the output. Only the &lt;a href="https://technick.net/guides/theory/dft/logarithms"&gt;amplitude&lt;/a&gt; and phase can&#10;be changed by the system. We say that sinusoids are &lt;i&gt;eigenfunctions&lt;/i&gt;of LTI systems. Conversely, if the system is nonlinear or time-varying,&#10;new frequencies are created at the system output.&lt;/p&gt;&lt;p&gt;To prove the important invariance property of sinusoids, we may simply express&#10;all scaled and delayed sinusoids in the ''mix'' in terms of their in-phase&#10;and &lt;a href="https://technick.net/guides/theory/dft/in_phase_quadrature_sinusoi"&gt;quadrature&lt;/a&gt; components and then add them up. For example, consider the&#10;case of two sinusoids arbitrarily scaled by gains &lt;img width="43" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img521.png" alt="$g1,g2$" /&gt; &#10;and arbitrarily delayed by time-delays &lt;img width="39" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img522.png" alt="$t1,t2$" /&gt;:&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;y(t) &amp;\isdef &amp; g_1 x(t-t_1) + g_2 x(t-t_2) \\&#10;&#9;&amp;=&amp; g_1 A \sin[\omega (t-t_1) + \phi]&#10;&#9; + g_2 A \sin[\omega (t-t_2) + \phi]&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="424" height="57" border="0" src="https://technick.net/img/guide_dft/img523.png" alt="\" egin="" qnarray="" t="" sdef="" x="" t="" x="" t="" a="a" sin="" mega="" t="" hi="" a="a" sin="" mega="" t="" hi="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Focusing on the first term, we have&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;g_1 A \sin[\omega (t-t_1) + \phi]&#10;&#9;&amp;=&amp;&#10;g_1 A \sin[\omega t + (\phi - \omega t_1)] \\&#10;&#9;&amp;=&amp;&#10;\left[g_1 A \sin(\phi-\omega t_1)\right] \cos(\omega t) + &#10;&#9;&#9;\left[g_1 A \cos(\phi-\omega t_1)\right] \sin(\omega t) \\&#10;&#9;&amp;\isdef &amp;&#10;A_1 \cos(\omega t) + B_1 \sin(\omega t)&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="618" height="86" border="0" src="https://technick.net/img/guide_dft/img524.png" alt="\" egin="" qnarray="" a="a" sin="" mega="" t="" hi="" a="a" sin="" mega="" mega="" sdef="" a="" os="" mega="" b="" in="" mega="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;We similarly compute&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;g_2 A \sin[\omega (t-t_2) + \phi]&#10;&#9;=&#10;A_2 \cos(\omega t) + B_2 \sin(\omega t)&#10;\end{displaymath}&#10; --&gt;&lt;img width="362" height="31" border="0" src="https://technick.net/img/guide_dft/img525.png" alt="\" egin="" isplaymath="" a="a" sin="" mega="" t="" hi="" a="" os="" mega="" b="" in="" mega="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;and add to obtain&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;y(t) = (A_1+A_2) \cos(\omega t) + (B_1+B_2) \sin(\omega t)&#10;\end{displaymath}&#10; --&gt;&lt;img width="341" height="31" border="0" src="https://technick.net/img/guide_dft/img526.png" alt="\" egin="" isplaymath="" t="" a="" a="" os="" mega="" b="" b="" in="" mega="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;This result, consisting of one in-phase and one quadrature signal&#10;component, can now be converted to a single sinusoid at some amplitude and&#10;phase (and frequency &lt;img width="15" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img527.png" alt="$\" mega="" /&gt;), as discussed above.&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/in_phase_quadrature_sinusoi"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/constructive_destructive_in"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Constructive and Destructive Interference of Sinusoids</title><link>https://technick.net/guides/theory/dft/constructive_destructive_in/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/constructive_destructive_in/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/sinusoids_at_same"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/exponentials"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00615000000000000000"&gt;Constructive and Destructive Interference of Sinusoids&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;Sinusoidal signals are analogous to monochromatic &lt;a href="http://www.misty.com/~don/lasersam.php"&gt;laser&lt;/a&gt; light. You might&#10;have seen ''speckle'' associated with laser light, caused by destructive&#10;inteference of multiple reflections of the light beam. In a room, the&#10;same thing happens with sinusoidal sound. For example, play a simple&#10;sinusoidal tone (e.g., ''A-440'' which is a &lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;sinusoid&lt;/a&gt; at frequency &lt;img width="59" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img499.png" alt="$f=440$" /&gt;Hz) and walk around the room with one ear plugged. If the room is&#10;reverberant you should be able find places where the sound goes completely&#10;away due to &lt;a href="https://technick.net/guides/theory/dft/constructive_destructive_in"&gt;destructive interference&lt;/a&gt;. In between such places (which we&#10;call ''nodes'' in the soundfield), there are ''antinodes'' at which the&#10;sound is louder by 6 &lt;a href="https://technick.net/guides/theory/dft/decibels"&gt;dB&lt;/a&gt; (&lt;a href="https://technick.net/guides/theory/dft/logarithms"&gt;amplitude&lt;/a&gt; doubled) due to &lt;a href="https://technick.net/guides/theory/dft/constructive_destructive_in"&gt;constructive&#10;interference&lt;/a&gt;. In a diffuse reverberant soundfield, the distance between&#10;nodes is on the order of a wavelength (the ''&lt;a href="https://technick.net/guides/theory/dft/correlation"&gt;correlation&lt;/a&gt; distance'' within&#10;the random soundfield).&lt;/p&gt;&lt;p&gt;The way reverberation produces nodes and antinodes for sinusoids in a room&#10;is illustrated by the simple &lt;i&gt;comb filter&lt;/i&gt;.&lt;a name="tex2html42" href="https://technick.net/guides/theory/dft/footnode#foot6860"&gt;&lt;sup&gt;5.2&lt;/sup&gt;&lt;/a&gt; There is also shown in Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/constructive_destructive_in#fig:combfilter"&gt;5.3&lt;/a&gt;. A unit-amplitude&#10;sinusoid is present at the input, and the output must also be sinusoidal,&#10;since the comb filter is linear and time-invariant. The feedforward path&#10;of the comb filter has a gain of &lt;img width="24" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img528.png" alt="$0.5$" /&gt;, and the delay is one period in one&#10;case and half a period in the other. With the delay set to one period, the&#10;unit amplitude sinusoid coming out of the delay line &lt;i&gt;constructively&#10;interferes&lt;/i&gt; with the amplitude &lt;img width="24" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img528.png" alt="$0.5$" /&gt; sinusoid from the feed-forward path,&#10;and the output amplitude is therefore &lt;img width="93" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img529.png" alt="$1+0.5=1.5$" /&gt;. In the other case, with&#10;the delay set to &lt;i&gt;half&lt;/i&gt; period, the unit amplitude sinusoid coming out&#10;of the delay line &lt;i&gt;destructively interferes&lt;/i&gt; with the amplitude &lt;img width="24" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img528.png" alt="$0.5$" /&gt;sinusoid from the feed-forward path, and the output amplitude therefore&#10;drops to &lt;!-- MATH&#10; $\left|-1+0.5\right|=0.5$&#10; --&gt;&lt;img width="115" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img530.png" alt="$\" eft\vert-1="" ight\vert="0.5$" /&gt;.&lt;/p&gt;&lt;p&gt; &lt;div align="CENTER"&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:combfilter"&gt;&lt;/a&gt;&lt;a name="6901"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure 5.3:&lt;/strong&gt;A comb filter with a&#10;sinusoidal input.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; $\scalebox{0.8}{\includegraphics{eps/combfilter.eps}}$&#10; --&gt;&lt;img width="526" height="163" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img531.png" alt="\" calebox="" ncludegraphics="" ps="" ombfilter="" ps="" /&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;&lt;p&gt;&lt;i&gt;comb-filter&lt;/i&gt;&lt;a name="6907"&gt;&lt;/a&gt;&lt;/p&gt;&lt;p&gt;Consider a fixed delay of &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img532.png" alt="$\" au="" /&gt; seconds for the delay line. Constructive&#10;interference happens at all frequencies for which an &lt;i&gt;exact integer&lt;/i&gt;number of periods fits in the delay line, i.e., &lt;!-- MATH&#10; $f\tau=0,1,2,3,\ldots$&#10; --&gt;&lt;img width="122" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img533.png" alt="$f\" au="0,1,2,3,\ldots$" /&gt;, or&lt;img width="61" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img534.png" alt="$f=n/\" au="" /&gt;, for &lt;!-- MATH&#10; $n=0,1,2,3,\ldots$&#10; --&gt;&lt;img width="113" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img535.png" alt="$n=0,1,2,3,\" dots="" /&gt;. On the other hand, destructive&#10;interference happens at all frequencies for which number of periods in the&#10;delay line is an integer plus a half, i.e., &lt;!-- MATH&#10; $f\tau = 1.5, 2.5, 3.5,$&#10; --&gt;&lt;img width="123" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img536.png" alt="$f\" au="1.5," /&gt; etc.,&#10;or, &lt;!-- MATH&#10; $f = (n+1/2)/\tau$&#10; --&gt;&lt;img width="117" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img537.png" alt="$f = (n+1/2)/\" au="" /&gt;, for &lt;!-- MATH&#10; $n=0,1,2,3,\ldots$&#10; --&gt;&lt;img width="113" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img535.png" alt="$n=0,1,2,3,\" dots="" /&gt;. It is quick to verify&#10;that frequencies of constructive interference alternate with frequencies of&#10;destructive interference, and therefore the &lt;i&gt;amplitude response&lt;/i&gt; of the&#10;comb filter (a plot of gain versus frequency) looks as shown in&#10;Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/constructive_destructive_in#fig:combfilterFR"&gt;5.4&lt;/a&gt;.&lt;/p&gt;&lt;p&gt; &lt;div align="CENTER"&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:combfilterFR"&gt;&lt;/a&gt;&lt;a name="6912"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure 5.4:&lt;/strong&gt;Comb filter amplitude&#10;response when the delay is &lt;img width="42" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img6.png" alt="$\" au="1$" /&gt; sec.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; $\scalebox{0.8}{\includegraphics{eps/combfilterFR.eps}}$&#10; --&gt;&lt;img width="361" height="175" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img538.png" alt="\" calebox="" ncludegraphics="" ps="" ombfilterfr="" ps="" /&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;&lt;p&gt;The ampitude response of a comb filter has a ''comb'' like shape,&#10;hence the name.&lt;a name="tex2html45" href="https://technick.net/guides/theory/dft/footnode#foot6601"&gt;&lt;sup&gt;5.3&lt;/sup&gt;&lt;/a&gt; Note that&#10;if the feedforward gain is increased from &lt;img width="24" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img528.png" alt="$0.5$" /&gt; to &lt;img width="12" height="13" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img78.png" alt="$1$" /&gt;, the&#10;comb-filter gain ranges between &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img38.png" alt="$0$" /&gt; (complete cancellation) and &lt;img width="12" height="13" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img76.png" alt="$2$" /&gt;.&#10;Negating the feedforward gain inverts the gain curve, placing a&#10;minumum at dc&lt;a name="tex2html46" href="https://technick.net/guides/theory/dft/footnode#foot6602"&gt;&lt;sup&gt;5.4&lt;/sup&gt;&lt;/a&gt; instead of a peak.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/sinusoids_at_same"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/exponentials"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Exponentials</title><link>https://technick.net/guides/theory/dft/exponentials/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/exponentials/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/constructive_destructive_in"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/why_exponentials_are"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00620000000000000000"&gt;Exponentials&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;The canonical form of an &lt;a href="https://technick.net/guides/theory/dft/exponentials"&gt;exponential function&lt;/a&gt;, as typically used in signal&#10;processing, is&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;a(t) = A e^{-t/\tau}, \quad t\geq 0&#10;\end{displaymath}&#10; --&gt;&lt;img width="171" height="31" border="0" src="https://technick.net/img/guide_dft/img540.png" alt="\" egin="" isplaymath="" a="" a="a" t="" au="" uad="" eq="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img532.png" alt="$\" au="" /&gt; is called the &lt;i&gt;time constant&lt;/i&gt; of the &lt;a href="https://technick.net/guides/theory/dft/exponentials"&gt;exponential&lt;/a&gt;. &lt;img width="16" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img485.png" alt="$A$" /&gt; is&#10;the peak &lt;a href="https://technick.net/guides/theory/dft/logarithms"&gt;amplitude&lt;/a&gt;, as before. The time constant is the time it takes to decay&#10;by &lt;img width="27" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img541.png" alt="$1/e$" /&gt;, i.e.,&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\frac{a(\tau)}{a(0)} = \frac{1}{e}&#10;\end{displaymath}&#10; --&gt;&lt;img width="69" height="49" border="0" src="https://technick.net/img/guide_dft/img542.png" alt="\" egin="" isplaymath="" rac="" a="" au="" a="" rac="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;A normalized exponential decay is depicted in Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/exponentials#fig:exponential"&gt;5.5&lt;/a&gt;.&lt;p&gt; &lt;div align="CENTER"&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:exponential"&gt;&lt;/a&gt;&lt;a name="6921"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure 5.5:&lt;/strong&gt;The decaying exponential&lt;img width="53" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img7.png" alt="$Ae^{-t/\" au="" /&gt;.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; $\scalebox{0.5}{\includegraphics{eps/exponential.eps}}$&#10; --&gt;&lt;img width="225" height="113" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img543.png" alt="\" calebox="" ncludegraphics="" ps="" xponential="" ps="" /&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;&lt;p&gt;&lt;br /&gt;&lt;hr /&gt;&lt;!--Table of Child-Links--&gt;&lt;a name="CHILD_LINKS"&gt;&lt;strong&gt;Subsections&lt;/strong&gt;&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html1348" href="https://technick.net/guides/theory/dft/why_exponentials_are"&gt;Why Exponentials are Important&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1349" href="https://technick.net/guides/theory/dft/audio_decay_time"&gt;Audio Decay Time (&lt;img width="23" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img8.png" alt="$t_{60}$" /&gt;)&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;!--End of Table of Child-Links--&gt;&#10;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/constructive_destructive_in"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/why_exponentials_are"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Why Exponentials are Important</title><link>https://technick.net/guides/theory/dft/why_exponentials_are/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/why_exponentials_are/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/exponentials"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/audio_decay_time"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00621000000000000000"&gt;Why Exponentials are Important&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;&lt;a href="https://technick.net/guides/theory/dft/exponentials"&gt;Exponential&lt;/a&gt; &lt;i&gt;decay&lt;/i&gt; occurs naturally when a quantity is decaying at a&#10;rate which is proportional to how much is left. In nature, all &lt;i&gt;linear&#10;resonators&lt;/i&gt;, such as musical instrument strings and woodwind bores, exhibit&#10;exponential decay in their response to a momentary excitation. As another&#10;example, reverberant energy in a room decays exponentially after the direct&#10;sound stops. Essentially all &lt;i&gt;undriven oscillations&lt;/i&gt; decay&#10;exponentially (provided they are linear and time-invariant). Undriven&#10;means there is no ongoing source of driving energy. Examples of undriven&#10;oscillations include the vibrations of a tuning fork, struck or plucked&#10;strings, a marimba or xylophone bar, and so on. Examples of driven&#10;oscillations include horns, woodwinds, bowed strings, and voice. Driven&#10;oscillations must be periodic while undriven oscillations normally are not,&#10;except in idealized cases.&lt;/p&gt;</description></item><item><title>Audio Decay Time</title><link>https://technick.net/guides/theory/dft/audio_decay_time/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/audio_decay_time/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/why_exponentials_are"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/complex_sinusoids"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00622000000000000000"&gt;Audio Decay Time (&lt;img width="23" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img8.png" alt="$t_{60}$" /&gt;)&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;In audio, a decay by &lt;img width="27" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img541.png" alt="$1/e$" /&gt; is too small to be considered a practical&#10;''&lt;a href="https://technick.net/guides/theory/dft/audio_decay_time"&gt;decay time&lt;/a&gt;.'' In &lt;i&gt;architectural acoustics&lt;/i&gt; (which includes the&#10;design of concert halls), a more commonly used measure of decay is&#10;''&lt;img width="23" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img8.png" alt="$t_{60}$" /&gt;'', which is defined as the &lt;i&gt;time to decay by &lt;img width="20" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img545.png" alt="$60$" /&gt;&lt;a href="https://technick.net/guides/theory/dft/decibels"&gt;dB&lt;/a&gt;&lt;/i&gt;.&lt;a name="tex2html49" href="https://technick.net/guides/theory/dft/footnode#foot6863"&gt;&lt;sup&gt;5.5&lt;/sup&gt;&lt;/a&gt; That is, &lt;img width="23" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img8.png" alt="$t_{60}$" /&gt; is obtained by&#10;solving the equation&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\frac{a(t_{60})}{a(0)} = 10^{-60/20} = 0.001&#10;\end{displaymath}&#10; --&gt;&lt;img width="198" height="49" border="0" src="https://technick.net/img/guide_dft/img548.png" alt="\" egin="" isplaymath="" rac="" a="" a="a" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Using the definition of the &lt;a href="https://technick.net/guides/theory/dft/exponentials"&gt;exponential&lt;/a&gt; &lt;!-- MATH&#10; $a(t) = A e^{-t/\tau}$&#10; --&gt;&lt;img width="100" height="36" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img549.png" alt="$a(t) = A e^{-t/\" au="" /&gt;, we find&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;t_{60} = \ln(1000) \tau \approx 6.91 \tau&#10;\end{displaymath}&#10; --&gt;&lt;img width="182" height="31" border="0" src="https://technick.net/img/guide_dft/img550.png" alt="\" egin="" isplaymath="" ln="" au="" pprox="" au="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Thus, &lt;img width="23" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img8.png" alt="$t_{60}$" /&gt; is about seven time constants. See where &lt;img width="23" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img8.png" alt="$t_{60}$" /&gt; is marked&#10;on Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/exponentials#fig:exponential"&gt;5.5&lt;/a&gt; compared with &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img532.png" alt="$\" au="" /&gt;.&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/why_exponentials_are"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/complex_sinusoids"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Complex Sinusoids</title><link>https://technick.net/guides/theory/dft/complex_sinusoids/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/complex_sinusoids/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/audio_decay_time"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/circular_motion"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00630000000000000000"&gt;Complex Sinusoids&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;Recall &lt;a href="https://technick.net/guides/theory/dft/proof_euler_s_identity"&gt;Euler's Identity&lt;/a&gt;,&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;e^{j\theta} = \cos(\theta) + j\sin(\theta)&#10;\end{displaymath}&#10; --&gt;&lt;img width="167" height="31" border="0" src="https://technick.net/img/guide_dft/img64.png" alt="\" egin="" isplaymath="" j\theta="" os="" heta="" sin="" heta="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Multiplying this equation by &lt;img width="45" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img551.png" alt="$A \" eq="" /&gt; and setting &lt;!-- MATH&#10; $\theta = \omega t +&#10;\phi$&#10; --&gt;&lt;img width="78" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img552.png" alt="$\" heta="\omega" t="" hi="" /&gt;, we obtain the definition of the &lt;i&gt;complex &lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;sinusoid&lt;/a&gt;&lt;/i&gt;:&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;s(t) \isdef A e^{j(\omega t+\phi)} = A \cos(\omega t+\phi) + jA\sin(\omega t+\phi)&#10;\end{displaymath}&#10; --&gt;&lt;img width="381" height="31" border="0" src="https://technick.net/img/guide_dft/img553.png" alt="\" egin="" isplaymath="" s="" isdef="" j="" mega="" hi="" a="" os="" mega="" hi="" a\sin="" mega="" hi="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Thus, a complex sinusoid consists of an &lt;a href="https://technick.net/guides/theory/dft/in_phase_quadrature_sinusoi"&gt;in-phase component&lt;/a&gt; for its real&#10;part, and a phase-&lt;a href="https://technick.net/guides/theory/dft/in_phase_quadrature_sinusoi"&gt;quadrature&lt;/a&gt; component for its imaginary part. Since&#10;&lt;!-- MATH&#10; $\sin^2(\theta) + \cos^2(\theta) = 1$&#10; --&gt;&lt;img width="148" height="35" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img554.png" alt="$\" in="" heta="" os="" heta="" /&gt;, we have&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\left|s(t)\right| \equiv A&#10;\end{displaymath}&#10; --&gt;&lt;img width="73" height="31" border="0" src="https://technick.net/img/guide_dft/img555.png" alt="\" egin="" isplaymath="" eft\vert="" right\vert="" quiv="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;That is, the complex sinusoid is &lt;i&gt;constant modulus&lt;/i&gt;. (The symbol&#10;''&lt;img width="16" height="13" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img556.png" alt="$\" quiv="" /&gt;'' means ''identically equal to,'' i.e., for all &lt;img width="10" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img484.png" alt="$t$" /&gt;.)&#10;The phase of the complex sinusoid is &lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\angle s(t) = \omega t+\phi&#10;\end{displaymath}&#10; --&gt;&lt;img width="110" height="31" border="0" src="https://technick.net/img/guide_dft/img557.png" alt="\" egin="" isplaymath="" ngle="" omega="" hi="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;The derivative of the phase of the complex sinusoid gives itsfrequency&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\frac{d}{dt}\angle s(t) = \omega = 2\pi f&#10;\end{displaymath}&#10; --&gt;&lt;img width="144" height="43" border="0" src="https://technick.net/img/guide_dft/img558.png" alt="\" egin="" isplaymath="" rac="" dt="dt" angle="" omega="2\pi" f="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;hr /&gt;&lt;!--Table of Child-Links--&gt;&lt;a name="CHILD_LINKS"&gt;&lt;strong&gt;Subsections&lt;/strong&gt;&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html1384" href="https://technick.net/guides/theory/dft/circular_motion"&gt;Circular Motion&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1385" href="https://technick.net/guides/theory/dft/projection_circular_motion"&gt;Projection of Circular Motion&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1386" href="https://technick.net/guides/theory/dft/positive_negative_frequenci"&gt;Positive and Negative Frequencies&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1387" href="https://technick.net/guides/theory/dft/analytic_signal_hilbert"&gt;The Analytic Signal and Hilbert Transform Filters&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1388" href="https://technick.net/guides/theory/dft/generalized_complex_sinusoi"&gt;Generalized Complex Sinusoids&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1389" href="https://technick.net/guides/theory/dft/sampled_sinusoids"&gt;Sampled Sinusoids&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1390" href="https://technick.net/guides/theory/dft/powers"&gt;Powers of &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt;&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1391" href="https://technick.net/guides/theory/dft/why_generalized_complex"&gt;Why (Generalized) Complex Sinusoids are Important&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1392" href="https://technick.net/guides/theory/dft/comparing_analog_digital"&gt;Comparing Analog and Digital Complex Planes&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;!--End of Table of Child-Links--&gt;&#10;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/audio_decay_time"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/circular_motion"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Circular Motion</title><link>https://technick.net/guides/theory/dft/circular_motion/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/circular_motion/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/complex_sinusoids"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/projection_circular_motion"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00631000000000000000"&gt;Circular Motion&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;Since the modulus of the complex &lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;sinusoid&lt;/a&gt; is constant, it must lie on a&lt;i&gt;circle&lt;/i&gt; in the &lt;a href="https://technick.net/guides/theory/dft/complex_plane"&gt;complex plane&lt;/a&gt;. For example,&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;x(t) = e^{j\omega t}&#10;\end{displaymath}&#10; --&gt;&lt;img width="83" height="31" border="0" src="https://technick.net/img/guide_dft/img559.png" alt="\" egin="" isplaymath="" t="" j\omega="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;traces out &lt;i&gt;counter-clockwise&lt;/i&gt; circular motion along the unit&#10;circle in the complex plane, while&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\overline{x(t)} = e^{-j\omega t}&#10;\end{displaymath}&#10; --&gt;&lt;img width="93" height="31" border="0" src="https://technick.net/img/guide_dft/img560.png" alt="\" egin="" isplaymath="" verline="" t="" j\omega="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;is &lt;i&gt;clockwise&lt;/i&gt; circular motion.&lt;p&gt;We call a complex sinusoid of the form &lt;img width="31" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img561.png" alt="$e^{j\" mega="" /&gt;, where &lt;img width="44" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img562.png" alt="$\" mega="" t="" /&gt;, a&lt;i&gt;positive-frequency sinusoid&lt;/i&gt;. Similarly, we define a complex sinusoid&#10;of the form &lt;!-- MATH&#10; $e^{-j\omega t}$&#10; --&gt;&lt;img width="41" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img563.png" alt="$e^{-j\" mega="" /&gt;, with &lt;img width="44" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img562.png" alt="$\" mega="" t="" /&gt;, to be a &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/positive_negative_frequenci"&gt;negative-frequency&lt;/a&gt; sinusoid&lt;/i&gt;. Note that a positive- or negative-frequency&#10;sinusoid is necessarily complex.&lt;/p&gt;&lt;p&gt;&lt;i&gt;&lt;img width="20" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img324.png" alt="$\" l="" /&gt; REMARK: Add figure: circular motion (animation for web version) &lt;img width="20" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img325.png" alt="$\" g="" /&gt; &lt;/i&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/complex_sinusoids"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/projection_circular_motion"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Projection of Circular Motion</title><link>https://technick.net/guides/theory/dft/projection_circular_motion/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/projection_circular_motion/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/circular_motion"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/positive_negative_frequenci"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00632000000000000000"&gt;Projection of Circular Motion&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;We have&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;\mbox{re}\left\{e^{j\omega t}\right\} &amp;=&amp; \cos(\omega t) \\&#10;\mbox{im}\left\{e^{j\omega t}\right\} &amp;=&amp; \sin(\omega t)&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="175" height="61" border="0" src="https://technick.net/img/guide_dft/img564.png" alt="\" egin="" qnarray="" box="" e="" eft\="" j\omega="" ight\="" os="" mega="" box="" m="" eft\="" j\omega="" ight\="" in="" mega="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Interpreting this in the &lt;a href="https://technick.net/guides/theory/dft/complex_plane"&gt;complex plane&lt;/a&gt; tells us that &lt;i&gt;sinusoidal motion&#10;is the projection of circular motion onto any straight line.&lt;/i&gt; Thus, the&#10;sinusoidal motion &lt;!-- MATH&#10; $\cos(\omega t)$&#10; --&gt;&lt;img width="54" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img503.png" alt="$\" os="" mega="" /&gt; is the projection of the circular motion&lt;img width="31" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img561.png" alt="$e^{j\" mega="" /&gt; onto the &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; (real-part) axis, while &lt;!-- MATH&#10; $\sin(\omega t)$&#10; --&gt;&lt;img width="52" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img504.png" alt="$\" in="" mega="" /&gt; is&#10;the projection of &lt;img width="31" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img561.png" alt="$e^{j\" mega="" /&gt; onto the &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img13.png" alt="$y$" /&gt; (imaginary-part) axis.&lt;p&gt;Figure&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/projection_circular_motion#fig:circle"&gt;5.7&lt;/a&gt; shows a plot of a complex &lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;sinusoid&lt;/a&gt; versus time, along with its&#10;projections onto coordinate planes. This is a 3D plot showing the&lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt;-plane versus time. The axes are the real part, imaginary part, and&#10;time. (Or we could have used magnitude and phase versus time.)&lt;/p&gt;&lt;p&gt; &lt;div align="CENTER"&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:circle"&gt;&lt;/a&gt;&lt;a name="6946"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure 5.7:&lt;/strong&gt;A complex sinusoid and its projections.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; $\scalebox{0.8}{\includegraphics{eps/circle.eps}}$&#10; --&gt;&lt;img width="319" height="207" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img565.png" alt="\" calebox="" ncludegraphics="" ps="" ircle="" ps="" /&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;&lt;p&gt;Note that the left projection (onto the &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt; plane) is a circle, the lower&#10;projection (real-part vs. time) is a cosine, and the upper projection&#10;(imaginary-part vs. time) is a sine. A point traversing the plot projects&#10;to uniform circular motion in the &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt; plane, and sinusoidal motion on the&#10;two other planes.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/circular_motion"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/positive_negative_frequenci"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Positive and Negative Frequencies</title><link>https://technick.net/guides/theory/dft/positive_negative_frequenci/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/positive_negative_frequenci/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/projection_circular_motion"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/analytic_signal_hilbert"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00633000000000000000"&gt;Positive and Negative Frequencies&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;Earlier, we used &lt;a href="https://technick.net/guides/theory/dft/proof_euler_s_identity"&gt;Euler's Identity&lt;/a&gt; to show&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;\cos(\theta) &amp;= \frac{\displaystyle e^{j \theta} + e^{-j \theta}}{2} \\&#10;\sin(\theta) &amp;= \frac{\displaystyle e^{j \theta} - e^{-j \theta}}{2j}&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="163" height="74" border="0" src="https://technick.net/img/guide_dft/img566.png" alt="\" egin="" qnarray="" os="" heta="" rac="" isplaystyle="" theta="" j="" het="" heta="" rac="" isplaystyle="" theta="" j="" heta="" end="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Setting &lt;!-- MATH&#10; $\theta = \omega t + \phi$&#10; --&gt;&lt;img width="78" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img552.png" alt="$\" heta="\omega" t="" hi="" /&gt;, we see that both sine and cosine (and&#10;hence all real &lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;sinusoids&lt;/a&gt;) consist of a sum of equal and opposite circular&#10;motion. Phrased differently, every real sinusoid consists of an equal&#10;contribution of positive and &lt;a href="https://technick.net/guides/theory/dft/positive_negative_frequenci"&gt;negative frequency&lt;/a&gt; components. This is true&#10;of all real signals. When we get to &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;spectrum analysis&lt;/a&gt;, we will find that&#10;every real signal contains equal amounts of positive and &lt;a href="https://technick.net/guides/theory/dft/positive_negative_frequenci"&gt;negative&#10;frequencies&lt;/a&gt;, i.e., if &lt;img width="41" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img356.png" alt="$X(\" mega="" /&gt; denotes the spectrum of the real signal&lt;img width="31" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img357.png" alt="$x(t)$" /&gt;, we will always have &lt;!-- MATH&#10; $|X(-\omega)| = |X(\omega)|$&#10; --&gt;&lt;img width="130" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img567.png" alt="$\" ert="" mega="" ert="\vert" x="" mega="" ert="" /&gt;.&lt;p&gt;Note that, mathematically, the complex sinusoid &lt;!-- MATH&#10; $Ae^{j(\omega t + \phi)}$&#10; --&gt;&lt;img width="71" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img568.png" alt="$Ae^{j(\" mega="" hi="" /&gt;is really &lt;i&gt;simpler&lt;/i&gt; and &lt;i&gt;more basic&lt;/i&gt; than the real sinusoid&#10;&lt;!-- MATH&#10; $A\sin(\omega t + \phi)$&#10; --&gt;&lt;img width="96" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img569.png" alt="$A\" in="" mega="" hi="" /&gt; because &lt;img width="31" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img561.png" alt="$e^{j\" mega="" /&gt; consists of one frequency&lt;img width="15" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img527.png" alt="$\" mega="" /&gt; while &lt;!-- MATH&#10; $\sin(\omega t)$&#10; --&gt;&lt;img width="52" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img504.png" alt="$\" in="" mega="" /&gt; really consists of two frequencies &lt;img width="15" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img527.png" alt="$\" mega="" /&gt;and &lt;img width="27" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img570.png" alt="$-\" mega="" /&gt;. We may think of a real sinusoid as being the sum of a&#10;positive-frequency and a negative-frequency complex sinusoid, so in that&#10;sense real sinusoids are ''twice as complicated'' as complex sinusoids.&#10;Complex sinusoids are also nicer because they have a &lt;i&gt;constant&#10;modulus&lt;/i&gt;. ''&lt;a href="https://technick.net/guides/theory/dft/logarithms"&gt;Amplitude&lt;/a&gt; envelope detectors'' for complex sinusoids are&#10;trivial: just compute the square root of the sum of the squares of the real&#10;and imaginary parts to obtain the &lt;i&gt;instantaneous peak amplitude&lt;/i&gt; at any&#10;time. Frequency demodulators are similarly trivial: just differentiate the&#10;phase of the complex sinusoid to obtain its &lt;i&gt;instantaneous frequency&lt;/i&gt;.&#10;It should therefore come as no surprise that signal processing engineers&#10;often prefer to convert real sinusoids into complex sinusoids before&#10;processing them further.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/projection_circular_motion"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/analytic_signal_hilbert"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>The Analytic Signal and Hilbert Transform Filters</title><link>https://technick.net/guides/theory/dft/analytic_signal_hilbert/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/analytic_signal_hilbert/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/positive_negative_frequenci"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/generalized_complex_sinusoi"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00634000000000000000"&gt;The Analytic Signal and Hilbert Transform Filters&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;A signal which has no &lt;a href="https://technick.net/guides/theory/dft/positive_negative_frequenci"&gt;negative-frequency&lt;/a&gt; components is called an&lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/analytic_signal_hilbert"&gt;analytic signal&lt;/a&gt;&lt;/i&gt;.&lt;a name="tex2html51" href="https://technick.net/guides/theory/dft/footnode#foot6869"&gt;&lt;sup&gt;5.6&lt;/sup&gt;&lt;/a&gt; Therefore, in&#10;continuous time, every analytic signal &lt;img width="30" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img571.png" alt="$z(t)$" /&gt; can be represented as&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;z(t) = \frac{1}{2\pi}\int_0^{\infty} Z(\omega)e^{j\omega t}d\omega&#10;\end{displaymath}&#10; --&gt;&lt;img width="203" height="48" border="0" src="https://technick.net/img/guide_dft/img572.png" alt="\" egin="" isplaymath="" t="" rac="" i="" nt="" nfty="" omega="" j\omega="" omega="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where &lt;img width="39" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img573.png" alt="$Z(\" mega="" /&gt; is the complex coefficient (setting the &lt;a href="https://technick.net/guides/theory/dft/logarithms"&gt;amplitude&lt;/a&gt; and&#10;phase) of the positive-freqency complex &lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;sinusoid&lt;/a&gt; &lt;!-- MATH&#10; $\exp(j\omega t)$&#10; --&gt;&lt;img width="64" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img574.png" alt="$\" xp="" omega="" /&gt; atfrequency &lt;img width="15" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img527.png" alt="$\" mega="" /&gt;.&lt;p&gt;Any sinusoid &lt;!-- MATH&#10; $A\cos(\omega t + \phi)$&#10; --&gt;&lt;img width="98" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img575.png" alt="$A\" os="" mega="" hi="" /&gt; in real life may be converted to a&#10;positive-frequency complex sinusoid &lt;!-- MATH&#10; $A\exp(j\omega t +&#10;\phi)$&#10; --&gt;&lt;img width="108" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img576.png" alt="$A\" xp="" omega="" hi="" /&gt; by simply generating a phase-&lt;a href="https://technick.net/guides/theory/dft/in_phase_quadrature_sinusoi"&gt;quadrature&lt;/a&gt; component &lt;!-- MATH&#10; $A\sin(\omega t +&#10;\phi)$&#10; --&gt;&lt;img width="96" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img569.png" alt="$A\" in="" mega="" hi="" /&gt; to serve as the ''imaginary part'':&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;A e^{j(\omega t + \phi)} = A\cos(\omega t + \phi) + j A\sin(\omega t + \phi)&#10;\end{displaymath}&#10; --&gt;&lt;img width="329" height="31" border="0" src="https://technick.net/img/guide_dft/img577.png" alt="\" egin="" isplaymath="" a="" omega="" hi="" cos="" mega="" hi="" sin="" mega="" hi="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;The phase-quadrature component can be generated from the &lt;a href="https://technick.net/guides/theory/dft/in_phase_quadrature_sinusoi"&gt;in-phase component&lt;/a&gt;by a simple quarter-cycle time shift.&lt;a name="tex2html52" href="https://technick.net/guides/theory/dft/footnode#foot6694"&gt;&lt;sup&gt;5.7&lt;/sup&gt;&lt;/a&gt;&lt;p&gt;For more complicated signals which are expressible as a sum of many&#10;sinusoids, a &lt;i&gt;filter&lt;/i&gt; can be constructed which shifts each sinusoidal&#10;component by a quarter cycle. This is called a &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/analytic_signal_hilbert"&gt;Hilbert transform&#10;filter&lt;/a&gt;&lt;/i&gt;. Let &lt;!-- MATH&#10; ${\cal H}_t\{x\}$&#10; --&gt;&lt;img width="48" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img578.png" alt="${\" al="" x\="" /&gt; denote the output at time &lt;img width="10" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img484.png" alt="$t$" /&gt; of the&lt;a href="https://technick.net/guides/theory/dft/analytic_signal_hilbert"&gt;Hilbert-transform&lt;/a&gt; filter applied to the signal &lt;img width="30" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img44.png" alt="$x(\" dot="" /&gt;. Ideally, this&#10;filter has magnitude &lt;img width="12" height="13" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img78.png" alt="$1$" /&gt; at all frequencies and introduces a phase shift of&lt;img width="42" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img579.png" alt="$-\" i="i" /&gt; at each positive frequency and &lt;img width="42" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img580.png" alt="$+\" i="i" /&gt; at each negative&#10;frequency. When a real signal &lt;img width="31" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img357.png" alt="$x(t)$" /&gt; and its Hilbert transform &lt;!-- MATH&#10; $y(t) =&#10;{\cal H}_t\{x\}$&#10; --&gt;&lt;img width="96" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img581.png" alt="$y(t) =&#10;{\" al="" x\="" /&gt; are used to form a new complex signal &lt;!-- MATH&#10; $z(t) = x(t) + j y(t)$&#10; --&gt;&lt;img width="132" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img582.png" alt="$z(t) = x(t) + j y(t)$" /&gt;,&#10;the signal &lt;img width="30" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img571.png" alt="$z(t)$" /&gt; is the (complex) &lt;i&gt;analytic signal&lt;/i&gt; corresponding to&#10;the real signal &lt;img width="31" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img357.png" alt="$x(t)$" /&gt;. In other words, for any real signal &lt;img width="31" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img357.png" alt="$x(t)$" /&gt;, the&#10;corresponding analytic signal &lt;!-- MATH&#10; $z(t)=x(t) + j {\cal H}_t\{x\}$&#10; --&gt;&lt;img width="150" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img583.png" alt="$z(t)=x(t) + j {\" al="" x\="" /&gt; has the property&#10;that all ''&lt;a href="https://technick.net/guides/theory/dft/positive_negative_frequenci"&gt;negative frequencies&lt;/a&gt;'' of &lt;img width="31" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img357.png" alt="$x(t)$" /&gt; have been ''filtered out.'' &lt;/p&gt;&lt;p&gt;To see how this works, recall that these phase shifts can be impressed on a&#10;complex sinusoid by multiplying it by &lt;!-- MATH&#10; $\exp(\pm j\pi/2) = \pm j$&#10; --&gt;&lt;img width="127" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img584.png" alt="$\" xp="" m="" i="" m="" /&gt;. Consider&#10;the positive and negative frequency components at the particular frequency&lt;img width="21" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img585.png" alt="$\" mega="" /&gt;:&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;x_+(t) &amp;\isdef &amp; e^{j\omega_0 t} \\&#10;x_-(t) &amp;\isdef &amp; e^{-j\omega_0 t}&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="137" height="60" border="0" src="https://technick.net/img/guide_dft/img586.png" alt="\" egin="" qnarray="" t="" sdef="" j\omega="" x="" isdef="" j\omega="" end="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Now let's apply a &lt;img width="32" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img587.png" alt="$-90$" /&gt; degrees phase shift to the positive-frequency&#10;component, and a &lt;img width="32" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img588.png" alt="$+90$" /&gt; degrees phase shift to the negative-frequency&#10;component:&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;y_+(t) &amp;=&amp; e^{-j\pi/2} e^{j\omega_0 t} = -j e^{j\omega_0 t} \\&#10;y_-(t) &amp;=&amp; e^{j\pi/2} e^{-j\omega_0 t} = j e^{-j\omega_0 t}&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="257" height="57" border="0" src="https://technick.net/img/guide_dft/img589.png" alt="\" egin="" qnarray="" t="" j\pi="" j\omega="" j="" omega="" y="" e="" pi="" j\omega="" j="" omega="" end="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Adding them together gives&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;z_+(t) &amp;\isdef &amp; x_+(t) + j y_+(t) = e^{j\omega_0 t} - j^2 e^{j\omega_0 t} &#10;&#9;= 2 e^{j\omega_0 t} \\&#10;z_-(t) &amp;\isdef &amp; x_-(t) + j y_-(t) = e^{-j\omega_0 t} + j^2 e^{-j\omega_0 t} = 0&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="403" height="60" border="0" src="https://technick.net/img/guide_dft/img590.png" alt="\" egin="" qnarray="" t="" sdef="" t="" t="" j\omega="" j="" x="" j="" e="" omega="" j="" j\omega="" end="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;and sure enough, the negative frequency component is filtered out. (There&#10;is also a gain of 2 at positive frequencies which we can remove by defining&#10;the Hilbert transform filter to have magnitude 1/2 at all frequencies.)&lt;p&gt;For a concrete example, let's start with the real sinusoid&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;x(t)=2\cos(\omega_0 t) = \exp(j\omega_0 t) + \exp(-j\omega_0 t).&#10;\end{displaymath}&#10; --&gt;&lt;img width="338" height="31" border="0" src="https://technick.net/img/guide_dft/img591.png" alt="\" egin="" isplaymath="" t="" os="" mega="" exp="" omega="" exp="" omega="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Applying the ideal phase shifts, the Hilbert transform is &lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;y(t) = \exp(j\omega_0 t-j\pi/2) + \exp(-j\omega_0 t + j\pi/2) = -j\exp(j\omega_0 t) + j\exp(-j\omega_0 t) = 2\sin(\omega_0 t)&#10;\end{displaymath}&#10; --&gt;&lt;img width="688" height="31" border="0" src="https://technick.net/img/guide_dft/img592.png" alt="\" egin="" isplaymath="" t="" xp="" omega="" j\pi="" xp="" omega="" j\pi="" exp="" omega="" j\exp="" omega="" sin="" mega="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;The analytic signal is then &lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;z(t) = x(t) + j y(t) = 2\cos(\omega_0 t) + j 2\sin(\omega_0 t) = 2 e^{j\omega_0 t},&#10;\end{displaymath}&#10; --&gt;&lt;img width="414" height="31" border="0" src="https://technick.net/img/guide_dft/img593.png" alt="\" egin="" isplaymath="" t="" t="" t="" os="" mega="" j="" in="" mega="" e="" omega="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;by &lt;a href="https://technick.net/guides/theory/dft/proof_euler_s_identity"&gt;Euler's identity&lt;/a&gt;. Thus, in the sum &lt;img width="85" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img594.png" alt="$x(t) + j y(t)$" /&gt;, the&#10;negative-frequency components of &lt;img width="31" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img357.png" alt="$x(t)$" /&gt; and &lt;img width="38" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img595.png" alt="$jy(t)$" /&gt; cancel out in the sum,&#10;leaving only the positive-frequency component. This happens for any real&#10;signal &lt;img width="31" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img357.png" alt="$x(t)$" /&gt;, not just for sinusoids as in our example.&lt;p&gt; &lt;div align="CENTER"&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:sineFD"&gt;&lt;/a&gt;&lt;a name="6966"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure 5.8:&lt;/strong&gt;Creation of the analytic signal&#10;&lt;!-- MATH&#10; $z(t)=e^{j\omega_0 t}$&#10; --&gt;&lt;img width="85" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img9.png" alt="$z(t)=e^{j\" mega="" /&gt; from the real sinusoid &lt;!-- MATH&#10; $x(t) = \cos(\omega_0&#10;t)$&#10; --&gt;&lt;img width="109" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img597.png" alt="$x(t) = \" os="" mega="" /&gt; and the derived phase-quadrature sinusoid &lt;!-- MATH&#10; $y(t) = \sin(\omega_0&#10;t)$&#10; --&gt;&lt;img width="107" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img598.png" alt="$y(t) = \" in="" mega="" /&gt;, viewed in the frequency domain. a) Spectrum of &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt;. b) Spectrum&#10;of &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img13.png" alt="$y$" /&gt;. c) Spectrum of &lt;img width="20" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img14.png" alt="$j y$" /&gt;. d) Spectrum of &lt;img width="78" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img15.png" alt="$z = x + jy$" /&gt;.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; $\scalebox{0.8}{\includegraphics{eps/sineFD.eps}}$&#10; --&gt;&lt;img width="330" height="839" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img596.png" alt="\" calebox="" ncludegraphics="" ps="" inefd="" ps="" /&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;&lt;p&gt;Figure&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/analytic_signal_hilbert#fig:sineFD"&gt;5.8&lt;/a&gt; illustrates what is going on in the frequency domain.&#10;While we haven't ''had'' Fourier analysis yet, it should come as no&#10;surprise that the spectrum of a complex sinusoid &lt;!-- MATH&#10; $\exp(j\omega_0 t)$&#10; --&gt;&lt;img width="71" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img599.png" alt="$\" xp="" omega="" /&gt; will&#10;consist of a single ''spike'' at the frequency &lt;!-- MATH&#10; $\omega=\omega_0$&#10; --&gt;&lt;img width="53" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img600.png" alt="$\" mega="\omega_0$" /&gt; and zero&#10;at all other frequencies. (Just follow things intuitively for now, and&#10;revisit Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/analytic_signal_hilbert#fig:sineFD"&gt;5.8&lt;/a&gt; after we've developed the &lt;a href="https://technick.net/guides/theory/dft/fourier_theorems"&gt;Fourier theorems&lt;/a&gt;.) From&#10;the identity &lt;!-- MATH&#10; $2\cos(\omega_0 t) = \exp(j\omega_0 t) +&#10;\exp(-j\omega_0 t)$&#10; --&gt;&lt;img width="258" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img601.png" alt="$2\" os="" mega="" exp="" omega="" exp="" omega="" /&gt;, we see that the spectrum contains unit-amplitude&#10;''spikes'' at &lt;!-- MATH&#10; $\omega=\omega_0$&#10; --&gt;&lt;img width="53" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img600.png" alt="$\" mega="\omega_0$" /&gt; and &lt;!-- MATH&#10; $\omega=-\omega_0$&#10; --&gt;&lt;img width="65" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img602.png" alt="$\" mega="-\omega_0$" /&gt;. Similarly, the&#10;identity &lt;!-- MATH&#10; $2\sin(\omega_0 t) = [\exp(j\omega_0 t) - \exp(-j\omega_0 t)]/j =&#10;-j \exp(j\omega_0 t) + j \exp(-j\omega_0 t)$&#10; --&gt;&lt;img width="500" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img603.png" alt="$2\" in="" mega="" exp="" omega="" exp="" omega="" j="-j" exp="" omega="" j="" xp="" omega="" /&gt; says that we have an amplitude&lt;img width="24" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img165.png" alt="$-j$" /&gt; spike at &lt;!-- MATH&#10; $\omega=\omega_0$&#10; --&gt;&lt;img width="53" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img600.png" alt="$\" mega="\omega_0$" /&gt; and an amplitude &lt;img width="24" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img604.png" alt="$+j$" /&gt; spike at&#10;&lt;!-- MATH&#10; $\omega=-\omega_0$&#10; --&gt;&lt;img width="65" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img602.png" alt="$\" mega="-\omega_0$" /&gt;. Multiplying &lt;img width="31" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img605.png" alt="$y(t)$" /&gt; by &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img63.png" alt="$j$" /&gt; results in &lt;!-- MATH&#10; $j\sin(\omega_0&#10;t) = \exp(j\omega_0 t) - \exp(-j\omega_0 t)$&#10; --&gt;&lt;img width="256" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img606.png" alt="$j\" in="" mega="" exp="" omega="" exp="" omega="" /&gt; which is a unit-amplitude ''up&#10;spike'' at &lt;!-- MATH&#10; $\omega=\omega_0$&#10; --&gt;&lt;img width="53" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img600.png" alt="$\" mega="\omega_0$" /&gt; and a unit ''down spike'' at&#10;&lt;!-- MATH&#10; $\omega=-\omega_0$&#10; --&gt;&lt;img width="65" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img602.png" alt="$\" mega="-\omega_0$" /&gt;. Finally, adding together the first and third plots,&#10;corresponding to &lt;!-- MATH&#10; $z(t) = x(t) + j y(t)$&#10; --&gt;&lt;img width="132" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img582.png" alt="$z(t) = x(t) + j y(t)$" /&gt;, we see that the two up-spikes&lt;i&gt;add in phase&lt;/i&gt; to give an amplitude 2 up-spike (which is&#10;&lt;!-- MATH&#10; $2\exp(j\omega_0 t)$&#10; --&gt;&lt;img width="82" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img607.png" alt="$2\" xp="" omega="" /&gt;), and the negative-frequency up-spike in the cosine is&lt;i&gt;canceled&lt;/i&gt; by the down-spike in &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img63.png" alt="$j$" /&gt; times sine at frequency&lt;img width="34" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img608.png" alt="$-\" mega="" /&gt;. This sequence of operations illustrates how the&#10;negative-frequency component &lt;!-- MATH&#10; $\exp(-j\omega_0 t)$&#10; --&gt;&lt;img width="83" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img609.png" alt="$\" xp="" omega="" /&gt; gets &lt;i&gt;filtered out&lt;/i&gt;by the addition of &lt;!-- MATH&#10; $2\cos(\omega_0 t)$&#10; --&gt;&lt;img width="71" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img610.png" alt="$2\" os="" mega="" /&gt; and &lt;!-- MATH&#10; $j 2\sin(\omega_0 t)$&#10; --&gt;&lt;img width="77" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img611.png" alt="$j 2\" in="" mega="" /&gt;.&lt;/p&gt;&lt;p&gt;As a final example (and application), let &lt;!-- MATH&#10; $x(t) = A(t)\cos(\omega t)$&#10; --&gt;&lt;img width="135" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img612.png" alt="$x(t) = A(t)\" os="" mega="" /&gt;,&#10;where &lt;img width="34" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img613.png" alt="$A(t)$" /&gt; is a slowly varying amplitude envelope (slow compared with&lt;img width="15" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img527.png" alt="$\" mega="" /&gt;). This is an example of &lt;i&gt;amplitude modulation&lt;/i&gt; applied to a&#10;sinusoid at ''carrier frequency'' &lt;img width="15" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img527.png" alt="$\" mega="" /&gt; (which is where you tune your AM&#10;radio). The Hilbert transform is almost exactly &lt;!-- MATH&#10; $y(t)\approx&#10;A(t)\sin(\omega t)$&#10; --&gt;&lt;img width="133" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img614.png" alt="$y(t)\" pprox="" sin="" mega="" /&gt;&lt;a name="tex2html54" href="https://technick.net/guides/theory/dft/footnode#foot6721"&gt;&lt;sup&gt;5.8&lt;/sup&gt;&lt;/a&gt;, and the analytic signal is &lt;!-- MATH&#10; $z(t)\approx A(t)e^{j\omega t}$&#10; --&gt;&lt;img width="109" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img615.png" alt="$z(t)\" pprox="" e="" omega="" /&gt;. Note&#10;that AM &lt;i&gt;demodulation&lt;/i&gt;&lt;a name="tex2html55" href="https://technick.net/guides/theory/dft/footnode#foot6871"&gt;&lt;sup&gt;5.9&lt;/sup&gt;&lt;/a&gt; is now nothing more&#10;than the &lt;i&gt;absolute value&lt;/i&gt;. I.e., &lt;!-- MATH&#10; $A(t) = \left|z(t)\right|$&#10; --&gt;&lt;img width="90" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img619.png" alt="$A(t) = \" eft\vert="" right\vert="" /&gt;. Due to this&#10;simplicity, Hilbert transforms are sometimes used in making&lt;i&gt;amplitude envelope followers&lt;/i&gt; for narrowband signals (i.e., signals with all energy centered about a single ''carrier'' frequency).&#10;AM demodulation is one application of a narrowband envelope follower.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/positive_negative_frequenci"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/generalized_complex_sinusoi"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Generalized Complex Sinusoids</title><link>https://technick.net/guides/theory/dft/generalized_complex_sinusoi/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/generalized_complex_sinusoi/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/analytic_signal_hilbert"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/sampled_sinusoids"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00635000000000000000"&gt;Generalized Complex Sinusoids&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;We have defined &lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;sinusoids&lt;/a&gt; and extended the definition to include complex&#10;sinusoids. We now extend one more step by allowing for &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/exponentials"&gt;exponential&lt;/a&gt;&lt;a href="https://technick.net/guides/theory/dft/logarithms"&gt;amplitude&lt;/a&gt; envelopes&lt;/i&gt;:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;y(t) \isdef {\cal A}e^{st}&#10;\end{displaymath}&#10; --&gt;&lt;img width="87" height="31" border="0" src="https://technick.net/img/guide_dft/img620.png" alt="\" egin="" isplaymath="" t="" sdef="" al="" st="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where &lt;img width="17" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img621.png" alt="${\" al="" /&gt; and &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img17.png" alt="$s$" /&gt; are &lt;i&gt;complex&lt;/i&gt;, and further defined as&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;{\cal A}&amp;=&amp; Ae^{j\phi} \\&#10; s &amp;=&amp; \sigma + j\omega&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="114" height="56" border="0" src="https://technick.net/img/guide_dft/img622.png" alt="\" egin="" qnarray="" al="" e="" phi="" s="" igma="" omega="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;When &lt;img width="43" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img623.png" alt="$\" igma="0$" /&gt;, we obtain&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;y(t) \isdef {\cal A}e^{j\omega t} = A e^{j\phi} e^{j\omega t} &#10;&#9;= A e^{j(\omega t + \phi)}&#10;\end{displaymath}&#10; --&gt;&lt;img width="282" height="31" border="0" src="https://technick.net/img/guide_dft/img624.png" alt="\" egin="" isplaymath="" t="" sdef="" al="" j\omega="" a="" phi="" j\omega="" a="" omega="" hi="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;which is the complex sinusoid at amplitude &lt;img width="16" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img485.png" alt="$A$" /&gt;, radian frequency &lt;img width="15" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img527.png" alt="$\" mega="" /&gt;,&#10;and phase &lt;img width="14" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img489.png" alt="$\" hi="" /&gt;.&lt;p&gt;More generally, we have&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;y(t) &amp;\isdef &amp; {\cal A}e^{st} \\&#10; &amp;\isdef &amp; A e^{j\phi} e^{(\sigma+j\omega) t} \\&#10; &amp;=&amp; A e^{(\sigma+j\omega) t + j\phi} \\&#10; &amp;=&amp; A e^{\sigma t} e^{j(\omega t + \phi)} \\&#10; &amp;=&amp; A e^{\sigma t} \left[\cos(\omega t + \phi) + j\sin(\omega t + \phi)\right]&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="330" height="139" border="0" src="https://technick.net/img/guide_dft/img625.png" alt="\" egin="" qnarray="" t="" sdef="" al="" st="" sdef="" a="" phi="" a="a" left="" os="" mega="" hi="" sin="" mega="" hi="" ight="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;Defining &lt;!-- MATH&#10; $\tau = -1/\sigma$&#10; --&gt;&lt;img width="72" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img626.png" alt="$\" au="-1/\sigma$" /&gt;, we see that the generalized complex sinusoid&#10;is just the complex sinusoid we had before with an &lt;i&gt;exponential envelope&lt;/i&gt;:&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;\mbox{re}\left\{y(t)\right\} &amp;=&amp; A e^{- t/\tau} \cos(\omega t + \phi) \\&#10;\mbox{im}\left\{y(t)\right\} &amp;=&amp; A e^{- t/\tau} \sin(\omega t + \phi)&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="260" height="57" border="0" src="https://technick.net/img/guide_dft/img627.png" alt="\" egin="" qnarray="" box="" e="" eft\="" t="" ight\="" a="" tau="" os="" mega="" m="" eft\="" t="" ight\="" a="" tau="" in="" mega="" hi="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/analytic_signal_hilbert"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/sampled_sinusoids"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Sampled Sinusoids</title><link>https://technick.net/guides/theory/dft/sampled_sinusoids/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/sampled_sinusoids/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/generalized_complex_sinusoi"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/powers"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00636000000000000000"&gt;Sampled Sinusoids&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;In discrete-time audio processing, such as we must do on a computer, we&#10;work with &lt;i&gt;samples&lt;/i&gt; of continuous-time signals. Let &lt;img width="19" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img55.png" alt="$f_s$" /&gt; denote the&lt;a href="https://technick.net/guides/theory/dft/shannon_s_sampling_theorem"&gt;sampling rate&lt;/a&gt; in Hz. For audio, we typically have &lt;img width="56" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img628.png" alt="$f_s&amp;gt;40$" /&gt; kHz, since the&#10;audio band nominally extends to &lt;img width="20" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img240.png" alt="$20$" /&gt; kHz. For compact discs (CDs), &lt;img width="68" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img629.png" alt="$f_s =&#10;44.1$" /&gt; kHz (or very close to that--I once saw Sony device using a sampling&#10;rate of &lt;img width="51" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img630.png" alt="$44,025$" /&gt; Hz), while for digital audio tape (DAT), &lt;img width="56" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img631.png" alt="$f_s = 48$" /&gt; kHz.&lt;/p&gt;&lt;p&gt;Let &lt;img width="67" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img632.png" alt="$T\" sdef="" s="s" /&gt; denote the &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/shannon_s_sampling_theorem"&gt;sampling period&lt;/a&gt;&lt;/i&gt; in seconds. Then to&#10;convert from continuous to discrete time, we replace &lt;img width="10" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img484.png" alt="$t$" /&gt; by &lt;img width="25" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img633.png" alt="$nT$" /&gt;, where &lt;img width="14" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img51.png" alt="$n$" /&gt;is an integer interpreted as the &lt;i&gt;sample number&lt;/i&gt;.&lt;/p&gt;&lt;p&gt;The sampled generalized complex &lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;sinusoid&lt;/a&gt; (which includes all other cases)&#10;is then&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;y(nT) &amp;=&amp; {\cal A}e^{s n T} = {\cal A}\left[e^{sT}\right]^n \\&#10; &amp;\isdef &amp; A e^{j\phi} e^{(\sigma+j\omega) nT} \\&#10; &amp;=&amp; A e^{\sigma nT} \left[\cos(\omega nT + \phi) + j\sin(\omega nT + \phi)\right] \\&#10; &amp;=&amp; A \left[e^{\sigma T}\right]^n&#10;&#9; \left[\cos(\omega nT + \phi) + j\sin(\omega nT + \phi)\right]&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="412" height="116" border="0" src="https://technick.net/img/guide_dft/img634.png" alt="\" egin="" qnarray="" nt="" al="" s="s" t="" al="" eft="" st="" ight="" n="" eft="" os="" mega="" phi="" sin="" mega="" phi="" ight="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/generalized_complex_sinusoi"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/powers"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Powers of</title><link>https://technick.net/guides/theory/dft/powers/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/powers/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/sampled_sinusoids"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/why_generalized_complex"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00637000000000000000"&gt;Powers of &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt;&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;Choose any two &lt;a href="https://technick.net/guides/theory/dft/introduction_complex_number"&gt;complex numbers&lt;/a&gt; &lt;img width="19" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img635.png" alt="$z_0$" /&gt; and &lt;img width="19" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img636.png" alt="$z_1$" /&gt;, and form the sequence&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;x(n) \isdef z_0 z_1^n, \quad n=0,1,2,3,\ldots&#10;\end{displaymath}&#10; --&gt;&lt;img width="238" height="31" border="0" src="https://technick.net/img/guide_dft/img637.png" alt="\" egin="" isplaymath="" n="" sdef="" n="" uad="" dots="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;What are the properties of this signal?&#10;Expressing the two complex numbers as &lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;z_0 &amp;=&amp; A e^{j\phi} \\&#10;z_1 &amp;=&amp; e^{sT} = e^{(\sigma + j\omega)T}&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="179" height="55" border="0" src="https://technick.net/img/guide_dft/img638.png" alt="\" egin="" qnarray="" a="a" j\phi="" e="" t="" sigma="" omega="" end="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;we see that the signal &lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img50.png" alt="$x(n)$" /&gt; is always a discrete-time generalized complex&lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;sinusoid&lt;/a&gt;, i.e., an exponentially enveloped complex sinusoid.&lt;p&gt;Figure&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/powers#fig:circledecaying"&gt;5.9&lt;/a&gt; shows a plot of a generalized (exponentially decaying)&#10;complex sinusoid versus time.&lt;/p&gt;&lt;p&gt; &lt;div align="CENTER"&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:circledecaying"&gt;&lt;/a&gt;&lt;a name="6995"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure 5.9:&lt;/strong&gt;Exponentially decaying&#10;complex sinusoid and its projections.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; $\scalebox{0.8}{\includegraphics{eps/circledecaying.eps}}$&#10; --&gt;&lt;img width="317" height="207" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img639.png" alt="\" calebox="" ncludegraphics="" ps="" ircledecaying="" ps="" /&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;&lt;p&gt;Note that the left projection (onto the &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt; plane) is a decaying spiral,&#10;the lower projection (real-part vs. time) is an exponentially decaying&#10;cosine, and the upper projection (imaginary-part vs. time) is an&#10;exponentially enveloped sine wave.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/sampled_sinusoids"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/why_generalized_complex"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Why (Generalized) Complex Sinusoids are Important</title><link>https://technick.net/guides/theory/dft/why_generalized_complex/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/why_generalized_complex/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/powers"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/comparing_analog_digital"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00638000000000000000"&gt;Why (Generalized) Complex Sinusoids are Important&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;As a preview of things to come, note that one signal&lt;img width="29" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img640.png" alt="$y(\" dot="" /&gt;&lt;a name="tex2html57" href="https://technick.net/guides/theory/dft/footnode#foot6872"&gt;&lt;sup&gt;5.10&lt;/sup&gt;&lt;/a&gt; is &lt;i&gt;projected&lt;/i&gt; onto&#10;another signal &lt;img width="30" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img44.png" alt="$x(\" dot="" /&gt; using an &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/inner_product"&gt;inner product&lt;/a&gt;&lt;/i&gt;. The inner product&#10;&lt;!-- MATH&#10; $\left&lt;y,x\right&gt;$&#10; --&gt;&lt;img width="41" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img642.png" alt="$\" eft="" t="" x\right="" t="" /&gt; computes the &lt;i&gt;coefficient of projection&lt;/i&gt;&lt;a name="tex2html58" href="https://technick.net/guides/theory/dft/footnode#foot6774"&gt;&lt;sup&gt;5.11&lt;/sup&gt;&lt;/a&gt; of &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img13.png" alt="$y$" /&gt; onto &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt;. If &lt;!-- MATH&#10; $x(n) =&#10;e^{j\omega_k n T}, n=0,1,2,\ldots,N-1$&#10; --&gt;&lt;img width="256" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img643.png" alt="$x(n) =&#10;e^{j\" mega="" t="" ldots="" n-1="" /&gt; (a sampled, unit-&lt;a href="https://technick.net/guides/theory/dft/logarithms"&gt;amplitude&lt;/a&gt;,&#10;zero-phase, complex &lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;sinusoid&lt;/a&gt;), then the inner product computes the &lt;i&gt;Discrete &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;Fourier Transform&lt;/a&gt;&lt;/i&gt; (&lt;a href="https://technick.net/guides/theory/dft/dft"&gt;DFT&lt;/a&gt;), provided the frequencies are chosen to&#10;be &lt;!-- MATH&#10; $\omega_k = 2\pi k f_s/N$&#10; --&gt;&lt;img width="106" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img644.png" alt="$\" mega="" pi="" s="s" n="" /&gt;. For the DFT, the inner product is&#10;specifically&lt;br /&gt;&lt;/p&gt;</description></item><item><title>Comparing Analog and Digital Complex Planes</title><link>https://technick.net/guides/theory/dft/comparing_analog_digital/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/comparing_analog_digital/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/why_generalized_complex"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/mathematica_selected_plots"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00639000000000000000"&gt;Comparing Analog and Digital Complex Planes&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;In signal processing, it is customary to use &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img17.png" alt="$s$" /&gt; as the Laplace transform&#10;variable for continuous-time analysis, and &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt; as the &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt;-transform&#10;variable for discrete-time analysis. In other words, for continuous-time&#10;systems, the frequency domain is the ''&lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img17.png" alt="$s$" /&gt; plane'', while for discrete-time&#10;systems, the frequency domain is the ''&lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt; plane.'' However, both are&#10;simply &lt;a href="https://technick.net/guides/theory/dft/complex_plane"&gt;complex planes&lt;/a&gt;.&lt;/p&gt;&lt;p&gt; &lt;div align="CENTER"&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:splane"&gt;&lt;/a&gt;&lt;a name="7012"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure 5.10:&lt;/strong&gt;Generalized complex &lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;sinusoids&lt;/a&gt;represented by points in the &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img17.png" alt="$s$" /&gt; plane.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; $\scalebox{0.8}{\includegraphics{eps/splane.eps}}$&#10; --&gt;&lt;img width="516" height="637" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img654.png" alt="\" calebox="" ncludegraphics="" ps="" plane="" ps="" /&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;&lt;p&gt; &lt;div align="CENTER"&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:zplane"&gt;&lt;/a&gt;&lt;a name="7021"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure 5.11:&lt;/strong&gt;Generalized complex sinusoids&#10;represented by points in the &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt; plane.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; $\scalebox{0.8}{\includegraphics{eps/zplane.eps}}$&#10; --&gt;&lt;img width="600" height="505" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img655.png" alt="\" calebox="" ncludegraphics="" ps="" plane="" ps="" /&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;&lt;p&gt;Figure&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/comparing_analog_digital#fig:splane"&gt;5.10&lt;/a&gt; illustrates the various sinusoids &lt;img width="23" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img656.png" alt="$e^{st}$" /&gt; represented by points&#10;in the &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img17.png" alt="$s$" /&gt; plane. The frequency axis is &lt;img width="51" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img653.png" alt="$s=j\" mega="" /&gt;, called the&#10;''&lt;img width="22" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img652.png" alt="$j\" mega="" /&gt; axis,'' and points along it correspond to complex sinusoids,&#10;with dc at &lt;img width="41" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img657.png" alt="$s=0$" /&gt; (&lt;img width="53" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img658.png" alt="$e^{0t}=1$" /&gt;). The upper-half plane corresponds to positive&#10;frequencies (counterclockwise circular or corkscrew motion) while the&#10;lower-half plane corresponds to &lt;a href="https://technick.net/guides/theory/dft/positive_negative_frequenci"&gt;negative frequencies&lt;/a&gt; (clockwise motion).&#10;In the left-half plane we have decaying (stable) &lt;a href="https://technick.net/guides/theory/dft/exponentials"&gt;exponential&lt;/a&gt; envelopes,&#10;while in the right-half plane we have growing (unstable) exponential&#10;envelopes. Along the real axis (&lt;img width="42" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img659.png" alt="$s=\" igma="" /&gt;), we have pure exponentials.&#10;Every point in the &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img17.png" alt="$s$" /&gt; plane can be said to correspond to some generalized&#10;complex sinusoids, &lt;!-- MATH&#10; $x(t) = {\cal A}e^{st}, t\geq 0$&#10; --&gt;&lt;img width="126" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img660.png" alt="$x(t) = {\" al="" st="" geq="" /&gt; with special cases being&#10;complex sinusoids &lt;!-- MATH&#10; ${\cal A}e^{j\omega t}$&#10; --&gt;&lt;img width="44" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img661.png" alt="${\" al="" j\omega="" /&gt;, exponentials &lt;!-- MATH&#10; $A e^{\sigma t}$&#10; --&gt;&lt;img width="37" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img662.png" alt="$A e^{\" igma="" /&gt;, and&#10;the constant function &lt;img width="61" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img663.png" alt="$x(t)=1$" /&gt; (dc).&lt;/p&gt;&lt;p&gt;Figure&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/comparing_analog_digital#fig:zplane"&gt;5.11&lt;/a&gt; shows examples of various sinusoids &lt;!-- MATH&#10; $z^n=[e^{sT}]^n$&#10; --&gt;&lt;img width="83" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img664.png" alt="$z^n=[e^{sT}]^n$" /&gt;represented by points in the &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt; plane. The frequency axis is the ''unit&#10;circle'' &lt;!-- MATH&#10; $z=e^{j\omega T}$&#10; --&gt;&lt;img width="65" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img665.png" alt="$z=e^{j\" mega="" /&gt;, and points along it correspond to &lt;i&gt;sampled&lt;/i&gt;complex sinusoids, with dc at &lt;img width="41" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img666.png" alt="$z=1$" /&gt; (&lt;!-- MATH&#10; $1^n = [e^{0T}]^n = 1$&#10; --&gt;&lt;img width="112" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img667.png" alt="$1^n = [e^{0T}]^n = 1$" /&gt;). As in the&lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img17.png" alt="$s$" /&gt; plane, the upper-half plane corresponds to positive frequencies while&#10;the lower-half plane corresponds to negative frequencies. Inside the unit&#10;circle, we have decaying (stable) exponential envelopes, while outside the&#10;unit circle, we have growing (unstable) exponential envelopes. Along the&#10;positive real axis (&lt;!-- MATH&#10; $z&gt;0, \mbox{im}\left\{z\right\}=0$&#10; --&gt;&lt;img width="122" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img668.png" alt="$z&amp;gt;0, \" box="" m="" eft\="" right\="" /&gt;), we have pure exponentials, but&#10;along the negative real axis (&lt;!-- MATH&#10; $z&lt;0, \mbox{im}\left\{z\right\}=0$&#10; --&gt;&lt;img width="122" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img669.png" alt="$z&amp;lt;0, \" box="" m="" eft\="" right\="" /&gt;), we have exponentially&#10;enveloped sampled sinusoids at frequency &lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img670.png" alt="$f_s/2$" /&gt; (exponentially enveloped&#10;alternating sequences). The negative real axis in the &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt; plane is&#10;normally a place where all signal &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt; transforms should be zero, and all&#10;system responses should be highly attenuated, since there should never be&#10;any energy at exactly half the &lt;a href="https://technick.net/guides/theory/dft/shannon_s_sampling_theorem"&gt;sampling rate&lt;/a&gt; (where &lt;a href="https://technick.net/guides/theory/dft/logarithms"&gt;amplitude&lt;/a&gt; and phase are&#10;ambiguously linked). Every point in the &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt; plane can be said to&#10;correspond to some sampled generalized complex sinusoids &lt;!-- MATH&#10; $x(n) = {\cal A}z^n&#10;= {\cal A}[e^{sT}]^n, n\geq 0$&#10; --&gt;&lt;img width="206" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img671.png" alt="$x(n) = {\" al="" n="{\cal" a="a" e="" t="" n\geq="" /&gt;, with special cases being sampled complex&#10;sinusoids &lt;!-- MATH&#10; ${\cal A}e^{j\omega nT}$&#10; --&gt;&lt;img width="56" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img672.png" alt="${\" al="" j\omega="" /&gt;, exponentials &lt;!-- MATH&#10; $A e^{\sigma nT}$&#10; --&gt;&lt;img width="49" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img673.png" alt="$A e^{\" igma="" /&gt;, and the&#10;constant function &lt;!-- MATH&#10; $x=[1,1,1,\ldots]$&#10; --&gt;&lt;img width="107" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img674.png" alt="$x=[1,1,1,\" dots="" /&gt; (dc).&lt;/p&gt;&lt;p&gt;In summary, the exponentially enveloped (''generalized'') complex sinusoid&#10;is the fundamental signal upon which other signals are ''projected'' in&#10;order to compute a Laplace transform in the continuous-time case, or a &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt;transform in the discrete-time case. As a special case, if the exponential&#10;envelope is eliminated (set to &lt;img width="12" height="13" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img78.png" alt="$1$" /&gt;), leaving only a complex sinusoid, then&#10;the projection reduces to the &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;Fourier transform&lt;/a&gt; in the continuous-time&#10;case, and either the &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;DFT&lt;/a&gt; (finite length) or DTFT (infinite length) in the&#10;discrete-time case. Finally, there are still other variations, such as&#10;short-time Fourier transforms (STFT) and wavelet transforms, which utilize&#10;further modifications such as projecting onto &lt;i&gt;windowed&lt;/i&gt; complex&#10;sinusoids. Music 420delves into&#10;these topics.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/why_generalized_complex"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/mathematica_selected_plots"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Mathematica for Selected Plots</title><link>https://technick.net/guides/theory/dft/mathematica_selected_plots/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/mathematica_selected_plots/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/comparing_analog_digital"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/acknowledgement"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00640000000000000000"&gt;&lt;/a&gt;&lt;a name="sec:MMA"&gt;&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/theory/dft/sidebar_mathematica"&gt;Mathematica&lt;/a&gt; for Selected Plots&lt;/h1&gt;&lt;p&gt;The Mathematica code for producing Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/example_sinusoids#fig:sine"&gt;5.1&lt;/a&gt; (minus the annotations which&#10;were done using NeXT Draw and EquationBuilder from Lighthouse Design) is&lt;pre&gt;&#10; Plot[10 Sin[2 Pi 2.5 t + Pi/4],{t,0,1},&#10; PlotLabel-&amp;gt;"10 Sin[2 Pi 2.5 t + Pi/4]",&#10; PlotPoints-&amp;gt;500,&#10; AxesLabel-&amp;gt;{" Sec", "Amp."}];&lt;/pre&gt;&lt;/p&gt;&lt;p&gt;The Mathematica code for Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/in_phase_quadrature_sinusoi#fig:quadrature"&gt;5.2&lt;/a&gt; is&lt;pre&gt;&#10;Show[&#10; Plot[Sin[2 Pi 2.5 t],{t,-0.1,1.1},&#10; PlotPoints-&amp;gt;500,&#10; AxesLabel-&amp;gt;{'' Time (Sec)'', ''&lt;a href="https://technick.net/guides/theory/dft/logarithms"&gt;Amplitude&lt;/a&gt;''}],&#10; Plot[Cos[2 Pi 2.5 t],{t,-0.1,1.1},&#10; PlotPoints-&amp;gt;500,&#10; PlotStyle-&amp;gt;Dashing[{0.01,0.01}]&#10;];&lt;/pre&gt;&lt;/p&gt;&lt;p&gt;For the complex &lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;sinusoid&lt;/a&gt; plots (Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/projection_circular_motion#fig:circle"&gt;5.7&lt;/a&gt; and Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/powers#fig:circledecaying"&gt;5.9&lt;/a&gt;),&#10;see the Mathematica notebook&lt;tt&gt;ComplexSinusoid.nb&lt;/tt&gt;on Craig Sapp's web pageof Mathematica notebooks. (The package&lt;tt&gt;SCMTheory.m&lt;/tt&gt;is&#10;required.)&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/comparing_analog_digital"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/acknowledgement"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Acknowledgement</title><link>https://technick.net/guides/theory/dft/acknowledgement/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/acknowledgement/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/mathematica_selected_plots"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/appendix_a_linear"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00960000000000000000"&gt;Acknowledgement&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;Thanks to Craig Stuart Sapp (&lt;a href="mailto:craig@ccrma.stanford.edu"&gt;craig@ccrma.stanford.edu&lt;/a&gt;) for contributing&#10;Figures&lt;a href="https://technick.net/guides/theory/dft/shift_operator#fig:shift"&gt;8.2&lt;/a&gt;,&lt;a href="https://technick.net/guides/theory/dft/graphical_convolution#fig:conv"&gt;8.3&lt;/a&gt;,&lt;a href="https://technick.net/guides/theory/dft/stretch_operator#fig:stretch"&gt;8.4&lt;/a&gt;,&lt;a href="https://technick.net/guides/theory/dft/repeat_operator#fig:repeat"&gt;8.6&lt;/a&gt;,&lt;a href="https://technick.net/guides/theory/dft/repeat_operator#fig:repeat3d"&gt;8.7&lt;/a&gt;,&lt;a href="https://technick.net/guides/theory/dft/decimation_operator#fig:dec"&gt;8.8&lt;/a&gt;,&lt;a href="https://technick.net/guides/theory/dft/alias_operator#fig:aliasing"&gt;8.9&lt;/a&gt;, and&lt;a href="https://technick.net/guides/theory/dft/alias_operator#fig:aliasingfd"&gt;8.10&lt;/a&gt;.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/mathematica_selected_plots"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/appendix_a_linear"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Geometric Signal Theory</title><link>https://technick.net/guides/theory/dft/geometric_signal_theory/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/geometric_signal_theory/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/acknowledgement"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00700000000000000000"&gt;Geometric Signal Theory&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;This chapter provides an introduction to the elements of &lt;a href="https://technick.net/guides/theory/dft/geometric_signal_theory"&gt;geometric&#10;signal theory&lt;/a&gt;, including vector spaces, norms, &lt;a href="https://technick.net/guides/theory/dft/inner_product"&gt;inner products&lt;/a&gt;,&lt;a href="https://technick.net/guides/theory/dft/orthogonality"&gt;orthogonality&lt;/a&gt;, projection of one signal onto another, and elementary&#10;vector space operations.&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;hr /&gt;&lt;!--Table of Child-Links--&gt;&lt;a name="CHILD_LINKS"&gt;&lt;strong&gt;Subsections&lt;/strong&gt;&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html1533" href="https://technick.net/guides/theory/dft/dft"&gt;The DFT&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1534" href="https://technick.net/guides/theory/dft/signals_vectors"&gt;Signals as Vectors&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html1535" href="https://technick.net/guides/theory/dft/example_vector_view"&gt;An Example Vector View: &lt;img width="48" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img19.png" alt="$N=2$" /&gt;&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1536" href="https://technick.net/guides/theory/dft/vector_addition"&gt;Vector Addition&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1537" href="https://technick.net/guides/theory/dft/vector_subtraction"&gt;Vector Subtraction&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1538" href="https://technick.net/guides/theory/dft/signal_metrics"&gt;Signal Metrics&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html1539" href="https://technick.net/guides/theory/dft/other_norms"&gt;Other Norms&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1540" href="https://technick.net/guides/theory/dft/inner_product"&gt;The Inner Product&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html1541" href="https://technick.net/guides/theory/dft/linearity_inner_product"&gt;Linearity of the Inner Product&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1542" href="https://technick.net/guides/theory/dft/norm_induced_inner"&gt;Norm Induced by the Inner Product&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1543" href="https://technick.net/guides/theory/dft/cauchy_schwarz_inequality"&gt;Cauchy-Schwarz Inequality&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1544" href="https://technick.net/guides/theory/dft/triangle_inequality"&gt;Triangle Inequality&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1545" href="https://technick.net/guides/theory/dft/triangle_difference_inequal"&gt;Triangle Difference Inequality&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1546" href="https://technick.net/guides/theory/dft/vector_cosine"&gt;Vector Cosine&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1547" href="https://technick.net/guides/theory/dft/orthogonality"&gt;Orthogonality&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1548" href="https://technick.net/guides/theory/dft/pythagorean_theorem_n_space"&gt;The Pythagorean Theorem in N-Space&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1549" href="https://technick.net/guides/theory/dft/projection"&gt;Projection&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1550" href="https://technick.net/guides/theory/dft/signal_reconstruction_proje"&gt;Signal Reconstruction from Projections&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html1551" href="https://technick.net/guides/theory/dft/example_changing_coordinate"&gt;An Example of Changing Coordinates in 2D&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1552" href="https://technick.net/guides/theory/dft/general_conditions"&gt;General Conditions&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1553" href="https://technick.net/guides/theory/dft/gram_schmidt_orthogonalizat"&gt;Gram-Schmidt Orthogonalization&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1554" href="https://technick.net/guides/theory/dft/appendix_matlab_examples"&gt;Appendix: Matlab Examples&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;!--End of Table of Child-Links--&gt;&#10;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/acknowledgement"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Signals as Vectors</title><link>https://technick.net/guides/theory/dft/signals_vectors/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/signals_vectors/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/dft"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/example_vector_view"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00720000000000000000"&gt;Signals as Vectors&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;For the &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;DFT&lt;/a&gt;, all signals and spectra are length &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt;. A length &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; sequence&lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; can be denoted by &lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img50.png" alt="$x(n)$" /&gt;, &lt;!-- MATH&#10; $n=0,1,2,\ldots N-1$&#10; --&gt;&lt;img width="143" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img685.png" alt="$n=0,1,2,\" dots="" /&gt;, where &lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img50.png" alt="$x(n)$" /&gt; may be&#10;real (&lt;!-- MATH&#10; $x\in{\cal R}^N$&#10; --&gt;&lt;img width="58" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img686.png" alt="$x\" n="" al="" /&gt;) or complex (&lt;!-- MATH&#10; $x\in{\cal C}^N$&#10; --&gt;&lt;img width="54" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img687.png" alt="$x\" n="" al="" /&gt;). We now wish to regard &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; as a&lt;i&gt;vector&lt;/i&gt; &lt;img width="13" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img21.png" alt="$\" nderline="" /&gt;&lt;a name="tex2html65" href="https://technick.net/guides/theory/dft/footnode#foot8632"&gt;&lt;sup&gt;6.1&lt;/sup&gt;&lt;/a&gt; in&#10;an &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; dimensional &lt;i&gt;vector space&lt;/i&gt;. That is, each sample &lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img50.png" alt="$x(n)$" /&gt; is&#10;regarded as a &lt;i&gt;coordinate&lt;/i&gt; in that space. A &lt;i&gt;vector&lt;/i&gt; &lt;img width="13" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img21.png" alt="$\" nderline="" /&gt; is&#10;mathematically a single &lt;i&gt;point&lt;/i&gt; in &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt;-space represented by a list of&#10;coordinates &lt;!-- MATH&#10; $(x_0,x_1,x_2,\ldots,x_{N-1})$&#10; --&gt;&lt;img width="152" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img688.png" alt="$(x_0,x_1,x_2,\" dots="" n-1="" /&gt; called an &lt;i&gt;&lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt;-tuple&lt;/i&gt;. (The&#10;notation &lt;img width="22" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img689.png" alt="$x_n$" /&gt; means the same thing as &lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img50.png" alt="$x(n)$" /&gt;.) It can be interpreted&#10;geometrically as an arrow in &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt;-space from the origin &lt;!-- MATH&#10; $\underline{0}&#10;\isdef (0,0,\ldots,0)$&#10; --&gt;&lt;img width="112" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img690.png" alt="$\" nderline="" sdef="" dots="" /&gt; to the point &lt;!-- MATH&#10; $\underline{x}\isdef &#10;(x_0,x_1,x_2,\ldots,x_{N-1})$&#10; --&gt;&lt;img width="182" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img691.png" alt="$\" nderline="" isdef="" x="" ldots="" n-1="" /&gt;.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;We define the following as equivalent:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;x \isdef \underline{x}\isdef x(\cdot) &#10;&#9;\isdef (x_0,x_1,\ldots,x_{N-1}) &#10;&#9;\isdef [x_0,x_1,\ldots,x_{N-1}]&#10;&#9;\isdef [x_0\; x_1\; \cdots\; x_{N-1}]&#10;\end{displaymath}&#10; --&gt;&lt;img width="564" height="31" border="0" src="https://technick.net/img/guide_dft/img692.png" alt="\" egin="" isplaymath="" isdef="" nderline="" isdef="" dot="" sdef="" x="" do="" x="" dots="" n-1="" sdef="" x="" dots\="" n-1="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where &lt;!-- MATH&#10; $x_n \isdef x(n)$&#10; --&gt;&lt;img width="74" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img693.png" alt="$x_n \" sdef="" /&gt; is the &lt;img width="14" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img51.png" alt="$n$" /&gt;th sample of the signal (vector) &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt;.&#10;From now on, unless specifically mentioned otherwise, &lt;i&gt;all signals are&#10;length &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt;&lt;/i&gt;.&lt;p&gt;&lt;br /&gt;&lt;hr /&gt;&lt;!--Table of Child-Links--&gt;&lt;a name="CHILD_LINKS"&gt;&lt;strong&gt;Subsections&lt;/strong&gt;&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html1569" href="https://technick.net/guides/theory/dft/example_vector_view"&gt;An Example Vector View: &lt;img width="48" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img19.png" alt="$N=2$" /&gt;&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;!--End of Table of Child-Links--&gt;&#10;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/dft"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/example_vector_view"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>An Example Vector View</title><link>https://technick.net/guides/theory/dft/example_vector_view/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/example_vector_view/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/signals_vectors"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/vector_addition"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00721000000000000000"&gt;An Example Vector View: &lt;img width="48" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img19.png" alt="$N=2$" /&gt;&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;Consider the example two-sample signal &lt;img width="70" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img18.png" alt="$x=(2, 3)$" /&gt; graphed in Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/example_vector_view#fig:vec2d"&gt;6.1&lt;/a&gt;.&lt;/p&gt;&lt;p&gt; &lt;div align="CENTER"&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:vec2d"&gt;&lt;/a&gt;&lt;a name="8710"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure 6.1:&lt;/strong&gt;A length 2 signal &lt;img width="70" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img18.png" alt="$x=(2, 3)$" /&gt;plotted as a vector in 2D space.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; $\scalebox{0.5}{\includegraphics{eps/vec2d.eps}}$&#10; --&gt;&lt;img width="128" height="112" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img694.png" alt="\" calebox="" ncludegraphics="" ps="" ec2d="" ps="" /&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;&lt;p&gt;Under the geometric interpretation of a length &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; signal, each sample is a&lt;i&gt;coordinate&lt;/i&gt; in the &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; dimensional space. Signals which are only two&#10;samples long are not terribly interesting to hear, but they are easy to&#10;plot geometrically.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/signals_vectors"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/vector_addition"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Vector Addition</title><link>https://technick.net/guides/theory/dft/vector_addition/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/vector_addition/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/example_vector_view"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/vector_subtraction"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00730000000000000000"&gt;Vector Addition&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;Given two vectors in &lt;img width="30" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img695.png" alt="${\" al="" /&gt;, say &lt;!-- MATH&#10; $\underline{x}= (x_0,x_1,\ldots,x_{N-1})$&#10; --&gt;&lt;img width="159" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img696.png" alt="$\" nderline="" x="" ldots="" n-1="" /&gt; &#10;and &lt;!-- MATH&#10; $\underline{y}= (y_0,y_1,\ldots,y_{N-1})$&#10; --&gt;&lt;img width="154" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img697.png" alt="$\" nderline="" y="" ldots="" n-1="" /&gt;, the &lt;i&gt;vector sum&lt;/i&gt; is defined by&lt;i&gt;elementwise&lt;/i&gt; addition. If we denote the sum by &lt;img width="74" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img698.png" alt="$w\" sdef="" /&gt;,&#10;then we have &lt;!-- MATH&#10; $w(n) = x(n)+y(n)$&#10; --&gt;&lt;img width="140" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img699.png" alt="$w(n) = x(n)+y(n)$" /&gt; for &lt;!-- MATH&#10; $n=0,1,2,\ldots,N-1$&#10; --&gt;&lt;img width="150" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img677.png" alt="$n=0,1,2,\" dots="" /&gt;.&lt;/p&gt;&lt;p&gt;The vector diagram for the sum of two vectors can be found using the&#10;parallelogram rule, as shown in Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/vector_addition#fig:vecsum"&gt;6.2&lt;/a&gt; for &lt;img width="48" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img19.png" alt="$N=2$" /&gt;, &lt;img width="70" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img18.png" alt="$x=(2, 3)$" /&gt;, and&lt;img width="69" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img700.png" alt="$y=(4,1)$" /&gt;. &lt;/p&gt;&lt;p&gt; &lt;div align="CENTER"&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:vecsum"&gt;&lt;/a&gt;&lt;a name="8722"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure 6.2:&lt;/strong&gt;Geometric interpretation of&#10;a length 2 vector sum.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; $\scalebox{0.5}{\includegraphics{eps/vecsum.eps}}$&#10; --&gt;&lt;img width="220" height="115" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img701.png" alt="\" calebox="" ncludegraphics="" ps="" ecsum="" ps="" /&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;&lt;p&gt;Also shown are the lighter construction lines which complete the&#10;parallelogram started by &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; and &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img13.png" alt="$y$" /&gt;, indicating where the endpoint of the&#10;sum &lt;img width="41" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img702.png" alt="$x+y$" /&gt; lies. Since it is a parallelogram, the two construction lines&#10;are congruent to the vectors &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; and &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img13.png" alt="$y$" /&gt;. As a result, the vector sum is&#10;often expressed as a &lt;i&gt;triangle&lt;/i&gt; by translating the origin of one member&#10;of the sum to the tip of the other, as shown in Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/vector_addition#fig:vecsumr"&gt;6.3&lt;/a&gt;.&lt;/p&gt;&lt;p&gt; &lt;div align="CENTER"&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:vecsumr"&gt;&lt;/a&gt;&lt;a name="8731"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure 6.3:&lt;/strong&gt;Vector sum with translation of&#10;one vector to the tip of the other.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; $\scalebox{0.5}{\includegraphics{eps/vecsumr.eps}}$&#10; --&gt;&lt;img width="232" height="115" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img703.png" alt="\" calebox="" ncludegraphics="" ps="" ecsumr="" ps="" /&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;&lt;p&gt;In the figure, &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; was translated to the tip of &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img13.png" alt="$y$" /&gt;. It is equally valid&#10;to translate &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img13.png" alt="$y$" /&gt; to the tip of &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt;, because &lt;a href="https://technick.net/guides/theory/dft/vector_addition"&gt;vector addition&lt;/a&gt; is &lt;i&gt;commutative&lt;/i&gt;, i.e., &lt;img width="41" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img702.png" alt="$x+y$" /&gt; = &lt;img width="41" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img704.png" alt="$y+x$" /&gt;.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/example_vector_view"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/vector_subtraction"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Vector Subtraction</title><link>https://technick.net/guides/theory/dft/vector_subtraction/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/vector_subtraction/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/vector_addition"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/signal_metrics"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00740000000000000000"&gt;Vector Subtraction&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;Figure&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/signal_metrics#fig:vecdist"&gt;6.7&lt;/a&gt; illustrates the vector difference &lt;img width="74" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img705.png" alt="$w=x-y$" /&gt; between&lt;img width="70" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img18.png" alt="$x=(2, 3)$" /&gt; and &lt;img width="69" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img700.png" alt="$y=(4,1)$" /&gt;. From the coordinates, we compute&#10;&lt;!-- MATH&#10; $w = x-y = (-2, 2)$&#10; --&gt;&lt;img width="143" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img706.png" alt="$w = x-y = (-2, 2)$" /&gt;.&lt;/p&gt;&lt;p&gt; &lt;div align="CENTER"&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:vecsub"&gt;&lt;/a&gt;&lt;a name="8740"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure 6.4:&lt;/strong&gt;Geometric interpretation a&#10;difference vector.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; $\scalebox{0.5}{\includegraphics{eps/vecsub.eps}}$&#10; --&gt;&lt;img width="216" height="115" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img707.png" alt="\" calebox="" ncludegraphics="" ps="" ecsub="" ps="" /&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;&lt;p&gt;Note that the difference vector &lt;img width="16" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img708.png" alt="$w$" /&gt; may be drawn from the tip of &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img13.png" alt="$y$" /&gt; to the&#10;tip of &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; rather than from the origin to the point &lt;img width="52" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img709.png" alt="$(-2,2)$" /&gt;; this is a&#10;customary practice which emphasizes relationships among vectors, but the&#10;translation in the plot has no effect on the mathematical definition or&#10;properties of the vector. Subtraction, however, is not commutative.&lt;/p&gt;&lt;p&gt;To ascertain the proper orientation of the difference vector &lt;img width="74" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img705.png" alt="$w=x-y$" /&gt;,&#10;rewrite its definition as &lt;img width="74" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img710.png" alt="$x=y+w$" /&gt;, and then it is clear that the vector &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt;should be the sum of vectors &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img13.png" alt="$y$" /&gt; and &lt;img width="16" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img708.png" alt="$w$" /&gt;, hence the arrowhead is on the&#10;correct endpoint.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/vector_addition"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/signal_metrics"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Signal Metrics</title><link>https://technick.net/guides/theory/dft/signal_metrics/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/signal_metrics/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/vector_subtraction"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/other_norms"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00750000000000000000"&gt;Signal Metrics&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;This section defines some useful functions of signals.&lt;/p&gt;&lt;p&gt;The &lt;i&gt;mean&lt;/i&gt; of a signal &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; (more precisely the ''sample mean'') is&#10;defined as its &lt;i&gt;average value&lt;/i&gt;:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\mu_x \isdef \frac{1}{N}\sum_{n=0}^{N-1}x_n \qquad \mbox{(mean of $x$)}&#10;\end{displaymath}&#10; --&gt;&lt;img width="243" height="62" border="0" src="https://technick.net/img/guide_dft/img711.png" alt="\" egin="" isplaymath="" u="" isdef="" rac="" sum="" n-1="" x="" n="" quad="" box="" ean="" x="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;The &lt;i&gt;total energy&lt;/i&gt; of a signal &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; is defined the &lt;i&gt;sum of squared&lt;a href="http://www.treasure-troves.com/physics/moduli.php"&gt;moduli&lt;/a&gt;&lt;/i&gt;:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;{\cal E}_x \isdef \sum_{n=0}^{N-1}\left|x_n\right|^2 \qquad \mbox{(energy of $x$)}&#10;\end{displaymath}&#10; --&gt;&lt;img width="248" height="62" border="0" src="https://technick.net/img/guide_dft/img712.png" alt="\" egin="" isplaymath="" al="" isdef="" um="" n-1="" left\vert="" n\right\vert="" quad="" box="" nergy="" x="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;Energy is the ''ability to do work.'' In physics, energy and work are in&#10;units of ''force times distance,'' ''mass times velocity squared,'' or&#10;other equivalent combinations of units. The energy of a &lt;i&gt;&lt;a href="http://www.treasure-troves.com/physics/pressurewave.php"&gt;pressure&#10;wave&lt;/a&gt;&lt;/i&gt; is the integral over time of the squared pressure divided by the wave&#10;impedance the wave is traveling in. The energy of a &lt;i&gt;velocity wave&lt;/i&gt; is&#10;the integral over time of the squared velocity times the wave impedance.&#10;In audio work, a signal &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; is typically a list of &lt;i&gt;pressure samples&lt;/i&gt;derived from a microphone signal, or it might be samples of &lt;i&gt;force&lt;/i&gt;from a piezoelectric transducer, &lt;i&gt;velocity&lt;/i&gt; from a magnetic guitarpickup, and so on. In all of these cases, the total physical energy&#10;associated with the signal is proportional to the sum of squared signal&#10;samples. (Physical connections in signal processing are explored more&#10;deeply in Music&#10;421.)&lt;/p&gt;&lt;p&gt;The &lt;i&gt;average power&lt;/i&gt; of a signal &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; is defined the &lt;i&gt;energy&#10;per sample&lt;/i&gt;:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;{\cal P}_x \isdef \frac{{\cal E}_x}{N} = \frac{1}{N} \sum_{n=0}^{N-1}\left|x_n\right|^2 \qquad &#10;&#9;\mbox{(average power of $x$)}&#10;\end{displaymath}&#10; --&gt;&lt;img width="378" height="62" border="0" src="https://technick.net/img/guide_dft/img713.png" alt="\" egin="" isplaymath="" al="" isdef="" rac="" al="" n="" rac="" sum="" t\vert="" right\vert="" quad="" box="" verage="" wer="" x="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Another common description when &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; is real is the ''mean square.''&#10;When &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; is a complex &lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;sinusoid&lt;/a&gt;, i.e., &lt;!-- MATH&#10; $x(n) = A\exp(j\omega nT + \phi)$&#10; --&gt;&lt;img width="176" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img714.png" alt="$x(n) = A\" xp="" omega="" phi="" /&gt;,&#10;then &lt;!-- MATH&#10; ${\cal P}_x = A^2$&#10; --&gt;&lt;img width="63" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img715.png" alt="${\" al="" a="" /&gt;; in other words, for complex sinusoids, the average&#10;power equals the &lt;i&gt;instantaneous power&lt;/i&gt; which is the &lt;a href="https://technick.net/guides/theory/dft/logarithms"&gt;amplitude&lt;/a&gt; squared.&lt;p&gt;Power is always in physical units of energy per unit time. It therefore&#10;makes sense to define the average &lt;a href="https://technick.net/guides/theory/dft/signal_metrics"&gt;signal power&lt;/a&gt; as the total &lt;a href="https://technick.net/guides/theory/dft/signal_metrics"&gt;signal energy&lt;/a&gt;divided by its length. We normally work with signals which are functions&#10;of time. However, if the signal happens instead to be a function of&#10;distance (e.g., samples of displacement along a vibrating string), then the&#10;''power'' as defined here still has the interpretation of a &lt;i&gt;spatial&#10;energy density&lt;/i&gt;. Power, in contrast, is a temporal energy density.&lt;/p&gt;&lt;p&gt;The &lt;i&gt;root mean square&lt;/i&gt; (RMS) level of a signal &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; is simply&#10;&lt;!-- MATH&#10; $\sqrt{{\cal P}_x}$&#10; --&gt;&lt;img width="36" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img716.png" alt="$\" qrt="" al="" /&gt;. However, note that in practice (especially in audio&#10;work) an RMS level may be computed after subtracting out the mean value.&#10;Here, we call that the &lt;i&gt;variance&lt;/i&gt;.&lt;/p&gt;&lt;p&gt;The &lt;i&gt;variance&lt;/i&gt; (more precisely the &lt;i&gt;sample variance&lt;/i&gt;) of the signal&lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; is defined as the power of the signal with its sample mean removed:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\sigma_x^2 \isdef \frac{1}{N}\sum_{n=0}^{N-1}\left|x_n - \mu_x\right|^2 \qquad\mbox{(variance of $x$)}&#10;\end{displaymath}&#10; --&gt;&lt;img width="326" height="62" border="0" src="https://technick.net/img/guide_dft/img717.png" alt="\" egin="" isplaymath="" igma="" isdef="" rac="" sum="" n-1="" left\vert="" n="" u="" right\vert="" quad\mbox="" ariance="" x="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;It is quick to show that, for real signals, we have&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\sigma_x^2 = {\cal P}_x - \mu_x^2&#10;\end{displaymath}&#10; --&gt;&lt;img width="103" height="31" border="0" src="https://technick.net/img/guide_dft/img718.png" alt="\" egin="" isplaymath="" igma="" cal="" mu="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;which is the ''mean square minus the mean squared.'' We think of the&#10;variance as the power of the non-constant signal components (i.e.,&#10;everything but dc). The terms ''sample mean'' and ''sample variance'' come&#10;from the field of &lt;i&gt;statistics&lt;/i&gt;, particularly the theory of &lt;i&gt;stochastic processes&lt;/i&gt;. The field of &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/appendix_b_introductory"&gt;statistical signal processing&lt;/a&gt;&lt;/i&gt;[&lt;a href="https://technick.net/guides/theory/dft/bibliography#Sharf91"&gt;16&lt;/a&gt;] is firmly rooted in statistical topics such as&#10;''probability,'' ''random variables,'' ''stochastic processes,'' and ''time&#10;series analysis.'' In this course, we will only touch lightly on a few&#10;elements of statistical signal processing in a self-contained way.&lt;p&gt;&lt;/p&gt;&lt;p&gt;The &lt;i&gt;norm&lt;/i&gt; of a signal &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; is defined as the square root of its total energy:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\|x\| \isdef \sqrt{{\cal E}_x} = \sqrt{\sum_{n=0}^{N-1}\left|x_n\right|^2} \qquad \mbox{(norm of $x$)}&#10;\end{displaymath}&#10; --&gt;&lt;img width="321" height="71" border="0" src="https://technick.net/img/guide_dft/img719.png" alt="\" egin="" isplaymath="" ert="" ert="" sdef="" qrt="" al="" sqrt="" um="" n-1="" left\vert="" n\right\vert="" quad="" box="" orm="" x="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;We think of &lt;img width="29" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img720.png" alt="$\" ert="" ert="" /&gt; as the &lt;i&gt;length&lt;/i&gt; of &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; in &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt;-space.&#10;Furthermore, &lt;img width="57" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img721.png" alt="$\" ert="" vert="" /&gt; is regarded as the &lt;i&gt;distance&lt;/i&gt; between&lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; and &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img13.png" alt="$y$" /&gt;. The norm can also be thought of as the ''absolute value'' or&#10;''radius'' of a vector.&lt;a name="tex2html70" href="https://technick.net/guides/theory/dft/footnode#foot8637"&gt;&lt;sup&gt;6.2&lt;/sup&gt;&lt;/a&gt;&lt;p&gt;&lt;b&gt;Example:&lt;/b&gt; Going back to our simple 2D example &lt;img width="66" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img723.png" alt="$x=[2, 3]$" /&gt;,&#10;we can compute its norm as &lt;!-- MATH&#10; $\|x\| = \sqrt{2^2 + 3^2} = \sqrt{13}$&#10; --&gt;&lt;img width="164" height="36" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img724.png" alt="$\" ert="" ert="\sqrt{2^2" sqrt="" /&gt;.&#10;The physical interpretation of the norm as a distance measure&#10;is shown in Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/signal_metrics#fig:vec2dlen"&gt;6.5&lt;/a&gt;.&lt;/p&gt;&lt;p&gt; &lt;div align="CENTER"&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:vec2dlen"&gt;&lt;/a&gt;&lt;a name="8770"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure 6.5:&lt;/strong&gt;Geometric interpretation of a&#10;signal norm in 2D.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; $\scalebox{0.5}{\includegraphics{eps/vec2dlen.eps}}$&#10; --&gt;&lt;img width="187" height="112" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img725.png" alt="\" calebox="" ncludegraphics="" ps="" ec2dlen="" ps="" /&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;&lt;p&gt;&lt;b&gt;Example:&lt;/b&gt; Let's also look again at the vector-sum example, redrawn&#10;in Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/signal_metrics#fig:vecsumdist"&gt;6.6&lt;/a&gt;.&lt;/p&gt;&lt;p&gt; &lt;div align="CENTER"&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:vecsumdist"&gt;&lt;/a&gt;&lt;a name="8779"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure 6.6:&lt;/strong&gt;Length of vectors in sum.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; $\scalebox{0.5}{\includegraphics{eps/vecsumdist.eps}}$&#10; --&gt;&lt;img width="264" height="115" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img726.png" alt="\" calebox="" ncludegraphics="" ps="" ecsumdist="" ps="" /&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;&lt;p&gt;The norm of the vector sum &lt;img width="74" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img727.png" alt="$w=x+y$" /&gt; is&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\|w\| \isdef \|x+y\| \isdef \|(2, 3) + (4, 1)\|&#10;= \|(6, 4)\| = \sqrt{6^2 + 4^2} = \sqrt{52} = 2\sqrt{13}&#10;\end{displaymath}&#10; --&gt;&lt;img width="548" height="31" border="0" src="https://technick.net/img/guide_dft/img728.png" alt="\" egin="" isplaymath="" ert="" ert="" sdef="" ert="" vert="" sdef="" ert="" ert="" ert="\sqrt{6^2" sqrt="" qrt="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;while the norms of &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; and &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img13.png" alt="$y$" /&gt; are &lt;img width="33" height="36" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img729.png" alt="$\" qrt="" /&gt; and &lt;img width="33" height="36" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img730.png" alt="$\" qrt="" /&gt;,&#10;respectively. We find that &lt;!-- MATH&#10; $\|x+y\|&lt;\|x\|+\|y\|$&#10; --&gt;&lt;img width="147" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img731.png" alt="$\" ert="" vert="" t="" ert="" ert="" ert="" ert="" /&gt;which is an example of the &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/triangle_inequality"&gt;triangle inequality&lt;/a&gt;&lt;/i&gt;. (Equality occurs&#10;only when &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; and &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img13.png" alt="$y$" /&gt; are colinear, as can be seen geometrically from&#10;studying&#10;Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/signal_metrics#fig:vecsumdist"&gt;6.6&lt;/a&gt;.)&lt;p&gt;&lt;b&gt;Example:&lt;/b&gt; Consider the vector-difference example diagrammed in&#10;Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/signal_metrics#fig:vecdist"&gt;6.7&lt;/a&gt;. &lt;/p&gt;&lt;p&gt; &lt;div align="CENTER"&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:vecdist"&gt;&lt;/a&gt;&lt;a name="8788"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure 6.7:&lt;/strong&gt;Length of a difference vector.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; $\scalebox{0.5}{\includegraphics{eps/vecdist.eps}}$&#10; --&gt;&lt;img width="182" height="112" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img732.png" alt="\" calebox="" ncludegraphics="" ps="" ecdist="" ps="" /&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;&lt;p&gt;The norm of the difference vector &lt;img width="74" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img705.png" alt="$w=x-y$" /&gt; is&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\|w\| \isdef \|x-y\| \isdef \|(2, 3) - (4, 1)\|&#10;= \|(-2, 2)\| = \sqrt{(-2)^2 + (2)^2} = 2\sqrt{2}&#10;\end{displaymath}&#10; --&gt;&lt;img width="538" height="31" border="0" src="https://technick.net/img/guide_dft/img733.png" alt="\" egin="" isplaymath="" ert="" ert="" sdef="" ert="" vert="" sdef="" ert="" ert="\Vert(-2," vert="\sqrt{(-2)^2" sqrt="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;hr /&gt;&lt;!--Table of Child-Links--&gt;&lt;a name="CHILD_LINKS"&gt;&lt;strong&gt;Subsections&lt;/strong&gt;&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html1616" href="https://technick.net/guides/theory/dft/other_norms"&gt;Other Norms&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;!--End of Table of Child-Links--&gt;&#10;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/vector_subtraction"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/other_norms"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Other Norms</title><link>https://technick.net/guides/theory/dft/other_norms/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/other_norms/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/signal_metrics"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/inner_product"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00751000000000000000"&gt;Other Norms&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;Since our main norm is the square root of a sum of squares, we are using&#10;what is called an &lt;i&gt;&lt;img width="22" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img734.png" alt="$L_2$" /&gt; norm&lt;/i&gt; and we may write &lt;img width="36" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img735.png" alt="$\" ert="" ert="" /&gt; to&#10;emphasize this fact.&lt;/p&gt;&lt;p&gt;We could equally well have chosen a &lt;i&gt;normalized &lt;img width="22" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img734.png" alt="$L_2$" /&gt; norm&lt;/i&gt;:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\|x\|_{\tilde 2} \isdef \sqrt{{\cal P}_x} = \sqrt{\frac{1}{N}\sum_{n=0}^{N-1}&#10;\left|x_n\right|^2} \qquad \mbox{(normalized $L_2$\ norm of $x$)}&#10;\end{displaymath}&#10; --&gt;&lt;img width="471" height="71" border="0" src="https://technick.net/img/guide_dft/img736.png" alt="\" egin="" isplaymath="" ert="" ert="" ilde="" sdef="" qrt="" al="" sqrt="" n\right\vert="" quad="" box="" ormalized="" norm="" x="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;which is simply the ''RMS level'' of &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt;.&lt;p&gt;More generally, the &lt;i&gt;&lt;img width="22" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img737.png" alt="$L_p$" /&gt; norm&lt;/i&gt; of &lt;!-- MATH&#10; $x \in {\cal C}^N$&#10; --&gt;&lt;img width="54" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img687.png" alt="$x\" n="" al="" /&gt; is defined&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\|x\|_p \isdef \left(\sum_{n=0}^{N-1}\left|x_n\right|^p\right)^{1/p}&#10;\end{displaymath}&#10; --&gt;&lt;img width="178" height="67" border="0" src="https://technick.net/img/guide_dft/img738.png" alt="\" egin="" isplaymath="" ert="" ert="" p="" sdef="" eft="" um="" n-1="" left\vert="" n\right\vert="" right="" p="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;The most interesting &lt;img width="22" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img737.png" alt="$L_p$" /&gt; norms are&lt;ul&gt;&lt;li&gt;&lt;img width="41" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img739.png" alt="$p=1$" /&gt;: The &lt;img width="22" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img740.png" alt="$L_1$" /&gt;, ''absolute value,'' or ''city block'' norm.&lt;/li&gt;&lt;li&gt;&lt;img width="41" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img741.png" alt="$p=2$" /&gt;: The &lt;img width="22" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img734.png" alt="$L_2$" /&gt;, ''Euclidean,'' ''root energy,'' or ''least squares'' norm.&lt;/li&gt;&lt;li&gt;&lt;img width="49" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img742.png" alt="$p=\" nfty="" /&gt;: The &lt;img width="28" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img743.png" alt="$L_\" nfty="" /&gt;, ''Chebyshev,'' ''supremum,'' ''minimax,'' &#10;&#9;or ''uniform'' norm.&lt;/li&gt;&lt;/ul&gt;Note that the case &lt;img width="49" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img742.png" alt="$p=\" nfty="" /&gt; is a limiting case which becomes&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\|x\|_\infty = \max_{0\leq n &lt; N} \left|x_n\right|&#10;\end{displaymath}&#10; --&gt;&lt;img width="145" height="42" border="0" src="https://technick.net/img/guide_dft/img744.png" alt="\" egin="" isplaymath="" ert="" ert="" nfty="\max_{0\leq" n="" t="" left\vert="" right\vert="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;There are many other possible choices of norm. To qualify as a norm on&lt;img width="26" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img745.png" alt="${\" al="" /&gt;, a real-valued signal function &lt;!-- MATH&#10; $f(\underline{x})$&#10; --&gt;&lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img746.png" alt="$f(\" nderline="" /&gt; must satisfy the following&#10;three properties:&lt;ol&gt;&lt;li&gt;&lt;!-- MATH&#10; $f(\underline{x})=\underline{0}\Leftrightarrow \underline{x}=0$&#10; --&gt;&lt;img width="127" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img747.png" alt="$f(\" nderline="" underline="" eftrightarrow="" nderline="" /&gt;&lt;/li&gt;&lt;li&gt;&lt;!-- MATH&#10; $f(\underline{x}+\underline{y})\leq f(\underline{x})+f(\underline{y})$&#10; --&gt;&lt;img width="165" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img748.png" alt="$f(\" nderline="" underline="" leq="" nderline="" f="" nderline="" /&gt;&lt;/li&gt;&lt;li&gt;&lt;!-- MATH&#10; $f(c\underline{x}) = \left|c\right| f(\underline{x})$&#10; --&gt;&lt;img width="113" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img749.png" alt="$f(c\" nderline="" left\vert="" ight\vert="" nderline="" /&gt;, &lt;!-- MATH&#10; $\forall c\in{\cal C}$&#10; --&gt;&lt;img width="49" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img750.png" alt="$\" orall="" n="" al="" /&gt;&lt;/li&gt;&lt;/ol&gt;The first property, ''positivity,'' says only the zero vector has norm&#10;zero. The second property is ''subadditivity'' and is sometimes called the&#10;''&lt;a href="https://technick.net/guides/theory/dft/triangle_inequality"&gt;triangle inequality&lt;/a&gt;'' for reasons which can be seen by studying&#10;Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/vector_addition#fig:vecsumr"&gt;6.3&lt;/a&gt;. The third property says the norm is&#10;''absolutely homogeneous'' with respect to scalar multiplication (which can&#10;be complex, in which case the phase of the scalar has no effect).&lt;/p&gt;&lt;p&gt;Mathematically, what we are working with so far is called a &lt;i&gt;Banach&#10;space&lt;/i&gt; which a &lt;i&gt;normed linear vector space&lt;/i&gt;. To summarize, we defined&#10;our vectors as any list of &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; real or &lt;a href="https://technick.net/guides/theory/dft/introduction_complex_number"&gt;complex numbers&lt;/a&gt; which we interpret&#10;as coordinates in the &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt;-dimensional vector space. We also defined &lt;a href="https://technick.net/guides/theory/dft/vector_addition"&gt;vector&#10;addition&lt;/a&gt; in the obvious way. It turns out we have to also define &lt;i&gt;scalar multiplication&lt;/i&gt;, that is, multiplication of a vector by a scalar&#10;which we also take to be an element of the field of real or complex&#10;numbers. This is also done in the obvious way which is to multiply each&#10;coordinate of the vector by the scalar. To have a linear vector space, it&#10;must be &lt;i&gt;closed&lt;/i&gt; under vector addition and scalar multiplication. That&#10;means given any two vectors &lt;!-- MATH&#10; $\underline{x}\in{\cal C}^N$&#10; --&gt;&lt;img width="54" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img751.png" alt="$\" nderline="" in="" al="" /&gt; and &lt;!-- MATH&#10; $\underline{y}\in{\cal C}^N$&#10; --&gt;&lt;img width="53" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img752.png" alt="$\" nderline="" in="" al="" /&gt; from the&#10;vector space, and given any two scalars &lt;!-- MATH&#10; $c_1\in{\cal C}$&#10; --&gt;&lt;img width="47" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img753.png" alt="$c_1\" n="" al="" /&gt; and &lt;!-- MATH&#10; $c_2\in{\cal C}$&#10; --&gt;&lt;img width="47" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img754.png" alt="$c_2\" n="" al="" /&gt;from the field of scalars, then any &lt;i&gt;linear combination&lt;/i&gt; &lt;!-- MATH&#10; $c_1 \underline{x}+&#10;c_2\underline{y}$&#10; --&gt;&lt;img width="69" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img755.png" alt="$c_1 \" nderline="" c="" nderline="" /&gt; must also be in the space. Since we have used the field of complex&#10;numbers &lt;img width="13" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img756.png" alt="${\" al="" /&gt; (or real numbers &lt;img width="18" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img757.png" alt="${\" al="" /&gt;) to define both our scalars and&#10;our vector components, we have the necessary closure properties so that any&#10;linear combination of vectors from &lt;img width="26" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img745.png" alt="${\" al="" /&gt; lies in &lt;img width="26" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img745.png" alt="${\" al="" /&gt;. Finally, the&#10;definition of a norm (any norm) elevates a vector space to a Banach space.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/signal_metrics"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/inner_product"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>The Inner Product</title><link>https://technick.net/guides/theory/dft/inner_product/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/inner_product/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/other_norms"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/linearity_inner_product"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00760000000000000000"&gt;The Inner Product&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;The &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/inner_product"&gt;inner product&lt;/a&gt;&lt;/i&gt; (or ''dot product'') is an operation on two vectors&#10;which produces a scalar. Adding an inner product to a Banach space produces&#10;a &lt;i&gt;Hilbert space&lt;/i&gt; (or ''inner product space''). There are many&#10;examples of Hilbert spaces, but we will only need &lt;!-- MATH&#10; $\{{\cal C}^N,{\cal C}\}$&#10; --&gt;&lt;img width="58" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img758.png" alt="$\" cal="" cal="" /&gt; for this&#10;course (complex length &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; vectors with complex scalars).&lt;/p&gt;&lt;p&gt;The &lt;i&gt;inner product&lt;/i&gt; between two (complex) &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt;-vectors &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; and &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img13.png" alt="$y$" /&gt;is defined by&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\left&lt;x,y\right&gt; \isdef \sum_{n=0}^{N-1}x(n)\overline{y(n)}&#10;\end{displaymath}&#10; --&gt;&lt;img width="164" height="62" border="0" src="https://technick.net/img/guide_dft/img68.png" alt="\" egin="" isplaymath="" eft="" t="" y\right="" t="" sdef="" um="" n-1="" x="" n="" overline="" n="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;The complex conjugation of the second vector is done in order that a &lt;i&gt;norm&lt;/i&gt; will be &lt;i&gt;induced&lt;/i&gt; by the inner product:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\left&lt;x,x\right&gt; = \sum_{n=0}^{N-1}x(n)\overline{x(n)} &#10;&#9;= \sum_{n=0}^{N-1}\left|x(n)\right|^2 \isdef {\cal E}_x = \|x\|^2&#10;\end{displaymath}&#10; --&gt;&lt;img width="374" height="62" border="0" src="https://technick.net/img/guide_dft/img759.png" alt="\" egin="" isplaymath="" eft="" t="" x\right="" t="" um="" n-1="" x="" n="" overline="" x="" n="" left\vert="" right\vert="" sdef="" al="" vert="" vert="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;As a result, the inner product is &lt;i&gt;conjugate symmetric&lt;/i&gt;:&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\left&lt;y,x\right&gt; = \overline{\left&lt;x,y\right&gt;}&#10;\end{displaymath}&#10; --&gt;&lt;img width="104" height="31" border="0" src="https://technick.net/img/guide_dft/img760.png" alt="\" egin="" isplaymath="" eft="" t="" x\right="" t="" verline="" eft="" t="" y\right="" t="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;Note that the inner product takes &lt;!-- MATH&#10; ${\cal C}^N\times{\cal C}^N$&#10; --&gt;&lt;img width="66" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img761.png" alt="${\" al="" times="" al="" /&gt; to &lt;img width="13" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img756.png" alt="${\" al="" /&gt;. That&#10;is, two length &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; complex vectors are mapped to a complex scalar.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Example:&lt;/b&gt;For &lt;img width="48" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img389.png" alt="$N=3$" /&gt; we have, in general,&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\left&lt;x,y\right&gt; = x_0 \overline{y_0} + x_1 \overline{y_1} + x_2 \overline{y_2}&#10;\end{displaymath}&#10; --&gt;&lt;img width="210" height="31" border="0" src="https://technick.net/img/guide_dft/img762.png" alt="\" egin="" isplaymath="" eft="" t="" y\right="" t="" overline="" x="" verline="" x="" verline="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Let &lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;x &amp;=&amp; [0,j,1] \\&#10;y &amp;=&amp; [1,j,j]&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="107" height="57" border="0" src="https://technick.net/img/guide_dft/img763.png" alt="\" egin="" qnarray="" j="" j="" end="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Then&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\left&lt;x,y\right&gt; = 0\cdot 1 + j \cdot (-j) + 1 \cdot (-j) = 0 + 1 + (-j) = 1-j&#10;\end{displaymath}&#10; --&gt;&lt;img width="430" height="31" border="0" src="https://technick.net/img/guide_dft/img764.png" alt="\" egin="" isplaymath="" eft="" t="" y\right="" t="" dot="" cdot="" cdot="" j="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;hr /&gt;&lt;!--Table of Child-Links--&gt;&lt;a name="CHILD_LINKS"&gt;&lt;strong&gt;Subsections&lt;/strong&gt;&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html1639" href="https://technick.net/guides/theory/dft/linearity_inner_product"&gt;Linearity of the Inner Product&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1640" href="https://technick.net/guides/theory/dft/norm_induced_inner"&gt;Norm Induced by the Inner Product&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1641" href="https://technick.net/guides/theory/dft/cauchy_schwarz_inequality"&gt;Cauchy-Schwarz Inequality&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1642" href="https://technick.net/guides/theory/dft/triangle_inequality"&gt;Triangle Inequality&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1643" href="https://technick.net/guides/theory/dft/triangle_difference_inequal"&gt;Triangle Difference Inequality&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1644" href="https://technick.net/guides/theory/dft/vector_cosine"&gt;Vector Cosine&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1645" href="https://technick.net/guides/theory/dft/orthogonality"&gt;Orthogonality&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1646" href="https://technick.net/guides/theory/dft/pythagorean_theorem_n_space"&gt;The Pythagorean Theorem in N-Space&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1647" href="https://technick.net/guides/theory/dft/projection"&gt;Projection&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;!--End of Table of Child-Links--&gt;&#10;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/other_norms"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/linearity_inner_product"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Linearity of the Inner Product</title><link>https://technick.net/guides/theory/dft/linearity_inner_product/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/linearity_inner_product/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/inner_product"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/norm_induced_inner"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00761000000000000000"&gt;Linearity of the Inner Product&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;Any function &lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img236.png" alt="$f(x)$" /&gt; of a vector &lt;!-- MATH&#10; $x\in{\cal C}^N$&#10; --&gt;&lt;img width="54" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img687.png" alt="$x\" n="" al="" /&gt; (which we may call an &lt;i&gt;operator&lt;/i&gt; on &lt;img width="26" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img745.png" alt="${\" al="" /&gt;) is said to be &lt;i&gt;linear&lt;/i&gt; if for all &lt;!-- MATH&#10; $x_1\in{\cal C}^N$&#10; --&gt;&lt;img width="61" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img765.png" alt="$x_1\" n="" al="" /&gt; and&#10;&lt;!-- MATH&#10; $x_2\in{\cal C}^N$&#10; --&gt;&lt;img width="61" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img766.png" alt="$x_2\" n="" al="" /&gt;, and for all scalars &lt;img width="18" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img767.png" alt="$c_1$" /&gt; and &lt;img width="18" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img768.png" alt="$c_2$" /&gt; in &lt;img width="13" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img756.png" alt="${\" al="" /&gt;, we have&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;f(c_1 x_1 + c_2 x_2) = c_1 f(x_1) + c_2 f(x_2)&#10;\end{displaymath}&#10; --&gt;&lt;img width="271" height="31" border="0" src="https://technick.net/img/guide_dft/img769.png" alt="\" egin="" isplaymath="" c="" c="" c="" x="" f="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;A linear operator thus ''commutes with mixing.'' &lt;p&gt;Linearity consists of two component properties, &lt;ul&gt;&lt;li&gt;&lt;i&gt;additivity&lt;/i&gt;: &lt;!-- MATH&#10; $f(x_1+x_2) = f(x_1) + f(x_2)$&#10; --&gt;&lt;img width="195" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img770.png" alt="$f(x_1+x_2) = f(x_1) + f(x_2)$" /&gt;, and &lt;/li&gt;&lt;li&gt;&lt;i&gt;homogeneity&lt;/i&gt;: &lt;!-- MATH&#10; $f(c_1 x_1) = c_1 f(x_1)$&#10; --&gt;&lt;img width="130" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img771.png" alt="$f(c_1 x_1) = c_1 f(x_1)$" /&gt;.&lt;/li&gt;&lt;/ul&gt;&lt;/p&gt;&lt;p&gt;The &lt;a href="https://technick.net/guides/theory/dft/inner_product"&gt;inner product&lt;/a&gt; &lt;!-- MATH&#10; $\left&lt;x,y\right&gt;$&#10; --&gt;&lt;img width="41" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img772.png" alt="$\" eft="" t="" y\right="" t="" /&gt; is &lt;i&gt;linear&lt;/i&gt; in its first argument, i.e.&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\left&lt;c_1 x_1 + c_2 x_2,y\right&gt; = c_1 \left&lt;x_1,y\right&gt; + c_2 \left&lt;x_2,y\right&gt;&#10;\end{displaymath}&#10; --&gt;&lt;img width="295" height="31" border="0" src="https://technick.net/img/guide_dft/img773.png" alt="\" egin="" isplaymath="" eft="" t="" x="" x="" right="" t="" left="" t="" y\right="" t="" left="" t="" y\right="" t="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;This is easy to show from the definition:&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;\left&lt;c_1 x_1 + c_2 x_2,y\right&gt; &amp;\isdef &amp; \sum_{n=0}^{N-1}\left[c_1 x_1(n) + c_2 x_2(n)\right]\overline{y(n)} \\&#10;&amp;=&amp; \sum_{n=0}^{N-1}c_1 x_1(n)\overline{y(n)} + \sum_{n=0}^{N-1}c_2 x_2(n)\overline{y(n)} \\&#10;&amp;=&amp; c_1 \sum_{n=0}^{N-1}x_1(n)\overline{y(n)} + c_2 \sum_{n=0}^{N-1}x_2(n)\overline{y(n)} \\&#10;&amp;\isdef &amp; c_1 \left&lt;x_1,y\right&gt; + c_2 \left&lt;x_2,y\right&gt;&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="444" height="214" border="0" src="https://technick.net/img/guide_dft/img774.png" alt="\" egin="" qnarray="" eft="" t="" x="" x="" right="" t="" sdef="" um="" n-1="" le="" isdef="" left="" t="" y\right="" t="" left="" t="" y\right="" t="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;The inner product is also &lt;i&gt;additive&lt;/i&gt; in its second argument, i.e.,&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\left&lt;x,y_1 + y_2\right&gt; = \left&lt;x,y_1\right&gt; + \left&lt;x,y_2\right&gt;&#10;\end{displaymath}&#10; --&gt;&lt;img width="224" height="31" border="0" src="https://technick.net/img/guide_dft/img775.png" alt="\" egin="" isplaymath="" eft="" t="" y="" right="" t="" eft="" t="" y="" ight="" t="" eft="" t="" y="" ight="" t="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;but it is only &lt;i&gt;conjugate homogeneous&lt;/i&gt; in its second argument,&#10;since&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\left&lt;x,c_1 y_1\right&gt; = \overline{c_1} \left&lt;x,y_1\right&gt; \neq c_1 \left&lt;x,y_1\right&gt;&#10;\end{displaymath}&#10; --&gt;&lt;img width="241" height="31" border="0" src="https://technick.net/img/guide_dft/img776.png" alt="\" egin="" isplaymath="" eft="" t="" c="" right="" t="" verline="" left="" t="" y="" ight="" t="" eq="" eft="" t="" y="" ight="" t="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;The inner product &lt;i&gt;is&lt;/i&gt; strictly linear in its second argument with&#10;respect to &lt;i&gt;real&lt;/i&gt; scalars:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\left&lt;x,r_1 y_1 + r_2 y_2\right&gt; = r_1 \left&lt;x,y_1\right&gt; + r_2 \left&lt;x,y_2\right&gt;, \quad r_i\in{\cal R}&#10;\end{displaymath}&#10; --&gt;&lt;img width="373" height="31" border="0" src="https://technick.net/img/guide_dft/img777.png" alt="\" egin="" isplaymath="" eft="" t="" r="" r="" right="" t="" left="" t="" y="" ight="" t="" left="" t="" y="" ight="" t="" uad="" in="" al="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;Since the inner product is linear in both of its arguments for real&#10;scalars, it is often called a &lt;i&gt;bilinear operator&lt;/i&gt; in that context.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/inner_product"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/norm_induced_inner"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Norm Induced by the Inner Product</title><link>https://technick.net/guides/theory/dft/norm_induced_inner/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/norm_induced_inner/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/linearity_inner_product"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/cauchy_schwarz_inequality"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00762000000000000000"&gt;Norm Induced by the Inner Product&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;We may define a &lt;i&gt;norm&lt;/i&gt; on &lt;!-- MATH&#10; $\underline{x}\in{\cal C}^N$&#10; --&gt;&lt;img width="54" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img751.png" alt="$\" nderline="" in="" al="" /&gt; using the &lt;a href="https://technick.net/guides/theory/dft/inner_product"&gt;inner product&lt;/a&gt;:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\|\underline{x}\| \isdef \sqrt{\left&lt;\underline{x},\underline{x}\right&gt;}&#10;\end{displaymath}&#10; --&gt;&lt;img width="110" height="31" border="0" src="https://technick.net/img/guide_dft/img778.png" alt="\" egin="" isplaymath="" ert\underline="" vert="" sdef="" qrt="" eft="" t="" nderline="" underline="" right="" t="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;It is straightforward to show that properties 1 and 3 of a norm hold.&#10;Property 2 follows easily from the Schwarz Inequality which is derived in&#10;the following subsection. Alternatively, we can simply observe that the&#10;inner product induces the well known &lt;img width="22" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img734.png" alt="$L_2$" /&gt; norm on &lt;img width="26" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img745.png" alt="${\" al="" /&gt;.&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/linearity_inner_product"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/cauchy_schwarz_inequality"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Cauchy-Schwarz Inequality</title><link>https://technick.net/guides/theory/dft/cauchy_schwarz_inequality/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/cauchy_schwarz_inequality/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/norm_induced_inner"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/triangle_inequality"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00763000000000000000"&gt;Cauchy-Schwarz Inequality&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;The &lt;i&gt;Cauchy-Schwarz Inequality&lt;/i&gt; (or ''Schwarz Inequality'') &#10;states that for all &lt;!-- MATH&#10; $\underline{x}\in{\cal C}^N$&#10; --&gt;&lt;img width="54" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img751.png" alt="$\" nderline="" in="" al="" /&gt; and &lt;!-- MATH&#10; $\underline{y}\in{\cal C}^N$&#10; --&gt;&lt;img width="53" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img752.png" alt="$\" nderline="" in="" al="" /&gt;, we have&lt;br /&gt;&lt;/p&gt;</description></item><item><title>Triangle Inequality</title><link>https://technick.net/guides/theory/dft/triangle_inequality/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/triangle_inequality/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/cauchy_schwarz_inequality"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/triangle_difference_inequal"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00764000000000000000"&gt;Triangle Inequality&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;The &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/triangle_inequality"&gt;triangle inequality&lt;/a&gt;&lt;/i&gt; states that the length of any side of a&#10;triangle is less than or equal to the sum of the lengths of the other two&#10;sides, with equality occurring only when the triangle degenerates to a&#10;line. In &lt;img width="26" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img745.png" alt="${\" al="" /&gt;, this becomes&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\|\underline{x}+\underline{y}\| \leq \|\underline{x}\| + \|\underline{y}\|&#10;\end{displaymath}&#10; --&gt;&lt;img width="155" height="33" border="0" src="https://technick.net/img/guide_dft/img792.png" alt="\" egin="" isplaymath="" ert\underline="" underline="" vert="" eq="" ert\underline="" vert="" ert\underline="" vert="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;We can show this quickly using the Schwarz Inequality.&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;\|\underline{x}+\underline{y}\|^2 &amp;=&amp; \left&lt;\underline{x}+\underline{y},\underline{x}+\underline{y}\right&gt; \\&#10;&amp;=&amp; \|\underline{x}\|^2 + 2\mbox{re}\left\{\left&lt;\underline{x},\underline{y}\right&gt;\right\} + \|\underline{y}\|^2 \\&#10;&amp;\leq&amp; \|\underline{x}\|^2 + 2\left|\left&lt;\underline{x},\underline{y}\right&gt;\right| + \|\underline{y}\|^2 \\&#10;&amp;\leq&amp; \|\underline{x}\|^2 + 2\|\underline{x}\|\cdot\|\underline{y}\| + \|\underline{y}\|^2 \\&#10;&amp;=&amp; \left(\|\underline{x}\| + \|\underline{y}\|\right)^2 \\&#10;\;\Rightarrow \;\|\underline{x}+\underline{y}\| &amp;\leq&amp; \|\underline{x}\| + \|\underline{y}\|&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="335" height="180" border="0" src="https://technick.net/img/guide_dft/img793.png" alt="\" egin="" qnarray="" ert\underline="" underline="" vert="" eft="" t="" nderline="" y="" ert="" eq="" ert\underline="" vert="" ert\underline="" vert="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/cauchy_schwarz_inequality"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/triangle_difference_inequal"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Triangle Difference Inequality</title><link>https://technick.net/guides/theory/dft/triangle_difference_inequal/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/triangle_difference_inequal/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/triangle_inequality"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/vector_cosine"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00765000000000000000"&gt;Triangle Difference Inequality&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;A useful variation on the &lt;a href="https://technick.net/guides/theory/dft/triangle_inequality"&gt;triangle inequality&lt;/a&gt; is that the length of any&#10;side of a triangle is &lt;i&gt;greater&lt;/i&gt; than the &lt;i&gt;absolute difference&lt;/i&gt; of the&#10;lengths of the other two sides:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\|\underline{x}-\underline{y}\| \geq \left|\|\underline{x}\| - \|\underline{y}\|\right|&#10;\end{displaymath}&#10; --&gt;&lt;img width="166" height="33" border="0" src="https://technick.net/img/guide_dft/img794.png" alt="\" egin="" isplaymath="" ert\underline="" underline="" vert="" eq="" eft\vert\vert\underline="" vert="" ert\underline="" vert\right\vert="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;i&gt;Proof:&lt;/i&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;\|\underline{x}-\underline{y}\|^2 &amp;=&amp; \|\underline{x}\|^2 - 2\mbox{re}\left\{\left&lt;\underline{x},\underline{y}\right&gt;\right\} + \|\underline{y}\|^2 \\&#10;&amp;\geq&amp; \|\underline{x}\|^2 - 2\left|\left&lt;\underline{x},\underline{y}\right&gt;\right| + \|\underline{y}\|^2 \\&#10;&amp;\geq&amp; \|\underline{x}\|^2 - 2\|\underline{x}\|\cdot\|\underline{y}\| + \|\underline{y}\|^2 \\&#10;&amp;=&amp; \left[\|\underline{x}\| - \|\underline{y}\|\right]^2 \\&#10;\;\Rightarrow \;\|\underline{x}-\underline{y}\| &amp;\geq&amp; \left|\|\underline{x}\| - \|\underline{y}\|\right|&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="335" height="153" border="0" src="https://technick.net/img/guide_dft/img795.png" alt="\" egin="" qnarray="" ert\underline="" underline="" vert="" ert\underline="" vert\vert\underline="" vert="" ert\underline="" vert\right\vert="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/triangle_inequality"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/vector_cosine"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Vector Cosine</title><link>https://technick.net/guides/theory/dft/vector_cosine/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/vector_cosine/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/triangle_difference_inequal"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/orthogonality"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00766000000000000000"&gt;Vector Cosine&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;The Cauchy-Schwarz Inequality can be written&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\frac{\left|\left&lt;\underline{x},\underline{y}\right&gt;\right|}{\|\underline{x}\|\cdot\|\underline{y}\|} \leq 1&#10;\end{displaymath}&#10; --&gt;&lt;img width="101" height="55" border="0" src="https://technick.net/img/guide_dft/img796.png" alt="\" egin="" isplaymath="" rac="" eft\vert\left="" t="" nderline="" underline="" right="" t="" ig="" vert\underline="" vert\cdot\vert\underline="" vert="" eq="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;In the case of real vectors &lt;!-- MATH&#10; $\underline{x},\underline{y}$&#10; --&gt;&lt;img width="29" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img797.png" alt="$\" nderline="" underline="" /&gt;, we can always find a real number&lt;img width="12" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img156.png" alt="$\" heta="" /&gt; which satisfies&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\cos(\theta) \isdef \frac{\left&lt;\underline{x},\underline{y}\right&gt;}{\|\underline{x}\|\cdot\|\underline{y}\|}&#10;\end{displaymath}&#10; --&gt;&lt;img width="139" height="55" border="0" src="https://technick.net/img/guide_dft/img798.png" alt="\" egin="" isplaymath="" os="" heta="" sdef="" rac="" eft="" t="" nderline="" underline="" right="" t="" ert\underline="" vert\cdot\vert\underline="" vert="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;We thus interpret &lt;img width="12" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img156.png" alt="$\" heta="" /&gt; as the &lt;i&gt;angle&lt;/i&gt; between two vectors in &lt;img width="30" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img695.png" alt="${\" al="" /&gt;.&#10;In &lt;img width="26" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img745.png" alt="${\" al="" /&gt; we can similarly define &lt;!-- MATH&#10; $\left|\cos(\theta)\right|$&#10; --&gt;&lt;img width="55" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img799.png" alt="$\" eft\vert\cos="" heta="" ight\vert="" /&gt;.&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/triangle_difference_inequal"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/orthogonality"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Orthogonality</title><link>https://technick.net/guides/theory/dft/orthogonality/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/orthogonality/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/vector_cosine"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/pythagorean_theorem_n_space"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00767000000000000000"&gt;Orthogonality&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;The vectors (signals) &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; and &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img13.png" alt="$y$" /&gt; are said to be &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/orthogonality"&gt;orthogonal&lt;/a&gt;&lt;/i&gt; if&#10;&lt;!-- MATH&#10; $\left&lt;x,y\right&gt;=0$&#10; --&gt;&lt;img width="70" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img800.png" alt="$\" eft="" t="" y\right="" t="" /&gt;, denoted &lt;img width="43" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img801.png" alt="$x\" erp="" /&gt;. That is to say &lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\fbox{$\displaystyle x\perp y \Leftrightarrow \left&lt;x,y\right&gt;=0.$}&#10;\end{displaymath}&#10; --&gt;&lt;img width="160" height="37" border="0" src="https://technick.net/img/guide_dft/img802.png" alt="\" egin="" isplaymath="" box="" isplaystyle="" erp="" eftrightarrow="" eft="" t="" y\right="" t="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;Note that if &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; and &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img13.png" alt="$y$" /&gt; are real and orthogonal, the cosine of the angle&#10;between them is zero. In plane geometry (&lt;img width="48" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img19.png" alt="$N=2$" /&gt;), the angle between twoperpendicular lines is &lt;img width="30" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img501.png" alt="$\" i="i" /&gt;, and &lt;img width="93" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img803.png" alt="$\" os="" i="" /&gt;, as expected. More&#10;generally, &lt;a href="https://technick.net/guides/theory/dft/orthogonality"&gt;orthogonality&lt;/a&gt; corresponds to the fact that two vectors in&lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt;-space intersect at a &lt;i&gt;right angle&lt;/i&gt; and are thus &lt;i&gt;perpendicular&lt;/i&gt;geometrically.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Example (&lt;img width="48" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img19.png" alt="$N=2$" /&gt;):&lt;/b&gt;&lt;/p&gt;&lt;p&gt;Let &lt;img width="66" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img804.png" alt="$x=[1,1]$" /&gt; and &lt;img width="78" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img805.png" alt="$y=[1,-1]$" /&gt;, as shown in Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/orthogonality#fig:ip"&gt;6.8&lt;/a&gt;.&lt;/p&gt;&lt;p&gt; &lt;div align="CENTER"&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:ip"&gt;&lt;/a&gt;&lt;a name="9035"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure 6.8:&lt;/strong&gt;Example of two orthogonal&#10;vectors for &lt;img width="48" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img19.png" alt="$N=2$" /&gt;.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; $\scalebox{0.5}{\includegraphics{eps/ip.eps}}$&#10; --&gt;&lt;img width="102" height="89" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img806.png" alt="\" calebox="" ncludegraphics="" ps="" p="" ps="" /&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;&lt;p&gt;The &lt;a href="https://technick.net/guides/theory/dft/inner_product"&gt;inner product&lt;/a&gt; is &lt;!-- MATH&#10; $\left&lt;x,y\right&gt;=1\cdot \overline{1} + 1\cdot\overline{(-1)} = 0$&#10; --&gt;&lt;img width="190" height="38" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img807.png" alt="$\" eft="" t="" y\right="" t="" dot="" verline="" dot\overline="" /&gt;.&#10;This shows that the vectors are &lt;i&gt;orthogonal&lt;/i&gt;. As marked in the figure,&#10;the lines intersect at a right angle and are therefore perpendicular.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/vector_cosine"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/pythagorean_theorem_n_space"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>The Pythagorean Theorem in N-Space</title><link>https://technick.net/guides/theory/dft/pythagorean_theorem_n_space/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/pythagorean_theorem_n_space/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/orthogonality"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/projection"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00768000000000000000"&gt;The Pythagorean Theorem in N-Space&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;In 2D, the &lt;a href="https://technick.net/guides/theory/dft/pythagorean_theorem_n_space"&gt;Pythagorean Theorem&lt;/a&gt; says that when &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; and &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img13.png" alt="$y$" /&gt; are &lt;a href="https://technick.net/guides/theory/dft/orthogonality"&gt;orthogonal&lt;/a&gt;,&#10;as in Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/orthogonality#fig:ip"&gt;6.8&lt;/a&gt;, (i.e., when the triangle formed by &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt;, &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img13.png" alt="$y$" /&gt;, and &lt;img width="41" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img702.png" alt="$x+y$" /&gt;,&#10;with &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img13.png" alt="$y$" /&gt; translated to the tip of &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt;, is a &lt;i&gt;right triangle&lt;/i&gt;), then we&#10;have&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\|x+y\|^2 = \|x\|^2 + \|y\|^2 .&#10;\end{displaymath}&#10; --&gt;&lt;img width="184" height="31" border="0" src="https://technick.net/img/guide_dft/img808.png" alt="\" egin="" isplaymath="" ert="" vert="" ert="" ert="" ert="" ert="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;This relationship generalizes to &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; dimensions, as we can easily show:&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;\|x+y\|^2 &amp;=&amp; \left&lt;x+y,x+y\right&gt; \\&#10;&amp;=&amp; \left&lt;x,x\right&gt;+\left&lt;x,y\right&gt;+\left&lt;y,x\right&gt;+\left&lt;y,y\right&gt; \\&#10;&amp;=&amp; \|x\|^2 + \left&lt;x,y\right&gt;+\overline{\left&lt;x,y\right&gt;} + \|y\|^2 \\&#10;&amp;=&amp; \|x\|^2 + \|y\|^2 + 2\mbox{re}\left\{\left&lt;x,y\right&gt;\right\}&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="340" height="110" border="0" src="https://technick.net/img/guide_dft/img809.png" alt="\" egin="" qnarray="" ert="" vert="" eft="" t="" y="" y\right="" t="" eft="" t="" x\ri="" vert="" ert="" box="" e="" eft\="" eft="" t="" y\right="" t="" ight\="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;If &lt;img width="43" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img801.png" alt="$x\" erp="" /&gt;, then &lt;!-- MATH&#10; $\left&lt;x,y\right&gt;=0$&#10; --&gt;&lt;img width="70" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img800.png" alt="$\" eft="" t="" y\right="" t="" /&gt; and the Pythagorean Theorem &lt;!-- MATH&#10; $\|x+y\|^2&#10;= \|x\|^2 + \|y\|^2$&#10; --&gt;&lt;img width="168" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img810.png" alt="$\" ert="" vert="" ert="" ert="" ert="" ert="" /&gt; holds in &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; dimensions. If, on the other hand,&#10;we assume the Pythagorean Theorem holds, then since all norms are positive&#10;unless &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; or &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img13.png" alt="$y$" /&gt; is zero, we must have &lt;!-- MATH&#10; $\left&lt;x,y\right&gt;=0$&#10; --&gt;&lt;img width="70" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img800.png" alt="$\" eft="" t="" y\right="" t="" /&gt;. Finally, if &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; or &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img13.png" alt="$y$" /&gt; is&#10;zero, the result holds trivially.&lt;p&gt;Note that we also have an alternate version of the Pythagorean theorem:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\|x-y\|^2 = \|x\|^2 + \|y\|^2 \;\iff\; x\perp y .&#10;\end{displaymath}&#10; --&gt;&lt;img width="289" height="31" border="0" src="https://technick.net/img/guide_dft/img811.png" alt="\" egin="" isplaymath="" ert="" vert="" ert="" ert="" ert="" ert="" ff\="" perp="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/orthogonality"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/projection"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Projection</title><link>https://technick.net/guides/theory/dft/projection/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/projection/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/pythagorean_theorem_n_space"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/signal_reconstruction_proje"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00769000000000000000"&gt;Projection&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;The &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/projection"&gt;orthogonal projection&lt;/a&gt;&lt;/i&gt; (or simply ''projection'') of&#10;&lt;!-- MATH&#10; $\underline{y}\in{\cal C}^N$&#10; --&gt;&lt;img width="53" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img752.png" alt="$\" nderline="" in="" al="" /&gt; onto &lt;!-- MATH&#10; $\underline{x}\in{\cal C}^N$&#10; --&gt;&lt;img width="54" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img751.png" alt="$\" nderline="" in="" al="" /&gt; is defined by&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;{\cal P}_{\underline{x}}(\underline{y}) \isdef \frac{\left&lt;\underline{y},\underline{x}\right&gt;}{\|\underline{x}\|^2} \underline{x}&#10;\end{displaymath}&#10; --&gt;&lt;img width="125" height="52" border="0" src="https://technick.net/img/guide_dft/img812.png" alt="\" egin="" isplaymath="" al="" nderline="" underline="" isdef="" rac="" eft="" t="" nderline="" right="" t="" ert\underline="" vert="" nderline="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;The complex scalar &lt;!-- MATH&#10; $\left&lt;\underline{x},\underline{y}\right&gt;/\|\underline{x}\|^2$&#10; --&gt;&lt;img width="86" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img813.png" alt="$\" eft="" t="" nderline="" underline="" right="" t="" ert\underline="" vert="" /&gt; is called the&lt;i&gt;coefficient of projection&lt;/i&gt;. When projecting &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img20.png" alt="$\" nderline="" /&gt; onto a &lt;i&gt;unit&#10;length&lt;/i&gt; vector &lt;img width="13" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img21.png" alt="$\" nderline="" /&gt;, the coefficient of projection is simply the &lt;a href="https://technick.net/guides/theory/dft/inner_product"&gt;inner&#10;product&lt;/a&gt; of &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img20.png" alt="$\" nderline="" /&gt; with &lt;img width="13" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img21.png" alt="$\" nderline="" /&gt;.&lt;p&gt;&lt;b&gt;Motivation:&lt;/b&gt; The basic idea of &lt;a href="https://technick.net/guides/theory/dft/orthogonality"&gt;orthogonal&lt;/a&gt; projection of &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img20.png" alt="$\" nderline="" /&gt; onto&lt;img width="13" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img21.png" alt="$\" nderline="" /&gt; is to ''drop a perpendicular'' from &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img20.png" alt="$\" nderline="" /&gt; onto &lt;img width="13" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img21.png" alt="$\" nderline="" /&gt; to define a new&#10;vector along &lt;img width="13" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img21.png" alt="$\" nderline="" /&gt; which we call the ''projection'' of &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img20.png" alt="$\" nderline="" /&gt; onto &lt;img width="13" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img21.png" alt="$\" nderline="" /&gt;.&#10;This is illustrated for &lt;img width="48" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img19.png" alt="$N=2$" /&gt; in Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/projection#fig:proj"&gt;6.9&lt;/a&gt; for &lt;!-- MATH&#10; $\underline{x}= [4,1]$&#10; --&gt;&lt;img width="66" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img814.png" alt="$\" nderline="" /&gt; and&#10;&lt;!-- MATH&#10; $\underline{y}=[2,3]$&#10; --&gt;&lt;img width="66" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img815.png" alt="$\" nderline="" /&gt;, in which case&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;{\cal P}_{\underline{x}}(\underline{y}) \isdef \frac{\left&lt;\underline{y},\underline{x}\right&gt;}{\|\underline{x}\|^2} \underline{x}&#10;&#9;= \frac{(2\cdot \overline{4} + 3\cdot \overline{1})}{4^2+1^2} \underline{x}&#10;&#9;= \frac{11}{17} \underline{x}= \left[\frac{44}{17},\frac{11}{17}\right]&#10;\end{displaymath}&#10; --&gt;&lt;img width="403" height="53" border="0" src="https://technick.net/img/guide_dft/img816.png" alt="\" egin="" isplaymath="" al="" nderline="" underline="" isdef="" rac="" eft="" t="" nderline="" left="" rac="" rac="" ight="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt; &lt;div align="CENTER"&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:proj"&gt;&lt;/a&gt;&lt;a name="9090"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure 6.9:&lt;/strong&gt;Projection of &lt;!-- MATH&#10; $\protect\underline{y}$&#10; --&gt;&lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img20.png" alt="$\" nderline="" /&gt;onto &lt;!-- MATH&#10; $\protect\underline{x}$&#10; --&gt;&lt;img width="13" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img21.png" alt="$\" nderline="" /&gt; in 2D space.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; $\scalebox{0.5}{\includegraphics{eps/proj.eps}}$&#10; --&gt;&lt;img width="237" height="115" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img817.png" alt="\" calebox="" ncludegraphics="" ps="" roj="" ps="" /&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;&lt;p&gt;&lt;b&gt;Derivation:&lt;/b&gt; (1) Since any projection onto &lt;img width="13" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img21.png" alt="$\" nderline="" /&gt; must lie along the&#10;line colinear with &lt;img width="13" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img21.png" alt="$\" nderline="" /&gt;, write the projection as &lt;!-- MATH&#10; ${\cal P}_{\underline{x}}(\underline{y})=\alpha&#10;\underline{x}$&#10; --&gt;&lt;img width="85" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img818.png" alt="${\" al="" nderline="" underline="" alpha="" nderline="" /&gt;. (2) Since by definition the projection is orthogonal to &lt;img width="13" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img21.png" alt="$\" nderline="" /&gt;, we&#10;must have&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;(\underline{y}-\alpha\underline{x}) &amp; \perp &amp; \underline{x}\\&#10;&#9;\;\Leftrightarrow\;\left&lt;\underline{y}-\alpha\underline{x},\underline{x}\right&gt; &amp;=&amp; 0 \\&#10;&#9;\;\Leftrightarrow\;\left&lt;\underline{y},\underline{x}\right&gt; &amp;=&amp; \alpha\left&lt;\underline{x},\underline{x}\right&gt; \\&#10;&#9;\;\Leftrightarrow\;\alpha &amp;=&amp; \frac{\left&lt;\underline{y},\underline{x}\right&gt;}{\left&lt;\underline{x},\underline{x}\right&gt;} &#10;&#9;&#9; = \frac{\left&lt;\underline{y},\underline{x}\right&gt;}{\|\underline{x}\|^2}&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="280" height="144" border="0" src="https://technick.net/img/guide_dft/img819.png" alt="\" egin="" qnarray="" nderline="" alpha\underline="" perp="" nderline="" t="" t="" nderline="" underline="" right="" t="" ert\underline="" vert="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/pythagorean_theorem_n_space"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/signal_reconstruction_proje"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Signal Reconstruction from Projections</title><link>https://technick.net/guides/theory/dft/signal_reconstruction_proje/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/signal_reconstruction_proje/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/projection"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/example_changing_coordinate"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00770000000000000000"&gt;Signal Reconstruction from Projections&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;We now know how to project a signal onto other signals. We now need to&#10;learn how to reconstruct a signal &lt;!-- MATH&#10; $\underline{x}\in{\cal C}^N$&#10; --&gt;&lt;img width="54" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img751.png" alt="$\" nderline="" in="" al="" /&gt; from its projections onto&lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; different vectors &lt;!-- MATH&#10; $\underline{s}_k$&#10; --&gt;&lt;img width="19" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img820.png" alt="$\" nderline="" s="" /&gt;, &lt;!-- MATH&#10; $k=0,1,2,\ldots,N-1$&#10; --&gt;&lt;img width="149" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img821.png" alt="$k=0,1,2,\" dots="" /&gt;. This will give us the&lt;i&gt;inverse &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;DFT&lt;/a&gt;&lt;/i&gt; operation (or the inverse of whatever transform we are&#10;working with).&lt;/p&gt;&lt;p&gt;As a simple example, consider the projection of a signal &lt;!-- MATH&#10; $x\in{\cal C}^N$&#10; --&gt;&lt;img width="54" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img687.png" alt="$x\" n="" al="" /&gt; onto the&#10;rectilinear &lt;i&gt;coordinate axes&lt;/i&gt; of &lt;img width="26" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img745.png" alt="${\" al="" /&gt;. The coordinates of the&#10;projection onto the &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img38.png" alt="$0$" /&gt;th coordinate axis are simply &lt;!-- MATH&#10; $(x_0,0,\ldots,0)$&#10; --&gt;&lt;img width="91" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img822.png" alt="$(x_0,0,\" dots="" /&gt;.&#10;The projection along coordinate axis &lt;img width="12" height="13" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img78.png" alt="$1$" /&gt; has coordinates&#10;&lt;!-- MATH&#10; $(0,x_1,0,\ldots,0)$&#10; --&gt;&lt;img width="106" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img823.png" alt="$(0,x_1,0,\" dots="" /&gt;, and so on. The original signal &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; is then clearly&#10;the &lt;i&gt;vector sum&lt;/i&gt; of its projections onto the coordinate axes:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;x = (x_0,\ldots,x_{N-1}) = (x_0,0,\ldots,0) + (0,x_1,0,\ldots,0) + \cdots&#10;&#9;&#9;&#9; (0,\ldots,0,x_{N-1})&#10;\end{displaymath}&#10; --&gt;&lt;img width="562" height="31" border="0" src="https://technick.net/img/guide_dft/img824.png" alt="\" egin="" isplaymath="" x="" ldots="" x="" n-1="" x="" dots="" ldots="" dots="" dots="" n-1="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;To make sure the previous paragraph is understood, let's look at the&#10;details for the case &lt;img width="48" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img19.png" alt="$N=2$" /&gt;. We want to project an arbitrary two-sample&#10;signal &lt;!-- MATH&#10; $\underline{x}= (x_0,x_1)$&#10; --&gt;&lt;img width="86" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img825.png" alt="$\" nderline="" x="" /&gt; onto the coordinate axes in 2D. A coordinate axis&#10;can be represented by any nonzero vector along its length. The horizontal&#10;axis can be represented by any vector of the form &lt;img width="42" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img826.png" alt="$(\" lpha="" /&gt; while the&#10;vertical axis can be represented by any vector of the form &lt;img width="41" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img827.png" alt="$(0,\" eta="" /&gt;.&#10;For maximum simplicity, let's choose the positive unit-length&#10;representatives:&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;\underline{e}_0 &amp;\isdef &amp; (1,0) \\&#10;\underline{e}_1 &amp;\isdef &amp; (0,1)&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="102" height="60" border="0" src="https://technick.net/img/guide_dft/img828.png" alt="\" egin="" qnarray="" nderline="" isdef="" nderline="" isdef="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;The projection of &lt;img width="13" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img21.png" alt="$\" nderline="" /&gt; onto &lt;!-- MATH&#10; $\underline{e}_0$&#10; --&gt;&lt;img width="19" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img829.png" alt="$\" nderline="" /&gt; is by definition&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;{\cal P}_{\underline{e}_0}(\underline{x}) \isdef \frac{\left&lt;\underline{x},\underline{e}_0\right&gt;}{\|\underline{e}_0\|^2} \underline{e}_0&#10;&#9;= \left&lt;\underline{x},\underline{e}_0\right&gt; \underline{e}_0&#10;&#9;= \left&lt;[x_0,x_1],[1,0]\right&gt; \underline{e}_0&#10;&#9;= (x_0 \cdot \overline{1} + x_1 \cdot \overline{0}) \underline{e}_0&#10;&#9;= x_0 \underline{e}_0&#10;&#9;= [x_0,0]&#10;\end{displaymath}&#10; --&gt;&lt;img width="661" height="49" border="0" src="https://technick.net/img/guide_dft/img830.png" alt="\" egin="" isplaymath="" al="" nderline="" underline="" isdef="" rac="" eft="" verline="" nderline="" x="" nderline="" x="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Similarly, the projection of &lt;img width="13" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img21.png" alt="$\" nderline="" /&gt; onto &lt;!-- MATH&#10; $\underline{e}_1$&#10; --&gt;&lt;img width="19" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img831.png" alt="$\" nderline="" /&gt; is&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;{\cal P}_{\underline{e}_1}(\underline{x}) \isdef \frac{\left&lt;\underline{x},\underline{e}_1\right&gt;}{\|\underline{e}_1\|^2} \underline{e}_1&#10;&#9;= \left&lt;\underline{x},\underline{e}_1\right&gt; \underline{e}_1&#10;&#9;= \left&lt;[x_0,x_1],[0,1]\right&gt; \underline{e}_1&#10;&#9;= (x_0 \cdot \overline{0} + x_1 \cdot \overline{1}) \underline{e}_1&#10;&#9;= x_1 \underline{e}_1&#10;&#9;= [0,x_1]&#10;\end{displaymath}&#10; --&gt;&lt;img width="661" height="49" border="0" src="https://technick.net/img/guide_dft/img832.png" alt="\" egin="" isplaymath="" al="" nderline="" underline="" isdef="" rac="" eft="" verline="" nderline="" x="" nderline="" x="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;The &lt;i&gt;reconstruction&lt;/i&gt; of &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; from its projections onto the coordinate&#10;axes is then the &lt;i&gt;vector sum of the projections&lt;/i&gt;:&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\underline{x}= {\cal P}_{\underline{e}_0}(\underline{x}) + {\cal P}_{\underline{e}_1}(\underline{x}) = x_0 \underline{e}_0 + x_1 \underline{e}_1&#10;&#9;\isdef x_0 (1,0) + x_1 (0,1) = (x_0,x_1)&#10;\end{displaymath}&#10; --&gt;&lt;img width="506" height="33" border="0" src="https://technick.net/img/guide_dft/img833.png" alt="\" egin="" isplaymath="" nderline="" cal="" nderline="" underline="" x="" nderline="" isdef="" x="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;The projection of a vector onto its coordinate axes is in some sense&#10;trivial because the very meaning of the &lt;i&gt;coordinates&lt;/i&gt; is that they are&#10;scalars &lt;img width="22" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img689.png" alt="$x_n$" /&gt; to be applied to the &lt;i&gt;coordinate vectors&lt;/i&gt; &lt;!-- MATH&#10; $\underline{e}_n$&#10; --&gt;&lt;img width="20" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img834.png" alt="$\" nderline="" n="" /&gt; in&#10;order to form an arbitrary vector &lt;!-- MATH&#10; $\underline{x}\in{\cal C}^N$&#10; --&gt;&lt;img width="54" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img751.png" alt="$\" nderline="" in="" al="" /&gt; as a &lt;i&gt;linear combination&lt;/i&gt;of the coordinate vectors:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\underline{x}\isdef x_0 \underline{e}_0 + x_1 \underline{e}_1 + \cdots + x_{N-1} \underline{e}_{N-1}&#10;\end{displaymath}&#10; --&gt;&lt;img width="265" height="32" border="0" src="https://technick.net/img/guide_dft/img835.png" alt="\" egin="" isplaymath="" nderline="" isdef="" nderline="" x="" nderline="" cdots="" n-1="" nderline="" n-1="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Note that the coordinate vectors are &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/orthogonality"&gt;orthogonal&lt;/a&gt;&lt;/i&gt;. Since they are also&#10;unit length, &lt;!-- MATH&#10; $\|\underline{e}_n\|=1$&#10; --&gt;&lt;img width="65" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img836.png" alt="$\" ert\underline="" n\vert="1$" /&gt;, we say that the coordinate vectors&#10;&lt;!-- MATH&#10; $\{\underline{e}_n\}_{n=0}^{N-1}$&#10; --&gt;&lt;img width="64" height="36" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img837.png" alt="$\" underline="" n\="" n-1="" /&gt; are &lt;i&gt;orthonormal&lt;/i&gt;.&lt;p&gt;What's more interesting is when we project a signal &lt;img width="13" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img21.png" alt="$\" nderline="" /&gt; onto a set of&#10;vectors &lt;i&gt;other than&lt;/i&gt; the coordinate set. This can be viewed as a &lt;i&gt;change of coordinates&lt;/i&gt; in &lt;img width="26" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img745.png" alt="${\" al="" /&gt;. In the case of the DFT, the new vectors&#10;will be chosen to be &lt;i&gt;sampled complex &lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;sinusoids&lt;/a&gt;&lt;/i&gt;.&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;hr /&gt;&lt;!--Table of Child-Links--&gt;&lt;a name="CHILD_LINKS"&gt;&lt;strong&gt;Subsections&lt;/strong&gt;&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html1766" href="https://technick.net/guides/theory/dft/example_changing_coordinate"&gt;An Example of Changing Coordinates in 2D&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1767" href="https://technick.net/guides/theory/dft/general_conditions"&gt;General Conditions&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1768" href="https://technick.net/guides/theory/dft/gram_schmidt_orthogonalizat"&gt;Gram-Schmidt Orthogonalization&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;!--End of Table of Child-Links--&gt;&#10;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/projection"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/example_changing_coordinate"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>An Example of Changing Coordinates in 2D</title><link>https://technick.net/guides/theory/dft/example_changing_coordinate/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/example_changing_coordinate/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/signal_reconstruction_proje"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/general_conditions"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00771000000000000000"&gt;An Example of Changing Coordinates in 2D&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;As a simple example, let's pick the following pair of new coordinate vectors in 2D&lt;/p&gt;</description></item><item><title>General Conditions</title><link>https://technick.net/guides/theory/dft/general_conditions/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/general_conditions/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/example_changing_coordinate"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/gram_schmidt_orthogonalizat"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00772000000000000000"&gt;General Conditions&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;This section summarizes and extends the above derivations in a somewhat&#10;formal manner (following portions of chapter 4 of &lt;img width="21" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img857.png" alt="$\" ite="" oble="" /&gt;).&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Definition: &lt;/b&gt;A set of vectors is said to form a &lt;i&gt;vector space&lt;/i&gt; if given any&#10;two members &lt;img width="13" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img21.png" alt="$\" nderline="" /&gt; and &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img20.png" alt="$\" nderline="" /&gt; from the set, the vectors &lt;!-- MATH&#10; $\underline{x}+\underline{y}$&#10; --&gt;&lt;img width="41" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img858.png" alt="$\" nderline="" underline="" /&gt; and &lt;!-- MATH&#10; $c\underline{x}$&#10; --&gt;&lt;img width="20" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img859.png" alt="$c\" nderline="" /&gt;are also in the set, where &lt;img width="11" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img139.png" alt="$c$" /&gt; is any scalar.&lt;/p&gt;&lt;p&gt;Vectors defined as a list of &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; &lt;a href="https://technick.net/guides/theory/dft/introduction_complex_number"&gt;complex numbers&lt;/a&gt;&lt;!-- MATH&#10; $\underline{x}=(x_0,\ldots,x_{N-1})\in{\cal C}^N$&#10; --&gt;&lt;img width="177" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img860.png" alt="$\" nderline="" x="" dots="" n-1="" n="" al="" /&gt;, using elementwise addition and&#10;multiplication by complex scalars &lt;img width="40" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img861.png" alt="$c\" n="" al="" /&gt;, form a vector space.&#10;Similarly, real vectors &lt;!-- MATH&#10; $\underline{x}\in{\cal R}^N$&#10; --&gt;&lt;img width="58" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img781.png" alt="$\" nderline="" in="" al="" /&gt; and real scalars &lt;img width="40" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img861.png" alt="$c\" n="" al="" /&gt; form a&#10;vector space.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Theorem: &lt;/b&gt;The set of all linear combinations of any set of vectors from &lt;img width="30" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img695.png" alt="${\" al="" /&gt; or &lt;img width="26" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img745.png" alt="${\" al="" /&gt; forms a vector space.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;em&gt;Proof: &lt;/em&gt;Let the original set of vectors be denoted &lt;!-- MATH&#10; $\underline{s}_0,\ldots,\underline{s}_{M-1}$&#10; --&gt;&lt;img width="92" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img862.png" alt="$\" nderline="" s="" dots="" nderline="" s="" /&gt;,&#10;where &lt;img width="21" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img201.png" alt="$M$" /&gt; can be any integer greater than zero. Then any member &lt;!-- MATH&#10; $\underline{x}_0$&#10; --&gt;&lt;img width="20" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img863.png" alt="$\" nderline="" /&gt; of&#10;the vector space is by definition a linear combination of them:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\underline{x}_0 = \alpha_0 \underline{s}_0 + \cdots + \alpha_0\underline{s}_{M-1}&#10;\end{displaymath}&#10; --&gt;&lt;img width="199" height="32" border="0" src="https://technick.net/img/guide_dft/img864.png" alt="\" egin="" isplaymath="" nderline="" alpha="" nderline="" s="" dots="" lpha="" nderline="" s="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;From this we see that &lt;!-- MATH&#10; $c\underline{x}_0$&#10; --&gt;&lt;img width="27" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img865.png" alt="$c\" nderline="" /&gt; is also a linear combination&#10;of the original vectors, and hence is in the vector space. Also,&#10;given any second vector from the space&#10;&lt;!-- MATH&#10; $\underline{x}_1 = \alpha_1 \underline{s}_0 + \cdots + \alpha_1\underline{s}_{M-1}$&#10; --&gt;&lt;img width="186" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img866.png" alt="$\" nderline="" alpha="" nderline="" s="" dots="" lpha="" nderline="" s="" /&gt;,&#10;the sum is &lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;\underline{x}_0 + \underline{x}_1 &amp;=&amp; (\alpha_0 \underline{s}_0 + \cdots \alpha_0\underline{s}_{M-1}) + ( \alpha_1 \underline{s}_0 + \cdots \alpha_1\underline{s}_{M-1}) \\&#10;&amp;=&amp; (\alpha_0 + \alpha_1) \underline{s}_0 + \cdots + (\alpha_0 + \alpha_1)\underline{s}_{M-1}&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="435" height="59" border="0" src="https://technick.net/img/guide_dft/img867.png" alt="\" egin="" qnarray="" nderline="" underline="" alpha="" nderline="" s="" erline="" s="" dots="" lpha="" lpha="" nderline="" s="" end="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;which is just another linear combination of the original vectors, and hence&#10;is in the vector space. It is clear here how the closure of &lt;a href="https://technick.net/guides/theory/dft/vector_addition"&gt;vector&#10;addition&lt;/a&gt; and scalar multiplication are ''inherited'' from the closure of&#10;real or complex numbers under addition and multiplication.&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Definition: &lt;/b&gt;If a vector space consists of the set of all linear combinations of &#10;a finite set of vectors &lt;!-- MATH&#10; $\underline{s}_0,\ldots,\underline{s}_{M-1}$&#10; --&gt;&lt;img width="92" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img862.png" alt="$\" nderline="" s="" dots="" nderline="" s="" /&gt;, then those vectors are said&#10;to &lt;i&gt;span&lt;/i&gt; the space.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Example: &lt;/b&gt;The &lt;i&gt;coordinate vectors&lt;/i&gt; in &lt;img width="26" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img745.png" alt="${\" al="" /&gt; span &lt;img width="26" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img745.png" alt="${\" al="" /&gt; since every vector&#10;&lt;!-- MATH&#10; $\underline{x}\in{\cal C}^N$&#10; --&gt;&lt;img width="54" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img751.png" alt="$\" nderline="" in="" al="" /&gt; can be expressed as a linear combination of the coordinate vectors&#10;as&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\underline{x}= x_0 \underline{e}_0 + x_1 \underline{e}_1 + \cdots + x_{N-1}\underline{e}_{N-1}&#10;\end{displaymath}&#10; --&gt;&lt;img width="265" height="32" border="0" src="https://technick.net/img/guide_dft/img868.png" alt="\" egin="" isplaymath="" nderline="" x="" nderline="" x="" nderline="" cdots="" n-1="" nderline="" n-1="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where &lt;!-- MATH&#10; $x_i\in{\cal C}$&#10; --&gt;&lt;img width="47" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img869.png" alt="$x_i\" n="" al="" /&gt;, and &lt;!-- MATH&#10; $\underline{e}_0 = (1,0,0,\ldots,0)$&#10; --&gt;&lt;img width="134" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img870.png" alt="$\" nderline="" ldots="" /&gt;, &lt;!-- MATH&#10; $\underline{e}_1 =&#10;(0,1,0,\ldots,0)$&#10; --&gt;&lt;img width="134" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img871.png" alt="$\" nderline="" ldots="" /&gt;, &lt;!-- MATH&#10; $\underline{e}_2 = (0,0,1,0,\ldots,0)$&#10; --&gt;&lt;img width="149" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img872.png" alt="$\" nderline="" ldots="" /&gt;, and so on up to &lt;!-- MATH&#10; $\underline{e}_{N-1}&#10;= (0,\ldots,0,1)$&#10; --&gt;&lt;img width="140" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img873.png" alt="$\" nderline="" n-1="" dots="" /&gt;.&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Theorem: &lt;/b&gt;(i) If &lt;!-- MATH&#10; $\underline{s}_0,\ldots,\underline{s}_{M-1}$&#10; --&gt;&lt;img width="92" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img862.png" alt="$\" nderline="" s="" dots="" nderline="" s="" /&gt; span a vector space, and if one of them,&#10;say &lt;!-- MATH&#10; $\underline{s}_m$&#10; --&gt;&lt;img width="24" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img874.png" alt="$\" nderline="" s="" /&gt;, is linearly dependent on the others, then the vector space&#10;is spanned by the set obtained by omitting &lt;!-- MATH&#10; $\underline{s}_m$&#10; --&gt;&lt;img width="24" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img874.png" alt="$\" nderline="" s="" /&gt; from the original set.&#10;(ii) If &lt;!-- MATH&#10; $\underline{s}_0,\ldots,\underline{s}_{M-1}$&#10; --&gt;&lt;img width="92" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img862.png" alt="$\" nderline="" s="" dots="" nderline="" s="" /&gt; span a vector space, we can always&#10;select from these a linearly independent set that spans the same space.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;em&gt;Proof: &lt;/em&gt;Any &lt;img width="13" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img21.png" alt="$\" nderline="" /&gt; in the space can be represented as a linear combination of the&#10;vectors &lt;!-- MATH&#10; $\underline{s}_0,\ldots,\underline{s}_{M-1}$&#10; --&gt;&lt;img width="92" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img862.png" alt="$\" nderline="" s="" dots="" nderline="" s="" /&gt;. By expressing &lt;!-- MATH&#10; $\underline{s}_m$&#10; --&gt;&lt;img width="24" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img874.png" alt="$\" nderline="" s="" /&gt; as a linear&#10;combination of the other vectors in the set, the linear combination for&lt;img width="13" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img21.png" alt="$\" nderline="" /&gt; becomes a linear combination of vectors other than &lt;!-- MATH&#10; $\underline{s}_m$&#10; --&gt;&lt;img width="24" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img874.png" alt="$\" nderline="" s="" /&gt;. Thus,&#10;&lt;!-- MATH&#10; $\underline{s}_m$&#10; --&gt;&lt;img width="24" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img874.png" alt="$\" nderline="" s="" /&gt; can be eliminated from the set, proving (i). To prove (ii), we can&#10;define a procedure for forming the require subset of the original vectors:&#10;First, assign &lt;!-- MATH&#10; $\underline{s}_0$&#10; --&gt;&lt;img width="19" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img842.png" alt="$\" nderline="" s="" /&gt; to the set. Next, check to see if &lt;!-- MATH&#10; $\underline{s}_0$&#10; --&gt;&lt;img width="19" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img842.png" alt="$\" nderline="" s="" /&gt; and&#10;&lt;!-- MATH&#10; $\underline{s}_1$&#10; --&gt;&lt;img width="19" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img844.png" alt="$\" nderline="" s="" /&gt; are linearly dependent. If so (i.e., &lt;!-- MATH&#10; $\underline{s}_1$&#10; --&gt;&lt;img width="19" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img844.png" alt="$\" nderline="" s="" /&gt; is a scalar times&#10;&lt;!-- MATH&#10; $\underline{s}_0$&#10; --&gt;&lt;img width="19" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img842.png" alt="$\" nderline="" s="" /&gt;), then discard &lt;!-- MATH&#10; $\underline{s}_1$&#10; --&gt;&lt;img width="19" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img844.png" alt="$\" nderline="" s="" /&gt;; otherwise assign it also to the new set.&#10;Next, check to see if &lt;!-- MATH&#10; $\underline{s}_2$&#10; --&gt;&lt;img width="19" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img875.png" alt="$\" nderline="" s="" /&gt; is linearly dependent on the vectors in the&#10;new set. If it is (i.e., &lt;!-- MATH&#10; $\underline{s}_1$&#10; --&gt;&lt;img width="19" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img844.png" alt="$\" nderline="" s="" /&gt; is some linear combination of &lt;!-- MATH&#10; $\underline{s}_0$&#10; --&gt;&lt;img width="19" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img842.png" alt="$\" nderline="" s="" /&gt; and&#10;&lt;!-- MATH&#10; $\underline{s}_1$&#10; --&gt;&lt;img width="19" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img844.png" alt="$\" nderline="" s="" /&gt;) then discard it; otherwise assign it also to the new set. When&#10;this procedure terminates after processing &lt;!-- MATH&#10; $\underline{s}_{M-1}$&#10; --&gt;&lt;img width="42" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img876.png" alt="$\" nderline="" s="" /&gt;, the new set will&#10;contain only linearly independent vectors which span the original space.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Definition: &lt;/b&gt;A set of linearly independent vectors which spans a vector space&#10;is called a &lt;i&gt;basis&lt;/i&gt; for that vector space.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Definition: &lt;/b&gt;The set of coordinate vectors in &lt;img width="26" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img745.png" alt="${\" al="" /&gt; &#10;is called the &lt;i&gt;natural basis&lt;/i&gt; for &lt;img width="26" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img745.png" alt="${\" al="" /&gt;, where the &lt;img width="14" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img51.png" alt="$n$" /&gt;th basis vectoris&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\underline{e}_n = (0,\ldots,0,\underbrace{1}_{\mbox{$n$th}},0,\ldots,0).&#10;\end{displaymath}&#10; --&gt;&lt;img width="219" height="56" border="0" src="https://technick.net/img/guide_dft/img877.png" alt="\" egin="" isplaymath="" nderline="" n="(0,\ldots,0,\underbrace{1}_{\mbox{$n$th}},0,\ldots,0)." end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Theorem: &lt;/b&gt;The linear combination expressing a vector in terms of basis vectors&#10;for a vector space is &lt;i&gt;unique&lt;/i&gt;.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;em&gt;Proof: &lt;/em&gt;Suppose a vector &lt;!-- MATH&#10; $\underline{x}\in{\cal C}^N$&#10; --&gt;&lt;img width="54" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img751.png" alt="$\" nderline="" in="" al="" /&gt; can be expressed in two different ways as&#10;a linear combination of basis vectors &lt;!-- MATH&#10; $\underline{s}_0,\ldots,\underline{s}_{N-1}$&#10; --&gt;&lt;img width="90" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img878.png" alt="$\" nderline="" s="" dots="" nderline="" s="" /&gt;:&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;\underline{x}&amp;=&amp; \alpha_0 \underline{s}_0 + \cdots \alpha_{N-1}\underline{s}_{N-1} \\&#10; &amp;=&amp; \beta_0 \underline{s}_0 + \cdots \beta_{N-1}\underline{s}_{N-1}&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="219" height="59" border="0" src="https://technick.net/img/guide_dft/img879.png" alt="\" egin="" qnarray="" nderline="" alpha="" nderline="" s="" dots="" lpha="" beta="" nderline="" s="" dots="" eta="" underline="" s="" end="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where &lt;!-- MATH&#10; $\alpha_i\neq\beta_i$&#10; --&gt;&lt;img width="55" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img880.png" alt="$\" lpha="" neq\beta="" i="" /&gt; for at least one value of &lt;img width="95" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img881.png" alt="$i\" n="" /&gt;.&#10;Subtracting the two representations gives&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\underline{0}= (\alpha_0 - \beta_0)\underline{s}_0 + \cdots + &#10;&#9;(\alpha_{N-1} - \beta_{N-1})\underline{s}_{N-1}&#10;\end{displaymath}&#10; --&gt;&lt;img width="341" height="32" border="0" src="https://technick.net/img/guide_dft/img882.png" alt="\" egin="" isplaymath="" nderline="" lpha="" eta="" nderline="" s="" dots="" lpha="" beta="" underline="" s="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Since the vectors are linearly independent, it is not possible to cancel&#10;the nonzero vector &lt;!-- MATH&#10; $(\alpha_i-\beta_i)\underline{s}_i$&#10; --&gt;&lt;img width="78" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img883.png" alt="$(\" lpha="" beta="" i="" nderline="" s="" i="" /&gt; using some linear combination&#10;of the other vectors in the sum. Hence, &lt;!-- MATH&#10; $\alpha_i=\beta_i$&#10; --&gt;&lt;img width="55" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img884.png" alt="$\" lpha="" beta="" i="" /&gt; for all&#10;&lt;!-- MATH&#10; $i=0,1,2,\ldots,N-1$&#10; --&gt;&lt;img width="146" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img885.png" alt="$i=0,1,2,\" dots="" /&gt;.&lt;p&gt;Note that while the linear combination relative to a particular basis is&#10;unique, the choice of basis vectors is not. For example, given any basis&#10;set in &lt;img width="26" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img745.png" alt="${\" al="" /&gt;, a new basis can be formed by &lt;i&gt;rotating&lt;/i&gt; all vectors in&lt;img width="26" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img745.png" alt="${\" al="" /&gt; by the same angle. In this way, an infinite number of basis sets can&#10;be generated. &lt;/p&gt;&lt;p&gt;As we will soon show, the &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;DFT&lt;/a&gt; can be viewed as a &lt;i&gt;change of&#10;coordinates&lt;/i&gt; from coordinates relative to the &lt;i&gt;natural basis&lt;/i&gt; in &lt;img width="26" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img745.png" alt="${\" al="" /&gt;,&#10;&lt;!-- MATH&#10; $\{\underline{e}_n\}_{n=0}^{N-1}$&#10; --&gt;&lt;img width="64" height="36" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img837.png" alt="$\" underline="" n\="" n-1="" /&gt;, to coordinates relative to the &lt;i&gt;sinusoidal&#10;basis&lt;/i&gt; for &lt;img width="26" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img745.png" alt="${\" al="" /&gt;, &lt;!-- MATH&#10; $\{\underline{s}_k\}_{k=0}^{N-1}$&#10; --&gt;&lt;img width="64" height="36" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img886.png" alt="$\" underline="" s="" k="0}^{N-1}$" /&gt;, where &lt;!-- MATH&#10; $\underline{s}_k(n)\isdef &#10;e^{j\omega_k t_n}$&#10; --&gt;&lt;img width="104" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img887.png" alt="$\" nderline="" s="" n="" sdef="" omega="" n="" /&gt;. The sinusoidal basis set for &lt;img width="26" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img745.png" alt="${\" al="" /&gt; consists of length&lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; sampled complex &lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;sinusoids&lt;/a&gt; at frequencies &lt;!-- MATH&#10; $\omega_k=2\pi k f_s/N,&#10;k=0,1,2,\ldots,N-1$&#10; --&gt;&lt;img width="257" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img888.png" alt="$\" mega="" pi="" s="s" n="" ldots="" n-1="" /&gt;. Any scaling of these vectors in &lt;img width="26" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img745.png" alt="${\" al="" /&gt; by complex&#10;scale factors could also be chosen as the sinusoidal basis (i.e., any&#10;nonzero &lt;a href="https://technick.net/guides/theory/dft/logarithms"&gt;amplitude&lt;/a&gt; and any phase will do). However, for simplicity, we will&#10;only use unit-amplitude, zero-phase complex sinusoids as the Fourier&#10;''frequency-domain'' basis set. To summarize this paragraph, the&#10;time-domain samples of a signal are its coordinates relative to the natural&#10;basis for &lt;img width="26" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img745.png" alt="${\" al="" /&gt;, while its spectral coefficients are the coordinates of the&#10;signal relative to the sinusoidal basis for &lt;img width="26" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img745.png" alt="${\" al="" /&gt;.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Theorem: &lt;/b&gt;Any two bases of a vector space contain the same number of vectors.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;em&gt;Proof: &lt;/em&gt;Left as an exercise (or see [&lt;a href="https://technick.net/guides/theory/dft/bibliography#Noble"&gt;3&lt;/a&gt;]).&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Definition: &lt;/b&gt;The number of vectors in a basis for a particular space is called&#10;the &lt;i&gt;dimension&lt;/i&gt; of the space. If the dimension is &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt;, the space is&#10;said to be an &lt;i&gt;&lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; dimensional space&lt;/i&gt;, or &lt;i&gt;&lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt;-space&lt;/i&gt;.&lt;/p&gt;&lt;p&gt;In this course, we will only consider finite-dimensional vector spaces in&#10;any detail. However, the discrete-time &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;Fourier transform&lt;/a&gt; (DTFT) and&#10;Fourier transform both require infinite-dimensional basis sets, because&#10;there is an infinite number of points in both the time and frequency&#10;domains.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Theorem: &lt;/b&gt;The projections of any vector &lt;!-- MATH&#10; $\underline{x}\in{\cal C}^N$&#10; --&gt;&lt;img width="54" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img751.png" alt="$\" nderline="" in="" al="" /&gt; onto any &lt;a href="https://technick.net/guides/theory/dft/orthogonality"&gt;orthogonal&lt;/a&gt; basis set&#10;for &lt;img width="26" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img745.png" alt="${\" al="" /&gt; can be summed to reconstruct &lt;img width="13" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img21.png" alt="$\" nderline="" /&gt; exactly.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;em&gt;Proof: &lt;/em&gt;Let &lt;!-- MATH&#10; $\{\underline{s}_0,\ldots,\underline{s}_{N-1}\}$&#10; --&gt;&lt;img width="106" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img889.png" alt="$\" underline="" s="" dots="" nderline="" s="" /&gt; denote any orthogonal basis set for &lt;img width="26" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img745.png" alt="${\" al="" /&gt;.&#10;Then since &lt;img width="13" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img21.png" alt="$\" nderline="" /&gt; is in the space spanned by these vectors, we have&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\underline{x}= \alpha_0\underline{s}_0 + \alpha_1\underline{s}_1 + \cdots + \alpha_{N-1}\underline{s}_{N-1}&#10;\end{displaymath}&#10; --&gt;&lt;img width="269" height="32" border="0" src="https://technick.net/img/guide_dft/img890.png" alt="\" egin="" isplaymath="" nderline="" alpha="" nderline="" s="" lpha="" nderline="" s="" dots="" lpha="" underline="" s="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;for some (unique) scalars &lt;!-- MATH&#10; $\alpha_0,\ldots,\alpha_{N-1}$&#10; --&gt;&lt;img width="95" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img891.png" alt="$\" lpha="" dots="" lpha="" /&gt;.&#10;The projection of &lt;img width="13" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img21.png" alt="$\" nderline="" /&gt; onto &lt;!-- MATH&#10; $\underline{s}_k$&#10; --&gt;&lt;img width="19" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img820.png" alt="$\" nderline="" s="" /&gt; is equal to&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;{\cal P}_{\underline{s}_k}(\underline{x}) = \alpha_0{\cal P}_{\underline{s}_k}(\underline{s}_0) + &#10;\alpha_1{\cal P}_{\underline{s}_k}(\underline{s}_1) + \cdots + \alpha_{N-1}{\cal P}_{\underline{s}_k}(\underline{s}_{N-1})&#10;\end{displaymath}&#10; --&gt;&lt;img width="433" height="33" border="0" src="https://technick.net/img/guide_dft/img892.png" alt="\" egin="" isplaymath="" al="" nderline="" s="" underline="" alpha="" al="" lpha="" cal="" nderline="" s="" underline="" s="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;(using the linearity of the projection operator which follows from&#10;linearity of the &lt;a href="https://technick.net/guides/theory/dft/inner_product"&gt;inner product&lt;/a&gt; in its first argument). Since the basis&#10;vectors are orthogonal, the projection of &lt;!-- MATH&#10; $\underline{s}_l$&#10; --&gt;&lt;img width="16" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img893.png" alt="$\" nderline="" s="" /&gt; onto &lt;!-- MATH&#10; $\underline{s}_k$&#10; --&gt;&lt;img width="19" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img820.png" alt="$\" nderline="" s="" /&gt; is zero for&lt;img width="39" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img894.png" alt="$l\" eq="" /&gt;:&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;{\cal P}_{\underline{s}_k}(\underline{s}_l) \isdef &#10;\frac{\left&lt;\underline{s}_l,\underline{s}_k\right&gt;}{\left\|\,\underline{s}_k\,\right\|^2}\underline{s}_k &#10;= \left\{\begin{array}{ll}&#10;&#9;\underline{0}, &amp; l\neq k \\&#10;&#9;\underline{s}_k, &amp; l=k \\&#10;&#9;\end{array}&#10;&#9;\right.&#10;\end{displaymath}&#10; --&gt;&lt;img width="274" height="52" border="0" src="https://technick.net/img/guide_dft/img895.png" alt="\" egin="" isplaymath="" al="" nderline="" s="" underline="" s="" isdef="" rac="" l\neq="" nderline="" s="" l="k" end="" rray="" ight="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;We therefore obtain&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;{\cal P}_{\underline{s}_k}(\underline{x}) = 0 + \cdots + 0 + \alpha_k{\cal P}_{\underline{s}_k}(\underline{s}_k) + 0 + \cdots + 0&#10; = \alpha_k\underline{s}_k&#10;\end{displaymath}&#10; --&gt;&lt;img width="416" height="33" border="0" src="https://technick.net/img/guide_dft/img896.png" alt="\" egin="" isplaymath="" al="" nderline="" s="" underline="" cdots="" nderline="" s="" cdots="" lpha="" underline="" s="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Therefore, the sum of projections onto the vectors &lt;!-- MATH&#10; $\underline{s}_k$&#10; --&gt;&lt;img width="19" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img820.png" alt="$\" nderline="" s="" /&gt; is just the &#10;linear combination of the &lt;!-- MATH&#10; $\underline{s}_k$&#10; --&gt;&lt;img width="19" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img820.png" alt="$\" nderline="" s="" /&gt; which forms &lt;img width="13" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img21.png" alt="$\" nderline="" /&gt;.&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/example_changing_coordinate"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/gram_schmidt_orthogonalizat"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Gram-Schmidt Orthogonalization</title><link>https://technick.net/guides/theory/dft/gram_schmidt_orthogonalizat/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/gram_schmidt_orthogonalizat/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/general_conditions"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/appendix_matlab_examples"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00773000000000000000"&gt;Gram-Schmidt Orthogonalization&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;&lt;a name="sec:gso"&gt;&lt;/a&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Theorem: &lt;/b&gt;Given a set of &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; linearly independent vectors&#10;&lt;!-- MATH&#10; $\underline{s}_0,\ldots,\underline{s}_{N-1}$&#10; --&gt;&lt;img width="90" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img878.png" alt="$\" nderline="" s="" dots="" nderline="" s="" /&gt; from &lt;img width="26" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img745.png" alt="${\" al="" /&gt;, we can construct an &lt;i&gt;orthonormal&lt;/i&gt;set &lt;!-- MATH&#10; $\underline{{\tilde s}}_0,\ldots,\underline{{\tilde s}}_{N-1}$&#10; --&gt;&lt;img width="90" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img897.png" alt="$\" nderline="" ilde="" dots="" nderline="" ilde="" /&gt; which are linear combinations of the&#10;original set and which span the same space.&lt;/p&gt;</description></item><item><title>Appendix: Matlab Examples</title><link>https://technick.net/guides/theory/dft/appendix_matlab_examples/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/appendix_matlab_examples/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/gram_schmidt_orthogonalizat"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/discrete_fourier_transform"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00780000000000000000"&gt;Appendix: Matlab Examples&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;Here's how Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/example_vector_view#fig:vec2d"&gt;6.1&lt;/a&gt; was generated in &lt;a href="http://www.mathworks.com/access/helpdesk/help/techdoc/basics/getstarted.shtml"&gt;Matlab&lt;/a&gt;:&lt;pre&gt;&#10;&amp;gt;&amp;gt; x = [2 3]; % coordinates of x&#10;&amp;gt;&amp;gt; origin = [0 0]; % coordinates of the origin&#10;&amp;gt;&amp;gt; xcoords = [origin(1) x(1)]; % plot() expects coordinate lists, not endpoints&#10;&amp;gt;&amp;gt; ycoords = [origin(2) x(2)];&#10;&amp;gt;&amp;gt; plot(xcoords,ycoords); % Draw a line from origin to x&lt;/pre&gt;&lt;a href="https://technick.net/guides/theory/dft/sidebar_mathematica"&gt;Mathematica&lt;/a&gt; can plot a list of ordered pairs:&lt;pre&gt;&#10;In[1]:&#10; ListPlot[{{0,0},{2,3}},PlotJoined-&amp;gt;True]; (* Draw a line from (0,0) to (2,3) *)&lt;/pre&gt;&lt;/p&gt;&lt;p&gt;In Matlab, the &lt;i&gt;mean&lt;/i&gt; of the row-vector &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; can be computed as &lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\mbox{\tt x * ones(size(x'))/N}&#10;\end{displaymath}&#10; --&gt;&lt;img width="185" height="28" border="0" src="https://technick.net/img/guide_dft/img911.png" alt="\" egin="" isplaymath="" box="" t="tt" ones="" ize="" n="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;or by using the built-in function &lt;tt&gt;mean()&lt;/tt&gt;.&lt;p&gt;In Matlab, if &lt;tt&gt;x = [x1 ... xN]&lt;/tt&gt; is a row vector, we can compute the&lt;i&gt;total energy&lt;/i&gt; as&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;{\cal E}_x = \mbox{\tt x*x'}.&#10;\end{displaymath}&#10; --&gt;&lt;img width="83" height="29" border="0" src="https://technick.net/img/guide_dft/img912.png" alt="\" egin="" isplaymath="" al="" mbox="" tt="" x="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;Matlab has a function &lt;tt&gt;orth()&lt;/tt&gt; which will compute an orthonormal&#10;basis for a space given any set of vectors which span the space.&lt;pre&gt;&#10;&amp;gt;&amp;gt; help orth&#10;&lt;p&gt;ORTH Orthogonalization.&#10;Q = orth(A) is an orthonormal basis for the range of A.&#10;Q&amp;rsquo;*Q = I, the columns of Q span the same space as the columns&#10;of A and the number of columns of Q is the rank of A.&lt;/p&gt;&#10;&lt;pre&gt;&lt;code&gt; See also QR, NULL.&amp;lt;/pre&amp;gt;Below is an example of using &amp;lt;tt&amp;gt;orth()&amp;lt;/tt&amp;gt; to orthonormalize a linearly&#10;&lt;/code&gt;&lt;/pre&gt;&#10;&lt;p&gt;independent basis set for &lt;img width="48" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img389.png" alt="$N=3$" /&gt;:&lt;/p&gt;&lt;p&gt;&lt;pre&gt;&#10;% Demonstration of the Matlab function orth() for&#10;% taking a set of vectors and returning an orthonormal set&#10;% which span the same space.&#10;v1 = [1; 2; 3]; % our first basis vector (a column vector)&#10;v2 = [1; -2; 3]; % a second, linearly independent column vector&#10;v1&amp;rsquo; * v2 % show that v1 is not &lt;a href="https://technick.net/guides/theory/dft/orthogonality"&gt;orthogonal&lt;/a&gt; to v2&lt;/p&gt;&#10;&lt;p&gt;ans =&lt;/p&gt;&#10;&lt;pre&gt;&lt;code&gt; 6&#10;&lt;/code&gt;&lt;/pre&gt;&#10;&lt;p&gt;V = [v1,v2] % Each column of V is one of our vectors&lt;/p&gt;&#10;&lt;p&gt;V =&lt;/p&gt;&#10;&lt;pre&gt;&lt;code&gt; 1 1&#10; 2 -2&#10; 3 3&#10;&lt;/code&gt;&lt;/pre&gt;&#10;&lt;p&gt;W = orth(V) % Find an orthonormal basis for the same space&lt;/p&gt;&#10;&lt;p&gt;W =&lt;/p&gt;&#10;&lt;pre&gt;&lt;code&gt;0.2673 0.1690&#10;0.5345 -0.8452&#10;0.8018 0.5071&#10;&lt;/code&gt;&lt;/pre&gt;&#10;&lt;p&gt;w1 = W(:,1) % Break out the returned vectors&lt;/p&gt;&#10;&lt;p&gt;w1 =&lt;/p&gt;&#10;&lt;pre&gt;&lt;code&gt;0.2673&#10;0.5345&#10;0.8018&#10;&lt;/code&gt;&lt;/pre&gt;&#10;&lt;p&gt;w2 = W(:,2)&lt;/p&gt;&#10;&lt;p&gt;w2 =&lt;/p&gt;&#10;&lt;pre&gt;&lt;code&gt;0.1690&#10;&lt;/code&gt;&lt;/pre&gt;&#10;&lt;p&gt;-0.8452&#10;0.5071&lt;/p&gt;&#10;&lt;p&gt;w1&amp;rsquo; * w2 % Check that w1 is orthogonal to w2 (to working precision)&lt;/p&gt;&#10;&lt;p&gt;ans =&lt;/p&gt;&#10;&lt;p&gt;2.5723e-17&lt;/p&gt;&#10;&lt;p&gt;w1&amp;rsquo; * w1 % Also check that the new vectors are unit length in 3D&lt;/p&gt;&#10;&lt;p&gt;ans =&lt;/p&gt;&#10;&lt;pre&gt;&lt;code&gt; 1&#10;&lt;/code&gt;&lt;/pre&gt;&#10;&lt;p&gt;w2&amp;rsquo; * w2&lt;/p&gt;&#10;&lt;p&gt;ans =&lt;/p&gt;&#10;&lt;pre&gt;&lt;code&gt; 1&#10;&lt;/code&gt;&lt;/pre&gt;&#10;&lt;p&gt;W&amp;rsquo; * W % faster way to do the above checks (&lt;a href="https://technick.net/guides/theory/dft/matrix_multiplication"&gt;matrix multiplication&lt;/a&gt;)&lt;/p&gt;&#10;&lt;p&gt;ans =&lt;/p&gt;&#10;&lt;pre&gt;&lt;code&gt;1.0000 0.0000&#10;0.0000 1.0000&#10;&lt;/code&gt;&lt;/pre&gt;&#10;&lt;p&gt;% Construct some vector x in the space spanned by v1 and v2:&#10;x = 2 * v1 - 3 * v2&lt;/p&gt;&#10;&lt;p&gt;x =&lt;/p&gt;&#10;&lt;pre&gt;&lt;code&gt;-1&#10;10&#10;-3&#10;&lt;/code&gt;&lt;/pre&gt;&#10;&lt;p&gt;% Show that x is also some linear combination of w1 and w2:&#10;c1 = x&amp;rsquo; * w1 % Coefficient of projection of x onto w1&lt;/p&gt;&#10;&lt;p&gt;c1 =&lt;/p&gt;&#10;&lt;pre&gt;&lt;code&gt;2.6726&#10;&lt;/code&gt;&lt;/pre&gt;&#10;&lt;p&gt;c2 = x&amp;rsquo; * w2 % Coefficient of projection of x onto w2&lt;/p&gt;&#10;&lt;p&gt;c2 =&lt;/p&gt;&#10;&lt;p&gt;-10.1419&lt;/p&gt;&#10;&lt;p&gt;xw = c1 * w1 + c2 * w2 % Can we make x using w1 and w2?&lt;/p&gt;&#10;&lt;p&gt;xw =&lt;/p&gt;&#10;&lt;p&gt;-1.0000&#10;10.0000&#10;-3.0000&lt;/p&gt;&#10;&lt;p&gt;error = x - xw&lt;/p&gt;&#10;&lt;p&gt;error =&lt;/p&gt;&#10;&lt;p&gt;1.0e-14 *&lt;/p&gt;&#10;&lt;pre&gt;&lt;code&gt;0.1332&#10; 0&#10; 0norm(error) % typical way to summarize a vector error&#10;&lt;/code&gt;&lt;/pre&gt;&#10;&lt;p&gt;ans =&lt;/p&gt;&#10;&lt;p&gt;1.3323e-15&lt;/p&gt;&#10;&lt;p&gt;% It works!&lt;/p&gt;&#10;&lt;p&gt;% Now, construct some vector x NOT in the space spanned by v1 and v2:&#10;y = [1; 0; 0]; % Almost anything we guess in 3D will work&lt;/p&gt;&#10;&lt;p&gt;% Try to express y as a linear combination of w1 and w2:&#10;c1 = y&amp;rsquo; * w1; % Coefficient of projection of y onto w1&#10;c2 = y&amp;rsquo; * w2; % Coefficient of projection of y onto w2&#10;yw = c1 * w1 + c2 * w2 % Can we make y using w1 and w2?&lt;/p&gt;&#10;&lt;p&gt;yw =&lt;/p&gt;&#10;&lt;pre&gt;&lt;code&gt;0.1000&#10;0.0000&#10;0.3000&#10;&lt;/code&gt;&lt;/pre&gt;&#10;&lt;p&gt;yerror = y - yw&lt;/p&gt;&#10;&lt;p&gt;yerror =&lt;/p&gt;&#10;&lt;pre&gt;&lt;code&gt;0.9000&#10;0.0000&#10;&lt;/code&gt;&lt;/pre&gt;&#10;&lt;p&gt;-0.3000&lt;/p&gt;&#10;&lt;p&gt;norm(yerror)&lt;/p&gt;&#10;&lt;p&gt;ans =&lt;/p&gt;&#10;&lt;pre&gt;&lt;code&gt;0.9487&#10;&lt;/code&gt;&lt;/pre&gt;&#10;&lt;p&gt;% While the error is not zero, it is the smallest possible&#10;% error in the least squares sense.&#10;% That is, yw is the optimal least-squares approximation&#10;% to y in the space spanned by v1 and v2 (w1 and w2).&#10;% In other words, norm(yerror) &amp;lt;= norm(y-yw2) for any other vector yw2 made&#10;% using a linear combination of v1 and v2.&lt;br&gt;&#10;% In yet other words, we obtain the optimal least squares approximation&#10;% of y (which lives in 3D) in some subspace W (a 2D subspace of 3D)&#10;% by projecting y orthogonally onto the subspace W to get yw as above.&#10;%&#10;% An important property of the optimal least-squares approximation&#10;% is that the approximation error is orthogonal to the the subspace&#10;% in which the approximation lies. Let&amp;rsquo;s show this:&lt;/p&gt;&#10;&lt;p&gt;W&amp;rsquo; * yerror % must be zero to working precision&lt;/p&gt;&#10;&lt;p&gt;ans =&lt;/p&gt;&#10;&lt;p&gt;1.0e-16 *&lt;/p&gt;&#10;&lt;p&gt;-0.2574&#10;-0.0119&lt;/pre&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/gram_schmidt_orthogonalizat"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;  &lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;  &lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;  &lt;a href="https://technick.net/guides/theory/dft/discrete_fourier_transform"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>The Discrete Fourier Transform (DFT) Derived</title><link>https://technick.net/guides/theory/dft/discrete_fourier_transform/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/discrete_fourier_transform/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/appendix_matlab_examples"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/frequencies_cracks"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00816000000000000000"&gt;The Discrete Fourier Transform (DFT)&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;Given a signal &lt;!-- MATH&#10; $x(\cdot)\in{\cal C}^N$&#10; --&gt;&lt;img width="71" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img947.png" alt="$x(\" dot="" n="" al="" /&gt;, the &lt;i&gt;spectrum&lt;/i&gt;&lt;a name="11460"&gt;&lt;/a&gt; is defined by&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;X(\omega_k) \isdef \left&lt;x,s_k\right&gt; = \sum_{n=0}^{N-1}x(n) \overline{s_k(n)}, \quad k=0,1,2,\ldots,N-1&#10;\end{displaymath}&#10; --&gt;&lt;img width="438" height="62" border="0" src="https://technick.net/img/guide_dft/img948.png" alt="\" egin="" isplaymath="" omega="" isdef="" eft="" t="" s="s" k\right="" t="" um="" n-1="" x="" n="" overline="" s="" n="" uad="" dots="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;or, as is most often written&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\fbox{$\displaystyle X(\omega_k) \isdef \sum_{n=0}^{N-1}x(n) e^{-j\frac{2\pi k n}{N}}, &#10;&#9;\quad k=0,1,2,\ldots,N-1$}&#10;\end{displaymath}&#10; --&gt;&lt;img width="397" height="73" border="0" src="https://technick.net/img/guide_dft/img949.png" alt="\" egin="" isplaymath="" box="" isplaystyle="" mega="" isdef="" um="" n-1="" x="" n="" e="" frac="" i="" n="" uad="" dots="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;That is, the &lt;img width="13" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img53.png" alt="$k$" /&gt;th sample &lt;img width="49" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img684.png" alt="$X(\" mega="" /&gt; of the spectrum of &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; is defined&#10;as the &lt;a href="https://technick.net/guides/theory/dft/inner_product"&gt;inner product&lt;/a&gt; of &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; with the &lt;img width="13" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img53.png" alt="$k$" /&gt;th &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;DFT&lt;/a&gt; &lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;sinusoid&lt;/a&gt; &lt;img width="19" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img66.png" alt="$s_k$" /&gt;. This definition&#10;is &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; times the &lt;i&gt;coefficient of projection&lt;/i&gt;&lt;a name="11471"&gt;&lt;/a&gt; of &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; onto &lt;img width="19" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img66.png" alt="$s_k$" /&gt;, i.e.,&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\frac{\left&lt;x,s_k\right&gt;}{\left\|\,s_k\,\right\|^2} = \frac{X(\omega_k)}{N}&#10;\end{displaymath}&#10; --&gt;&lt;img width="126" height="51" border="0" src="https://technick.net/img/guide_dft/img950.png" alt="\" egin="" isplaymath="" rac="" eft="" t="" s="s" k\right="" t="" eft\vert\="" s="" right\vert="" rac="" omega="" n="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;The projection of &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; onto &lt;img width="19" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img66.png" alt="$s_k$" /&gt; itself is&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;{\cal P}_{s_k}(x) = \frac{X(\omega_k)}{N} s_k&#10;\end{displaymath}&#10; --&gt;&lt;img width="143" height="44" border="0" src="https://technick.net/img/guide_dft/img951.png" alt="\" egin="" isplaymath="" al="" s="" x="" rac="" omega="" n="" s="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;The inverse DFT is simply the sum of the projections:&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;x = \sum_{k=0}^{N-1}\frac{X(\omega_k)}{N} s_k&#10;\end{displaymath}&#10; --&gt;&lt;img width="135" height="62" border="0" src="https://technick.net/img/guide_dft/img952.png" alt="\" egin="" isplaymath="" sum="" k="0}^{N-1}\frac{X(\omega_k)}{N}" s="s" k="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;or, as we normally write,&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\fbox{$\displaystyle x(n) = \frac{1}{N} \sum_{k=0}^{N-1}X(\omega_k) ^{j\frac{2\pi k n}{N}}$}&#10;\end{displaymath}&#10; --&gt;&lt;img width="216" height="74" border="0" src="https://technick.net/img/guide_dft/img953.png" alt="\" egin="" isplaymath="" box="" isplaystyle="" frac="" sum="" n-1="" x="" omega="" k="" j\frac="" i="" n="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;In summary, the DFT is proportional to the set of coefficients of&#10;projection onto the sinusoidal basis set, and the inverse DFT is the&#10;reconstruction of the original signal as a superposition of its &lt;a href="https://technick.net/guides/theory/dft/projection"&gt;sinusoidal&#10;projections&lt;/a&gt;.&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;hr /&gt;&lt;!--Table of Child-Links--&gt;&lt;a name="CHILD_LINKS"&gt;&lt;strong&gt;Subsections&lt;/strong&gt;&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html1825" href="https://technick.net/guides/theory/dft/dft_derived"&gt;The DFT Derived&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html1826" href="https://technick.net/guides/theory/dft/geometric_series"&gt;Geometric Series&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1827" href="https://technick.net/guides/theory/dft/orthogonality_sinusoids"&gt;Orthogonality of Sinusoids&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1828" href="https://technick.net/guides/theory/dft/orthogonality_dft_sinusoids"&gt;Orthogonality of the DFT Sinusoids&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1829" href="https://technick.net/guides/theory/dft/norm_dft_sinusoids"&gt;Norm of the DFT Sinusoids&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1830" href="https://technick.net/guides/theory/dft/orthonormal_sinusoidal_set"&gt;An Orthonormal Sinusoidal Set&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1831" href="https://technick.net/guides/theory/dft/discrete_fourier_transform#SECTION00816000000000000000"&gt;The Discrete Fourier Transform (DFT)&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1832" href="https://technick.net/guides/theory/dft/frequencies_cracks"&gt;Frequencies in the ''Cracks''&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1833" href="https://technick.net/guides/theory/dft/normalized_dft"&gt;Normalized DFT&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1834" href="https://technick.net/guides/theory/dft/length_2_dft"&gt;The Length 2 DFT&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1835" href="https://technick.net/guides/theory/dft/matrix_formulation_dft"&gt;Matrix Formulation of the DFT&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html1836" href="https://technick.net/guides/theory/dft/matrices"&gt;Matrices&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1837" href="https://technick.net/guides/theory/dft/matrix_multiplication"&gt;Matrix Multiplication&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1838" href="https://technick.net/guides/theory/dft/dft_matrix"&gt;The DFT Matrix&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1839" href="https://technick.net/guides/theory/dft/matlab_examples"&gt;Matlab Examples&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html1840" href="https://technick.net/guides/theory/dft/figure_7_2"&gt;Figure&amp;nbsp;7.2&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1841" href="https://technick.net/guides/theory/dft/figure_7_3"&gt;Figure&amp;nbsp;7.3&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1842" href="https://technick.net/guides/theory/dft/dft_matrix"&gt;DFT Matrix&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;/ul&gt;&lt;!--End of Table of Child-Links--&gt;&#10;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/appendix_matlab_examples"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/frequencies_cracks"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>The DFT Derived</title><link>https://technick.net/guides/theory/dft/dft_derived/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/dft_derived/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/discrete_fourier_transform"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/geometric_series"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00810000000000000000"&gt;The DFT Derived&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;In this section, the Discrete Fourier Transform (&lt;a href="https://technick.net/guides/theory/dft/dft"&gt;DFT&lt;/a&gt;) will be derived.&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;hr /&gt;&lt;!--Table of Child-Links--&gt;&lt;a name="CHILD_LINKS"&gt;&lt;strong&gt;Subsections&lt;/strong&gt;&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html1855" href="https://technick.net/guides/theory/dft/geometric_series"&gt;Geometric Series&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1856" href="https://technick.net/guides/theory/dft/orthogonality_sinusoids"&gt;Orthogonality of Sinusoids&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1857" href="https://technick.net/guides/theory/dft/orthogonality_dft_sinusoids"&gt;Orthogonality of the DFT Sinusoids&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1858" href="https://technick.net/guides/theory/dft/norm_dft_sinusoids"&gt;Norm of the DFT Sinusoids&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1859" href="https://technick.net/guides/theory/dft/orthonormal_sinusoidal_set"&gt;An Orthonormal Sinusoidal Set&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1860" href="https://technick.net/guides/theory/dft/discrete_fourier_transform"&gt;The Discrete Fourier Transform (DFT)&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1861" href="https://technick.net/guides/theory/dft/frequencies_cracks"&gt;Frequencies in the ''Cracks''&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1862" href="https://technick.net/guides/theory/dft/normalized_dft"&gt;Normalized DFT&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;!--End of Table of Child-Links--&gt;&#10;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/discrete_fourier_transform"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/geometric_series"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Geometric Series</title><link>https://technick.net/guides/theory/dft/geometric_series/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/geometric_series/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/dft_derived"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/orthogonality_sinusoids"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00811000000000000000"&gt;Geometric Series&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;Recall that for any compex number &lt;!-- MATH&#10; $z_1\in{\cal C}$&#10; --&gt;&lt;img width="47" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img913.png" alt="$z_1\" n="" al="" /&gt;, the signal &lt;!-- MATH&#10; $x(n)\isdef &#10;z_1^n$&#10; --&gt;&lt;img width="73" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img914.png" alt="$x(n)\" sdef="" /&gt;, &lt;!-- MATH&#10; $n=0,1,2,\ldots$&#10; --&gt;&lt;img width="99" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img142.png" alt="$n=0,1,2,\" dots="" /&gt;, defines a &lt;i&gt;geometric sequence&lt;/i&gt;&lt;a name="11401"&gt;&lt;/a&gt;, i.e., each&#10;term is obtained by multiplying the previous term by a (complex) constant.&#10;A &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/geometric_series"&gt;geometric series&lt;/a&gt;&lt;/i&gt;&lt;a name="11403"&gt;&lt;/a&gt; is defined as the &lt;i&gt;sum&lt;/i&gt; of a geometric&#10;sequence:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;S_N(z_1) \isdef \sum_{n=0}^{N-1}z_1^n = 1 + z_1 + z_1^2 + z_1^3 + \cdots + z_1^{N-1}&#10;\end{displaymath}&#10; --&gt;&lt;img width="377" height="62" border="0" src="https://technick.net/img/guide_dft/img915.png" alt="\" egin="" isplaymath="" s="" z="" sdef="" um="" n-1="" z="" n="" z="" cdots="" n-1="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;If &lt;img width="48" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img916.png" alt="$z_1\" eq="" /&gt;, the sum can be expressed in &lt;i&gt;closed form&lt;/i&gt; as&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\fbox{$\displaystyle S_N(z_1) = \frac{1-z_1^N}{1-z_1}$}&#10;\end{displaymath}&#10; --&gt;&lt;img width="147" height="61" border="0" src="https://technick.net/img/guide_dft/img917.png" alt="\" egin="" isplaymath="" box="" isplaystyle="" z="" rac="" n="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;i&gt;Proof:&lt;/i&gt; We have&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;S_N(z_1) &amp;\isdef &amp; 1 + z_1 + z_1^2 + z_1^3 + \cdots + z_1^{N-1} \\&#10;z_1 S_N(z_1) &amp;=&amp; \qquad\!\! z_1 + z_1^2 + z_1^3 + \cdots + z_1^{N-1} + z_1^N \\&#10;\;\Rightarrow \;&#10;S_N(z_1) - z_1 S_N(z_1) &amp;=&amp; 1-z_1^N \\&#10;\;\Rightarrow \;S_N(z_1) &amp;=&amp; \frac{1-z_1^N}{1-z_1}&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="489" height="132" border="0" src="https://technick.net/img/guide_dft/img918.png" alt="\" egin="" qnarray="" s="" z="" sdef="" z="" cdots="" n-1="" n="" ightarrow="" s="" z="" rac="" n="" end="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/dft_derived"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/orthogonality_sinusoids"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Orthogonality of Sinusoids</title><link>https://technick.net/guides/theory/dft/orthogonality_sinusoids/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/orthogonality_sinusoids/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/geometric_series"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/orthogonality_dft_sinusoids"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00812000000000000000"&gt;Orthogonality of Sinusoids&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;&lt;a name="11411"&gt;&lt;/a&gt;A key property of &lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;sinusoids&lt;/a&gt; is that they are &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/orthogonality"&gt;orthogonal&lt;/a&gt; at different&#10;frequencies&lt;/i&gt;. That is, &lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\omega_1 \neq \omega_2 \Rightarrow &#10;&#9;A_1\sin(\omega_1 t + \phi_1) \perp &#10;&#9;A_2\sin(\omega_2 t + \phi_2)&#10;\end{displaymath}&#10; --&gt;&lt;img width="359" height="31" border="0" src="https://technick.net/img/guide_dft/img919.png" alt="\" egin="" isplaymath="" mega="" eq="" mega="" ightarrow="" in="" mega="" phi="" erp="" in="" mega="" phi="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;This is true whether they are complex or real, and whatever &lt;a href="https://technick.net/guides/theory/dft/logarithms"&gt;amplitude&lt;/a&gt; and&#10;phase they may have. All that matters is that the frequencies be&#10;different. Note, however, that the sinusoidal durations &lt;i&gt;must&lt;/i&gt; be&#10;infinity.&lt;p&gt;For length &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; &lt;i&gt;sampled&lt;/i&gt; sinuoidal signal segments, such as used&#10;by the &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;DFT&lt;/a&gt;, exact &lt;a href="https://technick.net/guides/theory/dft/orthogonality"&gt;orthogonality&lt;/a&gt; holds only for the &lt;i&gt;harmonics of&#10;the &lt;a href="https://technick.net/guides/theory/dft/shannon_s_sampling_theorem"&gt;sampling rate&lt;/a&gt; divided by &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt;&lt;/i&gt;, i.e., only over the frequencies&#10;&lt;!-- MATH&#10; $f_k = k f_s / N, k=0,1,2,3,\ldots,N-1$&#10; --&gt;&lt;img width="252" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img920.png" alt="$f_k = k f_s / N, k=0,1,2,3,\" dots="" /&gt;. These are the only&#10;frequencies that have an &lt;i&gt;exact integer number of periods in &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt;samples&lt;/i&gt; (depicted in Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/orthogonality_sinusoids#fig:dftsines"&gt;7.2&lt;/a&gt; for &lt;img width="48" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img22.png" alt="$N=8$" /&gt;).&lt;/p&gt;&lt;p&gt;The complex sinusoids corresponding to the frequencies &lt;img width="20" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img921.png" alt="$f_k$" /&gt; are&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;s_k(n) \isdef e^{j\omega_k nT}, &#10;&#9;\quad \omega_k \isdef k \frac{2\pi}{N}f_s, &#10;&#9;\quad k = 0,1,2,\ldots,N-1&#10;\end{displaymath}&#10; --&gt;&lt;img width="418" height="42" border="0" src="https://technick.net/img/guide_dft/img922.png" alt="\" egin="" isplaymath="" s="" n="" sdef="" omega="" t="" uad="" mega="" isdef="" rac="" i="" f="" s="" uad="" dots="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;These sinusoids are generated by the &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/special_case_mth"&gt;roots of unity&lt;/a&gt;&lt;/i&gt;&lt;a name="11413"&gt;&lt;/a&gt; in the &lt;a href="https://technick.net/guides/theory/dft/complex_plane"&gt;complex plane&lt;/a&gt;:&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;W_N^k \isdef e^{j\omega_k T} \isdef e^{j k 2\pi (f_s/N) T} = e^{j k 2\pi/N}, &#10;&#9;\quad k=0,1,2,\ldots,N-1&#10;\end{displaymath}&#10; --&gt;&lt;img width="478" height="31" border="0" src="https://technick.net/img/guide_dft/img923.png" alt="\" egin="" isplaymath="" n="" isdef="" omega="" isdef="" pi="" s="s" n="" e="" pi="" quad="" dots="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;These are called the &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; roots of unity because each of them satisfies&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\left[W_N^k\right]^N = \left[e^{j\omega_k T}\right]^N &#10;= \left[e^{j k 2\pi/N}\right]^N = e^{j k 2\pi} = 1&#10;\end{displaymath}&#10; --&gt;&lt;img width="354" height="43" border="0" src="https://technick.net/img/guide_dft/img924.png" alt="\" egin="" isplaymath="" eft="" n="" right="" left="" e="" j\omega="" k="" right="" left="" e="" j="" pi="" right="" e="" j="" pi="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;The &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; roots of unity are plotted in the complex plane in Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/orthogonality_sinusoids#fig:dftfreqs"&gt;7.1&lt;/a&gt;for &lt;img width="48" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img22.png" alt="$N=8$" /&gt;. In general, for any &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt;, there will always be a point at &lt;img width="41" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img666.png" alt="$z=1$" /&gt;,&#10;and the points equally subdivide the unit circle. When &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; is even, there&#10;is a point at &lt;img width="54" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img925.png" alt="$z=-1$" /&gt; (corresponding to a sinusoid at exactly half the&#10;sampling rate), while if &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; is odd, there is no point at &lt;img width="54" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img925.png" alt="$z=-1$" /&gt;.&lt;p&gt; &lt;div align="CENTER"&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:dftfreqs"&gt;&lt;/a&gt;&lt;a name="11418"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure 7.1:&lt;/strong&gt;The &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; roots of unity for &lt;img width="48" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img22.png" alt="$N=8$" /&gt;.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; $\scalebox{0.5}{\includegraphics{eps/dftfreqs.eps}}$&#10; --&gt;&lt;img width="291" height="163" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img926.png" alt="\" calebox="" ncludegraphics="" ps="" ftfreqs="" ps="" /&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;&lt;p&gt;The sampled sinusoids corresponding to the &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; roots of unity are plotted&#10;in Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/orthogonality_sinusoids#fig:dftsines"&gt;7.2&lt;/a&gt;. These are the sampled sinusoids &lt;!-- MATH&#10; $(W_N^k)^n = e^{j 2&#10;\pi k n / N} = e^{j\omega_k nT}$&#10; --&gt;&lt;img width="201" height="36" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img927.png" alt="$(W_N^k)^n = e^{j 2&#10;\" i="i" n="" e="" omega="" t="" /&gt; used by the DFT. Note that taking&#10;successively higher integer powers of the point &lt;img width="31" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img928.png" alt="$W_N^k$" /&gt; on the unit circle&lt;i&gt;generates&lt;/i&gt; samples of the &lt;img width="13" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img53.png" alt="$k$" /&gt;th DFT sinusoid, giving &lt;img width="49" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img929.png" alt="$[W_N^k]^n$" /&gt;,&#10;&lt;!-- MATH&#10; $n=0,1,2,\ldots,N-1$&#10; --&gt;&lt;img width="150" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img677.png" alt="$n=0,1,2,\" dots="" /&gt;. The &lt;img width="13" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img53.png" alt="$k$" /&gt;th sinusoid generator &lt;img width="31" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img928.png" alt="$W_N^k$" /&gt; is in turn the&lt;img width="13" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img53.png" alt="$k$" /&gt;th power of the &lt;i&gt;primitive &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt;th root of unity&lt;/i&gt;&lt;a name="11424"&gt;&lt;/a&gt; &lt;!-- MATH&#10; $W_N&#10;\isdef e^{j2\pi/N}$&#10; --&gt;&lt;img width="98" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img930.png" alt="$W_N&#10;\" sdef="" pi="" /&gt;. The notation &lt;img width="31" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img931.png" alt="$W_N$" /&gt;, &lt;img width="31" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img928.png" alt="$W_N^k$" /&gt;, and &lt;img width="37" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img932.png" alt="$W_N^{nk}$" /&gt; are &#10;common in the &lt;a href="http://www.dsptutor.freeuk.com/default.php"&gt;digital signal processing&lt;/a&gt; literature.&lt;/p&gt;&lt;p&gt; &lt;div align="CENTER"&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:dftsines"&gt;&lt;/a&gt;&lt;a name="11429"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure 7.2:&lt;/strong&gt;The &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; complex sinusoids&#10;used by the DFT for &lt;img width="48" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img22.png" alt="$N=8$" /&gt;.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; $\scalebox{0.5}{\includegraphics{eps/dftsines.eps}}$&#10; --&gt;&lt;img width="381" height="313" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img933.png" alt="\" calebox="" ncludegraphics="" ps="" ftsines="" ps="" /&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;&lt;p&gt;Note that in Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/orthogonality_sinusoids#fig:dftsines"&gt;7.2&lt;/a&gt; the range of &lt;img width="13" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img53.png" alt="$k$" /&gt; is taken to be&#10;&lt;!-- MATH&#10; $[-N/2,N/2-1] = [-4,3]$&#10; --&gt;&lt;img width="183" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img934.png" alt="$[-N/2,N/2-1] = [-4,3]$" /&gt; instead of &lt;img width="123" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img935.png" alt="$[0,N-1]=[0,7]$" /&gt;. This is the most&#10;''physical'' choice since it corresponds with our notion of ''&lt;a href="https://technick.net/guides/theory/dft/positive_negative_frequenci"&gt;negative&#10;frequencies&lt;/a&gt;.'' However, we may add any integer multiple of &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; to &lt;img width="13" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img53.png" alt="$k$" /&gt;without changing the sinusoid indexed by &lt;img width="13" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img53.png" alt="$k$" /&gt;. In other words, &lt;img width="61" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img936.png" alt="$k\" m="" /&gt; refers to the same sinusoid for all integer &lt;img width="18" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img937.png" alt="$m$" /&gt;.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/geometric_series"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/orthogonality_dft_sinusoids"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Orthogonality of the DFT Sinusoids</title><link>https://technick.net/guides/theory/dft/orthogonality_dft_sinusoids/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/orthogonality_dft_sinusoids/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/orthogonality_sinusoids"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/norm_dft_sinusoids"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00813000000000000000"&gt;Orthogonality of the DFT Sinusoids&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;We now show mathematically that the &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;DFT&lt;/a&gt; &lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;sinusoids&lt;/a&gt; are exactly &lt;a href="https://technick.net/guides/theory/dft/orthogonality"&gt;orthogonal&lt;/a&gt;.&#10;Let&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;s_k(n) \isdef e^{j\omega_k nT} = e^{j2\pi k n /N}&#10;\end{displaymath}&#10; --&gt;&lt;img width="204" height="31" border="0" src="https://technick.net/img/guide_dft/img938.png" alt="\" egin="" isplaymath="" s="" n="" sdef="" omega="" t="" j2\pi="" n="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;denote the &lt;img width="13" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img53.png" alt="$k$" /&gt;th complex DFT sinusoid. Then&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\left&lt;s_k,s_l\right&gt; \isdef \sum_{n=0}^{N-1}s_k(n) \overline{s_l(n)}&#10;= \sum_{n=0}^{N-1}e^{j2\pi k n /N} e^{-j2\pi l n /N} &#10;= \sum_{n=0}^{N-1}e^{j2\pi (k-l) n /N} &#10;= \frac{1 - e^{j2\pi (k-l)}}{1-e^{j2\pi (k-l)/N}}&#10;\end{displaymath}&#10; --&gt;&lt;img width="675" height="62" border="0" src="https://technick.net/img/guide_dft/img939.png" alt="\" egin="" isplaymath="" eft="" t="" s="" s="s" l\right="" t="" sdef="" um="" n-1="" s="" k="" n="" overline="" l="" n="" rac="" j2\pi="" l="" j2\pi="" l="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where the last step made use of the closed-form expression for the sum of a&lt;a href="https://technick.net/guides/theory/dft/geometric_series"&gt;geometric series&lt;/a&gt;. If &lt;img width="39" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img940.png" alt="$k\" eq="" /&gt;, the denominator is nonzero while the&#10;numerator is zero. This proves&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\fbox{$\displaystyle s_k \perp s_l, \quad k \neq l$}&#10;\end{displaymath}&#10; --&gt;&lt;img width="131" height="36" border="0" src="https://technick.net/img/guide_dft/img941.png" alt="\" egin="" isplaymath="" box="" isplaystyle="" perp="" quad="" eq="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;While we only looked at unit &lt;a href="https://technick.net/guides/theory/dft/logarithms"&gt;amplitude&lt;/a&gt;, zero phase complex sinusoids, as&#10;used by the DFT, it is readily verified that the (nonzero) amplitude and&#10;phase have no effect on &lt;a href="https://technick.net/guides/theory/dft/orthogonality"&gt;orthogonality&lt;/a&gt;.&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/orthogonality_sinusoids"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/norm_dft_sinusoids"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Norm of the DFT Sinusoids</title><link>https://technick.net/guides/theory/dft/norm_dft_sinusoids/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/norm_dft_sinusoids/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/orthogonality_dft_sinusoids"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/orthonormal_sinusoidal_set"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00814000000000000000"&gt;Norm of the DFT Sinusoids&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;For &lt;img width="39" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img942.png" alt="$k=l$" /&gt;, we follow the previous derivation to the next-to-last step to get&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\left&lt;s_k,s_k\right&gt; = \sum_{n=0}^{N-1}e^{j2\pi (k-k) n /N} = N&#10;\end{displaymath}&#10; --&gt;&lt;img width="247" height="62" border="0" src="https://technick.net/img/guide_dft/img943.png" alt="\" egin="" isplaymath="" eft="" t="" s="" s="s" k\right="" t="" um="" n-1="" e="" j2\pi="" k="" n="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;which proves&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\fbox{$\displaystyle \left\|\,s_k\,\right\| = \sqrt{N}$}&#10;\end{displaymath}&#10; --&gt;&lt;img width="107" height="41" border="0" src="https://technick.net/img/guide_dft/img944.png" alt="\" egin="" isplaymath="" box="" isplaystyle="" eft\vert\="" s="" right\vert="\sqrt{N}$}\end{displaymath}" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/orthogonality_dft_sinusoids"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/orthonormal_sinusoidal_set"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>An Orthonormal Sinusoidal Set</title><link>https://technick.net/guides/theory/dft/orthonormal_sinusoidal_set/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/orthonormal_sinusoidal_set/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/norm_dft_sinusoids"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/discrete_fourier_transform"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00815000000000000000"&gt;An Orthonormal Sinusoidal Set&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;We can normalize the &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;DFT&lt;/a&gt; &lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;sinusoids&lt;/a&gt; to obtain an orthonormal set:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\underline{{\tilde s}}_k(n) \isdef \frac{s_k(n)}{\sqrt{N}} = \frac{e^{j2\pi k n /N}}{\sqrt{N}}&#10;\end{displaymath}&#10; --&gt;&lt;img width="203" height="51" border="0" src="https://technick.net/img/guide_dft/img945.png" alt="\" egin="" isplaymath="" nderline="" ilde="" n="" sdef="" rac="" s="" n="" qrt="" frac="" j2\pi="" n="" qrt="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;The orthonormal sinusoidal basis signals satisfy&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\left&lt;\underline{{\tilde s}}_k,\underline{{\tilde s}}_l\right&gt; = \left\{\begin{array}{ll}&#10;&#9;1, &amp; k=l \\&#10;&#9;0, &amp; k\neq l \\&#10;&#9;\end{array}&#10;&#9;\right.&#10;\end{displaymath}&#10; --&gt;&lt;img width="166" height="49" border="0" src="https://technick.net/img/guide_dft/img946.png" alt="\" egin="" isplaymath="" eft="" t="" nderline="" ilde="" underline="" ilde="" righ="" ray="" l="" l="" neq="" nd="" rray="" ight="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;We call these the &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/normalized_dft"&gt;normalized DFT&lt;/a&gt; sinusoids&lt;/i&gt;&lt;a name="11457"&gt;&lt;/a&gt;.&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/norm_dft_sinusoids"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/discrete_fourier_transform"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Frequencies in the \</title><link>https://technick.net/guides/theory/dft/frequencies_cracks/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/frequencies_cracks/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/discrete_fourier_transform"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/normalized_dft"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00817000000000000000"&gt;Frequencies in the ''Cracks''&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;The &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;DFT&lt;/a&gt; is defined only for frequencies &lt;!-- MATH&#10; $\omega_k = 2\pi k f_s/N$&#10; --&gt;&lt;img width="106" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img644.png" alt="$\" mega="" pi="" s="s" n="" /&gt;. If we&#10;are analyzing one or more periods of an exactly periodic signal, where the&#10;period is exactly &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; samples (or some integer divisor of &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt;), then these&#10;really are the only frequencies present in the signal, and the spectrum is&#10;actually zero everywhere but at &lt;!-- MATH&#10; $\omega=\omega_k$&#10; --&gt;&lt;img width="53" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img954.png" alt="$\" mega="\omega_k$" /&gt;. However, we use the&#10;DFT to analyze arbitrary signals from nature. What happens when afrequency &lt;img width="15" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img527.png" alt="$\" mega="" /&gt; is present in a signal &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; that is not one of the&#10;DFT-&lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;sinusoid&lt;/a&gt; freqencies &lt;img width="22" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img681.png" alt="$\" mega="" /&gt;?&lt;/p&gt;&lt;p&gt;To find out, let's project a length &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; segment of a sinusoid at an&#10;arbitrary freqency &lt;img width="15" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img527.png" alt="$\" mega="" /&gt; onto the &lt;img width="13" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img53.png" alt="$k$" /&gt;th DFT sinusoid:&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;x(n) &amp;\isdef &amp; e^{j\omega n T} \\&#10;s_k(n) &amp;\isdef &amp; e^{j\omega_k n T} \\&#10;{\cal P}_{s_k}(x) &amp;=&amp; \frac{\left&lt;x,s_k\right&gt;}{\left&lt;s_k,s_k\right&gt;}s_k \isdef &#10;&#9;\frac{X(\omega_k)}{N}s_k&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="269" height="109" border="0" src="https://technick.net/img/guide_dft/img955.png" alt="\" egin="" qnarray="" n="" sdef="" j\omega="" s="s" k="" isdef="" j\omega="" ht="" t="" eft="" t="" s="" s="s" k\right="" t="" s="" isdef="" rac="" omega="" n="" s="" end="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;The coefficient of projection is proportional to&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;X(\omega_k) &amp; \isdef &amp; \left&lt;x,s_k\right&gt; \isdef \sum_{n=0}^{N-1}x(n) \overline{s_k(n)} \\&#10;&#9;&amp; = &amp; \sum_{n=0}^{N-1}e^{j\omega n T} e^{j-\omega_k n T}&#10;&#9; = \sum_{n=0}^{N-1}e^{j(\omega-\omega_k) n T}&#10;&#9; = \frac{1 - e^{j(\omega-\omega_k) N T}}{1 - e^{j(\omega-\omega_k) T}} \\&#10;&#9;&amp;=&amp; e^{j(\omega-\omega_k) (N-1)T/2}&#10;&#9; \frac{\sin[(\omega-\omega_k)NT/2]}{\sin[(\omega-\omega_k)T/2]}&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="519" height="172" border="0" src="https://technick.net/img/guide_dft/img956.png" alt="\" egin="" qnarray="" omega="" isdef="" eft="" t="" s="s" k\right="" t="" sdef="" um="" n="" frac="" in="" mega-\omega="" nt="" in="" mega-\omega="" t="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;using the closed-form expression for a &lt;a href="https://technick.net/guides/theory/dft/geometric_series"&gt;geometric series&lt;/a&gt; sum. As previously&#10;shown, the sum is &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; at &lt;!-- MATH&#10; $\omega=\omega_k$&#10; --&gt;&lt;img width="53" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img954.png" alt="$\" mega="\omega_k$" /&gt; and zero at &lt;img width="19" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img957.png" alt="$\" mega="" /&gt;, for&lt;img width="39" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img894.png" alt="$l\" eq="" /&gt;. However, the sum is &lt;i&gt;nonzero at all other frequencies&lt;/i&gt;.&lt;p&gt;Since we are only looking at &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; samples, any sinusoidal segment can be&#10;projected onto the &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; DFT sinusoids and be reconstructed exactly by a&#10;linear combination of them. Another way to say this is that the DFT&#10;sinusoids form a &lt;i&gt;basis&lt;/i&gt; for &lt;img width="26" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img745.png" alt="${\" al="" /&gt;, so that any length &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; signal&#10;whatsoever can be expressed as linear combination of them. Therefore, when&#10;analyzing segments of recorded signals, we must interpret what we see&#10;accordingly.&lt;/p&gt;&lt;p&gt;&lt;a name="11496"&gt;&lt;/a&gt;The typical way to think about this in practice is to consider the DFT&#10;operation as a &lt;i&gt;&lt;a href="http://www.dsptutor.freeuk.com/dfilt1.php"&gt;digital filter&lt;/a&gt;&lt;/i&gt;.&lt;a name="tex2html79" href="https://technick.net/guides/theory/dft/footnode#foot11377"&gt;&lt;sup&gt;7.1&lt;/sup&gt;&lt;/a&gt; The &lt;i&gt;frequency&#10;response&lt;/i&gt; of this filter is what we just computed,&lt;a name="tex2html80" href="https://technick.net/guides/theory/dft/footnode#foot11378"&gt;&lt;sup&gt;7.2&lt;/sup&gt;&lt;/a&gt; and its magnitude is&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\left|X(\omega_k)\right| = &#10;&#9;\left|\frac{\sin[(\omega-\omega_k)NT/2]}{\sin[(\omega-\omega_k)T/2]}\right|&#10;\end{displaymath}&#10; --&gt;&lt;img width="239" height="49" border="0" src="https://technick.net/img/guide_dft/img960.png" alt="\" egin="" isplaymath="" eft\vert="" mega="" right\vert="\left\vert\frac{\sin[(\omega-\omega_k)NT/2]}{\sin[(\omega-\omega_k)T/2]}\right\vert" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;(shown in Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/frequencies_cracks#fig:dftfilter"&gt;7.3&lt;/a&gt;a for &lt;img width="63" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img961.png" alt="$k=N/4$" /&gt;). At all other integer values of&lt;img width="13" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img53.png" alt="$k$" /&gt;, the response is the same but shifted (circularly) left or right so&#10;that the peak is centered on &lt;img width="22" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img681.png" alt="$\" mega="" /&gt;. The secondary peaks away from&lt;img width="22" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img681.png" alt="$\" mega="" /&gt; are called &lt;i&gt;sidelobes&lt;/i&gt;&lt;a name="11505"&gt;&lt;/a&gt; of the DFT response, while the main&#10;peak may be called the &lt;i&gt;main lobe&lt;/i&gt;&lt;a name="11507"&gt;&lt;/a&gt; of the response. Since we are&#10;normally most interested in spectra from an audio perspective, the same&#10;plot is repeated using a &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/decibels"&gt;decibel&lt;/a&gt;&lt;/i&gt; vertical scale in Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/frequencies_cracks#fig:dftfilter"&gt;7.3&lt;/a&gt;b&#10;(clipped at &lt;img width="32" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img962.png" alt="$-60$" /&gt; &lt;a href="https://technick.net/guides/theory/dft/decibels"&gt;dB&lt;/a&gt;). We see that the sidelobes are really quite high&#10;from an audio perspective. Sinusoids with frequencies near &lt;!-- MATH&#10; $\omega_{k\pm&#10;1.5}$&#10; --&gt;&lt;img width="48" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img963.png" alt="$\" mega="" pm="" /&gt;, for example, are only attenuated approximately &lt;img width="20" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img964.png" alt="$13$" /&gt; dB in the DFT&#10;output &lt;img width="49" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img684.png" alt="$X(\" mega="" /&gt;.&lt;p&gt; &lt;div align="CENTER"&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:dftfilter"&gt;&lt;/a&gt;&lt;a name="11512"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure 7.3:&lt;/strong&gt;Frequency response magnitude of a single DFT output sample.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; $\scalebox{0.5}{\includegraphics{eps/dftfilter.eps}}$&#10; --&gt;&lt;img width="460" height="345" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img965.png" alt="\" calebox="" ncludegraphics="" ps="" ftfilter="" ps="" /&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;&lt;p&gt;We see that &lt;img width="49" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img684.png" alt="$X(\" mega="" /&gt; is sensitive to &lt;i&gt;all&lt;/i&gt; frequencies between dc&#10;and the &lt;a href="https://technick.net/guides/theory/dft/shannon_s_sampling_theorem"&gt;sampling rate&lt;/a&gt; &lt;i&gt;except&lt;/i&gt; the other DFT-sinusoid frequencies&lt;img width="19" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img957.png" alt="$\" mega="" /&gt; for &lt;img width="39" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img894.png" alt="$l\" eq="" /&gt;. This is sometimes called &lt;i&gt;spectral leakage&lt;/i&gt;&lt;a name="11518"&gt;&lt;/a&gt;or &lt;i&gt;cross-talk&lt;/i&gt;&lt;a name="11520"&gt;&lt;/a&gt; in the &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;spectrum analysis&lt;/a&gt;. Again, there is &lt;i&gt;no&#10;error&lt;/i&gt; when the signal being analyzed is truly periodic and we can choose&lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; to be exactly a period, or some multiple of a period. Normally,&#10;however, this cannot be easily arranged, and spectral leakage can really&#10;become a problem.&lt;/p&gt;&lt;p&gt;Note that spectral leakage is not reduced by increasing &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt;. It can be&#10;thought of as being caused by abruptly &lt;i&gt;truncating&lt;/i&gt; a sinusoid at the&#10;beginning and/or end of the &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt;-sample time window. Only the DFT sinusoids&#10;are not cut off at the window boundaries. All other frequencies will&#10;suffer some truncation distortion, and the spectral content of the abrupt&#10;cut-off or turn-on transient can be viewed as the source of the sidelobes.&#10;Remember that, as far as the DFT is concerned, the input signal &lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img50.png" alt="$x(n)$" /&gt; is&#10;the same as its &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/modulo_indexing_periodic"&gt;periodic extension&lt;/a&gt;&lt;/i&gt;&lt;a name="11522"&gt;&lt;/a&gt;. If we repeat &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; samples of a&#10;sinusoid at frequency &lt;!-- MATH&#10; $\omega\neq \omega_k$&#10; --&gt;&lt;img width="53" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img966.png" alt="$\" mega\neq="" mega="" /&gt;, there will be a ''glitch''&#10;every &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; samples since the signal is not periodic in &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; samples. This&#10;glitch can be considered a source of new energy over the entire spectrum.&lt;/p&gt;&lt;p&gt;To reduce spectral leakage (cross-talk from far-away&#10;frequencies), we typically use a &lt;i&gt;window&lt;/i&gt;&lt;a name="11524"&gt;&lt;/a&gt; function, such as a&#10;''raised cosine'' window, to &lt;i&gt;taper&lt;/i&gt; the data record gracefully&#10;to zero at both endpoints of the window. As a result of the smooth&#10;tapering, the &lt;i&gt;main lobe widens&lt;/i&gt; and the &lt;i&gt;sidelobes&#10;decrease&lt;/i&gt; in the DFT response. Using no window is better viewed as&#10;using a &lt;i&gt;rectangular window&lt;/i&gt;&lt;a name="11526"&gt;&lt;/a&gt; of length &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt;, unless the signal is&#10;exactly periodic in &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; samples. These topics are considered further&#10;in Music 420 and in the ''Examples using the DFT'' chapter.&lt;/p&gt;&lt;p&gt;Since the &lt;img width="13" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img53.png" alt="$k$" /&gt;th spectral sample &lt;img width="49" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img684.png" alt="$X(\" mega="" /&gt; is properly regarded as&#10;primarily a measure of spectral &lt;a href="https://technick.net/guides/theory/dft/logarithms"&gt;amplitude&lt;/a&gt; over the &lt;i&gt;range&lt;/i&gt;&lt;img width="56" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img967.png" alt="$k-1/2$" /&gt; to &lt;img width="56" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img968.png" alt="$k+1/2$" /&gt;, this range is sometimes called a &lt;i&gt;frequency&#10;bin&lt;/i&gt;&lt;a name="11528"&gt;&lt;/a&gt; (as in a ''storage bin'' for spectral energy). The frequency&#10;index &lt;img width="13" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img53.png" alt="$k$" /&gt; is called the &lt;i&gt;bin number&lt;/i&gt;&lt;a name="11530"&gt;&lt;/a&gt;, and &lt;!-- MATH&#10; $\left|X(\omega_k)\right|^2$&#10; --&gt;&lt;img width="65" height="38" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img969.png" alt="$\" eft\vert="" mega="" right\vert="" /&gt;can be regarded as the total energy in the &lt;img width="13" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img53.png" alt="$k$" /&gt;th bin (see &lt;a href="https://technick.net/guides/theory/dft/rayleigh_energy_theorem"&gt;Parseval's&#10;Theorem&lt;/a&gt; in the ''&lt;a href="https://technick.net/guides/theory/dft/fourier_theorems"&gt;Fourier Theorems&lt;/a&gt;'' chapter). Similar remarks apply to&#10;samples of any continuous bandlimited function; however, the term&#10;''bin'' is only used in the frequency domain, even though it could be&#10;assigned exactly the same meaning mathematically in the time domain.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/discrete_fourier_transform"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/normalized_dft"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Normalized DFT</title><link>https://technick.net/guides/theory/dft/normalized_dft/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/normalized_dft/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/frequencies_cracks"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/length_2_dft"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00818000000000000000"&gt;Normalized DFT&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;A more ''theoretically clean'' &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;DFT&lt;/a&gt; is obtained by projecting onto the&lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/normalized_dft"&gt;normalized DFT&lt;/a&gt; &lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;sinusoids&lt;/a&gt;&lt;/i&gt;&lt;a name="11532"&gt;&lt;/a&gt;&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;{\tilde s}_k(n) \isdef \frac{e^{j2\pi k n/N}}{\sqrt{N}}&#10;\end{displaymath}&#10; --&gt;&lt;img width="134" height="51" border="0" src="https://technick.net/img/guide_dft/img970.png" alt="\" egin="" isplaymath="" ilde="" n="" sdef="" rac="" j2\pi="" n="" qrt="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;In this case, the normalized DFT of &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; is &lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;{\tilde X}(\omega_k) \isdef \left&lt;x,{\tilde s}_k\right&gt; = \frac{1}{\sqrt{N}}\sum_{n=0}^{N-1}x(n) e^{-j2\pi k n/N}&#10;\end{displaymath}&#10; --&gt;&lt;img width="326" height="62" border="0" src="https://technick.net/img/guide_dft/img971.png" alt="\" egin="" isplaymath="" ilde="" mega="" isdef="" eft="" t="" tilde="" right="" t="" rac="" qrt="" sum="" n-1="" x="" n="" e="" pi="" n="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;which is also precisely the coefficient of projection of &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; onto &lt;img width="19" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img972.png" alt="${\" ilde="" /&gt;.&#10;The inverse normalized DFT is then more simply&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;x(n) = \sum_{k=0}^{N-1}X(\omega_k) {\tilde s}_k(n) &#10;&#9;= \frac{1}{\sqrt{N}}\sum_{k=0}^{N-1}X(\omega_k)e^{j2\pi k n/N}&#10;\end{displaymath}&#10; --&gt;&lt;img width="390" height="62" border="0" src="https://technick.net/img/guide_dft/img973.png" alt="\" egin="" isplaymath="" n="" um="" n-1="" x="" omega="" k="" tilde="" n="" rac="" qrt="" sum="" n-1="" x="" omega="" k="" e="" j2\pi="" n="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;While this definition is much cleaner from a ''&lt;a href="https://technick.net/guides/theory/dft/geometric_signal_theory"&gt;geometric signal theory&lt;/a&gt;''&#10;point of view, it is rarely used in practice since it requires more&#10;computation than the typical definition. However, note that the only&#10;difference between the forward and inverse transforms in this case&#10;is the sign of the exponent in the kernel.&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/frequencies_cracks"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/length_2_dft"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>The Length 2 DFT</title><link>https://technick.net/guides/theory/dft/length_2_dft/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/length_2_dft/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/normalized_dft"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/matrix_formulation_dft"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00820000000000000000"&gt;The Length 2 DFT&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;The length &lt;img width="12" height="13" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img76.png" alt="$2$" /&gt; &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;DFT&lt;/a&gt; is particularly simple, since the basis&lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;sinusoids&lt;/a&gt; are real:&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;\underline{s}_0 &amp;=&amp; (1,1) \\&#10;\underline{s}_1 &amp;=&amp; (1,-1)&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="116" height="57" border="0" src="https://technick.net/img/guide_dft/img974.png" alt="\" egin="" qnarray="" nderline="" s="" nderline="" s="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;The DFT sinusoid &lt;!-- MATH&#10; $\underline{s}_0$&#10; --&gt;&lt;img width="19" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img842.png" alt="$\" nderline="" s="" /&gt; is a sampled constant signal, while &lt;!-- MATH&#10; $\underline{s}_1$&#10; --&gt;&lt;img width="19" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img844.png" alt="$\" nderline="" s="" /&gt; is a&#10;sampled sinusoid at half the &lt;a href="https://technick.net/guides/theory/dft/shannon_s_sampling_theorem"&gt;sampling rate&lt;/a&gt;.&lt;p&gt;Figure&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/length_2_dft#fig:dft2"&gt;7.4&lt;/a&gt; illustrates the graphical relationships for the length&lt;img width="12" height="13" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img76.png" alt="$2$" /&gt; DFT of the signal &lt;!-- MATH&#10; $\underline{x}=[6,2]$&#10; --&gt;&lt;img width="66" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img975.png" alt="$\" nderline="" /&gt;. &lt;/p&gt;&lt;p&gt; &lt;div align="CENTER"&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:dft2"&gt;&lt;/a&gt;&lt;a name="11555"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure 7.4:&lt;/strong&gt;Graphical interpretation of the &lt;a href="https://technick.net/guides/theory/dft/length_2_dft"&gt;length 2 DFT&lt;/a&gt;.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; $\scalebox{0.5}{\includegraphics{eps/dft2.eps}}$&#10; --&gt;&lt;img width="360" height="320" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img976.png" alt="\" calebox="" ncludegraphics="" ps="" ft2="" ps="" /&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;&lt;p&gt;Analytically, we compute the DFT to be&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;X(\omega_0) &amp;\isdef &amp; {\cal P}_{\underline{s}_0}(\underline{x}) \isdef &#10;\frac{\left&lt;\underline{x},\underline{s}_0\right&gt;}{\left&lt;\underline{s}_0,\underline{s}_0\right&gt;} \underline{s}_0 = &#10;\frac{6\cdot 1 + 2 \cdot 1}{1^2 + 1^2} \underline{s}_0 = 4 \underline{s}_0 = (4,4)\\&#10;X(\omega_1) &amp;\isdef &amp; {\cal P}_{\underline{s}_1}(\underline{x}) \isdef &#10;\frac{\left&lt;\underline{x},\underline{s}_1\right&gt;}{\left&lt;\underline{s}_1,\underline{s}_1\right&gt;} \underline{s}_1 = &#10;\frac{6\cdot 1 + 2 \cdot (-1)}{1^2 + (-1)^2} \underline{s}_0 = 2 \underline{s}_1 = (2,-2)&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="521" height="97" border="0" src="https://technick.net/img/guide_dft/img977.png" alt="\" egin="" qnarray="" omega="" sdef="" al="" nderline="" s="" nderline="" underline="" s="" nderline="" s="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Note the lines of &lt;a href="https://technick.net/guides/theory/dft/projection"&gt;orthogonal projection&lt;/a&gt; illustrated in the figure. The&#10;''time domain'' basis consists of the vectors &lt;!-- MATH&#10; $\{\underline{e}_0,\underline{e}_1\}$&#10; --&gt;&lt;img width="56" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img978.png" alt="$\" underline="" underline="" /&gt;, and the&lt;a href="https://technick.net/guides/theory/dft/orthogonality"&gt;orthogonal&lt;/a&gt; projections onto them are simply the coordinate projections&lt;img width="39" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img979.png" alt="$(6,0)$" /&gt; and &lt;img width="39" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img980.png" alt="$(0,2)$" /&gt;. The ''frequency domain'' basis vectors are &lt;!-- MATH&#10; $\{\underline{s}_0,&#10;\underline{s}_1\}$&#10; --&gt;&lt;img width="56" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img981.png" alt="$\" underline="" s="" nderline="" s="" /&gt;, and they provide an orthogonal basis set which is &lt;i&gt;rotated&lt;img width="20" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img982.png" alt="$45$" /&gt; degrees&lt;/i&gt; relative to the time-domain basis vectors. Projecting&#10;orthogonally onto them gives &lt;!-- MATH&#10; $X(\omega_0) = (4,4)$&#10; --&gt;&lt;img width="104" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img983.png" alt="$X(\" mega="" /&gt; and&#10;&lt;!-- MATH&#10; $X(\omega_1)=(2,-2)$&#10; --&gt;&lt;img width="117" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img984.png" alt="$X(\" mega="" /&gt;, respectively. The original signal &lt;img width="13" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img21.png" alt="$\" nderline="" /&gt; can be&#10;expressed as the vector sum of its coordinate projections (a time-domain&#10;representation), or as the vector sum of its projections onto the DFT&#10;sinusoids (a frequency-domain representation). Computing the coefficients&#10;of projection is essentially ''taking the DFT'' and constructing &lt;img width="13" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img21.png" alt="$\" nderline="" /&gt;as the vector sum of its projections onto the DFT sinusoids amounts&#10;to ''taking the inverse DFT.''&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/normalized_dft"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/matrix_formulation_dft"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Matrix Formulation of the DFT</title><link>https://technick.net/guides/theory/dft/matrix_formulation_dft/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/matrix_formulation_dft/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/length_2_dft"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/matrices"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00830000000000000000"&gt;Matrix Formulation of the DFT&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;The &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;DFT&lt;/a&gt; can be formulated as a complex &lt;a href="https://technick.net/guides/theory/dft/matrix_multiplication"&gt;matrix multiply&lt;/a&gt;.&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;hr /&gt;&lt;!--Table of Child-Links--&gt;&lt;a name="CHILD_LINKS"&gt;&lt;strong&gt;Subsections&lt;/strong&gt;&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html1971" href="https://technick.net/guides/theory/dft/matrices"&gt;Matrices&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1972" href="https://technick.net/guides/theory/dft/matrix_multiplication"&gt;Matrix Multiplication&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html1973" href="https://technick.net/guides/theory/dft/dft_matrix"&gt;The DFT Matrix&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;!--End of Table of Child-Links--&gt;&#10;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/length_2_dft"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/matrices"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Matrices</title><link>https://technick.net/guides/theory/dft/matrices/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/matrices/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/matrix_formulation_dft"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/matrix_multiplication"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00831000000000000000"&gt;Matrices&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;A &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/matrices"&gt;matrix&lt;/a&gt;&lt;/i&gt;&lt;a name="11589"&gt;&lt;/a&gt; is defined as a rectangular array of numbers, e.g., &lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;A = \left[\begin{array}{cc} a &amp; b \\c &amp; d \end{array}\right]&#10;\end{displaymath}&#10; --&gt;&lt;img width="104" height="49" border="0" src="https://technick.net/img/guide_dft/img985.png" alt="\" egin="" isplaymath="" left="" begin="" array="" cc="" a="a" b="b" c="" end="" rray="" ight="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;which is a &lt;img width="39" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img986.png" alt="$2\" imes2="" /&gt; (''two by two'') matrix. A general matrix may&#10;be &lt;img width="55" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img987.png" alt="$M\" imes="" /&gt;, where &lt;img width="21" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img201.png" alt="$M$" /&gt; is the number of &lt;i&gt;rows&lt;/i&gt;&lt;a name="11594"&gt;&lt;/a&gt;,&#10;and &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; is the number of &lt;i&gt;columns&lt;/i&gt;&lt;a name="11596"&gt;&lt;/a&gt;.&#10;For example, the general &lt;img width="39" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img988.png" alt="$3\" imes="" /&gt; matrix is&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\left[\begin{array}{cc} a &amp; b \\c &amp; d \\e &amp; f \end{array}\right]&#10;\end{displaymath}&#10; --&gt;&lt;img width="68" height="71" border="0" src="https://technick.net/img/guide_dft/img989.png" alt="\" egin="" isplaymath="" eft="" egin="" rray="" c="" a="" b="" d="" f="" nd="" rray="" ight="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;(Either square brackets or large parentheses may be used.) The&lt;img width="36" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img990.png" alt="$(i,j)$" /&gt;th element&lt;a name="tex2html83" href="https://technick.net/guides/theory/dft/footnode#foot11388"&gt;&lt;sup&gt;7.3&lt;/sup&gt;&lt;/a&gt; of a&#10;matrix &lt;img width="16" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img485.png" alt="$A$" /&gt; may be denoted by &lt;img width="45" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img991.png" alt="$A[i,j]$" /&gt; or &lt;img width="49" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img992.png" alt="$A(i,j)$" /&gt;. The rows and&#10;columns of &lt;a href="https://technick.net/guides/theory/dft/matrices"&gt;matrices&lt;/a&gt; are normally numbered from &lt;img width="12" height="13" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img78.png" alt="$1$" /&gt; instead of from&lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img38.png" alt="$0$" /&gt;; thus, &lt;!-- MATH&#10; $1\leq i \leq M$&#10; --&gt;&lt;img width="77" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img993.png" alt="$1\" eq="" eq="" /&gt; and &lt;!-- MATH&#10; $1\leq j \leq N$&#10; --&gt;&lt;img width="76" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img994.png" alt="$1\" eq="" eq="" /&gt;. When &lt;img width="57" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img995.png" alt="$N=M$" /&gt;, the&#10;matrix is said to be &lt;i&gt;square&lt;/i&gt;&lt;a name="11598"&gt;&lt;/a&gt;.&lt;p&gt;The &lt;i&gt;transpose&lt;/i&gt;&lt;a name="11600"&gt;&lt;/a&gt; of a real matrix&#10;&lt;!-- MATH&#10; $A\in{\cal R}^{M\times N}$&#10; --&gt;&lt;img width="84" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img996.png" alt="$A\" n="" al="" times="" /&gt; is denoted by &lt;!-- MATH&#10; ${A}^{\hbox{\tiny T}}$&#10; --&gt;&lt;img width="25" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img997.png" alt="${A}^{\" box="" iny="" /&gt; and is defined by&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;{A}^{\hbox{\tiny T}}[i,j] \isdef A[j,i]&#10;\end{displaymath}&#10; --&gt;&lt;img width="120" height="31" border="0" src="https://technick.net/img/guide_dft/img998.png" alt="\" egin="" isplaymath="" a="" box="" iny="" i="" isdef="" i="i" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Note that while &lt;img width="16" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img485.png" alt="$A$" /&gt; is &lt;img width="55" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img987.png" alt="$M\" imes="" /&gt;, its transpose is &lt;img width="55" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img999.png" alt="$N\" imes="" /&gt;.&lt;p&gt;A &lt;i&gt;complex matrix&lt;/i&gt;&lt;a name="11609"&gt;&lt;/a&gt; &lt;!-- MATH&#10; $A\in{\cal C}^{M\times N}$&#10; --&gt;&lt;img width="80" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1000.png" alt="$A\" n="" al="" times="" /&gt;, is simply a&#10;matrix containing &lt;a href="https://technick.net/guides/theory/dft/introduction_complex_number"&gt;complex numbers&lt;/a&gt;. The &lt;i&gt;transpose&lt;/i&gt;&lt;a name="11612"&gt;&lt;/a&gt; of a complex matrix is normally defined to include&lt;i&gt;conjugation&lt;/i&gt;. The conjugating transpose operation is called the&lt;i&gt;Hermitian transpose&lt;/i&gt;&lt;a name="11614"&gt;&lt;/a&gt;. To avoid confusion, in this tutorial,&#10;&lt;!-- MATH&#10; ${A}^{\hbox{\tiny T}}$&#10; --&gt;&lt;img width="25" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img997.png" alt="${A}^{\" box="" iny="" /&gt; and the word ''transpose'' will always denote transposition&lt;i&gt;without&lt;/i&gt; conjugation, while conjugating transposition will be&#10;denoted by &lt;img width="23" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1001.png" alt="${A}^{\" st="" /&gt; and be called the ''Hermitian transpose'' or the&#10;''conjugate transpose.'' Thus,&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;{A}^{\ast }[i,j] \isdef \overline{A[j,i]}&#10;\end{displaymath}&#10; --&gt;&lt;img width="120" height="31" border="0" src="https://technick.net/img/guide_dft/img1002.png" alt="\" egin="" isplaymath="" a="" st="" i="" isdef="" verline="" a="" i="i" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;b&gt;Example:&lt;/b&gt; The transpose of the general &lt;img width="39" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img988.png" alt="$3\" imes="" /&gt; matrix is&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;{\left[\begin{array}{cc} a &amp; b \\c &amp; d \\e &amp; f \end{array}\right]}^{\hbox{\tiny T}}&#10;=&#10;\left[\begin{array}{ccc} a &amp; c &amp; e \\b &amp; d &amp; f \end{array}\right]&#10;\end{displaymath}&#10; --&gt;&lt;img width="201" height="72" border="0" src="https://technick.net/img/guide_dft/img1003.png" alt="\" egin="" isplaymath="" eft="" egin="" rray="" c="" a="" b="" d="" f="" nd="" rray="" begin="" rray="" cc="" a="" e="" b="" f="" nd="" rray="" ight="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;while the conjugate transpose of the general &lt;img width="39" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img988.png" alt="$3\" imes="" /&gt; matrix is&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;{\left[\begin{array}{cc} a &amp; b \\c &amp; d \\e &amp; f \end{array}\right]}^{\ast }&#10;=&#10;\left[\begin{array}{ccc} \overline{a} &amp; \overline{c} &amp; \overline{e }\\&#10;&#9;&#9;&#9; \overline{b} &amp; \overline{d} &amp; \overline{f }\end{array}\right]&#10;\end{displaymath}&#10; --&gt;&lt;img width="201" height="72" border="0" src="https://technick.net/img/guide_dft/img1004.png" alt="\" egin="" isplaymath="" eft="" egin="" rray="" c="" a="" b="" d="" f="" nd="" rray="" verline="" b="" verline="" overline="" end="" rray="" ight="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;A &lt;i&gt;column-vector&lt;/i&gt;&lt;a name="11641"&gt;&lt;/a&gt;&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\underline{x}= \left[\begin{array}{c} x_0 \\x_1 \end{array}\right]&#10;\end{displaymath}&#10; --&gt;&lt;img width="84" height="49" border="0" src="https://technick.net/img/guide_dft/img1005.png" alt="\" egin="" isplaymath="" nderline="" left="" egin="" rray="" x="" end="" rray="" ight="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;is the special case of an &lt;img width="49" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1006.png" alt="$M\" imes="" /&gt; matrix, and a &lt;i&gt;row-vector&lt;/i&gt;&lt;a name="11647"&gt;&lt;/a&gt;&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;{\underline{x}}^{\hbox{\tiny T}} = [x_0\; x_1]&#10;\end{displaymath}&#10; --&gt;&lt;img width="91" height="31" border="0" src="https://technick.net/img/guide_dft/img1007.png" alt="\" egin="" isplaymath="" nderline="" hbox="" iny="" x="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;(as we have been using) is a &lt;img width="46" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1008.png" alt="$1\" imes="" /&gt; matrix. In contexts where&#10;matrices are being used (only this section for this course), it is best to&#10;define all vectors as &lt;i&gt;column vectors&lt;/i&gt; and to indicate row vectors&#10;using the transpose notation, as was done in the equation above.&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/matrix_formulation_dft"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/matrix_multiplication"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Matrix Multiplication</title><link>https://technick.net/guides/theory/dft/matrix_multiplication/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/matrix_multiplication/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/matrices"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_matrix"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00832000000000000000"&gt;Matrix Multiplication&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;Let &lt;!-- MATH&#10; ${A}^{\hbox{\tiny T}}$&#10; --&gt;&lt;img width="25" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img997.png" alt="${A}^{\" box="" iny="" /&gt; be a general &lt;img width="52" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1009.png" alt="$M\" imes="" /&gt; &lt;a href="https://technick.net/guides/theory/dft/matrices"&gt;matrix&lt;/a&gt; and let &lt;img width="17" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img441.png" alt="$B$" /&gt; denote a general&lt;img width="49" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1010.png" alt="$L\" imes="" /&gt; matrix. Denote the &lt;a href="https://technick.net/guides/theory/dft/matrix_multiplication"&gt;matrix product&lt;/a&gt; by &lt;!-- MATH&#10; $C={A}^{\hbox{\tiny T}}B$&#10; --&gt;&lt;img width="71" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1011.png" alt="$C={A}^{\" box="" iny="" b="" /&gt; or &lt;!-- MATH&#10; $C={A}^{\hbox{\tiny T}}\cdot&#10;B$&#10; --&gt;&lt;img width="83" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1012.png" alt="$C={A}^{\" box="" iny="" dot="" /&gt;. Then &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/matrix_multiplication"&gt;matrix multiplication&lt;/a&gt;&lt;/i&gt;&lt;a name="11662"&gt;&lt;/a&gt; is carried out by computing the &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/inner_product"&gt;inner product&lt;/a&gt;&lt;/i&gt; of every row of &lt;!-- MATH&#10; ${A}^{\hbox{\tiny T}}$&#10; --&gt;&lt;img width="25" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img997.png" alt="${A}^{\" box="" iny="" /&gt; with every column of &lt;img width="17" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img441.png" alt="$B$" /&gt;. Let the&lt;img width="10" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img136.png" alt="$i$" /&gt;th row of &lt;!-- MATH&#10; ${A}^{\hbox{\tiny T}}$&#10; --&gt;&lt;img width="25" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img997.png" alt="${A}^{\" box="" iny="" /&gt; be denoted by &lt;!-- MATH&#10; ${\underline{a}}^{\hbox{\tiny T}}_i$&#10; --&gt;&lt;img width="21" height="30" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1013.png" alt="${\" nderline="" a="" box="" iny="" i="" /&gt;, &lt;!-- MATH&#10; $i=1, 2,\ldots,M$&#10; --&gt;&lt;img width="106" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1014.png" alt="$i=1, 2,\" dots="" /&gt;, and the&lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img63.png" alt="$j$" /&gt;th column of &lt;img width="17" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img441.png" alt="$B$" /&gt; by &lt;!-- MATH&#10; $\underline{b}_j$&#10; --&gt;&lt;img width="18" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1015.png" alt="$\" nderline="" b="" /&gt;, &lt;!-- MATH&#10; $j=1,2,\ldots,L$&#10; --&gt;&lt;img width="102" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1016.png" alt="$j=1,2,\" dots="" /&gt;. Then the matrix product&#10;&lt;!-- MATH&#10; $C={A}^{\hbox{\tiny T}}B$&#10; --&gt;&lt;img width="71" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1011.png" alt="$C={A}^{\" box="" iny="" b="" /&gt; is defined as&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;C = {A}^{\hbox{\tiny T}}B = \left[\begin{array}{cccc} &#10;&lt;{\underline{a}}^{\hbox{\tiny T}}_1,\underline{b}_1&gt; &amp; &lt;{\underline{a}}^{\hbox{\tiny T}}_1,\underline{b}_2&gt; &amp; \cdots &amp; &lt;{\underline{a}}^{\hbox{\tiny T}}_1,\underline{b}_N&gt; \\&#10;&lt;{\underline{a}}^{\hbox{\tiny T}}_2,\underline{b}_1&gt; &amp; &lt;{\underline{a}}^{\hbox{\tiny T}}_2,\underline{b}_2&gt; &amp; \cdots &amp; &lt;{\underline{a}}^{\hbox{\tiny T}}_2,\underline{b}_N&gt; \\&#10;\vdots &amp; \vdots &amp; \cdots &amp; \vdots \\&#10;&lt;{\underline{a}}^{\hbox{\tiny T}}_M,\underline{b}_1&gt; &amp; &lt;{\underline{a}}^{\hbox{\tiny T}}_M,\underline{b}_2&gt; &amp; \cdots &amp; &lt;{\underline{a}}^{\hbox{\tiny T}}_M,\underline{b}_N&gt;&#10;\end{array}\right]&#10;\end{displaymath}&#10; --&gt;&lt;img width="467" height="103" border="0" src="https://technick.net/img/guide_dft/img1017.png" alt="\" egin="" isplaymath="" a="" hbox="" tiny="" b="\left[\begin{array}{cccc}" lt="" n="" ne="" a="" box="" iny="" underline="" b="" gt="" nd="" rray="" ight="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;This definition can be extended to &lt;i&gt;complex&lt;/i&gt; &lt;a href="https://technick.net/guides/theory/dft/matrices"&gt;matrices&lt;/a&gt; by using a&#10;definition of inner product which does not conjugate its second&#10;argument.&lt;a name="tex2html84" href="https://technick.net/guides/theory/dft/footnode#foot11391"&gt;&lt;sup&gt;7.4&lt;/sup&gt;&lt;/a&gt;&lt;p&gt;&lt;b&gt;Examples:&lt;/b&gt;&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\left[\begin{array}{cc} a &amp; b \\c &amp; d \\e &amp; f \end{array}\right]&#10;\cdot&#10;\left[\begin{array}{cc} \alpha &amp; \beta \\\gamma &amp; \delta \end{array}\right]&#10;=&#10;\left[\begin{array}{cc} &#10;a\alpha+b\gamma &amp; a\beta+b\delta \\&#10;c\alpha+d\gamma &amp; c\beta+d\delta \\&#10;e\alpha+f\gamma &amp; e\beta+f\delta&#10;\end{array}\right]&#10;\end{displaymath}&#10; --&gt;&lt;img width="360" height="71" border="0" src="https://technick.net/img/guide_dft/img1019.png" alt="\" egin="" isplaymath="" eft="" egin="" rray="" c="" a="" b="" d="" f="" nd="" rray="" elta="" alpha="" gamma="" beta="" delta="" nd="" rray="" ight="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\left[\begin{array}{cc} \alpha &amp; \beta \\\gamma &amp; \delta \end{array}\right]&#10;\cdot&#10;\left[\begin{array}{ccc} a &amp; c &amp; e \\b &amp; d &amp; f \end{array}\right]&#10;=&#10;\left[\begin{array}{ccc} &#10;\alpha a + \beta b &amp; \alpha c + \beta d &amp; \alpha e + \beta f \\&#10;\gamma a + \delta b &amp; \gamma c + \delta d &amp; \gamma e + \delta f&#10;\end{array}\right]&#10;\end{displaymath}&#10; --&gt;&lt;img width="458" height="49" border="0" src="https://technick.net/img/guide_dft/img1020.png" alt="\" egin="" isplaymath="" eft="" egin="" rray="" c="" lpha="" eta="" amma="" elta="" gamma="" elta="" amma="" elta="" nd="" rray="" ight="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\left[\begin{array}{c} \alpha \\\beta \end{array}\right]&#10;\cdot&#10;\left[\begin{array}{ccc} a &amp; b &amp; c \end{array}\right]&#10;=&#10;\left[\begin{array}{ccc} &#10;\alpha a &amp; \alpha b &amp; \alpha c \\&#10;\beta a &amp; \beta b &amp; \beta c&#10;\end{array}\right]&#10;\end{displaymath}&#10; --&gt;&lt;img width="296" height="49" border="0" src="https://technick.net/img/guide_dft/img1021.png" alt="\" egin="" isplaymath="" eft="" egin="" rray="" alpha="" eta="" nd="" rray="" ight="" alpha="" eta="" eta="" eta="" nd="" rray="" ight="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\left[\begin{array}{ccc} a &amp; b &amp; c \end{array}\right]&#10;\cdot&#10;\left[\begin{array}{c} \alpha \\\beta \\\gamma \end{array}\right]&#10;= a \alpha + b \beta + c \gamma&#10;\end{displaymath}&#10; --&gt;&lt;img width="277" height="71" border="0" src="https://technick.net/img/guide_dft/img1022.png" alt="\" egin="" isplaymath="" eft="" egin="" rray="" cc="" a="" b="" end="" rray="" ight="" dot="" a="" amma="" nd="" rray="" ight="" a="" lpha="" b="" eta="" gamma="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a name="11731"&gt;&lt;/a&gt;An &lt;img width="52" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1009.png" alt="$M\" imes="" /&gt; matrix &lt;img width="16" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img485.png" alt="$A$" /&gt; can only be multiplied on the &lt;i&gt;right&lt;/i&gt; by an&lt;img width="49" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1010.png" alt="$L\" imes="" /&gt; matrix, where &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; is any positive integer. An &lt;img width="49" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1010.png" alt="$L\" imes="" /&gt;matrix &lt;img width="16" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img485.png" alt="$A$" /&gt; can only be multiplied on the &lt;i&gt;left&lt;/i&gt; by a &lt;img width="52" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1009.png" alt="$M\" imes="" /&gt;matrix, where &lt;img width="21" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img201.png" alt="$M$" /&gt; is any positive integer. Thus, the number of columns in&#10;the matrix on the left must equal the number of rows in the matrix on the&#10;right.&lt;/p&gt;&lt;p&gt;Matrix multiplication is &lt;i&gt;non-commutative&lt;/i&gt;, in general. That is,&#10;normally &lt;img width="75" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1023.png" alt="$AB\" eq="" a="" /&gt; even when both products are defined (such as when the&#10;matrices are square.)&lt;/p&gt;&lt;p&gt;The &lt;i&gt;transpose of a matrix product&lt;/i&gt;&lt;a name="11733"&gt;&lt;/a&gt; is the product of the&#10;transposes in &lt;i&gt;reverse order&lt;/i&gt;:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;{(A B)}^{\hbox{\tiny T}} = {B}^{\hbox{\tiny T}} {A}^{\hbox{\tiny T}}&#10;\end{displaymath}&#10; --&gt;&lt;img width="118" height="31" border="0" src="https://technick.net/img/guide_dft/img1024.png" alt="\" egin="" isplaymath="" a="" box="" iny="" b="" box="" iny="" a="" box="" iny="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;The &lt;i&gt;identity matrix&lt;/i&gt;&lt;a name="11744"&gt;&lt;/a&gt; is denoted by &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img301.png" alt="$I$" /&gt; and is defined as&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;I \isdef \left[\begin{array}{ccccc} &#10;1 &amp; 0 &amp; 0 &amp; \cdots &amp; 0 \\&#10;0 &amp; 1 &amp; 0 &amp; \cdots &amp; 0 \\&#10;0 &amp; 0 &amp; 1 &amp; \cdots &amp; 0 \\&#10;\vdots &amp; \vdots &amp; \vdots &amp; \cdots &amp; \vdots \\&#10;0 &amp; 0 &amp; 0 &amp; \cdots &amp; 1&#10;\end{array}\right]&#10;\end{displaymath}&#10; --&gt;&lt;img width="194" height="124" border="0" src="https://technick.net/img/guide_dft/img1025.png" alt="\" egin="" isplaymath="" i="" sdef="" eft="" egin="" rray="" cccc="" dots="" dots="" dots="" dots="" nd="" rray="" ight="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Identity matrices are always &lt;i&gt;square&lt;/i&gt;. The &lt;img width="53" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1026.png" alt="$N\" imes="" /&gt; identity&#10;matrix &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img301.png" alt="$I$" /&gt;, sometimes denoted as &lt;img width="23" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1027.png" alt="$I_N$" /&gt;, satisfies &lt;img width="80" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1028.png" alt="$A\" dot="" a="" /&gt; for every&lt;img width="55" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img987.png" alt="$M\" imes="" /&gt; matrix &lt;img width="16" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img485.png" alt="$A$" /&gt;. Similarly, &lt;img width="82" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1029.png" alt="$I_M\" dot="" a="" /&gt;, for every &lt;img width="55" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img987.png" alt="$M\" imes="" /&gt;matrix &lt;img width="16" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img485.png" alt="$A$" /&gt;.&lt;p&gt;As a special case, a matrix &lt;!-- MATH&#10; ${A}^{\hbox{\tiny T}}$&#10; --&gt;&lt;img width="25" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img997.png" alt="${A}^{\" box="" iny="" /&gt; times a vector &lt;img width="13" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img21.png" alt="$\" nderline="" /&gt; produces a new vector&#10;&lt;!-- MATH&#10; $\underline{y}= {A}^{\hbox{\tiny T}}\underline{x}$&#10; --&gt;&lt;img width="63" height="30" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1030.png" alt="$\" nderline="" a="a" hbox="" iny="" nderline="" /&gt; which consists of the inner product of every row of &lt;!-- MATH&#10; ${A}^{\hbox{\tiny T}}$&#10; --&gt;&lt;img width="25" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img997.png" alt="${A}^{\" box="" iny="" /&gt; with&lt;img width="13" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img21.png" alt="$\" nderline="" /&gt;&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;{A}^{\hbox{\tiny T}}\underline{x}= \left[\begin{array}{c} &#10;&lt;{\underline{a}}^{\hbox{\tiny T}}_1,\underline{x}&gt; \\&#10;&lt;{\underline{a}}^{\hbox{\tiny T}}_2,\underline{x}&gt; \\&#10;\vdots \\&#10;&lt;{\underline{a}}^{\hbox{\tiny T}}_M,\underline{x}&gt;&#10;\end{array}\right]&#10;\end{displaymath}&#10; --&gt;&lt;img width="171" height="103" border="0" src="https://technick.net/img/guide_dft/img1031.png" alt="\" egin="" isplaymath="" a="" box="" iny="" nderline="" left="" egin="" rray="" lt="" line="" a="" box="" iny="" underline="" gt="" nd="" rray="" ight="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;A matrix &lt;!-- MATH&#10; ${A}^{\hbox{\tiny T}}$&#10; --&gt;&lt;img width="25" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img997.png" alt="${A}^{\" box="" iny="" /&gt; times a vector &lt;img width="13" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img21.png" alt="$\" nderline="" /&gt; defines a &lt;i&gt;linear transformation&lt;/i&gt;&lt;a name="11782"&gt;&lt;/a&gt;of &lt;img width="13" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img21.png" alt="$\" nderline="" /&gt;. In fact, every linear function of a vector &lt;img width="13" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img21.png" alt="$\" nderline="" /&gt; can be&#10;expressed as a matrix multiply. In particular, every linear &lt;i&gt;filtering&lt;/i&gt; operation can be expressed as a &lt;a href="https://technick.net/guides/theory/dft/matrix_multiplication"&gt;matrix multiply&lt;/a&gt; applied to the&#10;input signal. As a special case, every linear, time-invariant (LTI)&#10;filtering operation can be expressed as a matrix multiply in which the&#10;matrix is &lt;i&gt;Toeplitz&lt;/i&gt;&lt;a name="11786"&gt;&lt;/a&gt;, i.e., &lt;!-- MATH&#10; ${A}^{\hbox{\tiny T}}[i,j] = {A}^{\hbox{\tiny T}}[i-j]$&#10; --&gt;&lt;img width="136" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1032.png" alt="${A}^{\" box="" iny="" i="" a="a" hbox="" iny="" j="" /&gt; (constant along all&lt;i&gt;diagonals&lt;/i&gt;).&lt;p&gt;As a further special case, a row vector on the left may be multiplied by a&#10;column vector on the right to form a &lt;i&gt;single inner product&lt;/i&gt;:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;{\underline{y}}^{\ast }{\underline{x}} = &lt;\underline{x},\underline{y}&gt; %% \ip brackets huge due to y-underbar&#10;\end{displaymath}&#10; --&gt;&lt;img width="110" height="33" border="0" src="https://technick.net/img/guide_dft/img1033.png" alt="\" egin="" isplaymath="" nderline="" ast="" nderline="" lt="" nderline="" underline="" gt="" p="" ackets="" ge="" e="" underbar="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where the alternate transpose notation ''&lt;img width="12" height="13" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1034.png" alt="$\" st="" /&gt;'' is defined to&#10;include &lt;i&gt;complex conjugation&lt;/i&gt; so that the above result holds also for&#10;complex vectors. Using this result, we may rewrite the general matrix&#10;multiply as&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;C = {A}^{\hbox{\tiny T}}B = \left[\begin{array}{cccc} &#10;{\underline{a}}^{\hbox{\tiny T}}_1 \underline{b}_1 &amp; {\underline{a}}^{\hbox{\tiny T}}_1 \underline{b}_2 &amp; \cdots &amp; {\underline{a}}^{\hbox{\tiny T}}_1 \underline{b}_N \\&#10;{\underline{a}}^{\hbox{\tiny T}}_2 \underline{b}_1 &amp; {\underline{a}}^{\hbox{\tiny T}}_2 \underline{b}_2 &amp; \cdots &amp; {\underline{a}}^{\hbox{\tiny T}}_2 \underline{b}_N \\&#10;\vdots &amp; \vdots &amp; \vdots &amp; \vdots \\&#10;{\underline{a}}^{\hbox{\tiny T}}_M \underline{b}_1 &amp; {\underline{a}}^{\hbox{\tiny T}}_M \underline{b}_2 &amp; \cdots &amp; {\underline{a}}^{\hbox{\tiny T}}_M \underline{b}_N&#10;\end{array}\right]&#10;\end{displaymath}&#10; --&gt;&lt;img width="332" height="103" border="0" src="https://technick.net/img/guide_dft/img1035.png" alt="\" egin="" isplaymath="" a="" hbox="" tiny="" b="\left[\begin{array}{cccc}" und="" ine="" a="" box="" iny="" underline="" b="" end="" rray="" ight="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/matrices"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_matrix"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>The DFT Matrix</title><link>https://technick.net/guides/theory/dft/dft_matrix/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/dft_matrix/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/matrix_multiplication"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/fourier_theorems_dft"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00843000000000000000"&gt;DFT Matrix&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;The following example reinforces the discussion of the &lt;a href="https://technick.net/guides/theory/dft/dft_matrix"&gt;DFT matrix&lt;/a&gt;. We can&#10;simply create the &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;DFT&lt;/a&gt; &lt;a href="https://technick.net/guides/theory/dft/matrices"&gt;matrix&lt;/a&gt; in &lt;a href="http://www.mathworks.com/access/helpdesk/help/techdoc/basics/getstarted.shtml"&gt;Matlab&lt;/a&gt; by taking the FFT of the identity&#10;matrix. Then we show that multiplying by the DFT matrix is equivalent&#10;to the FFT:&lt;pre&gt;&#10;&amp;gt;&amp;gt; eye(4)&#10;ans =&#10; 1 0 0 0&#10; 0 1 0 0&#10; 0 0 1 0&#10; 0 0 0 1&#10;&lt;p&gt;&amp;gt;&amp;gt; S4 = fft(eye(4))&#10;ans =&#10;1.0000 1.0000 1.0000 1.0000 &lt;br&gt;&#10;1.0000 0.0000 - 1.0000i -1.0000 0.0000 + 1.0000i&#10;1.0000 -1.0000 1.0000 -1.0000 &lt;br&gt;&#10;1.0000 0.0000 + 1.0000i -1.0000 0.0000 - 1.0000i&lt;/p&gt;&#10;&lt;p&gt;&amp;gt;&amp;gt; S4&amp;rsquo; * S4 % Show that S4&amp;rsquo; = inverse DFT (times N=4)&#10;ans =&#10;4.0000 0.0000 0 0.0000&#10;0.0000 4.0000 0.0000 0.0000&#10;0 0.0000 4.0000 0.0000&#10;0.0000 0.0000 0.0000 4.0000&lt;/p&gt;&#10;&lt;p&gt;&amp;gt;&amp;gt; x = [1; 2; 3; 4]&#10;x =&#10;1&#10;2&#10;3&#10;4&lt;/p&gt;&#10;&lt;p&gt;&amp;gt;&amp;gt; fft(x)&#10;ans =&#10;10.0000 &lt;br&gt;&#10;-2.0000 + 2.0000i&#10;-2.0000 &lt;br&gt;&#10;-2.0000 - 2.0000i&#10;&amp;gt;&amp;gt; S4 * x&#10;ans =&#10;10.0000 &lt;br&gt;&#10;-2.0000 + 2.0000i&#10;-2.0000 &lt;br&gt;&#10;-2.0000 - 2.0000i&lt;/pre&gt; &lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/matrix_multiplication"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;  &lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;  &lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;  &lt;a href="https://technick.net/guides/theory/dft/fourier_theorems_dft"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Matlab Examples</title><link>https://technick.net/guides/theory/dft/matlab_examples/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/matlab_examples/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/dft_matrix"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/figure_7_2"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00840000000000000000"&gt;Matlab Examples&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;&lt;br /&gt;&lt;hr /&gt;&lt;!--Table of Child-Links--&gt;&lt;a name="CHILD_LINKS"&gt;&lt;strong&gt;Subsections&lt;/strong&gt;&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html2018" href="https://technick.net/guides/theory/dft/figure_7_2"&gt;Figure&amp;nbsp;7.2&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2019" href="https://technick.net/guides/theory/dft/figure_7_3"&gt;Figure&amp;nbsp;7.3&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2020" href="https://technick.net/guides/theory/dft/dft_matrix"&gt;DFT Matrix&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;!--End of Table of Child-Links--&gt;&#10;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/dft_matrix"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/figure_7_2"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Figure 7.2</title><link>https://technick.net/guides/theory/dft/figure_7_2/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/figure_7_2/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/matlab_examples"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/figure_7_3"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00841000000000000000"&gt;Figure&amp;nbsp;&lt;/a&gt;&lt;a href="https://technick.net/guides/theory/dft/orthogonality_sinusoids#fig:dftsines"&gt;7.2&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;Below is the &lt;a href="http://www.mathworks.com/access/helpdesk/help/techdoc/basics/getstarted.shtml"&gt;Matlab&lt;/a&gt; for Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/orthogonality_sinusoids#fig:dftsines"&gt;7.2&lt;/a&gt;:&lt;pre&gt;&#10;N=8;&#10;fs=1;&#10;&lt;p&gt;n = [0:N-1]; % row&#10;t = [0:0.01:N]; % interpolated&#10;k=fliplr(n)&amp;rsquo; - N/2;&#10;fk = k&lt;em&gt;fs/N;&#10;wk = 2&lt;/em&gt;pi&lt;em&gt;fk;&#10;clf;&#10;for i=1:N&#10;subplot(N,2,2&lt;/em&gt;i-1);&#10;plot(t,cos(wk(i)&lt;em&gt;t))&#10;axis([0,8,-1,1]);&#10;hold on;&#10;plot(n,cos(wk(i)&lt;em&gt;n),&amp;rsquo;&lt;/em&gt;&amp;rsquo;)&#10;if i==1&#10;title(&amp;lsquo;Real Part&amp;rsquo;);&#10;end;&#10;ylabel(sprintf(&amp;lsquo;k=%d&amp;rsquo;,k(i)));&#10;if i==N&#10;xlabel(&amp;lsquo;Time (samples)&amp;rsquo;);&#10;end;&#10;subplot(N,2,2&lt;/em&gt;i);&#10;plot(t,sin(wk(i)*t))&#10;axis([0,8,-1,1]);&#10;hold on;&#10;plot(n,sin(wk(i)&lt;em&gt;n),&amp;rsquo;&lt;/em&gt;&amp;rsquo;)&#10;ylabel(sprintf(&amp;lsquo;k=%d&amp;rsquo;,k(i)));&#10;if i==1&#10;title(&amp;lsquo;Imaginary Part&amp;rsquo;);&#10;end;&#10;if i==N&#10;xlabel(&amp;lsquo;Time (samples)&amp;rsquo;);&#10;end;&#10;end&lt;/pre&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/matlab_examples"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;  &lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;  &lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;  &lt;a href="https://technick.net/guides/theory/dft/figure_7_3"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Figure 7.3</title><link>https://technick.net/guides/theory/dft/figure_7_3/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/figure_7_3/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/figure_7_2"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_matrix"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00842000000000000000"&gt;Figure&amp;nbsp;&lt;/a&gt;&lt;a href="https://technick.net/guides/theory/dft/frequencies_cracks#fig:dftfilter"&gt;7.3&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;Below is the &lt;a href="http://www.mathworks.com/access/helpdesk/help/techdoc/basics/getstarted.shtml"&gt;Matlab&lt;/a&gt; for Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/frequencies_cracks#fig:dftfilter"&gt;7.3&lt;/a&gt;:&lt;pre&gt;&#10;% Parameters (&lt;a href="https://technick.net/guides/theory/dft/shannon_s_sampling_theorem"&gt;sampling rate&lt;/a&gt; = 1)&#10;N = 16; % &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;DFT&lt;/a&gt; length&#10;k = N/4; % bin where DFT filter is centered&#10;wk = 2*pi*k/N; % normalized radian center-frequency for DFT_k()&#10;wStep = 2*pi/N;&#10;w = [0:wStep:2*pi - wStep]; % DFT frequency grid&#10;&lt;p&gt;interp = 10;&#10;N2 = interp&lt;em&gt;N; % Denser grid showing &amp;ldquo;arbitrary&amp;rdquo; frequencies&#10;w2Step = 2&lt;/em&gt;pi/N2;&#10;w2 = [0:w2Step:2&lt;em&gt;pi - w2Step]; % Extra dense frequency grid&#10;X = (1 - exp(j&lt;/em&gt;(w2-wk)&lt;em&gt;N)) ./ (1 - exp(j&lt;/em&gt;(w2-wk)));&#10;% slightly offset to avoid divide by zero at wk&#10;X(1+k*interp) = N; % Fix divide-by-zero point (overwrite &amp;ldquo;NaN&amp;rdquo;)&lt;/p&gt;&#10;&lt;p&gt;% Plot spectral magnitude&#10;clf;&#10;magX = abs(X);&#10;magXd = magX(1:interp:N2); % DFT frequencies only&#10;subplot(2,1,1);&#10;plot(w2,magX,&amp;rsquo;-&amp;rsquo;); hold on; grid;&#10;plot(w,magXd,&amp;rsquo;*&amp;rsquo;); % Show DFT sample points&#10;title(&amp;lsquo;DFT &lt;a href="https://technick.net/guides/theory/dft/logarithms"&gt;Amplitude&lt;/a&gt; Response at k=N/4&amp;rsquo;);&#10;xlabel(&amp;lsquo;Normalized Radian Frequency (radians per sample)&amp;rsquo;);&#10;ylabel(&amp;lsquo;Magnitude (Linear)&amp;rsquo;);&#10;text(-1,20,&amp;lsquo;a)&amp;rsquo;);&lt;/p&gt;&#10;&lt;p&gt;% Same thing on a &lt;a href="https://technick.net/guides/theory/dft/decibels"&gt;dB scale&lt;/a&gt;&#10;magXdb = 20&lt;em&gt;log10(magX); % Spectral magnitude in &lt;a href="https://technick.net/guides/theory/dft/decibels"&gt;dB&lt;/a&gt;&#10;% Since the zeros go to minus infinity, clip at -60 dB:&#10;magXdb = max(magXdb,-60&lt;/em&gt;ones(1,N2));&#10;magXddb = magXdb(1:interp:N2); % DFT frequencies only&#10;subplot(2,1,2);&#10;hold off; plot(w2,magXdb,&amp;rsquo;-&amp;rsquo;); hold on; plot(w,magXddb,&amp;rsquo;*&amp;rsquo;); grid;&#10;xlabel(&amp;lsquo;Normalized Radian Frequency (radians per sample)&amp;rsquo;);&#10;ylabel(&amp;lsquo;Magnitude (dB)&amp;rsquo;);&#10;text(-1,40,&amp;lsquo;b)&amp;rsquo;);&#10;print -deps &amp;lsquo;&lt;a href="https://ccrma.stanford.edu/~jos//eps/dftfilter.eps%27;"&gt;https://ccrma.stanford.edu/~jos//eps/dftfilter.eps';&lt;/a&gt;&#10;hold off;&lt;/pre&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/figure_7_2"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;  &lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;  &lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;  &lt;a href="https://technick.net/guides/theory/dft/dft_matrix"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Fourier Theorems for the DFT</title><link>https://technick.net/guides/theory/dft/fourier_theorems_dft/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/fourier_theorems_dft/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/dft_matrix"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_its_inverse"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00900000000000000000"&gt;Fourier Theorems for the DFT&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;This chapter derives various &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/fourier_theorems"&gt;Fourier theorems&lt;/a&gt;&lt;/i&gt; for the case of the &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;DFT&lt;/a&gt;.&#10;Included are symmetry relations, the &lt;a href="https://technick.net/guides/theory/dft/shift_theorem"&gt;shift theorem&lt;/a&gt;, &lt;a href="https://technick.net/guides/theory/dft/convolution_theorem"&gt;convolution theorem&lt;/a&gt;,&lt;a href="https://technick.net/guides/theory/dft/correlation_theorem"&gt;correlation theorem&lt;/a&gt;, &lt;a href="https://technick.net/guides/theory/dft/power_theorem"&gt;power theorem&lt;/a&gt;, and theorems pertaining to interpolation&#10;and downsampling. Applications related to certain theorems are outlined,&#10;including linear time-invariant filtering, sampling rate conversion, and&lt;a href="https://technick.net/guides/theory/dft/appendix_b_introductory"&gt;statistical signal processing&lt;/a&gt;.&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;hr /&gt;&lt;!--Table of Child-Links--&gt;&lt;a name="CHILD_LINKS"&gt;&lt;strong&gt;Subsections&lt;/strong&gt;&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html2059" href="https://technick.net/guides/theory/dft/dft_its_inverse"&gt;The DFT and its Inverse&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html2060" href="https://technick.net/guides/theory/dft/notation_terminology"&gt;Notation and Terminology&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2061" href="https://technick.net/guides/theory/dft/modulo_indexing_periodic"&gt;Modulo Indexing, Periodic Extension&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2062" href="https://technick.net/guides/theory/dft/signal_operators"&gt;Signal Operators&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html2063" href="https://technick.net/guides/theory/dft/flip_operator"&gt;Flip Operator&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2064" href="https://technick.net/guides/theory/dft/shift_operator"&gt;Shift Operator&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2065" href="https://technick.net/guides/theory/dft/convolution"&gt;Convolution&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html2066" href="https://technick.net/guides/theory/dft/graphical_convolution"&gt;Graphical Convolution&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2067" href="https://technick.net/guides/theory/dft/polynomial_multiplication"&gt;Polynomial Multiplication&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2068" href="https://technick.net/guides/theory/dft/multiplication_decimal_numb"&gt;Multiplication of Decimal Numbers&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2069" href="https://technick.net/guides/theory/dft/correlation"&gt;Correlation&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2070" href="https://technick.net/guides/theory/dft/stretch_operator"&gt;Stretch Operator&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2071" href="https://technick.net/guides/theory/dft/zero_padding"&gt;Zero Padding&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2072" href="https://technick.net/guides/theory/dft/repeat_operator"&gt;Repeat Operator&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2073" href="https://technick.net/guides/theory/dft/decimation_operator"&gt;Decimation Operator&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2074" href="https://technick.net/guides/theory/dft/alias_operator"&gt;Alias Operator&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2075" href="https://technick.net/guides/theory/dft/even_odd_functions"&gt;Even and Odd Functions&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2076" href="https://technick.net/guides/theory/dft/fourier_theorems"&gt;The Fourier Theorems&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html2077" href="https://technick.net/guides/theory/dft/linearity"&gt;Linearity&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2078" href="https://technick.net/guides/theory/dft/conjugation_reversal"&gt;Conjugation and Reversal&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2079" href="https://technick.net/guides/theory/dft/symmetry"&gt;Symmetry&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2080" href="https://technick.net/guides/theory/dft/shift_theorem"&gt;Shift Theorem&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html2081" href="https://technick.net/guides/theory/dft/linear_phase_terms"&gt;Linear Phase Terms&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2082" href="https://technick.net/guides/theory/dft/application_shift_theorem"&gt;Application of the Shift Theorem to FFT Windows&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2083" href="https://technick.net/guides/theory/dft/convolution_theorem"&gt;Convolution Theorem&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2084" href="https://technick.net/guides/theory/dft/dual_convolution_theorem"&gt;Dual of the Convolution Theorem&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2085" href="https://technick.net/guides/theory/dft/correlation_theorem"&gt;Correlation Theorem&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2086" href="https://technick.net/guides/theory/dft/power_theorem"&gt;Power Theorem&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2087" href="https://technick.net/guides/theory/dft/rayleigh_energy_theorem"&gt;Rayleigh Energy Theorem (Parseval's Theorem)&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2088" href="https://technick.net/guides/theory/dft/stretch_theorem_repeat"&gt;Stretch Theorem (Repeat Theorem)&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2089" href="https://technick.net/guides/theory/dft/decimation_theorem_aliasing"&gt;Decimation Theorem (Aliasing Theorem)&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2090" href="https://technick.net/guides/theory/dft/zero_padding_theorem"&gt;Zero Padding Theorem&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2091" href="https://technick.net/guides/theory/dft/bandlimited_interpolation_t"&gt;Bandlimited Interpolation in Time&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2092" href="https://technick.net/guides/theory/dft/conclusions"&gt;Conclusions&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2093" href="https://technick.net/guides/theory/dft/acknowledgement"&gt;Acknowledgement&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2094" href="https://technick.net/guides/theory/dft/appendix_a_linear"&gt;Appendix A: Linear Time-Invariant Filters and Convolution&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html2095" href="https://technick.net/guides/theory/dft/lti_filters_convolution"&gt;LTI Filters and the Convolution Theorem&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2096" href="https://technick.net/guides/theory/dft/appendix_b_introductory"&gt;Appendix B: Introductory Statistical Signal Processing&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html2097" href="https://technick.net/guides/theory/dft/cross_correlation"&gt;Cross-Correlation&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2098" href="https://technick.net/guides/theory/dft/applications_cross_correlat"&gt;Applications of Cross-Correlation&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2099" href="https://technick.net/guides/theory/dft/autocorrelation"&gt;Autocorrelation&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2100" href="https://technick.net/guides/theory/dft/coherence"&gt;Coherence&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2101" href="https://technick.net/guides/theory/dft/appendix_c_mathematica_matl"&gt;Appendix C: Mathematica/Matlab Examples&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2102" href="https://technick.net/guides/theory/dft/appendix_d_similarity"&gt;Appendix D: The Similarity Theorem&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;!--End of Table of Child-Links--&gt;&#10;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/dft_matrix"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_its_inverse"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>The DFT and its Inverse</title><link>https://technick.net/guides/theory/dft/dft_its_inverse/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/dft_its_inverse/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/fourier_theorems_dft"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/notation_terminology"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00910000000000000000"&gt;The DFT and its Inverse&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;Let &lt;!-- MATH&#10; $x(n), n=0,1,2,\ldots,N-1$&#10; --&gt;&lt;img width="188" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1051.png" alt="$x(n), n=0,1,2,\" dots="" /&gt; denote an &lt;img width="14" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img51.png" alt="$n$" /&gt;-sample complex sequence, i.e.,&#10;&lt;!-- MATH&#10; $x\in{\cal C}^N$&#10; --&gt;&lt;img width="54" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img687.png" alt="$x\" n="" al="" /&gt;. Then the &lt;i&gt;spectrum&lt;/i&gt;&lt;a name="13568"&gt;&lt;/a&gt; of &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; is defined by the &lt;i&gt;Discrete&#10;Fourier Transform&lt;/i&gt;&lt;a name="13570"&gt;&lt;/a&gt; (&lt;a href="https://technick.net/guides/theory/dft/dft"&gt;DFT&lt;/a&gt;):&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\fbox{$\displaystyle X(k) \isdef \sum_{n=0}^{N-1}x(n) e^{-j 2\pi nk/N},\quad k=0,1,2,\ldots,N-1$}&#10;\end{displaymath}&#10; --&gt;&lt;img width="406" height="73" border="0" src="https://technick.net/img/guide_dft/img1052.png" alt="\" egin="" isplaymath="" box="" isplaystyle="" isdef="" um="" n-1="" x="" n="" e="" pi="" n="" uad="" dots="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;The &lt;i&gt;inverse DFT&lt;/i&gt;&lt;a name="13576"&gt;&lt;/a&gt; (&lt;i&gt;IDFT&lt;/i&gt;&lt;a name="13578"&gt;&lt;/a&gt;) is defined by&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\fbox{$\displaystyle x(n) = \frac{1}{N}\sum_{k=0}^{N-1}X(k) e^{j 2\pi nk/N},\quad n=0,1,2,\ldots,N-1$}&#10;\end{displaymath}&#10; --&gt;&lt;img width="419" height="74" border="0" src="https://technick.net/img/guide_dft/img1053.png" alt="\" egin="" isplaymath="" box="" isplaystyle="" frac="" sum="" n-1="" x="" k="" e="" pi="" n="" uad="" dots="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Note that for the first time we are not carrying along the &lt;a href="https://technick.net/guides/theory/dft/shannon_s_sampling_theorem"&gt;sampling&#10;interval&lt;/a&gt; &lt;img width="67" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1054.png" alt="$T=1/f_s$" /&gt; in our notation. This is actually the most typical&#10;treatment in the digital signal processing literature. It is often said&#10;that the sampling frequency is &lt;img width="48" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1055.png" alt="$f_s=1$" /&gt;. However, it can be set to any desired&#10;value using the substitution&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;e^{j 2\pi nk/N} = e^{j 2\pi k (f_s/N) nT} \isdef e^{j \omega_k t_n}&#10;\end{displaymath}&#10; --&gt;&lt;img width="258" height="26" border="0" src="https://technick.net/img/guide_dft/img1056.png" alt="\" egin="" isplaymath="" j="" i="" n="" j="" i="" s="s" n="" t="" sdef="" omega="" n="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;However, for the remainder of this reader, we will adopt the more common&#10;(and more mathematical) convention &lt;img width="48" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1055.png" alt="$f_s=1$" /&gt;. In particular, we'll use the&#10;definition &lt;!-- MATH&#10; $\omega_k \isdef 2\pi k/N$&#10; --&gt;&lt;img width="91" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1057.png" alt="$\" mega="" isdef="" i="" /&gt; &lt;i&gt;for this chapter only&lt;/i&gt;. In this&#10;case, a radian frequency &lt;img width="22" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img681.png" alt="$\" mega="" /&gt; is in units of ''radians per sample.''&#10;Elsewhere in this course, &lt;img width="22" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img681.png" alt="$\" mega="" /&gt; always means ''radians per&lt;i&gt;second&lt;/i&gt;.'' (Of course, there's no difference when the &lt;a href="https://technick.net/guides/theory/dft/shannon_s_sampling_theorem"&gt;sampling rate&lt;/a&gt;is really &lt;img width="12" height="13" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img78.png" alt="$1$" /&gt;.) Another term we use in connection with the &lt;img width="48" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1055.png" alt="$f_s=1$" /&gt;convention is &lt;i&gt;normalized frequency&lt;/i&gt;&lt;a name="13586"&gt;&lt;/a&gt;: All normalized radian frequencies&#10;lie in the range &lt;img width="53" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1058.png" alt="$[-\" i="i" pi="" /&gt;, and all normalized frequencies in Hz lie in&#10;the range &lt;img width="75" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img43.png" alt="$[-0.5,0.5)$" /&gt;.&lt;p&gt;&lt;br /&gt;&lt;hr /&gt;&lt;!--Table of Child-Links--&gt;&lt;a name="CHILD_LINKS"&gt;&lt;strong&gt;Subsections&lt;/strong&gt;&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html2115" href="https://technick.net/guides/theory/dft/notation_terminology"&gt;Notation and Terminology&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2116" href="https://technick.net/guides/theory/dft/modulo_indexing_periodic"&gt;Modulo Indexing, Periodic Extension&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;!--End of Table of Child-Links--&gt;&#10;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/fourier_theorems_dft"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/notation_terminology"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Notation and Terminology</title><link>https://technick.net/guides/theory/dft/notation_terminology/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/notation_terminology/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/dft_its_inverse"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/modulo_indexing_periodic"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00911000000000000000"&gt;Notation and Terminology&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;If &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img33.png" alt="$X$" /&gt; is the &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;DFT&lt;/a&gt; of &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt;, we say that &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; and &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img33.png" alt="$X$" /&gt; form a &lt;i&gt;transform&#10;pair&lt;/i&gt;&lt;a name="13588"&gt;&lt;/a&gt; and write&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\fbox{$\displaystyle x\leftrightarrow X$}\quad \mbox{(''$x$\ corresponds to $X$'')}.&#10;\end{displaymath}&#10; --&gt;&lt;img width="268" height="32" border="0" src="https://technick.net/img/guide_dft/img1059.png" alt="\" egin="" isplaymath="" box="" isplaystyle="" eftrightarrow="" uad="" box="" q\lq="" corresponds="" x="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Another notation we'll use is &lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;\mbox{{\tt DFT}}(x)&amp;\isdef &amp; X,\quad\mbox{and} \\&#10;\mbox{{\tt DFT}}_k(x)&amp;\isdef &amp; X(k)&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="178" height="60" border="0" src="https://technick.net/img/guide_dft/img1060.png" alt="\" egin="" qnarray="" box="" t="tt" ft="" isdef="" quad\mbox="" nd="" box="" t="tt" ft="" x="" sdef="" k="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;As we've already seen, &lt;i&gt;time-domain&lt;/i&gt; signals are consistently denoted&#10;using &lt;i&gt;lowercase&lt;/i&gt; symbols such as ''&lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt;,'' while &lt;i&gt;frequency-domain&lt;/i&gt;signals (spectra), are denoted in &lt;i&gt;uppercase&lt;/i&gt; (''&lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img33.png" alt="$X$" /&gt;'').&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/dft_its_inverse"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/modulo_indexing_periodic"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Modulo Indexing, Periodic Extension</title><link>https://technick.net/guides/theory/dft/modulo_indexing_periodic/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/modulo_indexing_periodic/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/notation_terminology"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/signal_operators"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00912000000000000000"&gt;Modulo Indexing, Periodic Extension&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;The &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;DFT&lt;/a&gt; &lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;sinusoids&lt;/a&gt; &lt;!-- MATH&#10; $s_k(n) \isdef e^{j\omega_k n}$&#10; --&gt;&lt;img width="99" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1061.png" alt="$s_k(n) \" sdef="" omega="" /&gt; are all &lt;i&gt;periodic&lt;/i&gt;&lt;a name="13597"&gt;&lt;/a&gt;having periods which divide &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt;. That is, &lt;!-- MATH&#10; $s_k(n+mN)=s_k(n)$&#10; --&gt;&lt;img width="148" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1062.png" alt="$s_k(n+mN)=s_k(n)$" /&gt; for any&#10;integer &lt;img width="18" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img937.png" alt="$m$" /&gt;. Since a length &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; signal &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; can be expressed as a linear&#10;combination of the DFT sinusoids in the time domain,&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;x(n) = \frac{1}{N}\sum_k X(k) s_k(n),&#10;\end{displaymath}&#10; --&gt;&lt;img width="193" height="53" border="0" src="https://technick.net/img/guide_dft/img1063.png" alt="\" egin="" isplaymath="" n="" rac="" sum="" k="" s="" n="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;it follows that the ''automatic'' definition of &lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img50.png" alt="$x(n)$" /&gt; beyond the range&lt;img width="70" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1064.png" alt="$[0,N-1]$" /&gt; is &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/modulo_indexing_periodic"&gt;periodic extension&lt;/a&gt;&lt;/i&gt;&lt;a name="13599"&gt;&lt;/a&gt;, i.e., &lt;!-- MATH&#10; $x(n+mN)\isdef x(n)$&#10; --&gt;&lt;img width="135" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1065.png" alt="$x(n+mN)\" sdef="" /&gt; for every&#10;integer &lt;img width="18" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img937.png" alt="$m$" /&gt;. &lt;p&gt;Moreover, the DFT also repeats naturally every &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; samples, since&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;X(k+mN) \isdef \sum_n \left&lt;x,s_{k+mN}\right&gt; = \sum_{n=0}^{N-1}\left&lt;x,s_k\right&gt; = X(k)&#10;\end{displaymath}&#10; --&gt;&lt;img width="395" height="62" border="0" src="https://technick.net/img/guide_dft/img1066.png" alt="\" egin="" isplaymath="" k="" n="" sdef="" um="" left="" t="" s="s" k="" n="" ight="" t="" um="" n-1="" left="" lt="" x="" s="" k\right="" gt="" x="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;because &lt;!-- MATH&#10; $s_{k+mN}(n) = e^{j2\pi n(k+mN)/N} = e^{j2\pi nk/N}e^{j2\pi n m} =&#10;s_k(n)$&#10; --&gt;&lt;img width="385" height="36" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1067.png" alt="$s_{k+mN}(n) = e^{j2\" i="i" k="" n="" e="" pi="" n="" j2\pi="" s="s" k="" /&gt;. (The DFT sinusoids behave identically as functions of &lt;img width="14" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img51.png" alt="$n$" /&gt; and&lt;img width="13" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img53.png" alt="$k$" /&gt;.) Accordingly, for purposes of DFT studies, we may define &lt;i&gt;all&lt;/i&gt;signals in &lt;img width="26" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img745.png" alt="${\" al="" /&gt; as being single periods from an infinitely long periodic&#10;signal with period &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; samples:&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Definition: &lt;/b&gt;For any signal &lt;!-- MATH&#10; $x\in{\cal C}^N$&#10; --&gt;&lt;img width="54" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img687.png" alt="$x\" n="" al="" /&gt;, we define&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;x(n+mN)\isdef x(n)&#10;\end{displaymath}&#10; --&gt;&lt;img width="143" height="31" border="0" src="https://technick.net/img/guide_dft/img1068.png" alt="\" egin="" isplaymath="" n="" n="" sdef="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;for every integer &lt;img width="18" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img937.png" alt="$m$" /&gt;.&lt;p&gt;As a result of this convention, all indexing of signals and&#10;spectra&lt;a name="tex2html85" href="https://technick.net/guides/theory/dft/footnode#foot12778"&gt;&lt;sup&gt;8.1&lt;/sup&gt;&lt;/a&gt; can be interpreted &lt;i&gt;modulo&lt;/i&gt;&lt;a name="13608"&gt;&lt;/a&gt; &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt;, and we may write&#10;&lt;!-- MATH&#10; $x(n \left(\mbox{mod\ }N\right))$&#10; --&gt;&lt;img width="100" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1069.png" alt="$x(n \" eft="" box="" od\="" right="" /&gt; to emphasize this. Formally, ''&lt;!-- MATH&#10; $n \left(\mbox{mod\ }N\right)$&#10; --&gt;&lt;img width="79" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1070.png" alt="$n \" eft="" box="" od\="" right="" /&gt;'' is defined as&lt;img width="62" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1071.png" alt="$n-mN$" /&gt; with &lt;img width="18" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img937.png" alt="$m$" /&gt; chosen to give &lt;img width="62" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1071.png" alt="$n-mN$" /&gt; in the range &lt;img width="70" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1064.png" alt="$[0,N-1]$" /&gt;.&lt;/p&gt;&lt;p&gt;As an example, when indexing a spectrum &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img33.png" alt="$X$" /&gt;, we have that &lt;img width="101" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1072.png" alt="$X(N)=X(0)$" /&gt; which&#10;can be interpreted physically as saying that the &lt;a href="https://technick.net/guides/theory/dft/shannon_s_sampling_theorem"&gt;sampling rate&lt;/a&gt; is the samefrequency as dc for discrete time signals. In the time domain, we have what&#10;is sometimes called the ''periodic extension'' of &lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img50.png" alt="$x(n)$" /&gt;. This means that&#10;the input to the DFT is mathematically treated as &lt;i&gt;samples of a&#10;periodic signal&lt;/i&gt; with period &lt;img width="30" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1073.png" alt="$NT$" /&gt; seconds (&lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; samples). The corresponding&#10;assumption in the frequency domain is that the spectrum is &lt;i&gt;zero&#10;between frequency samples &lt;img width="22" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img681.png" alt="$\" mega="" /&gt;&lt;/i&gt;.&lt;/p&gt;&lt;p&gt;It is also possible to adopt the point of view that the time-domain signal&lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img50.png" alt="$x(n)$" /&gt; consists of &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; samples preceded and followed by &lt;i&gt;zeros&lt;/i&gt;. In&#10;this case, the spectrum is &lt;i&gt;nonzero&lt;/i&gt; between spectral samples&lt;img width="22" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img681.png" alt="$\" mega="" /&gt;, and the spectrum between samples can be reconstructed by means&#10;of &lt;i&gt;bandlimited interpolation&lt;/i&gt;. This ''time-limited'' interpretation&#10;of the DFT input is considered in detail in Music 420 and is beyond the&#10;scope of Music 320 (except in the discussion of ''zero padding &lt;!-- MATH&#10; $\leftrightarrow$&#10; --&gt;&lt;img width="20" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1074.png" alt="$\" eftrightarrow="" /&gt;interpolation'' below).&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/notation_terminology"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/signal_operators"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Signal Operators</title><link>https://technick.net/guides/theory/dft/signal_operators/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/signal_operators/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/modulo_indexing_periodic"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/flip_operator"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00920000000000000000"&gt;Signal Operators&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;It will be convenient in the &lt;a href="https://technick.net/guides/theory/dft/fourier_theorems"&gt;Fourier theorems&lt;/a&gt; below to make &#10;use of the following signal operator definitions.&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;hr /&gt;&lt;!--Table of Child-Links--&gt;&lt;a name="CHILD_LINKS"&gt;&lt;strong&gt;Subsections&lt;/strong&gt;&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html2151" href="https://technick.net/guides/theory/dft/flip_operator"&gt;Flip Operator&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2152" href="https://technick.net/guides/theory/dft/shift_operator"&gt;Shift Operator&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2153" href="https://technick.net/guides/theory/dft/convolution"&gt;Convolution&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html2154" href="https://technick.net/guides/theory/dft/graphical_convolution"&gt;Graphical Convolution&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2155" href="https://technick.net/guides/theory/dft/polynomial_multiplication"&gt;Polynomial Multiplication&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2156" href="https://technick.net/guides/theory/dft/multiplication_decimal_numb"&gt;Multiplication of Decimal Numbers&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2157" href="https://technick.net/guides/theory/dft/correlation"&gt;Correlation&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2158" href="https://technick.net/guides/theory/dft/stretch_operator"&gt;Stretch Operator&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2159" href="https://technick.net/guides/theory/dft/zero_padding"&gt;Zero Padding&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2160" href="https://technick.net/guides/theory/dft/repeat_operator"&gt;Repeat Operator&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2161" href="https://technick.net/guides/theory/dft/decimation_operator"&gt;Decimation Operator&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2162" href="https://technick.net/guides/theory/dft/alias_operator"&gt;Alias Operator&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;!--End of Table of Child-Links--&gt;&#10;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/modulo_indexing_periodic"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/flip_operator"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Flip Operator</title><link>https://technick.net/guides/theory/dft/flip_operator/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/flip_operator/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/signal_operators"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/shift_operator"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00921000000000000000"&gt;Flip Operator&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Definition: &lt;/b&gt;We define the &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/flip_operator"&gt;flip operator&lt;/a&gt;&lt;/i&gt;&lt;a name="13614"&gt;&lt;/a&gt; by&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\mbox{{\tt Flip}}_n(x) \isdef x(-n)&#10;\end{displaymath}&#10; --&gt;&lt;img width="140" height="31" border="0" src="https://technick.net/img/guide_dft/img1075.png" alt="\" egin="" isplaymath="" box="" t="tt" lip="" x="" sdef="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;which, by &lt;a href="https://technick.net/guides/theory/dft/modulo_indexing_periodic"&gt;modulo indexing&lt;/a&gt;, is &lt;img width="69" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1076.png" alt="$x(N-n)$" /&gt;. The &lt;!-- MATH&#10; $\mbox{{\tt Flip}}()$&#10; --&gt;&lt;img width="50" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1077.png" alt="$\" box="" t="tt" lip="" /&gt; operator reverses&#10;the order of samples &lt;img width="12" height="13" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img78.png" alt="$1$" /&gt; through &lt;img width="46" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1078.png" alt="$N-1$" /&gt; of a sequence, leaving sample &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img38.png" alt="$0$" /&gt;alone, as shown in Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/flip_operator#fig:flip"&gt;8.1&lt;/a&gt;a. Thanks to modulo indexing, it can also be&#10;viewed as ''flipping'' the sequence about the vertical axis, as shown in&#10;Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/flip_operator#fig:flip"&gt;8.1&lt;/a&gt;b. The interpretation of Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/flip_operator#fig:flip"&gt;8.1&lt;/a&gt;b is usually the one we&#10;want, and the &lt;!-- MATH&#10; $\mbox{{\tt Flip}}$&#10; --&gt;&lt;img width="38" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1079.png" alt="$\" box="" t="tt" lip="" /&gt; operator is usually thought of as ''time reversal''&#10;when applied to a signal &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; or ''frequency reversal'' when applied to a&#10;spectrum &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img33.png" alt="$X$" /&gt;.&lt;p&gt; &lt;div align="CENTER"&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:flip"&gt;&lt;/a&gt;&lt;a name="13625"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure 8.1:&lt;/strong&gt;Illustration of &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; and &lt;!-- MATH&#10; $\mbox{{\tt Flip}}(x)$&#10; --&gt;&lt;img width="59" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1081.png" alt="$\" box="" t="tt" lip="" /&gt;for &lt;img width="48" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img24.png" alt="$N=5$" /&gt; and two different domain interpretations: &#10;&#9;a) &lt;img width="99" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img25.png" alt="$n\" n="" /&gt;. &#10;&#9;b) &lt;!-- MATH&#10; $n\in[-(N-1)/2, (N-1)/2]$&#10; --&gt;&lt;img width="202" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img26.png" alt="$n\" n="" n-1="" /&gt;.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; $\scalebox{0.8}{\includegraphics{eps/flip.eps}}$&#10; --&gt;&lt;img width="568" height="344" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1080.png" alt="\" calebox="" ncludegraphics="" ps="" lip="" ps="" /&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/signal_operators"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/shift_operator"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Shift Operator</title><link>https://technick.net/guides/theory/dft/shift_operator/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/shift_operator/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/flip_operator"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/convolution"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00922000000000000000"&gt;Shift Operator&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Definition: &lt;/b&gt;The &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/shift_operator"&gt;shift operator&lt;/a&gt;&lt;/i&gt;&lt;a name="13635"&gt;&lt;/a&gt; is defined by&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\mbox{{\tt Shift}}_{\Delta,n}(x) \isdef x(n-\Delta)&#10;\end{displaymath}&#10; --&gt;&lt;img width="187" height="32" border="0" src="https://technick.net/img/guide_dft/img1082.png" alt="\" egin="" isplaymath="" box="" t="tt" hift="" elta="" x="" sdef="" delta="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;and &lt;!-- MATH&#10; $\mbox{{\tt Shift}}_{\Delta}(x)$&#10; --&gt;&lt;img width="79" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1083.png" alt="$\" box="" t="tt" hift="" elta="" /&gt; denotes the entire shifted signal. Note that&#10;since indexing is modulo &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt;, the shift is &lt;i&gt;circular&lt;/i&gt;. However, we&#10;normally use it to represent &lt;i&gt;time delay&lt;/i&gt; by &lt;img width="17" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1084.png" alt="$\" elta="" /&gt; samples. We&#10;often use the shift operator in conjunction with &lt;i&gt;zero padding&lt;/i&gt;(appending zeros to the signal &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt;) in order to avoid the ''wrap-around''&#10;associated with a circular shift.&lt;p&gt; &lt;div align="CENTER"&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:shift"&gt;&lt;/a&gt;&lt;a name="13644"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure 8.2:&lt;/strong&gt;Successive one-sample shifts of a&#10;sampled periodic sawtooth waveform having first period &lt;img width="81" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img27.png" alt="$[0,1,2,3,4]$" /&gt;.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; $\scalebox{0.8}{\includegraphics{eps/shift.eps}}$&#10; --&gt;&lt;img width="402" height="428" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1085.png" alt="\" calebox="" ncludegraphics="" ps="" hift="" ps="" /&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;&lt;p&gt;Figure&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/shift_operator#fig:shift"&gt;8.2&lt;/a&gt; illustrates successive one-sample delays of a periodic signal&#10;having first period given by &lt;img width="81" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img27.png" alt="$[0,1,2,3,4]$" /&gt;.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Example: &lt;/b&gt;&lt;!-- MATH&#10; $\mbox{{\tt Shift}}_1([1,0,0,0]) = [0,1,0,0]\;$&#10; --&gt;&lt;img width="215" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1086.png" alt="$\" box="" t="tt" hift="" /&gt; (an impulse delayed one sample).&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Example: &lt;/b&gt;&lt;!-- MATH&#10; $\mbox{{\tt Shift}}_1([1,2,3,4]) = [4,1,2,3]\;$&#10; --&gt;&lt;img width="215" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1087.png" alt="$\" box="" t="tt" hift="" /&gt; (a circular shift example).&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Example: &lt;/b&gt;&lt;!-- MATH&#10; $\mbox{{\tt Shift}}_{-2}([1,0,0,0]) = [0,0,1,0]\;$&#10; --&gt;&lt;img width="225" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1088.png" alt="$\" box="" t="tt" hift="" /&gt; (another circular shift example).&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/flip_operator"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/convolution"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Convolution</title><link>https://technick.net/guides/theory/dft/convolution/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/convolution/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/shift_operator"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/graphical_convolution"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00923000000000000000"&gt;Convolution&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Definition: &lt;/b&gt;The &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/convolution"&gt;convolution&lt;/a&gt;&lt;/i&gt;&lt;a name="13664"&gt;&lt;/a&gt; of two signals &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; and &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img13.png" alt="$y$" /&gt; in &lt;img width="26" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img745.png" alt="${\" al="" /&gt; is &#10;denoted ''&lt;img width="37" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1089.png" alt="$x\" st="" /&gt;'' and defined by&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\fbox{$\displaystyle (x\ast y)_n \isdef \sum_{m=0}^{N-1}x(m) y(n-m)$}&#10;\end{displaymath}&#10; --&gt;&lt;img width="238" height="73" border="0" src="https://technick.net/img/guide_dft/img1090.png" alt="\" egin="" isplaymath="" box="" isplaystyle="" ast="" isdef="" um="" n-1="" x="" m="" y="" m="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Note that this is &lt;i&gt;cyclic&lt;/i&gt;&lt;a name="13670"&gt;&lt;/a&gt; or ''circular''&#10;convolution.&lt;a name="tex2html88" href="https://technick.net/guides/theory/dft/footnode#foot12811"&gt;&lt;sup&gt;8.2&lt;/sup&gt;&lt;/a&gt; The&#10;importance of convolution in &lt;i&gt;linear systems theory&lt;/i&gt; is discussed&#10;in &amp;sect;&lt;a href="https://technick.net/guides/theory/dft/appendix_a_linear#sec:LTI"&gt;8.7&lt;/a&gt;&lt;p&gt;&lt;a name="13671"&gt;&lt;/a&gt;Convolution is &lt;i&gt;commutative&lt;/i&gt;, i.e., &lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\fbox{$\displaystyle x\ast y = y\ast x$}&#10;\end{displaymath}&#10; --&gt;&lt;img width="108" height="36" border="0" src="https://technick.net/img/guide_dft/img1091.png" alt="\" egin="" isplaymath="" box="" isplaystyle="" st="" ast="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;em&gt;Proof: &lt;/em&gt;&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;(x\ast y)_n \isdef \sum_{m=0}^{N-1}x(m) y(n-m) =&#10;&#9;\sum_{l=n}^{n-N+1} x(n-l) y(l) = \sum_{l=0}^{N-1}&#10;&#9;y(l) x(n-l) \isdef (y \ast x)_n&#10;\end{displaymath}&#10; --&gt;&lt;img width="619" height="62" border="0" src="https://technick.net/img/guide_dft/img1092.png" alt="\" egin="" isplaymath="" ast="" isdef="" um="" n-1="" x="" m="" y="" m="" um="" n="" n-l="" l="" um="" n-1="" y="" x="" l="" sdef="" ast="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where in the first step we made the change of summation variable &lt;img width="73" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1093.png" alt="$l\" sdef="" /&gt;, and in the second step, we made use of the fact that any sum over&#10;all &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; terms is equivalent to a sum from &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img38.png" alt="$0$" /&gt; to &lt;img width="46" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1078.png" alt="$N-1$" /&gt;.&lt;p&gt;&lt;br /&gt;&lt;hr /&gt;&lt;!--Table of Child-Links--&gt;&lt;a name="CHILD_LINKS"&gt;&lt;strong&gt;Subsections&lt;/strong&gt;&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html2199" href="https://technick.net/guides/theory/dft/graphical_convolution"&gt;Graphical Convolution&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2200" href="https://technick.net/guides/theory/dft/polynomial_multiplication"&gt;Polynomial Multiplication&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2201" href="https://technick.net/guides/theory/dft/multiplication_decimal_numb"&gt;Multiplication of Decimal Numbers&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;!--End of Table of Child-Links--&gt;&#10;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/shift_operator"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/graphical_convolution"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Graphical Convolution</title><link>https://technick.net/guides/theory/dft/graphical_convolution/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/graphical_convolution/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/convolution"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/polynomial_multiplication"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;&lt;a name="SECTION00923100000000000000"&gt;Graphical Convolution&lt;/a&gt;&lt;/h3&gt;&lt;p&gt;Note that the cyclic &lt;a href="https://technick.net/guides/theory/dft/convolution"&gt;convolution&lt;/a&gt; operation can be expressed in terms of&#10;previously defined operators as&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;y(n) \isdef (x\ast h)_n \isdef \sum_{m=0}^{N-1}x(m)h(n-m) =&#10;&#9;\left&lt;x,\mbox{{\tt Shift}}_n(\mbox{{\tt Flip}}(h))\right&gt;\quad\mbox{($h$\ real)}&#10;\end{displaymath}&#10; --&gt;&lt;img width="546" height="62" border="0" src="https://technick.net/img/guide_dft/img1094.png" alt="\" egin="" isplaymath="" n="" sdef="" ast="" isdef="" um="" n-1="" x="" m="" h="" n-m="" shift="" mbox="" t="tt" lip="" right="" t="" uad\mbox="" real="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where &lt;!-- MATH&#10; $x,y\in{\cal C}^N$&#10; --&gt;&lt;img width="69" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1095.png" alt="$x,y\" n="" al="" /&gt; and &lt;!-- MATH&#10; $h\in{\cal R}^N$&#10; --&gt;&lt;img width="58" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1096.png" alt="$h\" n="" al="" /&gt;. It is instructive to interpret the last&#10;expression above &lt;i&gt;graphically&lt;/i&gt;.&lt;p&gt; &lt;div align="CENTER"&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:conv"&gt;&lt;/a&gt;&lt;a name="13690"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure 8.3:&lt;/strong&gt;Illustration of convolution of&#10;&lt;!-- MATH&#10; $y=[1,1,1,1,0,0,0,0]$&#10; --&gt;&lt;img width="156" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img28.png" alt="$y=[1,1,1,1,0,0,0,0]$" /&gt; and its ''&lt;a href="https://technick.net/guides/theory/dft/applications_cross_correlat"&gt;matched filter&lt;/a&gt;'' h=[1,0,0,0,0,1,1,1]&#10;(&lt;img width="48" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img22.png" alt="$N=8$" /&gt;).&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; $\scalebox{0.8}{\includegraphics{eps/conv.eps}}$&#10; --&gt;&lt;img width="737" height="712" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1097.png" alt="\" calebox="" ncludegraphics="" ps="" onv="" ps="" /&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;&lt;p&gt;Figure&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/graphical_convolution#fig:conv"&gt;8.3&lt;/a&gt; illustrates convolution of &lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;y&amp;=&amp;[1,1,1,1,0,0,0,0] \\&#10;h&amp;=&amp;[1,0,0,0,0,1,1,1]&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="193" height="57" border="0" src="https://technick.net/img/guide_dft/img1098.png" alt="\" egin="" qnarray="" h="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;For example, &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img13.png" alt="$y$" /&gt; could be a ''rectangularly windowed signal, zero-padded by&#10;a factor of 2,'' where the signal happened to be dc (all &lt;img width="12" height="13" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img78.png" alt="$1$" /&gt;s). &#10;For the&#10;convolution, we need&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\mbox{{\tt Flip}}(h) = [1,1,1,1,0,0,0,0]&#10;\end{displaymath}&#10; --&gt;&lt;img width="218" height="31" border="0" src="https://technick.net/img/guide_dft/img1099.png" alt="\" egin="" isplaymath="" box="" t="tt" lip="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;which is the same as &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img13.png" alt="$y$" /&gt;. When &lt;!-- MATH&#10; $h=\mbox{{\tt Flip}}(y)$&#10; --&gt;&lt;img width="89" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1100.png" alt="$h=\" box="" t="tt" lip="" /&gt;, we say that &lt;img width="13" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1101.png" alt="$h$" /&gt; is&lt;i&gt;matched filter&lt;/i&gt; for &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img13.png" alt="$y$" /&gt;.&lt;a name="tex2html90" href="https://technick.net/guides/theory/dft/footnode#foot13484"&gt;&lt;sup&gt;8.3&lt;/sup&gt;&lt;/a&gt; In this case, &lt;img width="13" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1101.png" alt="$h$" /&gt; is matched to look for a ''dc&#10;component,'' and also zero-padded by a factor of &lt;img width="12" height="13" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img76.png" alt="$2$" /&gt;. The zero-paddingserves to simulate acyclic convolution using circular convolution. The&#10;figure illustrates the computation of the convolution of &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img13.png" alt="$y$" /&gt; and &lt;img width="13" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1101.png" alt="$h$" /&gt;:&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;y\ast h \isdef \sum_{n=0}^{N-1}y(n)\cdot \mbox{{\tt Flip}}(h) = [4,3,2,1,0,1,2,3]&#10;\end{displaymath}&#10; --&gt;&lt;img width="357" height="62" border="0" src="https://technick.net/img/guide_dft/img1102.png" alt="\" egin="" isplaymath="" ast="" sdef="" um="" n-1="" y="" n="" cdot="" box="" t="tt" lip="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Note that a large peak is obtained in the convolution output at time &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img38.png" alt="$0$" /&gt;.&#10;This large peak (the largest possible if all signals are limited to&lt;img width="48" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1103.png" alt="$[-1,1]$" /&gt; in magnitude), indicates the matched filter has ''found'' the dc&#10;signal starting at time &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img38.png" alt="$0$" /&gt;. This peak would persist even if various&lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;sinusoids&lt;/a&gt; at other frequencies and/or &lt;a href="http://www.treasure-troves.com/physics/noise.php"&gt;noise&lt;/a&gt; were added in.&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/convolution"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/polynomial_multiplication"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Polynomial Multiplication</title><link>https://technick.net/guides/theory/dft/polynomial_multiplication/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/polynomial_multiplication/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/graphical_convolution"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/multiplication_decimal_numb"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;&lt;a name="SECTION00923200000000000000"&gt;Polynomial Multiplication&lt;/a&gt;&lt;/h3&gt;&lt;p&gt;Note that when you multiply two polynomials together, their coefficients&#10;are &lt;i&gt;convolved&lt;/i&gt;. To see this, let &lt;img width="34" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img84.png" alt="$p(x)$" /&gt; denote the &lt;img width="18" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img937.png" alt="$m$" /&gt;th-order polynomial&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;p(x) = p_0 + p_1 x + p_2 x^2 + \cdots + p_m x^m&#10;\end{displaymath}&#10; --&gt;&lt;img width="286" height="31" border="0" src="https://technick.net/img/guide_dft/img1104.png" alt="\" egin="" isplaymath="" p="" p="p" p="p" x="" p="" cdots="" p="" m="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;with coefficients &lt;img width="17" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1105.png" alt="$p_i$" /&gt;, and let &lt;img width="33" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1106.png" alt="$q(x)$" /&gt; denote the &lt;img width="14" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img51.png" alt="$n$" /&gt;th-order polynomial&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;q(x) = q_0 + q_1 x + q_2 x^2 + \cdots + q_n x^n&#10;\end{displaymath}&#10; --&gt;&lt;img width="274" height="31" border="0" src="https://technick.net/img/guide_dft/img1107.png" alt="\" egin="" isplaymath="" q="" q="q" q="q" x="" q="" cdots="" q="" n="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;with coefficients &lt;img width="16" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1108.png" alt="$q_i$" /&gt;. Then we have [&lt;a href="https://technick.net/guides/theory/dft/bibliography#AbramowitzAndStegun"&gt;17&lt;/a&gt;]&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;p(x) q(x) =&#10;\end{displaymath}&#10; --&gt;&lt;img width="84" height="31" border="0" src="https://technick.net/img/guide_dft/img1109.png" alt="\" egin="" isplaymath="" p="" q="q" x="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/graphical_convolution"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/multiplication_decimal_numb"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Multiplication of Decimal Numbers</title><link>https://technick.net/guides/theory/dft/multiplication_decimal_numb/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/multiplication_decimal_numb/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/polynomial_multiplication"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/correlation"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;&lt;a name="SECTION00923300000000000000"&gt;Multiplication of Decimal Numbers&lt;/a&gt;&lt;/h3&gt;&lt;p&gt;Since decimal numbers are implicitly just polynomials in the powers of 10,&#10;e.g.,&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;3819 = 3\cdot 10^3 + 8\cdot 10^2 + 1\cdot 10^1 + 9\cdot 10^0&#10;\end{displaymath}&#10; --&gt;&lt;img width="310" height="28" border="0" src="https://technick.net/img/guide_dft/img1110.png" alt="\" egin="" isplaymath="" dot="" dot="" dot="" dot="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;it follows that &lt;i&gt;multiplying two numbers convolves their digits&lt;/i&gt;&lt;a name="13706"&gt;&lt;/a&gt;. The&#10;only twist is that, unlike normal &lt;a href="https://technick.net/guides/theory/dft/polynomial_multiplication"&gt;polynomial multiplication&lt;/a&gt;, we have&lt;i&gt;carries&lt;/i&gt;. That is, when a &lt;a href="https://technick.net/guides/theory/dft/convolution"&gt;convolution&lt;/a&gt; result exceeds 10, we subtract&#10;10 from the result and add 1 to the digit in the next higher place.&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/polynomial_multiplication"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/correlation"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Correlation</title><link>https://technick.net/guides/theory/dft/correlation/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/correlation/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/multiplication_decimal_numb"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/stretch_operator"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00924000000000000000"&gt;Correlation&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Definition: &lt;/b&gt;The &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/correlation"&gt;correlation&lt;/a&gt; operator&lt;/i&gt;&lt;a name="13710"&gt;&lt;/a&gt; for two signals &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; and &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img13.png" alt="$y$" /&gt; in &lt;img width="26" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img745.png" alt="${\" al="" /&gt;is defined as&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\fbox{$\displaystyle (x\star y)_n \isdef \sum_{m=0}^{N-1}\overline{x(m)} y(m+n)$}&#9;\quad\mbox{(correlation operator ''$\star$'')}&#10;\end{displaymath}&#10; --&gt;&lt;img width="453" height="73" border="0" src="https://technick.net/img/guide_dft/img1111.png" alt="\" egin="" isplaymath="" box="" isplaystyle="" star="" isdef="" um="" n-1="" ov="" x="" y="" n="" uad\mbox="" orrelation="" erator="" q\lq="" tar="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;We may interpret the correlation operator as&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;(x\star y)_n = \left&lt;\mbox{{\tt Shift}}_{-n}(y)\right&gt;{x}&#10;\end{displaymath}&#10; --&gt;&lt;img width="198" height="31" border="0" src="https://technick.net/img/guide_dft/img1112.png" alt="\" egin="" isplaymath="" star="" left="" lt="" mbox="" tt="" hift="" y="" ight="" t="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;which is the coefficient of projection onto &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; of &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img13.png" alt="$y$" /&gt; &lt;i&gt;advanced&lt;/i&gt; by&lt;img width="14" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img51.png" alt="$n$" /&gt; samples (shifted circularly to the &lt;i&gt;left&lt;/i&gt; by &lt;img width="14" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img51.png" alt="$n$" /&gt; samples). The&#10;time shift &lt;img width="14" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img51.png" alt="$n$" /&gt; is called the correlation &lt;i&gt;lag&lt;/i&gt;&lt;a name="13721"&gt;&lt;/a&gt;, and &lt;!-- MATH&#10; $\overline{x(m)}&#10;y(m+n)$&#10; --&gt;&lt;img width="103" height="38" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1113.png" alt="$\" verline="" m="" m="" /&gt; is called a &lt;i&gt;lagged product&lt;/i&gt;&lt;a name="13724"&gt;&lt;/a&gt;. Applications of correlation&#10;are discussed in &amp;sect;&lt;a href="https://technick.net/guides/theory/dft/appendix_b_introductory#sec:SSP"&gt;8.8&lt;/a&gt;.&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/multiplication_decimal_numb"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/stretch_operator"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Stretch Operator</title><link>https://technick.net/guides/theory/dft/stretch_operator/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/stretch_operator/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/correlation"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/zero_padding"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00925000000000000000"&gt;&lt;/a&gt;&lt;a name="13725"&gt;&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/theory/dft/stretch_operator"&gt;Stretch Operator&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;Unlike all previous operators, the &lt;!-- MATH&#10; $\mbox{{\tt Stretch}}_L()$&#10; --&gt;&lt;img width="85" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1114.png" alt="$\" box="" t="tt" tretch="" /&gt; operator maps&#10;a length &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; signal to a length &lt;img width="68" height="19" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1115.png" alt="$M\" sdef="" /&gt; signal, where &lt;img width="15" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1116.png" alt="$L$" /&gt; and &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; are integers.&#10;We use ''&lt;img width="18" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img937.png" alt="$m$" /&gt;'' instead of ''&lt;img width="14" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img51.png" alt="$n$" /&gt;'' as the time index to underscore this fact.&lt;/p&gt;&lt;p&gt; &lt;div align="CENTER"&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:stretch"&gt;&lt;/a&gt;&lt;a name="13732"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure:&lt;/strong&gt;Illustration of &lt;!-- MATH&#10; $\mbox{{\tt Stretch}}_3(x)$&#10; --&gt;&lt;img width="91" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1118.png" alt="$\" box="" t="tt" tretch="" /&gt;.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; $\scalebox{0.8}{\includegraphics{eps/stretch.eps}}$&#10; --&gt;&lt;img width="380" height="281" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1117.png" alt="\" calebox="" ncludegraphics="" ps="" tretch="" ps="" /&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Definition: &lt;/b&gt;A &lt;i&gt;stretch by factor &lt;img width="15" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1116.png" alt="$L$" /&gt;&lt;/i&gt; is defined by&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\mbox{{\tt Stretch}}_{L,m}(x) \isdef &#10;&#9; \left\{\begin{array}{ll}&#10;&#9;x(m/L), &amp; m/L=\mbox{integer} \\&#10;&#9;0, &amp; m/L\neq \mbox{integer} \\&#10;&#9;\end{array}&#10;&#9;\right.&#10;\end{displaymath}&#10; --&gt;&lt;img width="355" height="49" border="0" src="https://technick.net/img/guide_dft/img1119.png" alt="\" egin="" isplaymath="" box="" t="tt" tretch="" m="" isdef="" eft\="" egin="" rray="" er="" l\neq="" box="" nteger="" nd="" rray="" ight="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Thus, to stretch a signal by the factor &lt;img width="15" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1116.png" alt="$L$" /&gt;, insert &lt;img width="42" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1120.png" alt="$L-1$" /&gt; zeros between each&#10;pair of samples. An example of a stretch by factor three is shown in Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/stretch_operator#fig:stretch"&gt;8.4&lt;/a&gt;.&#10;The example is&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\mbox{{\tt Stretch}}_3([4,1,2]) = [4,0,0,1,0,0,2,0,0]&#10;\end{displaymath}&#10; --&gt;&lt;img width="312" height="31" border="0" src="https://technick.net/img/guide_dft/img1121.png" alt="\" egin="" isplaymath="" box="" t="tt" tretch="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;The stretch operator is used to describe and analyze &lt;i&gt;upsampling&lt;/i&gt;,&#10;i.e., increasing the &lt;a href="https://technick.net/guides/theory/dft/shannon_s_sampling_theorem"&gt;sampling rate&lt;/a&gt; by an integer factor.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/correlation"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/zero_padding"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Zero Padding</title><link>https://technick.net/guides/theory/dft/zero_padding/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/zero_padding/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/stretch_operator"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/repeat_operator"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00926000000000000000"&gt;Zero Padding&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Definition: &lt;/b&gt;&lt;i&gt;Zero padding&lt;/i&gt;&lt;a name="13753"&gt;&lt;/a&gt; consists of appending zeros to a signal.&#10;It maps a length &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; signal to a length &lt;img width="57" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1122.png" alt="$M&amp;gt;N$" /&gt; signal, but &lt;img width="21" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img201.png" alt="$M$" /&gt; need not be&#10;an integer multiple of &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt;:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\mbox{{\tt ZeroPad}}_{M,m}(x) \isdef \left\{\begin{array}{ll}&#10;&#9;x(m), &amp; 0 \leq m \leq N-1 \\&#10;&#9;0, &amp; N\leq m \leq M-1 \\&#10;&#9;\end{array}&#10;&#9;\right.&#10;\end{displaymath}&#10; --&gt;&lt;img width="353" height="49" border="0" src="https://technick.net/img/guide_dft/img1123.png" alt="\" egin="" isplaymath="" box="" t="tt" eropad="" m="" isdef="" eft\="" egin="" rray="" l="" leq="" leq="" eq="" nd="" rray="" ight="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;For example,&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\mbox{{\tt ZeroPad}}_10([1,2,3,4,5]) = [1,2,3,4,5,0,0,0,0,0]&#10;\end{displaymath}&#10; --&gt;&lt;img width="370" height="31" border="0" src="https://technick.net/img/guide_dft/img1124.png" alt="\" egin="" isplaymath="" box="" t="tt" eropad="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;The above definition is natural when &lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img50.png" alt="$x(n)$" /&gt; represents a signal starting at&#10;time &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img38.png" alt="$0$" /&gt; and extending for &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; samples. If, on the other hand, we are&#10;zero-padding a spectrum, or we have a time-domain signal which has nonzero&#10;samples for negative time indices, then the zero padding is normally&#10;inserted between samples &lt;img width="74" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1125.png" alt="$(N-1)/2$" /&gt; and &lt;img width="74" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1126.png" alt="$(N+1)/2$" /&gt; for &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; odd (note that&#10;&lt;!-- MATH&#10; $(N+1)/2 = (N+1)/2 - N = -(N-1)/2 \left(\mbox{mod\ }N\right)$&#10; --&gt;&lt;img width="369" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1127.png" alt="$(N+1)/2 = (N+1)/2 - N = -(N-1)/2 \" eft="" box="" od\="" right="" /&gt;), and similarly for even &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt;.&#10;I.e., for spectra, zero padding is inserted at the point &lt;img width="54" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img925.png" alt="$z=-1$" /&gt;(&lt;!-- MATH&#10; $\omega=\pi f_s$&#10; --&gt;&lt;img width="60" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1128.png" alt="$\" mega="\pi" f="" s="" /&gt;). Figure&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/zero_padding#fig:zpad"&gt;8.5&lt;/a&gt; illustrates this second form of zero&#10;padding. It is also used in conjunction with zero-phase FFT windows(discussed a bit further below).&lt;p&gt; &lt;div align="CENTER"&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:zpad"&gt;&lt;/a&gt;&lt;a name="13766"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure 8.5:&lt;/strong&gt;Illustration of frequency-domain&#10;zero padding: a) Original spectrum &lt;img width="117" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img30.png" alt="$X=[3,2,1,1,2]$" /&gt; plotted over the&#10;domain &lt;img width="98" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img31.png" alt="$k\" n="" /&gt; where &lt;img width="48" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img24.png" alt="$N=5$" /&gt; (i.e., as the spectral array would&#10;normally exist in a computer array). b) &lt;!-- MATH&#10; $\mbox{{\tt ZeroPad}}_{11}(X)$&#10; --&gt;&lt;img width="103" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1130.png" alt="$\" box="" t="tt" eropad="" /&gt;. c) The&#10;same signal &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img33.png" alt="$X$" /&gt; plotted over the domain &lt;!-- MATH&#10; $k\in[-(N-1)/2,(N-1)/2]$&#10; --&gt;&lt;img width="201" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img34.png" alt="$k\" n="" n-1="" /&gt; which&#10;is more natural for interpreting &lt;a href="https://technick.net/guides/theory/dft/positive_negative_frequenci"&gt;negative frequencies&lt;/a&gt;. d)&#10;&lt;!-- MATH&#10; $\mbox{{\tt ZeroPad}}_{11}(X)$&#10; --&gt;&lt;img width="103" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1130.png" alt="$\" box="" t="tt" eropad="" /&gt;.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; $\scalebox{0.8}{\includegraphics{eps/zpad.eps}}$&#10; --&gt;&lt;img width="597" height="416" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1129.png" alt="\" calebox="" ncludegraphics="" ps="" pad="" ps="" /&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;&lt;p&gt;Using &lt;a href="https://technick.net/guides/theory/dft/fourier_theorems"&gt;Fourier theorems&lt;/a&gt;, we will be able to show that &lt;i&gt;zero padding in&#10;the time domain&lt;/i&gt; gives &lt;i&gt;bandlimited interpolation in the frequency&#10;domain&lt;/i&gt;. Similarly, &lt;i&gt;zero padding in the frequency domain&lt;/i&gt; gives &lt;i&gt;bandlimited interpolation in the time domain&lt;/i&gt;. This is how ideal sampling&#10;rate conversion is accomplished.&lt;/p&gt;&lt;p&gt;It is important to note that bandlimited interpolation is &lt;i&gt;ideal&lt;/i&gt;interpolation in &lt;a href="http://www.dsptutor.freeuk.com/default.php"&gt;digital signal processing&lt;/a&gt;.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/stretch_operator"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/repeat_operator"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Repeat Operator</title><link>https://technick.net/guides/theory/dft/repeat_operator/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/repeat_operator/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/zero_padding"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/decimation_operator"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00927000000000000000"&gt;Repeat Operator&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;Like the &lt;!-- MATH&#10; $\mbox{{\tt Stretch}}_L()$&#10; --&gt;&lt;img width="85" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1114.png" alt="$\" box="" t="tt" tretch="" /&gt; operator, the &lt;!-- MATH&#10; $\mbox{{\tt Repeat}}_L()$&#10; --&gt;&lt;img width="76" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1131.png" alt="$\" box="" t="tt" epeat="" /&gt; operator maps a length&lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; signal to a length &lt;img width="68" height="19" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1115.png" alt="$M\" sdef="" /&gt; signal:&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Definition: &lt;/b&gt;The &lt;i&gt;repeat &lt;img width="15" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1116.png" alt="$L$" /&gt; times&lt;/i&gt; operator is defined by&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\mbox{{\tt Repeat}}_{L,m}(x) \isdef x(m), \qquad m=0,1,2,\ldots,M-1&#10;\end{displaymath}&#10; --&gt;&lt;img width="380" height="34" border="0" src="https://technick.net/img/guide_dft/img1132.png" alt="\" egin="" isplaymath="" box="" t="tt" epeat="" m="" isdef="" qquad="" dots="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where &lt;img width="68" height="19" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1115.png" alt="$M\" sdef="" /&gt;.&#10;Thus, the &lt;!-- MATH&#10; $\mbox{{\tt Repeat}}_L()$&#10; --&gt;&lt;img width="76" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1131.png" alt="$\" box="" t="tt" epeat="" /&gt; operator simply repeats its input signal&lt;img width="15" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1116.png" alt="$L$" /&gt; times.&lt;a name="tex2html93" href="https://technick.net/guides/theory/dft/footnode#foot12879"&gt;&lt;sup&gt;8.4&lt;/sup&gt;&lt;/a&gt;An example of &lt;!-- MATH&#10; $\mbox{{\tt Repeat}}_2(x)$&#10; --&gt;&lt;img width="83" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1135.png" alt="$\" box="" t="tt" epeat="" /&gt; is shown in Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/repeat_operator#fig:repeat"&gt;8.6&lt;/a&gt;.&#10;The example is&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\mbox{{\tt Repeat}}_2([0,2,1,4,3,1]) = [0,2,1,4,3,1,0,2,1,4,3,1]&#10;\end{displaymath}&#10; --&gt;&lt;img width="402" height="31" border="0" src="https://technick.net/img/guide_dft/img1136.png" alt="\" egin="" isplaymath="" box="" t="tt" epeat="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt; &lt;div align="CENTER"&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:repeat"&gt;&lt;/a&gt;&lt;a name="13797"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure:&lt;/strong&gt;Illustration of &lt;!-- MATH&#10; $\mbox{{\tt Repeat}}_2(x)$&#10; --&gt;&lt;img width="83" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1138.png" alt="$\" box="" t="tt" epeat="" /&gt;.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; $\scalebox{0.8}{\includegraphics{eps/repeat.eps}}$&#10; --&gt;&lt;img width="594" height="120" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1137.png" alt="\" calebox="" ncludegraphics="" ps="" epeat="" ps="" /&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;&lt;p&gt;A frequency-domain example is shown in Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/repeat_operator#fig:repeat3d"&gt;8.7&lt;/a&gt;.&#10;Figure&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/repeat_operator#fig:repeat3d"&gt;8.7&lt;/a&gt;a shows the original spectrum &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img33.png" alt="$X$" /&gt;, Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/repeat_operator#fig:repeat3d"&gt;8.7&lt;/a&gt;b&#10;shows the same spectrum plotted over the unit circle in the &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt; plane,&#10;and Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/repeat_operator#fig:repeat3d"&gt;8.7&lt;/a&gt;c shows &lt;!-- MATH&#10; $\mbox{{\tt Repeat}}_3(X)$&#10; --&gt;&lt;img width="88" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1139.png" alt="$\" box="" t="tt" epeat="" /&gt;. The &lt;img width="41" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img666.png" alt="$z=1$" /&gt; point (dc) is on&#10;the right-rear face of the enclosing box. Note that when viewed as&#10;centered about &lt;img width="42" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img213.png" alt="$k=0$" /&gt;, &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img33.png" alt="$X$" /&gt; is a somewhat ''triangularly shaped''&#10;spectrum. The repeating block can be considered to extend from the&#10;point at &lt;img width="41" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img666.png" alt="$z=1$" /&gt; to the point far to the left, or it can be considered&#10;the triangularly shaped ''baseband'' spectrum centered about &lt;img width="41" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img666.png" alt="$z=1$" /&gt;.&lt;/p&gt;&lt;p&gt; &lt;div align="CENTER"&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:repeat3d"&gt;&lt;/a&gt;&lt;a name="13810"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure:&lt;/strong&gt;Illustration of &lt;!-- MATH&#10; $\mbox{{\tt Repeat}}_3(X)$&#10; --&gt;&lt;img width="88" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1141.png" alt="$\" box="" t="tt" epeat="" /&gt;.&#10;a) Conventional plot of &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img33.png" alt="$X$" /&gt;. b) Plot of &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img33.png" alt="$X$" /&gt; over the unit circle in&#10;the &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt; plane. c) &lt;!-- MATH&#10; $\mbox{{\tt Repeat}}_3(X)$&#10; --&gt;&lt;img width="88" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1141.png" alt="$\" box="" t="tt" epeat="" /&gt;.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; $\scalebox{0.8}{\includegraphics{eps/repeat3d.eps}}$&#10; --&gt;&lt;img width="532" height="733" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1140.png" alt="\" calebox="" ncludegraphics="" ps="" epeat3d="" ps="" /&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;&lt;p&gt;The &lt;a href="https://technick.net/guides/theory/dft/repeat_operator"&gt;repeat operator&lt;/a&gt; is used to state the &lt;a href="https://technick.net/guides/theory/dft/fourier_theorems"&gt;Fourier theorem&lt;/a&gt; &lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\mbox{{\tt Stretch}}_L \leftrightarrow \mbox{{\tt Repeat}}_L&#10;\end{displaymath}&#10; --&gt;&lt;img width="167" height="31" border="0" src="https://technick.net/img/guide_dft/img1142.png" alt="\" egin="" isplaymath="" box="" t="tt" tretch="" leftrightarrow="" box="" t="tt" epeat="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;That is, when you stretch a signal by the factor &lt;img width="15" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1116.png" alt="$L$" /&gt;, its spectrum is&#10;repeated &lt;img width="15" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1116.png" alt="$L$" /&gt; times around the unit circle.&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/zero_padding"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/decimation_operator"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Decimation Operator</title><link>https://technick.net/guides/theory/dft/decimation_operator/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/decimation_operator/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/repeat_operator"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/alias_operator"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00928000000000000000"&gt;Decimation Operator&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Definition: &lt;/b&gt;&lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/decimation_operator"&gt;Decimation&lt;/a&gt; by &lt;img width="15" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1116.png" alt="$L$" /&gt;&lt;/i&gt; is defined as taking every &lt;img width="15" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1116.png" alt="$L$" /&gt;th sample, starting&#10;with sample &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img38.png" alt="$0$" /&gt;:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\mbox{{\tt Dec}}_{L,m}(x) \isdef x(mL), \; m = 0,1,2,\ldots,M-1\quad (N=LM, x\in{\cal C}^N)&#10;\end{displaymath}&#10; --&gt;&lt;img width="497" height="32" border="0" src="https://technick.net/img/guide_dft/img1143.png" alt="\" egin="" isplaymath="" box="" t="tt" ec="" m="" isdef="" l="" ldots="" m-1\quad="" lm="" x\in="" al="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;The &lt;!-- MATH&#10; $\mbox{{\tt Dec}}_L()$&#10; --&gt;&lt;img width="51" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1144.png" alt="$\" box="" t="tt" ec="" /&gt; operator maps a length &lt;img width="68" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1145.png" alt="$N=LM$" /&gt; signal down to a length &lt;img width="21" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img201.png" alt="$M$" /&gt;signal. It is the inverse of the &lt;!-- MATH&#10; $\mbox{{\tt Stretch}}_L()$&#10; --&gt;&lt;img width="85" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1114.png" alt="$\" box="" t="tt" tretch="" /&gt; operator (but not vice&#10;versa), i.e.,&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;\mbox{{\tt Dec}}_L(\mbox{{\tt Stretch}}_L(x)) &amp;=&amp; x \\&#10;\mbox{{\tt Stretch}}_L(\mbox{{\tt Dec}}_L(x)) &amp;\neq&amp; x\quad \mbox{(in general).}&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="320" height="57" border="0" src="https://technick.net/img/guide_dft/img1146.png" alt="\" egin="" qnarray="" box="" t="tt" ec="" mbox="" t="tt" tretch="" x="" mbox="" h="" mbox="" t="tt" ec="" x="" eq="" quad="" box="" n="" neral="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;The stretch and decimation operations do not commute because they are&#10;linear &lt;i&gt;time-varying&lt;/i&gt; operators. They can be modeled using&#10;time-varying &lt;i&gt;switches&lt;/i&gt; controlled by the sample index &lt;img width="14" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img51.png" alt="$n$" /&gt;.&lt;p&gt; &lt;div align="CENTER"&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:dec"&gt;&lt;/a&gt;&lt;a name="13846"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure:&lt;/strong&gt;Illustration of &lt;!-- MATH&#10; $\mbox{{\tt Dec}}_2(x)$&#10; --&gt;&lt;img width="58" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1148.png" alt="$\" box="" t="tt" ec="" /&gt;. The&#10;white-filled circles indicate the retained samples while the&#10;black-filled circles indicate the discarded samples.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; $\scalebox{0.8}{\includegraphics{eps/dec.eps}}$&#10; --&gt;&lt;img width="462" height="176" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1147.png" alt="\" calebox="" ncludegraphics="" ps="" ec="" ps="" /&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;&lt;p&gt;An example of &lt;!-- MATH&#10; $\mbox{{\tt Dec}}_2(x)$&#10; --&gt;&lt;img width="58" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1149.png" alt="$\" box="" t="tt" ec="" /&gt; is shown in Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/decimation_operator#fig:dec"&gt;8.8&lt;/a&gt;.&#10;The example is&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\mbox{{\tt Dec}}_2([0,1,2,3,4,5,6,7,8,9]) = [0,2,4,6,8]&#10;\end{displaymath}&#10; --&gt;&lt;img width="325" height="31" border="0" src="https://technick.net/img/guide_dft/img1150.png" alt="\" egin="" isplaymath="" box="" t="tt" ec="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/repeat_operator"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/alias_operator"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Alias Operator</title><link>https://technick.net/guides/theory/dft/alias_operator/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/alias_operator/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/decimation_operator"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/even_odd_functions"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00929000000000000000"&gt;Alias Operator&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;&lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/decimation_theorem_aliasing"&gt;Aliasing&lt;/a&gt;&lt;/i&gt;&lt;a name="13858"&gt;&lt;/a&gt; occurs when a signal is &lt;i&gt;undersampled&lt;/i&gt;. If the signal&lt;a href="https://technick.net/guides/theory/dft/shannon_s_sampling_theorem"&gt;sampling rate&lt;/a&gt; &lt;img width="19" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img55.png" alt="$f_s$" /&gt; is too low, we get &lt;i&gt;frequency-domain aliasing&lt;/i&gt;&lt;a name="13860"&gt;&lt;/a&gt;.&lt;/p&gt;&lt;p&gt;The topic of aliasing normally arises in the context of &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/shannon_s_sampling_theorem"&gt;sampling&#10;a continuous-time signal&lt;/a&gt;&lt;/i&gt;. &lt;a href="https://technick.net/guides/theory/dft/shannon_s_sampling_theorem"&gt;Shannon's Sampling Theorem&lt;/a&gt; says that we&#10;will have no &lt;a href="https://technick.net/guides/theory/dft/aliasing_sampled_continuous"&gt;aliasing due to sampling&lt;/a&gt; as long as the sampling rate is&#10;higher than twice the highest frequency present in the signal being&#10;sampled.&lt;/p&gt;&lt;p&gt;In this chapter, we are considering only discrete-time signals, in&#10;order to keep the math as simple as possible. Aliasing in this&#10;context occurs when a discrete-time signal is decimated to reduce its&#10;sampling rate. You can think of continuous-time sampling as the&#10;limiting case for which the starting sampling rate is infinity.&lt;/p&gt;&lt;p&gt;An example of aliasing is shown in Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/alias_operator#fig:aliasing"&gt;8.9&lt;/a&gt;. In the figure,&#10;the high-frequency &lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;sinusoid&lt;/a&gt; is indistinguishable from the lower&#10;frequency sinusoid due to aliasing. We say the higher frequency&lt;i&gt;aliases&lt;/i&gt; to the lower frequency. Undersampling in the frequency&#10;domain gives rise to&lt;i&gt;time-domain aliasing&lt;/i&gt;. If time or frequency is not specified, the&#10;term ''aliasing'' normally means frequency-domain aliasing.&lt;/p&gt;&lt;p&gt; &lt;div align="CENTER"&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:aliasing"&gt;&lt;/a&gt;&lt;a name="13865"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure 8.9:&lt;/strong&gt;Example of aliasing due to&#10;undersampling in time.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; $\scalebox{0.8}{\includegraphics{eps/aliasing.eps}}$&#10; --&gt;&lt;img width="498" height="160" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1151.png" alt="\" calebox="" ncludegraphics="" ps="" liasing="" ps="" /&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;&lt;p&gt;The &lt;i&gt;aliasing operator&lt;/i&gt;&lt;a name="13871"&gt;&lt;/a&gt; is defined by&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\mbox{{\tt Alias}}_{L,m}(x) \isdef \sum_{l=0}^{N-1}x\left(m+l\frac{N}{L}\right), &#10;&#9;\; m = 0,1,2,\ldots,M-1\quad (N=LM, x\in{\cal C}^N)&#10;\end{displaymath}&#10; --&gt;&lt;img width="602" height="62" border="0" src="https://technick.net/img/guide_dft/img1152.png" alt="\" egin="" isplaymath="" box="" t="tt" lias="" m="" isdef="" um="" n-1="" x\left="" m="" right="" ldots="" m-1\quad="" lm="" x\in="" al="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Like the &lt;!-- MATH&#10; $\mbox{{\tt Dec}}_L()$&#10; --&gt;&lt;img width="51" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1144.png" alt="$\" box="" t="tt" ec="" /&gt; operator, the &lt;!-- MATH&#10; $\mbox{{\tt Alias}}_L()$&#10; --&gt;&lt;img width="68" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1153.png" alt="$\" box="" t="tt" lias="" /&gt; operator maps a length&lt;img width="68" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1145.png" alt="$N=LM$" /&gt; signal down to a length &lt;img width="21" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img201.png" alt="$M$" /&gt; signal. The way to think of it is to&#10;partition the original &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; samples in to &lt;img width="15" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1116.png" alt="$L$" /&gt; blocks of length &lt;img width="21" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img201.png" alt="$M$" /&gt;, with the&#10;first block extending from sample &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img38.png" alt="$0$" /&gt; to sample &lt;img width="49" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1154.png" alt="$M-1$" /&gt;, the second block&#10;from &lt;img width="21" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img201.png" alt="$M$" /&gt; to &lt;img width="57" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1155.png" alt="$2M-1$" /&gt;, etc. Then just add up the blocks. This process is&#10;called &lt;i&gt;aliasing&lt;/i&gt;. If the original signal &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; is a time signal, it is&#10;called &lt;i&gt;time-domain aliasing&lt;/i&gt;&lt;a name="13882"&gt;&lt;/a&gt;; if it is a spectrum, we call it &lt;i&gt;frequency-domain aliasing&lt;/i&gt;&lt;a name="13884"&gt;&lt;/a&gt;, or just aliasing. Note that aliasing is &lt;i&gt;not invertible&lt;/i&gt;. Once the blocks are added together, it is not possible to&#10;recover the original blocks, in general.&lt;p&gt;For example,&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;\mbox{{\tt Alias}}_2([0,1,2,3,4,5]) &amp;=&amp; [0,1,2] + [3,4,5] = [3,5,7] \\&#10;\mbox{{\tt Alias}}_3([0,1,2,3,4,5]) &amp;=&amp; [0,1] + [2,3] + [4,5] = [6,9]&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="423" height="57" border="0" src="https://technick.net/img/guide_dft/img1156.png" alt="\" egin="" qnarray="" box="" t="tt" lias="" t="tt" lias="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;The alias operator is used to state the &lt;a href="https://technick.net/guides/theory/dft/fourier_theorems"&gt;Fourier theorem&lt;/a&gt; &lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\mbox{{\tt Dec}}_L \leftrightarrow \mbox{{\tt Alias}}_L&#10;\end{displaymath}&#10; --&gt;&lt;img width="121" height="29" border="0" src="https://technick.net/img/guide_dft/img1157.png" alt="\" egin="" isplaymath="" box="" t="tt" ec="" leftrightarrow="" box="" t="tt" lias="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;That is, when you decimate a signal by the factor &lt;img width="15" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1116.png" alt="$L$" /&gt;, its spectrum is&#10;aliased by the factor &lt;img width="15" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1116.png" alt="$L$" /&gt;.&lt;p&gt; &lt;div align="CENTER"&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:aliasingfd"&gt;&lt;/a&gt;&lt;a name="13899"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure:&lt;/strong&gt;Illustration of aliasing in&#10;the frequency domain.&#10;a) &lt;!-- MATH&#10; $\mbox{{\tt Repeat}}_3(X)$&#10; --&gt;&lt;img width="88" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1141.png" alt="$\" box="" t="tt" epeat="" /&gt; from Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/repeat_operator#fig:repeat3d"&gt;8.7&lt;/a&gt;c. &#10;b) First half of the original unit circle (&lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img38.png" alt="$0$" /&gt; to &lt;img width="14" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img39.png" alt="$\" i="i" /&gt;) wrapped around the&#10;&#9;new, smaller unit circle (which is magnified to the original size). &#10;c) Second half (&lt;img width="14" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img39.png" alt="$\" i="i" /&gt; to &lt;img width="22" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img40.png" alt="$2\" i="i" /&gt;), also wrapped around the new unit circle.&#10;d) Overlay of components to be summed.&#10;e) Sum of components (the aliased spectrum).&#10;f) Both sum and overlay.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; $\scalebox{0.8}{\includegraphics{eps/aliasingfd.eps}}$&#10; --&gt;&lt;img width="615" height="742" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1158.png" alt="\" calebox="" ncludegraphics="" ps="" liasingfd="" ps="" /&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;&lt;p&gt;Figure&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/alias_operator#fig:aliasingfd"&gt;8.10&lt;/a&gt; shows the result of &lt;!-- MATH&#10; $\mbox{{\tt Alias}}_2$&#10; --&gt;&lt;img width="53" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1159.png" alt="$\" box="" t="tt" lias="" /&gt; applied to &lt;!-- MATH&#10; $\mbox{{\tt Repeat}}_3(X)$&#10; --&gt;&lt;img width="88" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1139.png" alt="$\" box="" t="tt" epeat="" /&gt;from Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/repeat_operator#fig:repeat3d"&gt;8.7&lt;/a&gt;c. Imagine the spectrum of&#10;Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/alias_operator#fig:aliasingfd"&gt;8.10&lt;/a&gt;a as being plotted on a piece of paper rolled&#10;to form a cylinder, with the edges of the paper meeting at &lt;img width="41" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img666.png" alt="$z=1$" /&gt; (upper&#10;right corner of Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/alias_operator#fig:aliasingfd"&gt;8.10&lt;/a&gt;a). Then the &lt;!-- MATH&#10; $\mbox{{\tt Alias}}_2$&#10; --&gt;&lt;img width="53" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1159.png" alt="$\" box="" t="tt" lias="" /&gt; operation can be&#10;simulated by rerolling the cylinder of paper to cut its circumference in&#10;half. That is, reroll it so that at every point, &lt;i&gt;two&lt;/i&gt; sheets of paper&#10;are in contact at all points on the new, narrower cylinder. Now, simply&#10;add the values on the two overlapping sheets together, and you have the&#10;&lt;!-- MATH&#10; $\mbox{{\tt Alias}}_2$&#10; --&gt;&lt;img width="53" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1159.png" alt="$\" box="" t="tt" lias="" /&gt; of the original spectrum on the unit circle. To alias by &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img392.png" alt="$3$" /&gt;,&#10;we would shrink the cylinder further until the paper edges again line up,&#10;giving three layers of paper in the cylinder, and so on.&lt;/p&gt;&lt;p&gt;Figure&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/alias_operator#fig:aliasingfd"&gt;8.10&lt;/a&gt;b shows what is plotted on the first circular wrap of the&#10;cylinder of paper, and Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/alias_operator#fig:aliasingfd"&gt;8.10&lt;/a&gt;c shows what is on the second wrap.&#10;These are overlaid in Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/alias_operator#fig:aliasingfd"&gt;8.10&lt;/a&gt;d and added together in&#10;Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/alias_operator#fig:aliasingfd"&gt;8.10&lt;/a&gt;e. Finally, Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/alias_operator#fig:aliasingfd"&gt;8.10&lt;/a&gt;f shows both the addition&#10;and the overlay of the two components. We say that the second component&#10;(Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/alias_operator#fig:aliasingfd"&gt;8.10&lt;/a&gt;c) ''aliases'' to new frequency components, while the&#10;first component (Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/alias_operator#fig:aliasingfd"&gt;8.10&lt;/a&gt;b) is considered to be at its original&#10;frequencies. If the unit circle of Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/alias_operator#fig:aliasingfd"&gt;8.10&lt;/a&gt;a covers frequencies&lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img38.png" alt="$0$" /&gt; to &lt;img width="19" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img55.png" alt="$f_s$" /&gt;, all other unit circles (Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/alias_operator#fig:aliasingfd"&gt;8.10&lt;/a&gt;b-c) cover&#10;frequencies &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img38.png" alt="$0$" /&gt; to &lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img670.png" alt="$f_s/2$" /&gt;. &lt;/p&gt;&lt;p&gt;In general, aliasing by the factor &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1160.png" alt="$K$" /&gt; corresponds to a &lt;i&gt;sampling-rate&#10;reduction&lt;/i&gt; by the factor &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1160.png" alt="$K$" /&gt;. To prevent aliasing when reducing the&#10;sampling rate, an &lt;i&gt;anti-aliasing lowpass filter&lt;/i&gt;&lt;a name="13916"&gt;&lt;/a&gt; is generally used.&#10;The lowpass filter attenuates all signal components at frequencies outside&#10;the interval &lt;!-- MATH&#10; $[-f_s/(2K),f_s/(2K)]$&#10; --&gt;&lt;img width="147" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1161.png" alt="$[-f_s/(2K),f_s/(2K)]$" /&gt;. If they are not filtered out, they&#10;will alias, and aliasing is generally non-invertible.&lt;/p&gt;&lt;p&gt;Conceptually, the unit circle is reduced by &lt;!-- MATH&#10; $\mbox{{\tt Alias}}_2$&#10; --&gt;&lt;img width="53" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1159.png" alt="$\" box="" t="tt" lias="" /&gt; to a unit circle&lt;i&gt;half&lt;/i&gt; the original size, where the two halves are summed. The inverse&#10;of aliasing is then ''repeating'' which should be understood as &lt;i&gt;increasing&lt;/i&gt; the unit circle circumference using ''&lt;a href="https://technick.net/guides/theory/dft/modulo_indexing_periodic"&gt;periodic extension&lt;/a&gt;'' to&#10;generate ''more spectrum'' for the larger unit circle. In the time domain,&lt;a href="https://technick.net/guides/theory/dft/decimation_operator"&gt;decimation&lt;/a&gt; is the inverse of the &lt;a href="https://technick.net/guides/theory/dft/stretch_operator"&gt;stretch operator&lt;/a&gt;. All of these&#10;relationships are precise only for &lt;i&gt;integer&lt;/i&gt;stretch/decimation/aliasing/repeat factors; in continuous time, the&#10;restriction to integer factors is removed, and we obtain the (simpler) &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/appendix_d_similarity"&gt;similarity theorem&lt;/a&gt;&lt;/i&gt; (proved in &amp;sect;&lt;a href="https://technick.net/guides/theory/dft/appendix_d_similarity#sec:Similarity"&gt;8.10&lt;/a&gt;).&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/decimation_operator"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/even_odd_functions"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Even and Odd Functions</title><link>https://technick.net/guides/theory/dft/even_odd_functions/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/even_odd_functions/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/alias_operator"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/fourier_theorems"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00930000000000000000"&gt;Even and Odd Functions&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;Some of the &lt;a href="https://technick.net/guides/theory/dft/fourier_theorems"&gt;Fourier theorems&lt;/a&gt; can be succinctly expressed in terms of even&#10;and odd symmetries.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Definition: &lt;/b&gt;A function &lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1162.png" alt="$f(n)$" /&gt; is said to be &lt;i&gt;even&lt;/i&gt;&lt;a name="13922"&gt;&lt;/a&gt; if &lt;img width="101" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1163.png" alt="$f(-n)=f(n)$" /&gt;. An &lt;a href="https://technick.net/guides/theory/dft/even_odd_functions"&gt;even function&lt;/a&gt; is also&lt;i&gt;symmetric&lt;/i&gt;&lt;a name="13924"&gt;&lt;/a&gt;, but the term symmetric applies&#10;also to functions symmetric about a point other than &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img38.png" alt="$0$" /&gt;.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Definition: &lt;/b&gt;A function &lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1162.png" alt="$f(n)$" /&gt; is said to be &lt;i&gt;odd&lt;/i&gt;&lt;a name="13928"&gt;&lt;/a&gt;if &lt;img width="113" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1164.png" alt="$f(-n)=-f(n)$" /&gt;. An &lt;a href="https://technick.net/guides/theory/dft/even_odd_functions"&gt;odd function&lt;/a&gt; is also called&lt;i&gt;antisymmetric&lt;/i&gt;&lt;a name="13930"&gt;&lt;/a&gt;.&lt;/p&gt;&lt;p&gt;Note that every odd function &lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1162.png" alt="$f(n)$" /&gt; must satisfy &lt;img width="63" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1165.png" alt="$f(0)=0$" /&gt;. Moreover,&#10;for any &lt;!-- MATH&#10; $x\in{\cal C}^N$&#10; --&gt;&lt;img width="54" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img687.png" alt="$x\" n="" al="" /&gt; with &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; even, we also have &lt;img width="84" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1166.png" alt="$x(N/2)=0$" /&gt; since&#10;&lt;!-- MATH&#10; $x(N/2)=-x(-N/2)=-x(-N/2+N)=-x(N/2)$&#10; --&gt;&lt;img width="366" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1167.png" alt="$x(N/2)=-x(-N/2)=-x(-N/2+N)=-x(N/2)$" /&gt;, i.e., &lt;img width="33" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1168.png" alt="$N/2$" /&gt; and &lt;img width="46" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1169.png" alt="$-N/2$" /&gt; index the&#10;same point.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Theorem: &lt;/b&gt;Every function &lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1162.png" alt="$f(n)$" /&gt; can be decomposed into a sum of its even part&lt;img width="41" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1170.png" alt="$f_e(n)$" /&gt; and odd part &lt;img width="41" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1171.png" alt="$f_o(n)$" /&gt;, where&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;f_e(n) &amp;\isdef &amp; \frac{f(n) + f(-n)}{2} \\&#10;f_o(n) &amp;\isdef &amp; \frac{f(n) - f(-n)}{2}&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="197" height="89" border="0" src="https://technick.net/img/guide_dft/img1172.png" alt="\" egin="" qnarray="" e="" isdef="" rac="" n="" n="" o="" isdef="" rac="" n="" n="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;em&gt;Proof: &lt;/em&gt;In the above definitions, &lt;img width="19" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1173.png" alt="$f_e$" /&gt; is even and &lt;img width="19" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1174.png" alt="$f_o$" /&gt; is odd by construction.&#10;Summing, we have&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;f_e(n) + f_o(n) = \frac{f(n) + f(-n)}{2} + \frac{f(n) - f(-n)}{2} = f(n)&#10;\end{displaymath}&#10; --&gt;&lt;img width="421" height="44" border="0" src="https://technick.net/img/guide_dft/img1175.png" alt="\" egin="" isplaymath="" e="" f="" n="" rac="" n="" n="" rac="" n="" n="" n="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Theorem: &lt;/b&gt;The product of even functions is even, the product of odd functions&#10;is even, and the product of an even times an odd function is odd.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;em&gt;Proof: &lt;/em&gt;Readily shown.&lt;/p&gt;&lt;p&gt;Since even times even is even, odd times odd is even, and even times odd is&#10;odd, we can think of even as &lt;img width="29" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1176.png" alt="$(+)$" /&gt; and odd as &lt;img width="29" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1177.png" alt="$(-)$" /&gt;: &lt;!-- MATH&#10; $(+)\cdot(+) = (+)$&#10; --&gt;&lt;img width="111" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1178.png" alt="$(+)\" dot="" /&gt;,&#10;&lt;!-- MATH&#10; $(-)\cdot(-) = (+)$&#10; --&gt;&lt;img width="111" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1179.png" alt="$(-)\" dot="" /&gt;, and &lt;!-- MATH&#10; $(+)\cdot(-) = (-)\cdot(+) = (-)$&#10; --&gt;&lt;img width="193" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1180.png" alt="$(+)\" dot="" dot="" /&gt;.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Example: &lt;/b&gt;&lt;!-- MATH&#10; $\cos(\omega_k n)$&#10; --&gt;&lt;img width="65" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1181.png" alt="$\" os="" mega="" /&gt; is an &lt;i&gt;even&lt;/i&gt; signal since &lt;!-- MATH&#10; $\cos(-\theta)=\cos(\theta)$&#10; --&gt;&lt;img width="121" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1182.png" alt="$\" os="" heta="" os="" heta="" /&gt;.&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Example: &lt;/b&gt;&lt;!-- MATH&#10; $\sin(\omega_k n)$&#10; --&gt;&lt;img width="63" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1183.png" alt="$\" in="" mega="" /&gt; is an &lt;i&gt;odd&lt;/i&gt; signal since &lt;!-- MATH&#10; $\sin(-\theta)=-\sin(\theta)$&#10; --&gt;&lt;img width="132" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1184.png" alt="$\" in="" heta="" in="" heta="" /&gt;.&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Example: &lt;/b&gt;&lt;!-- MATH&#10; $\cos(\omega_k n)\cdot\sin(\omega_l n)$&#10; --&gt;&lt;img width="133" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1185.png" alt="$\" os="" mega="" cdot\sin="" mega="" /&gt; is &lt;i&gt;odd&lt;/i&gt; (even times odd).&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Example: &lt;/b&gt;&lt;!-- MATH&#10; $\sin(\omega_k n)\cdot\sin(\omega_l n)$&#10; --&gt;&lt;img width="131" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1186.png" alt="$\" in="" mega="" cdot\sin="" mega="" /&gt; is &lt;i&gt;even&lt;/i&gt; (odd times odd).&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Theorem: &lt;/b&gt;The sum of all the samples of an odd signal &lt;img width="20" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1187.png" alt="$x_o$" /&gt; in &lt;img width="26" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img745.png" alt="${\" al="" /&gt; is zero.&lt;/p&gt;&lt;p&gt;&lt;em&gt;Proof: &lt;/em&gt;This is readily shown by writing the sum as &lt;!-- MATH&#10; $x_o(0) + [x_o(1) + x_o(-1)]&#10;+ \cdots + x(N/2)$&#10; --&gt;&lt;img width="282" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1188.png" alt="$x_o(0) + [x_o(1) + x_o(-1)]&#10;+ \" dots="" n="" /&gt;, where the last term only occurs when &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; is even. Each&#10;term so written is zero for an odd signal &lt;img width="20" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1187.png" alt="$x_o$" /&gt;.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Example: &lt;/b&gt;For all &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;DFT&lt;/a&gt; sinusoidal frequencies &lt;!-- MATH&#10; $\omega_k=2\pi k/N$&#10; --&gt;&lt;img width="91" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img57.png" alt="$\" mega="" pi="" n="" /&gt;,&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\sum_{n=0}^{N-1}\sin(\omega_k n) \cos(\omega_k n) = 0, \; k=0,1,2,\ldots,N-1&#10;\end{displaymath}&#10; --&gt;&lt;img width="374" height="62" border="0" src="https://technick.net/img/guide_dft/img1189.png" alt="\" egin="" isplaymath="" um="" n-1="" sin="" omega="" k="" cos="" mega="" k="0,1,2,\ldots,N-1" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;More generally,&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\sum_{n=0}^{N-1}x_e(n) x_o(n) = 0&#10;\end{displaymath}&#10; --&gt;&lt;img width="150" height="62" border="0" src="https://technick.net/img/guide_dft/img1190.png" alt="\" egin="" isplaymath="" um="" n-1="" x="" e="" n="" x="" n="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;for &lt;i&gt;any&lt;/i&gt; even signal &lt;img width="20" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1191.png" alt="$x_e$" /&gt; and odd signal &lt;img width="20" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1187.png" alt="$x_o$" /&gt; in &lt;img width="26" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img745.png" alt="${\" al="" /&gt;.&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/alias_operator"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/fourier_theorems"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>The Fourier Theorems</title><link>https://technick.net/guides/theory/dft/fourier_theorems/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/fourier_theorems/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/even_odd_functions"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/linearity"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00940000000000000000"&gt;The Fourier Theorems&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;In this section the main &lt;a href="https://technick.net/guides/theory/dft/fourier_theorems"&gt;Fourier theorems&lt;/a&gt; are stated and proved. It is no&#10;small matter how simple these theorems are in the &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;DFT&lt;/a&gt; case relative to the&#10;other three cases (DTFT, &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;Fourier transform&lt;/a&gt;, and Fourier series). When&#10;infinite summations or integrals are involved, the conditions for the&#10;existence of the Fourier transform can be quite difficult to characterize&#10;mathematically. Mathematicians have expended a considerable effort on such&#10;questions. By focusing primarily on the DFT case, we are able to study the&#10;essential concepts conveyed by the Fourier theorems without getting&#10;involved with mathematical difficulties.&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;hr /&gt;&lt;!--Table of Child-Links--&gt;&lt;a name="CHILD_LINKS"&gt;&lt;strong&gt;Subsections&lt;/strong&gt;&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html2330" href="https://technick.net/guides/theory/dft/linearity"&gt;Linearity&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2331" href="https://technick.net/guides/theory/dft/conjugation_reversal"&gt;Conjugation and Reversal&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2332" href="https://technick.net/guides/theory/dft/symmetry"&gt;Symmetry&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2333" href="https://technick.net/guides/theory/dft/shift_theorem"&gt;Shift Theorem&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html2334" href="https://technick.net/guides/theory/dft/linear_phase_terms"&gt;Linear Phase Terms&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2335" href="https://technick.net/guides/theory/dft/application_shift_theorem"&gt;Application of the Shift Theorem to FFT Windows&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2336" href="https://technick.net/guides/theory/dft/convolution_theorem"&gt;Convolution Theorem&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2337" href="https://technick.net/guides/theory/dft/dual_convolution_theorem"&gt;Dual of the Convolution Theorem&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2338" href="https://technick.net/guides/theory/dft/correlation_theorem"&gt;Correlation Theorem&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2339" href="https://technick.net/guides/theory/dft/power_theorem"&gt;Power Theorem&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2340" href="https://technick.net/guides/theory/dft/rayleigh_energy_theorem"&gt;Rayleigh Energy Theorem (Parseval's Theorem)&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2341" href="https://technick.net/guides/theory/dft/stretch_theorem_repeat"&gt;Stretch Theorem (Repeat Theorem)&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2342" href="https://technick.net/guides/theory/dft/decimation_theorem_aliasing"&gt;Decimation Theorem (Aliasing Theorem)&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2343" href="https://technick.net/guides/theory/dft/zero_padding_theorem"&gt;Zero Padding Theorem&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2344" href="https://technick.net/guides/theory/dft/bandlimited_interpolation_t"&gt;Bandlimited Interpolation in Time&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;!--End of Table of Child-Links--&gt;&#10;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/even_odd_functions"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/linearity"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Linearity</title><link>https://technick.net/guides/theory/dft/linearity/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/linearity/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/fourier_theorems"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/conjugation_reversal"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00941000000000000000"&gt;Linearity&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Theorem: &lt;/b&gt;For any &lt;!-- MATH&#10; $x,y\in{\cal C}^N$&#10; --&gt;&lt;img width="69" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1095.png" alt="$x,y\" n="" al="" /&gt; and &lt;!-- MATH&#10; $\alpha,\beta\in{\cal C}$&#10; --&gt;&lt;img width="60" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1192.png" alt="$\" lpha="" eta\in="" al="" /&gt;, the &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;DFT&lt;/a&gt; satisfies&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\fbox{$\displaystyle \alpha x + \beta y \leftrightarrow \alpha X + \beta Y$}&#10;\end{displaymath}&#10; --&gt;&lt;img width="176" height="36" border="0" src="https://technick.net/img/guide_dft/img1193.png" alt="\" egin="" isplaymath="" box="" isplaystyle="" lpha="" eta="" eftrightarrow="" lpha="" eta="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Thus, the DFT is a &lt;i&gt;linear operator&lt;/i&gt;.&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;em&gt;Proof: &lt;/em&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;\mbox{{\tt DFT}}_k(\alpha x + \beta y) &amp;\isdef &amp; \sum_{n=0}^{N-1}[\alpha x(n) + \beta y(n)]e^{-j 2\pi nk/N}\\&#10;&amp;=&amp; \sum_{n=0}^{N-1}\alpha x(n)e^{-j 2\pi nk/N} + \sum_{n=0}^{N-1}\beta y(n) e^{-j 2\pi nk/N} \\&#10;&amp;=&amp; \alpha \sum_{n=0}^{N-1}x(n)e^{-j 2\pi nk/N} + \beta \sum_{n=0}^{N-1}y(n) e^{-j 2\pi nk/N} \\&#10;&amp;\isdef &amp; \alpha X + \beta Y&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="499" height="213" border="0" src="https://technick.net/img/guide_dft/img1194.png" alt="\" egin="" qnarray="" box="" t="tt" ft="" alpha="" eta="" sdef="" um="" n="" n="0}^{N-1}y(n)" e="" pi="" n="" sdef="" lpha="" eta="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/fourier_theorems"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/conjugation_reversal"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Conjugation and Reversal</title><link>https://technick.net/guides/theory/dft/conjugation_reversal/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/conjugation_reversal/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/linearity"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/symmetry"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00942000000000000000"&gt;Conjugation and Reversal&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Theorem: &lt;/b&gt;For any &lt;!-- MATH&#10; $x\in{\cal C}^N$&#10; --&gt;&lt;img width="54" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img687.png" alt="$x\" n="" al="" /&gt;,&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\fbox{$\displaystyle \overline{x} \leftrightarrow \mbox{{\tt Flip}}(\overline{X})$}&#10;\end{displaymath}&#10; --&gt;&lt;img width="116" height="39" border="0" src="https://technick.net/img/guide_dft/img1195.png" alt="\" egin="" isplaymath="" box="" isplaystyle="" verline="" leftrightarrow="" box="" t="tt" lip="" verline="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;em&gt;Proof: &lt;/em&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;\mbox{{\tt DFT}}_k(\overline{x}) &#10;&#9;&amp;\isdef &amp; \sum_{n=0}^{N-1}\overline{x(n)} e^{-j 2\pi nk/N} &#10;&#9;= \sum_{n=0}^{N-1}\overline{x(n) e^{j 2\pi nk/N}} \\&#10;&#9;&amp;=&amp; \overline{\sum_{n=0}^{N-1}x(n) e^{-j 2\pi n(-k)/N}} &#10;&#9;\isdef \mbox{{\tt Flip}}_k(\overline{X})&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="412" height="127" border="0" src="https://technick.net/img/guide_dft/img1196.png" alt="\" egin="" qnarray="" box="" t="tt" ft="" overline="" isdef="" um="" n-1="" e="" pi="" n="" sdef="" box="" t="tt" lip="" overline="" end="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Theorem: &lt;/b&gt;For any &lt;!-- MATH&#10; $x\in{\cal C}^N$&#10; --&gt;&lt;img width="54" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img687.png" alt="$x\" n="" al="" /&gt;,&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\fbox{$\displaystyle \mbox{{\tt Flip}}(\overline{x}) \leftrightarrow \overline{X}$}&#10;\end{displaymath}&#10; --&gt;&lt;img width="116" height="39" border="0" src="https://technick.net/img/guide_dft/img1197.png" alt="\" egin="" isplaymath="" box="" isplaystyle="" box="" t="tt" lip="" verline="" leftrightarrow="" verline="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;em&gt;Proof: &lt;/em&gt;Making the change of summation variable &lt;img width="83" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1198.png" alt="$m\" sdef="" /&gt;, we get&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;\mbox{{\tt DFT}}_k(\mbox{{\tt Flip}}(\overline{x})) &#10;&#9;&amp;\isdef &amp; \sum_{n=0}^{N-1}\overline{x(N-n)} e^{-j 2\pi nk/N} &#10;&#9;&#9;= \sum_{m=N}^{1} \overline{x(m)} e^{-j 2\pi (N-m)k/N} \\&#10;&#9;&amp;=&amp; \sum_{m=0}^{N-1}\overline{x(m)} e^{j 2\pi m k / N} &#10;&#9;&#9;= \overline{\sum_{m=0}^{N-1}x(m) e^{-j 2\pi m k/N}} &#10;&#9;\isdef \overline{X(k)}&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="557" height="127" border="0" src="https://technick.net/img/guide_dft/img1199.png" alt="\" egin="" qnarray="" box="" t="tt" ft="" mbox="" t="tt" lip="" verline="" isdef="" um="" n-1="" x="" m="" e="" pi="" n="" sdef="" verline="" k="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Theorem: &lt;/b&gt;For any &lt;!-- MATH&#10; $x\in{\cal C}^N$&#10; --&gt;&lt;img width="54" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img687.png" alt="$x\" n="" al="" /&gt;,&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\fbox{$\displaystyle \mbox{{\tt Flip}}(x) \leftrightarrow \mbox{{\tt Flip}}(X)$}&#10;\end{displaymath}&#10; --&gt;&lt;img width="167" height="37" border="0" src="https://technick.net/img/guide_dft/img1200.png" alt="\" egin="" isplaymath="" box="" isplaystyle="" box="" t="tt" lip="" leftrightarrow="" box="" t="tt" lip="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;em&gt;Proof: &lt;/em&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;\mbox{{\tt DFT}}_k[\mbox{{\tt Flip}}(x)] &amp;\isdef &amp; \sum_{n=0}^{N-1}x(N-n) e^{-j 2\pi nk/N}&#10;&#9;= \sum_{m=0}^{N-1}x(m) e^{-j 2\pi (N-m)k/N} \\&#10;&amp;=&amp; \sum_{m=0}^{N-1}x(m) e^{j 2\pi mk/N} \isdef X(-k) \isdef \mbox{{\tt Flip}}_k(X)&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="548" height="123" border="0" src="https://technick.net/img/guide_dft/img1201.png" alt="\" egin="" qnarray="" box="" t="tt" ft="" mbox="" t="tt" lip="" isdef="" um="" x="" e="" pi="" n="" sdef="" isdef="" box="" t="tt" lip="" x="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;b&gt;Corollary:&lt;/b&gt; &#10;For any &lt;!-- MATH&#10; $x\in{\cal R}^N$&#10; --&gt;&lt;img width="58" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img686.png" alt="$x\" n="" al="" /&gt;,&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\fbox{$\displaystyle \mbox{{\tt Flip}}(x) \leftrightarrow \overline{X}$}\quad\mbox{($x$\ real)}&#10;\end{displaymath}&#10; --&gt;&lt;img width="189" height="39" border="0" src="https://technick.net/img/guide_dft/img1202.png" alt="\" egin="" isplaymath="" box="" isplaystyle="" box="" t="tt" lip="" leftrightarrow="" verline="" quad\mbox="" real="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;em&gt;Proof: &lt;/em&gt;Picking up the previous proof at the third formula, remembering that &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; is real,&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\sum_{n=0}^{N-1}x(n) e^{j 2\pi nk/N}&#10;= \overline{\sum_{n=0}^{N-1}\overline{x(n)} e^{-j 2\pi nk/N}}&#10;= \overline{\sum_{n=0}^{N-1}x(n) e^{-j 2\pi nk/N}}&#10;\isdef \overline{X(k)}&#10;\end{displaymath}&#10; --&gt;&lt;img width="535" height="65" border="0" src="https://technick.net/img/guide_dft/img1203.png" alt="\" egin="" isplaymath="" um="" n-1="" x="" n="" e="" pi="" n="" verline="" um="" sum="" n-1="" x="" n="" e="" pi="" n="" sdef="" verline="" k="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;when &lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img50.png" alt="$x(n)$" /&gt; is real.&lt;p&gt;Thus, &lt;i&gt;conjugation in the frequency domain corresponds to reversal in&#10;the time domain&lt;/i&gt;. Another way to say it is that &lt;i&gt;negating &lt;a href="https://technick.net/guides/theory/dft/spectral_phase"&gt;spectral&#10;phase&lt;/a&gt; flips the signal around backwards in time.&lt;/i&gt;&lt;/p&gt;&lt;p&gt;&lt;b&gt;Corollary:&lt;/b&gt; &#10;For any &lt;!-- MATH&#10; $x\in{\cal R}^N$&#10; --&gt;&lt;img width="58" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img686.png" alt="$x\" n="" al="" /&gt;,&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\fbox{$\displaystyle \mbox{{\tt Flip}}(X) = \overline{X}$}\quad\mbox{($x$\ real)}&#10;\end{displaymath}&#10; --&gt;&lt;img width="192" height="39" border="0" src="https://technick.net/img/guide_dft/img1204.png" alt="\" egin="" isplaymath="" box="" isplaystyle="" box="" t="tt" lip="" overline="" quad\mbox="" real="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;em&gt;Proof: &lt;/em&gt;This follows from the previous two cases. &lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Definition: &lt;/b&gt;The property &lt;!-- MATH&#10; $X(-k)=\overline{X(k)}$&#10; --&gt;&lt;img width="109" height="38" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1205.png" alt="$X(-k)=\" verline="" k="" /&gt; is called &lt;i&gt;Hermitian symmetry&lt;/i&gt;&lt;a name="14093"&gt;&lt;/a&gt;or ''conjugate symmetry.'' If &lt;!-- MATH&#10; $X(-k)=-\overline{X(k)}$&#10; --&gt;&lt;img width="121" height="38" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1206.png" alt="$X(-k)=-\" verline="" k="" /&gt;, it may be called&lt;i&gt;skew-Hermitian&lt;/i&gt;&lt;a name="14096"&gt;&lt;/a&gt;.&lt;/p&gt;&lt;p&gt;Another way to state the preceding corollary is&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\fbox{$\displaystyle x\in{\cal R}^N\leftrightarrow X\,\mbox{is Hermitian}$}&#10;\end{displaymath}&#10; --&gt;&lt;img width="214" height="36" border="0" src="https://technick.net/img/guide_dft/img1207.png" alt="\" egin="" isplaymath="" box="" isplaystyle="" n="" al="" leftrightarrow="" box="" s="" rmitian="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/linearity"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/symmetry"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Symmetry</title><link>https://technick.net/guides/theory/dft/symmetry/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/symmetry/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/conjugation_reversal"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/shift_theorem"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00943000000000000000"&gt;Symmetry&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;In the previous section, we found &lt;!-- MATH&#10; $\mbox{{\tt Flip}}(X) = \overline{X}$&#10; --&gt;&lt;img width="100" height="35" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1208.png" alt="$\" box="" t="tt" lip="" overline="" /&gt; when &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; is&#10;real. This fact is of high practical importance. It says that the&#10;spectrum of every real signal is &lt;i&gt;Hermitian&lt;/i&gt;&lt;a name="14104"&gt;&lt;/a&gt;.&#10;Due to this symmetry, we may discard all &lt;a href="https://technick.net/guides/theory/dft/positive_negative_frequenci"&gt;negative-frequency&lt;/a&gt; spectral&#10;samples of a real signal and regenerate them later if needed from the&#10;positive-frequency samples. Also, spectral plots of real signals are&#10;normally displayed only for positive frequencies; e.g., spectra of&#10;sampled signals are normally plotted over the range &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img38.png" alt="$0$" /&gt; Hz to &lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img670.png" alt="$f_s/2$" /&gt;Hz. On the other hand, the spectrum of a &lt;i&gt;complex&lt;/i&gt; signal must&#10;be shown, in general, from &lt;img width="47" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1209.png" alt="$-f_s/2$" /&gt; to &lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img670.png" alt="$f_s/2$" /&gt; (or from &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img38.png" alt="$0$" /&gt; to &lt;img width="19" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img55.png" alt="$f_s$" /&gt;),&#10;since the positive and negative frequency components of a complex&#10;signal are independent.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Theorem: &lt;/b&gt;If &lt;!-- MATH&#10; $x\in{\cal R}^N$&#10; --&gt;&lt;img width="58" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img686.png" alt="$x\" n="" al="" /&gt;, &lt;!-- MATH&#10; $\mbox{re}\left\{X\right\}$&#10; --&gt;&lt;img width="50" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1210.png" alt="$\" box="" e="" eft\="" right\="" /&gt; is &lt;i&gt;even&lt;/i&gt; and &lt;!-- MATH&#10; $\mbox{im}\left\{X\right\}$&#10; --&gt;&lt;img width="55" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1211.png" alt="$\" box="" m="" eft\="" right\="" /&gt; is &lt;i&gt;odd&lt;/i&gt;.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;em&gt;Proof: &lt;/em&gt;This follows immediately from the conjugate symmetry of &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img33.png" alt="$X$" /&gt; for real signals&lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt;.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Theorem: &lt;/b&gt;If &lt;!-- MATH&#10; $x\in{\cal R}^N$&#10; --&gt;&lt;img width="58" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img686.png" alt="$x\" n="" al="" /&gt;, &lt;!-- MATH&#10; $\left|X\right|$&#10; --&gt;&lt;img width="27" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1212.png" alt="$\" eft\vert="" ight\vert="" /&gt; is &lt;i&gt;even&lt;/i&gt; and &lt;img width="29" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1213.png" alt="$\" ngle="" /&gt; is &lt;i&gt;odd&lt;/i&gt;.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;em&gt;Proof: &lt;/em&gt;This follows immediately from the conjugate symmetry of &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img33.png" alt="$X$" /&gt; expressed&#10;in polar form &lt;!-- MATH&#10; $X(k)= \left|X(k)\right|e^{j\angle{X(k)}}$&#10; --&gt;&lt;img width="161" height="40" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1214.png" alt="$X(k)= \" eft\vert="" right\vert="" angle="" k="" /&gt;.&lt;/p&gt;&lt;p&gt;The conjugate symmetry of spectra of real signals is perhaps the most&#10;important symmetry theorem. However, there are a few more we can readily&#10;show.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Theorem: &lt;/b&gt;An even signal has an even transform:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\fbox{$\displaystyle x\,\mbox{even} \leftrightarrow X\,\mbox{even}$}&#10;\end{displaymath}&#10; --&gt;&lt;img width="140" height="32" border="0" src="https://technick.net/img/guide_dft/img1215.png" alt="\" egin="" isplaymath="" box="" isplaystyle="" box="" ven="" eftrightarrow="" box="" ven="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;em&gt;Proof: &lt;/em&gt;Express &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; in terms of its real and imaginary parts by &lt;!-- MATH&#10; $x\isdef x_r + j&#10;x_i$&#10; --&gt;&lt;img width="92" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1216.png" alt="$x\" sdef="" j="" i="" /&gt;. Note that for a complex signal &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; to be even, both its real and&#10;imaginary parts must be even. Then&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;X(k) &amp;\isdef &amp; \sum_{n=0}^{N-1}x(n) e^{-j\omega_k n} \\&#10;&amp;=&amp;\sum_{n=0}^{N-1}[x_r(n)+jx_i(n)] \cos(\omega_k n) - j [x_r(n)+jx_i(n)] \sin(\omega_k n) \\&#10;&amp;=&amp;\sum_{n=0}^{N-1}[x_r(n)\cos(\omega_k n) + x_i(n)\sin(\omega_k n)]&#10;&#9;+ j [x_i(n)\cos(\omega_k n) - x_r(n)\sin(\omega_k n)] \\&#10;&amp;=&amp;\sum_{n=0}^{N-1}\mbox{even}\cdot\mbox{even} &#10;&#9;+ \underbrace{\sum_{n=0}^{N-1}\mbox{even}\cdot\mbox{odd}}_{\mbox{sums to 0}}&#10;&#9;+ j \sum_{n=0}^{N-1}\mbox{even}\cdot\mbox{even} &#10;&#9;- j \underbrace{\sum_{n=0}^{N-1}{\mbox{even}\cdot\mbox{odd}}}_{\mbox{sums to 0}} \\&#10;&amp;=&amp;\sum_{n=0}^{N-1}\mbox{even}\cdot\mbox{even} + j \sum_{n=0}^{N-1}\mbox{even}\cdot\mbox{even} &#10;= \mbox{even} + j \cdot \mbox{even} = \mbox{even}&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="650" height="336" border="0" src="https://technick.net/img/guide_dft/img1217.png" alt="\" egin="" qnarray="" k="" sdef="" um="" n-1="" x="" n="" e="" omega="" s="s" ot\mbox="" ven="" box="" ven="" cdot="" box="" ven="" box="" ven="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Theorem: &lt;/b&gt;A real even signal has a real even transform:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\fbox{$\displaystyle x\,\mbox{real and even} \leftrightarrow X\,\mbox{real and even}$}&#10;\end{displaymath}&#10; --&gt;&lt;img width="277" height="32" border="0" src="https://technick.net/img/guide_dft/img1218.png" alt="\" egin="" isplaymath="" box="" isplaystyle="" box="" eal="" d="" en="" eftrightarrow="" box="" eal="" d="" en="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;em&gt;Proof: &lt;/em&gt;This follows immediately from setting &lt;img width="70" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1219.png" alt="$x_i(n)=0$" /&gt; in the preceding&#10;proof and seeing that the &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;DFT&lt;/a&gt; of a real and &lt;a href="https://technick.net/guides/theory/dft/even_odd_functions"&gt;even function&lt;/a&gt; reduces to &#10;a type of &lt;i&gt;cosine transform&lt;/i&gt;&lt;a name="tex2html99" href="https://technick.net/guides/theory/dft/footnode#foot13074"&gt;&lt;sup&gt;8.5&lt;/sup&gt;&lt;/a&gt;, &lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;X(k) = \sum_{n=0}^{N-1}x(n)\cos(\omega_k n),&#10;\end{displaymath}&#10; --&gt;&lt;img width="204" height="62" border="0" src="https://technick.net/img/guide_dft/img1220.png" alt="\" egin="" isplaymath="" k="" um="" n-1="" x="" n="" cos="" omega="" k="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;or we can show it directly:&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;X(k) &amp;\isdef &amp; \sum_{n=0}^{N-1}x(n) e^{-j\omega_k n} &#10;= \sum_{n=0}^{N-1}x(n) \cos(\omega_k n) + j \sum_{n=0}^{N-1}x(n) \sin(\omega_k n) \\&#10;&amp;=&amp; \sum_{n=0}^{N-1}x(n) \cos(\omega_k n) \quad\qquad &#10;&#9;\mbox{$\left(\sum\mbox{even}\cdot\mbox{odd}&#10;&#9;&#9;&#9;= \sum \mbox{odd}=0\right)$} \\&#10;&amp;=&amp; \sum_{n=0}^{N-1}\mbox{even}\cdot\mbox{even} = \sum_{n=0}^{N-1}\mbox{even} = \mbox{even}&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="536" height="184" border="0" src="https://technick.net/img/guide_dft/img1221.png" alt="\" egin="" qnarray="" k="" sdef="" um="" n-1="" x="" n="" e="" omega="" sum="" en="" dot\mbox="" ven="" um="" n-1="" mbox="" even="" mbox="" ven="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Definition: &lt;/b&gt;A signal with a real spectrum (such as a real, even signal)&#10;is often called a &lt;i&gt;zero phase signal&lt;/i&gt;&lt;a name="14166"&gt;&lt;/a&gt;. However, note that&#10;when the spectrum goes &lt;i&gt;negative&lt;/i&gt; (which it can), the phase is&#10;really &lt;img width="14" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img39.png" alt="$\" i="i" /&gt;, not &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img38.png" alt="$0$" /&gt;. Nevertheless, it is common to call such&#10;signals ''zero phase, '' even though the phase switches between &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img38.png" alt="$0$" /&gt;and &lt;img width="14" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img39.png" alt="$\" i="i" /&gt; at the zero-crossings of the spectrum. Such zero-crossings&#10;typically occur at low &lt;a href="https://technick.net/guides/theory/dft/logarithms"&gt;amplitude&lt;/a&gt; in practice, such as in the&#10;''sidelobes'' of the DTFT of an FFT window.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/conjugation_reversal"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/shift_theorem"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Shift Theorem</title><link>https://technick.net/guides/theory/dft/shift_theorem/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/shift_theorem/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/symmetry"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/linear_phase_terms"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00944000000000000000"&gt;Shift Theorem&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Theorem: &lt;/b&gt;For any &lt;!-- MATH&#10; $x\in{\cal C}^N$&#10; --&gt;&lt;img width="54" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img687.png" alt="$x\" n="" al="" /&gt; and any integer &lt;img width="17" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1084.png" alt="$\" elta="" /&gt;,&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\fbox{$\displaystyle \mbox{{\tt DFT}}_k[\mbox{{\tt Shift}}_\Delta(x)] = e^{-j\omega_k\Delta} X(k)$}&#10;\end{displaymath}&#10; --&gt;&lt;img width="258" height="39" border="0" src="https://technick.net/img/guide_dft/img1222.png" alt="\" egin="" isplaymath="" box="" isplaystyle="" box="" t="tt" ft="" mbox="" t="tt" hift="" elta="" e="" omega="" delta="" k="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;em&gt;Proof: &lt;/em&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;\mbox{{\tt DFT}}_k[\mbox{{\tt Shift}}_\Delta(x)] &amp;\isdef &amp; \sum_{n=0}^{N-1}x(n-\Delta) e^{-j 2\pi nk/N} \\&#10;&amp;=&amp; \sum_{m=-\Delta}^{N-1-\Delta} x(m) e^{-j 2\pi (m+\Delta)k/N} &#10;&#9;\qquad(m\isdef n-\Delta) \\&#10;&amp;=&amp; \sum_{m=0}^{N-1}x(m) e^{-j 2\pi mk/N} e^{-j 2\pi k\Delta/N} \\&#10;&amp;=&amp; e^{-j 2\pi \Delta k/N} \sum_{m=0}^{N-1}x(m) e^{-j 2\pi mk/N} \\&#10;&amp;\isdef &amp; e^{-j \omega_k \Delta} X(k)&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="519" height="277" border="0" src="https://technick.net/img/guide_dft/img1223.png" alt="\" egin="" qnarray="" box="" t="tt" ft="" mbox="" t="tt" hift="" elta="" isdef="" u="" m="" j="" i="" n="" sdef="" j="" mega="" delta="" k="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;The &lt;a href="https://technick.net/guides/theory/dft/shift_theorem"&gt;shift theorem&lt;/a&gt; says that a &lt;i&gt;delay&lt;/i&gt; in the time domain corresponds to&#10;a &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/linear_phase_terms"&gt;linear phase term&lt;/a&gt;&lt;/i&gt;&lt;a name="14190"&gt;&lt;/a&gt; in the frequency domain. More specifically, a&#10;delay of &lt;img width="17" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1084.png" alt="$\" elta="" /&gt; samples in the time waveform corresponds to the linear&#10;phase term &lt;!-- MATH&#10; $e^{-j \omega_k \Delta}$&#10; --&gt;&lt;img width="54" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1224.png" alt="$e^{-j \" mega="" delta="" /&gt; multiplying the spectrum, where&#10;&lt;!-- MATH&#10; $\omega_k\isdef 2\pi k/N$&#10; --&gt;&lt;img width="91" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1057.png" alt="$\" mega="" isdef="" i="" /&gt;. (To consider &lt;img width="22" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img681.png" alt="$\" mega="" /&gt; as radians per second&#10;instead of radians per sample, just replace &lt;img width="17" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1084.png" alt="$\" elta="" /&gt; by &lt;img width="29" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1225.png" alt="$\" elta="" /&gt; so that&#10;the delay is in seconds instead of samples.) Note that spectral magnitude&#10;is unaffected by a linear phase term. That is, &lt;!-- MATH&#10; $\left|e^{-j&#10;\omega_k&#10;\Delta}X(k)\right| =&#10;\left|X(k)\right|$&#10; --&gt;&lt;img width="165" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1226.png" alt="$\" eft\vert="" omega="" delta="" k="" ight\vert="\left\vert" x="" right\vert="" /&gt;.&lt;p&gt;&lt;br /&gt;&lt;hr /&gt;&lt;!--Table of Child-Links--&gt;&lt;a name="CHILD_LINKS"&gt;&lt;strong&gt;Subsections&lt;/strong&gt;&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html2393" href="https://technick.net/guides/theory/dft/linear_phase_terms"&gt;Linear Phase Terms&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2394" href="https://technick.net/guides/theory/dft/application_shift_theorem"&gt;Application of the Shift Theorem to FFT Windows&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;!--End of Table of Child-Links--&gt;&#10;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/symmetry"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/linear_phase_terms"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Linear Phase Terms</title><link>https://technick.net/guides/theory/dft/linear_phase_terms/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/linear_phase_terms/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/shift_theorem"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/application_shift_theorem"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;&lt;a name="SECTION00944100000000000000"&gt;Linear Phase Terms&lt;/a&gt;&lt;/h3&gt;&lt;p&gt;The reason &lt;!-- MATH&#10; $e^{-j \omega_k \Delta}$&#10; --&gt;&lt;img width="54" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1224.png" alt="$e^{-j \" mega="" delta="" /&gt; is called a &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/linear_phase_terms"&gt;linear phase term&lt;/a&gt;&lt;/i&gt;&lt;a name="14193"&gt;&lt;/a&gt; is&#10;that its phase is a linear function of frequency:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\angle e^{-j \omega_k \Delta} = - \Delta \cdot \omega_k&#10;\end{displaymath}&#10; --&gt;&lt;img width="147" height="29" border="0" src="https://technick.net/img/guide_dft/img1227.png" alt="\" egin="" isplaymath="" ngle="" omega="" delta="" elta="" dot="" mega="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Thus, the slope of the phase versus radian frequency is &lt;img width="30" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1228.png" alt="$-\" elta="" /&gt;. In&#10;general, the &lt;i&gt;time delay in samples&lt;/i&gt; equals &lt;i&gt;minus the slope of the&lt;a href="https://technick.net/guides/theory/dft/linear_phase_terms"&gt;linear phase&lt;/a&gt; term&lt;/i&gt;. &#10;If we express the original spectrum in polar form as&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;X(k) = G(k) e^{j\Theta(k)},&#10;\end{displaymath}&#10; --&gt;&lt;img width="149" height="31" border="0" src="https://technick.net/img/guide_dft/img1229.png" alt="\" egin="" isplaymath="" k="" k="" j\theta="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where &lt;img width="17" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1230.png" alt="$G$" /&gt; and &lt;img width="16" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1231.png" alt="$\" heta="" /&gt; are the magnitude and phase of &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img33.png" alt="$X$" /&gt;, respectively&#10;(both real), we can see that a linear phase term only modifies the &lt;a href="https://technick.net/guides/theory/dft/spectral_phase"&gt;spectral&#10;phase&lt;/a&gt; &lt;img width="38" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1232.png" alt="$\" heta="" /&gt;:&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;e^{-j \omega_k \Delta} X(k) \isdef &#10;e^{-j \omega_k \Delta} G(k) e^{j\Theta(k)}&#10;= G(k) e^{j[\Theta(k)-\omega_k\Delta]}&#10;\end{displaymath}&#10; --&gt;&lt;img width="405" height="31" border="0" src="https://technick.net/img/guide_dft/img1233.png" alt="\" egin="" isplaymath="" j="" mega="" delta="" k="" sdef="" omega="" delta="" k="" j\theta="" g="" e="" theta="" omega="" delta="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where &lt;!-- MATH&#10; $\omega_k\isdef 2\pi k/N$&#10; --&gt;&lt;img width="91" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1057.png" alt="$\" mega="" isdef="" i="" /&gt;. A positive time delay (waveform shift to&#10;the right) adds a &lt;i&gt;negatively sloped&lt;/i&gt; linear phase to the original&#10;spectral phase. A negative time delay (waveform shift to the left) adds a&lt;i&gt;positively sloped&lt;/i&gt; linear phase to the original spectral phase. If we&#10;seem to be belaboring this relationship, it is because it is one of the&#10;most useful in practice.&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Definition: &lt;/b&gt;A signal is said to be &lt;i&gt;linear phase signal&lt;/i&gt;&lt;a name="14197"&gt;&lt;/a&gt; if its phase&#10;is of the form&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\Theta(\omega_k)= \pm \Delta \cdot \omega_k\pm \pi I(\omega_k)&#10;\end{displaymath}&#10; --&gt;&lt;img width="202" height="31" border="0" src="https://technick.net/img/guide_dft/img1234.png" alt="\" egin="" isplaymath="" heta="" mega="" pm="" elta="" dot="" mega="" pm="" i="" mega="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where &lt;img width="43" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1235.png" alt="$I(\" mega="" /&gt; is an &lt;i&gt;indicator function&lt;/i&gt;&lt;a name="14199"&gt;&lt;/a&gt; which takes on &#10;the values &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img38.png" alt="$0$" /&gt; or &lt;img width="12" height="13" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img78.png" alt="$1$" /&gt;.&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/shift_theorem"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/application_shift_theorem"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Application of the Shift Theorem to FFT Windows</title><link>https://technick.net/guides/theory/dft/application_shift_theorem/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/application_shift_theorem/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/linear_phase_terms"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/convolution_theorem"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;&lt;a name="SECTION00944200000000000000"&gt;Application of the Shift Theorem to FFT Windows&lt;/a&gt;&lt;/h3&gt;&lt;p&gt;In practical &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;spectrum analysis&lt;/a&gt;, we most often use the &lt;i&gt;&lt;a href="http://www.treasure-troves.com/math/fastfouriertransform.php"&gt;fast Fourier&#10;transform&lt;/a&gt;&lt;/i&gt;&lt;a name="tex2html100" href="https://technick.net/guides/theory/dft/footnode#foot13118"&gt;&lt;sup&gt;8.6&lt;/sup&gt;&lt;/a&gt;(FFT) together with a &lt;i&gt;window function&lt;/i&gt; &lt;!-- MATH&#10; $w(n), n=0,1,2,\ldots,N-1$&#10; --&gt;&lt;img width="191" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1236.png" alt="$w(n), n=0,1,2,\" dots="" /&gt;.&#10;Windows are normally positive (&lt;img width="67" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1237.png" alt="$w(n)&amp;gt;0$" /&gt;), symmetric about their midpoint,&#10;and look pretty much like a ''bell curve.'' A window multiplies the signal&lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; being analyzed to form a &lt;i&gt;windowed signal&lt;/i&gt; &lt;!-- MATH&#10; $x_w(n) = w(n)x(n)$&#10; --&gt;&lt;img width="131" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1238.png" alt="$x_w(n) = w(n)x(n)$" /&gt;, or&#10;&lt;!-- MATH&#10; $x_w = w\cdot x$&#10; --&gt;&lt;img width="77" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1239.png" alt="$x_w = w\" dot="" /&gt;, which is then analyzed using the FFT. The window serves&#10;to &lt;i&gt;taper&lt;/i&gt; the data segment gracefully to zero, thus eliminating&#10;spectral distortions due to suddenly cutting off the signal in time.&#10;Windowing is thus appropriate when &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; is a short section of a longer&#10;signal.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Theorem: &lt;/b&gt;Real symmetric FFT windows are &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/linear_phase_terms"&gt;linear phase&lt;/a&gt;&lt;/i&gt;&lt;a name="14203"&gt;&lt;/a&gt;.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;em&gt;Proof: &lt;/em&gt;The midpoint of a symmetric signal can be translated to the&#10;time origin to create an even signal. As established previously, the &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;DFT&lt;/a&gt;of a real even signal is real and even. By the &lt;a href="https://technick.net/guides/theory/dft/shift_theorem"&gt;shift theorem&lt;/a&gt;, the DFT of&#10;the original symmetric signal is a real even spectrum multiplied by a &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/linear_phase_terms"&gt;linear phase term&lt;/a&gt;&lt;/i&gt;. A spectrum whose phase is a linear function offrequency (with possible discontinuities of &lt;img width="14" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img39.png" alt="$\" i="i" /&gt; radians), is &lt;i&gt;linear phase&lt;/i&gt; by definition.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/linear_phase_terms"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/convolution_theorem"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Convolution Theorem</title><link>https://technick.net/guides/theory/dft/convolution_theorem/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/convolution_theorem/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/application_shift_theorem"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dual_convolution_theorem"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00945000000000000000"&gt;Convolution Theorem&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Theorem: &lt;/b&gt;For any &lt;!-- MATH&#10; $x,y\in{\cal C}^N$&#10; --&gt;&lt;img width="69" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1095.png" alt="$x,y\" n="" al="" /&gt;,&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\fbox{$\displaystyle x\ast y \leftrightarrow X\cdot Y$}&#10;\end{displaymath}&#10; --&gt;&lt;img width="118" height="36" border="0" src="https://technick.net/img/guide_dft/img1240.png" alt="\" egin="" isplaymath="" box="" isplaystyle="" st="" eftrightarrow="" dot="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;em&gt;Proof: &lt;/em&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;\mbox{{\tt DFT}}_k(x\ast y) &amp;\isdef &amp; \sum_{n=0}^{N-1}(x\ast y)_n e^{-j2\pi nk/N} \\&#10;&#9;&amp;\isdef &amp; \sum_{n=0}^{N-1}\sum_{m=0}^{N-1}x(m) y(n-m) e^{-j2\pi nk/N} \\&#10;&#9;&amp;=&amp; \sum_{m=0}^{N-1}x(m) \sum_{n=0}^{N-1}\underbrace{y(n-m) e^{-j2\pi nk/N}}_{e^{-j2\pi mk/N}Y(k)} \\&#10;&#9;&amp;=&amp; \left(\sum_{m=0}^{N-1}x(m) e^{-j2\pi mk/N}\right)Y(k)\quad\mbox{(by the Shift Theorem)}\\&#10;&#9;&amp;\isdef &amp; X(k)Y(k)&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="552" height="288" border="0" src="https://technick.net/img/guide_dft/img1241.png" alt="\" egin="" qnarray="" box="" t="tt" ft="" x\ast="" sdef="" um="" n-1="" x\ast="" ht="" k="" uad\mbox="" y="" e="" ift="" eorem="" sdef="" k="" k="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;This is perhaps the most important single &lt;a href="https://technick.net/guides/theory/dft/fourier_theorems"&gt;Fourier theorem&lt;/a&gt; of all. It is&#10;the basis of a large number of applications of the FFT. Since the FFT&#10;provides a &lt;a href="http://www.treasure-troves.com/math/fastfouriertransform.php"&gt;fast Fourier transform&lt;/a&gt;, it also provides &lt;i&gt;fast &lt;a href="https://technick.net/guides/theory/dft/convolution"&gt;convolution&lt;/a&gt;&lt;/i&gt;&lt;a name="14227"&gt;&lt;/a&gt;,&#10;thanks to the &lt;a href="https://technick.net/guides/theory/dft/convolution_theorem"&gt;convolution theorem&lt;/a&gt;. It turns out that using the FFT to&#10;perform convolution is really more efficient in practice only for&#10;reasonably long convolutions, such as &lt;img width="64" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1242.png" alt="$N&amp;gt;100$" /&gt;. For much longer&#10;convolutions, the savings become enormous compared with ''direct''&#10;convolution. This happens because direct convolution requires on the order&#10;of &lt;img width="26" height="16" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1243.png" alt="$N^2$" /&gt; operations (multiplications and additions), while FFT-based&#10;convolution requires on the order of &lt;img width="61" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1244.png" alt="$N\" g="" /&gt; operations.&lt;p&gt;The following simple &lt;a href="http://www.mathworks.com/access/helpdesk/help/techdoc/basics/getstarted.shtml"&gt;Matlab&lt;/a&gt; example illustrates how much faster convolution&#10;can be performed using the FFT:&lt;pre&gt;&#10;&amp;gt;&amp;gt; N = 1024; % FFT much faster at this length&#10;&amp;gt;&amp;gt; t = 0:N-1; % [0,1,2,...,N-1]&#10;&amp;gt;&amp;gt; h = exp(-t); % filter impulse reponse = sampled &lt;a href="https://technick.net/guides/theory/dft/exponentials"&gt;exponential&lt;/a&gt;&#10;&amp;gt;&amp;gt; H = fft(h); % filter frequency response&#10;&amp;gt;&amp;gt; x = ones(1,N); % input = dc (any example will do)&#10;&amp;gt;&amp;gt; t0 = clock; y = conv(x,h); t1 = etime(clock,t0); % Direct&#10;&amp;gt;&amp;gt; t0 = clock; y = ifft(fft(x) .* H); t2 = etime(clock,t0); % FFT&#10;&amp;gt;&amp;gt; sprintf(['Elapsed time for direct convolution = %f sec\n',...&#10; 'Elapsed time for FFT convolution = %f sec\n',...&#10; 'Ratio = %f (Direct/FFT)'],t1,t2,t1/t2)&#10;&lt;p&gt;ans =&lt;/p&gt;&#10;&lt;p&gt;Elapsed time for direct convolution = 8.542129 sec&#10;Elapsed time for FFT convolution = 0.075038 sec&#10;Ratio = 113.837376 (Direct/FFT)&lt;/pre&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/application_shift_theorem"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;  &lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;  &lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;  &lt;a href="https://technick.net/guides/theory/dft/dual_convolution_theorem"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Dual of the Convolution Theorem</title><link>https://technick.net/guides/theory/dft/dual_convolution_theorem/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/dual_convolution_theorem/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/convolution_theorem"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/correlation_theorem"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00946000000000000000"&gt;Dual of the Convolution Theorem&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;The &lt;i&gt;Dual&lt;/i&gt;&lt;a name="14229"&gt;&lt;/a&gt;&lt;a name="tex2html101" href="https://technick.net/guides/theory/dft/footnode#foot13517"&gt;&lt;sup&gt;8.7&lt;/sup&gt;&lt;/a&gt; of the &lt;a href="https://technick.net/guides/theory/dft/convolution_theorem"&gt;Convolution Theorem&lt;/a&gt; says that&lt;i&gt;multiplication in the time domain&lt;/i&gt; is &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/convolution"&gt;convolution&lt;/a&gt; in thefrequency domain&lt;/i&gt;: &lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Theorem: &lt;/b&gt;&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\fbox{$\displaystyle x\cdot y \leftrightarrow \frac{1}{N} X\ast&#10;Y$}&#10;\end{displaymath}&#10; --&gt;&lt;img width="139" height="54" border="0" src="https://technick.net/img/guide_dft/img1245.png" alt="\" egin="" isplaymath="" box="" isplaystyle="" dot="" eftrightarrow="" rac="" x\ast="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;em&gt;Proof: &lt;/em&gt;The steps are the same as in the Convolution Theorem.&lt;/p&gt;&lt;p&gt;This theorem also bears on the use of &lt;i&gt;FFT windows&lt;/i&gt;. It says that &lt;i&gt;windowing in the time domain&lt;/i&gt; corresponds to &lt;i&gt;smoothing in the&#10;frequency domain&lt;/i&gt;. That is, the spectrum of &lt;img width="36" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1246.png" alt="$w\" dot="" /&gt; is simply &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img33.png" alt="$X$" /&gt;filtered by &lt;img width="21" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1247.png" alt="$W$" /&gt;, or, &lt;img width="51" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1248.png" alt="$W\" st="" /&gt;. This smoothing reduces &lt;i&gt;sidelobes&lt;/i&gt;associated with the &lt;i&gt;rectangular window&lt;/i&gt; (which is the window one gets&#10;implicitly when no window is explicitly used). FFT windows are covered inMusic 420.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/convolution_theorem"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/correlation_theorem"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Correlation Theorem</title><link>https://technick.net/guides/theory/dft/correlation_theorem/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/correlation_theorem/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/dual_convolution_theorem"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/power_theorem"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00947000000000000000"&gt;Correlation Theorem&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Theorem: &lt;/b&gt;For all &lt;!-- MATH&#10; $x,y\in{\cal C}^N$&#10; --&gt;&lt;img width="69" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1095.png" alt="$x,y\" n="" al="" /&gt;,&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\fbox{$\displaystyle x\star y \leftrightarrow \overline{X}\cdot Y$}&#10;\end{displaymath}&#10; --&gt;&lt;img width="118" height="38" border="0" src="https://technick.net/img/guide_dft/img1249.png" alt="\" egin="" isplaymath="" box="" isplaystyle="" tar="" eftrightarrow="" verline="" cdot="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;em&gt;Proof: &lt;/em&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;(x\star y)_n &#10;&#9;&amp;\isdef &amp; \sum_{m=0}^{N-1}\overline{x(m)}y(n+m) \\&#10;&#9;&amp;=&amp; \sum_{m=0}^{N-1}\overline{x(-m)}y(n-m) \qquad (m\leftarrow -m)\\&#10;&#9;&amp;=&amp; \left(\mbox{{\tt Flip}}(\overline{x})\ast y\right)_n \\&#10;&#9;&amp;\leftrightarrow &amp; \overline{X} \cdot Y&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="386" height="170" border="0" src="https://technick.net/img/guide_dft/img1250.png" alt="\" egin="" qnarray="" star="" isdef="" um="" n-1="" overline="" x="" m="" y="" n="" m="" x="" st="" ight="" leftrightarrow="" verline="" cdot="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where the last step follows from the &lt;a href="https://technick.net/guides/theory/dft/convolution_theorem"&gt;Convolution Theorem&lt;/a&gt; and the result&#10;&lt;!-- MATH&#10; $\mbox{{\tt Flip}}(\overline{x}) \leftrightarrow \overline{X}$&#10; --&gt;&lt;img width="98" height="35" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1251.png" alt="$\" box="" t="tt" lip="" verline="" leftrightarrow="" verline="" /&gt; from the section on &lt;a href="https://technick.net/guides/theory/dft/conjugation_reversal"&gt;Conjugation and&#10;Reversal&lt;/a&gt;.&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/dual_convolution_theorem"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/power_theorem"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Power Theorem</title><link>https://technick.net/guides/theory/dft/power_theorem/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/power_theorem/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/correlation_theorem"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/rayleigh_energy_theorem"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00948000000000000000"&gt;Power Theorem&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Theorem: &lt;/b&gt;For all &lt;!-- MATH&#10; $x,y\in{\cal C}^N$&#10; --&gt;&lt;img width="69" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1095.png" alt="$x,y\" n="" al="" /&gt;,&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\fbox{$\displaystyle \left&lt;x,y\right&gt; = \frac{1}{N}\left&lt;X,Y\right&gt;$}&#10;\end{displaymath}&#10; --&gt;&lt;img width="150" height="54" border="0" src="https://technick.net/img/guide_dft/img1252.png" alt="\" egin="" isplaymath="" box="" isplaystyle="" eft="" t="" y\right="" t="" rac="" left="" t="" y\right="" t="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;em&gt;Proof: &lt;/em&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;\left&lt;x,y\right&gt; &amp;\isdef &amp; \sum_{n=0}^{N-1}x(n)\overline{y(n)}&#10;&#9;&#9;= (y\star x)_0 &#10;&#9;&#9;= \mbox{{\tt DFT}}_0^{-1}(\overline{Y}\cdot X) \\&#10;&#9;&amp;=&amp; \frac{1}{N} \sum_{k=0}^{N-1}X(k)\overline{Y(k)} &#10;&#9;\isdef \frac{1}{N} \left&lt;X,Y\right&gt;&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="395" height="124" border="0" src="https://technick.net/img/guide_dft/img1253.png" alt="\" egin="" qnarray="" eft="" t="" y\right="" t="" sdef="" um="" n-1="" x="" n="" overline="" y="" n="" n-1="" k="" verline="" k="" sdef="" rac="" left="" t="" y\right="" t="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Note that the &lt;a href="https://technick.net/guides/theory/dft/power_theorem"&gt;power theorem&lt;/a&gt; would be more elegant (&lt;!-- MATH&#10; $\left&lt;x,y\right&gt;&#10;= \left&lt;X,Y\right&gt;$&#10; --&gt;&lt;img width="108" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1254.png" alt="$\" eft="" t="" y\right="" t="" eft="" t="" y\right="" t="" /&gt;) if the &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;DFT&lt;/a&gt; were defined as the coefficient of&#10;projection onto the &lt;i&gt;normalized&lt;/i&gt; DFT &lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;sinusoid&lt;/a&gt; &lt;!-- MATH&#10; ${\tilde s}_k(n) \isdef &#10;s_k(n)/\sqrt{N}$&#10; --&gt;&lt;img width="136" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1255.png" alt="${\" ilde="" n="" sdef="" n="" qrt="" /&gt;.&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/correlation_theorem"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/rayleigh_energy_theorem"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Rayleigh Energy Theorem (Parseval's Theorem)</title><link>https://technick.net/guides/theory/dft/rayleigh_energy_theorem/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/rayleigh_energy_theorem/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/power_theorem"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/stretch_theorem_repeat"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00949000000000000000"&gt;Rayleigh Energy Theorem (Parseval's Theorem)&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Theorem: &lt;/b&gt;For any &lt;!-- MATH&#10; $x\in{\cal C}^N$&#10; --&gt;&lt;img width="54" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img687.png" alt="$x\" n="" al="" /&gt;,&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\fbox{$\displaystyle \left\|\,x\,\right\|^2 = \frac{1}{N}\left\|\,X\,\right\|^2$}&#10;\end{displaymath}&#10; --&gt;&lt;img width="148" height="54" border="0" src="https://technick.net/img/guide_dft/img1256.png" alt="\" egin="" isplaymath="" box="" isplaystyle="" eft\vert\="" right\vert="" rac="" left\vert\="" right\vert="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;I.e.,&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\fbox{$\displaystyle \sum_{n=0}^{N-1}\left|x(n)\right|^2 = \frac{1}{N}\sum_{l=0}^{N-1}\left|X(k)\right|^2$}&#10;\end{displaymath}&#10; --&gt;&lt;img width="235" height="74" border="0" src="https://technick.net/img/guide_dft/img1257.png" alt="\" egin="" isplaymath="" box="" isplaystyle="" um="" n-1="" left\vert="" n="" ight\vert="" rac="" sum="" n-1="" left\vert="" k="" ight\vert="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;em&gt;Proof: &lt;/em&gt;This is a special case of the &lt;a href="https://technick.net/guides/theory/dft/power_theorem"&gt;Power Theorem&lt;/a&gt;.&lt;/p&gt;&lt;p&gt;Note that again the relationship would be cleaner (&lt;!-- MATH&#10; $\left\|\,x\,\right\| = \left\|\,X\,\right\|$&#10; --&gt;&lt;img width="91" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1258.png" alt="$\" eft\vert\="" right\vert="\left\Vert\,X\,\right\Vert$" /&gt;)&#10;if we were using the &lt;i&gt;normalized&lt;/i&gt; DFT.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/power_theorem"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/stretch_theorem_repeat"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Stretch Theorem (Repeat Theorem)</title><link>https://technick.net/guides/theory/dft/stretch_theorem_repeat/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/stretch_theorem_repeat/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/rayleigh_energy_theorem"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/decimation_theorem_aliasing"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION009410000000000000000"&gt;Stretch Theorem (Repeat Theorem)&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Theorem: &lt;/b&gt;For all &lt;!-- MATH&#10; $x\in{\cal C}^N$&#10; --&gt;&lt;img width="54" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img687.png" alt="$x\" n="" al="" /&gt;,&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\fbox{$\displaystyle \mbox{{\tt Stretch}}_L(x) \leftrightarrow \mbox{{\tt Repeat}}_L(X)$}&#10;\end{displaymath}&#10; --&gt;&lt;img width="234" height="37" border="0" src="https://technick.net/img/guide_dft/img1259.png" alt="\" egin="" isplaymath="" box="" isplaystyle="" box="" t="tt" tretch="" x="" eftrightarrow="" box="" t="tt" epeat="" x="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;em&gt;Proof: &lt;/em&gt;Recall that&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\mbox{{\tt Stretch}}_{L,m}(x) \isdef &#10;&#9; \left\{\begin{array}{ll}&#10;&#9;x(m/L), &amp; m/L=\mbox{integer} \\&#10;&#9;0, &amp; m/L\neq \mbox{integer} \\&#10;&#9;\end{array}&#10;&#9;\right.&#10;\end{displaymath}&#10; --&gt;&lt;img width="355" height="49" border="0" src="https://technick.net/img/guide_dft/img1119.png" alt="\" egin="" isplaymath="" box="" t="tt" tretch="" m="" isdef="" eft\="" egin="" rray="" er="" l\neq="" box="" nteger="" nd="" rray="" ight="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Let &lt;!-- MATH&#10; $y\isdef \mbox{{\tt Stretch}}_L(x)$&#10; --&gt;&lt;img width="123" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1260.png" alt="$y\" sdef="" box="" t="tt" tretch="" x="" /&gt;, where &lt;!-- MATH&#10; $y\in{\cal C}^M$&#10; --&gt;&lt;img width="55" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1261.png" alt="$y\" n="" al="" /&gt;, &lt;img width="68" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1134.png" alt="$M=LN$" /&gt;. Also define the&#10;new denser frequency grid associated with length &lt;img width="21" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img201.png" alt="$M$" /&gt; by &lt;!-- MATH&#10; $\omega^\prime_k \isdef 2\pi&#10;k/M$&#10; --&gt;&lt;img width="94" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1262.png" alt="$\" mega="" rime="" isdef="" i="" /&gt;, with &lt;!-- MATH&#10; $\omega_k = 2\pi k/N$&#10; --&gt;&lt;img width="91" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img57.png" alt="$\" mega="" pi="" n="" /&gt; as usual. Then&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;Y(k) \isdef \sum_{m=0}^{M-1} y(m) e^{-j\omega^\prime_k m} &#10; = \sum_{n=0}^{N-1}x(n) e^{-j\omega^\prime_k nL} \qquad\mbox{($n\isdef m/L$)}&#10;\end{displaymath}&#10; --&gt;&lt;img width="461" height="62" border="0" src="https://technick.net/img/guide_dft/img1263.png" alt="\" egin="" isplaymath="" k="" sdef="" um="" m-1="" y="" e="" omega="" rime="" n-1="" n="" j\omega="" rime="" l="" quad\mbox="" isdef="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;But &lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\omega^\prime_k L \isdef \frac{2\pi k}{M} L = \frac{2\pi k}{N} = \omega_k&#10;\end{displaymath}&#10; --&gt;&lt;img width="199" height="43" border="0" src="https://technick.net/img/guide_dft/img1264.png" alt="\" egin="" isplaymath="" mega="" rime="" isdef="" rac="" i="" l="\frac{2\pi" k="" omega="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Thus, &lt;img width="95" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1265.png" alt="$Y(k)=X(k)$" /&gt;, and by the &lt;a href="https://technick.net/guides/theory/dft/modulo_indexing_periodic"&gt;modulo indexing&lt;/a&gt; of &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img33.png" alt="$X$" /&gt;, &lt;img width="15" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1116.png" alt="$L$" /&gt;copies of &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img33.png" alt="$X$" /&gt; are generated as &lt;img width="13" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img53.png" alt="$k$" /&gt; goes from &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img38.png" alt="$0$" /&gt; to &lt;img width="123" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1266.png" alt="$M-1 = LN-1$" /&gt;.&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/rayleigh_energy_theorem"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/decimation_theorem_aliasing"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Decimation Theorem (Aliasing Theorem)</title><link>https://technick.net/guides/theory/dft/decimation_theorem_aliasing/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/decimation_theorem_aliasing/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/stretch_theorem_repeat"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/zero_padding_theorem"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION009411000000000000000"&gt;Decimation Theorem (Aliasing Theorem)&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Theorem: &lt;/b&gt;For all &lt;!-- MATH&#10; $x\in{\cal C}^N$&#10; --&gt;&lt;img width="54" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img687.png" alt="$x\" n="" al="" /&gt;,&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\fbox{$\displaystyle \mbox{{\tt Dec}}_L(x) \leftrightarrow \frac{1}{L}\mbox{{\tt Alias}}_L(X)$}&#10;\end{displaymath}&#10; --&gt;&lt;img width="204" height="54" border="0" src="https://technick.net/img/guide_dft/img1267.png" alt="\" egin="" isplaymath="" box="" isplaystyle="" box="" t="tt" ec="" x="" eftrightarrow="" rac="" mbox="" t="tt" lias="" x="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;em&gt;Proof: &lt;/em&gt;Let &lt;!-- MATH&#10; $k^\prime \in[0,M-1]$&#10; --&gt;&lt;img width="105" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1268.png" alt="$k^\" rime="" n="" /&gt; denote the frequency index in the &lt;a href="https://technick.net/guides/theory/dft/decimation_theorem_aliasing"&gt;aliased&lt;/a&gt; spectrum, and &#10;let &lt;!-- MATH&#10; $Y(k^\prime )\isdef \mbox{{\tt Alias}}_{L,k^\prime }(X)$&#10; --&gt;&lt;img width="157" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1269.png" alt="$Y(k^\" rime="" sdef="" box="" t="tt" lias="" k="" rime="" /&gt;. Then &lt;img width="17" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1270.png" alt="$Y$" /&gt; is length &lt;img width="75" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1271.png" alt="$M=N/L$" /&gt;,&#10;where &lt;img width="15" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1116.png" alt="$L$" /&gt; is the &lt;a href="https://technick.net/guides/theory/dft/decimation_operator"&gt;decimation&lt;/a&gt; factor. We have&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;Y(k^\prime ) &amp;\isdef &amp; \mbox{{\tt Alias}}_{L,k^\prime }(X)&#10;&#9;\isdef \sum_{l=0}^{L-1}Y(k^\prime +lM), \quad k^\prime =0,1,2,\ldots,M-1 \\&#10;&#9;&amp;\isdef &amp; \sum_{l=0}^{L-1}\sum_{n=0}^{N-1}x(n) e^{-j2\pi(k^\prime +lM)n/N} \\&#10;&#9;&amp;\isdef &amp; \sum_{n=0}^{N-1}x(n) e^{-j2\pi k^\prime n/N} &#10;&#9;&#9; \sum_{l=0}^{L-1}e^{-j2\pi l n M/N}&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="530" height="186" border="0" src="https://technick.net/img/guide_dft/img1272.png" alt="\" egin="" qnarray="" k="" rime="" sdef="" box="" t="tt" lias="" k="" rime="" i="i" n="" j2\pi="" rime="" sum="" l-1="" e="" j2\pi="" m="" end="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Since &lt;img width="74" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1273.png" alt="$M/N=L$" /&gt;, the sum over &lt;img width="9" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1274.png" alt="$l$" /&gt; becomes&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\sum_{l=0}^{L-1}e^{-j2\pi l M n/N} = \sum_{l=0}^{L-1}\left[e^{-j2\pi n/L}\right]^l = &#10;\frac{1-e^{-j2\pi n}}{1-e^{-j2\pi n/L}} &#10;&#9;= \left\{\begin{array}{ll}&#10;&#9;L, &amp; n=0 \left(\mbox{mod\ }L\right) \\&#10;&#9;0, &amp; n\neq 0 \left(\mbox{mod\ }L\right) \\&#10;&#9;\end{array}&#10;&#9;\right.&#10;\end{displaymath}&#10; --&gt;&lt;img width="578" height="62" border="0" src="https://technick.net/img/guide_dft/img1275.png" alt="\" egin="" isplaymath="" um="" l-1="" e="" j2\pi="" n="" sum="" l-1="" left="" n\neq="" eft="" box="" od\="" right="" nd="" rray="" ight="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;using the closed form expression for a &lt;a href="https://technick.net/guides/theory/dft/geometric_series"&gt;geometric series&lt;/a&gt; derived earlier.&#10;We see that the sum over &lt;img width="15" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1116.png" alt="$L$" /&gt; effectively &lt;i&gt;samples&lt;/i&gt; &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; every &lt;img width="15" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1116.png" alt="$L$" /&gt;samples. This can be expressed in the previous formula by defining &lt;img width="68" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1276.png" alt="$m\" sdef="" /&gt; which ranges only over the nonzero samples:&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;\mbox{{\tt Alias}}_{L,k^\prime }(X) &amp;=&amp; \sum_{n=0}^{N-1}x(n) e^{-j2\pi k^\prime n/N} \sum_{l=0}^{L-1}e^{-j2\pi l n /L} \\&#10;&#9;&amp;=&amp; L\sum_{m=0}^{N/L-1} x(mL) e^{-j2\pi k^\prime (m L) /N}\qquad(m\isdef n/L) \\&#10;&#9;&amp;\isdef &amp; L\sum_{m=0}^{M-1}x(mL) e^{-j2\pi k^\prime m /M} &#10; \;\isdef \; L\sum_{m=0}^{M-1}\mbox{{\tt Dec}}_{L,m}(x) e^{-j2\pi k^\prime m /M} \\&#10;&#9;&amp;\isdef &amp; L\cdot \mbox{{\tt DFT}}_{k^\prime }(\mbox{{\tt Dec}}_L(x))&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="591" height="217" border="0" src="https://technick.net/img/guide_dft/img1277.png" alt="\" egin="" qnarray="" box="" t="tt" lias="" k="" rime="" sum="" n-1="" x="" n="" e="" ef="" cdot="" box="" t="tt" ft="" prime="" box="" t="tt" ec="" x="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Since the above derivation also works in reverse, the theorem is proved.&lt;p&gt;Here is an illustration of the &lt;a href="https://technick.net/guides/theory/dft/decimation_theorem_aliasing"&gt;Decimation Theorem&lt;/a&gt; in &lt;a href="http://www.mathworks.com/access/helpdesk/help/techdoc/basics/getstarted.shtml"&gt;Matlab&lt;/a&gt;:&lt;pre&gt;&#10;&amp;gt;&amp;gt; N=4;&#10;&amp;gt;&amp;gt; x = 1:N;&#10;&amp;gt;&amp;gt; X = fft(x);&#10;&amp;gt;&amp;gt; x2 = x(1:2:N);&#10;&amp;gt;&amp;gt; fft(x2) % FFT(Decimate(x,2))&#10;&lt;p&gt;ans =&lt;/p&gt;&#10;&lt;pre&gt;&lt;code&gt; 4 -2&#10;&lt;/code&gt;&lt;/pre&gt;&#10;&lt;p&gt;&amp;gt;&amp;gt; (X(1:N/2) + X(N/2 + 1:N))/2 % (1/2) Alias(X,2)&lt;/p&gt;&#10;&lt;p&gt;ans =&lt;/p&gt;&#10;&lt;pre&gt;&lt;code&gt;4.0000 -2.0000&amp;lt;/pre&amp;gt;&amp;lt;/p&amp;gt;&amp;lt;p&amp;gt;An illustration of aliasing in the frequency domain is shown in&#10;&lt;/code&gt;&lt;/pre&gt;&#10;&lt;p&gt;Fig. &lt;a href="https://technick.net/guides/theory/dft/alias_operator#fig:aliasingfd"&gt;8.10&lt;/a&gt;.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/stretch_theorem_repeat"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;  &lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;  &lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;  &lt;a href="https://technick.net/guides/theory/dft/zero_padding_theorem"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Zero Padding Theorem</title><link>https://technick.net/guides/theory/dft/zero_padding_theorem/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/zero_padding_theorem/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/decimation_theorem_aliasing"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/bandlimited_interpolation_t"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION009412000000000000000"&gt;Zero Padding Theorem&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;A fundamental tool in practical &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;spectrum analysis&lt;/a&gt; is &lt;i&gt;zero padding&lt;/i&gt;.&#10;This theorem shows that zero padding in the time domain corresponds to&#10;ideal interpolation in the frequency domain:&lt;/p&gt;&lt;p&gt;Let &lt;!-- MATH&#10; $x\in{\cal C}^N$&#10; --&gt;&lt;img width="54" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img687.png" alt="$x\" n="" al="" /&gt; and define &lt;!-- MATH&#10; $y=\mbox{{\tt ZeroPad}}_M(x)$&#10; --&gt;&lt;img width="128" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1278.png" alt="$y=\" box="" t="tt" eropad="" x="" /&gt;. Then &lt;!-- MATH&#10; $y\in{\cal C}^M$&#10; --&gt;&lt;img width="55" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1261.png" alt="$y\" n="" al="" /&gt; with &lt;img width="57" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1279.png" alt="$M\" eq="" /&gt;.&#10;Denote the original frequency index by &lt;img width="13" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img53.png" alt="$k$" /&gt;, where &lt;!-- MATH&#10; $\omega_k \isdef 2\pi k/N$&#10; --&gt;&lt;img width="91" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1057.png" alt="$\" mega="" isdef="" i="" /&gt; and&#10;the new frequency index by &lt;img width="17" height="16" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1280.png" alt="$k^\" rime="" /&gt;, where &lt;!-- MATH&#10; $\omega_{k^\prime }\isdef 2\pi k^\prime /M$&#10; --&gt;&lt;img width="103" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1281.png" alt="$\" mega="" prime="" sdef="" i="" rime="" /&gt;.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Definition: &lt;/b&gt;The &lt;i&gt;ideal bandlimited interpolation&lt;/i&gt;&lt;a name="14381"&gt;&lt;/a&gt; of a spectrum &lt;!-- MATH&#10; $X(\omega_k )\isdef \mbox{{\tt DFT}}_k(x)$&#10; --&gt;&lt;img width="124" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1282.png" alt="$X(\" mega="" isdef="" box="" t="tt" ft="" x="" /&gt;, &#10;&lt;!-- MATH&#10; $x\in{\cal C}^N$&#10; --&gt;&lt;img width="54" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img687.png" alt="$x\" n="" al="" /&gt;, to an arbitrary new frequency &lt;!-- MATH&#10; $\omega\in[-\pi,\pi)$&#10; --&gt;&lt;img width="83" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1283.png" alt="$\" mega\in="" i="" i="" /&gt; is defined as&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;X(\omega) \isdef \sum_{n=0}^{N-1}x(n) e^{-j\omega n}&#10;\end{displaymath}&#10; --&gt;&lt;img width="176" height="62" border="0" src="https://technick.net/img/guide_dft/img1284.png" alt="\" egin="" isplaymath="" omega="" sdef="" um="" n-1="" x="" n="" e="" omega="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Note that this is just the definition of the &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;DFT&lt;/a&gt; with &lt;img width="22" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img681.png" alt="$\" mega="" /&gt; replaced&#10;by &lt;img width="15" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img527.png" alt="$\" mega="" /&gt;. That is, the spectrum is interpolated by projecting onto the&#10;new &lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;sinusoid&lt;/a&gt; exactly as if it were a DFT sinusoid. This makes the most&#10;sense when &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; is assumed to be &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; samples of a &lt;i&gt;time-limited&lt;/i&gt; signal.&#10;That is, if the signal really is zero outside of the time interval&lt;img width="70" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1064.png" alt="$[0,N-1]$" /&gt;, then the &lt;a href="https://technick.net/guides/theory/dft/inner_product"&gt;inner product&lt;/a&gt; between it and any sinusoid will be&#10;exactly as in the equation above. Thus, for time limited signals, this&#10;kind of interpolation is ideal.&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Definition: &lt;/b&gt;The &lt;i&gt;interpolation operator&lt;/i&gt;&lt;a name="14390"&gt;&lt;/a&gt; interpolates a signal by an integer factor&lt;img width="15" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1116.png" alt="$L$" /&gt;. That is,&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\mbox{{\tt Interp}}_{L,k^\prime }(X) \isdef X(\omega_{k^\prime }),\quad &#10;&#9;\omega_{k^\prime }= 2\pi k^\prime /M,\; k^\prime =0,1,2,\dots,M-1,\; M\isdef LN&#10;\end{displaymath}&#10; --&gt;&lt;img width="586" height="34" border="0" src="https://technick.net/img/guide_dft/img1285.png" alt="\" egin="" isplaymath="" box="" t="tt" nterp="" k="" rime="" isdef="" mega="" pri="" i="" rime="" k="" rime="0,1,2,\dots,M-1,\;" m\isdef="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Since &lt;!-- MATH&#10; $X(\omega_k )\isdef \mbox{{\tt DFT}}_{N,k}(x)$&#10; --&gt;&lt;img width="139" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1286.png" alt="$X(\" mega="" isdef="" box="" t="tt" ft="" k="" /&gt; is initially only defined over the &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt;&lt;a href="https://technick.net/guides/theory/dft/special_case_mth"&gt;roots of unity&lt;/a&gt;, while &lt;!-- MATH&#10; $X(\omega_{k^\prime })$&#10; --&gt;&lt;img width="53" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1287.png" alt="$X(\" mega="" prime="" /&gt; is defined over &lt;img width="68" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1134.png" alt="$M=LN$" /&gt; roots of unity, we&#10;define &lt;!-- MATH&#10; $X(\omega_{k^\prime })$&#10; --&gt;&lt;img width="53" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1287.png" alt="$X(\" mega="" prime="" /&gt; for &lt;!-- MATH&#10; $\omega_{k^\prime }\neq\omega_k$&#10; --&gt;&lt;img width="65" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1288.png" alt="$\" mega="" prime="" eq\omega="" /&gt; by ideal bandlimited interpolation.&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Theorem: &lt;/b&gt;For any &lt;!-- MATH&#10; $x\in {\cal C}^N$&#10; --&gt;&lt;img width="54" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img687.png" alt="$x\" n="" al="" /&gt;&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\fbox{$\displaystyle \mbox{{\tt ZeroPad}}_{LN}(x) \leftrightarrow \mbox{{\tt Interp}}_L(X)$}&#10;\end{displaymath}&#10; --&gt;&lt;img width="247" height="37" border="0" src="https://technick.net/img/guide_dft/img1289.png" alt="\" egin="" isplaymath="" box="" isplaystyle="" box="" t="tt" eropad="" n="" leftrightarrow="" box="" t="tt" nterp="" x="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;em&gt;Proof: &lt;/em&gt;Let &lt;img width="68" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1134.png" alt="$M=LN$" /&gt; with &lt;img width="44" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1290.png" alt="$L\" eq="" /&gt;. Then&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\mbox{{\tt DFT}}_{M,k^\prime }(\mbox{{\tt ZeroPad}}_M(x)) &#10;= \sum_{m=0}^{N-1} x(m) e^{-j2\pi mk^\prime /M} \isdef X(\omega_{k^\prime }) = \mbox{{\tt Interp}}_L(X)&#10;\end{displaymath}&#10; --&gt;&lt;img width="556" height="62" border="0" src="https://technick.net/img/guide_dft/img1291.png" alt="\" egin="" isplaymath="" box="" t="tt" ft="" k="" rime="" box="" t="tt" eropad="" x="" e="" isdef="" mega="" prime="" box="" t="tt" nterp="" x="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/decimation_theorem_aliasing"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/bandlimited_interpolation_t"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Bandlimited Interpolation in Time</title><link>https://technick.net/guides/theory/dft/bandlimited_interpolation_t/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/bandlimited_interpolation_t/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/fourier_theorems"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/conclusions"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION009413000000000000000"&gt;Bandlimited Interpolation in Time&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;The &lt;i&gt;dual&lt;/i&gt; of the &lt;a href="https://technick.net/guides/theory/dft/zero_padding_theorem"&gt;Zero-Padding Theorem&lt;/a&gt; states formally that &lt;i&gt;zero&#10;padding in the frequency domain&lt;/i&gt; corresponds to &lt;i&gt;ideal bandlimited&#10;interpolation in the time domain&lt;/i&gt;. However, we have not precisely defined&#10;ideal bandlimited interpolation in the time domain. Therefore, we'll let&#10;the dual of the Zero-Padding Theorem provide its definition:&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Definition: &lt;/b&gt;For all &lt;!-- MATH&#10; $x\in{\cal C}^N$&#10; --&gt;&lt;img width="54" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img687.png" alt="$x\" n="" al="" /&gt; and any integer &lt;img width="44" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1290.png" alt="$L\" eq="" /&gt;,&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\fbox{$\displaystyle \mbox{{\tt Interp}}_L(x) \isdef \mbox{{\tt IDFT}}(\mbox{{\tt ZeroPad}}_{LN}(X))$}&#10;\end{displaymath}&#10; --&gt;&lt;img width="293" height="42" border="0" src="https://technick.net/img/guide_dft/img1292.png" alt="\" egin="" isplaymath="" box="" isplaystyle="" box="" t="tt" nterp="" x="" sdef="" box="" t="tt" dft="" box="" t="tt" eropad="" n="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where the zero-padding is of the frequency-domain type, &#10;as described earlier and illustrated in Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/zero_padding#fig:zpad"&gt;8.5&lt;/a&gt;.&lt;p&gt;It is instructive to interpret the Interpolation Theorem in terms of the&lt;a href="https://technick.net/guides/theory/dft/stretch_theorem_repeat"&gt;Stretch Theorem&lt;/a&gt; &lt;!-- MATH&#10; $\mbox{{\tt Stretch}}_L(x) \leftrightarrow \mbox{{\tt Repeat}}_L(X)$&#10; --&gt;&lt;img width="205" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1293.png" alt="$\" box="" t="tt" tretch="" x="" eftrightarrow="" box="" t="tt" epeat="" x="" /&gt;. To do this, it is&#10;convenient to define a ''zero-centered rectangular window'' operator:&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Definition: &lt;/b&gt;For any &lt;!-- MATH&#10; $X\in{\cal C}^N$&#10; --&gt;&lt;img width="59" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1294.png" alt="$X\" n="" al="" /&gt; and any odd integer &lt;img width="57" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img856.png" alt="$M&amp;lt;N$" /&gt; we define the &lt;i&gt;length &lt;img width="21" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img201.png" alt="$M$" /&gt; even rectangular windowing operation&lt;/i&gt;&lt;a name="14436"&gt;&lt;/a&gt; by&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\mbox{{\tt RectWin}}_{M,k}(X) \isdef &#10;\left\{\begin{array}{ll}&#10;&#9;X(k), &amp; -\frac{M-1}{2}\leq k \leq &#10;&#9;\frac{M-1}{2} \\&#10;&#9;0, &amp; \frac{M+1}{2} \leq \left|k\right| \leq \frac{N}{2} \\&#10;&#9;\end{array}&#10;&#9;\right.&#10;\end{displaymath}&#10; --&gt;&lt;img width="370" height="50" border="0" src="https://technick.net/img/guide_dft/img1295.png" alt="\" egin="" isplaymath="" box="" t="tt" ectwin="" k="" isdef="" eft\="" egin="" rray="" ft\vert="" ight\vert="" eq="" rac="" end="" rray="" ight="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Thus, the ''zero-phase rectangular window,'' when applied to a spectrum&lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img33.png" alt="$X$" /&gt;, sets the spectrum to zero everywhere outside a zero-centered interval&#10;of &lt;img width="21" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img201.png" alt="$M$" /&gt; samples. Note that &lt;!-- MATH&#10; $\mbox{{\tt RectWin}}_M(X)$&#10; --&gt;&lt;img width="104" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1296.png" alt="$\" box="" t="tt" ectwin="" x="" /&gt; is the &lt;i&gt;ideal lowpassfiltering operation in the frequency domain&lt;/i&gt;&lt;a name="14454"&gt;&lt;/a&gt;, where the lowpass ''cut-off&#10;frequency'' in radians per sample is &lt;!-- MATH&#10; $\omega_c = 2\pi[(M-1)/2]/N$&#10; --&gt;&lt;img width="163" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1297.png" alt="$\" mega="" pi="" m-1="" n="" /&gt;. With&#10;this we can efficiently show the basic theorem of &lt;i&gt;ideal bandlimited&#10;interpolation&lt;/i&gt;&lt;a name="14456"&gt;&lt;/a&gt;:&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Theorem: &lt;/b&gt;For &lt;!-- MATH&#10; $x\in{\cal C}^N$&#10; --&gt;&lt;img width="54" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img687.png" alt="$x\" n="" al="" /&gt;,&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\fbox{$\displaystyle \mbox{{\tt Interp}}_L(x) = \mbox{{\tt IDFT}}(\mbox{{\tt RectWin}}_N(\mbox{{\tt DFT}}(\mbox{{\tt Stretch}}_L(x))))$}&#10;\end{displaymath}&#10; --&gt;&lt;img width="408" height="37" border="0" src="https://technick.net/img/guide_dft/img1298.png" alt="\" egin="" isplaymath="" box="" isplaystyle="" box="" t="tt" nterp="" x="" box="" t="tt" tt="tt" ectwin="" mbox="" t="tt" ft="" box="" t="tt" tretch="" x="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;In other words, ideal bandlimited interpolation of &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; by the factor &lt;img width="15" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1116.png" alt="$L$" /&gt;may be carried out by first stretching &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; by the factor &lt;img width="15" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1116.png" alt="$L$" /&gt; (i.e.,&#10;inserting &lt;img width="42" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1120.png" alt="$L-1$" /&gt; zeros between adjacent samples of &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt;), taking the &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;DFT&lt;/a&gt;,&#10;applying the ideal lowpass filter, and performing the inverse DFT.&lt;p&gt;&lt;em&gt;Proof: &lt;/em&gt;First, recall that &lt;!-- MATH&#10; $\mbox{{\tt Stretch}}_L(x)\leftrightarrow \mbox{{\tt Repeat}}_L(X)$&#10; --&gt;&lt;img width="205" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1293.png" alt="$\" box="" t="tt" tretch="" x="" eftrightarrow="" box="" t="tt" epeat="" x="" /&gt;, that is, stretching&#10;a signal by the factor &lt;img width="15" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1116.png" alt="$L$" /&gt; gives a new signal &lt;!-- MATH&#10; $y=\mbox{{\tt Stretch}}_L(x)$&#10; --&gt;&lt;img width="123" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1299.png" alt="$y=\" box="" t="tt" tretch="" x="" /&gt; which has a&#10;spectral grid &lt;img width="15" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1116.png" alt="$L$" /&gt; times the density of &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img33.png" alt="$X$" /&gt;, and the spectrum &lt;img width="17" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1270.png" alt="$Y$" /&gt; contains&lt;img width="15" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1116.png" alt="$L$" /&gt; copies of &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img33.png" alt="$X$" /&gt; repeated around the unit circle. The ''baseband copy''&#10;of &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img33.png" alt="$X$" /&gt; can be defined as the width &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; sequence centered about frequency&#10;zero. Therefore, if we can use an ''ideal filter'' to ''pass'' the&#10;baseband spectral copy and zero out all others, we can convert&#10;&lt;!-- MATH&#10; $\mbox{{\tt Repeat}}_L(X)$&#10; --&gt;&lt;img width="90" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1300.png" alt="$\" box="" t="tt" epeat="" x="" /&gt; to &lt;!-- MATH&#10; $\mbox{{\tt ZeroPad}}_{LN}(X)$&#10; --&gt;&lt;img width="110" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1301.png" alt="$\" box="" t="tt" eropad="" n="" /&gt;. I.e.,&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\mbox{{\tt RectWin}}_N(\mbox{{\tt Repeat}}_L(X)) = \mbox{{\tt ZeroPad}}_{LN}(X)&#10;\leftrightarrow \mbox{{\tt Interp}}_L(x)&#10;\end{displaymath}&#10; --&gt;&lt;img width="442" height="31" border="0" src="https://technick.net/img/guide_dft/img1302.png" alt="\" egin="" isplaymath="" box="" t="tt" ectwin="" mbox="" t="tt" epeat="" x="" box="" t="tt" eropad="" n="" leftrightarrow="" box="" t="tt" nterp="" x="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where the last step is by definition of time-domain ideal bandlimited&#10;interpolation.&lt;p&gt;Note that the definition of ideal bandlimited time-domain interpolation in&#10;this section is only really ideal for signals which are &lt;i&gt;periodic&lt;/i&gt; in&lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; samples. To see this, consider that the rectangular windowing&#10;operation in the frequency domain corresponds to &lt;i&gt;cyclic &lt;a href="https://technick.net/guides/theory/dft/convolution"&gt;convolution&lt;/a&gt;&lt;/i&gt;in the time domain,&lt;a name="tex2html102" href="https://technick.net/guides/theory/dft/footnode#foot13532"&gt;&lt;sup&gt;8.8&lt;/sup&gt;&lt;/a&gt; and cyclic convolution is only the same as acyclic convolution&#10;when one of the signals is truly periodic in &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; samples. Since all&#10;spectra &lt;!-- MATH&#10; $X\in{\cal C}^N$&#10; --&gt;&lt;img width="59" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1294.png" alt="$X\" n="" al="" /&gt; are truly periodic in &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; samples, there is no problem&#10;with the definition of ideal spectral interpolation used in connection with&#10;the Zero-Padding Theorem. However, for a more practical definition of&#10;ideal time-domain interpolation, we should use instead the dual of the&#10;Zero-Padding Theorem for the DTFT case. Nevertheless, for signals which are&lt;i&gt;exactly&lt;/i&gt; periodic in &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; samples (a rare situation), the present&#10;definition is ideal.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/fourier_theorems"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/conclusions"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Conclusions</title><link>https://technick.net/guides/theory/dft/conclusions/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/conclusions/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/bandlimited_interpolation_t"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/acknowledgement"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00950000000000000000"&gt;Conclusions&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;For the student interested in pursuing further the topics of this reader,&#10;see [&lt;a href="https://technick.net/guides/theory/dft/bibliography#Bracewell"&gt;18&lt;/a&gt;,&lt;a href="https://technick.net/guides/theory/dft/bibliography#Brigham"&gt;19&lt;/a&gt;].&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/bandlimited_interpolation_t"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/acknowledgement"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Appendix A: Linear Time-Invariant Filters and Convolution</title><link>https://technick.net/guides/theory/dft/appendix_a_linear/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/appendix_a_linear/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/acknowledgement"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/lti_filters_convolution"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00970000000000000000"&gt;&lt;/a&gt;&lt;a name="sec:LTI"&gt;&lt;/a&gt;&lt;br /&gt;Appendix A: Linear Time-Invariant Filters and &lt;a href="https://technick.net/guides/theory/dft/convolution"&gt;Convolution&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;A reason for the importance of convolution is that &lt;i&gt;every linear&#10;time-invariant system&lt;a name="tex2html103" href="https://technick.net/guides/theory/dft/footnode#foot13290"&gt;&lt;sup&gt;8.9&lt;/sup&gt;&lt;/a&gt; can be represented by a convolution&lt;/i&gt;. Thus, in the&#10;convolution equation&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;y = h\ast x&#10;\end{displaymath}&#10; --&gt;&lt;img width="70" height="30" border="0" src="https://technick.net/img/guide_dft/img1304.png" alt="\" egin="" isplaymath="" h\ast="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;we may interpret &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; as the &lt;i&gt;input&lt;/i&gt; signal to a filter, &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img13.png" alt="$y$" /&gt; as the &lt;i&gt;output&lt;/i&gt; signal, and &lt;img width="13" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1101.png" alt="$h$" /&gt; as the &lt;i&gt;&lt;a href="http://www.dsptutor.freeuk.com/dfilt1.php"&gt;digital filter&lt;/a&gt;&lt;/i&gt;&lt;a name="14492"&gt;&lt;/a&gt;,&#10;as shown in Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/appendix_a_linear#fig:filter"&gt;8.11&lt;/a&gt;.&lt;p&gt; &lt;div align="CENTER"&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:filter"&gt;&lt;/a&gt;&lt;a name="14497"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure 8.11:&lt;/strong&gt;The filter interpretation of convolution.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; $\scalebox{0.8}{\includegraphics{eps/filter.eps}}$&#10; --&gt;&lt;img width="229" height="52" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1305.png" alt="\" calebox="" ncludegraphics="" ps="" ilter="" ps="" /&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;&lt;p&gt;The &lt;i&gt;impulse&lt;/i&gt;&lt;a name="14503"&gt;&lt;/a&gt; or ''unit&#10;pulse&lt;a name="14504"&gt;&lt;/a&gt;'' signal is defined by&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\delta(n) \isdef \left\{\begin{array}{ll}&#10;&#9;1, &amp; n=0 \\&#10;&#9;0, &amp; n\neq 0 \\&#10;&#9;\end{array}&#10;&#9;\right.&#10;\end{displaymath}&#10; --&gt;&lt;img width="152" height="49" border="0" src="https://technick.net/img/guide_dft/img1306.png" alt="\" egin="" isplaymath="" elta="" isdef="" eft\="" egin="" rray="" l="" n\neq="" nd="" rray="" ight="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;For example, for &lt;img width="48" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1307.png" alt="$N=4$" /&gt;, &lt;!-- MATH&#10; $\delta = [1,0,0,0]$&#10; --&gt;&lt;img width="95" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1308.png" alt="$\" elta="[1,0,0,0]$" /&gt;.&#10;The impulse signal is the &lt;i&gt;identity element&lt;/i&gt; under convolution,&#10;since &lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;(x\ast \delta)_n \isdef \sum_{m=0}^{N-1}\delta(m) x(n-m) = x(n)&#10;\end{displaymath}&#10; --&gt;&lt;img width="279" height="62" border="0" src="https://technick.net/img/guide_dft/img1309.png" alt="\" egin="" isplaymath="" ast="" elta="" isdef="" um="" n-1="" delta="" m="" x="" m="" n="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;If we set &lt;img width="42" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1310.png" alt="$x=\" elta="" /&gt; in the filter equation above,&#10;we get&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;y = h\ast x = h\ast \delta = h&#10;\end{displaymath}&#10; --&gt;&lt;img width="162" height="30" border="0" src="https://technick.net/img/guide_dft/img1311.png" alt="\" egin="" isplaymath="" h\ast="" h\ast="" elta="h" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Thus, &lt;img width="13" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1101.png" alt="$h$" /&gt; is the &lt;i&gt;impulse response&lt;/i&gt;&lt;a name="14511"&gt;&lt;/a&gt; of the filter.&lt;p&gt;It turns out in general that every linear time-invariant (LTI) system&#10;(filter) is completely described by its impulse response. No matter what&#10;the LTI system is, we can give it an impulse, record what comes out, call&#10;it &lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1312.png" alt="$h(n)$" /&gt;, and implement the system by convolving the input signal &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; with&#10;the impulse response &lt;img width="13" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1101.png" alt="$h$" /&gt;. In other words, every LTI system has a &lt;i&gt;convolution representation&lt;/i&gt;&lt;a name="14513"&gt;&lt;/a&gt; in terms of its impulse response.&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;hr /&gt;&lt;!--Table of Child-Links--&gt;&lt;a name="CHILD_LINKS"&gt;&lt;strong&gt;Subsections&lt;/strong&gt;&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html2549" href="https://technick.net/guides/theory/dft/lti_filters_convolution"&gt;LTI Filters and the Convolution Theorem&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;!--End of Table of Child-Links--&gt;&#10;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/acknowledgement"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/lti_filters_convolution"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>LTI Filters and the Convolution Theorem</title><link>https://technick.net/guides/theory/dft/lti_filters_convolution/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/lti_filters_convolution/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/appendix_a_linear"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/appendix_b_introductory"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00971000000000000000"&gt;LTI Filters and the Convolution Theorem&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Definition: &lt;/b&gt;The &lt;i&gt;frequency response&lt;/i&gt;&lt;a name="14517"&gt;&lt;/a&gt; of an LTI filter is defined&#10;as the &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;Fourier transform&lt;/a&gt; of its impulse response. In particular, for&#10;finite, discrete-time signals &lt;!-- MATH&#10; $h\in{\cal C}^N$&#10; --&gt;&lt;img width="54" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1313.png" alt="$h\" n="" al="" /&gt;, the sampled frequency response is&#10;defined as&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;H(\omega_k) \isdef DFT_k(h)&#10;\end{displaymath}&#10; --&gt;&lt;img width="142" height="31" border="0" src="https://technick.net/img/guide_dft/img1314.png" alt="\" egin="" isplaymath="" omega="" isdef="" t="" h="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;The complete frequency response is defined using the DTFT, i.e.,&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;H(\omega) \isdef \mbox{{\tt DTFT}}_\omega(\mbox{{\tt ZeroPad}}_\infty(h)) \isdef \sum_{n=0}^{N-1}h(n) e^{-j\omega n}&#10;\end{displaymath}&#10; --&gt;&lt;img width="364" height="62" border="0" src="https://technick.net/img/guide_dft/img1315.png" alt="\" egin="" isplaymath="" omega="" sdef="" box="" t="tt" tft="" mega="" box="" t="tt" eropad="" nfty="" isdef="" um="" n-1="" h="" n="" e="" omega="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where we used the fact that &lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1312.png" alt="$h(n)$" /&gt; is zero for &lt;img width="43" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1316.png" alt="$n&amp;lt;0$" /&gt; and &lt;img width="77" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1317.png" alt="$n&amp;gt;N-1$" /&gt; to&#10;truncate the summation limits. Thus, the infinitely zero-padded DTFT can&#10;be obtained from the &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;DFT&lt;/a&gt; by simply replacing &lt;img width="22" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img681.png" alt="$\" mega="" /&gt; by &lt;img width="15" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img527.png" alt="$\" mega="" /&gt;. In&#10;principle, the continuous frequency response &lt;img width="41" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1318.png" alt="$H(\" mega="" /&gt; is being obtained&#10;using ''time-limited interpolation in the frequency domain'' based on the&#10;samples &lt;img width="49" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1319.png" alt="$H(\" mega="" /&gt;. This interpolation is possible only when the&#10;frequency samples &lt;img width="49" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1319.png" alt="$H(\" mega="" /&gt; are sufficiently dense: for a length &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt;finite-impulse-response (FIR) filter &lt;img width="13" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1101.png" alt="$h$" /&gt;, we require at least &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; samples&#10;around the unit circle (length &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; DFT) in order that &lt;img width="41" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1318.png" alt="$H(\" mega="" /&gt; be&#10;sufficiently well sampled in the frequency domain. This is of course the&#10;dual of the usual &lt;a href="https://technick.net/guides/theory/dft/shannon_s_sampling_theorem"&gt;sampling rate&lt;/a&gt; requirement in the time&#10;domain.&lt;a name="tex2html105" href="https://technick.net/guides/theory/dft/footnode#foot13534"&gt;&lt;sup&gt;8.10&lt;/sup&gt;&lt;/a&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Definition: &lt;/b&gt;The &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/logarithms"&gt;amplitude&lt;/a&gt; response&lt;/i&gt;&lt;a name="14528"&gt;&lt;/a&gt; of a filter is defined as&#10;the &lt;i&gt;magnitude&lt;/i&gt; of the frequency response&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;G(k) \isdef \left|H(\omega_k)\right|&#10;\end{displaymath}&#10; --&gt;&lt;img width="118" height="31" border="0" src="https://technick.net/img/guide_dft/img1320.png" alt="\" egin="" isplaymath="" k="" sdef="" eft\vert="" mega="" right\vert="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;From the &lt;a href="https://technick.net/guides/theory/dft/convolution_theorem"&gt;convolution theorem&lt;/a&gt;, we can see that the amplitude response &lt;img width="38" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1321.png" alt="$G(k)$" /&gt;is the &lt;i&gt;gain&lt;/i&gt; of the filter at frequency &lt;img width="22" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img681.png" alt="$\" mega="" /&gt;, since&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\left|Y(k)\right| = \left|H(\omega_k)X(k)\right| = G(k)\left|X(k)\right|&#10;\end{displaymath}&#10; --&gt;&lt;img width="279" height="31" border="0" src="https://technick.net/img/guide_dft/img1322.png" alt="\" egin="" isplaymath="" eft\vert="" right\vert="\left\vert" h="" mega="" x="" right\vert="G(k)\left\vert" x="" right\vert="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Definition: &lt;/b&gt;The &lt;i&gt;phase response&lt;/i&gt;&lt;a name="14532"&gt;&lt;/a&gt; of a filter is defined as&#10;the &lt;i&gt;phase&lt;/i&gt; of the frequency response&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\Theta(k) \isdef \angle{H(\omega_k)}&#10;\end{displaymath}&#10; --&gt;&lt;img width="118" height="31" border="0" src="https://technick.net/img/guide_dft/img1323.png" alt="\" egin="" isplaymath="" heta="" isdef="" ngle="" omega="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;From the convolution theorem, we can see that the phase response&lt;img width="38" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1232.png" alt="$\" heta="" /&gt; is the phase-shift added by the filter to an input sinusoidal&#10;component at frequency &lt;img width="22" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img681.png" alt="$\" mega="" /&gt;, since&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\angle{Y(k)} = \angle{\left[H(\omega_k)X(k)\right]} &#10;&#9;= \angle{H(\omega_k)} + \angle{X(k)}&#10;\end{displaymath}&#10; --&gt;&lt;img width="334" height="31" border="0" src="https://technick.net/img/guide_dft/img1324.png" alt="\" egin="" isplaymath="" ngle="" k="" ngle="" eft="" omega="" x="" right="" ngle="" omega="" angle="" k="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;The subject of this section is developed in detail in [&lt;a href="https://technick.net/guides/theory/dft/bibliography#JOSFP"&gt;1&lt;/a&gt;].&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/appendix_a_linear"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/appendix_b_introductory"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Appendix B: Introductory Statistical Signal Processing</title><link>https://technick.net/guides/theory/dft/appendix_b_introductory/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/appendix_b_introductory/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/lti_filters_convolution"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/cross_correlation"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00980000000000000000"&gt;&lt;/a&gt;&lt;a name="sec:SSP"&gt;&lt;/a&gt;&lt;br /&gt;Appendix B: Introductory &lt;a href="https://technick.net/guides/theory/dft/appendix_b_introductory"&gt;Statistical Signal Processing&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;The &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/correlation"&gt;correlation&lt;/a&gt; operator&lt;/i&gt; defined above plays a major role in&#10;statistical signal processing. This section gives a short&#10;introduction to some of the most commonly used elements. The student&#10;interested in mastering the concepts introduced briefly below may&#10;consider taking EE 278 in the Electrical Engineering Department. For&#10;further reading, see [&lt;a href="https://technick.net/guides/theory/dft/bibliography#Sharf91"&gt;16&lt;/a&gt;,&lt;a href="https://technick.net/guides/theory/dft/bibliography#Kay88"&gt;20&lt;/a&gt;].&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;hr /&gt;&lt;!--Table of Child-Links--&gt;&lt;a name="CHILD_LINKS"&gt;&lt;strong&gt;Subsections&lt;/strong&gt;&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html2572" href="https://technick.net/guides/theory/dft/cross_correlation"&gt;Cross-Correlation&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2573" href="https://technick.net/guides/theory/dft/applications_cross_correlat"&gt;Applications of Cross-Correlation&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2574" href="https://technick.net/guides/theory/dft/autocorrelation"&gt;Autocorrelation&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2575" href="https://technick.net/guides/theory/dft/coherence"&gt;Coherence&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;!--End of Table of Child-Links--&gt;&#10;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/lti_filters_convolution"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/cross_correlation"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Cross-Correlation</title><link>https://technick.net/guides/theory/dft/cross_correlation/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/cross_correlation/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/appendix_b_introductory"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/applications_cross_correlat"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00981000000000000000"&gt;Cross-Correlation&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Definition: &lt;/b&gt;The &lt;i&gt;circular &lt;a href="https://technick.net/guides/theory/dft/cross_correlation"&gt;cross-correlation&lt;/a&gt;&lt;/i&gt; of two signals &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; and &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img13.png" alt="$y$" /&gt; in &lt;img width="26" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img745.png" alt="${\" al="" /&gt; &#10;may be defined by&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\fbox{$\displaystyle r_{xy}(l) \isdef \frac{1}{N}(x\star y)(l) &#10;&#9;\isdef \frac{1}{N}\sum_{n=0}^{N-1}\overline{x(n)} y(n+l), \; l=0,1,2,\ldots,N-1$}&#9;\quad\mbox{(cross-correlation)}&#10;\end{displaymath}&#10; --&gt;&lt;img width="667" height="73" border="0" src="https://technick.net/img/guide_dft/img1325.png" alt="\" egin="" isplaymath="" box="" isplaystyle="" y="" isdef="" rac="" x\star="" l="" ldots="" n-1="" quad\mbox="" ross-correlation="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;(Note carefully above that ''&lt;img width="9" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1274.png" alt="$l$" /&gt;'' is an integer variable, not the constant&lt;img width="12" height="13" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img78.png" alt="$1$" /&gt;.) The term ''cross-correlation'' comes from &lt;i&gt;statistics&lt;/i&gt;, and what&#10;we have defined here is more properly called the ''sample&#10;cross-correlation,'' i.e., it is an &lt;i&gt;estimator&lt;/i&gt; of the true&#10;cross-correlation which is a statistical property of the signal itself.&#10;The estimator works by &lt;i&gt;averaging lagged products &lt;!-- MATH&#10; $\overline{x(n)}&#10;y(n+l)$&#10; --&gt;&lt;img width="90" height="38" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1326.png" alt="$\" verline="" n="" n="" /&gt;&lt;/i&gt;. The true statistical cross-correlation is the so-called &lt;i&gt;expected value&lt;/i&gt; of the lagged products in random signals &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; and &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img13.png" alt="$y$" /&gt;, which&#10;may be denoted &lt;!-- MATH&#10; ${\cal E}\{x(n) y(n+l)\}$&#10; --&gt;&lt;img width="116" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1327.png" alt="${\" al="" n="" n="" /&gt;. In principle, the expected value&#10;must be computed by averaging &lt;img width="81" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1328.png" alt="$(n) y(n+l)$" /&gt; over many &lt;i&gt;realizations&lt;/i&gt; of&#10;the stochastic process &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; and &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img13.png" alt="$y$" /&gt;. That is, for each ''roll of the dice''&#10;we obtain &lt;img width="30" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img44.png" alt="$x(\" dot="" /&gt; and &lt;img width="29" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img640.png" alt="$y(\" dot="" /&gt; for &lt;i&gt;all time&lt;/i&gt;, and we can average&lt;img width="90" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1329.png" alt="$x(n) y(n+l)$" /&gt; across all realizations to estimate the expected value of&lt;img width="90" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1329.png" alt="$x(n) y(n+l)$" /&gt;. This is called an ''ensemble average'' across realizations&#10;of a stochastic process. If the signals are &lt;i&gt;stationary&lt;/i&gt; (which&#10;primarily means their statistics are &lt;i&gt;time-invariant&lt;/i&gt;), then we may&lt;i&gt;average across time&lt;/i&gt; to estimate the expected value. In other words,&#10;for stationary &lt;a href="http://www.treasure-troves.com/physics/noise.php"&gt;noise&lt;/a&gt;-like signals, &lt;i&gt;time averages equal ensemble&#10;averages&lt;/i&gt;. The above definition of the sample cross-correlation is only&#10;valid for stationary stochastic processes.&lt;p&gt;The &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;DFT&lt;/a&gt; of the cross-correlation is called the &lt;i&gt;cross-spectral&#10;density&lt;/i&gt;, or ''cross-power spectrum,'' or even simply ''&lt;a href="https://technick.net/guides/theory/dft/cross_correlation"&gt;cross-spectrum&lt;/a&gt;.''&lt;/p&gt;&lt;p&gt;Normally in practice we are interested in estimating the true&#10;cross-correlation between two signals, not the circular cross-correlation&#10;which results naturally in a DFT setting. For this, we may define instead&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\fbox{$\displaystyle {\hat r}_{xy}(l) \isdef \frac{1}{N-1-l}\sum_{n=0}^{N-l} \overline{x(n)} y(n+l),\;&#10;&#9;l = 0,1,2,\ldots,L-1$}&#9;\quad\mbox{(\emph{unbiased} cross-correlation)}&#10;\end{displaymath}&#10; --&gt;&lt;img width="679" height="74" border="0" src="https://technick.net/img/guide_dft/img1330.png" alt="\" egin="" isplaymath="" box="" isplaystyle="" at="" y="" isdef="" rac="" l="" dots="" quad\mbox="" mph="" nbiased="" ross-correlation="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where we chose &lt;img width="63" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1331.png" alt="$L&amp;lt;&amp;lt;N$" /&gt; (e.g. &lt;img width="64" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1332.png" alt="$L=\" qrt="" /&gt;) in order to have enough lagged&#10;products at the highest lag that a reasonably accurate average is obtained.&#10;The term ''unbiased'' refers to the fact that we are dividing the sum by&lt;img width="43" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1333.png" alt="$N-l$" /&gt; rather than &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt;.&lt;p&gt;Note that instead of first estimating the cross-correlation between signals&lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; and &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img13.png" alt="$y$" /&gt; and then taking the DFT to estimate the cross-spectral density,&#10;we may instead compute the sample cross-correlation for each block of a&#10;signal, take the DFT of each, and &lt;i&gt;average the DFTs&lt;/i&gt; to form a final&#10;cross-spectrum estimate. This is called the &lt;i&gt;periodogram method&lt;/i&gt; of&#10;spectral estimation.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/appendix_b_introductory"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/applications_cross_correlat"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Applications of Cross-Correlation</title><link>https://technick.net/guides/theory/dft/applications_cross_correlat/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/applications_cross_correlat/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/cross_correlation"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/autocorrelation"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00982000000000000000"&gt;Applications of Cross-Correlation&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;The &lt;a href="https://technick.net/guides/theory/dft/cross_correlation"&gt;cross-correlation&lt;/a&gt; function is used extensively in &lt;i&gt;pattern&#10;recognition&lt;/i&gt; and &lt;i&gt;signal detection&lt;/i&gt;. We know that projecting one&#10;signal onto another is a means of measuring how much of the second signal&#10;is present in the first. This can be used to ''detect'' the presence of&#10;known signals as components of more complicated signals. As a simple&#10;example, suppose we record &lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img50.png" alt="$x(n)$" /&gt; which we think consists of a signal&lt;img width="34" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1334.png" alt="$s(n)$" /&gt; which we are looking for plus some additive measurement &lt;a href="http://www.treasure-troves.com/physics/noise.php"&gt;noise&lt;/a&gt;&lt;img width="33" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img459.png" alt="$e(n)$" /&gt;. Then the projection of &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; onto &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img17.png" alt="$s$" /&gt; is&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;{\cal P}_s(x) = {\cal P}_s(s) + {\cal P}_s(e) \approx s&#10;\end{displaymath}&#10; --&gt;&lt;img width="203" height="31" border="0" src="https://technick.net/img/guide_dft/img1335.png" alt="\" egin="" isplaymath="" al="" s="" cal="" s="" s="" al="" s="" approx="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;since the projection of any specific signal &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img17.png" alt="$s$" /&gt; onto random, zero-mean&#10;noise is close to zero. Another term for this process is called &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/applications_cross_correlat"&gt;matched filtering&lt;/a&gt;&lt;/i&gt;. The impulse response of the ''matched filter'' for a&#10;signal &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; is given by &lt;!-- MATH&#10; $\mbox{{\tt Flip}}(x)$&#10; --&gt;&lt;img width="59" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1336.png" alt="$\" box="" t="tt" lip="" /&gt;. By time reversing &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt;, we transform the&lt;a href="https://technick.net/guides/theory/dft/convolution"&gt;convolution&lt;/a&gt; implemented by filtering into a cross-correlation operation.&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/cross_correlation"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/autocorrelation"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Autocorrelation</title><link>https://technick.net/guides/theory/dft/autocorrelation/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/autocorrelation/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/applications_cross_correlat"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/coherence"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00983000000000000000"&gt;Autocorrelation&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;The &lt;a href="https://technick.net/guides/theory/dft/cross_correlation"&gt;cross-correlation&lt;/a&gt; of a signal with itself gives the &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/autocorrelation"&gt;autocorrelation&lt;/a&gt; function&lt;/i&gt;&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\fbox{$\displaystyle r_x(l) \isdef \frac{1}{N}(x\star x)(l) &#10;&#9;\isdef \frac{1}{N}\sum_{n=0}^{N-1}\overline{x(n)} x(n+l)$}&#9;\quad\mbox{(autocorrelation)}&#10;\end{displaymath}&#10; --&gt;&lt;img width="483" height="73" border="0" src="https://technick.net/img/guide_dft/img1337.png" alt="\" egin="" isplaymath="" box="" isplaystyle="" l="" sdef="" rac="" x\star="" n-1="" verline="" n="" n="" quad\mbox="" utocorrelation="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;The autocorrelation function is Hermitian:&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;r_x(-l) = \overline{r_x(l)}&#10;\end{displaymath}&#10; --&gt;&lt;img width="109" height="31" border="0" src="https://technick.net/img/guide_dft/img1338.png" alt="\" egin="" isplaymath="" x="" overline="" x="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;When &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; is real, its autocorrelation is &lt;i&gt;symmetric&lt;/i&gt;. More&#10;specifically, it is &lt;i&gt;real and even&lt;/i&gt;.&lt;p&gt;As in the case of cross-&lt;a href="https://technick.net/guides/theory/dft/correlation"&gt;correlation&lt;/a&gt;, we can form a true sample&#10;autocorrelation of sampled signals via&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\fbox{$\displaystyle {\hat r}_x(l) \isdef \frac{1}{N-l}\sum_{n=0}^{N-1}\overline{x(n)} x(n+l),\;&#10;&#9;l = 0,1,2,\ldots,L-1$}&#9;\quad\mbox{(\emph{unbiased} cross-correlation)}&#10;\end{displaymath}&#10; --&gt;&lt;img width="644" height="73" border="0" src="https://technick.net/img/guide_dft/img1339.png" alt="\" egin="" isplaymath="" box="" isplaystyle="" at="" l="" sdef="" rac="" l="" um="" dots="" quad\mbox="" mph="" nbiased="" ross-correlation="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;The &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;DFT&lt;/a&gt; of the autocorrelation function &lt;img width="41" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1340.png" alt="$r_x(n)$" /&gt; is called the &lt;i&gt;power&#10;spectral density&lt;/i&gt; (PSD), or ''power spectrum,'' and is often denoted&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;S_x(k) \isdef \mbox{{\tt DFT}}_k(r_x)\quad\mbox{(power spectral density)}&#10;\end{displaymath}&#10; --&gt;&lt;img width="335" height="31" border="0" src="https://technick.net/img/guide_dft/img1341.png" alt="\" egin="" isplaymath="" s="" k="" sdef="" box="" t="tt" ft="" r="" quad\mbox="" ower="" ectral="" nsity="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;The true PSD of a ''stationary stochastic process'' is the &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;Fourier&#10;transform&lt;/a&gt; of the true autocorrelation function, and therefore the&#10;definition above provides only a sample &lt;i&gt;estimate&lt;/i&gt; of the PSD.&lt;p&gt;As in the case of the &lt;a href="https://technick.net/guides/theory/dft/cross_correlation"&gt;cross-spectrum&lt;/a&gt;, we may use the &lt;i&gt;periodogram&#10;method&lt;/i&gt; for computing the power spectrum estimate. That is, we may&#10;estimate the power spectrum as the average of the DFTs of many sample&#10;autocorrelations which are computed block by block in a long signal, rather&#10;than taking one DFT of a single autocorrelation estimate based on all the&#10;data we have. By the &lt;a href="https://technick.net/guides/theory/dft/correlation_theorem"&gt;Correlation Theorem&lt;/a&gt;, this is the same as &lt;i&gt;averaging squared-magnitude DFTs of the signal blocks themselves&lt;/i&gt;. Let&lt;img width="25" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1342.png" alt="$x_m$" /&gt; denote the &lt;img width="18" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img937.png" alt="$m$" /&gt;th block of the signal &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt;, and let &lt;img width="21" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img201.png" alt="$M$" /&gt; denote the&#10;number of blocks. Then the PSD estimate is given by&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;{\hat S}_x(k) = \frac{1}{M}\left|DFT_k(x_m)\right|^2 \quad \mbox{(power spectral&#10;&#9;density estimate, periodogram method)}&#10;\end{displaymath}&#10; --&gt;&lt;img width="641" height="42" border="0" src="https://technick.net/img/guide_dft/img1343.png" alt="\" egin="" isplaymath="" at="" k="" rac="" left\vert="" t="" x="" right\vert="" box="" ower="" ectral="" nsity="" timate="" eriodogram="" thod="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;However, note that &lt;!-- MATH&#10; $\left|X_m\right|^2\leftrightarrow x\star x$&#10; --&gt;&lt;img width="103" height="38" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1344.png" alt="$\" eft\vert="" right\vert="" eftrightarrow="" tar="" /&gt; which is &lt;i&gt;circular&lt;/i&gt;correlation. To avoid this, we use &lt;i&gt;zero padding&lt;/i&gt; in the time domain,&#10;i.e., we replace &lt;img width="25" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1342.png" alt="$x_m$" /&gt; above by &lt;!-- MATH&#10; $[x_m,0,\ldots,0]$&#10; --&gt;&lt;img width="92" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1345.png" alt="$[x_m,0,\" dots="" /&gt;. However, note that&#10;although the ''wrap-around problem'' is fixed, the estimator is still &lt;i&gt;biased&lt;/i&gt;. To repair this, we can use a &lt;i&gt;triangular window&lt;/i&gt; (also called&#10;a ''Bartlett window'') to apply the weighting needed to remove the bias.&lt;p&gt;For real signals, the autocorrelation is real and even, and therefore the&#10;power spectral density is real and even for all real signals. The PSD&lt;img width="45" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1346.png" alt="$S_x(\" mega="" /&gt; can interpreted as a measure of the relative probability that&#10;the signal contains energy at frequency &lt;img width="15" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img527.png" alt="$\" mega="" /&gt;. Essentially, however, it&#10;is the long-term average energy density vs. frequency in the random&#10;process &lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img50.png" alt="$x(n)$" /&gt;.&lt;/p&gt;&lt;p&gt;At lag zero, the autocorrelation function reduces to the &lt;i&gt;average&#10;power&lt;/i&gt; (root mean square) which we defined earlier:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;r_x(0) \isdef \frac{1}{N}\sum_{m=0}^{N-1}\left|x(m)\right|^2 \isdef {\cal P}_x^2&#10;\end{displaymath}&#10; --&gt;&lt;img width="219" height="62" border="0" src="https://technick.net/img/guide_dft/img1347.png" alt="\" egin="" isplaymath="" x="" sdef="" rac="" sum="" n-1="" left\vert="" m="" ight\vert="" sdef="" al="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;Replacing ''correlation'' with ''covariance'' in the above definitions&#10;gives the corresponding zero-mean versions. For example, the &lt;i&gt;cross-covariance&lt;/i&gt; is defined as&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\fbox{$\displaystyle c_{xy}(n) &#10;\isdef \frac{1}{N}\sum_{m=0}^{N-1}\overline{[x(m)-\mu_x]} [y(m+n)-\mu_y]$}&#9;\quad\mbox{(cross-covariance function)}&#10;\end{displaymath}&#10; --&gt;&lt;img width="571" height="73" border="0" src="https://technick.net/img/guide_dft/img1348.png" alt="\" egin="" isplaymath="" box="" isplaystyle="" y="" isdef="" rac="" sum="" u="u" x="" m="" mu="" quad\mbox="" ross-covariance="" nction="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;We also have that &lt;img width="39" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1349.png" alt="$c_x(0)$" /&gt; equals the &lt;i&gt;variance&lt;/i&gt; of the signal &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt;:&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;c_x(0) \isdef \frac{1}{N}\sum_{m=0}^{N-1}\left|x(m)-\mu_x\right|^2 \isdef \sigma_x^2&#10;\end{displaymath}&#10; --&gt;&lt;img width="257" height="62" border="0" src="https://technick.net/img/guide_dft/img1350.png" alt="\" egin="" isplaymath="" x="" sdef="" rac="" sum="" n-1="" left\vert="" m="" u="" right\vert="" sdef="" igma="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/applications_cross_correlat"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/coherence"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Coherence</title><link>https://technick.net/guides/theory/dft/coherence/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/coherence/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/autocorrelation"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/appendix_c_mathematica_matl"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION00984000000000000000"&gt;Coherence&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;A function related to &lt;a href="https://technick.net/guides/theory/dft/cross_correlation"&gt;cross-correlation&lt;/a&gt; is the &lt;i&gt;coherence function&lt;/i&gt;&lt;!-- MATH&#10; $\Gamma_{xy}(\omega)$&#10; --&gt;&lt;img width="52" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1351.png" alt="$\" amma="" y="" mega="" /&gt;, defined in terms of power spectral densities and&#10;the cross-spectral density by&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\Gamma_{xy}(k) \isdef \frac{S_{xy}(k)}{\sqrt{S_x(k)S_y(k)}}&#10;\end{displaymath}&#10; --&gt;&lt;img width="181" height="52" border="0" src="https://technick.net/img/guide_dft/img1352.png" alt="\" egin="" isplaymath="" amma="" y="" isdef="" rac="" s="" y="" sqrt="" s="" k="" s="" k="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;In practice, these quantities can be &lt;i&gt;estimated&lt;/i&gt; by &lt;i&gt;averaging&lt;/i&gt;&lt;!-- MATH&#10; $\overline{X(k)}Y(k)$&#10; --&gt;&lt;img width="74" height="38" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1353.png" alt="$\" verline="" k="" k="" /&gt;, &lt;!-- MATH&#10; $\left|X(k)\right|^2$&#10; --&gt;&lt;img width="56" height="38" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1354.png" alt="$\" eft\vert="" right\vert="" /&gt; and &lt;!-- MATH&#10; $\left|Y(k)\right|^2$&#10; --&gt;&lt;img width="54" height="38" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1355.png" alt="$\" eft\vert="" right\vert="" /&gt;over successive signal blocks. Let &lt;img width="24" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1356.png" alt="$\" cdot\="" /&gt; denote time averaging.&#10;Then an estimate of the coherence, the &lt;i&gt;sample coherence function&lt;/i&gt;&lt;!-- MATH&#10; ${\hat\Gamma}_{xy}(k)$&#10; --&gt;&lt;img width="50" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1357.png" alt="${\" at\gamma="" y="" /&gt;, may be defined by&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;{\hat\Gamma}_{xy}(k) \isdef &#10;\frac{\left\{\overline{X(k)}Y(k)\right\}}{\sqrt{\left\{\left|X(k)\right|^2\right\}\cdot&#10;&#9;\left\{\left|Y(k)\right|^2\right\}}}&#10;\end{displaymath}&#10; --&gt;&lt;img width="266" height="87" border="0" src="https://technick.net/img/guide_dft/img1358.png" alt="\" egin="" isplaymath="" at\gamma="" y="" isdef="" rac="" eft\="" verline="" k="" k="" ight\="" dot="" eft\="" eft\vert="" right\vert="" ight\="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;The magnitude-squared coherence &lt;!-- MATH&#10; $\left|\Gamma_{xy}(k)\right|^2$&#10; --&gt;&lt;img width="66" height="38" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1359.png" alt="$\" eft\vert\gamma="" y="" right\vert="" /&gt; is a real function&#10;between &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img38.png" alt="$0$" /&gt; and &lt;img width="12" height="13" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img78.png" alt="$1$" /&gt; which gives a measure of &lt;a href="https://technick.net/guides/theory/dft/correlation"&gt;correlation&lt;/a&gt; between &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; and&lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img13.png" alt="$y$" /&gt; at each frequency (&lt;a href="https://technick.net/guides/theory/dft/dft"&gt;DFT&lt;/a&gt; bin number &lt;img width="13" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img53.png" alt="$k$" /&gt;). For example, imagine that &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img13.png" alt="$y$" /&gt;is produced from &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; via an LTI filtering operation:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;y = h\ast x \;\Rightarrow \; Y(k) = H(k)X(k)&#10;\end{displaymath}&#10; --&gt;&lt;img width="245" height="31" border="0" src="https://technick.net/img/guide_dft/img1360.png" alt="\" egin="" isplaymath="" h\ast="" rightarrow="" k="" k="" k="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Then the coherence function is&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;{\hat \Gamma}_{xy}(k) \isdef &#10;\frac{\overline{X(k)}Y(k)}{\left|X(k)\right|\cdot\left|Y(k)\right|}&#10;= \frac{\overline{X(k)}H(k)X(k)}{\left|X(k)\right|\left|H(k)X(k)\right|}&#10;= \frac{\left|X(k)\right|^2 H(k)}{\left|X(k)\right|^2\left|H(k)\right|}&#10;= \frac{H(k)}{\left|H(k)\right|}&#10;\end{displaymath}&#10; --&gt;&lt;img width="567" height="55" border="0" src="https://technick.net/img/guide_dft/img1361.png" alt="\" egin="" isplaymath="" at="" amma="" y="" isdef="" rac="" verline="" k="" k="" e="" rt="" right\vert="" rac="" k="" eft\vert="" right\vert="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;and the magnitude-squared coherence function is simply&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\left|{\hat \Gamma}_{xy}(k)\right| = &#10;\left|\frac{H(k)}{\left|H(k)\right|}\right| = 1&#10;\end{displaymath}&#10; --&gt;&lt;img width="180" height="49" border="0" src="https://technick.net/img/guide_dft/img1362.png" alt="\" egin="" isplaymath="" eft\vert="" at="" amma="" y="" right\vert="\left\vert\frac{H(k)}{\left\vert" h="" right\vert="" ight\vert="1" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;On the other hand, if &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; and &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img13.png" alt="$y$" /&gt; are uncorrelated &lt;a href="http://www.treasure-troves.com/physics/noise.php"&gt;noise&lt;/a&gt; processes, the&#10;coherence converges to zero. &lt;p&gt;A common use for the coherence function is in the validation of&#10;input/output data collected in an acoustics experiment for purposes of &lt;i&gt;system identification&lt;/i&gt;. For example, &lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img50.png" alt="$x(n)$" /&gt; might be a known signal which&#10;is input to an unknown system, such as a reverberant room, say, and &lt;img width="34" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img641.png" alt="$y(n)$" /&gt;is the recorded response of the room. Ideally, the coherence should be &lt;img width="12" height="13" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img78.png" alt="$1$" /&gt;at all frequencies. However, if the microphone is situated at a &lt;i&gt;null&lt;/i&gt;in the room response for some frequency, it may record mostly noise at that&#10;frequency. This will be indicated in the measured coherence by a&#10;significant dip below &lt;img width="12" height="13" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img78.png" alt="$1$" /&gt;.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/autocorrelation"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/appendix_c_mathematica_matl"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Appendix C: Mathematica/Matlab Examples</title><link>https://technick.net/guides/theory/dft/appendix_c_mathematica_matl/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/appendix_c_mathematica_matl/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/coherence"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/appendix_d_similarity"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION00990000000000000000"&gt;Appendix C: Mathematica/Matlab Examples&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;Below is the &lt;a href="https://technick.net/guides/theory/dft/sidebar_mathematica"&gt;Mathematica&lt;/a&gt; code for creating the &lt;a href="https://technick.net/guides/theory/dft/decimation_theorem_aliasing"&gt;aliasing&lt;/a&gt; example in &#10;Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/alias_operator#fig:aliasing"&gt;8.9&lt;/a&gt;.&lt;pre&gt;&#10;aliasShow[freq_, srate_, options___] :=&#10; SeqPlot[Sin[2 \[Pi] freq t / srate], {t, 0, srate-1},options,&#10;&#9;Continuous-&amp;gt;True]&#10;&lt;p&gt;a = aliasShow[1, 10];&#10;b = aliasShow[-9, 10, PlotStyle-&amp;gt;RGBColor[1,0,0]];&#10;Show[a, b, AspectRatio-&amp;gt;1/3];&lt;/pre&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/coherence"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;  &lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;  &lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;  &lt;a href="https://technick.net/guides/theory/dft/appendix_d_similarity"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Appendix D: The Similarity Theorem</title><link>https://technick.net/guides/theory/dft/appendix_d_similarity/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/appendix_d_similarity/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/appendix_c_mathematica_matl"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/example_applications_dft"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION009100000000000000000"&gt;&lt;/a&gt;&lt;a name="sec:Similarity"&gt;&lt;/a&gt;&lt;br /&gt;Appendix D: The &lt;a href="https://technick.net/guides/theory/dft/appendix_d_similarity"&gt;Similarity Theorem&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;The &lt;i&gt;similarity theorem&lt;/i&gt;&lt;a name="14606"&gt;&lt;/a&gt; &#10;is fundamentally&#10;restricted to the &lt;i&gt;continuous&lt;/i&gt;-time case. It says that if you&#10;''stretch'' a signal by the factor &lt;img width="14" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1363.png" alt="$\" lpha="" /&gt; in the time domain, you&#10;''squeeze'' its &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;Fourier transform&lt;/a&gt; by the same factor in the frequencydomain. This is such a fundamental Fourier relationship, that we&#10;include it here rather than leave it out as a non-&lt;a href="https://technick.net/guides/theory/dft/dft"&gt;DFT&lt;/a&gt; result.&lt;/p&gt;&lt;p&gt;The closest we came to the similarity theorem among the DFT theorems was&#10;the the Interpolation Theorem. We found that ''stretching'' a&lt;i&gt;discrete-time&lt;/i&gt; signal by the integer factor &lt;img width="14" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1363.png" alt="$\" lpha="" /&gt; (filling in&#10;between samples with zeros) corresponded to the spectrum being&lt;i&gt;repeated&lt;/i&gt; &lt;img width="14" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1363.png" alt="$\" lpha="" /&gt; times around the unit circle. As a result, the&#10;''baseband'' copy of the spectrum ''shrinks'' in width (relative to &lt;img width="22" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img40.png" alt="$2\" i="i" /&gt;)&#10;by the factor &lt;img width="14" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1363.png" alt="$\" lpha="" /&gt;. Similarly, stretching a signal using&lt;i&gt;interpolation&lt;/i&gt; (instead of zero-fill) corresponded to the repeated&#10;spectrum with all spurious spectral copies zeroed out. The spectrum of the&#10;interpolated signal can therefore be seen as having been stretched by the&#10;inverse of the time-domain stretch factor. In summary, the Interpolation&#10;DFT Theorem can be viewed as the discrete-time counterpart of the&#10;similarity Fourier Transform (&lt;a href="https://technick.net/guides/theory/dft/dft"&gt;FT&lt;/a&gt;) theorem.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Theorem: &lt;/b&gt;For all continuous-time functions &lt;img width="31" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img357.png" alt="$x(t)$" /&gt; possessing a Fourier&#10;transform,&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\fbox{$\displaystyle \mbox{{\tt Stretch}}_\alpha(x) \leftrightarrow \frac{1}{\left|\alpha\right|}\mbox{{\tt Stretch}}_{(1/\alpha)}(X)$}&#10;\end{displaymath}&#10; --&gt;&lt;img width="293" height="59" border="0" src="https://technick.net/img/guide_dft/img1364.png" alt="\" egin="" isplaymath="" box="" isplaystyle="" box="" t="tt" tretch="" lpha="" leftrig="" t\vert\alpha\right\vert="" box="" t="tt" tretch="" lpha="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\mbox{{\tt Stretch}}_{\alpha,t}(x) \isdef x(\alpha t)&#10;\end{displaymath}&#10; --&gt;&lt;img width="170" height="32" border="0" src="https://technick.net/img/guide_dft/img1365.png" alt="\" egin="" isplaymath="" box="" t="tt" tretch="" lpha="" x="" sdef="" lpha="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;and &lt;img width="14" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1363.png" alt="$\" lpha="" /&gt; is any nonzero real number (the abscissa scaling factor).&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;em&gt;Proof: &lt;/em&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;\mbox{{\tt FT}}_{\omega}(\mbox{{\tt Stretch}}_\alpha(x)) &#10;&#9;&amp;\isdef &amp; \int_{-\infty}^\infty x(\alpha t) e^{-j\omega t} dt&#10;&#9;= \int_{-\infty}^\infty x(\tau) e^{-j\omega (\tau/\alpha)} d (\tau/\alpha) \\&#10;&#9;&amp;=&amp; \frac{1}{\left|\alpha\right|}\int_{-\infty}^\infty x(\tau) &#10;&#9;&#9;e^{-j(\omega/\alpha)\tau} d \tau \\&#10;&#9;&amp;\isdef &amp; \frac{1}{\left|\alpha\right|} X\left(\frac{\omega}{\alpha}\right)&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="543" height="146" border="0" src="https://technick.net/img/guide_dft/img1366.png" alt="\" egin="" qnarray="" box="" t="tt" t="" mega="" box="" t="tt" tretch="" lpha="" i="i" left\vert\alpha\right\vert="" left="" rac="" mega="" lpha="" ight="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;The absolute value appears above because, when &lt;img width="44" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1367.png" alt="$\" lpha="" t="" /&gt;, &lt;!-- MATH&#10; $d (\tau/\alpha)&#10;&lt; 0$&#10; --&gt;&lt;img width="81" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1368.png" alt="$d (\" au="" lpha="" t="" /&gt;, which brings out a minus sign in front of the integral from &lt;img width="32" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img329.png" alt="$-\" nfty="" /&gt;&lt;i&gt;to&lt;/i&gt; &lt;img width="20" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1369.png" alt="$\" nfty="" /&gt;.&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/appendix_c_mathematica_matl"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/example_applications_dft"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Example Applications of the DFT</title><link>https://technick.net/guides/theory/dft/example_applications_dft/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/example_applications_dft/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/appendix_d_similarity"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/spectrum_analysis_sinusoid"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION001000000000000000000"&gt;Example Applications of the DFT&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;This chapter goes through some practical examples of FFT analysis in&lt;a href="http://www.mathworks.com/access/helpdesk/help/techdoc/basics/getstarted.shtml"&gt;Matlab&lt;/a&gt;. The various &lt;a href="https://technick.net/guides/theory/dft/fourier_theorems"&gt;Fourier theorems&lt;/a&gt; provide a ''thinking&#10;vocabulary'' for understanding elements of spectral analysis.&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;hr /&gt;&lt;!--Table of Child-Links--&gt;&lt;a name="CHILD_LINKS"&gt;&lt;strong&gt;Subsections&lt;/strong&gt;&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html2656" href="https://technick.net/guides/theory/dft/spectrum_analysis_sinusoid"&gt;Spectrum Analysis of a Sinusoid: Windowing, Zero-Padding, and the FFT&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html2657" href="https://technick.net/guides/theory/dft/example_1_fft"&gt;Example 1: FFT of a Simple Sinusoid&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2658" href="https://technick.net/guides/theory/dft/example_2_fft"&gt;Example 2: FFT of a Not-So-Simple Sinusoid&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2659" href="https://technick.net/guides/theory/dft/example_3_fft"&gt;Example 3: FFT of a Zero-Padded Sinusoid&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2660" href="https://technick.net/guides/theory/dft/example_4_blackman"&gt;Example 4: Blackman Window&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2661" href="https://technick.net/guides/theory/dft/example_5_use"&gt;Example 5: Use of the Blackman Window&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2662" href="https://technick.net/guides/theory/dft/example_6_hanning_windowed"&gt;Example 6: Hanning-Windowed Complex Sinusoid&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html2663" href="https://technick.net/guides/theory/dft/spectral_phase"&gt;Spectral Phase&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;/ul&gt;&lt;!--End of Table of Child-Links--&gt;&#10;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/appendix_d_similarity"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/spectrum_analysis_sinusoid"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Spectrum Analysis of a Sinusoid: Windowing, Zero-Padding, and the FFT</title><link>https://technick.net/guides/theory/dft/spectrum_analysis_sinusoid/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/spectrum_analysis_sinusoid/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/example_applications_dft"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/example_1_fft"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION001010000000000000000"&gt;Spectrum Analysis of a Sinusoid: Windowing, Zero-Padding, and the FFT&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;The examples below give a progression from the most simplistic&#10;analysis up to a proper practical treatment. Careful study of these&#10;examples will teach you a lot about how &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;spectrum analysis&lt;/a&gt; is carried&#10;out on real data, and provide opportunities to see the &lt;a href="https://technick.net/guides/theory/dft/fourier_theorems"&gt;Fourier&#10;theorems&lt;/a&gt; in action.&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;hr /&gt;&lt;!--Table of Child-Links--&gt;&lt;a name="CHILD_LINKS"&gt;&lt;strong&gt;Subsections&lt;/strong&gt;&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html2674" href="https://technick.net/guides/theory/dft/example_1_fft"&gt;Example 1: FFT of a Simple Sinusoid&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2675" href="https://technick.net/guides/theory/dft/example_2_fft"&gt;Example 2: FFT of a Not-So-Simple Sinusoid&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2676" href="https://technick.net/guides/theory/dft/example_3_fft"&gt;Example 3: FFT of a Zero-Padded Sinusoid&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2677" href="https://technick.net/guides/theory/dft/example_4_blackman"&gt;Example 4: Blackman Window&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2678" href="https://technick.net/guides/theory/dft/example_5_use"&gt;Example 5: Use of the Blackman Window&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2679" href="https://technick.net/guides/theory/dft/example_6_hanning_windowed"&gt;Example 6: Hanning-Windowed Complex Sinusoid&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html2680" href="https://technick.net/guides/theory/dft/spectral_phase"&gt;Spectral Phase&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;/ul&gt;&lt;!--End of Table of Child-Links--&gt;&#10;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/example_applications_dft"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/example_1_fft"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Example 1: FFT of a Simple Sinusoid</title><link>https://technick.net/guides/theory/dft/example_1_fft/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/example_1_fft/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/spectrum_analysis_sinusoid"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/example_2_fft"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION001011000000000000000"&gt;Example 1: FFT of a Simple Sinusoid&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;Our first example is an FFT of the simple &lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;sinusoid&lt;/a&gt;&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;x(n) = \cos(\omega_x n T)&#10;\end{displaymath}&#10; --&gt;&lt;img width="137" height="31" border="0" src="https://technick.net/img/guide_dft/img1370.png" alt="\" egin="" isplaymath="" n="" os="" mega="" t="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where we choose &lt;!-- MATH&#10; $\omega_x=2\pi(f_s/4)$&#10; --&gt;&lt;img width="104" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1371.png" alt="$\" mega="" pi="" f="" s="" /&gt; (frequency &lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1372.png" alt="$f_s/4$" /&gt;) and &lt;img width="45" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img48.png" alt="$T=1$" /&gt;(&lt;a href="https://technick.net/guides/theory/dft/shannon_s_sampling_theorem"&gt;sampling rate&lt;/a&gt; set to 1). Since we're using the FFT, the signal&#10;length &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; must be a power of &lt;img width="12" height="13" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img76.png" alt="$2$" /&gt;. Here is the &lt;a href="http://www.mathworks.com/access/helpdesk/help/techdoc/basics/getstarted.shtml"&gt;Matlab&lt;/a&gt; code:&lt;pre&gt;&#10;echo on; hold off; diary off;&#10;% !/bin/rm -f examples.dia; diary examples.dia % For session log&#10;% !mkdirs eps % For figures&#10;&lt;p&gt;% Example 1: FFT of a &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;DFT&lt;/a&gt; sinusoid&lt;/p&gt;&#10;&lt;p&gt;% Parameters:&#10;N = 64; % Must be a power of two&#10;T = 1; % Set sampling rate to 1&#10;f = 0.25; % Sinusoidal frequency in cycles per sample&#10;A = 1; % Sinusoidal &lt;a href="https://technick.net/guides/theory/dft/logarithms"&gt;amplitude&lt;/a&gt;&#10;phi = 0; % Sinusoidal phase&#10;n = [0:N-1];&#10;x = cos(2&lt;em&gt;pi&lt;/em&gt;n&lt;em&gt;f&lt;/em&gt;T); % Signal to analyze&#10;X = fft(x); % Spectrum&lt;/pre&gt;&lt;p&gt;Let&amp;rsquo;s plot the time data and magnitude spectrum:&lt;pre&gt;&#10;% Plot time data&#10;figure(1);&#10;subplot(3,1,1);&#10;plot(n,x,&amp;rsquo;&lt;em&gt;&amp;rsquo;); &lt;br&gt;&#10;ni = [0:.1:N-1]; % Interpolated time axis&#10;hold on;&#10;plot(ni,cos(2&lt;/em&gt;pi&lt;em&gt;ni&lt;/em&gt;f*T),&amp;rsquo;-&amp;rsquo;);&#10;title(&amp;lsquo;Sinusoid Sampled at 1/4 the Sampling Rate&amp;rsquo;);&#10;xlabel(&amp;lsquo;Time (samples)&amp;rsquo;); ylabel(&amp;lsquo;Amplitude&amp;rsquo;);&#10;text(-8,1,&amp;lsquo;a)&amp;rsquo;);&lt;/p&gt;&#10;&lt;p&gt;% Plot spectral magnitude&#10;magX = abs(X);&#10;fn = [0:1.0/N:1-1.0/N]; % Normalized frequency axis&#10;subplot(3,1,2);&#10;stem(fn,magX)&#10;xlabel(&amp;lsquo;Normalized Frequency (cycles per sample))&amp;rsquo;);&#10;ylabel(&amp;lsquo;Magnitude (Linear)&amp;rsquo;);&#10;text(-.11,40,&amp;lsquo;b)&amp;rsquo;);&lt;/p&gt;&#10;&lt;p&gt;% Same thing on a &lt;a href="https://technick.net/guides/theory/dft/decibels"&gt;dB scale&lt;/a&gt;&#10;spec = 20*log10(magX); % Spectral magnitude in &lt;a href="https://technick.net/guides/theory/dft/decibels"&gt;dB&lt;/a&gt;&#10;subplot(3,1,3);&#10;plot(fn,spec);&#10;axis([0 1 -350 50]);&#10;xlabel(&amp;lsquo;Normalized Frequency (cycles per sample))&amp;rsquo;);&#10;ylabel(&amp;lsquo;Magnitude (dB)&amp;rsquo;);&#10;text(-.11,50,&amp;lsquo;c)&amp;rsquo;);&#10;print -deps eps/example1.eps; hold off;&lt;/pre&gt; &lt;div align="CENTER"&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:example1"&gt;&lt;/a&gt;&lt;a name="17127"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure 9.1:&lt;/strong&gt;Sampled sinusoid at &lt;img width="65" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img41.png" alt="$f=f_s/4$" /&gt;.&#10;a) Time waveform. b) Magnitude spectrum. c) DB magnitude spectrum.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10;$\scalebox{0.8}{\includegraphics{eps/example1.eps}}$&#10;--&gt;&lt;img width="641" height="503" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1373.png" alt="\" calebox="" ncludegraphics="" ps="" xample1="" ps="" /&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;&lt;p&gt;The results are shown in Fig. &lt;a href="https://technick.net/guides/theory/dft/example_1_fft#fig:example1"&gt;9.1&lt;/a&gt;. The time-domain signal is shown&#10;in Fig. &lt;a href="https://technick.net/guides/theory/dft/example_1_fft#fig:example1"&gt;9.1&lt;/a&gt;a, both in pseudo-continuous and sampled form. In&#10;Fig. &lt;a href="https://technick.net/guides/theory/dft/example_1_fft#fig:example1"&gt;9.1&lt;/a&gt;b, we see two peaks in the magnitude spectrum, each at&#10;magnitude &lt;img width="20" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img442.png" alt="$32$" /&gt; on a linear scale, located at normalized frequencies &lt;img width="63" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1374.png" alt="$f=&#10;0.25$" /&gt; and &lt;!-- MATH&#10;$f= 0.75 = -0.25$&#10;--&gt;&lt;img width="125" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1375.png" alt="$f= 0.75 = -0.25$" /&gt;. Since the DFT length is &lt;img width="56" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1376.png" alt="$N=64$" /&gt;, a spectral&#10;peak amplitude of &lt;img width="93" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1377.png" alt="$32 = (1/2) 64$" /&gt; is what we expect, since&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10;\begin{displaymath}&#10;\mbox{{\tt DFT}}_k(\cos(\omega_x n)) \isdef \sum_{n=0}^{N-1}&#10;\frac{e^{j\omega_x n} + e^{-j\omega_x n}}{2} e^{-j\omega_k n}&#10;= \sum_{n=0}^{N-1}\frac{e^{j 0 n}}{2} = \frac{N}{2}&#10;\end{displaymath}&#10;--&gt;&lt;img width="478" height="62" border="0" src="https://technick.net/img/guide_dft/img1378.png" alt="\" egin="" isplaymath="" box="" t="tt" ft="" cos="" mega="" isdef="" um="" n-1="" mega="" sum="" n-1="" frac="" e="" j="" frac="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;when &lt;!-- MATH&#10;$\omega_k=\pm\omega_x$&#10;--&gt;&amp;lt;img width=&amp;ldquo;73&amp;rdquo; height=&amp;ldquo;28&amp;rdquo; align=&amp;ldquo;MIDDLE&amp;rdquo; border=&amp;ldquo;0&amp;rdquo; src=&amp;quot;/img/guide_dft/img1379.png&amp;quot; alt=&amp;quot;$&amp;quot; mega=&amp;quot;&amp;quot; pm\omega=&amp;quot;&amp;quot; x=&amp;quot;&amp;quot; /&amp;gt;. This happens at bin numbers &lt;!-- MATH&#10;$k = (0.25/f_s)N&#10;= 16$&#10;--&gt;&lt;img width="149" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1380.png" alt="$k = (0.25/f_s)N&#10;= 16$" /&gt; and &lt;!-- MATH&#10;$k = (0.75/f_s)N = 48$&#10;--&gt;&lt;img width="149" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1381.png" alt="$k = (0.75/f_s)N = 48$" /&gt; for &lt;img width="56" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1376.png" alt="$N=64$" /&gt;. However, recall that Matlab&#10;requires indexing from &lt;img width="12" height="13" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img78.png" alt="$1$" /&gt;, so that these peaks will really show up at&#10;index &lt;img width="20" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1382.png" alt="$17$" /&gt; and &lt;img width="20" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1383.png" alt="$49$" /&gt; in the &lt;tt&gt;magX&lt;/tt&gt; array.&lt;p&gt;The spectrum should be exactly zero at the other bin numbers. How&#10;accurately this happens can be seen by looking on a dB scale, as shown in&#10;Fig. &lt;a href="https://technick.net/guides/theory/dft/example_1_fft#fig:example1"&gt;9.1&lt;/a&gt;c. We see that the spectral magnitude in the other bins is&#10;on the order of &lt;img width="28" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1384.png" alt="$300$" /&gt; dB lower, which is close enough to zero for audio&#10;work.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/spectrum_analysis_sinusoid"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;  &lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;  &lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;  &lt;a href="https://technick.net/guides/theory/dft/example_2_fft"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Example 2: FFT of a Not-So-Simple Sinusoid</title><link>https://technick.net/guides/theory/dft/example_2_fft/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/example_2_fft/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/example_1_fft"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/example_3_fft"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION001012000000000000000"&gt;Example 2: FFT of a Not-So-Simple Sinusoid&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;Now let's increase the frequency in the above example by one-half of a bin:&lt;pre&gt;&#10;% Example 2: Same as Example 1 but with a frequency between bins&#10;&lt;p&gt;f = 0.25 + 0.5/N; % Move the frequency off of the bin center by half a bin&lt;/p&gt;&#10;&lt;p&gt;x = cos(2&lt;em&gt;pi&lt;/em&gt;n&lt;em&gt;f&lt;/em&gt;T); % Signal to analyze&#10;X = fft(x); % Spectrum&lt;/p&gt;&#10;&lt;p&gt;% Plot time data&#10;figure(2);&#10;subplot(3,1,1);&#10;plot(n,x,&amp;rsquo;&lt;em&gt;&amp;rsquo;); &lt;br&gt;&#10;ni = [0:.1:N-1]; % Interpolated time axis&#10;hold on;&#10;plot(ni,cos(2&lt;/em&gt;pi&lt;em&gt;ni&lt;/em&gt;f*T),&amp;rsquo;-&amp;rsquo;);&#10;title(&amp;rsquo;&lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;Sinusoid&lt;/a&gt; Sampled at NEAR 1/4 the &lt;a href="https://technick.net/guides/theory/dft/shannon_s_sampling_theorem"&gt;Sampling Rate&lt;/a&gt;&amp;rsquo;);&#10;xlabel(&amp;lsquo;Time (samples)&amp;rsquo;); ylabel(&amp;rsquo;&lt;a href="https://technick.net/guides/theory/dft/logarithms"&gt;Amplitude&lt;/a&gt;&amp;rsquo;);&#10;text(-8,1,&amp;lsquo;a)&amp;rsquo;); hold off;&lt;/p&gt;&#10;&lt;p&gt;% Plot spectral magnitude&#10;subplot(3,1,2);&#10;magX = abs(X);&#10;stem(fn,magX); grid;&#10;xlabel(&amp;lsquo;Normalized Frequency (cycles per sample))&amp;rsquo;);&#10;ylabel(&amp;lsquo;Magnitude (Linear)&amp;rsquo;);&#10;text(-0.11,30,&amp;lsquo;b)&amp;rsquo;);&lt;/p&gt;&#10;&lt;p&gt;% Same spectrum on a &lt;a href="https://technick.net/guides/theory/dft/decibels"&gt;dB scale&lt;/a&gt;&#10;subplot(3,1,3);&#10;spec = 20*log10(magX); % Spectral magnitude in &lt;a href="https://technick.net/guides/theory/dft/decibels"&gt;dB&lt;/a&gt;&#10;plot(fn,spec); grid&#10;xlabel(&amp;lsquo;Normalized Frequency (cycles per sample))&amp;rsquo;);&#10;ylabel(&amp;lsquo;Magnitude (dB)&amp;rsquo;);&#10;text(-0.11,40,&amp;lsquo;c)&amp;rsquo;);&#10;print -deps eps/example2.eps; hold off;&lt;/pre&gt;&lt;/p&gt;&lt;p&gt; &lt;div align="CENTER"&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:example2"&gt;&lt;/a&gt;&lt;a name="17142"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure 9.2:&lt;/strong&gt;Sinusoid at Frequency&lt;img width="124" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img42.png" alt="$f=0.25+0.5/N$" /&gt;. a) Time waveform. b) Magnitude spectrum. c) DB&#10;magnitude spectrum.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10;$\scalebox{0.8}{\includegraphics{eps/example2.eps}}$&#10;--&gt;&lt;img width="641" height="503" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1385.png" alt="\" calebox="" ncludegraphics="" ps="" xample2="" ps="" /&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;&lt;p&gt;The resulting magnitude spectrum is shown in Fig. &lt;a href="https://technick.net/guides/theory/dft/example_2_fft#fig:example2"&gt;9.2&lt;/a&gt;b and c. We&#10;see extensive &amp;lsquo;&amp;lsquo;spectral leakage&amp;rsquo;&amp;rsquo; into all the bins at this frequency.&lt;/p&gt;&lt;p&gt;To get an idea of where this spectral leakage is coming from,&#10;let&amp;rsquo;s look at the &lt;a href="https://technick.net/guides/theory/dft/modulo_indexing_periodic"&gt;periodic extension&lt;/a&gt; of the time waveform:&lt;pre&gt;&#10;% Plot the periodic extension of the time-domain signal&#10;plot([x,x]);&#10;title(&amp;lsquo;Time Waveform Repeated Once&amp;rsquo;);&#10;xlabel(&amp;lsquo;Time (samples)&amp;rsquo;);&#10;ylabel(&amp;lsquo;Amplitude&amp;rsquo;);&#10;print -deps eps/waveform2.eps; % Figure 4&#10;disp &amp;lsquo;pausing for RETURN (check the plot). . .&amp;rsquo;; pause&lt;/pre&gt;&lt;/p&gt;&lt;p&gt; &lt;div align="CENTER"&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:waveform2"&gt;&lt;/a&gt;&lt;a name="17151"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure 9.3:&lt;/strong&gt;Time waveform repeated to show&#10;discontinuity introduced by periodic extension (see midpoint).&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10;$\scalebox{0.8}{\includegraphics{eps/waveform2.eps}}$&#10;--&gt;&lt;img width="624" height="504" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1386.png" alt="\" calebox="" ncludegraphics="" ps="" aveform2="" ps="" /&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;The&#10;result is shown in Fig. &lt;a href="https://technick.net/guides/theory/dft/example_2_fft#fig:waveform2"&gt;9.3&lt;/a&gt;. Note the &amp;lsquo;&amp;lsquo;glitch&amp;rsquo;&amp;rsquo; in the&#10;middle where the signal begins its forced repetition.&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/example_1_fft"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;  &lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;  &lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;  &lt;a href="https://technick.net/guides/theory/dft/example_3_fft"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Example 3: FFT of a Zero-Padded Sinusoid</title><link>https://technick.net/guides/theory/dft/example_3_fft/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/example_3_fft/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/example_2_fft"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/example_4_blackman"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION001013000000000000000"&gt;Example 3: FFT of a Zero-Padded Sinusoid&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;Interestingly, looking back at Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/example_2_fft#fig:example2"&gt;9.2&lt;/a&gt;c, we see there are no&#10;negative &lt;a href="https://technick.net/guides/theory/dft/decibels"&gt;dB&lt;/a&gt; values. Could this be right? To &lt;i&gt;really&lt;/i&gt; see the&#10;spectrum, let's use some &lt;i&gt;zero padding&lt;/i&gt; in the time domain to yield&#10;ideal &lt;i&gt;interpolation&lt;/i&gt; in the freqency domain:&lt;/p&gt;&lt;p&gt;&lt;pre&gt;&#10;% Example 3: Add zero padding&#10;zpf = 8; % zero-padding factor&#10;x = [cos(2*pi*n*f*T),zeros(1,(zpf-1)*N)]; % zero-padded FFT input data&#10;X = fft(x); % Interpolated spectrum&#10;&lt;p&gt;% Plot time data&#10;figure(4);&#10;subplot(3,1,1);&#10;plot(x); &lt;br&gt;&#10;title(&amp;lsquo;Zero-Padded Sampled &lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;Sinusoid&lt;/a&gt;&amp;rsquo;);&#10;xlabel(&amp;lsquo;Time (samples)&amp;rsquo;); ylabel(&amp;rsquo;&lt;a href="https://technick.net/guides/theory/dft/logarithms"&gt;Amplitude&lt;/a&gt;&amp;rsquo;);&#10;text(-30,1,&amp;lsquo;a)&amp;rsquo;); hold off;&lt;/p&gt;&#10;&lt;p&gt;% Plot spectral magnitude&#10;magX = abs(X);&#10;nfft = zpf*N;&#10;fni = [0:1.0/nfft:1-1.0/nfft]; % Normalized frequency axis&#10;subplot(3,1,2);&#10;plot(fni,magX,&amp;rsquo;-&amp;rsquo;); grid; % With interpolation, we can use solid lines &amp;lsquo;-&amp;rsquo;&#10;% title(&amp;lsquo;Interpolated Spectral Magnitude&amp;rsquo;);&#10;xlabel(&amp;lsquo;Normalized Frequency (cycles per sample))&amp;rsquo;);&#10;ylabel(&amp;lsquo;Magnitude (Linear)&amp;rsquo;);&#10;text(-.11,40,&amp;lsquo;b)&amp;rsquo;);&lt;/p&gt;&#10;&lt;p&gt;% Same thing on a &lt;a href="https://technick.net/guides/theory/dft/decibels"&gt;dB scale&lt;/a&gt;&#10;spec = 20&lt;em&gt;log10(magX); % Spectral magnitude in dB&#10;spec = max(spec,-60&lt;/em&gt;ones(1,length(spec))); % clip to -60 dB&#10;subplot(3,1,3);&#10;plot(fni,spec,&amp;rsquo;-&amp;rsquo;); grid; axis([0 1 -60 50]);&#10;% title(&amp;lsquo;Interpolated Spectral Magnitude (dB)&amp;rsquo;);&#10;xlabel(&amp;lsquo;Normalized Frequency (cycles per sample))&amp;rsquo;);&#10;ylabel(&amp;lsquo;Magnitude (dB)&amp;rsquo;);&#10;text(-.11,50,&amp;lsquo;c)&amp;rsquo;);&#10;print -deps eps/example3.eps;&#10;if dopause, disp &amp;lsquo;pausing for RETURN (check the plot). . .&amp;rsquo;; pause; end&lt;/pre&gt;&lt;/p&gt;&lt;p&gt; &lt;div align="CENTER"&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:example3"&gt;&lt;/a&gt;&lt;a name="17160"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure 9.4:&lt;/strong&gt;Zero-Padded Sinusoid at&#10;Frequency &lt;img width="124" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img42.png" alt="$f=0.25+0.5/N$" /&gt;. a) Time waveform. b) Magnitude&#10;spectrum. c) DB magnitude spectrum.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10;$\scalebox{0.8}{\includegraphics{eps/example3.eps}}$&#10;--&gt;&lt;img width="643" height="503" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1387.png" alt="\" calebox="" ncludegraphics="" ps="" xample3="" ps="" /&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;With the zero padding, we see&#10;there&amp;rsquo;s quite a bit going on. In fact, the spectrum has a regular&lt;i&gt;sidelobe&lt;/i&gt; structure. On the dB scale in Fig. &lt;a href="https://technick.net/guides/theory/dft/example_3_fft#fig:example3"&gt;9.4&lt;/a&gt;c, we now&#10;see that there are indeed negative dB values. This shows the&#10;importance of using zero padding to interpolate spectral displays so&#10;that the eye can &amp;lsquo;&amp;lsquo;fill in&amp;rsquo;&amp;rsquo; properly between the samples.&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/example_2_fft"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;  &lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;  &lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;  &lt;a href="https://technick.net/guides/theory/dft/example_4_blackman"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Example 4: Blackman Window</title><link>https://technick.net/guides/theory/dft/example_4_blackman/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/example_4_blackman/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/example_3_fft"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/example_5_use"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION001014000000000000000"&gt;Example 4: Blackman Window&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;Finally, to finish off this &lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;sinusoid&lt;/a&gt;, let's look at the effect of using a&lt;i&gt;Blackman window&lt;/i&gt; (which has nice but suboptimal parameters for audio&#10;work). Figure&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/example_4_blackman#fig:blackman"&gt;9.5&lt;/a&gt;a shows the Blackman window, Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/example_4_blackman#fig:blackman"&gt;9.5&lt;/a&gt;b shows&#10;its magnitude spectrum on a &lt;a href="https://technick.net/guides/theory/dft/decibels"&gt;dB scale&lt;/a&gt;, and Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/example_4_blackman#fig:blackman"&gt;9.5&lt;/a&gt;c introduces the&#10;use of a more natural frequency axis which interprets the upper half of the&#10;bin numbers as &lt;a href="https://technick.net/guides/theory/dft/positive_negative_frequenci"&gt;negative frequencies&lt;/a&gt;. Here is the &lt;a href="http://www.mathworks.com/access/helpdesk/help/techdoc/basics/getstarted.shtml"&gt;Matlab&lt;/a&gt; for it:&lt;pre&gt;&#10;% Add a "Blackman window"&#10;% w = blackman(N); % if you have the signal processing toolbox&#10;w = .42-.5*cos(2*pi*(0:N-1)/(N-1))+.08*cos(4*pi*(0:N-1)/(N-1));&#10;figure(5);&#10;subplot(3,1,1); plot(w,'*'); title('The Blackman Window');&#10;xlabel('Time (samples)'); ylabel('&lt;a href="https://technick.net/guides/theory/dft/logarithms"&gt;Amplitude&lt;/a&gt;');&#10;text(-8,1,'a)'); &#10;&lt;p&gt;% Also show the window transform:&#10;xw = [w,zeros(1,(zpf-1)&lt;em&gt;N)]; % zero-padded window (col vector)&#10;Xw = fft(xw); % Blackman window transform&#10;spec = 20&lt;/em&gt;log10(abs(Xw)); % Spectral magnitude in &lt;a href="https://technick.net/guides/theory/dft/decibels"&gt;dB&lt;/a&gt;&#10;spec = spec - max(spec); % Usually we normalize to 0 db max&#10;spec = max(spec,-100*ones(1,nfft)); % clip to -100 dB&#10;subplot(3,1,2); plot(fni,spec,&amp;rsquo;-&amp;rsquo;); axis([0,1,-100,10]); grid;&#10;xlabel(&amp;lsquo;Normalized Frequency (cycles per sample))&amp;rsquo;);&#10;ylabel(&amp;lsquo;Magnitude (dB)&amp;rsquo;);&#10;text(-.12,20,&amp;lsquo;b)&amp;rsquo;);&lt;/p&gt;&#10;&lt;p&gt;% Replot interpreting upper bin numbers as negative frequencies:&#10;nh = nfft/2;&#10;specnf = [spec(nh+1:nfft),spec(1:nh)]; % see also Matlab&amp;rsquo;s fftshift()&#10;fninf = fni - 0.5;&#10;subplot(3,1,3);&#10;plot(fninf,specnf,&amp;rsquo;-&amp;rsquo;); axis([-0.5,0.5,-100,10]); grid;&#10;xlabel(&amp;lsquo;Normalized Frequency (cycles per sample))&amp;rsquo;);&#10;ylabel(&amp;lsquo;Magnitude (dB)&amp;rsquo;);&#10;text(-.6,20,&amp;lsquo;c)&amp;rsquo;);&#10;print -deps eps/blackman.eps;&lt;/pre&gt;&lt;/p&gt;&lt;p&gt; &lt;div align="CENTER"&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:blackman"&gt;&lt;/a&gt;&lt;a name="17169"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure 9.5:&lt;/strong&gt;The Blackman Window. a) The&#10;window itself in the time domain. b) DB Magnitude spectrum. c) DB&#10;magnitude spectrum plotted over frequencies &lt;img width="75" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img43.png" alt="$[-0.5,0.5)$" /&gt;.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10;$\scalebox{0.8}{\includegraphics{eps/blackman.eps}}$&#10;--&gt;&lt;img width="645" height="503" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1388.png" alt="\" calebox="" ncludegraphics="" ps="" lackman="" ps="" /&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/example_3_fft"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;  &lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;  &lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;  &lt;a href="https://technick.net/guides/theory/dft/example_5_use"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Example 5: Use of the Blackman Window</title><link>https://technick.net/guides/theory/dft/example_5_use/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/example_5_use/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/example_4_blackman"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/example_6_hanning_windowed"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION001015000000000000000"&gt;Example 5: Use of the Blackman Window&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;Now let's apply this window to the sinusoidal data:&lt;pre&gt;&#10;% Use the Blackman window on the &lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;sinusoid&lt;/a&gt; data&#10;xw = [w .* cos(2*pi*n*f*T),zeros(1,(zpf-1)*N)]; % windowed, zero-padded data&#10;X = fft(xw); % Smoothed, interpolated spectrum&#10;&lt;p&gt;% Plot time data&#10;figure(6);&#10;subplot(2,1,1);&#10;plot(xw); &lt;br&gt;&#10;title(&amp;lsquo;Windowed, Zero-Padded, Sampled Sinusoid&amp;rsquo;);&#10;xlabel(&amp;lsquo;Time (samples)&amp;rsquo;); ylabel(&amp;rsquo;&lt;a href="https://technick.net/guides/theory/dft/logarithms"&gt;Amplitude&lt;/a&gt;&amp;rsquo;);&#10;text(-50,1,&amp;lsquo;a)&amp;rsquo;); hold off;&lt;/p&gt;&#10;&lt;p&gt;% Plot spectral magnitude in the best way&#10;spec = 10*log10(conj(X).&lt;em&gt;X); % Spectral magnitude in &lt;a href="https://technick.net/guides/theory/dft/decibels"&gt;dB&lt;/a&gt;&#10;spec = max(spec,-60&lt;/em&gt;ones(1,nfft)); % clip to -60 dB&#10;subplot(2,1,2);&#10;plot(fninf,fftshift(spec),&amp;rsquo;-&amp;rsquo;); axis([-0.5,0.5,-60,40]); grid;&#10;title(&amp;lsquo;Smoothed, Interpolated, Spectral Magnitude (dB)&amp;rsquo;);&#10;xlabel(&amp;lsquo;Normalized Frequency (cycles per sample))&amp;rsquo;);&#10;ylabel(&amp;lsquo;Magnitude (dB)&amp;rsquo;);&#10;text(-.6,40,&amp;lsquo;b)&amp;rsquo;);&#10;print -deps eps/xw.eps;&lt;/pre&gt;&lt;/p&gt;&lt;p&gt; &lt;div align="CENTER"&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:xw"&gt;&lt;/a&gt;&lt;a name="17178"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure 9.6:&lt;/strong&gt;Effect of the Blackman window on the&#10;sinusoidal data segment.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10;$\scalebox{0.8}{\includegraphics{eps/xw.eps}}$&#10;--&gt;&lt;img width="636" height="503" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1389.png" alt="\" calebox="" ncludegraphics="" ps="" w="" ps="" /&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/example_4_blackman"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;  &lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;  &lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;  &lt;a href="https://technick.net/guides/theory/dft/example_6_hanning_windowed"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Example 6: Hanning-Windowed Complex Sinusoid</title><link>https://technick.net/guides/theory/dft/example_6_hanning_windowed/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/example_6_hanning_windowed/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/example_5_use"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/spectral_phase"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION001016000000000000000"&gt;Example 6: Hanning-Windowed Complex Sinusoid&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;In this example, we'll perform &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;spectrum analysis&lt;/a&gt; on a complex &lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;sinusoid&lt;/a&gt;having only a single positive frequency. We'll use the Hanning window&#10;which does not have as much sidelobe suppression as the Blackman window,&#10;but its main lobe is narrower. Its sidelobes ''roll off'' very quickly&#10;versus frequency. Compare with the Blackman window results to see if you&#10;can see these differences.&lt;pre&gt;&#10;% Example 5: Practical spectrum analysis of a sinusoidal signal&#10;&lt;p&gt;% Analysis parameters:&#10;M = 31; % Window length (we&amp;rsquo;ll use a &amp;ldquo;Hanning window&amp;rdquo;)&#10;N = 64; % FFT length (zero padding around a factor of 2)&lt;/p&gt;&#10;&lt;p&gt;% Signal parameters:&#10;wxT = 2*pi/4; % Sinusoid frequency in rad/sample (1/4 &lt;a href="https://technick.net/guides/theory/dft/shannon_s_sampling_theorem"&gt;sampling rate&lt;/a&gt;)&#10;A = 1; % Sinusoid &lt;a href="https://technick.net/guides/theory/dft/logarithms"&gt;amplitude&lt;/a&gt;&#10;phix = 0; % Sinusoid phase&lt;/p&gt;&#10;&lt;p&gt;% Compute the signal x:&#10;n = [0:N-1]; % time indices for sinusoid and FFT&#10;x = A * exp(j&lt;em&gt;wxT&lt;/em&gt;n+phix); % the complex sinusoid itself: [1,j,-1,-j,1,j,&amp;hellip;]&lt;/p&gt;&#10;&lt;p&gt;% Compute Hanning window:&#10;nm = [0:M-1]; % time indices for window computation&#10;w = (1/M) * (cos((pi/M)*(nm-(M-1)/2))).^2; % Hanning window = &amp;ldquo;raised cosine&amp;rdquo;&lt;/p&gt;&#10;&lt;p&gt;wzp = [w,zeros(1,N-M)]; % zero-pad out to the length of x&#10;xw = x .* wzp; % apply the window w to the signal x&lt;/p&gt;&#10;&lt;p&gt;% Display real part of windowed signal and the Hanning window:&#10;plot(n,wzp,&amp;rsquo;-&amp;rsquo;); hold on;&#10;plot(n,real(xw),&amp;rsquo;&lt;em&gt;&amp;rsquo;);&#10;title(&amp;lsquo;Hanning Window and Windowed, Zero-Padded, Sinusoid (Real Part)&amp;rsquo;);&#10;xlabel(&amp;lsquo;Time (samples)&amp;rsquo;); ylabel(&amp;lsquo;Amplitude&amp;rsquo;); hold off;&#10;disp &amp;lsquo;pausing for RETURN (check the plot). . .&amp;rsquo;; pause&#10;print -deps eps/hanning.eps;&lt;/pre&gt;&lt;/p&gt;&lt;p&gt; &lt;div align="CENTER"&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:hanning"&gt;&lt;/a&gt;&lt;a name="17187"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure 9.7:&lt;/strong&gt;A length 31 Hanning Window&#10;(&amp;lsquo;&amp;lsquo;Raised Cosine&amp;rsquo;&amp;rsquo;) and the windowed sinusoid created using it.&#10;Zero-padding is also shown. The sampled sinusoid is plotted with `&lt;/em&gt;&amp;rsquo;&#10;using no connecting lines. You must now imagine the continuous&#10;sinusoid threading through the asterisks.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10;$\scalebox{0.8}{\includegraphics{eps/hanning.eps}}$&#10;--&gt;&lt;img width="638" height="517" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1390.png" alt="\" calebox="" ncludegraphics="" ps="" anning="" ps="" /&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;pre&gt;&#10;% Compute the spectrum and its various alternative forms&#10;%&#10;Xw = fft(xw); % FFT of windowed data&#10;fn = [0:1.0/N:1-1.0/N]; % Normalized frequency axis&#10;spec = 20&lt;em&gt;log10(abs(Xw)); % Spectral magnitude in &lt;a href="https://technick.net/guides/theory/dft/decibels"&gt;dB&lt;/a&gt;&#10;% Since the zeros go to minus infinity, clip at -100 dB:&#10;spec = max(spec,-100&lt;/em&gt;ones(1,length(spec)));&#10;phs = angle(Xw); % &lt;a href="https://technick.net/guides/theory/dft/spectral_phase"&gt;Spectral phase&lt;/a&gt; in radians&#10;phsu = unwrap(phs); % Unwrapped spectral phase (using &lt;a href="http://www.mathworks.com/access/helpdesk/help/techdoc/basics/getstarted.shtml"&gt;matlab&lt;/a&gt; function)&lt;/pre&gt;&lt;/p&gt;&lt;p&gt;To help see the full spectrum, we&amp;rsquo;ll also compute a heavily interpolated&#10;spectrum which we&amp;rsquo;ll draw using solid lines. (The previously computed&#10;spectrum will be plotted using &amp;lsquo;&lt;em&gt;&amp;rsquo;.) Ideal spectral interpolation is done&#10;using zero-padding in the time domain:&lt;/p&gt;&lt;p&gt;&lt;pre&gt;&#10;Nzp = 16; % Zero-padding factor&#10;Nfft = N&lt;/em&gt;Nzp; % Increased FFT size&#10;xwi = [xw,zeros(1,Nfft-N)]; % New zero-padded FFT buffer&#10;Xwi = fft(xwi); % Take the FFT&#10;fni = [0:1.0/Nfft:1.0-1.0/Nfft]; % Normalized frequency axis&#10;speci = 20&lt;em&gt;log10(abs(Xwi)); % Interpolated spectral magnitude in dB&#10;speci = max(speci,-100&lt;/em&gt;ones(1,length(speci))); % clip at -100 dB&#10;phsi = angle(Xwi); % Phase&#10;phsiu = unwrap(phsi); % Unwrapped phase&lt;/p&gt;&#10;&lt;p&gt;% Plot spectral magnitude&#10;%&#10;plot(fn,abs(Xw),&amp;rsquo;&lt;em&gt;&amp;rsquo;); hold on; plot(fni,abs(Xwi));&#10;title(&amp;lsquo;Spectral Magnitude&amp;rsquo;);&#10;xlabel(&amp;lsquo;Normalized Frequency (cycles per sample))&amp;rsquo;);&#10;ylabel(&amp;lsquo;Amplitude (Linear)&amp;rsquo;);&#10;disp &amp;lsquo;pausing for RETURN (check the plot). . .&amp;rsquo;; pause&#10;print -deps eps/specmag.eps; hold off;&lt;/pre&gt;&lt;/p&gt;&lt;p&gt; &lt;div align="CENTER"&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:specmag"&gt;&lt;/a&gt;&lt;a name="17196"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure 9.8:&lt;/strong&gt;Spectral Magnitude, linear scale.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10;$\scalebox{0.8}{\includegraphics{eps/specmag.eps}}$&#10;--&gt;&lt;img width="624" height="517" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1391.png" alt="\" calebox="" ncludegraphics="" ps="" pecmag="" ps="" /&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;&lt;p&gt;&lt;pre&gt;&#10;% Same thing on a &lt;a href="https://technick.net/guides/theory/dft/decibels"&gt;dB scale&lt;/a&gt;&#10;plot(fn,spec,&amp;rsquo;&lt;/em&gt;&amp;rsquo;); hold on; plot(fni,speci);&#10;title(&amp;lsquo;Spectral Magnitude (dB)&amp;rsquo;);&#10;xlabel(&amp;lsquo;Normalized Frequency (cycles per sample))&amp;rsquo;);&#10;ylabel(&amp;lsquo;Magnitude (dB)&amp;rsquo;);&#10;disp &amp;lsquo;pausing for RETURN (check the plot). . .&amp;rsquo;; pause&#10;print -deps eps/specmagdb.eps; hold off;&lt;/pre&gt;&lt;/p&gt;&lt;p&gt; &lt;div align="CENTER"&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:specmagdb"&gt;&lt;/a&gt;&lt;a name="17205"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure 9.9:&lt;/strong&gt;Spectral Magnitude, dB scale.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10;$\scalebox{0.8}{\includegraphics{eps/specmagdb.eps}}$&#10;--&gt;&lt;img width="625" height="517" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1392.png" alt="\" calebox="" ncludegraphics="" ps="" pecmagdb="" ps="" /&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;&lt;p&gt;Note that there are no &lt;a href="https://technick.net/guides/theory/dft/positive_negative_frequenci"&gt;negative frequency&lt;/a&gt; components in Fig. &lt;a href="https://technick.net/guides/theory/dft/example_6_hanning_windowed#fig:specmag"&gt;9.8&lt;/a&gt;because we are analyzing a complex sinusoid &lt;!-- MATH&#10;$[1,j,-1,-j,1,j,\ldots]$&#10;--&gt;&lt;img width="142" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1393.png" alt="$[1,j,-1,-j,1,j,\" dots="" /&gt;which is a sampled complex sinusoid frequency &lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1372.png" alt="$f_s/4$" /&gt; only.&lt;/p&gt;&lt;p&gt;Notice how difficult it would be to correctly interpret the shape of the&#10;&amp;lsquo;&amp;lsquo;sidelobes&amp;rsquo;&amp;rsquo; without zero padding. The asterisks correspond to a&#10;zero-padding factor of 2, already twice as much as needed to preserve all&#10;spectral information faithfully, but it is clearly not sufficient to make&#10;the sidelobes clear in a spectral magnitude plot.&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;hr /&gt;&lt;!--Table of Child-Links--&gt;&lt;a name="CHILD_LINKS"&gt;&lt;strong&gt;Subsections&lt;/strong&gt;&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html2751" href="https://technick.net/guides/theory/dft/spectral_phase"&gt;Spectral Phase&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;!--End of Table of Child-Links--&gt;&lt;/p&gt;&#10;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/example_5_use"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/spectral_phase"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Spectral Phase</title><link>https://technick.net/guides/theory/dft/spectral_phase/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/spectral_phase/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/example_6_hanning_windowed"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/basic_tutorial_sampling"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;&lt;a name="SECTION001016100000000000000"&gt;Spectral Phase&lt;/a&gt;&lt;/h3&gt;&lt;p&gt;As for the phase of the spectrum, what do we expect? We have chosen the&lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;sinusoid&lt;/a&gt; phase to be zero. The window is symmetric about its middle.&#10;Therefore, we expect a &lt;a href="https://technick.net/guides/theory/dft/linear_phase_terms"&gt;linear phase term&lt;/a&gt; with slope -(M-1)/2 samples.&#10;Also, the window transform has sidelobes which cause a phase of pi radians&#10;to switch in and out. Thus, we expect to see samples of a straight line&#10;with slope -15 across the main lobe of the window transform, together with&#10;a switching offset by pi in every other sidelobe away from the main lobe,&#10;starting with the immediately adjacent sidelobes.&lt;/p&gt;&lt;p&gt;In the plot, you can see the negatively sloped line across the main lobe of&#10;the window transform, but the sidelobes are hard to follow.&lt;pre&gt;&#10;plot(fn,phs,'*'); hold on; plot(fni,phsi); grid;&#10;title('&lt;a href="https://technick.net/guides/theory/dft/spectral_phase"&gt;Spectral Phase&lt;/a&gt;'); &#10;xlabel('Normalized Frequency (cycles per sample))'); &#10;ylabel('Phase - Phi (Radians)');&#10;disp 'pausing for RETURN (check the plot). . .'; pause&#10;print -deps eps/specphase.eps; hold off;&lt;/pre&gt;&lt;/p&gt;&lt;p&gt; &lt;div align="CENTER"&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:specphase"&gt;&lt;/a&gt;&lt;a name="17214"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure 9.10:&lt;/strong&gt;Spectral phase.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; $\scalebox{0.8}{\includegraphics{eps/specphase.eps}}$&#10; --&gt;&lt;img width="605" height="517" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1394.png" alt="\" calebox="" ncludegraphics="" ps="" pecphase="" ps="" /&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;&lt;p&gt;To convert the expected phase slope from &lt;img width="32" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1395.png" alt="$-15$" /&gt; ''radians per&#10;radian-frequency'' to ''radians per cycle-per-sample,'' we need to&#10;multiply by ''radians per cycle,'' or &lt;img width="22" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img40.png" alt="$2\" i="i" /&gt;. Thus, in&#10;Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/spectral_phase#fig:specphase"&gt;9.10&lt;/a&gt;, we expect a slope of &lt;img width="45" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1396.png" alt="$-94.2$" /&gt; radians per unit&#10;normalized frequency, or &lt;img width="45" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1397.png" alt="$-9.42$" /&gt; radians per &lt;img width="24" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1398.png" alt="$0.1$" /&gt; cycles-per-sample,&#10;and this looks about right, judging from the plot.&#10;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/example_6_hanning_windowed"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/basic_tutorial_sampling"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>A Basic Tutorial on Sampling Theory</title><link>https://technick.net/guides/theory/dft/basic_tutorial_sampling/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/basic_tutorial_sampling/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/spectral_phase"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/introduction"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION001100000000000000000"&gt;A Basic Tutorial on Sampling Theory&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;&lt;a href="https://technick.net/guides/theory/dft/basic_tutorial_sampling"&gt;A basic tutorial on sampling theory&lt;/a&gt; is presented. &lt;a href="https://technick.net/guides/theory/dft/aliasing_sampled_continuous"&gt;Aliasing due to&#10;sampling&lt;/a&gt; of continuous-time signals is characterized mathematically.&lt;a href="https://technick.net/guides/theory/dft/shannon_s_sampling_theorem"&gt;Shannon's sampling theorem&lt;/a&gt; is proved. A pictorial representation of&#10;continuous-time signal reconstruction from discrete-time samples is&#10;given.&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;hr /&gt;&lt;!--Table of Child-Links--&gt;&lt;a name="CHILD_LINKS"&gt;&lt;strong&gt;Subsections&lt;/strong&gt;&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html2774" href="https://technick.net/guides/theory/dft/introduction"&gt;Introduction&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html2775" href="https://technick.net/guides/theory/dft/reconstruction_samples_pict"&gt;Reconstruction from Samples--Pictorial Version&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2776" href="https://technick.net/guides/theory/dft/reconstruction_samples_the"&gt;Reconstruction from Samples--The Math&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2777" href="https://technick.net/guides/theory/dft/aliasing_sampled_continuous"&gt;Aliasing of Sampled Continuous-Time Signals&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2778" href="https://technick.net/guides/theory/dft/shannon_s_sampling_theorem"&gt;Shannon's Sampling Theorem&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2779" href="https://technick.net/guides/theory/dft/figuring_out_sampling"&gt;Figuring Out Sampling Theory by Playing Around with Complex Sinusoids&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html2780" href="https://technick.net/guides/theory/dft/what_frequencies_are"&gt;What frequencies are representable by a geometric sequence?&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2781" href="https://technick.net/guides/theory/dft/recovering_continuous_time_"&gt;Recovering a Continuous-Time Signal from its Samples&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html2782" href="https://technick.net/guides/theory/dft/method_1_additive"&gt;Method 1: Additive Synthesis&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2783" href="https://technick.net/guides/theory/dft/does_it_work"&gt;Does it Work?&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;/ul&gt;&lt;!--End of Table of Child-Links--&gt;&#10;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/spectral_phase"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/introduction"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Introduction</title><link>https://technick.net/guides/theory/dft/introduction/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/introduction/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/basic_tutorial_sampling"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/reconstruction_samples_pict"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION001110000000000000000"&gt;Introduction&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;Inside computers and modern ''digital'' synthesizers, (as well as music&#10;CDs), sound is &lt;i&gt;sampled&lt;/i&gt; into a stream of &lt;i&gt;numbers&lt;/i&gt;. Each &lt;em&gt;sample&lt;/em&gt; can be thought of as a number which specifies the &lt;i&gt;position&lt;/i&gt; of&#10;a loudspeaker at a particular instant. When sound is sampled, we call it&lt;i&gt;digital audio&lt;/i&gt;. The &lt;a href="https://technick.net/guides/theory/dft/shannon_s_sampling_theorem"&gt;sampling rate&lt;/a&gt; used for CDs is 44,100 samples per&#10;second. That means when you play a CD, the speakers in your stereo&#10;system are moved to a new position 44,100 times per second, or once&#10;every 23 microseconds. Controlling a speaker this fast enables it to&#10;generate any sound in the human hearing range because we cannot hear&#10;frequencies higher than around 20,000 cycles per second, and a&#10;sampling rate more than twice the highest frequency in the sound&#10;guarantees that exact reconstruction is possible from the samples.&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;hr /&gt;&lt;!--Table of Child-Links--&gt;&lt;a name="CHILD_LINKS"&gt;&lt;strong&gt;Subsections&lt;/strong&gt;&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html2796" href="https://technick.net/guides/theory/dft/reconstruction_samples_pict"&gt;Reconstruction from Samples--Pictorial Version&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2797" href="https://technick.net/guides/theory/dft/reconstruction_samples_the"&gt;Reconstruction from Samples--The Math&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;!--End of Table of Child-Links--&gt;&#10;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/basic_tutorial_sampling"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/reconstruction_samples_pict"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Reconstruction from Samples--Pictorial Version</title><link>https://technick.net/guides/theory/dft/reconstruction_samples_pict/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/reconstruction_samples_pict/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/introduction"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/reconstruction_samples_the"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION001111000000000000000"&gt;Reconstruction from Samples--Pictorial Version&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;Figure&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/reconstruction_samples_pict#fig:SincSum"&gt;A.1&lt;/a&gt; shows how a sound is reconstructed from its&#10;samples. Each sample can be considered as specifying the&lt;i&gt;scaling&lt;/i&gt; and &lt;i&gt;location&lt;/i&gt; of a &lt;i&gt;sinc function&lt;/i&gt;. The&#10;discrete-time signal being interpolated in the figure is&#10;&lt;!-- MATH&#10; $[0,0,0,0,0,1,1,1,1,1,0,0,0,0,0]$&#10; --&gt;&lt;img width="231" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1399.png" alt="$[0,0,0,0,0,1,1,1,1,1,0,0,0,0,0]$" /&gt;. The sinc functions are drawn with&#10;dashed lines, and they sum to produce the solid curve. Note the&#10;''Gibb's overshoot'' near the corners of this continuous rectangular&#10;pulse due to band-limiting.&lt;/p&gt;&lt;p&gt; &lt;div align="CENTER"&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:SincSum"&gt;&lt;/a&gt;&lt;a name="17685"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure A.1:&lt;/strong&gt;How sinc functions sum up to create&#10;a continuous waveform from discrete-time samples.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; $\resizebox{5in}{!}{\includegraphics{eps/SincSum.eps}}$&#10; --&gt;&lt;img width="453" height="174" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1400.png" alt="\" esizebox="" n="" ncludegraphics="" ps="" incsum="" ps="" /&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;&lt;p&gt;Note how each sinc function passes through zero at every sample&#10;instant but the one it is centered on, where it passes through 1. An&#10;isolated sinc function is shown in Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/reconstruction_samples_pict#fig:Sinc"&gt;A.2&lt;/a&gt;.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:Sinc"&gt;&lt;/a&gt;&lt;a name="17694"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure A.2:&lt;/strong&gt;The sinc function.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; $\includegraphics{eps/Sinc.eps}$&#10; --&gt;&lt;img width="495" height="278" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1401.png" alt="\" ncludegraphics="" ps="" inc="" ps="" /&gt; &lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;The sinc function is the famous ''sine x over x'' curve, defined by&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\mbox{sinc}(F_st) \isdef {\sin(\pi F_st)\over \pi F_st}.&#10;\end{displaymath}&#10; --&gt;&lt;img width="171" height="47" border="0" src="https://technick.net/img/guide_dft/img1402.png" alt="\" egin="" isplaymath="" box="" inc="" st="" sdef="" in="" i="" t="" ver="" i="" t="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where &lt;img width="21" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1403.png" alt="$F_s$" /&gt; denotes the &lt;a href="https://technick.net/guides/theory/dft/shannon_s_sampling_theorem"&gt;sampling rate&lt;/a&gt; in samples-per-second, and &lt;img width="10" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img484.png" alt="$t$" /&gt;denotes time in seconds.&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/introduction"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/reconstruction_samples_the"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Reconstruction from Samples--The Math</title><link>https://technick.net/guides/theory/dft/reconstruction_samples_the/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/reconstruction_samples_the/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/reconstruction_samples_pict"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/aliasing_sampled_continuous"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION001112000000000000000"&gt;Reconstruction from Samples--The Math&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;Let &lt;!-- MATH&#10; $x_d(n) \isdef x(nT_s)$&#10; --&gt;&lt;img width="111" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1404.png" alt="$x_d(n) \" sdef="" t="" s="" /&gt; denote the &lt;img width="14" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img51.png" alt="$n$" /&gt;th sample of the original&#10;sound &lt;img width="31" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img357.png" alt="$x(t)$" /&gt;, where &lt;img width="10" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img484.png" alt="$t$" /&gt; is time in seconds. Thus, &lt;img width="14" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img51.png" alt="$n$" /&gt; ranges over the&#10;integers, and &lt;img width="20" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1405.png" alt="$T_s$" /&gt; is the &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/shannon_s_sampling_theorem"&gt;sampling period&lt;/a&gt;&lt;/i&gt; in seconds. The&lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/shannon_s_sampling_theorem"&gt;sampling rate&lt;/a&gt;&lt;/i&gt; in Hertz (Hz) is just the reciprocal of the&#10;sampling period,&lt;i&gt;i.e.&lt;/i&gt;, &lt;br /&gt;&lt;/p&gt;</description></item><item><title>Aliasing of Sampled Continuous-Time Signals</title><link>https://technick.net/guides/theory/dft/aliasing_sampled_continuous/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/aliasing_sampled_continuous/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/reconstruction_samples_the"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/shannon_s_sampling_theorem"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION001120000000000000000"&gt;&lt;/a&gt;&lt;a name="sec:aliasing"&gt;&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/theory/dft/decimation_theorem_aliasing"&gt;Aliasing&lt;/a&gt; of Sampled Continuous-Time Signals&lt;/h1&gt;&lt;p&gt;This section quantifies aliasing in the general case. This result is&#10;then used in the proof of &lt;a href="https://technick.net/guides/theory/dft/shannon_s_sampling_theorem"&gt;Shannon's Sampling Theorem&lt;/a&gt; in the next&#10;section.&lt;/p&gt;&lt;p&gt;It is well known that when a continuous-time signal contains energy at&#10;a frequency higher than half the &lt;a href="https://technick.net/guides/theory/dft/shannon_s_sampling_theorem"&gt;sampling rate&lt;/a&gt; &lt;img width="37" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1407.png" alt="$F_s/2$" /&gt;, then sampling&#10;at &lt;img width="21" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1403.png" alt="$F_s$" /&gt; samples per second causes that energy to &lt;i&gt;alias&lt;/i&gt; to a&#10;lower frequency. If we write the original frequency as &lt;!-- MATH&#10; $f = F_s/2 +&#10;\epsilon$&#10; --&gt;&lt;img width="94" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1414.png" alt="$f = F_s/2 +&#10;\" psilon="" /&gt;, then the new aliased frequency is &lt;!-- MATH&#10; $f_a = F_s/2 - \epsilon$&#10; --&gt;&lt;img width="100" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1415.png" alt="$f_a = F_s/2 - \" psilon="" /&gt;,&#10;for &lt;!-- MATH&#10; $\epsilon\leq F_s/2$&#10; --&gt;&lt;img width="65" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1416.png" alt="$\" psilon\leq="" s="" /&gt;. This phenomenon is also called ''folding'',&#10;since &lt;img width="20" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1417.png" alt="$f_a$" /&gt; is a ''mirror image'' of &lt;img width="14" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1418.png" alt="$f$" /&gt; about &lt;img width="37" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1407.png" alt="$F_s/2$" /&gt;. As we will&#10;see, however, this is not a fundamental description of aliasing, as it&#10;only applies to real signals. For general (complex) signals, it is&#10;better to regard the &lt;a href="https://technick.net/guides/theory/dft/aliasing_sampled_continuous"&gt;aliasing due to sampling&lt;/a&gt; as a summation over all&#10;spectral ''blocks'' of width &lt;img width="21" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1403.png" alt="$F_s$" /&gt;.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Theorem. &lt;a name="thm:aliasing"&gt;&lt;/a&gt;&lt;/b&gt; &#10;(Continuous-Time &lt;a href="https://technick.net/guides/theory/dft/decimation_theorem_aliasing"&gt;Aliasing Theorem&lt;/a&gt;)&#10;Let &lt;img width="31" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img357.png" alt="$x(t)$" /&gt; denote any continuous-time signal having a &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;Fourier&#10;Transform&lt;/a&gt; (&lt;a href="https://technick.net/guides/theory/dft/dft"&gt;FT&lt;/a&gt;)&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;X(j\omega)\isdef \int_{-\infty}^\infty x(t) e^{-j\omega t} dt&#10;\end{displaymath}&#10; --&gt;&lt;img width="198" height="50" border="0" src="https://technick.net/img/guide_dft/img1419.png" alt="\" egin="" isplaymath="" j\omega="" sdef="" nt="" nfty="" nfty="" e="" omega="" t="dt" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Let &lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;x_d(n) \isdef x(nT_s), \quad n=\ldots,-2,-1,0,1,2,\ldots,&#10;\end{displaymath}&#10; --&gt;&lt;img width="346" height="31" border="0" src="https://technick.net/img/guide_dft/img1420.png" alt="\" egin="" isplaymath="" d="" isdef="" t="" s="" uad="" dots="" dots="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;denote the samples of &lt;img width="31" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img357.png" alt="$x(t)$" /&gt; at uniform intervals of &lt;img width="20" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1405.png" alt="$T_s$" /&gt; seconds,&#10;and denote its Discrete-Time Fourier Transform (DTFT) by &lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;X_d(e^{j\theta})\isdef \sum_{n=-\infty}^\infty x_d(n) e^{-j\theta n}&#10;\end{displaymath}&#10; --&gt;&lt;img width="214" height="60" border="0" src="https://technick.net/img/guide_dft/img1421.png" alt="\" egin="" isplaymath="" d="" j\theta="" sdef="" um="" infty="" infty="" d="" e="" theta="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Then the spectrum &lt;img width="25" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1422.png" alt="$X_d$" /&gt; of the sampled signal &lt;img width="21" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1423.png" alt="$x_d$" /&gt; is related to the&#10;spectrum &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img33.png" alt="$X$" /&gt; of the original continuous-time signal &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; by&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;X_d(e^{j\theta}) = \frac{1}{T_s} \sum_{m=-\infty}^\infty X\left[j\left(\frac{\theta}{T_s} &#10;&#9;+ m\frac{2\pi}{T_s}\right)\right]&#10;\end{displaymath}&#10; --&gt;&lt;img width="312" height="60" border="0" src="https://technick.net/img/guide_dft/img1424.png" alt="\" egin="" isplaymath="" d="" j\theta="" rac="" s="s" sum="" infty="" infty="" left="" left="" rac="" heta="" s="s" m\frac="" i="" s="s" right="" ight="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;The terms in the above sum for &lt;img width="47" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1425.png" alt="$m\" eq="" /&gt; are called &lt;i&gt;aliasing&#10;terms&lt;/i&gt;. They are said to &lt;i&gt;alias&lt;/i&gt; into the &lt;i&gt;base band&lt;/i&gt;&lt;!-- MATH&#10; $[-\pi/T_s,\pi/T_s]$&#10; --&gt;&lt;img width="100" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1426.png" alt="$[-\" i="i" t="" s="" i="" s="s" /&gt;. Note that the summation of a spectrum with&#10;aliasing components involves addition of &lt;a href="https://technick.net/guides/theory/dft/introduction_complex_number"&gt;complex numbers&lt;/a&gt;; therefore,&#10;aliasing components can be removed only if both their &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/logarithms"&gt;amplitude&lt;/a&gt;and phase&lt;/i&gt; are known.&lt;p&gt;&lt;b&gt;Proof. &lt;/b&gt;Writing &lt;img width="31" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img357.png" alt="$x(t)$" /&gt; as an inverse FT gives&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;x(t) = \frac{1}{2\pi}\int_{-\infty}^\infty X(j\omega) e^{j\omega t} d\omega&#10;\end{displaymath}&#10; --&gt;&lt;img width="218" height="50" border="0" src="https://technick.net/img/guide_dft/img1427.png" alt="\" egin="" isplaymath="" t="" rac="" i="" nt="" nfty="" nfty="" omega="" j\omega="" omega="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Writing &lt;img width="43" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1428.png" alt="$x_d(n)$" /&gt; as an inverse DTFT gives&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;x_d(n) = \frac{1}{2\pi}\int_{-\pi}^\pi X_d(e^{j\theta}) x(t) e^{j \theta t} d\theta&#10;\end{displaymath}&#10; --&gt;&lt;img width="260" height="50" border="0" src="https://technick.net/img/guide_dft/img1429.png" alt="\" egin="" isplaymath="" d="" frac="" i="" nt="" i="" i="" e="" theta="" t="" j="" heta="" theta="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where &lt;!-- MATH&#10; $\theta \isdef 2\pi \omega_d T_s$&#10; --&gt;&lt;img width="84" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1430.png" alt="$\" heta="" sdef="" i="" mega="" s="s" /&gt; denotes the normalized discrete-time&#10;frequency variable.&lt;p&gt;The inverse FT can be broken up into a sum of finite integrals, each of length&#10;&lt;!-- MATH&#10; $\Omega_s \isdef 2\pi F_s= 2\pi/T_s$&#10; --&gt;&lt;img width="141" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1431.png" alt="$\" mega="" s="" sdef="" i="" pi="" t="" s="" /&gt;, as follows:&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;x(t) &amp;=&amp; \frac{1}{2\pi}\int_{-\infty}^\infty X(j\omega) e^{j\omega t} d\omega \\&#10; &amp;=&amp; \frac{1}{2\pi}\sum_{m=-\infty}^\infty \int_{(2m-1)\pi/T_s)}^{(2m+1)\pi/T_s} &#10;&#9;X(j\omega) e^{j\omega t} d\omega \\&#10; &amp;\stackrel{=}{\tiny\omega\leftarrow m\Omega_s }&amp;&#10;&#9;\frac{1}{2\pi}\sum_{m=-\infty}^\infty \int_{-\Omega_s /2}^{\Omega_s /2}&#10;&#9;X\left(j\omega + j m\Omega_s \right) e^{j\omega t} e^{j \Omega_s m t} d\omega \\&#10; &amp;=&amp; \frac{1}{2\pi}\int_{-\Omega_s /2}^{\Omega_s /2} e^{j\omega t} &#10;&#9;\sum_{m=-\infty}^\infty X\left(j\omega + j m\Omega_s \right) e^{j\Omega_s m t} d\omega&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="497" height="228" border="0" src="https://technick.net/img/guide_dft/img1432.png" alt="\" egin="" qnarray="" t="" rac="" i="" nt="" nfty="" nfty="" omega="" j\o="" left="" omega="" omega="" s="" ight="" j\omega="" s="" d\omega="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Let us now sample this representation for &lt;img width="31" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img357.png" alt="$x(t)$" /&gt; at &lt;img width="57" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1433.png" alt="$t=nT_s$" /&gt; to obtain&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;x_d(n) \isdef x(nT_s) &amp;=&amp; \frac{1}{2\pi}\int_{-\Omega_s /2}^{\Omega_s /2} e^{j\omega nT_s} &#10;&#9; \sum_{m=-\infty}^\infty X\left(j\omega + j m\Omega_s \right) e^{j\Omega_s m nT_s} d\omega \\&#10;&#9;&amp;=&amp; \frac{1}{2\pi}\int_{-\Omega_s /2}^{\Omega_s /2} e^{j\omega nT_s} &#10;&#9;&#9;\sum_{m=-\infty}^\infty X\left(j\omega + j m\Omega_s \right) &#10;&#9;&#9;e^{j(2\pi/T_s) m nT_s} d\omega \\&#10;&#9;&amp;=&amp; \frac{1}{2\pi}\int_{-\Omega_s /2}^{\Omega_s /2} e^{j\omega nT_s} &#10;&#9;&#9;\sum_{m=-\infty}^\infty X\left(j\omega + j m\Omega_s \right) d\omega&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="594" height="179" border="0" src="https://technick.net/img/guide_dft/img1434.png" alt="\" egin="" qnarray="" d="" isdef="" t="" s="" rac="" i="" nt="" mega="" s="" infty="" infty="" left="" omega="" omega="" s="" ight="" omega="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;since &lt;img width="14" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img51.png" alt="$n$" /&gt; and &lt;img width="18" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img937.png" alt="$m$" /&gt; are integers. &#10;Normalizing frequency as &lt;!-- MATH&#10; $\theta^\prime = \omega T_s$&#10; --&gt;&lt;img width="64" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1435.png" alt="$\" heta="" rime="\omega" t="" s="" /&gt; yields&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;x_d(n) = \frac{1}{2\pi}\int_{-\pi}{\pi} e^{j\theta^\prime n} &#10;&#9;&#9;{1\over T_s}\sum_{m=-\infty}^\infty X\left[j\left(\frac{\theta^\prime }{T_s} &#10;&#9;+ m\frac{2\pi}{T_s}\right) \right] d\theta^\prime .&#10;\end{displaymath}&#10; --&gt;&lt;img width="435" height="60" border="0" src="https://technick.net/img/guide_dft/img1436.png" alt="\" egin="" isplaymath="" d="" frac="" i="" nt="" i="" i="" j\theta="" rime="" t="" s="" frac="" i="" s="s" right="" ight="" theta="" rime="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Since this is formally the inverse DTFT of &lt;!-- MATH&#10; $X_d(e^{j\theta^\prime })$&#10; --&gt;&lt;img width="62" height="37" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1437.png" alt="$X_d(e^{j\" heta="" rime="" /&gt; written in terms of &lt;!-- MATH&#10; $X(j\theta^\prime /T_s)$&#10; --&gt;&lt;img width="75" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1438.png" alt="$X(j\" heta="" rime="" s="s" /&gt;,&#10;the result follows.&lt;img width="16" height="12" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1439.png" alt="$\" ox="" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/reconstruction_samples_the"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/shannon_s_sampling_theorem"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Shannon's Sampling Theorem</title><link>https://technick.net/guides/theory/dft/shannon_s_sampling_theorem/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/shannon_s_sampling_theorem/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/aliasing_sampled_continuous"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/figuring_out_sampling"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION001130000000000000000"&gt;&lt;/a&gt;&lt;a name="sec:shannon"&gt;&lt;/a&gt;&lt;br /&gt;&lt;a href="https://technick.net/guides/theory/dft/shannon_s_sampling_theorem"&gt;Shannon's Sampling Theorem&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;&lt;b&gt;Theorem. &lt;a name="thm:shannon"&gt;&lt;/a&gt;&lt;/b&gt; &#10;Let &lt;img width="31" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img357.png" alt="$x(t)$" /&gt; denote any continuous-time signal having a &lt;i&gt;continuous&lt;/i&gt; &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;Fourier transform&lt;/a&gt;&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;X(j\omega)\isdef \int_{-\infty}^\infty x(t) e^{-j\omega t} dt&#10;\end{displaymath}&#10; --&gt;&lt;img width="198" height="50" border="0" src="https://technick.net/img/guide_dft/img1419.png" alt="\" egin="" isplaymath="" j\omega="" sdef="" nt="" nfty="" nfty="" e="" omega="" t="dt" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Let &lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;x_d(n) \isdef x(nT_s), \quad n=\ldots,-2,-1,0,1,2,\ldots,&#10;\end{displaymath}&#10; --&gt;&lt;img width="346" height="31" border="0" src="https://technick.net/img/guide_dft/img1420.png" alt="\" egin="" isplaymath="" d="" isdef="" t="" s="" uad="" dots="" dots="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;denote the samples of &lt;img width="31" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img357.png" alt="$x(t)$" /&gt; at uniform intervals of &lt;img width="20" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1405.png" alt="$T_s$" /&gt; seconds. Then&lt;img width="31" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img357.png" alt="$x(t)$" /&gt; can be exactly reconstructed from its samples &lt;img width="43" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1428.png" alt="$x_d(n)$" /&gt; if and&#10;only if &lt;img width="78" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1440.png" alt="$X(j\" mega="" /&gt; for all &#10;&lt;!-- MATH&#10; $|\omega|\geq\pi/T_s$&#10; --&gt;&lt;img width="78" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1441.png" alt="$\" ert\omega\vert\geq\pi="" s="s" /&gt;.&lt;a name="tex2html119" href="https://technick.net/guides/theory/dft/footnode#foot17672"&gt;&lt;sup&gt;A.1&lt;/sup&gt;&lt;/a&gt;&lt;p&gt;&lt;b&gt;Proof. &lt;/b&gt;From the Continuous-Time &lt;a href="https://technick.net/guides/theory/dft/decimation_theorem_aliasing"&gt;Aliasing Theorem&lt;/a&gt; of &amp;sect;&lt;a href="https://technick.net/guides/theory/dft/aliasing_sampled_continuous#sec:aliasing"&gt;A.2&lt;/a&gt;, we have that the discrete-time spectrum&#10;&lt;!-- MATH&#10; $X_d(e^{j\theta})$&#10; --&gt;&lt;img width="58" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1443.png" alt="$X_d(e^{j\" heta="" /&gt; can be written in terms of the continuous-time spectrum&lt;img width="49" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1442.png" alt="$X(j\" mega="" /&gt; as&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;X_d(e^{j\omega_d T_s}) = \frac{1}{T_s} \sum_{m=-\infty}^\infty X[j(\omega_d +m\Omega_s )]&#10;\end{displaymath}&#10; --&gt;&lt;img width="305" height="60" border="0" src="https://technick.net/img/guide_dft/img1444.png" alt="\" egin="" isplaymath="" d="" j\omega="" s="s" frac="" s="s" sum="" infty="" infty="" j="" mega="" m\omega="" s="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where &lt;!-- MATH&#10; $\omega_d \isdef \theta/T_s$&#10; --&gt;&lt;img width="75" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1445.png" alt="$\" mega="" isdef="" heta="" s="s" /&gt; is the ''digital frequency'' variable.&#10;If &lt;img width="78" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1440.png" alt="$X(j\" mega="" /&gt; for all &lt;!-- MATH&#10; $|\omega|\geq\Omega_s /2$&#10; --&gt;&lt;img width="79" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1446.png" alt="$\" ert\omega\vert\geq\omega="" s="" /&gt;, then the above&#10;infinite sum reduces to one term, the &lt;img width="47" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1447.png" alt="$m=0$" /&gt; term, and we have&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;X_d(e^{j\omega_d T_s}) = \frac{1}{T_s} X(j\omega_d ), \quad \omega_d \in[-\pi/T_s,\pi/T_s]&#10;\end{displaymath}&#10; --&gt;&lt;img width="355" height="45" border="0" src="https://technick.net/img/guide_dft/img1448.png" alt="\" egin="" isplaymath="" d="" j\omega="" s="s" frac="" s="s" x="" omega="" quad="" mega="" in="" i="" s="s" pi="" s="s" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;At this point, we can see that the spectrum of the sampled signal&lt;img width="51" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1411.png" alt="$x(nT_s)$" /&gt; coincides with the spectrum of the continuous-time signal&lt;img width="31" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img357.png" alt="$x(t)$" /&gt;. In other words, the DTFT of &lt;img width="51" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1411.png" alt="$x(nT_s)$" /&gt; is equal to the &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;FT&lt;/a&gt; of&lt;img width="31" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img357.png" alt="$x(t)$" /&gt; between plus and minus half the &lt;a href="https://technick.net/guides/theory/dft/shannon_s_sampling_theorem"&gt;sampling rate&lt;/a&gt;, and the FT is&#10;zero outside that range. This makes it clear that spectral information&#10;is preserved, so it should now be possible to go from the samples back&#10;to the continuous waveform without error.&lt;p&gt;To reconstruct &lt;img width="31" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img357.png" alt="$x(t)$" /&gt; from its samples &lt;img width="51" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1411.png" alt="$x(nT_s)$" /&gt;, we may simply take&#10;the inverse Fourier transform of the zero-extended DTFT, i.e.,&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;x(t) &amp;=&amp; \mbox{{\tt IFT}}_t(X)&#10;\isdef \frac{1}{2\pi}\int_{-\infty}^{\infty} X(j\omega) e^{j\omega t} d\omega&#10;= \frac{1}{2\pi}\int_{-\Omega_s /2}^{\Omega_s /2} X(j\omega) e^{j\omega t} d\omega&#10;= \frac{1}{2\pi}\int_{-\Omega_s /2}^{\Omega_s /2} X_d(e^{j\theta}) e^{j\omega t} d\omega \\&#10;&amp;\isdef &amp; \mbox{{\tt IDTFT}}_t(X_d)&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="752" height="84" border="0" src="https://technick.net/img/guide_dft/img1449.png" alt="\" egin="" qnarray="" t="" box="" t="tt" ft="" x="" sdef="" rac="" i="" nt="" n="" j\omega="" omega="" sdef="" box="" t="tt" dtft="" x="" end="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;By expanding &lt;!-- MATH&#10; $X_d(e^{j\theta})$&#10; --&gt;&lt;img width="58" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1443.png" alt="$X_d(e^{j\" heta="" /&gt; as the DTFT of the samples &lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img50.png" alt="$x(n)$" /&gt;, the&#10;formula for reconstructing &lt;img width="31" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img357.png" alt="$x(t)$" /&gt; as a superposition of sinc functionsweighted by the samples, depicted in Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/reconstruction_samples_pict#fig:SincSum"&gt;A.1&lt;/a&gt;, is obtained:&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;x(t) &amp;=&amp; \mbox{{\tt IDTFT}}_t(X_d) \\&#10; &amp;\isdef &amp; \frac{1}{2\pi}\int_{-\pi}^{\pi} X_d(e^{j\theta}) e^{j\omega t} d\omega \\&#10; &amp;=&amp; \frac{T_s}{2\pi} \int_{-\pi/T_s}^{\pi/T_s} X_d(e^{j\omega_d T_s}) e^{j\omega_d t} d\omega_d \\&#10; &amp;\isdef &amp; \frac{T_s}{2\pi} \int_{-\pi/T_s}^{\pi/T_s} &#10;&#9;\left[ \sum_{n=-\infty}^{\infty}x(nT_s) e^{-j\omega_d nT_s} \right]&#10;&#9;e^{j\omega_d t} d\omega_d \\&#10; &amp;=&amp; \sum_{n=-\infty}^{\infty}x(nT_s) &#10;\underbrace{\frac{T_s}{2\pi} \int_{-\pi/T_s}^{\pi/T_s} e^{j\omega_d (t-nT_s)d\omega_d }}_{\isdef h(t-nT_s)} \\&#10; &amp;\isdef &amp; \sum_{n=-\infty}^{\infty}x(nT_s) h(t-nT_s) \\&#10; &amp;\isdef &amp; (x\ast h)(t)&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="415" height="377" border="0" src="https://technick.net/img/guide_dft/img1450.png" alt="\" egin="" qnarray="" t="" box="" t="tt" dtft="" x="" isdef="" rac="" p="" infty="" infty="" x="" nt="" s="" h="" nt="" s="" sdef="" ast="" end="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where we defined&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;h(t-nT_s) &amp;\isdef &amp; \frac{T_s}{2\pi} \int_{-\pi/T_s}^{\pi/T_s} e^{j\omega_d (t-nT_s)d\omega_d }\\&#10; &amp;=&amp; \frac{T_s}{2\pi} \frac{2}{2j(t-nT_s)}\left[e^{j\pi\frac{t-n}{Ts}/T_s} - e^{-j\pi\frac{t-nT_s}{T_s}}\right]\\&#10; &amp;=&amp; \frac{sin\left[\pi\left(\frac{t}{T_s}-n\right)\right]}{\pi\left(\frac{t}{T_s}-n\right)}\\&#10; &amp;\isdef &amp; \mbox{sinc}(t-nT_s)&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="430" height="207" border="0" src="https://technick.net/img/guide_dft/img1451.png" alt="\" egin="" qnarray="" t-nt="" s="" sdef="" rac="" s="s" pi="" nt="" i="" s="s" pi="" s="s" i\left="" rac="" t="" s="" right="" sdef="" box="" inc="" nt="" s="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;I.e.,&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;h(t) = \mbox{sinc}(t)\isdef \frac{\sin(\pi t)}{\pi t}&#10;\end{displaymath}&#10; --&gt;&lt;img width="181" height="44" border="0" src="https://technick.net/img/guide_dft/img1452.png" alt="\" egin="" isplaymath="" t="" box="" inc="" isdef="" rac="" in="" i="" i="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;The ''sinc function'' is defined with &lt;img width="14" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img39.png" alt="$\" i="i" /&gt; in its argument so that it has&#10;zero crossings on the integers, and its peak magnitude is 1. Figure&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/reconstruction_samples_pict#fig:Sinc"&gt;A.2&lt;/a&gt;illustrates the appearance of the sinc function.&lt;p&gt;We have shown that when &lt;img width="31" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img357.png" alt="$x(t)$" /&gt; is band-limited to less than half the&#10;sampling rate, the IFT of the zero-extended DTFT of its samples&lt;img width="51" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1411.png" alt="$x(nT_s)$" /&gt; gives back the original continuous-time signal &lt;img width="31" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img357.png" alt="$x(t)$" /&gt;.&lt;/p&gt;&lt;p&gt;Conversely, if &lt;img width="31" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img357.png" alt="$x(t)$" /&gt; can be reconstructed from its samples&#10;&lt;!-- MATH&#10; $x_d(n)\isdef x(nT_s)$&#10; --&gt;&lt;img width="111" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1404.png" alt="$x_d(n) \" sdef="" t="" s="" /&gt;, it must be true that &lt;img width="31" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img357.png" alt="$x(t)$" /&gt; is band-limited to&#10;&lt;!-- MATH&#10; $(-F_s/2,F_s/2)$&#10; --&gt;&lt;img width="102" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1453.png" alt="$(-F_s/2,F_s/2)$" /&gt;, since a sampled signal only supports frequencies up&#10;to &lt;img width="37" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1407.png" alt="$F_s/2$" /&gt; (see&#10;&amp;sect;&lt;a href="https://technick.net/guides/theory/dft/figuring_out_sampling#sec:derivation"&gt;A.4&lt;/a&gt;). This completes the proof of Shannon's Sampling Theorem.&lt;img width="16" height="12" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1439.png" alt="$\" ox="" /&gt;&lt;/p&gt;&lt;p&gt;A ''one-line summary of Shannon's sampling theorem is as follows:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;x(t) = \mbox{{\tt IFT}}_t\left\{&#10; \mbox{ZeroPad}&#10;_\infty\left\{\mbox{{\tt DTFT}}\{x_d\}\right\}\right\}&#10;\end{displaymath}&#10; --&gt;&lt;img width="279" height="31" border="0" src="https://technick.net/img/guide_dft/img1454.png" alt="\" egin="" isplaymath="" t="" box="" t="tt" ft="" left\="" box="" eropad="" nfty\left\="" box="" t="tt" tft="" d\="" ight\="" ight\="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;That is, the Discrete-Time Fourier Transform of the samples is&#10;extended to plus and minus infinity by zero, and the inverse Fourier&#10;transform of that gives the original signal. The Continuous-Time&lt;a href="https://technick.net/guides/theory/dft/decimation_theorem_aliasing"&gt;Aliasing&lt;/a&gt; Theorem provides that the zero-padded &lt;!-- MATH&#10; $\mbox{{\tt DTFT}}\{x_d\}$&#10; --&gt;&lt;img width="70" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1455.png" alt="$\" box="" t="tt" tft="" d\="" /&gt; and&#10;&lt;!-- MATH&#10; $\mbox{{\tt FT}}\{x\}$&#10; --&gt;&lt;img width="46" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1456.png" alt="$\" box="" t="tt" t="" /&gt; are identical, as needed.&lt;p&gt;Shannon's sampling theorem is easier to show when applied to&lt;a href="https://technick.net/guides/theory/dft/decimation_theorem_aliasing"&gt;discrete-time sampling-rate conversion&lt;/a&gt;, i.e., when simple &lt;a href="https://technick.net/guides/theory/dft/decimation_operator"&gt;decimation&lt;/a&gt;of a discrete time signal is being used to reduce the sampling rate by&#10;an integer factor. In analogy with the Continuous-Time Aliasing&#10;Theorem of &amp;sect;&lt;a href="https://technick.net/guides/theory/dft/aliasing_sampled_continuous#sec:aliasing"&gt;A.2&lt;/a&gt;, the &lt;a href="https://technick.net/guides/theory/dft/decimation_theorem_aliasing"&gt;Decimation Theorem&lt;/a&gt; states thatdownsampling a digital signal by an integer factor &lt;img width="15" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1116.png" alt="$L$" /&gt; produces a&#10;digital signal whose spectrum can be calculated by partitioning the&#10;original spectrum into &lt;img width="15" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1116.png" alt="$L$" /&gt; equal blocks and then summing (aliasing)&#10;those blocks. If only one of the blocks is nonzero, then the original&#10;signal at the higher sampling rate is exactly recoverable.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/aliasing_sampled_continuous"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/figuring_out_sampling"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Figuring Out Sampling Theory by Playing Around with Complex Sinusoids</title><link>https://technick.net/guides/theory/dft/figuring_out_sampling/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/figuring_out_sampling/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/shannon_s_sampling_theorem"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/what_frequencies_are"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION001140000000000000000"&gt;&lt;/a&gt;&lt;a name="sec:derivation"&gt;&lt;/a&gt;&lt;br /&gt;Figuring Out &lt;a href="https://technick.net/guides/theory/dft/shannon_s_sampling_theorem"&gt;Sampling Theory&lt;/a&gt; by Playing Around with Complex &lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;Sinusoids&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;Consider &lt;!-- MATH&#10; $z_0\in{\cal C}$&#10; --&gt;&lt;img width="47" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1457.png" alt="$z_0\" n="" al="" /&gt;, with &lt;img width="57" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1458.png" alt="$\" ert="" ert="1$" /&gt;. Then we can write&lt;img width="19" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img635.png" alt="$z_0$" /&gt; in polar form as&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;z_0\isdef e^{j\theta_0 } \isdef e^{j\omega_0 T_s},&#10;\end{displaymath}&#10; --&gt;&lt;img width="142" height="30" border="0" src="https://technick.net/img/guide_dft/img1459.png" alt="\" egin="" isplaymath="" isdef="" theta="" sdef="" omega="" s="s" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where &lt;img width="19" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1460.png" alt="$\" heta="" /&gt;, &lt;img width="21" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img585.png" alt="$\" mega="" /&gt;, and &lt;img width="20" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1405.png" alt="$T_s$" /&gt; are real numbers.&lt;p&gt;Forming a geometric sequence based on &lt;img width="19" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img635.png" alt="$z_0$" /&gt; yields the sequence&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;x(t_n) \isdef z_0^n = e^{j\theta_0 n} = e^{j\omega_0 t_n}&#10;\end{displaymath}&#10; --&gt;&lt;img width="209" height="31" border="0" src="https://technick.net/img/guide_dft/img1461.png" alt="\" egin="" isplaymath="" t="" isdef="" e="" j\theta="" n="" j\omega="" n="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where &lt;!-- MATH&#10; $t_n\isdef nT_s$&#10; --&gt;&lt;img width="65" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1462.png" alt="$t_n\" sdef="" s="s" /&gt;. Thus, successive integer powers of &lt;img width="19" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img635.png" alt="$z_0$" /&gt;produce a &lt;i&gt;sampled complex sinusoid&lt;/i&gt; with unit &lt;a href="https://technick.net/guides/theory/dft/logarithms"&gt;amplitude&lt;/a&gt;, and&#10;zero phase. Defining the &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/shannon_s_sampling_theorem"&gt;sampling interval&lt;/a&gt;&lt;/i&gt; as &lt;img width="20" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1405.png" alt="$T_s$" /&gt; in seconds&#10;provides that &lt;img width="21" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img585.png" alt="$\" mega="" /&gt; is the &lt;i&gt;radian frequency&lt;/i&gt; in radians per&#10;second.&lt;p&gt;&lt;br /&gt;&lt;hr /&gt;&lt;!--Table of Child-Links--&gt;&lt;a name="CHILD_LINKS"&gt;&lt;strong&gt;Subsections&lt;/strong&gt;&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html2854" href="https://technick.net/guides/theory/dft/what_frequencies_are"&gt;What frequencies are representable by a geometric sequence?&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2855" href="https://technick.net/guides/theory/dft/recovering_continuous_time_"&gt;Recovering a Continuous-Time Signal from its Samples&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html2856" href="https://technick.net/guides/theory/dft/method_1_additive"&gt;Method 1: Additive Synthesis&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2857" href="https://technick.net/guides/theory/dft/does_it_work"&gt;Does it Work?&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;/ul&gt;&lt;!--End of Table of Child-Links--&gt;&#10;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/shannon_s_sampling_theorem"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/what_frequencies_are"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>What frequencies are representable by a geometric sequence?</title><link>https://technick.net/guides/theory/dft/what_frequencies_are/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/what_frequencies_are/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/figuring_out_sampling"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/recovering_continuous_time_"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION001141000000000000000"&gt;What frequencies are representable by a geometric sequence?&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;A natural question to investigate is what frequencies &lt;img width="21" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img585.png" alt="$\" mega="" /&gt; are&#10;possible. The angular step of the point &lt;img width="21" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1463.png" alt="$z_0^n$" /&gt; along the unit&#10;circle in the &lt;a href="https://technick.net/guides/theory/dft/complex_plane"&gt;complex plane&lt;/a&gt; is &lt;!-- MATH&#10; $\theta_0 =\omega_0 T_s$&#10; --&gt;&lt;img width="73" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1464.png" alt="$\" heta="" mega="" s="s" /&gt;. Since &#10;&lt;!-- MATH&#10; $e^{j(\theta_0 n + 2\pi)} = e^{j\theta_0 n}$&#10; --&gt;&lt;img width="128" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1465.png" alt="$e^{j(\" heta="" pi="" j\theta="" /&gt;, an angular step larger than &lt;img width="22" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img40.png" alt="$2\" i="i" /&gt;, &#10;say &lt;img width="55" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1466.png" alt="$\" heta="" t="" i="" /&gt; is indistinguishable from the angular step&lt;img width="53" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1467.png" alt="$\" heta-2\pi="" /&gt;. Therefore, we must restrict the angular step &lt;img width="19" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1460.png" alt="$\" heta="" /&gt; to &#10;a length &lt;img width="22" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img40.png" alt="$2\" i="i" /&gt; range in order to avoid ambiguity.&lt;/p&gt;&lt;p&gt;Recall that we need support for both positive and &lt;a href="https://technick.net/guides/theory/dft/positive_negative_frequenci"&gt;negative frequencies&lt;/a&gt;since equal magnitudes of each must be summed to produce real&lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;sinusoids&lt;/a&gt;, as indicated by the identities&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;\cos(\omega_0 t_n) &amp;=&amp; \frac{1}{2}e^{j\omega_0 t_n} + \frac{1}{2}e^{-j\omega_0 t_n} \\&#10;\sin(\omega_0 t_n) &amp;=&amp; -\frac{j}{2}e^{j\omega_0 t_n} + \frac{j}{2}e^{-j\omega_0 t_n}.&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="287" height="85" border="0" src="https://technick.net/img/guide_dft/img1468.png" alt="\" egin="" qnarray="" os="" mega="" n="" rac="" j\omega="" n="" rac="" rac="" e="" omega="" n="" rac="" e="" omega="" n="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;The length &lt;img width="22" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img40.png" alt="$2\" i="i" /&gt; range which is symmetric about zero is&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\theta_0 \in [-\pi,\pi],&#10;\end{displaymath}&#10; --&gt;&lt;img width="94" height="31" border="0" src="https://technick.net/img/guide_dft/img1469.png" alt="\" egin="" isplaymath="" heta="" n="" i="" i="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;which, since &lt;!-- MATH&#10; $\theta_0 =\omega_0 T_s= 2\pi f_0T_s$&#10; --&gt;&lt;img width="143" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1470.png" alt="$\" heta="" mega="" s="2\pi" f="" s="s" /&gt;, corresponds to the frequency range&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;\omega_0 &amp;\in&amp; [-\pi/T_s,\pi/T_s]\\&#10;f_0&amp;\in&amp; [-F_s/2,F_s/2]&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="170" height="57" border="0" src="https://technick.net/img/guide_dft/img1471.png" alt="\" egin="" qnarray="" mega="" n="" i="" s="s" pi="" s="s" f="" n="" s="s" f="" s="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;However, there is a problem with the point at &lt;img width="85" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1472.png" alt="$f_0=\" m="" s="" /&gt;: Both&lt;img width="49" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1473.png" alt="$+F_s/2$" /&gt; and &lt;img width="49" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1474.png" alt="$-F_s/2$" /&gt; correspond to the same point &lt;img width="60" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1475.png" alt="$z_0=-1$" /&gt; in the&lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt;-plane. Technically, this can be viewed as &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/decimation_theorem_aliasing"&gt;aliasing&lt;/a&gt;&lt;/i&gt; of the&#10;frequency &lt;img width="49" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1474.png" alt="$-F_s/2$" /&gt; on top of &lt;img width="37" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1407.png" alt="$F_s/2$" /&gt;, or vice versa. The practical&#10;impact is that it is not possible in general to reconstruct a sinusoid&#10;from its samples at this frequency. For an obvious example, consider&#10;the sinusoid at half the &lt;a href="https://technick.net/guides/theory/dft/shannon_s_sampling_theorem"&gt;sampling-rate&lt;/a&gt; sampled on its zero-crossings:&#10;&lt;!-- MATH&#10; $\sin(\omega_0 t_n) = \sin(\pi n) \equiv 0$&#10; --&gt;&lt;img width="169" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1476.png" alt="$\" in="" mega="" n="" in="" i="" quiv="" /&gt;. We cannot be expected to&#10;reconstruct a nonzero signal from a string of zeros! For the signal&#10;&lt;!-- MATH&#10; $\cos(\omega_0 t_n) = \cos(\pi n) = (-1)^n$&#10; --&gt;&lt;img width="206" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1477.png" alt="$\" os="" mega="" n="" os="" i="" /&gt;, on the other hand, we sample&#10;the positive and negative peaks, and everything looks looks fine. In&#10;general, we either do not know the &lt;a href="https://technick.net/guides/theory/dft/logarithms"&gt;amplitude&lt;/a&gt;, or we do not know phase&#10;of a sinusoid sampled at exactly twice its frequency, and if we hit the&#10;zero crossings, we lose it altogether.&lt;p&gt;In view of the foregoing, we may define the valid range of ''digital&#10;frequencies'' to be&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;\theta_0 &amp;\in&amp; [-\pi,\pi) \\&#10;\omega_0 &amp;\in&amp; [-\pi/T_s,\pi/T_s) \\&#10;f_0&amp;\in&amp; [-F_s/2,F_s/2)&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="171" height="84" border="0" src="https://technick.net/img/guide_dft/img1478.png" alt="\" egin="" qnarray="" heta="" n="" i="" i="" mega="" n="" i="" s="s" pi="" s="s" f="" n="" s="s" f="" s="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;While you might have expected the open interval &lt;img width="55" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1479.png" alt="$(-\" i="i" pi="" /&gt;, we are&#10;free to give the point &lt;img width="60" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1475.png" alt="$z_0=-1$" /&gt; either the largest positive or largest&#10;negative representable frequency. Here, we chose the largest &lt;a href="https://technick.net/guides/theory/dft/positive_negative_frequenci"&gt;negative&#10;frequency&lt;/a&gt; since it corresponds to the assignment of numbers in &lt;a href="https://technick.net/guides/theory/dft/general_formula_two_s_compl"&gt;two's&#10;complement arithmetic&lt;/a&gt;, which is often used to implement phase&#10;registers in sinusoidal oscillators. Since there is no corresponding&#10;positive-frequency component, samples at &lt;img width="37" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1407.png" alt="$F_s/2$" /&gt; must be interpreted&#10;as samples of clockwise circular motion around the unit circle at two&#10;points. Such signals are any alternating sequence of the form&lt;img width="52" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1480.png" alt="$c(-1)^n$" /&gt;, where &lt;img width="11" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img139.png" alt="$c$" /&gt; can be be complex. The amplitude at &lt;img width="49" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1474.png" alt="$-F_s/2$" /&gt; is&#10;then defined as &lt;img width="20" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1481.png" alt="$\" ert="" ert="" /&gt;, and the phase is &lt;img width="21" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1482.png" alt="$\" ngle="" /&gt;.&lt;p&gt;We have seen that uniformly spaced samples can represent frequencies&lt;img width="19" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1483.png" alt="$f_0$" /&gt; only in the range &lt;!-- MATH&#10; $[-F_s/2,F_s/2)$&#10; --&gt;&lt;img width="100" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1484.png" alt="$[-F_s/2,F_s/2)$" /&gt;, where &lt;img width="21" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1403.png" alt="$F_s$" /&gt; denotes the&#10;sampling rate. Frequencies outside this range yield sampled sinusoids&#10;indistinguishable from frequencies inside the range. &lt;/p&gt;&lt;p&gt;Suppose we henceforth agree to sample at &lt;i&gt;higher&lt;/i&gt; than twice the&#10;highest frequency in our continuous-time signal. This is normally&#10;ensured in practice by lowpass-filtering the input signal to remove&#10;all &lt;a href="https://technick.net/guides/theory/dft/signal_metrics"&gt;signal energy&lt;/a&gt; at &lt;img width="37" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1407.png" alt="$F_s/2$" /&gt; and above. Such a filter is called an&lt;i&gt;anti-aliasing filter&lt;/i&gt;, and it is a standard first stage in an&lt;i&gt;Analog-to-Digital (A/D) Converter (ADC)&lt;/i&gt;. Nowadays, ADCs are normally&#10;implemented within a single integrated circuit chip, such as a CODEC&#10;(for ''coder/decoder'') or ''multimedia chip''.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/figuring_out_sampling"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/recovering_continuous_time_"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Recovering a Continuous-Time Signal from its Samples</title><link>https://technick.net/guides/theory/dft/recovering_continuous_time_/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/recovering_continuous_time_/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/what_frequencies_are"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/method_1_additive"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION001142000000000000000"&gt;Recovering a Continuous-Time Signal from its Samples&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;Given samples of a properly band-limited signal, how do we reconstruct&#10;the original continuous waveform? I.e., given &lt;!-- MATH&#10; $x(t_n),&#10;n=0,1,2,\ldots,N-1$&#10; --&gt;&lt;img width="193" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1485.png" alt="$x(t_n),&#10;n=0,1,2,\" dots="" /&gt;, how do we compute &lt;img width="31" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img357.png" alt="$x(t)$" /&gt; for any value of &lt;img width="10" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img484.png" alt="$t$" /&gt;?&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;hr /&gt;&lt;!--Table of Child-Links--&gt;&lt;a name="CHILD_LINKS"&gt;&lt;strong&gt;Subsections&lt;/strong&gt;&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html2880" href="https://technick.net/guides/theory/dft/method_1_additive"&gt;Method 1: Additive Synthesis&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2881" href="https://technick.net/guides/theory/dft/does_it_work"&gt;Does it Work?&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;!--End of Table of Child-Links--&gt;&#10;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/what_frequencies_are"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/method_1_additive"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Method 1: Additive Synthesis</title><link>https://technick.net/guides/theory/dft/method_1_additive/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/method_1_additive/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/recovering_continuous_time_"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/does_it_work"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;&lt;a name="SECTION001142100000000000000"&gt;Method 1: Additive Synthesis&lt;/a&gt;&lt;/h3&gt;&lt;p&gt;One reasonable definition for &lt;img width="31" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img357.png" alt="$x(t)$" /&gt; can be based on the &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;DFT&lt;/a&gt; of &lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img50.png" alt="$x(n)$" /&gt;:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;X(e^{j\omega_k}) \isdef \sum_{n=0}^{N-1} x(t_n) e^{-j\omega_kt_n}, \quad k=0,1,2,\ldots,N-1&#10;\end{displaymath}&#10; --&gt;&lt;img width="400" height="62" border="0" src="https://technick.net/img/guide_dft/img1486.png" alt="\" egin="" isplaymath="" e="" omega="" isdef="" um="" n-1="" x="" n="" j\omega="" t="" quad="" dots="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Since &lt;!-- MATH&#10; $X(e^{j\omega_k})$&#10; --&gt;&lt;img width="60" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1487.png" alt="$X(e^{j\" mega="" /&gt; gives the magnitude and phase of the sinusoidal&#10;component at frequency &lt;img width="22" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img681.png" alt="$\" mega="" /&gt;, we simply construct &lt;img width="31" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img357.png" alt="$x(t)$" /&gt; as the sum of&#10;its constituent &lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;sinusoids&lt;/a&gt;, using continuous-time versions of the&#10;sinusoids:&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;x(t) \isdef \sum_{k=0}^{N-1} X(e^{j\omega_k}) e^{j\omega_k t}&#10;\end{displaymath}&#10; --&gt;&lt;img width="185" height="62" border="0" src="https://technick.net/img/guide_dft/img1488.png" alt="\" egin="" isplaymath="" t="" sdef="" um="" n-1="" x="" j\omega="" e="" omega="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;This method is based on the fact that we know how to reconstruct&#10;sampled complex sinusoids exactly, since we have a ''closed form''&#10;formulas for them. This method makes perfectly fine sense, but note&#10;that this definition of &lt;img width="31" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img357.png" alt="$x(t)$" /&gt; is &lt;i&gt;periodic&lt;/i&gt; with period &lt;img width="35" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1489.png" alt="$NT_s$" /&gt;seconds. This happens because each of the sinusoids &lt;!-- MATH&#10; $e^{j\omega_k t}$&#10; --&gt;&lt;img width="38" height="17" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1490.png" alt="$e^{j\" mega="" /&gt; repeats&#10;after &lt;img width="35" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1489.png" alt="$NT_s$" /&gt; seconds. This is known as the &lt;i&gt;periodic extension&lt;/i&gt;property of the DFT, and it results from the fact that we had only &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt;samples to begin with, so some assumption must be made outside that&#10;interval. We see that the ''automatic'' assumption built into the&#10;math is &lt;a href="https://technick.net/guides/theory/dft/modulo_indexing_periodic"&gt;periodic extension&lt;/a&gt;. However, in practice, it is far more&#10;common to want to assume zeros outside the range of samples:&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;x(t) \isdef \left\{\begin{array}{ll}&#10;&#9;\sum_{k=0}^{N-1} X(e^{j\omega_k}) e^{j\omega_k t}, &amp; 0\leq t \leq (N-1)T_s \\&#10;&#9;0, &amp; \hbox{otherwise} \\&#10;&#9;\end{array}&#10;&#9;\right.&#10;\end{displaymath}&#10; --&gt;&lt;img width="388" height="52" border="0" src="https://technick.net/img/guide_dft/img1491.png" alt="\" egin="" isplaymath="" t="" sdef="" eft\="" egin="" rray="" l="" um="" n-1="" x="" q="q" n-1="" s="s" hbox="" therwise="" nd="" rray="" ight="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Note that the nonzero time interval can be chosen as any length &lt;img width="35" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1489.png" alt="$NT_s$" /&gt;interval. Often the best choice is &lt;!-- MATH&#10; $[-T_s(N-1)/2,T_s(N-1)/2-1]$&#10; --&gt;&lt;img width="233" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1492.png" alt="$[-T_s(N-1)/2,T_s(N-1)/2-1]$" /&gt;, which&#10;allows for both positive and negative times. (''Zero-phase filtering''&#10;must be implemented using this convention, for example.)&lt;p&gt;''Chopping'' the sum of the &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; ''DFT sinusoids'' in this way to zero&#10;outside an &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt;-sample range works fine if the original signal samples&lt;img width="40" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1493.png" alt="$x(t_n)$" /&gt; starts out and finishes with zeros. Otherwise, however, the&#10;truncation will cause errors at the edges, as can be understood from&#10;Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/reconstruction_samples_pict#fig:SincSum"&gt;A.1&lt;/a&gt;.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/recovering_continuous_time_"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/does_it_work"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Does it Work?</title><link>https://technick.net/guides/theory/dft/does_it_work/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/does_it_work/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/method_1_additive"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/introduction_digital_filter"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;&lt;a name="SECTION001142200000000000000"&gt;Does it Work?&lt;/a&gt;&lt;/h3&gt;&lt;p&gt;It is straightforward to show that the ''additive synthesis''&#10;reconstruction method of the previous section actually works exactly&#10;(in the periodic case) in the following sense:&lt;ul&gt;&lt;li&gt;The reconstructed signal &lt;img width="31" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img357.png" alt="$x(t)$" /&gt; is &lt;i&gt;band-limited&lt;/i&gt; to &lt;img width="53" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1058.png" alt="$[-\" i="i" pi="" /&gt;,&#10;&#9;i.e., its &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/dft"&gt;Fourier transform&lt;/a&gt;&lt;/i&gt; &lt;img width="41" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img356.png" alt="$X(\" mega="" /&gt; is zero &#10;&#9;for all &lt;!-- MATH&#10; $|\omega|&gt;\pi/T_s$&#10; --&gt;&lt;img width="78" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1494.png" alt="$\" ert\omega\vert="" t="" i="" s="s" /&gt;.&#10;&#9;(This is not quite true in the truncated case.)&lt;/li&gt;&lt;li&gt;The reconstructed signal &lt;img width="31" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img357.png" alt="$x(t)$" /&gt; passes through the samples &lt;img width="40" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1493.png" alt="$x(t_n)$" /&gt; exactly. (This is true in both cases.)&lt;/li&gt;&lt;/ul&gt;&lt;/p&gt;</description></item><item><title>Introduction to Digital Filter Analysis</title><link>https://technick.net/guides/theory/dft/introduction_digital_filter/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/introduction_digital_filter/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/does_it_work"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/motivating_example_overview"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION001200000000000000000"&gt;&lt;/a&gt;&lt;a name="app:filters"&gt;&lt;/a&gt;&lt;br /&gt;Introduction to &lt;a href="http://www.dsptutor.freeuk.com/dfilt1.php"&gt;Digital Filter&lt;/a&gt; Analysis&lt;/h1&gt;&lt;p&gt;The subject of digital filtering is quite large, and many books are&#10;devoted entirely to that subject from different points of view. This&#10;chapter discusses only the filter structures we need, such as basicFIR filters and BiQuads. The last section summarizes the main point&#10;of digital filter &lt;i&gt;theory&lt;/i&gt;.&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;hr /&gt;&lt;!--Table of Child-Links--&gt;&lt;a name="CHILD_LINKS"&gt;&lt;strong&gt;Subsections&lt;/strong&gt;&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html2916" href="https://technick.net/guides/theory/dft/motivating_example_overview"&gt;Motivating Example and Overview&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2917" href="https://technick.net/guides/theory/dft/fir_filters"&gt;FIR Filters&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html2918" href="https://technick.net/guides/theory/dft/convolution_representation"&gt;Convolution Representation&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2919" href="https://technick.net/guides/theory/dft/finiteness"&gt;Finiteness&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2920" href="https://technick.net/guides/theory/dft/causal_fir_filters"&gt;Causal FIR Filters&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2921" href="https://technick.net/guides/theory/dft/transfer_function"&gt;Transfer Function&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2922" href="https://technick.net/guides/theory/dft/order"&gt;Order&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2923" href="https://technick.net/guides/theory/dft/biquad_section"&gt;The BiQuad Section&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2924" href="https://technick.net/guides/theory/dft/digital_filter_theory"&gt;Digital Filter Theory Summary&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html2925" href="https://technick.net/guides/theory/dft/linearity_time_invariance"&gt;Linearity and Time-Invariance&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2926" href="https://technick.net/guides/theory/dft/difference_equation"&gt;Difference Equation&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2927" href="https://technick.net/guides/theory/dft/convolution_representation_"&gt;Convolution Representation of LTI Filters&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2928" href="https://technick.net/guides/theory/dft/frequency_response"&gt;Frequency Response&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2929" href="https://technick.net/guides/theory/dft/phase_delay_group"&gt;Phase Delay and Group Delay&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;/ul&gt;&lt;!--End of Table of Child-Links--&gt;&#10;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/does_it_work"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/motivating_example_overview"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Motivating Example and Overview</title><link>https://technick.net/guides/theory/dft/motivating_example_overview/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/motivating_example_overview/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/introduction_digital_filter"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/fir_filters"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION001210000000000000000"&gt;Motivating Example and Overview&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;Suppose you look up the documentation for a ''comb filter'' in a software package&#10;you are using, and you find it described as follows:&lt;pre&gt;&#10;out(n) = input(n) + feedforward * input(n-delay1) - feedback * out(n-delay2)&lt;/pre&gt;Does this tell you everything you need to know? Well, it does tell&#10;you exactly what is implemented, but to really understand it, you need&#10;to see its &lt;i&gt;frequency response&lt;/i&gt;. Moreover, if &lt;tt&gt;delay2&lt;/tt&gt;corresponds to more than a a few milliseconds, you probably want to&#10;see its &lt;i&gt;impulse response&lt;/i&gt; as well. The purpose of this appendix&#10;is to describe how to do this analysis.&lt;/p&gt;&lt;p&gt;To analyze our example, let's first write it in a more ''mathematical'' form:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;y(n) = x(n) + g_1 x(n-M_1) - g_2 y(n-M_2)&#10;\end{displaymath}&#10; --&gt;&lt;img width="325" height="31" border="0" src="https://technick.net/img/guide_dft/img1498.png" alt="\" egin="" isplaymath="" n="" n="" x="" m="" y="" m="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;The transfer function &lt;img width="39" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1499.png" alt="$H(z)$" /&gt; is derived by taking the &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt; transform of both&#10;side of this equation and solving for the transfer function, defined&#10;as &lt;!-- MATH&#10; $H(z)=Y(z)/X(z)$&#10; --&gt;&lt;img width="136" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1500.png" alt="$H(z)=Y(z)/X(z)$" /&gt;:&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;{\cal Z}\{y(n)\}&#9; &amp;=&amp; {\cal Z}\{x(n) + g_1 x(n-M_1) - g_2 y(n-M_2)\}\\&#10;&#9; &amp;=&amp; {\cal Z}\{x(n)\} + g_1 {\cal Z}\{x(n-M_1)\} - g_2 {\cal Z}\{y(n-M_2)\}\\&#10;\Rightarrow\; Y(z) &amp;=&amp; X(z) + g_1 z^{-M_1} X(z) - g_2 z^{-M_2} Y(z)\\&#10;\Rightarrow\; Y(z) + g_2 z^{-M_2} Y(z) &amp;=&amp; X(z) + g_1 z^{-M_1} X(z) \\&#10;\Rightarrow\; H(z) \isdef \frac{Y(z)}{X(z)} &amp;=&amp; \frac{1 + g_1 z^{-M_1}}{1 + g_2 z^{-M_2}}&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="592" height="160" border="0" src="https://technick.net/img/guide_dft/img1501.png" alt="\" egin="" qnarray="" al="" n="" al="" n="" x="" m="" y="" m="" rac="" z="" z="" rac="" z="" g="" m="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;The principles of this derivation are as follows&lt;ul&gt;&lt;li&gt;The &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt; transform &lt;!-- MATH&#10; ${\cal Z}\{\cdot\}$&#10; --&gt;&lt;img width="37" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1502.png" alt="${\" al="" dot\="" /&gt; is a &lt;i&gt;linear operator&lt;/i&gt; which implies&#10; &lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;{\cal Z}\{\alpha x_1(n) + \beta x_2(n)\} = \alpha {\cal Z}\{x_1(n)\} + \beta {\cal Z}\{x_2(n)\}&#10; \isdef \alpha X_1(z) + \beta X_2(z).&#10;\end{displaymath}&#10; --&gt;&lt;img width="535" height="31" border="0" src="https://technick.net/img/guide_dft/img1503.png" alt="\" egin="" isplaymath="" al="" lpha="" beta="" alpha="" al="" eta="" al="" n="" sdef="" lpha="" beta="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;/li&gt;&lt;li&gt;&lt;!-- MATH&#10; $x(n-M)\leftrightarrow z^{-M}X(z)$&#10; --&gt;&lt;img width="164" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1504.png" alt="$x(n-M)\" eftrightarrow="" x="" /&gt;. That is, the &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt; transform of a signal &lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img50.png" alt="$x(n)$" /&gt;&lt;i&gt;delayed&lt;/i&gt; by &lt;img width="21" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img201.png" alt="$M$" /&gt; samples, &lt;!-- MATH&#10; $x(n-M),\,n=0,1,2,\ldots$&#10; --&gt;&lt;img width="176" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1505.png" alt="$x(n-M),\" n="0,1,2,\ldots$" /&gt;, has the&lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt; transform &lt;img width="71" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1506.png" alt="$z^{-M}X(z)$" /&gt;. This is the &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/shift_theorem"&gt;shift theorem&lt;/a&gt;&lt;/i&gt; for &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt; transforms, &#10;which can be immediately derived from the definition of the &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt; transform, as&#10;we do below.&lt;/li&gt;&lt;/ul&gt;&lt;p&gt;Given the transfer function &lt;img width="39" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1499.png" alt="$H(z)$" /&gt;, the &lt;i&gt;frequency response&lt;/i&gt; is&#10;obtained by setting &lt;!-- MATH&#10; $z=e^{j\omega T}$&#10; --&gt;&lt;img width="65" height="18" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img665.png" alt="$z=e^{j\" mega="" /&gt;, where &lt;img width="16" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img224.png" alt="$T$" /&gt; is the &lt;a href="https://technick.net/guides/theory/dft/shannon_s_sampling_theorem"&gt;sampling&#10;interval&lt;/a&gt; in seconds, and &lt;img width="15" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img527.png" alt="$\" mega="" /&gt; is &lt;i&gt;radian frequency&lt;/i&gt; which&#10;ranges from &lt;img width="46" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1507.png" alt="$-\" i="i" t="" /&gt; (minus half the &lt;a href="https://technick.net/guides/theory/dft/shannon_s_sampling_theorem"&gt;sampling rate&lt;/a&gt; in radians per&#10;second) to &lt;img width="33" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1508.png" alt="$\" i="i" t="" /&gt; (plus half the sampling rate).&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;H(e^{j\omega T}) \isdef \frac{1 + g_1 e^{-jM_1\omega T}}{1 + g_2 e^{-jM_2}\omega T}&#10;\end{displaymath}&#10; --&gt;&lt;img width="209" height="49" border="0" src="https://technick.net/img/guide_dft/img1509.png" alt="\" egin="" isplaymath="" e="" omega="" sdef="" rac="" e="" m="" mega="" e="" m="" mega="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;In the special case &lt;img width="84" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1510.png" alt="$g_1=g_2=1$" /&gt;, we obtain&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;H(e^{j\omega T}) &amp;=&amp; \frac{1 + e^{-jM_1\omega T}}{1 + e^{-jM_2\omega T}}\\&#10;&amp;=&amp; \frac{e^{-jM_1\omega T/2}\left(e^{jM_1\omega T/2} + e^{-jM_1\omega T/2}\right)}{e^{-jM_2\omega T/2}\left(e^{jM_2\omega T/2} + e^{-jM_2\omega T/2}\right)}\\&#10;&amp;=&amp; e^{j(M_2-M_1)\omega T/2}\frac{\cos\left(M_1\omega T/2\right)}{\cos\left(M_2\omega T/2\right)}&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="386" height="151" border="0" src="https://technick.net/img/guide_dft/img1511.png" alt="\" egin="" qnarray="" e="" omega="" rac="" jm="" mega="" jm="" os\left="" omega="" ight="" os\left="" omega="" ight="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;This special case gives insight into the behavior of the filter as its&#10;coefficients &lt;img width="19" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1512.png" alt="$g_1$" /&gt; and &lt;img width="19" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1513.png" alt="$g_2$" /&gt; get approach 1. When &lt;img width="71" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1514.png" alt="$M_1=M_2$" /&gt;, the&#10;filter degenerates to &lt;img width="68" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1515.png" alt="$H(z)=1$" /&gt; which corresponds to &lt;img width="87" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1516.png" alt="$y(n)=x(n)$" /&gt;; in this&#10;case, the delayed input and output signals cancel each other out.&lt;p&gt;Since the frequency response is a complex-valued function, it has a&lt;i&gt;magnitude&lt;/i&gt; and &lt;i&gt;phase angle&lt;/i&gt;. The magnitude of the frequency response&#10;is called the &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/logarithms"&gt;amplitude&lt;/a&gt; response&lt;/i&gt;, and &#10;gives the filter &lt;i&gt;gain&lt;/i&gt; at each frequency &lt;img width="15" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img527.png" alt="$\" mega="" /&gt;.&#10;In this example, the amplitude response is&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\left|H(e^{j\omega T})\right| = \left|\frac{1 + g_1 e^{-jM_1\omega T}}{1 + g_2 e^{-jM_2}\omega T}\right|&#10;\end{displaymath}&#10; --&gt;&lt;img width="230" height="51" border="0" src="https://technick.net/img/guide_dft/img1517.png" alt="\" egin="" isplaymath="" eft\vert="" j\omega="" ight\vert="\left\vert\frac{1" g="" jm="" mega="" e="" m="" mega="" ight\vert="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;which, for &lt;img width="84" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1510.png" alt="$g_1=g_2=1$" /&gt;, reduces to&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\left|H(e^{j\omega T})\right| = \frac{\left|\cos\left(M_1\omega T/2\right)\right|}{\left|\cos\left(M_2\omega T/2\right)\right|}&#10;\end{displaymath}&#10; --&gt;&lt;img width="216" height="49" border="0" src="https://technick.net/img/guide_dft/img1518.png" alt="\" egin="" isplaymath="" eft\vert="" j\omega="" ight\vert="\frac{\left\vert\co..." ght\vert="" eft\vert\cos\left="" omega="" ight="" ight\vert="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;i&gt;&lt;img width="20" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img324.png" alt="$\" l="" /&gt; FIXME: Give &lt;a href="http://www.mathworks.com/access/helpdesk/help/techdoc/basics/getstarted.shtml"&gt;Matlab&lt;/a&gt; code and plot of amplitude response here&lt;img width="20" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img325.png" alt="$\" g="" /&gt;&lt;/i&gt;&lt;/p&gt;&lt;p&gt;The phase of the frequency response is called the &lt;i&gt;phase&#10;response&lt;/i&gt;. Like the phase of any &lt;a href="https://technick.net/guides/theory/dft/introduction_complex_number"&gt;complex number&lt;/a&gt;, it is given by the&#10;arctangent of the imaginary part of &lt;!-- MATH&#10; $H(e^{j\omega T})$&#10; --&gt;&lt;img width="63" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1519.png" alt="$H(e^{j\" mega="" /&gt; divided by its&#10;real part, and it contains information about the &lt;i&gt;delay&lt;/i&gt; of the&#10;filter at each frequency. The phase response is a good measure of&#10;filter delay when those delays are short (less than a few&#10;milliseconds, say). For longer delays, it is usually best to study&#10;the filter&lt;i&gt;impulse response&lt;/i&gt;, which can be defined as the inverse-&lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt; transform of the filter &#10;transfer function (or the inverse &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;Fourier transform&lt;/a&gt; of the frequency response).&lt;/p&gt;&lt;p&gt;&lt;i&gt;&lt;img width="20" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img324.png" alt="$\" l="" /&gt; FIXME: Give Matlab code and plot of phase response and impulse response&lt;img width="20" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img325.png" alt="$\" g="" /&gt;&lt;/i&gt;&lt;/p&gt;&lt;p&gt;This section has provided an overview of filter analysis in the frequency domain.&#10;We see that a complete understanding of this analysis requires understanding of&lt;i&gt;complex numbers&lt;/i&gt; and the elements of the &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt; transform. A tutorial introduction to these&#10;topics is provided in &lt;a name="tex2html120" href="https://technick.net/guides/theory/dft/default"&gt;Music 320 Background&#10;Reader&lt;/a&gt;. Here we will&#10;assume that background and focus on practical &lt;a href="http://www.dsptutor.freeuk.com/dfilt1.php"&gt;digital filter&lt;/a&gt;structures and their frequency-domain analysis.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/introduction_digital_filter"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/fir_filters"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>FIR Filters</title><link>https://technick.net/guides/theory/dft/fir_filters/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/fir_filters/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/motivating_example_overview"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/convolution_representation"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION001220000000000000000"&gt;&lt;/a&gt;&lt;a name="sec:fir"&gt;&lt;/a&gt;&lt;br /&gt;FIR Filters&lt;/h1&gt;&lt;p&gt;&lt;i&gt;&lt;img width="20" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img324.png" alt="$\" l="" /&gt; FIXME: Consider adding a section here on the one-zero filter, as in the&#10;filter tutorial. Or scan it, finally.&lt;img width="20" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img325.png" alt="$\" g="" /&gt;&lt;/i&gt;&lt;/p&gt;&lt;p&gt;&lt;i&gt;&lt;img width="20" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img324.png" alt="$\" l="" /&gt; FIXME: Leverage &lt;a href="http://www.mathworks.com/access/helpdesk/help/techdoc/basics/getstarted.shtml"&gt;Matlab&lt;/a&gt; here -- this is analysis&lt;img width="20" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img325.png" alt="$\" g="" /&gt;&lt;/i&gt;&lt;/p&gt;&lt;p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;a name="fig:fir"&gt;&lt;/a&gt;&lt;a name="18690"&gt;&lt;/a&gt;&lt;table&gt;&lt;caption align="BOTTOM"&gt;&lt;strong&gt;Figure B.1:&lt;/strong&gt;The general, causal, finite-impulse-response (FIR)&lt;a href="http://www.dsptutor.freeuk.com/dfilt1.php"&gt;digital filter&lt;/a&gt;.&lt;/caption&gt;&lt;tr&gt;&lt;td&gt;&lt;img width="457" height="90" border="0" src="https://technick.net/img/guide_dft/img1520.png" alt="\" egin="" igure="" entering="" mall="small" input="input" ig="" ir="" stex="" rule="" extwidth="" t="" ormalsize\end="" igure="" /&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;/div&gt;&lt;p&gt;Figure&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/fir_filters#fig:fir"&gt;B.1&lt;/a&gt; depicts the general, causal, &lt;i&gt;finite-impulse-response&#10;filter&lt;/i&gt;&lt;a name="18695"&gt;&lt;/a&gt; (FIR)&lt;a name="18696"&gt;&lt;/a&gt;. The &lt;i&gt;impulse response&lt;/i&gt;&lt;a name="18698"&gt;&lt;/a&gt; &lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1312.png" alt="$h(n)$" /&gt;is obtained at the output when the input signal is the &lt;i&gt;impulse&#10;signal&lt;/i&gt;&lt;a name="18700"&gt;&lt;/a&gt; &lt;!-- MATH&#10; $\delta = [1,0,0,0,\ldots]$&#10; --&gt;&lt;img width="121" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1521.png" alt="$\" elta="[1,0,0,0,\ldots]$" /&gt;. More formally, the impulse signal&#10; is defined by&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\delta(n)\isdef \left\{\begin{array}{ll}&#10;&#9;1, &amp; n=0 \\&#10;&#9;0, &amp; n\neq 0 \\&#10;&#9;\end{array}&#10;&#9;\right.&#10;\end{displaymath}&#10; --&gt;&lt;img width="152" height="49" border="0" src="https://technick.net/img/guide_dft/img1306.png" alt="\" egin="" isplaymath="" elta="" isdef="" eft\="" egin="" rray="" l="" n\neq="" nd="" rray="" ight="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;If the &lt;img width="13" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img53.png" alt="$k$" /&gt;th tap is denoted &lt;img width="21" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1522.png" alt="$h_k$" /&gt;, then it is obvious from Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/fir_filters#fig:fir"&gt;B.1&lt;/a&gt;that the impulse response &lt;i&gt;signal&lt;/i&gt; is given by&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;h(n)\isdef \left\{\begin{array}{ll}&#10;&#9;0, &amp; n&lt;0 \\&#10;&#9;h_n, &amp; 0\leq n\leq N-1 \\&#10;&#9;0, &amp; n&gt; N-1 \\&#10;&#9;\end{array}&#10;&#9;\right.&#10;\end{displaymath}&#10; --&gt;&lt;a name="eq:firir"&gt;&lt;/a&gt;&lt;a name="eq:firir"&gt;&lt;/a&gt;&lt;img width="236" height="71" border="0" src="https://technick.net/img/guide_dft/img1523.png" alt="\" egin="" isplaymath="" n="" sdef="" eft\="" egin="" rray="" l="" lt="" n="" eq="" eq="" gt="" end="" rray="" ight="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;In other words, the impulse response simply consists of the tap&#10;coefficients, prepended and appended by zeros.&lt;p&gt;&lt;br /&gt;&lt;hr /&gt;&lt;!--Table of Child-Links--&gt;&lt;a name="CHILD_LINKS"&gt;&lt;strong&gt;Subsections&lt;/strong&gt;&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html2954" href="https://technick.net/guides/theory/dft/convolution_representation"&gt;Convolution Representation&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2955" href="https://technick.net/guides/theory/dft/finiteness"&gt;Finiteness&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2956" href="https://technick.net/guides/theory/dft/causal_fir_filters"&gt;Causal FIR Filters&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2957" href="https://technick.net/guides/theory/dft/transfer_function"&gt;Transfer Function&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html2958" href="https://technick.net/guides/theory/dft/order"&gt;Order&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;/li&gt;&lt;/ul&gt;&lt;!--End of Table of Child-Links--&gt;&#10;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/motivating_example_overview"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/convolution_representation"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Convolution Representation</title><link>https://technick.net/guides/theory/dft/convolution_representation/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/convolution_representation/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/fir_filters"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/finiteness"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;&lt;a name="SECTION001220100000000000000"&gt;Convolution Representation&lt;/a&gt;&lt;/h3&gt;&lt;p&gt;Note that the output of the &lt;img width="13" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img53.png" alt="$k$" /&gt;th delay element in Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/fir_filters#fig:fir"&gt;B.1&lt;/a&gt; is&lt;img width="63" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1524.png" alt="$x(n-k)$" /&gt;, &lt;!-- MATH&#10; $k=0,1,2,\ldots,N-1$&#10; --&gt;&lt;img width="149" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img821.png" alt="$k=0,1,2,\" dots="" /&gt;, where &lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img50.png" alt="$x(n)$" /&gt; is the input signal&lt;a href="https://technick.net/guides/theory/dft/logarithms"&gt;amplitude&lt;/a&gt; at time &lt;img width="14" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img51.png" alt="$n$" /&gt;. The output signal &lt;img width="34" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img641.png" alt="$y(n)$" /&gt; is therefore&lt;br /&gt;&lt;div align="CENTER"&gt;&lt;a name="eq:fir"&gt;&lt;/a&gt;&lt;!-- MATH&#10; \begin{eqnarray}&#10;y(n) &amp;=&amp; h_0 x(n) + h_1 x(n-1) + h_2 x(n-2) + \cdots + h_{N-1} x(n-N+1) \\&#10; &amp;=&amp; \sum_{m=0}^{N-1} h_m x(n-m)\\&#10; &amp;=&amp; \sum_{m=-\infty}^{\infty} h(m) x(n-m)\\&#10; &amp;\isdef &amp; (h\ast x)(n)&#10;\end{eqnarray}&#10; --&gt;&lt;table align="CENTER" cellpadding="0" width="100%"&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&lt;img width="38" height="35" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1525.png" alt="$\" isplaystyle="" /&gt;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="18" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1526.png" alt="$\" extstyle="$" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="472" height="35" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1527.png" alt="$\" isplaystyle="" n="" x="" h="" n-2="" dots="" n-1="" n-n="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(B.1)&lt;/td&gt;&lt;/tr&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&amp;nbsp;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="18" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1526.png" alt="$\" extstyle="$" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="133" height="73" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1528.png" alt="$\" isplaystyle="" um="" n-1="" h="" n-m="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(B.2)&lt;/td&gt;&lt;/tr&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&amp;nbsp;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="18" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1526.png" alt="$\" extstyle="$" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="166" height="66" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1529.png" alt="$\" isplaystyle="" um="" infty="" infty="" h="" x="" m="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(B.3)&lt;/td&gt;&lt;/tr&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&amp;nbsp;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="18" height="44" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1530.png" alt="$\" extstyle="" sdef="" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="79" height="35" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1531.png" alt="$\" isplaystyle="" ast="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(B.4)&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;/p&gt;</description></item><item><title>Finiteness</title><link>https://technick.net/guides/theory/dft/finiteness/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/finiteness/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/convolution_representation"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/causal_fir_filters"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;&lt;a name="SECTION001220200000000000000"&gt;Finiteness&lt;/a&gt;&lt;/h3&gt;&lt;p&gt;From Eq.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/dft/convolution_representation#eq:fir"&gt;B.4&lt;/a&gt;), we see that the maximum length of the impulse&#10;response is &lt;img width="46" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1533.png" alt="$N+1$" /&gt; samples. Therefore, a tapped delay line can only&#10;implement impulse responses of &lt;i&gt;finite&lt;/i&gt; length, i.e., FIR&#10;filters.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/convolution_representation"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/causal_fir_filters"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Causal FIR Filters</title><link>https://technick.net/guides/theory/dft/causal_fir_filters/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/causal_fir_filters/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/finiteness"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/transfer_function"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;&lt;a name="SECTION001220300000000000000"&gt;Causal FIR Filters&lt;/a&gt;&lt;/h3&gt;&lt;p&gt;From Eq.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/dft/fir_filters#eq:firir"&gt;B.2&lt;/a&gt;), we that the impulse response &lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1312.png" alt="$h(n)$" /&gt; is always&lt;i&gt;zero&lt;/i&gt; for &lt;img width="43" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1316.png" alt="$n&amp;lt;0$" /&gt;. Any filter having a zero impulse response&#10;prior to time &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img38.png" alt="$0$" /&gt; is said to be &lt;i&gt;causal&lt;/i&gt;&lt;a name="18714"&gt;&lt;/a&gt;. Thus, a tapped delay&#10;line such as that depicted in Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/fir_filters#fig:fir"&gt;B.1&lt;/a&gt; can &lt;i&gt;only&lt;/i&gt; implement&#10;causal FIR filters. In software, however, we may easily implement&#10;non-causal filters as well based simply on the definition of&lt;a href="https://technick.net/guides/theory/dft/convolution"&gt;convolution&lt;/a&gt;. However, noncausal filters are never precisely physical,&#10;of course, since events are causal in the real world (disregarding&#10;certain effects in quantum mechanics).&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/finiteness"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/transfer_function"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Transfer Function</title><link>https://technick.net/guides/theory/dft/transfer_function/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/transfer_function/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/causal_fir_filters"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/order"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;&lt;a name="SECTION001220400000000000000"&gt;Transfer Function&lt;/a&gt;&lt;/h3&gt;&lt;p&gt;The &lt;i&gt;transfer function&lt;/i&gt;&lt;a name="18716"&gt;&lt;/a&gt; associated with any filter is defined as&#10;the &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt; transform of its impulse response. For the FIR filter we have&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;H(z) \isdef \sum_{n=-\infty}^{\infty} h_n z^{-n}&#10;= \sum_{n=0}^{N-1} h_n z^{-n}&#10;\end{displaymath}&#10; --&gt;&lt;a name="eq:firtf"&gt;&lt;/a&gt;&lt;a name="eq:firtf"&gt;&lt;/a&gt;&lt;img width="264" height="63" border="0" src="https://technick.net/img/guide_dft/img1534.png" alt="\" egin="" isplaymath="" z="" sdef="" um="" infty="" infty="" h="" n="" um="" n-1="" h="" n="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Thus, the transfer function of every length &lt;img width="46" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1533.png" alt="$N+1$" /&gt; causal FIR filter is&#10;an &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt;th-order &lt;i&gt;polynomial&lt;/i&gt; in &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt;.&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/causal_fir_filters"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/order"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Order</title><link>https://technick.net/guides/theory/dft/order/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/order/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/transfer_function"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/biquad_section"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h3&gt;&lt;a name="SECTION001220500000000000000"&gt;Order&lt;/a&gt;&lt;/h3&gt;&lt;p&gt;The &lt;i&gt;order&lt;/i&gt;&lt;a name="18718"&gt;&lt;/a&gt; of a filter is defined as the order of its transfer&#10;function. Thus, from Eq.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/dft/transfer_function#eq:firtf"&gt;B.2&lt;/a&gt;), the order of a causal, length&lt;img width="46" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1533.png" alt="$N+1$" /&gt; FIR filter is &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; (provided &lt;img width="71" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1535.png" alt="$h_{N-1}\" eq="" /&gt;). &lt;/p&gt;&lt;p&gt;Note from Fig.&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/fir_filters#fig:fir"&gt;B.1&lt;/a&gt; that &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; is the &lt;i&gt;total number of delay&#10;elements&lt;/i&gt; in the filter. This is the case in general for all filter&#10;implementations which are &lt;i&gt;canonical with respect to delay&lt;/i&gt;&lt;a name="18721"&gt;&lt;/a&gt;.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/transfer_function"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/biquad_section"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>The BiQuad Section</title><link>https://technick.net/guides/theory/dft/biquad_section/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/biquad_section/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/order"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/digital_filter_theory"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION001230000000000000000"&gt;&lt;/a&gt;&lt;a name="sec:biquad"&gt;&lt;/a&gt;&lt;br /&gt;The BiQuad Section&lt;/h1&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;The term ''biquad'' is short for ''bi-quadratic'', and is a common&#10;name for a two-pole, two-zero &lt;a href="http://www.dsptutor.freeuk.com/dfilt1.php"&gt;digital filter&lt;/a&gt;. The&lt;i&gt;transfer function&lt;/i&gt; of a biquad can be defined as&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;H(z) = g \frac{1 + b_1 z^{-1}+ b_2 z^{-2}}{1 + a_1 z^{-1}+ a_2 z^{-2}}&#10;\end{displaymath}&#10; --&gt;&lt;img width="215" height="48" border="0" src="https://technick.net/img/guide_dft/img1536.png" alt="\" egin="" isplaymath="" z="" frac="" b="" b="b" z="" a="" a="a" z="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img546.png" alt="$g$" /&gt; is called the &lt;i&gt;gain&lt;/i&gt; of the biquad. Since both the&#10;numerator and denominator of this transfer function are quadratic&#10;polynomials in &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt;, the transfer function is said to be&#10;''bi-quadratic''.&lt;p&gt;The parameters &lt;img width="18" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1537.png" alt="$b_1$" /&gt; and &lt;img width="18" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1538.png" alt="$b_2$" /&gt; are called the &lt;i&gt;numerator&#10;coefficients&lt;/i&gt;, and they determine the two &lt;i&gt;zeros&lt;/i&gt; of the biquad.&#10;Using the &lt;a href="https://technick.net/guides/theory/dft/quadratic_formula"&gt;quadratic formula&lt;/a&gt; for finding the roots of a second-order&#10;polynomial, we find that the zeros are located at &lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;z = -\frac{b_1}{2} \pm \sqrt{\left(\frac{b_1}{2}\right)^2 -b_2}.&#10; \qquad\hbox{(biquad zeros)}&#10;\end{displaymath}&#10; --&gt;&lt;img width="343" height="61" border="0" src="https://technick.net/img/guide_dft/img1539.png" alt="\" egin="" isplaymath="" frac="" b="" pm="" qrt="" eft="" rac="" b="" ight="" b="" quad\hbox="" iquad="" ros="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;The parameters &lt;img width="20" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1540.png" alt="$a_1$" /&gt; and &lt;img width="20" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1541.png" alt="$a_2$" /&gt; are called the &lt;i&gt;denominator&#10;coefficients&lt;/i&gt;, and they determine the two &lt;i&gt;poles&lt;/i&gt; of the biquad.&#10;Using the quadratic formula, the poles are found to be&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;z = -\frac{a_1}{2} \pm \sqrt{\left(\frac{a_1}{2}\right)^2 -a_2}.&#10; \qquad\hbox{(biquad poles)}&#10;\end{displaymath}&#10; --&gt;&lt;img width="344" height="50" border="0" src="https://technick.net/img/guide_dft/img1542.png" alt="\" egin="" isplaymath="" frac="" a="" pm="" qrt="" eft="" rac="" a="" ight="" a="" quad\hbox="" iquad="" les="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;The biquad forms a &lt;i&gt;resonator&lt;/i&gt; when the poles are &lt;i&gt;complex&lt;/i&gt;,&#10;i.e., when &lt;img width="92" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1543.png" alt="$(a_1/2)^2&amp;lt;a_2$" /&gt;. &lt;p&gt;If a complex pole is denoted by &lt;!-- MATH&#10; $p=r e^{j\theta}$&#10; --&gt;&lt;img width="62" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1544.png" alt="$p=r e^{j\" heta="" /&gt;, then the resonancefrequency &lt;img width="19" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1545.png" alt="$f_r$" /&gt; (in Hz) is related to pole angle &lt;img width="12" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img156.png" alt="$\" heta="" /&gt; and &lt;a href="https://technick.net/guides/theory/dft/shannon_s_sampling_theorem"&gt;sampling&#10;rate&lt;/a&gt; &lt;img width="67" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1546.png" alt="$f_s=1/T$" /&gt; by the relation &lt;!-- MATH&#10; $\theta= \omega_r T = 2\pi f_r T = 2\pi&#10;f_r/f_s$&#10; --&gt;&lt;img width="203" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1547.png" alt="$\" heta="\omega_r" t="2\pi" f="" pi="" f="" s="" /&gt;, i.e., &lt;!-- MATH&#10; $f_r = f_s\theta/2\pi$&#10; --&gt;&lt;img width="88" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1548.png" alt="$f_r = f_s\" heta="" i="" /&gt;.&lt;/p&gt;&lt;p&gt;The &lt;i&gt;magnitude&lt;/i&gt; &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img154.png" alt="$r$" /&gt; of a complex pole &lt;!-- MATH&#10; $p=r e^{j\theta}$&#10; --&gt;&lt;img width="62" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1544.png" alt="$p=r e^{j\" heta="" /&gt;determines the &lt;i&gt;damping&lt;/i&gt; or &lt;i&gt;bandwidth&lt;/i&gt; of the resonator.&#10;(The damping may be defined as the reciprocal of the bandwidth.) A&#10;common definition for this relationship is&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;r \isdef e^{-\pi B T}&#10;\end{displaymath}&#10; --&gt;&lt;img width="81" height="26" border="0" src="https://technick.net/img/guide_dft/img1549.png" alt="\" egin="" isplaymath="" isdef="" i="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img154.png" alt="$r$" /&gt; is the pole radius, &lt;img width="17" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img441.png" alt="$B$" /&gt; is the bandwidth in Hertz (cycles&#10;per second), and &lt;img width="16" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img224.png" alt="$T$" /&gt; is the &lt;a href="https://technick.net/guides/theory/dft/shannon_s_sampling_theorem"&gt;sampling interval&lt;/a&gt; in seconds.&lt;p&gt;The denominator coefficients of a resonator may be expressed in&#10;terms of &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img154.png" alt="$r$" /&gt; and &lt;img width="12" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img156.png" alt="$\" heta="" /&gt; as&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;a_1 &amp;=&amp; 2 r \cos(\theta) \\&#10; a_2 &amp;=&amp; -r^2&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="130" height="55" border="0" src="https://technick.net/img/guide_dft/img1550.png" alt="\" egin="" qnarray="" a="" cos="" heta="" a="" end="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Thus, &lt;img width="20" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1541.png" alt="$a_2$" /&gt; depends only on the damping and is independent of the&#10;resonance frequency, while &lt;img width="20" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1540.png" alt="$a_1$" /&gt; is a function of both.&lt;p&gt;A common setting for the zeros when making a resonator is to place one&#10;at &lt;img width="41" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img666.png" alt="$z=1$" /&gt; (dc) and the other at &lt;img width="54" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img925.png" alt="$z=-1$" /&gt; (half the sampling rate), i.e.,&lt;img width="47" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1551.png" alt="$b_1=0$" /&gt; and &lt;img width="60" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1552.png" alt="$b_2=-1$" /&gt; &lt;!-- MATH&#10; $\Rightarrow B(z) = 1-b_2z^{-1}=&#10;(1-z^{-1})(1+z^{-1})$&#10; --&gt;&lt;img width="297" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1553.png" alt="$\" ightarrow="" b="b" z="" z="" /&gt;. This placement of the zeros normalizes the peak&#10;gain of the resonator if it is swept using the &lt;img width="20" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1540.png" alt="$a_1$" /&gt; parameter.&lt;/p&gt;&lt;p&gt;Using the &lt;a href="https://technick.net/guides/theory/dft/shift_theorem"&gt;shift theorem&lt;/a&gt; for &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt; transforms, the &lt;i&gt;difference&#10;equation&lt;/i&gt; for the biquad can be written by inspection of the transfer&#10;function as&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;v(n) &amp;=&amp; g x(n) \\&#10; y(n) &amp;=&amp; v(n) + b_1 v(n-1) + b_2 v(n-2) \\&#10; &amp; &amp; \qquad - a_1 y(n-1) - a_2 y(n-2) .&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="318" height="84" border="0" src="https://technick.net/img/guide_dft/img1554.png" alt="\" egin="" qnarray="" n="" n="" n="" n="" b="" n-1="" b="" n-2="" quad="" a="" n-1="" a="" n-2="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where &lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img50.png" alt="$x(n)$" /&gt; denotes the input signal sample at time &lt;img width="14" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img51.png" alt="$n$" /&gt;, and &lt;img width="34" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img641.png" alt="$y(n)$" /&gt;is the output signal. This is the form that is typically implemented&#10;in software.&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/order"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/digital_filter_theory"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Digital Filter Theory Summary</title><link>https://technick.net/guides/theory/dft/digital_filter_theory/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/digital_filter_theory/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/biquad_section"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/linearity_time_invariance"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION001240000000000000000"&gt;Digital Filter Theory Summary&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;This section summarizes &lt;a href="https://technick.net/guides/theory/dft/introduction_digital_filter"&gt;digital filter theory&lt;/a&gt; in a rather terse&#10;fashion suitable for review study. &lt;i&gt;linearity&lt;/i&gt;,&lt;i&gt;time-invariance&lt;/i&gt; and four basic representations of &lt;a href="http://www.dsptutor.freeuk.com/dfilt1.php"&gt;digital&#10;filters&lt;/a&gt; are defined: the &lt;i&gt;difference equation coefficients,impulse response, transfer function,&lt;/i&gt; and &lt;i&gt;frequency response&lt;/i&gt;.&#10;Next the concepts of &lt;i&gt;phase delay&lt;/i&gt; and &lt;i&gt;group delay&lt;/i&gt; are&#10;defined. This material is a subset of that in [&lt;a href="https://technick.net/guides/theory/dft/bibliography#JOSFP"&gt;1&lt;/a&gt;].&lt;/p&gt;&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;A real &lt;i&gt;signal&lt;/i&gt;&lt;a name="18735"&gt;&lt;/a&gt; is defined as any real-valued function&#10;of the integers. Similarly a complex signal is any complex-valued&#10;function of the integers.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;A real &lt;i&gt;filter&lt;/i&gt;&lt;a name="18738"&gt;&lt;/a&gt; &lt;img width="24" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1555.png" alt="${\" al="" /&gt; is defined as any&#10;real-valued functional of a signal for each integer &lt;img width="14" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img51.png" alt="$n$" /&gt;. We express&#10;the input-output relation of the filter by&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;y(n)={\cal L}_n\{x(\cdot)\}&#10;\end{displaymath}&#10; --&gt;&lt;a name="eq:gf"&gt;&lt;/a&gt;&lt;a name="eq:gf"&gt;&lt;/a&gt;&lt;img width="124" height="31" border="0" src="https://technick.net/img/guide_dft/img1556.png" alt="\" egin="" isplaymath="" n="" al="" x="" dot="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where &lt;img width="30" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img44.png" alt="$x(\" dot="" /&gt; is the entire input signal, and &lt;img width="34" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img641.png" alt="$y(n)$" /&gt; is the output&#10;at time &lt;img width="14" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img51.png" alt="$n$" /&gt;.&lt;p&gt;&lt;br /&gt;&lt;hr /&gt;&lt;!--Table of Child-Links--&gt;&lt;a name="CHILD_LINKS"&gt;&lt;strong&gt;Subsections&lt;/strong&gt;&lt;/a&gt;&lt;ul&gt;&lt;li&gt;&lt;a name="tex2html3039" href="https://technick.net/guides/theory/dft/linearity_time_invariance"&gt;Linearity and Time-Invariance&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html3040" href="https://technick.net/guides/theory/dft/difference_equation"&gt;Difference Equation&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html3041" href="https://technick.net/guides/theory/dft/convolution_representation_"&gt;Convolution Representation of LTI Filters&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html3042" href="https://technick.net/guides/theory/dft/frequency_response"&gt;Frequency Response&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a name="tex2html3043" href="https://technick.net/guides/theory/dft/phase_delay_group"&gt;Phase Delay and Group Delay&lt;/a&gt;&lt;/li&gt;&lt;/ul&gt;&lt;!--End of Table of Child-Links--&gt;&#10;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/biquad_section"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/linearity_time_invariance"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Linearity and Time-Invariance</title><link>https://technick.net/guides/theory/dft/linearity_time_invariance/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/linearity_time_invariance/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/digital_filter_theory"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/difference_equation"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION001241000000000000000"&gt;Linearity and Time-Invariance&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;In everyday terms, the fact that a filter is&lt;i&gt;linear&lt;/i&gt;&lt;a name="18742"&gt;&lt;/a&gt; means simply that &lt;ol&gt;&lt;li&gt;the &lt;a href="https://technick.net/guides/theory/dft/logarithms"&gt;amplitude&lt;/a&gt; of the output is proportional to the amplitude of&#10;the input, and&lt;p&gt;&lt;/p&gt;&lt;/li&gt;&lt;li&gt;when two signals are added together and fed to the filter,&#10;the filter output is the same as if one had put each signal through&#10;the filter separately and then added the outputs.&lt;p&gt;&lt;/p&gt;&lt;/li&gt;&lt;/ol&gt;&lt;/p&gt;&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;A filter is said to be &lt;i&gt;linear&lt;/i&gt;&lt;a name="18747"&gt;&lt;/a&gt; &#10;if for any pair of signals &lt;!-- MATH&#10; $x_1(\cdot),x_2(\cdot)$&#10; --&gt;&lt;img width="77" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1557.png" alt="$x_1(\" dot="" cdot="" /&gt; and for all constant &#10;gains &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img546.png" alt="$g$" /&gt;, we have&lt;br /&gt;&lt;div align="CENTER"&gt;&lt;a name="eq:Lin"&gt;&lt;/a&gt;&lt;!-- MATH&#10; \begin{eqnarray}&#10;(1)\qquad &amp;&amp; {\cal L}_n\{g\, x_1(\cdot) \} = g\,{\cal L}_n\{x_1(\cdot)\} \\&#10;(2)\qquad &amp;&amp; {\cal L}_n\{x_1(\cdot) + x_2(\cdot)\} = {\cal L}_n\{x_1(\cdot)\} &#10;&#9;+ {\cal L}_n\{x_2(\cdot)\},&#10;\end{eqnarray}&#10; --&gt;&lt;table align="CENTER" cellpadding="0" width="100%"&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&lt;img width="62" height="35" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1558.png" alt="$\" isplaystyle="" quad="" /&gt;&lt;/td&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="204" height="35" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1559.png" alt="$\" isplaystyle="" al="" g\="" cdot="" cal="" x="" dot="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(B.5)&lt;/td&gt;&lt;/tr&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&lt;img width="62" height="35" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1560.png" alt="$\" isplaystyle="" quad="" /&gt;&lt;/td&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="340" height="35" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1561.png" alt="$\" isplaystyle="" al="" x="" dot="" cdot="" al="" x="" dot="" al="" x="" dot="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(B.6)&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;for all &lt;img width="14" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img51.png" alt="$n$" /&gt;. These two conditions are a mathematical statement of the&#10;previous definition. For &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img546.png" alt="$g$" /&gt; rational, property (2) implies (1).&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;A filter is said to be &lt;i&gt;time-invariant&lt;/i&gt;&lt;a name="18757"&gt;&lt;/a&gt; if&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;{\cal L}_n\{x(\;\cdot\;-N)\}={\cal L}_{n-N}\{x(\cdot)\}=y(n-N),&#10;\end{displaymath}&#10; --&gt;&lt;a name="eq:gtif"&gt;&lt;/a&gt;&lt;a name="eq:gtif"&gt;&lt;/a&gt;&lt;img width="328" height="31" border="0" src="https://technick.net/img/guide_dft/img1562.png" alt="\" egin="" isplaymath="" al="" x="" dot\="" cal="" n="" cdot="" n-n="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where &lt;!-- MATH&#10; $x(\;\cdot\;-N)$&#10; --&gt;&lt;img width="73" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1563.png" alt="$x(\" cdot\="" /&gt; is understood to denote the waveform &lt;img width="30" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img44.png" alt="$x(\" dot="" /&gt; shifted&#10;right (or delayed) by &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; samples.&lt;p&gt;Linear, time-invariant filters are often referred to as &lt;i&gt;LTI filters&lt;/i&gt;&lt;a name="18761"&gt;&lt;/a&gt;.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/digital_filter_theory"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/difference_equation"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Difference Equation</title><link>https://technick.net/guides/theory/dft/difference_equation/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/difference_equation/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/linearity_time_invariance"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/convolution_representation_"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION001242000000000000000"&gt;Difference Equation&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;The &lt;i&gt;difference equation&lt;/i&gt;&lt;a name="18764"&gt;&lt;/a&gt; for a general, causal, linear time-invariant (LTI)&lt;a href="http://www.dsptutor.freeuk.com/dfilt1.php"&gt;digital filter&lt;/a&gt; is given by&lt;br /&gt;&lt;div align="CENTER"&gt;&lt;a name="eq:gde"&gt;&lt;/a&gt;&lt;!-- MATH&#10; \begin{eqnarray}&#10;y(n) = b_0\,x(n) &amp;+&amp; b_1\,x(n-1) +\,\cdots\, + b_{n_b}\,x(n-{n_b}) \\&#10;&#9;&amp;-&amp; a_1\,y(n-1) - \,\cdots\, -a_{n_a}\,y(n-{n_a})&#10;\end{eqnarray}&#10; --&gt;&lt;table align="CENTER" cellpadding="0" width="100%"&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&lt;img width="114" height="35" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1564.png" alt="$\" isplaystyle="" b="b" x="" /&gt;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="18" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1565.png" alt="$\" extstyle="" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="257" height="35" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1566.png" alt="$\" isplaystyle="" n-1="" dots\="" b="" b="b" x="" n="" b="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(B.7)&lt;/td&gt;&lt;/tr&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&amp;nbsp;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="18" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1567.png" alt="$\" extstyle="" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="261" height="35" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1568.png" alt="$\" isplaystyle="" n-1="" dots\="" a="" a="a" y="" n="" a="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(B.8)&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;where &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; is the input signal, &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img13.png" alt="$y$" /&gt; is the output signal, and the&#10;constants &lt;img width="24" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1569.png" alt="$\" b="b" i="i" /&gt;, &lt;!-- MATH&#10; $i=0,1,2,\ldots,{n_b}\}$&#10; --&gt;&lt;img width="128" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1570.png" alt="$i=0,1,2,\" dots="" b="b" /&gt;, &lt;img width="26" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1571.png" alt="$\" a="a" i="i" /&gt;,&#10;&lt;!-- MATH&#10; $i=1,2,\ldots,{n_a}\}$&#10; --&gt;&lt;img width="114" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1572.png" alt="$i=1,2,\" dots="" a="a" /&gt; are called &lt;i&gt;difference equation&#10;coefficients&lt;/i&gt;&lt;a name="18774"&gt;&lt;/a&gt;, or more simply, &lt;i&gt;filter coefficients&lt;/i&gt;&lt;a name="18776"&gt;&lt;/a&gt;. When the&lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img192.png" alt="$a$" /&gt; and &lt;img width="11" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img327.png" alt="$b$" /&gt; coefficients are real numbers, then the filter is said to&#10;be &lt;i&gt;real&lt;/i&gt;&lt;a name="18778"&gt;&lt;/a&gt;.&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;Equation Eq.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/dft/difference_equation#eq:gde"&gt;B.8&lt;/a&gt;) represents only &lt;i&gt;causal&lt;/i&gt; LTI&#10;filters. A filter is said to be &lt;i&gt;causal&lt;/i&gt;&lt;a name="18782"&gt;&lt;/a&gt; when the output does&#10;not depend on any ''future'' inputs. (In more colorful terms, a&#10;filter is causal if it does not ''laugh'' before it is ''tickled.'')&lt;/p&gt;&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;The &lt;i&gt;maximum time span&lt;/i&gt;, in samples, used in creating&#10;each output sample is called the order&lt;a name="18784"&gt;&lt;/a&gt; of&#10;the filter. In&#10;Eq.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/dft/difference_equation#eq:gde"&gt;B.8&lt;/a&gt;), the order is the larger of &lt;img width="20" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1573.png" alt="${n_b}$" /&gt; and &lt;img width="21" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1574.png" alt="${n_a}$" /&gt;. Since &lt;img width="20" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1573.png" alt="${n_b}$" /&gt;and &lt;img width="21" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1574.png" alt="${n_a}$" /&gt; in Eq.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/dft/difference_equation#eq:gde"&gt;B.8&lt;/a&gt;) are assumed finite, Eq.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/dft/difference_equation#eq:gde"&gt;B.8&lt;/a&gt;) represents the&#10;class of &lt;i&gt;finite order&lt;/i&gt; causal LTI filters.&lt;/p&gt;&lt;p&gt;In addition to difference equation coefficients, any LTI filter may be&#10;represented in the time domain by its response to a specific signal&#10;called the &lt;i&gt;impulse&lt;/i&gt;.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;The &lt;i&gt;impulse signal&lt;/i&gt;&lt;a name="18794"&gt;&lt;/a&gt; is denoted as &lt;img width="34" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1575.png" alt="$\" elta="" /&gt; and&#10;is defined by&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\delta(n)\isdef \left\{ {1,\;n=0}\atop{0,\;n\neq 0} \right..&#10;\end{displaymath}&#10; --&gt;&lt;img width="147" height="49" border="0" src="https://technick.net/img/guide_dft/img1576.png" alt="\" egin="" isplaymath="" elta="" isdef="" eft\="" atop="" n\neq="" ight="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;The &lt;i&gt;impulse response&lt;/i&gt;&lt;a name="18797"&gt;&lt;/a&gt; of a filter is the response of&#10;the filter to &lt;img width="34" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1575.png" alt="$\" elta="" /&gt; and is most often denoted &lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1312.png" alt="$h(n)$" /&gt;.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;A filter is said to be &lt;i&gt;stable&lt;/i&gt;&lt;a name="18800"&gt;&lt;/a&gt; if&#10;the impulse response &lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1312.png" alt="$h(n)$" /&gt; approaches zero as &lt;img width="14" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img51.png" alt="$n$" /&gt; goes to infinity.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/linearity_time_invariance"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/convolution_representation_"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Convolution Representation of LTI Filters</title><link>https://technick.net/guides/theory/dft/convolution_representation_/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/convolution_representation_/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/difference_equation"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/frequency_response"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION001243000000000000000"&gt;&lt;/a&gt;&lt;a name="sec:convolution"&gt;&lt;/a&gt;&lt;br /&gt;Convolution Representation of LTI Filters&lt;/h2&gt;&lt;a name="18803"&gt;&lt;/a&gt;&lt;p&gt;If &lt;img width="34" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img641.png" alt="$y(n)$" /&gt; is the output of an LTI filter with input &lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img50.png" alt="$x(n)$" /&gt; and impulse&#10;response &lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1312.png" alt="$h(n)$" /&gt;, then &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img13.png" alt="$y$" /&gt; is the &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/convolution"&gt;convolution&lt;/a&gt;&lt;/i&gt; of &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; with &lt;img width="13" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1101.png" alt="$h$" /&gt;,&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;y(n)=\sum_{i=0}^n x(i)h(n-i) \isdef x\ast h(n).&#10;\end{displaymath}&#10; --&gt;&lt;img width="265" height="59" border="0" src="https://technick.net/img/guide_dft/img1577.png" alt="\" egin="" isplaymath="" n="" um="" n="" i="i" h="" i="" sdef="" st="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Since convolution is commutative (&lt;!-- MATH&#10; $x\ast h(n) = h\ast x(n)$&#10; --&gt;&lt;img width="136" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1578.png" alt="$x\" st="" h\ast="" /&gt;), we have also&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;y(n)=\sum_{i=0}^n h(i)x(n-i).&#10;\end{displaymath}&#10; --&gt;&lt;a name="eq:convrep"&gt;&lt;/a&gt;&lt;a name="eq:convrep"&gt;&lt;/a&gt;&lt;img width="181" height="59" border="0" src="https://technick.net/img/guide_dft/img1579.png" alt="\" egin="" isplaymath="" n="" um="" n="" i="i" x="" i="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt; &lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;The &lt;i&gt;unilateral &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt; transform&lt;/i&gt;&lt;a name="18807"&gt;&lt;/a&gt; of the discrete-time signal &lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img50.png" alt="$x(n)$" /&gt; is defined to be&lt;br /&gt;&lt;div align="RIGHT"&gt;&lt;!-- MATH&#10; \begin{equation}&#10;X(z)\isdef \sum_{n=0}^\infty x(n)z^{-n},&#10;\end{equation}&#10; --&gt;&lt;table width="100%" align="CENTER"&gt;&lt;tr valign="MIDDLE"&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;a name="ztdef"&gt;&lt;/a&gt;&lt;img width="159" height="58" border="0" src="https://technick.net/img/guide_dft/img1580.png" alt="\" egin="" isplaymath="" z="" sdef="" um="" infty="" n="" n="" nd="" isplaymath="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(B.9)&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;That &lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img50.png" alt="$x(n)$" /&gt; and &lt;img width="39" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1581.png" alt="$X(z)$" /&gt; are transform pairs is expressed&#10;by writing &lt;!-- MATH&#10; $X(z)={\cal Z}\{x(n)\}$&#10; --&gt;&lt;img width="120" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1582.png" alt="$X(z)={\" al="" n="" /&gt; or &lt;!-- MATH&#10; $X(z)\leftrightarrow x(n)$&#10; --&gt;&lt;img width="95" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1583.png" alt="$X(z)\" eftrightarrow="" /&gt;.&lt;p&gt;&lt;b&gt;Theorem. &lt;/b&gt;The &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/convolution_theorem"&gt;convolution theorem&lt;/a&gt;&lt;/i&gt; (Papoulis [&lt;a href="https://technick.net/guides/theory/dft/bibliography#Papoulis"&gt;21&lt;/a&gt;]) states that &lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;x\ast y(n)\leftrightarrow X(z)Y(z).&#10;\end{displaymath}&#10; --&gt;&lt;img width="167" height="31" border="0" src="https://technick.net/img/guide_dft/img1584.png" alt="\" egin="" isplaymath="" ast="" leftrightarrow="" y="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;In words, &lt;i&gt;convolution in the time domain is multiplication in the frequency domain&lt;/i&gt;.&lt;p&gt;Taking the &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt; transform of both sides of Eq.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/dft/convolution_representation_#eq:convrep"&gt;B.4.3&lt;/a&gt;) and applying the convolution theorem gives&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;Y(z)=H(z)X(z)&#10;\end{displaymath}&#10; --&gt;&lt;a name="eq:YHX"&gt;&lt;/a&gt;&lt;a name="eq:YHX"&gt;&lt;/a&gt;&lt;img width="135" height="31" border="0" src="https://technick.net/img/guide_dft/img1585.png" alt="\" egin="" isplaymath="" z="" z="" z="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where &lt;img width="39" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1499.png" alt="$H(z)$" /&gt; is the &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt; transform of the filter impulse response. Thus the&lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt; transform of the filter output is the &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt; transform of the input times the &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt; transform of&#10;the impulse response.&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;The &lt;i&gt;transfer function&lt;/i&gt;&lt;a name="18815"&gt;&lt;/a&gt; &lt;img width="44" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1586.png" alt="$\" h="" /&gt; of a linear&#10;time-invariant discrete-time filter is defined to be the &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt; transform of the&#10;impulse response &lt;img width="38" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1587.png" alt="$\" h="" /&gt;.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Theorem. &lt;/b&gt;The &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/shift_theorem"&gt;shift theorem&lt;/a&gt;&lt;/i&gt; [&lt;a href="https://technick.net/guides/theory/dft/bibliography#Papoulis"&gt;21&lt;/a&gt;] for &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt; transforms states that&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;x(n-M)\leftrightarrow z^{-M}X(z).&#10;\end{displaymath}&#10; --&gt;&lt;img width="180" height="31" border="0" src="https://technick.net/img/guide_dft/img1588.png" alt="\" egin="" isplaymath="" n-m="" eftrightarrow="" x="" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;The shift theorem can be derived immediately from the definition of the &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt; transformgiven in Eq.&amp;nbsp;(&lt;a href="#eq:ztdef"&gt;&lt;img width="13" height="13" align="BOTTOM" border="1" alt="[*]" src="https://technick.net/img/guide_dft/crossref.png" /&gt;&lt;/a&gt;):&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;{\cal Z}\{x(n-M)\} &amp;\isdef &amp; \sum_{n=0}^{\infty} x(n-M) z^{-n}\qquad\hbox{(define $m=n-M$)}\\&#10; &amp;=&amp;\sum_{m=-M}^{\infty} x(m) z^{-(m+M)}\\&#10; &amp;=&amp;\sum_{m=0}^{\infty} x(m) z^{-(m+M)}\qquad \hbox{(assuming $x(n)=0$\ for $n&lt;0$)}\\&#10;&#9; &amp;=&amp;z^{-M}\sum_{m=0}^{\infty} x(m) z^{-m}\\&#10;&#9; &amp;\isdef &amp;z^{-M}X(z)&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="563" height="265" border="0" src="https://technick.net/img/guide_dft/img1589.png" alt="\" egin="" qnarray="" al="" n-m="" sdef="" um="" infty="" x="" m="" n="" m="" um="" infty="" x="" z="" isdef="" m="" z="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;The general difference equation for an LTI filter appears as&lt;br /&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray}&#10;y(n) = b_0\,x(n) &amp;+&amp; b_1\,x(n-1) +\,\cdots\, + b_{n_b}\,x(n-{n_b}) \\&#10;&#9;&#9; &amp;-&amp; a_1\,y(n-1) - \,\cdots\, -a_{n_a}\,y(n-{n_a}),&#10;\end{eqnarray}&#10; --&gt;&lt;table align="CENTER" cellpadding="0" width="100%"&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&lt;img width="114" height="35" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1564.png" alt="$\" isplaystyle="" b="b" x="" /&gt;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="18" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1565.png" alt="$\" extstyle="" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="257" height="35" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1566.png" alt="$\" isplaystyle="" n-1="" dots\="" b="" b="b" x="" n="" b="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(B.10)&lt;/td&gt;&lt;/tr&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&amp;nbsp;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="18" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1567.png" alt="$\" extstyle="" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="266" height="35" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1590.png" alt="$\" isplaystyle="" n-1="" dots\="" a="" a="a" y="" n="" a="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(B.11)&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;Taking the &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt; transform of both sides, denoting the transform by&#10;&lt;!-- MATH&#10; ${\cal Z}\{\,\}$&#10; --&gt;&lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1591.png" alt="${\" al="" /&gt;, gives&#10; &lt;br /&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray}&#10;{\cal Z}\{y(n)\}&#10; &amp;=&amp;b_0\,{\cal Z}\{x(n)\} + b_1\,z^{-1}{\cal Z}\{x(n)\} +\,\cdots\, + b_{n_b}\,z^{-{n_b}}{\cal Z}\{x(n)\} \\&#10; &amp;&amp; \qquad - a_1\,z^{-1}{\cal Z}\{y(n)\} - \,\cdots\, - a_{n_a}\,z^{-{n_a}}{\cal Z}\{y(n)\},&#10;\end{eqnarray}&#10; --&gt;&lt;table align="CENTER" cellpadding="0" width="100%"&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&lt;img width="70" height="35" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1592.png" alt="$\" isplaystyle="" al="" n="" /&gt;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="18" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1526.png" alt="$\" extstyle="$" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="420" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1593.png" alt="$\" isplaystyle="" al="" n="" b="" cal="" n="" dots\="" b="" b="b" z="" b="b" cal="" n="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(B.12)&lt;/td&gt;&lt;/tr&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&amp;nbsp;&lt;/td&gt;&lt;td&gt;&amp;nbsp;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="373" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1594.png" alt="$\" isplaystyle="" quad="" a="" cal="" n="" dots\="" a="" a="a" z="" a="a" cal="" n="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(B.13)&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;using linearity and the shift theorem. Replacing &lt;!-- MATH&#10; ${\cal Z}\{y(n)\}$&#10; --&gt;&lt;img width="63" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1595.png" alt="${\" al="" n="" /&gt; by &lt;img width="37" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1596.png" alt="$Y(z)$" /&gt;,&#10;&lt;!-- MATH&#10; ${\cal Z}\{x(n)\}$&#10; --&gt;&lt;img width="64" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1597.png" alt="${\" al="" n="" /&gt; by &lt;img width="39" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1581.png" alt="$X(z)$" /&gt;, and moving the terms in &lt;img width="37" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1596.png" alt="$Y(z)$" /&gt; to the left-hand side,&#10;we obtain&lt;br /&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray}&#10;Y(z) &amp;+&amp; a_1\,z^{-1}Y(z) + \,\cdots\, + a_{n_a}\,z^{-{n_a}}Y(z) \\&#10; &amp;=&amp; b_0\,X(z) + b_1\,z^{-1}X(z) +\,\cdots\, + b_{n_b}\,z^{-{n_b}}X(z)&#10;\end{eqnarray}&#10; --&gt;&lt;table align="CENTER" cellpadding="0" width="100%"&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&lt;img width="41" height="35" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1598.png" alt="$\" isplaystyle="" /&gt;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="18" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1565.png" alt="$\" extstyle="" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="262" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1599.png" alt="$\" isplaystyle="" y="" cdots\="" a="" a="a" z="" a="a" y="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(B.14)&lt;/td&gt;&lt;/tr&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&amp;nbsp;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="18" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1526.png" alt="$\" extstyle="$" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="338" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1600.png" alt="$\" isplaystyle="" z="" b="" x="" cdots\="" b="" b="b" z="" b="b" x="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(B.15)&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;or&lt;br /&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray}&#10;\left[ 1 \right. &amp;+&amp; \left. a_1\,z^{-1} + \,\cdots\, + a_{n_a}\,z^{-{n_a}} \right]\,Y(z) \\&#10; &amp;=&amp; \left[b_0 + b_1\,z^{-1}+\,\cdots\,+b_{n_b}\,z^{-{n_b}}\right] X(z).&#10;\end{eqnarray}&#10; --&gt;&lt;table align="CENTER" cellpadding="0" width="100%"&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&lt;img width="20" height="35" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1601.png" alt="$\" isplaystyle="" eft="" ight="" /&gt;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="18" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1565.png" alt="$\" extstyle="" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="241" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1602.png" alt="$\" isplaystyle="" eft="" a="" cdots\="" a="" a="a" z="" a="a" right="" z="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(B.16)&lt;/td&gt;&lt;/tr&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&amp;nbsp;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="18" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1526.png" alt="$\" extstyle="$" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="280" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1603.png" alt="$\" isplaystyle="" eft="" b="" b="" cdots\="" b="" b="b" z="" b="b" right="" z="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(B.17)&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Defining the polynomials&lt;br /&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray}&#10;A(z) &amp;\isdef &amp; 1 + a_1\,z^{-1} + \,\cdots\, + a_{n_a}\,z^{-{n_a}}\\&#10;B(z) &amp;\isdef &amp; b_0 + b_1\,z^{-1}+\,\cdots\,+b_{n_b}\,z^{-{n_b}},&#10;\end{eqnarray}&#10; --&gt;&lt;table align="CENTER" cellpadding="0" width="100%"&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&lt;img width="41" height="35" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1604.png" alt="$\" isplaystyle="" /&gt;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="18" height="44" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1530.png" alt="$\" extstyle="" sdef="" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="219" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1605.png" alt="$\" isplaystyle="" a="" cdots\="" a="" a="a" z="" a="a" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(B.18)&lt;/td&gt;&lt;/tr&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&lt;img width="41" height="35" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1606.png" alt="$\" isplaystyle="" /&gt;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="18" height="44" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1530.png" alt="$\" extstyle="" sdef="" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="224" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1607.png" alt="$\" isplaystyle="" b="" cdots\="" b="" b="b" z="" b="b" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(B.19)&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;the &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt; transform of the difference equation becomes&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;A(z)\,Y(z) = B(z)\,X(z)&#10;\end{displaymath}&#10; --&gt;&lt;img width="175" height="31" border="0" src="https://technick.net/img/guide_dft/img1608.png" alt="\" egin="" isplaymath="" a="" y="" b="b" z="" z="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Finally, solving for &lt;img width="80" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1609.png" alt="$Y(z)/X(z)$" /&gt; which equals&#10;the transfer function &lt;img width="39" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1499.png" alt="$H(z)$" /&gt;, yields&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;H(z) = \frac{Y(z)}{X(z)} = \frac{B(z)}{A(z)}&#10; = \frac{b_0 + b_1\,z^{-1} +\,\cdots\, + b_{n_b}\,z^{-{n_b}} }{&#10; 1 + a_1\,z^{-1} + \,\cdots\, +a_{n_a}\,z^{-{n_a}}}.&#10;\end{displaymath}&#10; --&gt;&lt;a name="eq:Hz"&gt;&lt;/a&gt;&lt;a name="eq:Hz"&gt;&lt;/a&gt;&lt;img width="416" height="50" border="0" src="https://technick.net/img/guide_dft/img1610.png" alt="\" egin="" isplaymath="" z="" rac="" z="" z="" rac="" b="" a="a" z="" rac="" b="" b="b" a="a" z="" dots\="" a="" a="a" z="" a="a" end="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/difference_equation"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/frequency_response"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Frequency Response</title><link>https://technick.net/guides/theory/dft/frequency_response/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/frequency_response/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/convolution_representation_"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/phase_delay_group"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION001244000000000000000"&gt;Frequency Response&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;Beginning with Eq.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/dft/convolution_representation_#eq:YHX"&gt;B.4.3&lt;/a&gt;), we have&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;Y(z)=H(z)X(z),&#10;\end{displaymath}&#10; --&gt;&lt;img width="142" height="31" border="0" src="https://technick.net/img/guide_dft/img1611.png" alt="\" egin="" isplaymath="" z="" z="" z="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where &lt;img width="39" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1581.png" alt="$X(z)$" /&gt; is the &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt; transform of the filter input, &lt;img width="37" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1596.png" alt="$Y(z)$" /&gt; is the &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img16.png" alt="$z$" /&gt; transform &#10;of the output signal, and &lt;img width="39" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1499.png" alt="$H(z)$" /&gt; is the filter transfer function. &lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;The &lt;i&gt;frequency response&lt;/i&gt;&lt;a name="18868"&gt;&lt;/a&gt; of a linear time-invariant &lt;a href="http://www.dsptutor.freeuk.com/dfilt1.php"&gt;digital&#10;filter&lt;/a&gt; is defined to be the transfer function, &lt;img width="39" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1499.png" alt="$H(z)$" /&gt;, evaluated on&#10;the unit circle, that is, &lt;!-- MATH&#10; $H(e^{j\omega})$&#10; --&gt;&lt;img width="53" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1612.png" alt="$H(e^{j\" mega="" /&gt;.&lt;/p&gt;&lt;p&gt;The frequency response is a complex-valued function of a real&#10;variable. The response at frequency &lt;img width="14" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1418.png" alt="$f$" /&gt; Hz, for example, is&#10;&lt;!-- MATH&#10; $H(e^{j2\pi fT})$&#10; --&gt;&lt;img width="76" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1613.png" alt="$H(e^{j2\" i="i" t="" /&gt;, where &lt;img width="16" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img224.png" alt="$T$" /&gt; is the &lt;a href="https://technick.net/guides/theory/dft/shannon_s_sampling_theorem"&gt;sampling period&lt;/a&gt; in seconds.&lt;/p&gt;&lt;p&gt;Since every &lt;a href="https://technick.net/guides/theory/dft/introduction_complex_number"&gt;complex number&lt;/a&gt; can be represented as a magnitude and&#10;angle, the frequency response may be decomposed into two real-valued&#10;functions, the &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/logarithms"&gt;amplitude&lt;/a&gt; response&lt;/i&gt;&lt;a name="18872"&gt;&lt;/a&gt; and the &lt;i&gt;phase response&lt;/i&gt;&lt;a name="18874"&gt;&lt;/a&gt;.&#10;Formally, we may define them as follows:&lt;br /&gt;&lt;div align="CENTER"&gt;&lt;a name="eq:Polar"&gt;&lt;/a&gt;&lt;!-- MATH&#10; \begin{eqnarray}&#10;G(\omega)&amp;\isdef &amp; \left\| H(e^{j\omega})\right\| \\&#10;\Theta(\omega)&amp;\isdef &amp; \angle H(e^{j\omega})&#10;\end{eqnarray}&#10; --&gt;&lt;table align="CENTER" cellpadding="0" width="100%"&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&lt;img width="44" height="35" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1614.png" alt="$\" isplaystyle="" mega="" /&gt;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="18" height="44" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1530.png" alt="$\" extstyle="" sdef="" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="79" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1615.png" alt="$\" isplaystyle="" eft\vert="" j\omega="" ight\vert="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(B.20)&lt;/td&gt;&lt;/tr&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&lt;img width="43" height="35" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1616.png" alt="$\" isplaystyle="" heta="" mega="" /&gt;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="18" height="44" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1530.png" alt="$\" extstyle="" sdef="" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="70" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1617.png" alt="$\" isplaystyle="" ngle="" j\omega="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(B.21)&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;so that &lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;H(e^{j\omega}) = G(\omega)\,e^{j\Theta(\omega)}.&#10;\end{displaymath}&#10; --&gt;&lt;a name="eq:Hpolar"&gt;&lt;/a&gt;&lt;a name="eq:Hpolar"&gt;&lt;/a&gt;&lt;img width="171" height="31" border="0" src="https://technick.net/img/guide_dft/img1618.png" alt="\" egin="" isplaymath="" e="" omega="" omega="" j\theta="" mega="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;Thus &lt;img width="39" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1619.png" alt="$G(\" mega="" /&gt; is the magnitude (or complex modulus) of &lt;!-- MATH&#10; $H(e^{j\omega})$&#10; --&gt;&lt;img width="53" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1612.png" alt="$H(e^{j\" mega="" /&gt;,&#10;and &lt;!-- MATH&#10; $\Theta(\omega)$&#10; --&gt;&lt;img width="39" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1620.png" alt="$\" heta="" mega="" /&gt; is the phase (or complex angle) of &lt;!-- MATH&#10; $H(e^{j\omega})$&#10; --&gt;&lt;img width="53" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1612.png" alt="$H(e^{j\" mega="" /&gt;.&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;The real valued function &lt;img width="39" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1619.png" alt="$G(\" mega="" /&gt; in Eq.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/dft/frequency_response#eq:Polar"&gt;B.21&lt;/a&gt;) is&#10; called the filter &lt;i&gt;amplitude response&lt;/i&gt;&lt;a name="18885"&gt;&lt;/a&gt; and it specifies the&#10;amplitude &lt;i&gt;gain&lt;/i&gt; that the filter provides at each frequency.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;The function &lt;img width="47" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1621.png" alt="$G^2(\" mega="" /&gt; is called the &lt;i&gt;power response&lt;/i&gt; and it specifies the power gain&lt;a name="18887"&gt;&lt;/a&gt; at each frequency.&lt;/p&gt;&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;The real function &lt;!-- MATH&#10; $\Theta(\omega)$&#10; --&gt;&lt;img width="39" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1620.png" alt="$\" heta="" mega="" /&gt; in Eq.&amp;nbsp;(&lt;a href="https://technick.net/guides/theory/dft/frequency_response#eq:Polar"&gt;B.21&lt;/a&gt;) is the&lt;i&gt;phase response&lt;/i&gt;&lt;a name="18891"&gt;&lt;/a&gt; and it gives the phase shift in radians that&#10;each input component &lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;sinusoid&lt;/a&gt; will undergo.&lt;/p&gt;&lt;p&gt;If the filter input and output signals are &lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img50.png" alt="$x(n)$" /&gt; and &lt;img width="34" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img641.png" alt="$y(n)$" /&gt;respectively, then&lt;br /&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray}&#10;\left|Y(e^{j\omega})\right| &amp;=&amp;G(\omega)\,\left|X(e^{j\omega})\right|\\&#10;&#9;\angle Y(e^{j\omega}) &amp;=&amp;\Theta(\omega)+\angle X(e^{j\omega}).&#10;\end{eqnarray}&#10; --&gt;&lt;table align="CENTER" cellpadding="0" width="100%"&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&lt;img width="69" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1622.png" alt="$\" isplaystyle="" eft\vert="" j\omega="" ight\vert="" /&gt;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="18" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1526.png" alt="$\" extstyle="$" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="116" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1623.png" alt="$\" isplaystyle="" mega="" eft\vert="" j\omega="" ight\vert="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(B.22)&lt;/td&gt;&lt;/tr&gt;&lt;tr valign="MIDDLE"&gt;&lt;td nowrap="nowrap" ign="RIGHT"&gt;&lt;img width="68" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1624.png" alt="$\" isplaystyle="" ngle="" j\omega="" /&gt;&lt;/td&gt;&lt;td align="CENTER" nowrap="nowrap"&gt;&lt;img width="18" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1526.png" alt="$\" extstyle="$" /&gt;&lt;/td&gt;&lt;td align="LEFT" nowrap="nowrap"&gt;&lt;img width="136" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1625.png" alt="$\" isplaystyle="" heta="" mega="" ngle="" j\omega="" /&gt;&lt;/td&gt;&lt;td width="10" align="RIGHT"&gt;(B.23)&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/convolution_representation_"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/phase_delay_group"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Phase Delay and Group Delay</title><link>https://technick.net/guides/theory/dft/phase_delay_group/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/phase_delay_group/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/frequency_response"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/bibliography"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION001245000000000000000"&gt;Phase Delay and Group Delay&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;The phase response of a filter &lt;!-- MATH&#10; $\Theta(\omega)$&#10; --&gt;&lt;img width="39" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1620.png" alt="$\" heta="" mega="" /&gt; gives the &lt;i&gt;radian&lt;/i&gt; phase shift &#10;experienced by each sinusoidal component of the input signal.&#10;Sometimes it is more meaningful to consider &lt;i&gt;phase delay&lt;/i&gt;[&lt;a href="https://technick.net/guides/theory/dft/bibliography#Papoulis"&gt;21&lt;/a&gt;].&lt;/p&gt;&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;The &lt;i&gt;phase delay&lt;/i&gt;&lt;a name="18900"&gt;&lt;/a&gt; of an LTI filter &lt;img width="39" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1499.png" alt="$H(z)$" /&gt; with phase response&#10;&lt;!-- MATH&#10; $\Theta(\omega)$&#10; --&gt;&lt;img width="39" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1620.png" alt="$\" heta="" mega="" /&gt; is defined by&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;P(\omega) \isdef -\, \frac{\Theta(\omega)}{ \omega}.&#10;\end{displaymath}&#10; --&gt;&lt;img width="126" height="44" border="0" src="https://technick.net/img/guide_dft/img1626.png" alt="\" egin="" isplaymath="" p="" mega="" sdef="" rac="" heta="" mega="" mega="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;The phase delay gives the &lt;i&gt;time delay&lt;/i&gt;&lt;a name="18902"&gt;&lt;/a&gt; in seconds&#10;experienced by each sinusoidal component of the input signal. For&#10;example, in filter &lt;!-- MATH&#10; $y(n)\leftarrow x(n)+x(n-1)$&#10; --&gt;&lt;img width="168" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1627.png" alt="$y(n)\" eftarrow="" x="" /&gt;, the phase response is&#10;&lt;!-- MATH&#10; $\Theta(\omega)= - \omega T/2$&#10; --&gt;&lt;img width="110" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1628.png" alt="$\" heta="" mega="" mega="" /&gt; which corresponds to a phase delay &lt;!-- MATH&#10; $P(\omega) =&#10;T/2$&#10; --&gt;&lt;img width="88" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1629.png" alt="$P(\" mega="" /&gt; which is one-half sample.&lt;/p&gt;&lt;p&gt;More generally, if the input to a filter with frequency response&lt;!-- MATH&#10; $H(e^{j\omega})=G(\omega)e^{j\Theta(\omega)}$&#10; --&gt;&lt;img width="152" height="36" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1630.png" alt="$H(e^{j\" mega="" omega="" j\theta="" mega="" /&gt; is&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;x(n)=\cos\left(\omega nT\right),&#10;\end{displaymath}&#10; --&gt;&lt;img width="140" height="31" border="0" src="https://technick.net/img/guide_dft/img1631.png" alt="\" egin="" isplaymath="" n="" os\left="" mega="" right="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;then the output is&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;y(n) = G(\omega) \cos \left(\omega nT + \Theta(\omega) \right)&#10; = G(\omega) \cos \left[\omega \left(nT - P(\omega)\right)\right],&#10;\end{displaymath}&#10; --&gt;&lt;img width="455" height="31" border="0" src="https://technick.net/img/guide_dft/img1632.png" alt="\" egin="" isplaymath="" n="" omega="" os="" eft="" mega="" theta="" mega="" igh="" mega="" os="" eft="" mega="" eft="" t="" p="" mega="" ight="" ight="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;and it can be seen that the phase delay expresses phase response &#10;as time delay.&lt;p&gt;In working with phase delay, care must be taken to ensure all&#10;appropriate multiples of &lt;img width="22" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img40.png" alt="$2\" i="i" /&gt; have been included in &lt;!-- MATH&#10; $\Theta(\omega)$&#10; --&gt;&lt;img width="39" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1620.png" alt="$\" heta="" mega="" /&gt;. We&#10;defined &lt;!-- MATH&#10; $\Theta(\omega)$&#10; --&gt;&lt;img width="39" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1620.png" alt="$\" heta="" mega="" /&gt; simply as the complex angle of the frequencyresponse &lt;!-- MATH&#10; $H(e^{j\omega})$&#10; --&gt;&lt;img width="53" height="34" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1612.png" alt="$H(e^{j\" mega="" /&gt;, and this is not sufficient for obtaining a phase&#10;response which can be converted to true time delay. By discarding&#10;multiples of &lt;img width="22" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img40.png" alt="$2\" i="i" /&gt;, as is done in the definition of complex angle,&#10;the phase delay is modified by multiples of the sinusoidal&#10;period. Since LTI filter analysis is based on &lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;sinusoids&lt;/a&gt; without&#10;beginning or end, one cannot in principle distinguish between ''true''&#10;phase delay and a phase delay with discarded sinusoidal&#10;periods. Nevertheless, it is convenient to define the filter phase&#10;response as a &lt;i&gt;continuous&lt;/i&gt; function of frequency with the&#10;property that &lt;img width="66" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1633.png" alt="$\" heta="" /&gt; (for real filters). This specifies a&#10;means of ''unwrapping'' the phase response to get a consistent phase&#10;delay curve.&lt;a name="18634"&gt;&lt;/a&gt;&lt;/p&gt;&lt;p&gt;&lt;b&gt;Definition. &lt;/b&gt;A more commonly encountered representation of filter phase response is&#10;called the &lt;i&gt;group delay&lt;/i&gt;&lt;a name="18907"&gt;&lt;/a&gt;, and it is defined by&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;D(\omega)\isdef \,-\, \frac{d}{ d\omega}\,\Theta(\omega).&#10;\end{displaymath}&#10; --&gt;&lt;img width="154" height="43" border="0" src="https://technick.net/img/guide_dft/img1634.png" alt="\" egin="" isplaymath="" omega="" sdef="" rac="" d\omega="" heta="" mega="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt; &lt;p&gt;For &lt;a href="https://technick.net/guides/theory/dft/linear_phase_terms"&gt;linear phase&lt;/a&gt; responses, the group delay and the phase delay are&#10;identical, and each may be interpreted as time delay. &lt;/p&gt;&lt;p&gt;For any &lt;a href="http://www.treasure-troves.com/physics/phasefunction.php"&gt;phase function&lt;/a&gt;, the group delay &lt;img width="41" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1635.png" alt="$D(\" mega="" /&gt; may be interpreted as&#10;the time delay of the &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/logarithms"&gt;amplitude&lt;/a&gt; envelope&lt;/i&gt; of a sinusoid at&#10;frequency &lt;img width="15" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img527.png" alt="$\" mega="" /&gt; [&lt;a href="https://technick.net/guides/theory/dft/bibliography#Papoulis"&gt;21&lt;/a&gt;].&lt;a name="18640"&gt;&lt;/a&gt; The bandwidth of the amplitude envelope in this&#10;interpretation must be restricted to a frequency interval over which&#10;the phase response is approximately linear. While the proof will not&#10;be given here, it should seem reasonable when the process of amplitude&#10;envelope detection is considered. The narrow ''bundle'' of&#10;frequencies centered at the carrier frequency &lt;img width="15" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img527.png" alt="$\" mega="" /&gt; is translated to&lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img38.png" alt="$0$" /&gt; Hz. At this point, it is evident that the group delay at the&#10;carrier frequency gives the slope of the linear phase of the&#10;translated spectrum. But this is a constant phase delay, and therefore&#10;it has the interpretation of true time delay for the amplitude&#10;envelope.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/frequency_response"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/bibliography"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Bibliography</title><link>https://technick.net/guides/theory/dft/bibliography/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/bibliography/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/phase_delay_group"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h2&gt;&lt;a name="SECTION001300000000000000000"&gt;Bibliography&lt;/a&gt;&lt;/h2&gt;&lt;dl compact="compact"&gt;&lt;dd&gt;&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="JOSFP"&gt;1&lt;/a&gt;&lt;dd&gt;J.&amp;nbsp;O. Smith,&lt;br /&gt;''&lt;a href="https://technick.net/guides/theory/dft/introduction_digital_filter"&gt;Introduction to digital filter theory&lt;/a&gt;'',&lt;br /&gt;in &lt;em&gt;Digital Audio Signal Processing: An Anthology&lt;/em&gt;, J.&amp;nbsp;Strawn,&#10; Ed. William Kaufmann, Inc., Los Altos, California, 1985,&lt;br /&gt;a shortened version appears in [&lt;a href="https://technick.net/guides/theory/dft/bibliography#RoadsMM"&gt;23&lt;/a&gt;]. Also available as&#10; Stanford University Department of Music Technical Report STAN-M-20, April&#10; 1985.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="Golub"&gt;2&lt;/a&gt;&lt;dd&gt;G.&amp;nbsp;H. Golub and C.&amp;nbsp;F. Van Loan,&lt;br /&gt;&lt;em&gt;&lt;a href="https://technick.net/guides/theory/dft/matrices"&gt;Matrix&lt;/a&gt; Computations, 2nd Edition&lt;/em&gt;,&lt;br /&gt;The Johns Hopkins University Press, Baltimore, 1989.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="Noble"&gt;3&lt;/a&gt;&lt;dd&gt;B.&amp;nbsp;Noble,&lt;br /&gt;&lt;em&gt;Applied Linear Algebra&lt;/em&gt;,&lt;br /&gt;Prentice-Hall, Inc., Englewood Cliffs, NJ, 1969.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="Churchill"&gt;4&lt;/a&gt;&lt;dd&gt;R.&amp;nbsp;V. Churchill,&lt;br /&gt;&lt;em&gt;Complex Variables and Applications&lt;/em&gt;,&lt;br /&gt;McGraw-Hill, New York, 1960.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="LePage"&gt;5&lt;/a&gt;&lt;dd&gt;W.&amp;nbsp;R. LePage,&lt;br /&gt;&lt;em&gt;Complex Variables and the Laplace Transform for Engineers&lt;/em&gt;,&lt;br /&gt;Dover, New York, 1961.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="Gullberg97"&gt;6&lt;/a&gt;&lt;dd&gt;J.&amp;nbsp;Gullberg,&lt;br /&gt;&lt;em&gt;Mathematics From the Birth of Numbers&lt;/em&gt;,&lt;br /&gt;Norton and Co., New York, 1997,&lt;br /&gt;[QA21.G78 1996] ISBN 0-393-04002-X.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="RabinerAndGold"&gt;7&lt;/a&gt;&lt;dd&gt;L.&amp;nbsp;R. Rabiner and B.&amp;nbsp;Gold,&lt;br /&gt;&lt;em&gt;Theory and Application of &lt;a href="http://www.dsptutor.freeuk.com/default.php"&gt;Digital Signal Processing&lt;/a&gt;&lt;/em&gt;,&lt;br /&gt;Prentice-Hall, Inc., Englewood Cliffs, NJ, 1975.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="OppenheimAndSchafer"&gt;8&lt;/a&gt;&lt;dd&gt;A.&amp;nbsp;V. Oppenheim and R.&amp;nbsp;W. Schafer,&lt;br /&gt;&lt;em&gt;&lt;a href="http://www.dsptutor.freeuk.com/default.php"&gt;Digital Signal Processing&lt;/a&gt;&lt;/em&gt;,&lt;br /&gt;Prentice-Hall, Inc., Englewood Cliffs, NJ, 1975.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="Pierce"&gt;9&lt;/a&gt;&lt;dd&gt;A.&amp;nbsp;D. Pierce,&lt;br /&gt;&lt;em&gt;Acoustics&lt;/em&gt;,&lt;br /&gt;American Institute of Physics, for the Acoustical Society of America,&#10; (516)349-7800 x 481, 1989.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="StevensAndDavis38"&gt;10&lt;/a&gt;&lt;dd&gt;S.&amp;nbsp;S. Stevens and H.&amp;nbsp;Davis,&lt;br /&gt;&lt;em&gt;Hearing: It's Psychology and Physiology&lt;/em&gt;,&lt;br /&gt;American Institute of Physics, for the Acoustical Society of America,&#10; (516)349-7800 x 481, 1983,&lt;br /&gt;copy of original 1938 edition.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="Dattorro88"&gt;11&lt;/a&gt;&lt;dd&gt;J.&amp;nbsp;Dattorro,&lt;br /&gt;''The implementation of recursive &lt;a href="http://www.dsptutor.freeuk.com/dfilt1.php"&gt;digital filters&lt;/a&gt; for high-fidelity&#10; audio'',&lt;br /&gt;&lt;em&gt;Journal of the Audio Engineering Society&lt;/em&gt;, vol. 36, pp. 851-878, Nov. 1988,&lt;br /&gt;Comments, ibid. (Letters to the Editor), vol. 37, p. 486 (1989 June);&#10; Comments, ibid. (Letters to the Editor), vol. 38, pp. 149-151 (1990 Mar.).&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="RabinerAndSchafer78"&gt;12&lt;/a&gt;&lt;dd&gt;L.&amp;nbsp;R. Rabiner and R.&amp;nbsp;W. Schafer,&lt;br /&gt;&lt;em&gt;Digital Processing of Speech Signals&lt;/em&gt;,&lt;br /&gt;Prentice-Hall, Englewood Cliffs, NJ, 1978.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="PapoulisRV"&gt;13&lt;/a&gt;&lt;dd&gt;A.&amp;nbsp;Papoulis,&lt;br /&gt;&lt;em&gt;Probability, Random Variables, and Stochastic Processes&lt;/em&gt;,&lt;br /&gt;McGraw-Hill, New York, 1965.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="SteiglitzText96"&gt;14&lt;/a&gt;&lt;dd&gt;K.&amp;nbsp;Steiglitz,&lt;br /&gt;&lt;em&gt;A &lt;a href="http://www.dsptutor.freeuk.com/default.php"&gt;Digital Signal Processing&lt;/a&gt; Primer with Applications to Audio&#10; and Computer Music&lt;/em&gt;,&lt;br /&gt;Addison-Wesley, Reading MA, 1996.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="DodgeAndJerse85"&gt;15&lt;/a&gt;&lt;dd&gt;C.&amp;nbsp;Dodge and T.&amp;nbsp;A. Jerse,&lt;br /&gt;&lt;em&gt;Computer Music&lt;/em&gt;,&lt;br /&gt;Schirmer, New York, 1985.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="Sharf91"&gt;16&lt;/a&gt;&lt;dd&gt;L.&amp;nbsp;L. Sharf,&lt;br /&gt;&lt;em&gt;&lt;a href="https://technick.net/guides/theory/dft/appendix_b_introductory"&gt;Statistical Signal Processing&lt;/a&gt;, Detection, Estimation, and Time&#10; Series Analysis&lt;/em&gt;,&lt;br /&gt;Addison-Wesley, Reading MA, 1991.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="AbramowitzAndStegun"&gt;17&lt;/a&gt;&lt;dd&gt;M.&amp;nbsp;Abramowitz and I.&amp;nbsp;A. Stegun, Eds.,&lt;br /&gt;&lt;em&gt;Handbook of Mathematical Functions&lt;/em&gt;,&lt;br /&gt;Dover, New York, 1965.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="Bracewell"&gt;18&lt;/a&gt;&lt;dd&gt;R.&amp;nbsp;Bracewell,&lt;br /&gt;&lt;em&gt;The &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;Fourier Transform&lt;/a&gt; and its Applications&lt;/em&gt;,&lt;br /&gt;McGraw-Hill, New York, 1965.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="Brigham"&gt;19&lt;/a&gt;&lt;dd&gt;E.&amp;nbsp;O. Brigham,&lt;br /&gt;&lt;em&gt;The &lt;a href="http://www.treasure-troves.com/math/fastfouriertransform.php"&gt;Fast Fourier Transform&lt;/a&gt;&lt;/em&gt;,&lt;br /&gt;Prentice-Hall, Inc., Englewood Cliffs, NJ, 1974.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="Kay88"&gt;20&lt;/a&gt;&lt;dd&gt;S.&amp;nbsp;M. Kay,&lt;br /&gt;&lt;em&gt;Modern Spectral Estimation&lt;/em&gt;,&lt;br /&gt;Prentice-Hall, Inc., Englewood Cliffs, NJ, 1988.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="Papoulis"&gt;21&lt;/a&gt;&lt;dd&gt;A.&amp;nbsp;Papoulis,&lt;br /&gt;&lt;em&gt;Signal Analysis&lt;/em&gt;,&lt;br /&gt;McGraw-Hill, New York, 1977.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="DSPFirst"&gt;22&lt;/a&gt;&lt;dd&gt;J.&amp;nbsp;H. McClellan, R.&amp;nbsp;W. Schafer, and M.&amp;nbsp;A. Yoder,&lt;br /&gt;&lt;em&gt;&lt;a href="http://www.dsptutor.freeuk.com/default.php"&gt;DSP&lt;/a&gt; First: A Multimedia Approach&lt;/em&gt;,&lt;br /&gt;Prentice-Hall, Englewood Cliffs, NJ, 1998,&lt;br /&gt;TK5102.M388.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="RoadsMM"&gt;23&lt;/a&gt;&lt;dd&gt;C.&amp;nbsp;Roads, Ed.,&lt;br /&gt;&lt;em&gt;The Music Machine&lt;/em&gt;,&lt;br /&gt;MIT Press, Cambridge, MA, 1989.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="HelmholtzOrig"&gt;24&lt;/a&gt;&lt;dd&gt;H.&amp;nbsp;L.&amp;nbsp;F. von Helmholtz,&lt;br /&gt;&lt;em&gt;Die Lehre von den Tonempfindungen als Physiologische Grundlage&#10; f&amp;uuml;r die Theorie der Musik&lt;/em&gt;,&lt;br /&gt;F. Vieweg und Sohn, Braunschweig, 1863.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="Roads96"&gt;25&lt;/a&gt;&lt;dd&gt;C.&amp;nbsp;Roads,&lt;br /&gt;&lt;em&gt;The Computer Music Tutorial&lt;/em&gt;,&lt;br /&gt;MIT Press, Cambridge, MA, 1996.&lt;p&gt;&lt;/p&gt;&lt;dt&gt;&lt;a name="FletcherAndRossing98"&gt;26&lt;/a&gt;&lt;dd&gt;N.&amp;nbsp;H. Fletcher and T.&amp;nbsp;D. Rossing,&lt;br /&gt;&lt;em&gt;The Physics of Musical Instruments, Second Edition&lt;/em&gt;,&lt;br /&gt;Springer Verlag, New York, 1998,&lt;br /&gt;485 illustrations, hardcover, 69.95 USD direct from Springer.&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dl&gt;&lt;p&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/phase_delay_group"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;Next page &amp;gt;&amp;gt;&lt;/a&gt;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>About this document</title><link>https://technick.net/guides/theory/dft/about_this_document/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/about_this_document/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;blockquote&gt;&lt;h1&gt;&lt;a name="SECTION001500000000000000000"&gt;About this document ...&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;This document is a new HTML formatted version published by permission of:&lt;br /&gt;&lt;br /&gt;"Music 320 Background Reader" by Julius O. Smith III, (Course Background Reader, Music 320). &#10;Copyright &amp;copy; 2001-01-02 by &lt;a href="https://ccrma.stanford.edu/~jos//" target="_blank"&gt; Julius O. Smith III.&lt;/a&gt; - Center for Computer Research in Music and Acoustics (CCRMA), Department of Electrical Engineering, &lt;a href="http://www.stanford.edu/" target="_blank"&gt;Stanford University&lt;/a&gt;.&lt;br /&gt;&lt;/p&gt;&lt;p&gt;&lt;h4&gt;This document is also available in other formats, see &lt;a href="https://ccrma.stanford.edu/~jos//" target="_blank"&gt; here&lt;/a&gt;&lt;/h4&gt;&lt;/p&gt;&lt;p&gt;&lt;h4&gt;Notes from original HTML document (&lt;a href="https://ccrma.stanford.edu/~jos//" target="_blank"&gt;https://ccrma.stanford.edu/~jos//&lt;/a&gt;):&lt;/h4&gt; &lt;/p&gt;&lt;p&gt;This document was generated using the&lt;font color="blue"&gt;&lt;strong&gt;LaTeX&lt;/strong&gt;2&lt;tt&gt;HTML&lt;/tt&gt;&lt;/font&gt; translator Version 99.2beta6 (1.42)(patched)&lt;/p&gt;&lt;p&gt;Copyright &amp;copy; 1993, 1994, 1995, 1996,&lt;font color="blue"&gt;Nikos Drakos&lt;/font&gt;, &#10;Computer Based Learning Unit, University of Leeds.&lt;br /&gt;Copyright &amp;copy; 1997, 1998, 1999, 2000&lt;font color="blue"&gt;Ross Moore&lt;/font&gt;, &#10;Mathematics y, Sydney.&lt;ul&gt;&lt;li&gt;The &lt;strong&gt;Makefiles&lt;/strong&gt; and &lt;strong&gt;.latex2html-init&lt;/strong&gt; file used to generate this website are available at&lt;font color="blue"&gt;&lt;b&gt;https://ccrma.stanford.edu/~jos//webpub/&lt;/b&gt;&lt;/font&gt;.&lt;/li&gt;&lt;li&gt;Hypertext links installed from a&#10;&#9; &lt;font color="blue"&gt;master glossary&lt;/font&gt; prepared using the &lt;a href="http://www.opendictionary.org/default.php"&gt;&lt;i&gt;&lt;font color="blue"&gt;&lt;b&gt;Open Dictionary&lt;/b&gt;&lt;/font&gt;&lt;/i&gt;&lt;/a&gt;.&lt;/li&gt;&lt;/ul&gt;&lt;/p&gt;&lt;p align="center"&gt;&lt;font size="2"&gt;&lt;b&gt;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;&amp;lt;&amp;lt; Previous page&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/r320"&gt;TOC&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;a href="https://technick.net/guides/theory/dft/dft_index"&gt;INDEX&lt;/a&gt;&amp;nbsp;&amp;nbsp;&lt;/b&gt;&lt;/font&gt;&lt;/p&gt;&lt;/blockquote&gt;</description></item><item><title>Footnotes</title><link>https://technick.net/guides/theory/dft/footnode/</link><pubDate>Sun, 01 Mar 1998 00:00:00 +0000</pubDate><guid>https://technick.net/guides/theory/dft/footnode/</guid><description>&lt;p style="background-color:#FFFFAA;border:1px solid red;padding:0.5em;"&gt;&lt;strong&gt;NOTE: THIS DOCUMENT IS OBSOLETE, PLEASE CHECK THE NEW VERSION:&lt;/strong&gt; "&lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/mdft/"&gt;Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications --- Second Edition&lt;/a&gt;", by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt;, &lt;a href="http://www.w3k.org/books/"&gt;W3K Publishing&lt;/a&gt;, 2007, ISBN 978-0-9745607-4-8. - Copyright &amp;#169; &lt;i&gt;2017-09-28&lt;/i&gt; by &lt;a href="http://ccrma.stanford.edu/&amp;#126;jos/"&gt; Julius O. Smith III&lt;/a&gt; - &lt;a href="http://ccrma.stanford.edu/"&gt;Center for Computer Research in Music and Acoustics (CCRMA),&lt;/a&gt; &lt;a href="http://www.stanford.edu/"&gt; Stanford University&lt;/a&gt;&lt;/p&gt;&#10;&lt;dl&gt;&lt;dt&gt;&lt;a name="foot2492"&gt;... sample.&lt;/a&gt;&lt;a name="foot2492" href="https://technick.net/guides/theory/dft/mathematics_dft#tex2html7"&gt;&lt;sup&gt;1.1&lt;/sup&gt;&lt;/a&gt;&lt;dd&gt;Note that the definition of&lt;img width="26" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img54.png" alt="$x()$" /&gt; has changed unless the &lt;a href="https://technick.net/guides/theory/dft/shannon_s_sampling_theorem"&gt;sampling rate&lt;/a&gt; &lt;img width="19" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img55.png" alt="$f_s$" /&gt; really is 1, and the&#10;definition of &lt;img width="31" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img56.png" alt="$X()$" /&gt; has changed no matter what the sampling rate is, since&#10;when &lt;img width="45" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img48.png" alt="$T=1$" /&gt;, &lt;!-- MATH&#10; $\omega_k =2\pi k/N$&#10; --&gt;&lt;img width="91" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img57.png" alt="$\" mega="" pi="" n="" /&gt;, not &lt;img width="13" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img53.png" alt="$k$" /&gt;.&lt;pre&gt;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&lt;/pre&gt;&lt;dt&gt;&lt;a name="foot2945"&gt;...&#10;unknowns.&lt;/a&gt;&lt;a name="foot2945" href="https://technick.net/guides/theory/dft/factoring_polynomial_with#tex2html8"&gt;&lt;sup&gt;2.1&lt;/sup&gt;&lt;/a&gt;&lt;dd&gt;''Linear'' in this context means that the unknowns are&#10;multiplied only by constants--they may not be multiplied by each other or&#10;raised to any power other than &lt;img width="12" height="13" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img78.png" alt="$1$" /&gt; (e.g., not squared or cubed or raised to&#10;the &lt;img width="28" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img87.png" alt="$1/5$" /&gt; power). Linear systems of &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; equations in &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; unknowns are very&#10;easy to solve compared to &lt;i&gt;nonlinear&lt;/i&gt; systems of &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; equations in &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt;unknowns. For example, &lt;a href="http://www.mathworks.com/access/helpdesk/help/techdoc/basics/getstarted.shtml"&gt;Matlab&lt;/a&gt; or &lt;a href="https://technick.net/guides/theory/dft/sidebar_mathematica"&gt;Mathematica&lt;/a&gt; can easily handle them. You&#10;learn all about this in a course on &lt;i&gt;Linear Algebra&lt;/i&gt; which is highly&#10;recommended for anyone interested in getting involved with signal&#10;processing. Linear algebra also teaches you all about &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/matrices"&gt;matrices&lt;/a&gt;&lt;/i&gt; which&#10;we will only introduce briefly in this course.&lt;p&gt;To give you a simple first exposure, here's how the linear system of equations&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{eqnarray*}&#10;a x_1 + b x_2 &amp;=&amp; c \\&#10;d x_1 + e x_2 &amp;=&amp; f&#10;\end{eqnarray*}&#10; --&gt;&lt;img width="134" height="56" border="0" src="https://technick.net/img/guide_dft/img88.png" alt="\" egin="" qnarray="" a="" b="" d="" f="" nd="" qnarray="" /&gt;&lt;br clear="ALL" /&gt;&lt;/div&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;looks in &lt;a href="https://technick.net/guides/theory/dft/matrices"&gt;matrix&lt;/a&gt; form:&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\left[\begin{array}{cc} a &amp; b \\d &amp; e \end{array}\right] \left[\begin{array}{c} x_1 \\x_2 \end{array}\right] = \left[\begin{array}{c} c \\f \end{array}\right]&#10;\end{displaymath}&#10; --&gt;&lt;img width="190" height="49" border="0" src="https://technick.net/img/guide_dft/img89.png" alt="\" egin="" isplaymath="" eft="" egin="" rray="" c="" a="" b="" e="" nd="" rray="" ight="" ray="" ight="" eft="" egin="" rray="" c="" end="" rray="" ight="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;and this can be written in higher level form as&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;{\boldmath A}\underline{x}= \underline{b}&#10;\end{displaymath}&#10; --&gt;&lt;img width="55" height="30" border="0" src="https://technick.net/img/guide_dft/img90.png" alt="\" egin="" isplaymath="" oldmath="" nderline="" underline="" b="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;where &lt;img width="16" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img91.png" alt="${\" oldmath="" /&gt; denotes the two-by-two matrix above, and &lt;img width="13" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img21.png" alt="$\" nderline="" /&gt; and &lt;img width="11" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img92.png" alt="$\" nderline="" b="" /&gt;denotes the two-by-one vectors. The solution to this equation&#10;is then&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\underline{x}= {\boldmath A}^{-1}\underline{b}= \left[\begin{array}{cc} a &amp; b \\d &amp; e \end{array}\right]^{-1}\left[\begin{array}{c} c \\f \end{array}\right]&#10;\end{displaymath}&#10; --&gt;&lt;img width="232" height="53" border="0" src="https://technick.net/img/guide_dft/img93.png" alt="\" egin="" isplaymath="" nderline="" boldmath="" nderline="" b="" eft="" egin="" right="" eft="" egin="" rray="" c="" end="" rray="" ight="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;The general two-by-two matrix inverse is given by&lt;br /&gt;&lt;p&gt;&lt;/p&gt;&lt;div align="CENTER"&gt;&lt;!-- MATH&#10; \begin{displaymath}&#10;\left[\begin{array}{cc} a &amp; b \\d &amp; e \end{array}\right]^{-1} = \frac{1}{ae-bd}\left[\begin{array}{cc} e &amp; -b \\-d &amp; a \end{array}\right]&#10;\end{displaymath}&#10; --&gt;&lt;img width="266" height="53" border="0" src="https://technick.net/img/guide_dft/img94.png" alt="\" egin="" isplaymath="" eft="" egin="" rray="" c="" a="" b="" e="" nd="" rray="" ight="" d="" eft="" egin="" rray="" c="" b="b" d="" a="" nd="" rray="" ight="" nd="" isplaymath="" /&gt;&lt;/div&gt;&lt;br clear="ALL" /&gt;&lt;p&gt;&lt;/p&gt;and the inverse exists whenever &lt;img width="54" height="29" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img95.png" alt="$ae-bd$" /&gt; (which is called the &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/matrices"&gt;determinant&lt;/a&gt;&lt;/i&gt; of the matrix &lt;img width="16" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img91.png" alt="${\" oldmath="" /&gt;) is nonzero. For larger matrices,&#10;numerical algorithms are used to invert matrices, such as used by Matlab&#10;based on LINPACK [&lt;a href="https://technick.net/guides/theory/dft/bibliography#Golub"&gt;2&lt;/a&gt;]. An initial introduction to matrices&#10;and linear algebra can be found in [&lt;a href="https://technick.net/guides/theory/dft/bibliography#Noble"&gt;3&lt;/a&gt;].&lt;pre&gt;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&lt;/pre&gt;&lt;dt&gt;&lt;a name="foot2796"&gt;...&#10;numbers&lt;/a&gt;&lt;a name="foot2796" href="https://technick.net/guides/theory/dft/complex_roots#tex2html10"&gt;&lt;sup&gt;2.2&lt;/sup&gt;&lt;/a&gt;&lt;dd&gt;multiplication, addition, division, distributivity of&#10;multiplication over addition, commutativity of multiplication and&#10;addition.&lt;pre&gt;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&lt;/pre&gt;&lt;dt&gt;&lt;a name="foot2922"&gt;... numerical:&lt;/a&gt;&lt;a name="foot2922" href="https://technick.net/guides/theory/dft/numerical_tools_matlab#tex2html12"&gt;&lt;sup&gt;2.3&lt;/sup&gt;&lt;/a&gt;&lt;dd&gt;unless you have&#10;the optional Maple package for symbolic mathematical manipulation&lt;pre&gt;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&lt;/pre&gt;&lt;dt&gt;&lt;a name="foot3876"&gt;...&#10;transients.&lt;/a&gt;&lt;a name="foot3876" href="https://technick.net/guides/theory/dft/further_notes_differentiabi#tex2html13"&gt;&lt;sup&gt;3.1&lt;/sup&gt;&lt;/a&gt;&lt;dd&gt;One joke along these lines, due, I'm told, to&#10;Professor Bracewell, is that ''since the telephone is bandlimited to&#10;3kHz, and since bandlimited signals cannot be time limited, it follows&#10;that one cannot hang up the telephone''.&lt;pre&gt;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&lt;/pre&gt;&lt;dt&gt;&lt;a name="foot5228"&gt;...&#10;delay&lt;/a&gt;&lt;a name="foot5228" href="https://technick.net/guides/theory/dft/logarithms_negative_imagina#tex2html14"&gt;&lt;sup&gt;4.1&lt;/sup&gt;&lt;/a&gt;&lt;dd&gt;Group delay and phase delay are covered in the CCRMApublication [&lt;a href="https://technick.net/guides/theory/dft/bibliography#JOSFP"&gt;1&lt;/a&gt;] as well as in standard signal processing&#10;references [&lt;a href="https://technick.net/guides/theory/dft/bibliography#RabinerAndGold"&gt;7&lt;/a&gt;]. In the case of an AM or FM&#10;broadcast signal which is passed through a filter, the &lt;i&gt;carrier&#10;wave&lt;/i&gt; is delayed by the &lt;i&gt;phase delay&lt;/i&gt; of the filter, while the&lt;i&gt;modulation signal&lt;/i&gt; is delayed by the &lt;i&gt;group delay&lt;/i&gt; of the&#10;filter. In the case of additive synthesis, group delay applies&#10;to the &lt;a href="https://technick.net/guides/theory/dft/logarithms"&gt;amplitude&lt;/a&gt; envelope of each sinusoidal oscillator, while&#10;the phase delay applies to the sinusoidal oscillator waveform itself.&lt;pre&gt;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&lt;/pre&gt;&lt;dt&gt;&lt;a name="foot4779"&gt;... bel&lt;/a&gt;&lt;a name="foot4779" href="https://technick.net/guides/theory/dft/decibels#tex2html15"&gt;&lt;sup&gt;4.2&lt;/sup&gt;&lt;/a&gt;&lt;dd&gt;The ''bel'' is named after Alexander&#10;Graham Bell, the inventor of the telephone.&lt;pre&gt;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&lt;/pre&gt;&lt;dt&gt;&lt;a name="foot5230"&gt;... intensity,&lt;/a&gt;&lt;a name="foot5230" href="https://technick.net/guides/theory/dft/decibels#tex2html16"&gt;&lt;sup&gt;4.3&lt;/sup&gt;&lt;/a&gt;&lt;dd&gt;&lt;i&gt;Intensity&lt;/i&gt;&lt;a name="5347"&gt;&lt;/a&gt; is&#10;physically &lt;i&gt;power per unit area&lt;/i&gt;. Bels may also be defined in&#10;terms of &lt;i&gt;energy&lt;/i&gt;&lt;a name="5349"&gt;&lt;/a&gt;, or &lt;i&gt;power&lt;/i&gt;&lt;a name="5351"&gt;&lt;/a&gt; which is energy per unit time.&#10;Since sound is always measured over some&lt;i&gt;area&lt;/i&gt; by a microphone diaphragm, its physical power is conventionally&#10;normalized by area, giving intensity. Similarly, the &lt;i&gt;force&lt;/i&gt; applied&#10;by sound to a microphone diaphragm is normalized by area to give&lt;i&gt;pressure&lt;/i&gt;&lt;a name="5353"&gt;&lt;/a&gt; (force per unit area).&lt;pre&gt;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&lt;/pre&gt;&lt;dt&gt;&lt;a name="foot5261"&gt;...&lt;img width="66" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img371.png" alt="$ pressure$" /&gt;&lt;/a&gt;&lt;a name="foot5261" href="https://technick.net/guides/theory/dft/db_spl#tex2html17"&gt;&lt;sup&gt;4.4&lt;/sup&gt;&lt;/a&gt;&lt;dd&gt;The bar was originally defined as&#10;&#9;&#9;$10^-6$ atmospheres, but now it is defined to be exactly&#10;&#9;&#9;1 $dyne/cm^2$.&lt;pre&gt;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&lt;/pre&gt;&lt;dt&gt;&lt;a name="foot5269"&gt;...&#10;equivalents&lt;/a&gt;&lt;a name="foot5269" href="https://technick.net/guides/theory/dft/db_spl#tex2html18"&gt;&lt;sup&gt;4.5&lt;/sup&gt;&lt;/a&gt;&lt;dd&gt;Adapted from S. S. Stevens, F. Warshofsky, and the&#10;Editors of Time-Life Books, &lt;i&gt;Sound and Hearing&lt;/i&gt;, Life Science Library,&#10;Time-Life Books, Alexandria, VA, 1965, p. 173.&lt;pre&gt;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&lt;/pre&gt;&lt;dt&gt;&lt;a name="foot4955"&gt;...&#10;distortion'').&lt;/a&gt;&lt;a name="foot4955" href="https://technick.net/guides/theory/dft/dynamic_range#tex2html22"&gt;&lt;sup&gt;4.6&lt;/sup&gt;&lt;/a&gt;&lt;dd&gt;Companders (compresser-expanders) essentially&#10;''turn down'' the signal gain when it is ''loud'' and ''turn up'' the&#10;gain when it is ''quiet''. As long as the input-output curve is&#10;monotonic (such as a log characteristic), the &lt;a href="https://technick.net/guides/theory/dft/dynamic_range"&gt;dynamic-range&lt;/a&gt;compression can be undone (expanded).&lt;pre&gt;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&lt;/pre&gt;&lt;dt&gt;&lt;a name="foot5273"&gt;...&#10;0.&lt;/a&gt;&lt;a name="foot5273" href="https://technick.net/guides/theory/dft/binary_integer_fixed_point#tex2html23"&gt;&lt;sup&gt;4.7&lt;/sup&gt;&lt;/a&gt;&lt;dd&gt;Computers use bits, as opposed to the more familiar&#10;decimal digits, because they are more convenient to implement in&#10;digital hardware. For example, the &lt;i&gt;decimal numbers&lt;/i&gt;&lt;a name="5423"&gt;&lt;/a&gt; 0, 1, 2, 3,&#10;4, 5 become, in binary format, 0, 1, 10, 11, 100, 101. Each&lt;i&gt;bit&lt;/i&gt; position in binary notation corresponds to a power of 2,&#10;e.g., &lt;!-- MATH&#10; $5 = 1\cdot 2^2 + 0\cdot 2^1 + 1\cdot 2^0$&#10; --&gt;&lt;img width="176" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img382.png" alt="$5 = 1\" dot="" dot="" dot="" /&gt;; while each&lt;i&gt;digit&lt;/i&gt; position in decimal notation corresponds to a power of&#10;10, e.g., &lt;!-- MATH&#10; $123 = 1\cdot 10^2 + 2\cdot 10^1 + 3\cdot 10^0$&#10; --&gt;&lt;img width="216" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img383.png" alt="$123 = 1\" dot="" dot="" dot="" /&gt;. The term&#10;''digit&lt;a name="5424"&gt;&lt;/a&gt;'' comes from the same word meaning ''finger.'' Since&#10;we have ten fingers (digits), the term ''digit'' technically should be&#10;associated only with decimal notation, but in practice it is used for&#10;others as well. Other popular number systems in computers include&lt;i&gt;octal&lt;/i&gt;&lt;a name="5426"&gt;&lt;/a&gt; which is base 8 (rarely seen any more, but still&#10;specifiable in any C/C++ program by using a leading zero, e.g., &lt;!-- MATH&#10; $0755&#10;= 7\cdot 8^2 + 5 \cdot 8^1 + 5\cdot 8^0 = 493$&#10; --&gt;&lt;img width="245" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img384.png" alt="$0755&#10;= 7\" dot="" dot="" dot="" /&gt; decimal = 111,101,101&#10;binary), and &lt;i&gt;hexadecimal&lt;/i&gt;&lt;a name="5428"&gt;&lt;/a&gt; (or simply ''hex&lt;a name="5429"&gt;&lt;/a&gt;'') which is&#10;base 16 and which employs the letters A through F to yield 16 digits&#10;(specifiable in C/C++ by starting the number with ''0x'', e.g., 0x1ED&#10;= &lt;!-- MATH&#10; $1\cdot 16^2 + 15 \cdot 16^1 + 14\cdot 16^0 = 493$&#10; --&gt;&lt;img width="232" height="33" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img385.png" alt="$1\" dot="" dot="" dot="" /&gt; decimal =&#10;1,1110,1101 binary). Note, however, that the representation within&#10;the computer is still always binary; octal and hex are simply&#10;convenient &lt;i&gt;groupings&lt;/i&gt; of bits into sets of three bits (in octal)&#10;or four bits (in hex).&lt;pre&gt;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&lt;/pre&gt;&lt;dt&gt;&lt;a name="foot4992"&gt;... processors.&lt;/a&gt;&lt;a name="foot4992" href="https://technick.net/guides/theory/dft/binary_integer_fixed_point#tex2html24"&gt;&lt;sup&gt;4.8&lt;/sup&gt;&lt;/a&gt;&lt;dd&gt;This information is subject to change&#10;without notice. Check your local compiler documentation.&lt;pre&gt;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&lt;/pre&gt;&lt;dt&gt;&lt;a name="foot5280"&gt;...&#10;feedback&lt;/a&gt;&lt;a name="foot5280" href="https://technick.net/guides/theory/dft/how_many_bits#tex2html32"&gt;&lt;sup&gt;4.9&lt;/sup&gt;&lt;/a&gt;&lt;dd&gt;Normally, quantization error is computed as&#10;&lt;!-- MATH&#10; $e(n)=x(n)-{\hat x}(n)$&#10; --&gt;&lt;img width="136" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img419.png" alt="$e(n)=x(n)-{\" at="" /&gt;, where &lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img50.png" alt="$x(n)$" /&gt; is the signal being quantized, and &lt;!-- MATH&#10; ${\hat x}(n)&#10;= Q[x(n)]$&#10; --&gt;&lt;img width="109" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img420.png" alt="${\" at="" q="q" x="" /&gt; is the quantized value, obtained by rounding to the nearest&#10;representable amplitude. Filtered error feedback uses instead the formula&#10;&lt;!-- MATH&#10; ${\hat x}(n) = Q[x(n)+{\cal L}\{e(n-1)\}]$&#10; --&gt;&lt;img width="212" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img421.png" alt="${\" at="" q="q" x="" cal="" n-1="" /&gt;, where &lt;!-- MATH&#10; ${\cal L}\{\;\}$&#10; --&gt;&lt;img width="35" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img422.png" alt="${\" al="" /&gt; denotes a filtering&#10;operation which ''shapes'' the quantization &lt;a href="http://www.treasure-troves.com/physics/noise.php"&gt;noise&lt;/a&gt; spectrum. An excellent&#10;article on the use of round-off error feedback in audio &lt;a href="http://www.dsptutor.freeuk.com/dfilt1.php"&gt;digital filters&lt;/a&gt; is&#10;[&lt;a href="https://technick.net/guides/theory/dft/bibliography#Dattorro88"&gt;11&lt;/a&gt;].&lt;pre&gt;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&lt;/pre&gt;&lt;dt&gt;&lt;a name="foot5109"&gt;...&#10;''endianness'':&lt;/a&gt;&lt;a name="foot5109" href="https://technick.net/guides/theory/dft/when_do_we#tex2html33"&gt;&lt;sup&gt;4.10&lt;/sup&gt;&lt;/a&gt;&lt;dd&gt;Thanks to Bill Schottstaedt for help with this table.&lt;pre&gt;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&lt;/pre&gt;&lt;dt&gt;&lt;a name="foot5282"&gt;...,&lt;/a&gt;&lt;a name="foot5282" href="https://technick.net/guides/theory/dft/floating_point_numbers#tex2html35"&gt;&lt;sup&gt;4.11&lt;/sup&gt;&lt;/a&gt;&lt;dd&gt;The notation&lt;img width="37" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img429.png" alt="$[a,b)$" /&gt; denotes a &lt;i&gt;half-open interval&lt;/i&gt; which includes &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img192.png" alt="$a$" /&gt; but not &lt;img width="11" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img327.png" alt="$b$" /&gt;.&lt;pre&gt;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&lt;/pre&gt;&lt;dt&gt;&lt;a name="foot5127"&gt;....&lt;/a&gt;&lt;a name="foot5127" href="https://technick.net/guides/theory/dft/floating_point_numbers#tex2html36"&gt;&lt;sup&gt;4.12&lt;/sup&gt;&lt;/a&gt;&lt;dd&gt;Another term commonly heard for ''significand''&#10;is ''mantissa.'' However, this use of the term ''mantissa'' is not the same&#10;as its previous definition as the fractional part of a logarithm. We will&#10;therefore use only the term ''significand'' to avoid confusion.&lt;pre&gt;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&lt;/pre&gt;&lt;dt&gt;&lt;a name="foot5134"&gt;... bias.&lt;/a&gt;&lt;a name="foot5134" href="https://technick.net/guides/theory/dft/floating_point_numbers#tex2html37"&gt;&lt;sup&gt;4.13&lt;/sup&gt;&lt;/a&gt;&lt;dd&gt;By choosing&#10;the bias equal to half the numerical dynamic range of &lt;img width="17" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img431.png" alt="$E$" /&gt; (thus effectively&#10;inverting the sign bit of the exponent), it becomes easier to compare two&lt;a href="https://technick.net/guides/theory/dft/floating_point_numbers"&gt;floating-point numbers&lt;/a&gt; in hardware: the entire floating-point word can be&#10;treated by the hardware as one giant integer for numerical comparison&#10;purposes. This works because &lt;a href="https://technick.net/guides/theory/dft/negative_exponents"&gt;negative exponents&lt;/a&gt; correspond to&#10;floating-point numbers less than 1 in magnitude, while. positive exponents&#10;correspond to floating-point numbers greater than 1 in magnitude.&lt;pre&gt;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&lt;/pre&gt;&lt;dt&gt;&lt;a name="foot5146"&gt;... CODEC&lt;/a&gt;&lt;a name="foot5146" href="https://technick.net/guides/theory/dft/law_companding#tex2html38"&gt;&lt;sup&gt;4.14&lt;/sup&gt;&lt;/a&gt;&lt;dd&gt;CODEC&#10;is an acronym for ''COder/DECoder''.&lt;pre&gt;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&lt;/pre&gt;&lt;dt&gt;&lt;a name="foot6859"&gt;... (LTI&lt;/a&gt;&lt;a name="foot6859" href="https://technick.net/guides/theory/dft/sinusoids_at_same#tex2html41"&gt;&lt;sup&gt;5.1&lt;/sup&gt;&lt;/a&gt;&lt;dd&gt;A system &lt;img width="15" height="15" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img515.png" alt="$S$" /&gt; is said to be&lt;i&gt;linear&lt;/i&gt; if for any two input signals &lt;img width="39" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img516.png" alt="$x_1(t)$" /&gt; and &lt;img width="39" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img517.png" alt="$x_2(t)$" /&gt;, we have&#10;&lt;!-- MATH&#10; $S[x_1(t) + x_2(t)] = S[x_1(t)] + S[x_2(t)]$&#10; --&gt;&lt;img width="260" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img518.png" alt="$S[x_1(t) + x_2(t)] = S[x_1(t)] + S[x_2(t)]$" /&gt;. A system is said to be &lt;i&gt;time invariant&lt;/i&gt; if &lt;!-- MATH&#10; $S[x(t-\tau)] = y(t-\tau)$&#10; --&gt;&lt;img width="155" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img519.png" alt="$S[x(t-\" au="" t-\tau="" /&gt;, where &lt;!-- MATH&#10; $y(t)\isdef S[x(t)]$&#10; --&gt;&lt;img width="99" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img520.png" alt="$y(t)\" sdef="" t="" /&gt;.&#10;This subject is developed in detail in [&lt;a href="https://technick.net/guides/theory/dft/bibliography#JOSFP"&gt;1&lt;/a&gt;].&lt;pre&gt;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&lt;/pre&gt;&lt;dt&gt;&lt;a name="foot6860"&gt;... filter.&lt;/a&gt;&lt;a name="foot6860" href="https://technick.net/guides/theory/dft/constructive_destructive_in#tex2html42"&gt;&lt;sup&gt;5.2&lt;/sup&gt;&lt;/a&gt;&lt;dd&gt;Technically, this&#10;is the &lt;i&gt;feedforward comb filter&lt;/i&gt;, also called the ''inverse comb&#10;filter'' [&lt;a href="https://technick.net/guides/theory/dft/bibliography#SteiglitzText96"&gt;14&lt;/a&gt;]. The longer names are meant to distinguish&#10;it from the &lt;i&gt;feedback comb filter&lt;/i&gt; (defined as ''the'' comb filter in&#10;Dodge and Jerse [&lt;a href="https://technick.net/guides/theory/dft/bibliography#DodgeAndJerse85"&gt;15&lt;/a&gt;]). In the feedback comb filter, the&#10;delay output is fed &lt;i&gt;back&lt;/i&gt; around the delay line and summed with the&#10;delay input instead of the input being fed &lt;i&gt;forward&lt;/i&gt; around the delay&#10;line and summed with its output. The frequency response of the feedforward&#10;comb filter is the inverse of that of the feedback comb filter (one will&#10;cancel the effect of the other), hence the name ''inverse comb filter.''&#10;When the delay in the feedforward comb filter is varied slowly over time,&#10;the &lt;i&gt;flanger effect&lt;/i&gt; is obtained. Flanging was originally achieved by&#10;mixing the outputs of two LP record turntables and changing their relative&#10;speeds by alternately touching the ''flange'' of each turntable to slow it&#10;down.&lt;pre&gt;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&lt;/pre&gt;&lt;dt&gt;&lt;a name="foot6601"&gt;... name.&lt;/a&gt;&lt;a name="foot6601" href="https://technick.net/guides/theory/dft/constructive_destructive_in#tex2html45"&gt;&lt;sup&gt;5.3&lt;/sup&gt;&lt;/a&gt;&lt;dd&gt;While there is no reason it should be obvious&#10;at this point, the comb-filter gain varies in fact sinusoidally&#10;between &lt;img width="24" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img528.png" alt="$0.5$" /&gt; and &lt;img width="24" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img539.png" alt="$1.5$" /&gt;. It looks more "comb" like on a &lt;a href="https://technick.net/guides/theory/dft/decibels"&gt;dB&lt;/a&gt; amplitude&#10;scale, which is more appropriate for audio applications.&lt;pre&gt;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&lt;/pre&gt;&lt;dt&gt;&lt;a name="foot6602"&gt;... dc&lt;/a&gt;&lt;a name="foot6602" href="https://technick.net/guides/theory/dft/constructive_destructive_in#tex2html46"&gt;&lt;sup&gt;5.4&lt;/sup&gt;&lt;/a&gt;&lt;dd&gt;''dc'' means ''direct current'' and is an&#10;electrical engineering term for ''frequency &lt;img width="12" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img38.png" alt="$0$" /&gt;''.&lt;pre&gt;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&lt;/pre&gt;&lt;dt&gt;&lt;a name="foot6863"&gt;...&#10;dB.&lt;/a&gt;&lt;a name="foot6863" href="https://technick.net/guides/theory/dft/audio_decay_time#tex2html49"&gt;&lt;sup&gt;5.5&lt;/sup&gt;&lt;/a&gt;&lt;dd&gt;Recall that a gain factor &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img546.png" alt="$g$" /&gt; is converted to &lt;i&gt;&lt;a href="https://technick.net/guides/theory/dft/decibels"&gt;decibels&lt;/a&gt;&lt;/i&gt;(dB) by the formula &lt;!-- MATH&#10; $20\log_{10}(g)$&#10; --&gt;&lt;img width="77" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img547.png" alt="$20\" og="" /&gt;.&lt;pre&gt;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&lt;/pre&gt;&lt;dt&gt;&lt;a name="foot6869"&gt;... signal.&lt;/a&gt;&lt;a name="foot6869" href="https://technick.net/guides/theory/dft/analytic_signal_hilbert#tex2html51"&gt;&lt;sup&gt;5.6&lt;/sup&gt;&lt;/a&gt;&lt;dd&gt;In complex variables, ''analytic'' just&#10;means differentiable of all orders. Therefore, one would expect an&#10;''&lt;a href="https://technick.net/guides/theory/dft/analytic_signal_hilbert"&gt;analytic signal&lt;/a&gt;'' to simply be any signal which is differentiable of all&#10;orders at any point in time, i.e., one that admits a fully valid Taylor&#10;expansion about any point in time. However, &lt;i&gt;all&lt;/i&gt; bandimited signals&#10;(being sums of finite-frequency &lt;a href="https://technick.net/guides/theory/dft/why_sinusoids_are"&gt;sinusoids&lt;/a&gt;) are analytic in the&#10;complex-variables sense. Therefore, the signal processing term ''analytic&#10;signal'' is somewhat of a misnomer. It is included in this chapter only&#10;because it is a commonly used term in engineering practice.&lt;pre&gt;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&lt;/pre&gt;&lt;dt&gt;&lt;a name="foot6694"&gt;... shift.&lt;/a&gt;&lt;a name="foot6694" href="https://technick.net/guides/theory/dft/analytic_signal_hilbert#tex2html52"&gt;&lt;sup&gt;5.7&lt;/sup&gt;&lt;/a&gt;&lt;dd&gt;This operation is actually&#10;used in some real-world AM and FM radio receivers (particularly in digital&#10;radio receivers). The signal comes in centered about a high ''carrier&#10;frequency'' (such as 101 MHz for radio station FM 101), so it looks very&#10;much like a sinusoid at frequency 101 MHz. (The frequency modulation only&#10;varies the carrier frequency in a relatively tiny interval about 101 MHz.&#10;The total FM bandwidth including all the FM ''sidebands'' is about 100 kHz.&#10;AM bands are only 10kHz wide.) By delaying the signal by 1/4 cycle, a good&#10;approximation to the imaginary part of the analytic signal is created, and&#10;its instantaneous amplitude and frequency are then simple to compute from&#10;the analytic signal.&lt;pre&gt;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&lt;/pre&gt;&lt;dt&gt;&lt;a name="foot6721"&gt;...&lt;!-- MATH&#10; $y(t)\approx&#10;A(t)\sin(\omega t)$&#10; --&gt;&lt;img width="133" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img614.png" alt="$y(t)\" pprox="" sin="" mega="" /&gt;&lt;/a&gt;&lt;a name="foot6721" href="https://technick.net/guides/theory/dft/analytic_signal_hilbert#tex2html54"&gt;&lt;sup&gt;5.8&lt;/sup&gt;&lt;/a&gt;&lt;dd&gt;If &lt;img width="34" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img613.png" alt="$A(t)$" /&gt; were constant, this would be&#10;exact.&lt;pre&gt;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&lt;/pre&gt;&lt;dt&gt;&lt;a name="foot6871"&gt;...demodulation&lt;/a&gt;&lt;a name="foot6871" href="https://technick.net/guides/theory/dft/analytic_signal_hilbert#tex2html55"&gt;&lt;sup&gt;5.9&lt;/sup&gt;&lt;/a&gt;&lt;dd&gt;&lt;i&gt;Demodulation&lt;/i&gt; is the process of&#10;recovering the modulation signal. For amplitude modulation (AM), the&#10;modulated signal is of the form &lt;!-- MATH&#10; $y(t) = A(t) \cos(\omega_c t)$&#10; --&gt;&lt;img width="140" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img616.png" alt="$y(t) = A(t) \" os="" mega="" /&gt;,&#10;where &lt;img width="21" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img617.png" alt="$\" mega="" /&gt; is the ''carrier frequency'', &lt;!-- MATH&#10; $A(t)=[1+\mu x(t)]\geq 0$&#10; --&gt;&lt;img width="158" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img618.png" alt="$A(t)=[1+\" u="u" t="" eq="" /&gt; is the amplitude envelope (modulation), &lt;img width="31" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img357.png" alt="$x(t)$" /&gt; is the modulation&#10;signal we wish to recover (the audio signal being broadcast in the case of&#10;AM radio), and &lt;img width="14" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img5.png" alt="$\" u="u" /&gt; is the modulation index for AM.&lt;pre&gt;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&lt;/pre&gt;&lt;dt&gt;&lt;a name="foot6872"&gt;...&lt;img width="29" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img640.png" alt="$y(\" dot="" /&gt;&lt;/a&gt;&lt;a name="foot6872" href="https://technick.net/guides/theory/dft/why_generalized_complex#tex2html57"&gt;&lt;sup&gt;5.10&lt;/sup&gt;&lt;/a&gt;&lt;dd&gt;The notation &lt;img width="34" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img641.png" alt="$y(n)$" /&gt; denotes a single &lt;i&gt;sample&lt;/i&gt; of&#10;the signal &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img13.png" alt="$y$" /&gt; at sample &lt;img width="14" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img51.png" alt="$n$" /&gt;, while the notation &lt;img width="29" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img640.png" alt="$y(\" dot="" /&gt; or simply &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img13.png" alt="$y$" /&gt;denotes the &lt;i&gt;entire signal&lt;/i&gt; for all time.&lt;pre&gt;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&lt;/pre&gt;&lt;dt&gt;&lt;a name="foot6774"&gt;... projection&lt;/a&gt;&lt;a name="foot6774" href="https://technick.net/guides/theory/dft/why_generalized_complex#tex2html58"&gt;&lt;sup&gt;5.11&lt;/sup&gt;&lt;/a&gt;&lt;dd&gt;The&#10;coefficient of projection of a signal &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img13.png" alt="$y$" /&gt; onto another signal &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; can be&#10;thought of as a measure of how much of &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; is present in &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img13.png" alt="$y$" /&gt;. We will&#10;consider this topic in some detail later on.&lt;pre&gt;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&lt;/pre&gt;&lt;dt&gt;&lt;a name="foot8632"&gt;...&lt;img width="13" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img21.png" alt="$\" nderline="" /&gt;&lt;/a&gt;&lt;a name="foot8632" href="https://technick.net/guides/theory/dft/signals_vectors#tex2html65"&gt;&lt;sup&gt;6.1&lt;/sup&gt;&lt;/a&gt;&lt;dd&gt;We'll use an underline to emphasize the vector&#10;interpretation, but there is no difference between &lt;img width="13" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img12.png" alt="$x$" /&gt; and &lt;img width="13" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img21.png" alt="$\" nderline="" /&gt;. For&#10;purposes of this course, a &lt;i&gt;signal&lt;/i&gt; is the same thing as a vector.&lt;pre&gt;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&lt;/pre&gt;&lt;dt&gt;&lt;a name="foot8637"&gt;... vector.&lt;/a&gt;&lt;a name="foot8637" href="https://technick.net/guides/theory/dft/signal_metrics#tex2html70"&gt;&lt;sup&gt;6.2&lt;/sup&gt;&lt;/a&gt;&lt;dd&gt;You might wonder why the norm of &lt;img width="13" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img21.png" alt="$\" nderline="" /&gt; is&#10;not written as &lt;!-- MATH&#10; $|\underline{x}|$&#10; --&gt;&lt;img width="22" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img722.png" alt="$\" ert\underline="" vert="" /&gt;. There would be no problem with this&#10;since &lt;!-- MATH&#10; $|\underline{x}|$&#10; --&gt;&lt;img width="22" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img722.png" alt="$\" ert\underline="" vert="" /&gt; is undefined. However, the historically adopted notation is&#10;instead &lt;!-- MATH&#10; $\|\underline{x}\|$&#10; --&gt;&lt;img width="22" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img722.png" alt="$\" ert\underline="" vert="" /&gt;.&lt;pre&gt;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&lt;/pre&gt;&lt;dt&gt;&lt;a name="foot11377"&gt;... filter.&lt;/a&gt;&lt;a name="foot11377" href="https://technick.net/guides/theory/dft/frequencies_cracks#tex2html79"&gt;&lt;sup&gt;7.1&lt;/sup&gt;&lt;/a&gt;&lt;dd&gt;More precisely,&#10;&lt;!-- MATH&#10; $\mbox{{\tt DFT}}_k()$&#10; --&gt;&lt;img width="49" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img958.png" alt="$\" box="" t="tt" ft="" /&gt; is a length &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; finite-impulse-response (FIR) digital&#10;filter. See &amp;sect;&lt;a href="https://technick.net/guides/theory/dft/appendix_a_linear#sec:LTI"&gt;8.7&lt;/a&gt; for related discussion.&lt;pre&gt;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&lt;/pre&gt;&lt;dt&gt;&lt;a name="foot11378"&gt;... computed,&lt;/a&gt;&lt;a name="foot11378" href="https://technick.net/guides/theory/dft/frequencies_cracks#tex2html80"&gt;&lt;sup&gt;7.2&lt;/sup&gt;&lt;/a&gt;&lt;dd&gt;We call&#10;this the&lt;i&gt;digital sinc function&lt;/i&gt; to distinguish it from the &lt;i&gt;sinc function&lt;/i&gt;&lt;a name="11500"&gt;&lt;/a&gt; &#10;&lt;!-- MATH&#10; $\mbox{sinc}(x)\isdeftext \sin(\pi x)/(\pi x)$&#10; --&gt;&lt;img width="163" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img959.png" alt="$\" box="" inc="" isdeftext="" in="" i="" i="" /&gt;.&lt;pre&gt;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&lt;/pre&gt;&lt;dt&gt;&lt;a name="foot11388"&gt;... element&lt;/a&gt;&lt;a name="foot11388" href="https://technick.net/guides/theory/dft/matrices#tex2html83"&gt;&lt;sup&gt;7.3&lt;/sup&gt;&lt;/a&gt;&lt;dd&gt;We are now using &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img63.png" alt="$j$" /&gt; as an integer counter,&#10;not as &lt;img width="38" height="35" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img123.png" alt="$\" qrt="" /&gt;. This is standard notational practice.&lt;pre&gt;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&lt;/pre&gt;&lt;dt&gt;&lt;a name="foot11391"&gt;...&#10;argument.&lt;/a&gt;&lt;a name="foot11391" href="https://technick.net/guides/theory/dft/matrix_multiplication#tex2html84"&gt;&lt;sup&gt;7.4&lt;/sup&gt;&lt;/a&gt;&lt;dd&gt;Alternatively, it can be extended to the complex case by&#10;writing &lt;!-- MATH&#10; ${A}^{\ast }B \isdef [\ldots&lt;b_j,{a}^{\ast }_i&gt;\ldots]$&#10; --&gt;&lt;img width="182" height="39" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1018.png" alt="${A}^{\" st="" b="" sdef="" dots="" t="" b="" a="a" ast="" i="" t="" dots="" /&gt;, so that&lt;img width="23" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1001.png" alt="${A}^{\" st="" /&gt; includes a conjugation of the elements of &lt;img width="16" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img485.png" alt="$A$" /&gt;. This&#10;difficulty arises from the fact that &lt;a href="https://technick.net/guides/theory/dft/matrix_multiplication"&gt;matrix multiplication&lt;/a&gt; is really&#10;defined without consideration of conjugation or transposition at all,&#10;making it unwieldy to express in terms of &lt;a href="https://technick.net/guides/theory/dft/inner_product"&gt;inner products&lt;/a&gt; in the complex&#10;case, even though that is perhaps the most fundamental interpretation&#10;of a &lt;a href="https://technick.net/guides/theory/dft/matrix_multiplication"&gt;matrix multiply&lt;/a&gt;.&lt;pre&gt;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&lt;/pre&gt;&lt;dt&gt;&lt;a name="foot12778"&gt;...&#10;spectra&lt;/a&gt;&lt;a name="foot12778" href="https://technick.net/guides/theory/dft/modulo_indexing_periodic#tex2html85"&gt;&lt;sup&gt;8.1&lt;/sup&gt;&lt;/a&gt;&lt;dd&gt;A spectrum is mathematically identical to a signal, since&#10;both are just sequences of &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; &lt;a href="https://technick.net/guides/theory/dft/introduction_complex_number"&gt;complex numbers&lt;/a&gt;. However, for clarity, we&#10;generally use ''signal'' when the sequence index is considered a time&#10;index, and ''spectrum'' when the index is associated with successive&#10;frequency samples.&lt;pre&gt;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&lt;/pre&gt;&lt;dt&gt;&lt;a name="foot12811"&gt;...&#10;convolution.&lt;/a&gt;&lt;a name="foot12811" href="https://technick.net/guides/theory/dft/convolution#tex2html88"&gt;&lt;sup&gt;8.2&lt;/sup&gt;&lt;/a&gt;&lt;dd&gt;To simulate acyclic &lt;a href="https://technick.net/guides/theory/dft/convolution"&gt;convolution&lt;/a&gt;, as is&#10;appropriate for the simulation of sampled continuous-time systems,&#10;sufficient zero padding is used so that nonzero samples do not ''wrap&#10;around'' as a result of the shifting of &lt;img width="12" height="28" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img13.png" alt="$y$" /&gt; in the definition of&#10;convolution. Zero padding is discussed later in this reader.&lt;pre&gt;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&lt;/pre&gt;&lt;dt&gt;&lt;a name="foot13484"&gt;....&lt;/a&gt;&lt;a name="foot13484" href="https://technick.net/guides/theory/dft/graphical_convolution#tex2html90"&gt;&lt;sup&gt;8.3&lt;/sup&gt;&lt;/a&gt;&lt;dd&gt;&lt;a href="https://technick.net/guides/theory/dft/applications_cross_correlat"&gt;Matched filtering&lt;/a&gt; is briefly&#10;discussed in &amp;sect;&lt;a href="https://technick.net/guides/theory/dft/appendix_b_introductory#sec:SSP"&gt;8.8&lt;/a&gt;.&lt;pre&gt;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&lt;/pre&gt;&lt;dt&gt;&lt;a name="foot12879"&gt;... times.&lt;/a&gt;&lt;a name="foot12879" href="https://technick.net/guides/theory/dft/repeat_operator#tex2html93"&gt;&lt;sup&gt;8.4&lt;/sup&gt;&lt;/a&gt;&lt;dd&gt;You might wonder why we need this since all&#10;indexing is defined modulo &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; already. The answer is that &#10;&lt;!-- MATH&#10; $\mbox{{\tt Repeat}}_L()$&#10; --&gt;&lt;img width="76" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1133.png" alt="$\" box="" t="tt" epeat="" /&gt; formally expresses a mapping from the space of&#10;length &lt;img width="19" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img4.png" alt="$N$" /&gt; signals to the space of length &lt;img width="68" height="14" align="BOTTOM" border="0" src="https://technick.net/img/guide_dft/img1134.png" alt="$M=LN$" /&gt; signals.&lt;pre&gt;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&lt;/pre&gt;&lt;dt&gt;&lt;a name="foot13074"&gt;... transform&lt;/a&gt;&lt;a name="foot13074" href="https://technick.net/guides/theory/dft/symmetry#tex2html99"&gt;&lt;sup&gt;8.5&lt;/sup&gt;&lt;/a&gt;&lt;dd&gt;The discrete cosine transform&#10;(DCT) used often in applications is actually defined somewhat differently,&#10;but the basic principles are the same&lt;pre&gt;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&lt;/pre&gt;&lt;dt&gt;&lt;a name="foot13118"&gt;...&#10;transform&lt;/a&gt;&lt;a name="foot13118" href="https://technick.net/guides/theory/dft/application_shift_theorem#tex2html100"&gt;&lt;sup&gt;8.6&lt;/sup&gt;&lt;/a&gt;&lt;dd&gt;The FFT is just a fast implementation of the &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;DFT&lt;/a&gt;.&lt;pre&gt;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&lt;/pre&gt;&lt;dt&gt;&lt;a name="foot13517"&gt;... Dual&lt;/a&gt;&lt;a name="foot13517" href="https://technick.net/guides/theory/dft/dual_convolution_theorem#tex2html101"&gt;&lt;sup&gt;8.7&lt;/sup&gt;&lt;/a&gt;&lt;dd&gt;In general, the&lt;i&gt;dual&lt;/i&gt; of any Fourier operation is obtained by interchanging time&#10;and frequency.&lt;pre&gt;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&lt;/pre&gt;&lt;dt&gt;&lt;a name="foot13532"&gt;... domain,&lt;/a&gt;&lt;a name="foot13532" href="https://technick.net/guides/theory/dft/bandlimited_interpolation_t#tex2html102"&gt;&lt;sup&gt;8.8&lt;/sup&gt;&lt;/a&gt;&lt;dd&gt;The inverse DFT of the rectangular window here&#10;is an &lt;a href="https://technick.net/guides/theory/dft/decimation_theorem_aliasing"&gt;aliased&lt;/a&gt;, discrete-time counterpart of the &lt;i&gt;sinc function&lt;/i&gt; which&#10;is defined as ''&lt;!-- MATH&#10; $\sin(\pi t)/\pi t$&#10; --&gt;&lt;img width="75" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1303.png" alt="$\" in="" i="" i="" /&gt;.'' The sinc function is covered inMusic 420.&lt;pre&gt;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&lt;/pre&gt;&lt;dt&gt;&lt;a name="foot13290"&gt;... system&lt;/a&gt;&lt;a name="foot13290" href="https://technick.net/guides/theory/dft/appendix_a_linear#tex2html103"&gt;&lt;sup&gt;8.9&lt;/sup&gt;&lt;/a&gt;&lt;dd&gt;We use the term ''system'' interchangeably&#10;with ''filter.''&lt;pre&gt;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&lt;/pre&gt;&lt;dt&gt;&lt;a name="foot13534"&gt;...&#10;domain.&lt;/a&gt;&lt;a name="foot13534" href="https://technick.net/guides/theory/dft/lti_filters_convolution#tex2html105"&gt;&lt;sup&gt;8.10&lt;/sup&gt;&lt;/a&gt;&lt;dd&gt;Note that we normally say the sampling rate in the time&#10;domain must be higher than &lt;i&gt;twice&lt;/i&gt; the highest frequency in the&#10;frequency domain. From the point of view of this course, however, we may&#10;say instead that sampling rate in the time domain must be greater than the&lt;i&gt;full spectral bandwidth&lt;/i&gt; of the signal, including both positive and&lt;a href="https://technick.net/guides/theory/dft/positive_negative_frequenci"&gt;negative frequencies&lt;/a&gt;. From this simplified point of view, ''sampling rate&#10;= bandwidth supported.''&lt;pre&gt;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&lt;/pre&gt;&lt;dt&gt;&lt;a name="foot17672"&gt;....&lt;/a&gt;&lt;a name="foot17672" href="https://technick.net/guides/theory/dft/shannon_s_sampling_theorem#tex2html119"&gt;&lt;sup&gt;A.1&lt;/sup&gt;&lt;/a&gt;&lt;dd&gt;Mathematically, &lt;img width="49" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1442.png" alt="$X(j\" mega="" /&gt;can be allowed to be nonzero over points &lt;!-- MATH&#10; $|\omega|\geq\pi/T_s$&#10; --&gt;&lt;img width="78" height="31" align="MIDDLE" border="0" src="https://technick.net/img/guide_dft/img1441.png" alt="$\" ert\omega\vert\geq\pi="" s="s" /&gt;provided that the set of all such points have &lt;i&gt;measure zero&lt;/i&gt; in&#10;the sense of Lesbegue integration. However, such distinctions do not&#10;arise for practical signals which are always finite in extent and&#10;which therefore have continuous &lt;a href="https://technick.net/guides/theory/dft/dft"&gt;Fourier transforms&lt;/a&gt;. This is why we&#10;specialize &lt;a href="https://technick.net/guides/theory/dft/shannon_s_sampling_theorem"&gt;Shannon's Sampling Theorem&lt;/a&gt; to the case of&#10;continuous-spectrum signals.&lt;pre&gt;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&#10;.&lt;/pre&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dd&gt;&lt;/dt&gt;&lt;/dl&gt;</description></item></channel></rss>