Search Process and Probabilistic Bifix Approach
Dragana Bajic, Cedomir Stefanovic, Dejan Vukobratovic
Abstract
An analytical approach to a search process is a mathematical prerequisite for digital synchronization acquisition analysis and optimization. A search is performed for an arbitrary set of sequences within random but not equiprobable L-ary data. This paper derives in detail an expression for probability distribution function, from which other statistical parameters - expected value and variance - can be obtained. The probabilistic nature of (cross-) bifix indicators is shown and application examples are outlined, ranging beyond the usual telecommunication field.
Create a lesson
Related papers
Distributed Consensus, Optimization, and Learning under Communication Constraints
Zheng Chen, Nicolò Michelusi, Themistoklis Charalambous et al.
Energy-Accumulate-Then-Act Backscatter Communications With Retransmission Under Imperfect Feedback Detection
Rui Xu, Yinghui Ye, Guangyue Lu et al.
The Exact Memory-Rate Tradeoff for Three-User Secure Coded Caching
Han Fang, Nan Liu, Wei Kang
Cross-Modal Semantic Successive Refinement for Generative Image Communication over Underwater Acoustic Channels
Xu Pei, Bin Wang, Guangxu Zhu et al.
Fano's Inequality and Channel Capacity in the Individual-Sequence Regime
Neri Merhav
Exact Transport-Information Correspondence for Distribution-Adaptive Discretization
Koretaka Yuge