A New Class of Optimal Bounded-Degree VLSI Sorting Networks

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

Minimum-area very large scale integration (VLSI) networks have been proposed for sorting N elements in O(log N) time. However, most such networks proposed have complex structure, and no explicit network construction was given in others. This paper presents new designs of optimal VLSI sorters, which combine rotate-sort with enumeration-sort to sort N numbers, each of length w = (1 + є) log N bits (for any constant є < 0), in time T є[Ω(log N),. The main attributes of the proposed sorters are a significantly smaller number of sorting nodes than in previous designs and smaller constant factors in their time complexity. The proposed sorters use a new class of reduced-area K-shuffle layouts to route data between sorting stages. These layouts can be also used to provide explicit designs for Leighton’s column-sort technique.

Original languageEnglish
Pages (from-to)746-752
Number of pages7
JournalIEEE Transactions on Computers
Volume42
Issue number6
DOIs
Publication statusPublished - 1 Jan 1993
Externally publishedYes

Fingerprint

Sorting Networks
VLSI circuits
Sorting
Sort
Layout
Shuffle
Complex Structure
Enumeration
Time Complexity
Attribute
Class
Vertex of a graph
Design

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Software
  • Hardware and Architecture
  • Computational Theory and Mathematics

Cite this

A New Class of Optimal Bounded-Degree VLSI Sorting Networks. / Alnuweiri, Hussein.

In: IEEE Transactions on Computers, Vol. 42, No. 6, 01.01.1993, p. 746-752.

Research output: Contribution to journalArticle

@article{c12e7c91c9ab40fe894345b2fbe1e307,
title = "A New Class of Optimal Bounded-Degree VLSI Sorting Networks",
abstract = "Minimum-area very large scale integration (VLSI) networks have been proposed for sorting N elements in O(log N) time. However, most such networks proposed have complex structure, and no explicit network construction was given in others. This paper presents new designs of optimal VLSI sorters, which combine rotate-sort with enumeration-sort to sort N numbers, each of length w = (1 + є) log N bits (for any constant є < 0), in time T є[Ω(log N),. The main attributes of the proposed sorters are a significantly smaller number of sorting nodes than in previous designs and smaller constant factors in their time complexity. The proposed sorters use a new class of reduced-area K-shuffle layouts to route data between sorting stages. These layouts can be also used to provide explicit designs for Leighton’s column-sort technique.",
author = "Hussein Alnuweiri",
year = "1993",
month = "1",
day = "1",
doi = "10.1109/12.277299",
language = "English",
volume = "42",
pages = "746--752",
journal = "IEEE Transactions on Computers",
issn = "0018-9340",
publisher = "IEEE Computer Society",
number = "6",

}

TY - JOUR

T1 - A New Class of Optimal Bounded-Degree VLSI Sorting Networks

AU - Alnuweiri, Hussein

PY - 1993/1/1

Y1 - 1993/1/1

N2 - Minimum-area very large scale integration (VLSI) networks have been proposed for sorting N elements in O(log N) time. However, most such networks proposed have complex structure, and no explicit network construction was given in others. This paper presents new designs of optimal VLSI sorters, which combine rotate-sort with enumeration-sort to sort N numbers, each of length w = (1 + є) log N bits (for any constant є < 0), in time T є[Ω(log N),. The main attributes of the proposed sorters are a significantly smaller number of sorting nodes than in previous designs and smaller constant factors in their time complexity. The proposed sorters use a new class of reduced-area K-shuffle layouts to route data between sorting stages. These layouts can be also used to provide explicit designs for Leighton’s column-sort technique.

AB - Minimum-area very large scale integration (VLSI) networks have been proposed for sorting N elements in O(log N) time. However, most such networks proposed have complex structure, and no explicit network construction was given in others. This paper presents new designs of optimal VLSI sorters, which combine rotate-sort with enumeration-sort to sort N numbers, each of length w = (1 + є) log N bits (for any constant є < 0), in time T є[Ω(log N),. The main attributes of the proposed sorters are a significantly smaller number of sorting nodes than in previous designs and smaller constant factors in their time complexity. The proposed sorters use a new class of reduced-area K-shuffle layouts to route data between sorting stages. These layouts can be also used to provide explicit designs for Leighton’s column-sort technique.

UR - http://www.scopus.com/inward/record.url?scp=0027610772&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0027610772&partnerID=8YFLogxK

U2 - 10.1109/12.277299

DO - 10.1109/12.277299

M3 - Article

AN - SCOPUS:0027610772

VL - 42

SP - 746

EP - 752

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

SN - 0018-9340

IS - 6

ER -