By Topic

An analysis of the search process for different patterns in random data

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Bajic, D. ; Tech. Sci. Fac., Novi Sad Univ., Novi Sad, Yugoslavia ; Stojanovic, J.

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.

Published in:

EUROCON 2003. Computer as a Tool. The IEEE Region 8  (Volume:2 )

Date of Conference:

22-24 Sept. 2003