%0 Journal Article
%T AN IMPROVED DIGIT-REVERSAL PERMUTATION ALGORITHM<br>FFT或FHT的一种改进的整序算法
%A Liu Bin
%A Xie Ping
%A <br>刘彬
%A 谢平
%J 电子与信息学报
%D 1997
%I 
%X A more efficient permutation algorithm which has less computer operation and better structure is presented here for radix-2 FFT (FHT). It can fasten the FFT and FHT efficiently when N becomes large.
%K Radix-2 FFT and FHT
%K Permutation algorithm
%K Bit-reversed order
%K Upper limit<br>基-2FFT(FHT)
%K 整序算法
%K 位序倒置
%K 换序上限
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=1319827C0C74AAE8D654BEA21B7F54D3&jid=EFC0377B03BD8D0EF4BBB548AC5F739A&aid=DC28CB37C01B2659C9CEBA56762A4BB8&yid=5370399DC954B911&vid=2A8D03AD8076A2E3&iid=38B194292C032A66&sid=31BCE06A2FD82A16&eid=85002451B65CE0D1&journal_id=1009-5896&journal_name=电子与信息学报&referenced_num=0&reference_num=6