{"id":5,"date":"2024-04-03T23:13:17","date_gmt":"2024-04-03T20:13:17","guid":{"rendered":"https:\/\/sisu.ut.ee\/signaalitootlus2\/3-fourier-poorde-numbrilised-implementatsioonid\/"},"modified":"2025-01-31T09:26:01","modified_gmt":"2025-01-31T07:26:01","slug":"3-fourier-poorde-numbrilised-implementatsioonid","status":"publish","type":"page","link":"https:\/\/sisu.ut.ee\/signaalitootlus2\/3-fourier-poorde-numbrilised-implementatsioonid\/","title":{"rendered":"2. Fourier p\u00f6\u00f6rde numbrilised implementatsioonid"},"content":{"rendered":"<h2>Brief summary<\/h2>\n<p><span style=\"background-color: #ffffff;\">The fast Fourier transform (FFT) is a discrete Fourier transform algorithm which reduces the number of computations needed for N points from <em>2N<\/em><sup>2<\/sup> to <em>2Nlog<\/em><sub>2<\/sub><em>N<\/em>. There are several implementations how to achieve that.\u00a0Fast Fourier transform algorithms generally fall into two classes: decimation in time, and decimation in frequency.<\/span><\/p>\n<h2>Kokkuv\u00f5te<\/h2>\n<p><span style=\"background-color: #ffffff;\">Kiire Fourier\u2019 teisendus (FFT) on diskreetse Fourier\u2019 teisenduse algoritm, mis p\u00f5hineb teisenduse teostamiseks vajalike arvutuste mahu v\u00e4hendamises (vajalik N punkti jaoks alates 2N2 kuni\u00a0 2Nlog2N). On olemas mitmeid viise, kuidas seda saavutada. Kiire Fourier\u2019 teisenduse algoritmid jagunevad tavaliselt kahte klassi: aja detsimatsioon ja sageduse detsimatsioon.<\/span><\/p>\n<p><\/p><div class=\"ratio ratio-16x9 mb-3\"><div class=\"video-placeholder-wrapper video-placeholder-wrapper--16x9\">\n\t\t\t    <div class=\"video-placeholder d-flex justify-content-center align-items-center\">\n\t\t\t        <div class=\"overlay text-white p-2 w-100 text-center d-block justify-content-center align-items-center\">\n\t\t\t            <div>Kolmandate osapoolte sisu n\u00e4gemiseks palun n\u00f5ustu k\u00fcpsistega.<\/div>\n\t\t\t            <button class=\"btn btn-secondary btn-sm mt-1 consent-change\">Muuda n\u00f5usolekut<\/button>\n\t\t\t        <\/div>\n\t\t\t    <\/div>\n\t\t\t<\/div>\n<\/div>\n","protected":false},"excerpt":{"rendered":"<p>Brief summary The fast Fourier transform (FFT) is a discrete Fourier transform algorithm which reduces the number of computations needed for N points from 2N2 to 2Nlog2N. There are several implementations how to achieve that.\u00a0Fast Fourier transform algorithms generally fall &#8230;<\/p>\n","protected":false},"author":280,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_acf_changed":false,"inline_featured_image":false,"footnotes":""},"class_list":["post-5","page","type-page","status-publish","hentry"],"acf":[],"_links":{"self":[{"href":"https:\/\/sisu.ut.ee\/signaalitootlus2\/wp-json\/wp\/v2\/pages\/5","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/sisu.ut.ee\/signaalitootlus2\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/sisu.ut.ee\/signaalitootlus2\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/sisu.ut.ee\/signaalitootlus2\/wp-json\/wp\/v2\/users\/280"}],"replies":[{"embeddable":true,"href":"https:\/\/sisu.ut.ee\/signaalitootlus2\/wp-json\/wp\/v2\/comments?post=5"}],"version-history":[{"count":2,"href":"https:\/\/sisu.ut.ee\/signaalitootlus2\/wp-json\/wp\/v2\/pages\/5\/revisions"}],"predecessor-version":[{"id":65,"href":"https:\/\/sisu.ut.ee\/signaalitootlus2\/wp-json\/wp\/v2\/pages\/5\/revisions\/65"}],"wp:attachment":[{"href":"https:\/\/sisu.ut.ee\/signaalitootlus2\/wp-json\/wp\/v2\/media?parent=5"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}