✦ LIBER ✦

Constant time sorting on reconfigurable meshes

✍ Scribed by Chen, Y.-C.; Chen, W.-T.

Book ID: 119772202
Publisher: IEEE
Year: 1994
Tongue: English
Weight: 353 KB
Volume: 43
Category: Article
ISSN: 0018-9340
DOI: 10.1109/12.286307

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Constant-time thresholding on reconfigur

Constant-time thresholding on reconfigurable mesh

✍ Kuo-Liang Chung 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 388 KB

hresholding is a very important labeling operation on a gray-scale image. It refers to setting all the gray levels below a certain level to binary value 0; above that certain level to binary value 1. Given the histogram of one N X N image, this paper presents a constant-time thresholding on a reconf

A constant-time channel-assignment algor

A constant-time channel-assignment algorithm on reconfigurable meshes

✍ Stephan Olariu; James L. Schwing; Jingyuan Zhang 📂 Article 📅 1992 🏛 Springer Netherlands 🌐 English ⚖ 760 KB

Applications of reconfigurable meshes to

Applications of reconfigurable meshes to constant-time computations

✍ Stephan Olariu; James L Schwing; Jingyuan Zhang 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 567 KB

Constant-Time Algorithm for the Euclidea

Constant-Time Algorithm for the Euclidean Distance Transform on Reconfigurable Meshes

✍ Amitava Datta; Subbiah Soundaralakshmi 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 288 KB

The Euclidean distance transform (EDT) is an operation to convert a binary image consisting of black and white pixels to a representation where each pixel has the Euclidean distance of the nearest black pixel. The EDT has many applications in computer vision and image processing. In this paper, we p

An Optimal Sorting Algorithm on Reconfig

An Optimal Sorting Algorithm on Reconfigurable Mesh

✍ J. Jang; V.K. Prasanna 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 853 KB

This paper shows nontrivial ways to use the Reconfigurable Mesh to solve several basic arithmetic problems in constant time. These solutions are obtained by novel ways to represent numbers and by exploiting the reconfigurability of the architecture. In particular, a constant time algorithm to add \(

Sorting n Numbers on n × n Reconfigurabl

Sorting n Numbers on n × n Reconfigurable Meshes with Buses

✍ M. Nigam; S. Sahni 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 857 KB

We show how column sort and rotate sort can be implemented on the different reconfigurable mesh with buses (RMB) architectures that have been proposed in the literature. On all of these proposed RMB architectures, we are able to sort \(n\) numbers on an \(n \times n\) configuration in \(O(1)\) time.