<?xml version="1.0" encoding="UTF-8"?>
<record
    xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
    xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd"
    xmlns="http://www.loc.gov/MARC21/slim">

  <leader>01603naa a2200241 i 4500</leader>
  <controlfield tag="001">12</controlfield>
  <controlfield tag="003">BPK</controlfield>
  <controlfield tag="005">20191005093906.0</controlfield>
  <controlfield tag="008">151208s2002    us  |  f     |100 ||eng d</controlfield>
  <datafield tag="040" ind1=" " ind2=" ">
    <subfield code="c">BPK</subfield>
  </datafield>
  <datafield tag="041" ind1=" " ind2=" ">
    <subfield code="a">eng</subfield>
  </datafield>
  <datafield tag="044" ind1=" " ind2=" ">
    <subfield code="a">CHE</subfield>
  </datafield>
  <datafield tag="080" ind1=" " ind2=" ">
    <subfield code="a">621.3.037/.049</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
    <subfield code="a">Maslennikow, Oleg</subfield>
    <subfield code="d">1996 - 2010.</subfield>
    <subfield code="b">Politechnika Koszali&#x144;ska - Wydzia&#x142; Elektroniki,</subfield>
    <subfield code="c">Katedra In&#x17C;ynierii Komputerowej</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
    <subfield code="a">Implementation of givens QR decomposition in FPGA /</subfield>
    <subfield code="c">Anatoli Sergyienko, Oleg Maslennikov.</subfield>
  </datafield>
  <datafield tag="500" ind1=" " ind2=" ">
    <subfield code="a">Dane z Informatora o publikowanych wynikach prac naukowo-badawczych w 2002 roku Wydzia&#x142;u Elektroniki.</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">A new parallel processor structure for Givens QR-decomposition intended for the FPGA implementation is presented. The structure is derived using method of mapping regular algorithms using affine transformations of the algorithm graph. The method supports pipelined processor unit design, and provides efficient hardware utilization. An example of the implementation of the structure in the Xilinx Virtex FPGA devices is presented.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Uk&#x142;ady logiczne programowalne FPGA.</subfield>
  </datafield>
  <datafield tag="655" ind1=" " ind2="0">
    <subfield code="a">Materia&#x142;y konferencyjne.</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
    <subfield code="i">W :</subfield>
    <subfield code="t">Parallel processing and applied mathematics : 4th International Conference, PPAM  2001, Naleczow, Poland, September 9-12, 2001. -</subfield>
    <subfield code="d">New York : Springer, 2002. -</subfield>
    <subfield code="g"> pp. 453-465</subfield>
    <subfield code="k">Lecture Notes in Computer Science ; vol. 2328</subfield>
    <subfield code="z">9783540480860</subfield>
  </datafield>
  <datafield tag="711" ind1="2" ind2="2">
    <subfield code="a">International Conference on Parallel Processing and Applied Mathematics PPAM 2001</subfield>
    <subfield code="n">(4 ;</subfield>
    <subfield code="d">2001 ;</subfield>
    <subfield code="c">Na&#x142;&#x119;cz&#xF3;w, Polska)</subfield>
    <subfield code="p">PPAM 2001</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
    <subfield code="c">ROZ</subfield>
    <subfield code="2">UKD</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">12</subfield>
    <subfield code="d">12</subfield>
  </datafield>
</record>
