An abbreviation for "Fast Fourier Transform," this is an algorithm that uses a computer to perform a high-speed Fourier transform of discrete data. An efficient method was first devised by C.G. Cooley and J.W. Zuker (1965). An FFT program usually takes 2n pieces of data as input. Recently, this algorithm has been implemented in hardware and is commercially available. Source: Encyclopaedia Britannica Concise Encyclopedia About Encyclopaedia Britannica Concise Encyclopedia Information |
「高速フーリエ変換」の略で,コンピュータを用いて離散的データのフーリエ変換を高速に行うアルゴリズムをいう。 C.G.クーリーと J.W.ツカーによって初めて能率のよい手法が考案された (1965) 。 FFTのプログラムは,通常 2n 個のデータを入力としている。最近はこのアルゴリズムがハードウエア化されて市販されるようになっている。
出典 ブリタニカ国際大百科事典 小項目事典ブリタニカ国際大百科事典 小項目事典について 情報 |
>>: FFC emulsion - FFC emulsion
When an electrode reaction is proceeding, the dif...
...More than 30 kinds of elemental minerals are k...
A protochordate (illustration) of the family Ciona...
This refers to the orogenic belt of the Appalachia...
A book written by Yamaga Soko, a Confucian schola...
...But the tail does not regenerate. The mountain...
...A marine fish of the family Ocellariidae in th...
The process by which material from the coast is ca...
…The government tried to suppress critical speech...
A small terrestrial orchid (illustration) that gro...
A butterfly belonging to the order Lepidoptera an...
This storage battery uses nickel oxide hydroxide N...
The maritime self-defense force was established in...
…After that, anatomy made rapid progress, centeri...
...Along with this, a partial low-level jet strea...