|
關注:1
2013-05-23 12:21
求翻譯:DFT的計算量太大,雖然快速傅里葉變換(FFT)是解決了這一問題,但DFT或FFT都涉及復數的乘法和加法運算是什么意思?![]() ![]() DFT的計算量太大,雖然快速傅里葉變換(FFT)是解決了這一問題,但DFT或FFT都涉及復數的乘法和加法運算
問題補充: |
|
2013-05-23 12:21:38
dft's are too computationally intensive, fast Fourier transform (fft) is the solution to this problem, but dft fft are involved in the complex multiplication and addition operations
|
|
2013-05-23 12:23:18
The amount of computation DFT too large, although Fast Fourier Transform (FFT) is to address the issue, but DFT FFT involve complex or the multiplication and addition operators
|
|
2013-05-23 12:24:58
The DFT computation load too is big, although fast Fournier transformation (FFT) has solved this problem, but DFT or FFT all involve the plural number the multiplication and the additive operation
|
|
2013-05-23 12:26:38
DFT calculations too big, fast Fourier transform (FFT) is to solve this problem, but the DFT or FFT involves complex multiplications and additions
|
|
2013-05-23 12:28:18
正在翻譯,請等待...
|
湖北省互聯網違法和不良信息舉報平臺 | 網上有害信息舉報專區 | 電信詐騙舉報專區 | 涉歷史虛無主義有害信息舉報專區 | 涉企侵權舉報專區