Power and Area Efficient Sorting Networks Using Unary Processing
Power and Area Efficient Sorting Networks Using Unary Processing
复制标题
使用一元处理的功率和面积高效的排序网络
DOI：
10.1109/iccd.2017.27
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
K. Bazargan
中科院分区：
文献类型：
--
作者：
M. Najafi;David J. Lilja;Marc D. Riedel;K. Bazargan
从信号和图像处理到开关系统的广泛应用中，排序是一项常见的任务。对于需要高性能的应用程序，通常在硬件中执行排序。硬件成本和功耗是主要的关注点。通常的方法是将一个称为批处理（或Bitonic）网络的配置中的比较和S-wap单元网络连接。本文提出了一种基于“一般处理”的新型领域和有效方法来分类网络。数据被编码为串行位流，其值在0和1的流中以1的分数表示。 （这是先前在随机逻辑上的工作的演变。与随机逻辑不同，一元方法是确定性且完全准确的。）与常规二进制实现相比，完整排序网络的综合结果最多可达87％的面积和功率。但是，潜伏期会增加。为了减轻延迟的增加，本文使用了新颖的数据编码。通过实施分类的重要应用来验证该方法：中值过滤。结果是中值过滤的低成本，节能实施，仅准确损失了。
Sorting is a common task in a wide range of applications from signal and image processing to switching systems. For applications that require high performance, sorting is often performed in hardware. Hardware cost and power consumption are the dominant concerns. The usual approach is to wire up a network of compare-and-swap units in a configuration called a Batcher (or Bitonic) network. This paper proposes a novel area-and power-efficient approach to sorting networks based on "unary processing." Data is encoded as serial bit-streams, with values represented by the fraction of 1's in a stream of 0's and 1's. (This is an evolution of prior work on stochastic logic. Unlike stochastic logic, the unary approach is deterministic and completely accurate.) Synthesis results of complete sorting networks show up to 87% area and power saving compared to the conventional binary implementations. However, the latency increases. To mitigate the increased latency, the paper uses a novel time-encoding of data. The approach is validated with implementation of an important application of sorting: median filtering. The result is a low-cost, energy-efficient implementation of median filtering with only a slight accuracy loss.