<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="C">   <ARLID>0411312</ARLID> <utime>20240111140636.4</utime><mtime>20060210235959.9</mtime>        <title language="eng" primary="1">FPGA implementation of Finite Interval CMA</title>  <publisher> <place>Antverpy</place> <name>IEEE</name> <pub_time>2005</pub_time> </publisher> <specification> <page_count>3 s.</page_count> <media_type>CD-ROM</media_type> </specification>   <serial><ARLID>cav_un_epca*0341825</ARLID><ISBN>0-7803-9333-3</ISBN><title>Proceedings of the first annual IEEE BENELUX/DSP Valley Signal Processing Symposium. SPS-DARTS 2005</title><part_num/><part_title/><page_num>97-100</page_num><publisher><place>Antverpy</place><name>IEEE</name><year>2005</year></publisher></serial>   <title language="cze" primary="0">FPGA implementace FI-CMA algoritmu</title>    <keyword>CMA algorithm</keyword>   <keyword>FPGA</keyword>   <keyword>data matrix</keyword>    <author primary="1"> <ARLID>cav_un_auth*0101105</ARLID> <name1>Heřmánek</name1> <name2>Antonín</name2> <institution>UTIA-B</institution>  <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author> <author primary="0"> <ARLID>cav_un_auth*0101190</ARLID> <name1>Schier</name1> <name2>Jan</name2> <institution>UTIA-B</institution> <full_dept>Department of Image Processing</full_dept>  <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author>   <source> <source_size>220 kB</source_size> </source>     <COSATI>09G</COSATI> <COSATI>09H</COSATI> <COSATI>09J</COSATI>    <cas_special> <project> <project_id>1ET300750402</project_id> <agency>GA AV ČR</agency> <ARLID>cav_un_auth*0001795</ARLID> </project> <research> <research_id>CEZ:AV0Z10750506</research_id> </research>  <abstract language="eng" primary="1">An FPGA implementation of the FI-CMA algorithm using the Virtex-E and Virtex-II devices is presented. The algorithm consists of two parts: one, performing batch-QR decomposition of the data matrix, and second, used for an iterative equalizer optimization, using the columns of the Q-matrix as input. The resource reuse and minimization of the total latency have been emphasized. Logarithmic arithmetic library has been used for floating point calculations, required in algorithm.</abstract> <abstract language="cze" primary="0">V článku je prezentována FPGA implementace FI-CMA algoritmu s použitím obvodů Virtex-E a Virtex-II. Algoritmus se skládá ze dvou částí: v první se provádí QR rozklad datové matice, v druhé iterativní optimalizace ekvalizátoru, s použitím sloupců matice Q coby vstupu. Návrh je optimalizován s ohledem na vícenásobné využití prostředků a minimalizaci celkové latence. Operace v plovoucí řádové čárce, používané ve výpočtech, byly implementovány s použitím logaritmické aritmetické knihovny.</abstract>  <action target="EUR"> <ARLID>cav_un_auth*0213174</ARLID> <name>SPS-DARTS 2005 Signal Processing Symposium /1./</name> <place>Antverpy</place> <country>BE</country> <dates>19.04.2005-20.04.2005</dates>  </action>     <RIV>JA</RIV> <reportyear>2010</reportyear>   <department>ZS</department>    <permalink>http://hdl.handle.net/11104/0131395</permalink>       <arlyear>2005</arlyear>       <unknown tag="mrcbU10"> 2005 </unknown> <unknown tag="mrcbU10"> Antverpy IEEE </unknown> <unknown tag="mrcbU56"> 220 kB </unknown> <unknown tag="mrcbU63"> cav_un_epca*0341825 Proceedings of the first annual IEEE BENELUX/DSP Valley Signal Processing Symposium. SPS-DARTS 2005 0-7803-9333-3 97 100 Antverpy IEEE 2005 </unknown> </cas_special> </bibitem>