The Relation Between Discrete Convolution/Correlation and String Matching, and Exploring the Possibility of a Deterministic Linear-Time Algorithm for Discrete Convolution/Correlation

This paper explores the relation between discrete convolution/correlation and string matching for different specific classes of input signals. We examine the time complexity of computation for both convolution/correlation and string matching, and explore the possibility of a deterministic algorithm for discrete convolution/correlation.