<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">477097332</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180405111531.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170330e19960301xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/BF01183775</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/BF01183775</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">Nordberg III</subfield>
   <subfield code="D">Martin</subfield>
   <subfield code="u">Precision Devices, Inc., 606 County Street, P.O. Box 220, 48160, Milan, MI</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="2">
   <subfield code="a">A fast algorithm for FIR digital filtering with a sum-of-triangles weighting function</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Martin Nordberg III]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">A doubly recursive algorithm for time domain convolution with a piecewise linear weighting function is presented that combines the speed of a recursive (IIR) digital filter with the flexibility and ease of design of a nonrecursive (FIR) digital filter. The approach approximates the desired FIR weighting function by a sum-of-triangles weighting function. ForL triangles (or triangle pairs for a linear phase filter) the algorithm is of orderLN. The approximation improves with the number of triangles. A significant advantage of the algorithm compared to FFT filtering or direct convolution is that there is no necessity of a tradeoff between frequency response accuracy and computation time per output point as the data spacing decreases in the filtered signal. The computational complexity is dependent on the number of triangles chosen, not the width of the weighting function, so the algorithm is especially effective for filters with an inherently wide FIR weighting function.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Birkhäuser, 1996</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Circuits, Systems and Signal Processing</subfield>
   <subfield code="d">Birkhäuser-Verlag</subfield>
   <subfield code="g">15/2(1996-03-01), 145-164</subfield>
   <subfield code="x">0278-081X</subfield>
   <subfield code="q">15:2&lt;145</subfield>
   <subfield code="1">1996</subfield>
   <subfield code="2">15</subfield>
   <subfield code="o">34</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/BF01183775</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1007/BF01183775</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">100</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Nordberg III</subfield>
   <subfield code="D">Martin</subfield>
   <subfield code="u">Precision Devices, Inc., 606 County Street, P.O. Box 220, 48160, Milan, MI</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Circuits, Systems and Signal Processing</subfield>
   <subfield code="d">Birkhäuser-Verlag</subfield>
   <subfield code="g">15/2(1996-03-01), 145-164</subfield>
   <subfield code="x">0278-081X</subfield>
   <subfield code="q">15:2&lt;145</subfield>
   <subfield code="1">1996</subfield>
   <subfield code="2">15</subfield>
   <subfield code="o">34</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
 </record>
</collection>
