说明：  本文提出一個根值4 蝴蝶元素使用(m, n) - 櫃臺減少硬體複雜, 延遲時間, 和電力消費被介入在使用常規加法器。並且一臺修改過的換向器為FFT 算法被描述與用管道運輸的實施一起為連續輸入資料減少資料記憶要求。
(This paper presents a root element of the use of 4 Butterfly (m, n)- the counter to reduce the hardware complexity, latency, and power consumption has been involved in the use of conventional adder. And a modified commutator for the FFT algorithm has been described with the use of pipeline transportation for the implementation of continuous input data together with information to reduce memory requirements.)