<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="C">   <ARLID>0410964</ARLID> <utime>20240103182252.0</utime><mtime>20060210235959.9</mtime>    <ISBN>0-7803-7587-4</ISBN>         <title language="eng" primary="1">The Gauss-Seidel Fast Affine Projection algorithm</title>  <publisher> <place>San Diego</place> <name>IEEE</name> <pub_time>2002</pub_time> </publisher> <specification> <page_count>6 s.</page_count> </specification>   <serial><title>IEEE Workshop on Signal Processing Systems. Proceedings</title><part_num/><part_title/><page_num>109-114</page_num><editor><name1>Parhi</name1><name2>K.</name2></editor><editor><name1>Shanbhag</name1><name2>N.</name2></editor></serial>    <keyword>fast affine projection algorithm</keyword>   <keyword>logarithmic number system</keyword>   <keyword>FPGA</keyword>    <author primary="1"> <ARLID>cav_un_auth*0212813</ARLID> <name1>Albu</name1> <name2>F.</name2> <country>IE</country>  </author> <author primary="0"> <ARLID>cav_un_auth*0101120</ARLID> <name1>Kadlec</name1> <name2>Jiří</name2> <institution>UTIA-B</institution> <full_dept>Department of Signal Processing</full_dept>  <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author> <author primary="0"> <ARLID>cav_un_auth*0212961</ARLID> <name1>Coleman</name1> <name2>N.</name2> <country>GB</country>  </author> <author primary="0"> <ARLID>cav_un_auth*0212814</ARLID> <name1>Fagan</name1> <name2>A.</name2> <country>IE</country>  </author>     <COSATI>09G</COSATI> <COSATI>09H</COSATI>    <cas_special> <project> <project_id>33544</project_id> <agency>ESPRIT</agency> <country>XE</country> </project> <research> <research_id>CEZ:AV0Z1075907</research_id> </research>  <abstract language="eng" primary="1">In this paper we propose a new stable Fast Affine Projection algorithm based on Gauss-Seidel iterations (GSFAP). We investigate its implementation using the logarithmic number system (LNS) and compare it with two other fast affine projection (FAP) algorithms. Simplified and multi-input GSFAP versions are also proposed. We show that the algorithm is only marginally more complex than MLMS and simpler than other FAP algorithms. Its application for acoustic echo cancellation is also investigated.</abstract>  <action target="WRD"> <ARLID>cav_un_auth*0212981</ARLID> <name>SIPS 2002</name> <place>San Diego</place> <country>US</country> <dates>16.10.2002-18.10.2002</dates>  </action>     <RIV>JC</RIV>      <department>ZS</department>   <permalink>http://hdl.handle.net/11104/0131051</permalink>   <ID_orig>UTIA-B 20020178</ID_orig>     <arlyear>2002</arlyear>       <unknown tag="mrcbU10"> 2002 </unknown> <unknown tag="mrcbU10"> San Diego IEEE </unknown> <unknown tag="mrcbU12"> 0-7803-7587-4 </unknown> <unknown tag="mrcbU63"> IEEE Workshop on Signal Processing Systems. Proceedings 109 114 </unknown> <unknown tag="mrcbU67"> Parhi K. 340 </unknown> <unknown tag="mrcbU67"> Shanbhag N. 340 </unknown> </cas_special> </bibitem>