NEW SYSTOLIC ARRAYS FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM

被引：12
|
作者：
LIN, YC
机构：
[1] Dept. of Electronic Engineering, National Taiwan Institute of Technology, Taipei, 106
来源：
PARALLEL COMPUTING | 1994年 / 20卷 / 09期
关键词：
LONGEST COMMON SUBSEQUENCE; PARALLEL ALGORITHMS; SYSTOLIC ARRAYS;
D O I：
10.1016/0167-8191(94)90040-X
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
New systolic arrays are presented to solve the longest common subsequence (LCS) problem. The first array is based on a previous work to compute the length of an LCS. The second array improves on the first one. The second array is about 1/4 faster than the first array, and each processing element (PE) of the second array requires one less port for both input and output to transfer one less value. Either of the two arrays can be equipped with a content-addressable memory in each PE to recover an LCS. The resulting array requires fewer steps than the previously proposed one.
引用
收藏
页码：1323 / 1334
页数：12
相关论文
共 50 条
12345