Distributed sequences and search process

被引：21

作者：

Bajic, D ^{[1
]}

Stojanovic, J ^{[1
]}

机构：

[1] Univ Novi Sad, Dept Commun & Signal Proc, YU-21000 Novi Sad, Serbia Monteneg, Serbia

来源：

2004 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-7 | 2004年

关键词：

expected duration of a search; distributed sequences; bifix; cross-bifix;

D O I：

10.1109/ICC.2004.1312542

中图分类号：

TN [电子技术、通信技术];

学科分类号：

0809 ;

摘要：

An analytical approach to a search process for a set of M fixed sequences in random data covers the problems of a search for the sequences with errors, as well as of a search for the distributed sequences. It is of greater practical interest than the formerly analysed case of search for a single sequence. This paper derives statistical parameters (probability distribution function, expected value, variance) of this process, introducing a new term - "cross-bifix". The derived formulae are applied to the case of search for distributed sequences with errors.

引用

页码：514 / 518

页数：5

共 17 条

[1] OPTIMUM PATTERNS FOR FRAME ALIGNMENT [J].