FAST DFT ALGORITHM WITH (N-1) / 2 MULTIPLICATIONS

• 出 处: 中国航空学报：英文版
• 发表日期: 1990年2期
• 关键词: FASTER compute RECURSIVE MULTIPLIER replaced MULTIPLICATION SHIFTING length Comp

A fast algorithm is proposed for recursively computing the DFTs of prime length. Only (N-1) / 2 real multiplications are required to compute all N frequency components in terms of permuting the input data. The multiplication in recursive computation is re