首页>
外国专利>
DEVICE, SYSTEM AND METHOD FOR EAST FOURIER TRANSFORMATION PROCESSING
DEVICE, SYSTEM AND METHOD FOR EAST FOURIER TRANSFORMATION PROCESSING
展开▼
机译:东傅里叶变换处理的装置,系统和方法
展开▼
页面导航
摘要
著录项
相似文献
摘要
PROBLEM TO BE SOLVED: To perform Fourier transform processing of a base number 2 and a base number 4 at high speed. ;SOLUTION: After dividing complex number data with sample points of 4n×2 or 4n into A to D, an operation processing for performing a butterfly operation ai={(Ai+Ci)+(Bi+Di)}×Wi1={(Ai+Ci)+(Bi+Di)}×Wi3, bi={(Ai-Ci)-j(Bi-Di)}×Wi2 and di={(Ai+Ci)+j(Bi-Di)}×Wi4 which use i-th complex number data Ai, Bi, Ci, and Di of A to D and torsion coefficients Wi1, Wi2, Wi3 and Wi4, is repeated for n times, and then the butterfly operation ai=Ai+Bi, bi=Ai-Bi, ci=Ci+Di, and di=Ci-Di is performed once when the number of sample points is 4n×2.;COPYRIGHT: (C)1999,JPO
展开▼
机译:解决的问题:以高速执行基数2和基数4的傅立叶变换处理。 ;解决方案:将采样点为4 n Sup>×2或4 n Sup>的复数数据划分为A到D之后,执行蝶形运算a 的运算处理i Sub> = {(A i Sub> + C i Sub>)+(B i Sub> + D i Sub>) }×W i1 Sub> = {(A i Sub> + C i Sub>)+(B i Sub> + D i Sub>)}×W i3 Sub>,b i Sub> = {(A i Sub> -C i Sub>) -j(B i Sub> -D i Sub>)}×W i2 Sub>和d i Sub> = {(A i Sub> + C i Sub>)+ j(B i Sub> -D i Sub>)}×W i4 Sub >使用第i个复数数据的A i Sub>,B i Sub>,C i Sub>和D i Sub>对n重复A到D和扭转系数W i1 Sub>,W i2 Sub>,W i3 Sub>和W i4 Sub>次,然后执行蝶形运算a i Sub> = A i Sub> + B i Sub>,b i Sub> = A i Sub> -B i Sub>,c i Sub> = C i Sub> + D i Sub>和d <当数字为o时,执行一次Sub> i Sub> = C i Sub> -D i Sub> f个采样点是4 n Sup>×2。; COPYRIGHT:(C)1999,JPO
展开▼