National Taiwan University Dept Elect EngnSOO-CHANG PEIChen, Wei-YuWei-YuChen2006-11-142018-07-062006-11-142018-07-062004-0510709908http://ntur.lib.ntu.edu.tw//handle/246246/200611150121924https://www.scopus.com/inward/record.uri?eid=2-s2.0-2442547593&doi=10.1109%2fLSP.2004.826652&partnerID=40&md5=00b612397bef313aefe07f25c8989abcThis letter presents an efficient split vector-radix-2/8 fast Fourier transform (FFT) algorithm. The split vector-radix-2/8 FFT algorithm saves 14% real multiplications and has much lower arithmetic complexity than the split vector-radix-2/4 FFT algorithm. Moreover, this algorithm reduces 25% data loads and stores compared with the split vector-radix-2/4 FFT algorithm.application/pdf459703 bytesapplication/pdfzh-TWSplit-radix-2/4split-radix-2/8two-dimensional (2-D) fast Fourier transform (FFT)vector-radixAlgorithms; Computational complexity; Fast Fourier transforms; Two dimensional; Vectors; Arithmetic complexity; Split vector radix; Signal processingjournal article10.1109/LSP.2004.8266522-s2.0-2442547593WOS:000221046200002http://ntur.lib.ntu.edu.tw/bitstream/246246/200611150121924/1/5267.pdf