A Mixed-Radix 4-2Butterfly withSimple Bit Revering forOrdering theOutput Sequences
Young‐Jin Moon, Youngil Kim · 2006
Inrecent years, theFastFourier Transform (FFT) combined tocreate large FFT(9), (10), (11). However, this hasbeenplaying a veryimportant roleinthedesign and algorithm doesnotoffer thesimple bitreversing forordering implementation ofthediscrete-time signal processing system.theoutput sequences. Therefore, various FFTalgorithms havebeenproposed inthis Inthis paper, aMixed-Radix 4-2butterfly structure with areaoverthelastdecades. Especially, thepipeline algorithmssimple bitreversing foroutput sequences derived byindex havebeenregarded as suitable algorithms forprocessing decomposition technique ispresented. Thenew methodto high-speed data. Uptonow,several pipeline FFTalgorithms obtain the 1S butte d. sT enwismpet bt suchastheRadix-2', theSplit-Radix andtheMixed-Radix have obtain theMixed-Radix butterfly structure withsimple bit beenproposed. Inthis paper, wedeveloped aMixed-Radix 4-2 reversing foroutput sequences isestablished. Therefore, the Butterfly Structure withsimple bitreversing output sequencesproposed Mixed-Radix 4-2butterfly structure offers the derived byindex decomposition technique whichwasusedinthe engineering insight ofgeneral Mixed-Radix. Therestofthe Radix-2' algorithm. Compared withtheRadix-23 algorithm and paperisorganized asfollows: theprocess offinding the theSplit-Radix 2/4/8 algorithm, theproposed algorithm hasthe Mixed-Radix 4-2butterfly structure withsimple bitreversing samenumberofmultipliers andtheless numberofthestagesbyusingtheindexdecomposition technique isgivenin andthebutterflies thantheRadix-23 andtheSplit-Radix 2/4/8 algorithm. Moreover, theproposed algorithm makesanoffer the .. simple bitreversing forordering theoutput sequences whichis the64-points FFTisexampled byexploiting theproposed only supported byafixed-radix FFTalgorithm. Mixed-Radix 4-2butterfly structure. Finally, someconclusion isobtained.