Mod (2P-1) Shuffle Memory-Access Instructions for FFTs on Vector SIMD DSPs

被引:2
|
作者
Liu, Sheng [1 ]
Chen, Haiyan [1 ]
Wan, Jianghua [2 ]
Wang, Yaohua [1 ]
机构
[1] Natl Univ Def Technol, Coll Comp, Changsha 410073, Hunan, Peoples R China
[2] Natl Univ Def Technol, Sci & Technol Parallel & Distributed Proc Lab, Changsha 410073, Hunan, Peoples R China
关键词
Mod (2P-1) shuffle function; Mod-BEA algorithm; Shuffle memory-access instructions; FFTs; vector SIMD;
D O I
10.1109/ISVLSI.2016.71
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Binary Exchange Algorithm (BEA) always introduces excessive shuffle operations when mapping FFTs on vector SIMD DSPs. This can greatly restrict the overall performance. We propose a novel mod (2P-1) shuffle function and Mod-BEA algorithm (MBEA), which can halve the shuffle operation count and unify the shuffle mode. Such unified shuffle mode inspires us to propose a set of novel mod (2P-1) shuffle memory-access instructions, which can totally eliminate the shuffle operations. Experimental results show that the combination of MBEA and the proposed instructions can bring 17.2%-31.4% performance improvements at reasonable hardware cost, and compress the code size by about 30%.
引用
收藏
页码:426 / 430
页数:5
相关论文
共 3 条
  • [1] Vector Memory-Access Shuffle Fused Instructions for FFT-Like Algorithms
    Liu Sheng
    Yuan Bo
    Guo Yang
    Sun Haiyan
    Jiang Zekun
    [J]. CHINESE JOURNAL OF ELECTRONICS, 2023, 32 (05) : 1077 - 1088
  • [2] Vector Memory-Access Shuffle Fused Instructions for FFT-Like Algorithms
    LIU Sheng
    YUAN Bo
    GUO Yang
    SUN Haiyan
    JIANG Zekun
    [J]. Chinese Journal of Electronics, 2023, 32 (05) : 1077 - 1088
  • [3] 1ST CASE OF FERMATS LAST THEOREM AND CONGRUENCE 2P-1=1 (MOD P3)
    GANDHI, JM
    STUFF, M
    [J]. NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1975, 22 (04): : A453 - A453