检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《高技术通讯》2011年第5期443-450,共8页Chinese High Technology Letters
基 金:863计划(2006AA01A109)和国际科技合作计划项目(2009DFA12110)资助.
摘 要:针对可重构计算系统中配置信息压缩问题,提出了一种基于上下文自适应算术编码的配置信息压缩算法。该算法采用动态调整参数的方法逼近符号概率,采用移位操作消除算术编码的乘除法,在压缩和解压过程中引入上下文模型分配机制,实现对配置信息的压缩,从而可减少所需的配置信息存储空间和重构时配置信息的传输量。该算法用现场可编程门阵列(FPGA)配置信息文件进行验证。同时,提出了一种能够有效提高硬件在线解压速度的改进方法,该方法在Virtex-4FPGA上得到实现。实验表明,对于器件占用率为90%以上和20%的FPGA配置,该算法的压缩率分别达到25%和9%。与现有的方法相比,该算法在压缩率上具有优势,并可适用于多种器件。Aiming at the configuration compression in reconfigurable computing systems, the paper puts forward a configuration compression algorithm based on contextually adaptive arithmetic coding. The proposed algorithm obtains the approximate symbol probability by dynamically adjusting the parameters, and eliminates the multiplication and division by using shift operations. It introduces the distribution mechanism based on context into the compression and decompression process to realize configuration compression, so the required configuration storage space and the amount of configuration being transmissed when reeonfiguratiny can be reduced. The algorithm was verified by testing field programmable gate array (FPGA) configuration files. Simultaneously, a decompressing circuit, which accelerates the decompression speed, was designed and implemented on the Virtex-4 FPGA. The experiments show that, for the configuration with the device occupancy rate of 90% and 20%, the proposed algorithm can achieve the compression ratio reaching to 25% and 9% respectively. Compared with the existing methods, the presented gets the higher compression ratio and also can be adopted to various equipments.
分 类 号:TP338[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.145.90.123