A linear systolic algorithm for the triangular stein equation 1 1This work has been supported by CICYT Grant TIC-87–0655.

1991 ◽  
Vol 24 (7) ◽  
pp. 43-47
Author(s):  
J.L. Hueso ◽  
G. Martínez ◽  
V. Hernández
Keyword(s):  
Stein Equation ◽  
Systolic Algorithm

DESIGNING A SYSTOLIC ALGORITHM FOR GENERATING WELL-FORMED PARENTHESIS STRINGS

2004 ◽  
Vol 14 (01) ◽  
pp. 83-97
Author(s):  
JONG-CHUANG TSAY
Keyword(s):  
Linear Array ◽  
Vlsi Implementation ◽  
Processor Array ◽  
Lexicographical Order ◽  
Systolic Algorithm ◽  
Left And Right ◽  
Local Connection

A parenthesis string is a string of left and right parentheses. The string is well-formed when it consists of balanced pairs of left and right parentheses. This study presents a novel systolic algorithm for generating all the well-formed parenthesis strings in lexicographical order. The algorithm is cost-optimal and is run on a linear array of processors such that each well-formed parenthesis string can be generated in three time steps. The processor array is appropriate for VLSI implementation, since it has the features of modularity, regularity, and local connection.

What is a Systolic Algorithm?

1986 ◽  
Author(s):  
Sailesh K. Rao ◽  
T. Kollath
Keyword(s):  
Systolic Algorithm

Distributed optimisation design for solving the Stein equation with constraints

2019 ◽  
Vol 13 (15) ◽  
pp. 2492-2499 ◽  
Author(s):  
Guanpu Chen ◽  
Xianlin Zeng ◽  
Yiguang Hong
Keyword(s):  
Stein Equation

A faster linear systolic algorithm for recovering a longest common subsequence

1997 ◽  
Vol 61 (3) ◽  
pp. 129-136 ◽  
Author(s):  
Thierry Lecroq ◽  
Guillaume Luce ◽  
Jean Frédéric Myoupo
Keyword(s):  
Longest Common Subsequence ◽  
Systolic Algorithm ◽  
Common Subsequence
Sign in / Sign up

Export Citation Format

Share Document