基于互连网络的比特置换实现技术  

Bit permutation based on interconnection network

作　　者：常忠祥[1] 戴紫彬[1] 李伟[1] 陈帆[1] 马超[1] 

机构地区：[1]信息工程大学,河南郑州450001

出　　处：《计算机工程与设计》2014年第8期2640-2644,2665,共6页Computer Engineering and Design

摘　　要：为降低比特置换实现资源占用和配置信息容量,提出通过单向抽取和双向抽取实现比特置换的方法。将归并排序算法和抽取相结合,通过外部控制序列生成互联网络的路由信息,降低比特置换所需次数和资源占用。对单向抽取和双向抽取进行硬件映射和比特置换适配。实验结果表明,该方法便于硬件实现,能够在较少次数内完成比特置换操作,有效缓和比特置换实现时,灵活性、资源占用和处理速度间的矛盾。To reduce resource occupancy capacity and configuration information of the bit displacement, a method was proposed based on the one-way extraction and the two-way extraction to achieve the bit replacement. This method combined merge sort al gorithm and extraction together, and generated network routing information by using external control sequence, which reduced the number of times required and resource consumed by the bit displacement. One-way extraction and two-way extraction were hardware mapped and adapted to the bit replacement. The results show that this approach can be implemented on the hardware, be completed with less number of times of bits replacement operation, and effectively mollifies contradiction among the flexibility, the resource usage, and the processing speed during bit displacement realization process.

关 键 词：比特置换 控制序列生成 互连网络 归并排序 算法 

分 类 号：TP302.2[自动化与计算机技术—计算机系统结构]