<p>This work presents a new algorithm and its hardware implementation for full data sorting unit targeting flexibility, low-cost, and low-power consumption. It is able not only to sort in expected order, but also to record the index of each sorted value corresponding to the original input sequence. The recording of the position of the ordered values is a distinctive feature compared to previous works. Moreover, without using input/output constraints, the proposed design is very flexible and easily extensible, resulting in wide usability for many different applications. In addition, by combining partially parallel and serial processing, our proposed architecture can significantly improve hardware performance. The implementation results on Xilinx Kintex-7 Field-programmable gate array (FPGA) show that our work provides remarkable reductions in terms of both hardware resources and power consumption. More precisely, with a 16-input sorter, the proposed design reduces the number of slices from <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="34_2025_3196_Article_IEq1.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="38" /> </InlineMediaObject> <EquationSource Format="TEX">\(2.2 \times \)</EquationSource> </InlineEquation> to <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="34_2025_3196_Article_IEq2.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="38" /> </InlineMediaObject> <EquationSource Format="TEX">\(5.6 \times \)</EquationSource> </InlineEquation> and the power consumption from <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="34_2025_3196_Article_IEq3.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="38" /> </InlineMediaObject> <EquationSource Format="TEX">\(2.8 \times \)</EquationSource> </InlineEquation> to <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="34_2025_3196_Article_IEq4.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="38" /> </InlineMediaObject> <EquationSource Format="TEX">\(6.1 \times \)</EquationSource> </InlineEquation> compared to the state-of-the-art implementations.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

An Efficient Sorting Algorithm and Its Hardware Architecture for General Applications

  • Thien-Truong Nguyen-Ly,
  • Kim-Anh Nguyen

摘要

This work presents a new algorithm and its hardware implementation for full data sorting unit targeting flexibility, low-cost, and low-power consumption. It is able not only to sort in expected order, but also to record the index of each sorted value corresponding to the original input sequence. The recording of the position of the ordered values is a distinctive feature compared to previous works. Moreover, without using input/output constraints, the proposed design is very flexible and easily extensible, resulting in wide usability for many different applications. In addition, by combining partially parallel and serial processing, our proposed architecture can significantly improve hardware performance. The implementation results on Xilinx Kintex-7 Field-programmable gate array (FPGA) show that our work provides remarkable reductions in terms of both hardware resources and power consumption. More precisely, with a 16-input sorter, the proposed design reduces the number of slices from \(2.2 \times \) to \(5.6 \times \) and the power consumption from \(2.8 \times \) to \(6.1 \times \) compared to the state-of-the-art implementations.