FWT

基本解釋

FWT: Forward all requests and handle the talk request.
FWT：轉(zhuǎn)發(fā)所有請(qǐng)求并開始交談。沒(méi)有直接連接。
FWT Fast welvet transform source code integrity, and can be used directly.
(譯)：FWT快速welvet變換源代碼完整，并可以直接使用。
This paper proposes a flicker method based on FWT and its implementation on DSP.
該文提出了基于快速小波變換的閃變算法,并將該算法在數(shù)字信號(hào)處理器(DSP)上實(shí)現(xiàn)。
In this article, we propose a fast correlation algorithm of multiple PN code by Fast Walsh Transform (FWT).
本文提出了一種利用快速沃爾什變換(FWT)實(shí)現(xiàn)對(duì)復(fù)合碼進(jìn)行快速相關(guān)的算法。
Among those algorithms for the discrete W transforms (DWT), thefast W transform (FWT) is the most efficient one.
最近發(fā)表的快速W變換(FWT)是目前計(jì)算離散W變換(DWT)的各種算法中效率最高的算法。