<p><b>Abstract</b>—Recently, it has been shown that radix-2 DFT algorithms can be designed based on vector representation of data providing several advantages [<ref rid="bibt14186" type="bib">6</ref>], [<ref rid="bibt14187" type="bib">7</ref>], [<ref rid="bibt14188" type="bib">8</ref>]. In this paper, an index mapping approach is used to derive these algorithms. This approach makes the derivation simpler and provides a better insight into the functioning of the algorithms. The computational complexity and the performance of the software implementation of the algorithms are also presented.</p>