Abstract
A search process for a single, fixed pattern in random data is a topic that had attracted attention of both mathematicians and engineers. In this paper are derived the statistical parameters and probability density function (p.d.f.) of an extended problem - a search for multiple patterns. An analysis of the search process for a fixed pattern with errors in random data (equivalent to the search process for a set of patterns in random data) is given. An analysis of the search process for distributed (interleaved) patterns, where pattern symbols are scattered within the random (scrambled) data symbols, is also given. Some application examples are shown.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
