0410675 20240103182230.920060210235959.9 Praha FEL ČVUT 2001 2 s. 127-128HazdraP.LhotskáL. polynomial matrices spectral factorization fast Fourier transform cav_un_auth*0101116 Ježek Jan UTIA-B Ústav teorie informace a automatizace AV ČR, v. v. i. cav_un_auth*0101110 Hromčík Martin UTIA-B Ústav teorie informace a automatizace AV ČR, v. v. i. cav_un_auth*0101204 Šebek Michael UTIA-B Department of Control Theory Ústav teorie informace a automatizace AV ČR, v. v. i. 12C 09I 09H GA102/99/1368 GA ČR cav_un_auth*0004439 AV0Z1075907 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. The power of the proposed procedure is employed in a particular practical signal processing application. cav_un_auth*0212832 International Student Conference on Electrical Engineering POSTER 2001 /5./ Praha CZ 24.05.2001 BC TŘ http://hdl.handle.net/11104/0130763 UTIA-B 20010144 2001 2001 Praha FEL ČVUT Proceedings of the 5th International Student Conference on Electrical Engineering POSTER 2001 127 128 Hazdra P. 340 Lhotská L. 340