A CONSTANT TIME SORTING ALGORITHM FOR A THREE DIMENSIONAL RECONFIGURABLE MESH AND RECONFIGURABLE NETWORK

1995 ◽  
Vol 05 (03) ◽  
pp. 401-412 ◽  
Author(s):  
MARK S. MERRY ◽  
JOHNNIE BAKER
Keyword(s):  
Computer Science ◽  
Real Number ◽  
Three Dimensional ◽  
Time Algorithm ◽  
Constant Time ◽  
Sorting Algorithm ◽  
Compression Algorithms ◽  
Reconfigurable Mesh ◽  
Integer Sorting ◽  
Time Selection

Sorting techniques have numerous applications in computer science. Current real number and integer sorting techniques for the reconfigurable mesh operate in constant time using a reconfigurable mesh of size n × n to sort n numbers. This paper presents a constant time algorithm to sort n items on a reconfigurable network with [Formula: see text] switches and [Formula: see text] processors. Also, new constant time selection and compression algorithms are given. All results may also be implemented on the 3-D reconfigurable mesh.

A MORE EFFICIENT CONSTANT TIME ALGORITHM FOR COMPUTING THE HOUGH TRANSFORM

1994 ◽  
Vol 04 (01n02) ◽  
pp. 45-52 ◽  
Author(s):  
YI PAN
Keyword(s):  
Parameter Space ◽  
Real World ◽  
Hough Transform ◽  
Time Complexity ◽  
Time Algorithm ◽  
Constant Time ◽  
Reconfigurable Mesh

An efficient Hough transform algorithm on a reconfigurable mesh is proposed in this paper. For a problem with N edge pixels and an n×n parameter space, our algorithm runs in constant time on a 4-dimensional N× log 2N×n×n reconfigurable mesh. The previous best algorithm for the same problem runs in a constant time on a 4-dimensional n×N×N×N reconfigurable mesh. Since n is always smaller than N in real world (in fact, n is in the order of N1/2), our algorithm reduces the number of processors used drastically while keeping the same time complexity.

A constant-time parallel sorting algorithm and its optical implementation

IEEE Micro ◽  
1995 ◽  
Vol 15 (3) ◽  
pp. 60-71 ◽  
Author(s):  
A. Louri ◽  
J.A. Hatch ◽  
Jongwhoa Na
Keyword(s):  
Constant Time ◽  
Sorting Algorithm ◽  
Parallel Sorting

PERMUTATION ROUTING AND SORTING ON THE RECONFIGURABLE MESH

1998 ◽  
Vol 09 (02) ◽  
pp. 199-211
Author(s):  
SANGUTHEVAR RAJASEKARAN ◽  
THEODORE MCKENDALL
Keyword(s):  
Lower Bound ◽  
Randomized Algorithms ◽  
Linear Array ◽  
Order Term ◽  
Routing Algorithm ◽  
Sorting Algorithm ◽  
Routing Problem ◽  
Reconfigurable Mesh ◽  
Permutation Routing ◽  
Time Bounds

In this paper we demonstrate the power of reconfiguration by presenting efficient randomized algorithms for both packet routing and sorting on a reconfigurable mesh connected computer. The run times of these algorithms are better than the best achievable time bounds on a conventional mesh. Many variations of the reconfigurable mesh can be found in the literature. We define yet another variation which we call as Mr. We also make use of the standard PARBUS model. We show that permutation routing problem can be solved on a linear array Mr of size n in [Formula: see text] steps, whereas n-1 is the best possible run time without reconfiguration. A trivial lower bound for routing on Mr will be [Formula: see text]. On the PARBUS linear array, n is a lower bound and hence any standard n-step routing algorithm will be optimal. We also show that permutation routing on an n×n reconfigurable mesh Mr can be done in time n+o(n) using a randomized algorithm or in time 1.25n+o(n) deterministically. In contrast, 2n-2 is the diameter of a conventional mesh and hence routing and sorting will need at least 2n-2 steps on a conventional mesh. A lower bound of [Formula: see text] is in effect for routing on the 2D mesh Mr as well. On the other hand, n is a lower bound for routing on the PARBUS and our algorithms have the same time bounds on the PARBUS as well. Thus our randomized routing algorithm is optimal upto a lower order term. In addition we show that the problem of sorting can be solved in randomized time n+o(n) on Mr as well as on PARBUS. Clearly, this sorting algorithm will be optimal on the PARBUS model. The time bounds of our randomized algorithms hold with high probability.

scholarly journals Classification of Some Special Types Ruled Surfaces in Simply Isotropic 3-Space

2017 ◽  
Vol 55 (1) ◽  
pp. 87-98 ◽  
Author(s):  
Murat Kemal Karacan ◽  
Dae Won Yoon ◽  
Nural Yuksel
Keyword(s):  
Real Number ◽  
Laplace Operator ◽  
Fundamental Form ◽  
Three Dimensional ◽  
Ruled Surfaces ◽  
Isotropic Space ◽  
Simply Isotropic Space ◽  
The Laplace Operator ◽  
First Fundamental Form

AbstractIn this paper, we classify two types ruled surfaces in the three dimensional simply isotropic space I13under the condition ∆xi= λixiwhere ∆ is the Laplace operator with respect to the first fundamental form and λ is a real number. We also give explicit forms of these surfaces.

Enhanced Three-Dimensional Color Conversion Based on Discrete Wavelet Transform

2012 ◽  
Vol 155-156 ◽  
pp. 440-444
Author(s):  
He Yan ◽  
Xiu Feng Wang
Keyword(s):  
Information Technology ◽  
Wavelet Transform ◽  
Image Reconstruction ◽  
Image Quality ◽  
Image Compression ◽  
High Performance ◽  
Three Dimensional ◽  
Discrete Wavelet ◽  
Compression Algorithms ◽  
Color Conversion

JPEG2000 algorithm has been developed based on the DWT techniques, which have shown how the results achieved in different areas in information technology can be applied to enhance the performance. Lossy image compression algorithms sacrifice perfect image reconstruction in favor of decreased storage requirements. Wavelets have become a popular technology for information redistribution for high-performance image compression algorithms. Lossy compression algorithms sacrifice perfect image reconstruction in favor of improved compression rates while minimizing image quality lossy.

Sign in / Sign up

Export Citation Format

Share Document