Abstract
We present a new linear systolic array architecture of m cells which outputs a longest common subsequence (LCS) of two input strings A and B in time n + 2 m, where n and m denote the lengths of A and B respectively ( m ⩽ n). Our approach improves the time of execution required by previous linear systolic arrays for this purpose. Furthermore, a design combining a tree with the linear array provides an LCS and its length in n + m + log m clock cycles only.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call