<section name="raw">
    <SEQUENTIAL>
      <record key="001" att1="001" value="LIB90453330X" att2="LIB90453330X">001   LIB90453330X</record>
      <field key="037" subkey="x">englisch</field>
      <field key="050" subkey="x">Buch</field>
      <field key="076" subkey="">Formalwissenschaft</field>
      <field key="100" subkey="">haykin, simon</field>
      <field key="331" subkey="">adaptive filter theory</field>
      <field key="403" subkey="">2. ed.</field>
      <field key="410" subkey="">london, sydney, toronto</field>
      <field key="412" subkey="">prentice-hall international</field>
      <field key="425" subkey="">1991</field>
      <field key="433" subkey="">xx, 854 pp.</field>
      <field key="451" subkey="">prentice hall information and system sciences series</field>
      <field key="451" subkey="h">kailath, thomas (ed.)</field>
      <field key="517" subkey="c">from the table of contents: introduction; stationary processes and models; spectrum analysis; eigenanalysis; wiener filters;</field>
      <field key="lin" subkey="e">ar prediction; kalman filters; method of steepest descent; stochastic gradient-based algorithms; method of least squares;</field>
      <field key="sin" subkey="g">ular value decomposition; super-resolution algorithms using eigenvector-based projections; standard recursive least-squares</field>
      <field key="est" subkey="i">mation; recursive least-squares systolic arrays; background theory for fast recursive algorithms; fast transversal filters;</field>
      <field key="rec" subkey="u">rsive least-squares lattice filters; qr decomposition-based least squares lattice; finite-precision and other practical</field>
      <field key="eff" subkey="e">cts; blind deconvolution; discussion;</field>
      <field key="544" subkey="">13127-A</field>
    </SEQUENTIAL>
  </section>