VLSI implementation of 0(n*n) sorting algorithms and their hardware comparison

Saurabh Kotiyal, Himanshu Thapliyal, M. B. Srinivas, Hamid R. Arabnia

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper proposes the hardware implementation of 0(n*n) sorting algorithms; Bubble Sort, Insertion Sort and Selection Sort. The coding of the sorting algorithms is done in Verilog HDL and the FPGA synthesis is done using Xilinx libraries. The result shows that hardware implementation of Insertion sort algorithm is more efficient than Bubble Sort and Selection Sort in terms of area and speed. In hardware implementation Selection Sort has the worst propagation delay and area.

Original languageEnglish
Title of host publicationProceedings of the 2005 International Conference on Scientific Computing, CSC'05
Pages74-77
Number of pages4
StatePublished - 2005
Event2005 International Conference on Scientific Computing, CSC'05 - Las Vegas, NV, United States
Duration: Jun 20 2005Jun 23 2005

Publication series

NameProceedings of the 2005 International Conference on Scientific Computing, CSC'05

Conference

Conference2005 International Conference on Scientific Computing, CSC'05
Country/TerritoryUnited States
CityLas Vegas, NV
Period6/20/056/23/05

ASJC Scopus subject areas

  • Computer Science Applications

Fingerprint

Dive into the research topics of 'VLSI implementation of 0(n*n) sorting algorithms and their hardware comparison'. Together they form a unique fingerprint.

Cite this