SOO-CHANG PEIChang, Kuo-WeiKuo-WeiChang2018-09-102018-09-102007-031053587Xhttp://scholars.lib.ntu.edu.tw/handle/123456789/333563https://www.scopus.com/inward/record.uri?eid=2-s2.0-33947431030&doi=10.1109%2fTSP.2006.887567&partnerID=40&md5=86d9c96adde1c820410871dda194ae3dThis correspondence describes an efficient bit and digital reversal algorithm using vector calculation. It is much more efficient and simple than calculating the bit and digital reversal sequentially one by one using for-loop. An auxiliary small-size seed table can also be used for building up larger table in our algorithm to speed up the computation time. It will be very useful for data shuffling in radix-2 and radix-4 fast Fourier transforms. © 2007 IEEE.application/pdfapplication/pdfBit reversal; Digital reversal; Fast Fourier transformBit error rate; Data processing; Fast Fourier transforms; Vectors; Bit reversal; Digital reversal algorithm; Small-size seed table; Algorithmic languagesjournal article10.1109/TSP.2006.8875672-s2.0-33947431030WOS:000244610500033