矢量基二维DCT在DSP上的内存存取减少方法
详细信息    查看全文 | 推荐本文 |
  • 英文篇名:Memory Reference Reduction Method for Vector-radix 2D DCT on DSP
  • 作者:刘项洋 ; 许勇 ; 陈付龙 ; 郑孝遥
  • 英文作者:LIU Xiang-yang;XU Yong;CHEN Fu-long;ZHENG Xiao-yao;School of Computer and Information,Anhui Normal University;
  • 关键词:数字信号处理器(DSP) ; 离散余弦变换(DCT) ; 蝴蝶运算单元 ; 内存存取
  • 英文关键词:digital signal processor(DSP);;discrete cosine transform(DCT);;butterflies;;memory reference
  • 中文刊名:XXWX
  • 英文刊名:Journal of Chinese Computer Systems
  • 机构:安徽师范大学计算机与信息学院;
  • 出版日期:2019-04-15
  • 出版单位:小型微型计算机系统
  • 年:2019
  • 期:v.40
  • 基金:国家自然科学基金面上项目(61572036,21173002)资助
  • 语种:中文;
  • 页:XXWX201904038
  • 页数:5
  • CN:04
  • ISSN:21-1106/TP
  • 分类号:193-197
摘要
本文针对矢量基二维DCT提出内存存取减少方法.该方法旨在减少计算中因权重因子和信号输入而导致的内存存取.它首先利用权重因子的属性将计算流程图内每相邻两阶段内的蝴蝶运算单元进行融合,然后再以较少的权重因子来计算.本文采用通用DSP处理器来验证该方法对矢量基二维DCT算法的有效性.并且实验结果显示该方法相比于常规方法可以大幅度减少运算所需的时钟周期、降低对运算中对内存的存取量、以及占用更少的内存.
        This paper proposes a novel memory reference reduction method for vector-radix 2D DCT. This method aims to reduce the memory reference owing to weighting factors and signal input. The proposed method merges the butterflies at every neighboring two stages in the computation diagram,then compute them with fewer weighting factors. Hardware platform based on general purpose processor is used to verify the effectiveness of the proposed method for vector-radix 2-D FCT pruning implementation. Experimental results validate the benefits of the proposed method with less clock cycle,reduced memory reference fewer memory space compared with the conventional implementation.
引文
[1]Ahmec N,Natarajan T,Rao K R.Discrete cosine transform[J].IEEE Transactions on Computers,1974,C-23:90-93.
    [2]Pennebaker W,Mitchell J.JPEG still image data compression standard[M].Boston:Kluwer Academic Publishers,1997.
    [3]Mitchell J.MPEG video compression standard[M].Boston:Kluwer Academic Publishers,1997.
    [4]Rao K R,Yip P.Discrete cosine transform:algorithms,advantages,applications[M].NewYork:academic,1990.
    [5]Wezelenburg M.General radix-2nDCT and DST algorithms[C].Proceedings of the International Conference on ECCTD'97,Budapest,Hungary,1997:789-794.
    [6]Chan Y H,Siu W C.Mixed-radix discrete cosine transform[J].IEEE Transactions on Signal Processing,1993,41(11):3157-3161.
    [7]Tatsaki A,Dre C,Stouraitis T,et al.Prime-factor DCT algorithms[J].IEEE Transactions on Signal Processing,1995,43(3):772-776.
    [8]Liu Yuan-yuan,Chen He-xin,Zhao Yan,et al.Multidimensional DCT/IDCT similar butterfly algorithm and it unit channel architectures[J].Journal of Jilin University(Engineering and Technology Edition),2016,46(6):2094-2102.
    [9]Pan Su-wen,Ye Yu-huang,Zheng Ming-kui,et al.Design and implementation of HEVC 8×8 integer DCT based on systolic array[J].Microcomputer&Its Applications,2017,36(7):53-59.
    [10]Sang Ai-jun,Chui Xin-yu,Wang Ting,et al.2M-dimensional vector matrix DCT integer transform and parallel implementation[J].Journal of Northeastern University(Natural Science),2017,38(11):1543-1547.
    [11]Maurizio Masera,Maurizio Martina,Guido Masera.Adaptive approximated DCT architectures for HEVC[J].IEEE Transactions on Circuits and Systems for Video Technology,2017,27(12):2714-2725.
    [12]Makhoul J.A fast cosine transform in one and two dimensions[J].IEEE Transactions on Acoustics,Speech and Signal Processing,1980,28(1):27-34.
    [13]Chan S C,Ho K L.A newtwo dimensional fast cosine transform algorithm[J].IEEE Transactions on Signal Processing,1991,39(2):481-485.
    [14]Feig E,Winograd S.On the multiplicative complexity of discrete cosine transform[J].IEEE Transaction on Information Theory,1992,38(4):1387-1391.
    [15]Christopoulos C A,Bormans J,Cornelis J,et al.The Vector-radix fast cosine transform:pruning and complexity analysis[J].Signal Processing,1995,43(2):197-205.
    [16]Shaofeng An,Chunyan Wang.A recursive algorithm for 2-D DCT[C].International Symposium on Signal,Systems and Electronics,M ontreal,QC,Canada,2007:335-338.
    [17]Tiago Schiavon,Guilherme Paim,Mateus Fonseca,et al.Exploiting adder compressors for power-efficient 2-D approximate DCT realization[C].IEEE 7th Latin American Symposium on Circuits and Systems(LASCAS),Florianopolis,Brazil,2016:383-386.
    [18]Weijia Cao,Yicong Zhou.4×4 parametric integer discrete cosine transforms[C].IEEE International Conference on Systems,M an,and Cybernetics(SM C),Banff,AB,Canada,2017:3467-3470.
    [19]Bunji Antoinette Ringnyu,Ali Tangel,Emre Karabulut.Implementation of different architectures of forward 4×4 integer DCT for H.264/AVC encoder[C].10th International Conference on Electrical and Electronics Engineering(ELECO),Bursa,Turkey,2017:423-427.
    [20]Mao Tian,Guang-Jun Li,Qi-Zong Peng.A newfast algorithm for 8×8 2-D DCT and its VLSI implementation[C].Proceedings of2005 IEEE International Workshop on VLSI Design and Video Technology,Suzhou,China,2005:179-182.
    [21]Liu Xiang-yang,Xu Yong.Memory access optimization method for the implementation of fast DCT pruning on DSP[J].Acta Electronica Sinica,2016,44(1):227-232.
    [22]Skodras A N,Constantinides A E.Efficient input-reordering algorithms for fast DCT[J].Electronics Letters,1991,27(21):1973-1975.
    [8]刘媛媛,陈贺新,赵岩,等.多维DCT_IDCT立体类蝶形算法及其单元式通道结构[J].吉林大学学报(工业版),2016,46(6):2094-2102.
    [9]潘苏文,叶宇煌,郑明魁,等.基于脉动阵列的HEVC 8×8整数DCT变换的设计与实现[J].微型机与应用,2017,36(7):53-59.
    [10]桑爱军,崔新宇,王艇,等.2M维矢量矩阵DCT整数变换及并行实现[J].东北大学学报(自然科学版),2017,38(11):1543-1547.
    [21]刘项洋,许勇.快速DC修剪在DCT上的内存访问优化方法[J].电子学报,2016,44(1):227-232.
NGLC 2004-2010.National Geological Library of China All Rights Reserved.
Add:29 Xueyuan Rd,Haidian District,Beijing,PRC. Mail Add: 8324 mailbox 100083
For exchange or info please contact us via email.