High-efficiency grouping realigning algorithm based on vector shuffling and DMA
Realignment is a key bottleneck of the performance of fast Fourier transform operation process.For the vector Very Long Instruction Word(VLIW)architecture processor,to accelerate the processing of fast Fourier transform and improve the performance of the application systems in related fields,a group realigning method suit-able for arbitrary integer power bases of 2 was proposed.This method included three aspects:dividing the input da-ta into several groups of certain scale,shuffling and realigning within each group,and transferring the data in each group to the destination array in turn through Direct Memory Access(DMA).The method had the advantage of ef-fectively reducing the calculation requirement of inverse sequence numbers and avoiding the requirement of finding index for each single data.Moreover,for architectures with"ping-pong"storage mechanism,a parallel method of shuffling and DMA was proposed based on this method.The specific algorithm implementation and experimental verification were carried out on the FT-M7002 processor.Experimental results showed that the method was not only correct,but also could effectively improve the execution speed of realigning in vector processors,which was very suitable for vector VLIW processors.
fast fourier transformbit reverserealignmentshuffle
万方数据
维普
