Infinite Factorial Finite State Machine for Blind Multiuser Channel Estimation
Francisco J. R. Ruiz, Isabel Valera, Lennart Svensson, Fernando, Perez-Cruz

TL;DR
This paper introduces an innovative Bayesian nonparametric model for blind multiuser channel estimation that can adapt to an unknown and varying number of transmitters, improving data recovery in asynchronous communication systems.
Contribution
The paper develops the infinite factorial finite state machine model and an inference algorithm, enabling blind estimation of channels and data without prior knowledge of transmitters or channel parameters.
Findings
Effective recovery of data-generating process across various scenarios
Handles an unbounded number of transmitters with arbitrary channel length
Works well in different SNR conditions
Abstract
New communication standards need to deal with machine-to-machine communications, in which users may start or stop transmitting at any time in an asynchronous manner. Thus, the number of users is an unknown and time-varying parameter that needs to be accurately estimated in order to properly recover the symbols transmitted by all users in the system. In this paper, we address the problem of joint channel parameter and data estimation in a multiuser communication channel in which the number of transmitters is not known. For that purpose, we develop the infinite factorial finite state machine model, a Bayesian nonparametric model based on the Markov Indian buffet that allows for an unbounded number of transmitters with arbitrary channel length. We propose an inference algorithm that makes use of slice sampling and particle Gibbs with ancestor sampling. Our approach is fully blind as it…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
