<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="C">   <ARLID>0410378</ARLID> <utime>20240103182209.9</utime><mtime>20060210235959.9</mtime>        <title language="eng" primary="1">Spectral factorization by means of discrete Fourier transform</title>  <publisher> <place>Patras</place> <name>University of Patras</name> <pub_time>2000</pub_time> </publisher> <specification> <page_count>6 s.</page_count> <media_type>CD-ROM</media_type> </specification>   <serial><title>Proceedings of the 8th IEEE Mediterranean Conference on Control and Automation. MED 2000</title><part_num/><part_title/><page_num>11-16</page_num><editor><name1>Groumpos</name1><name2>P.</name2></editor><editor><name1>Koussoulas</name1><name2>N.</name2></editor><editor><name1>Antsaklis</name1><name2>P.</name2></editor></serial>   <author primary="1"> <ARLID>cav_un_auth*0101116</ARLID> <name1>Ježek</name1> <name2>Jan</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*0101110</ARLID> <name1>Hromčík</name1> <name2>Martin</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*0101204</ARLID> <name1>Šebek</name1> <name2>Michael</name2> <institution>UTIA-B</institution> <full_dept>Department of Control Theory</full_dept>  <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author>     <COSATI>09H</COSATI>    <cas_special> <project> <project_id>GA102/99/1368</project_id> <agency>GA ČR</agency> <ARLID>cav_un_auth*0004439</ARLID> </project> <project> <project_id>VS97034</project_id> <agency>MŠMT</agency> <country>CZ</country> <ARLID>cav_un_auth*0025111</ARLID> </project> <research> <research_id>AV0Z1075907</research_id> </research>  <abstract language="eng" primary="1">In this report a new algorithm is presented for the spectral factorization of a two-sided symmetric polynomial. The method is based on the discrete Fourier transform theory (DFT) and its relationship to the Z-transform. Involving DFT computational techniques, namely the famous fast Fourier transform routine (FFT), brings high computational efficiency and reliability.</abstract>  <action target=""> <ARLID>cav_un_auth*0212667</ARLID> <name>IEEE Mediterranean Conference on Control and Automation. MED 2000 /8./</name> <place>Patras</place> <country>GR</country> <dates>17.07.2000-19.07.2000</dates> </action>     <RIV>BC</RIV>   <department>TŘ</department>    <permalink>http://hdl.handle.net/11104/0130467</permalink>   <ID_orig>UTIA-B 20000094</ID_orig>     <arlyear>2000</arlyear>       <unknown tag="mrcbU10"> 2000 </unknown> <unknown tag="mrcbU10"> Patras University of Patras </unknown> <unknown tag="mrcbU63"> Proceedings of the 8th IEEE Mediterranean Conference on Control and Automation. MED 2000 11 16 </unknown> <unknown tag="mrcbU67"> Groumpos P. 340 </unknown> <unknown tag="mrcbU67"> Koussoulas N. 340 </unknown> <unknown tag="mrcbU67"> Antsaklis P. 340 </unknown> </cas_special> </bibitem>