Algorithms of finding the first two minimum values and their hardware implementation

Chin Long Wey, Ming Der Shieh, Shin Yo Lin

研究成果: Article同行評審

85 引文 斯高帕斯(Scopus)

摘要

Given a set of numbers X, finding the minimum value of X, min_1st, is a very easy task. However, efficiently finding its second minimum value, min_2nd, requires the derivations of min_1st and finding the minimum value from the set of the remaining numbers. Efficient algorithms and cost-effective hardware of finding the two smallest of X are greatly needed for the low-density parity-check (LDPC) decoder design. The following two architectures are developed in this paper: 1) sorting-based (XS) approach and 2) tree structure (TS) approach. Experimental results show that the XS approach provides less number of comparisons, while the TS approach achieves higher speed performance at lower hardware cost. Since the hardware unit is repeatedly used in the LDPC decoder design, the proposed high-speed low-cost TS approach is strongly recommended.

原文English
頁(從 - 到)3430-3437
頁數8
期刊IEEE Transactions on Circuits and Systems I: Regular Papers
55
發行號11
DOIs
出版狀態Published - 2008

All Science Journal Classification (ASJC) codes

  • 電氣與電子工程

指紋

深入研究「Algorithms of finding the first two minimum values and their hardware implementation」主題。共同形成了獨特的指紋。

引用此