Infinite Factorial Finite State Machine for Blind Multiuser Channel Estimation

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 does not require a prior channel estimation step, prior knowledge of the number of transmitters, or any signaling information. Our experimental results, loosely based on the LTE random access channel, show that the proposed approach can effectively recover the data-generating process for a wide range of scenarios, with varying number of transmitters, number of receivers, constellation order, channel length, and signal-to-noise ratio.Comment: 15 pages, 15 figure

PDA-BCJR algorithm for factorial hidden Markov models with application to MIMO equalisation

Publication in the conference proceedings of EUSIPCO, Florence, Italy, 200

Thirty Years of Machine Learning: The Road to Pareto-Optimal Wireless Networks

Future wireless networks have a substantial potential in terms of supporting a broad range of complex compelling applications both in military and civilian fields, where the users are able to enjoy high-rate, low-latency, low-cost and reliable information services. Achieving this ambitious goal requires new radio techniques for adaptive learning and intelligent decision making because of the complex heterogeneous nature of the network structures and wireless services. Machine learning (ML) algorithms have great success in supporting big data analytics, efficient parameter estimation and interactive decision making. Hence, in this article, we review the thirty-year history of ML by elaborating on supervised learning, unsupervised learning, reinforcement learning and deep learning. Furthermore, we investigate their employment in the compelling applications of wireless networks, including heterogeneous networks (HetNets), cognitive radios (CR), Internet of things (IoT), machine to machine networks (M2M), and so on. This article aims for assisting the readers in clarifying the motivation and methodology of the various ML algorithms, so as to invoke them for hitherto unexplored services as well as scenarios of future wireless networks.Comment: 46 pages, 22 fig

A Mobile Wireless Channel State Recognition Algorihm: Introduction, Definition, and Verification - Sensing for Cognitive Environmental Awareness

This research includes mobile wireless systems limited by time and frequency dispersive channels. A blind mobile wireless channel (MWC) state recognition (CSR) algorithm that detects hidden coherent nonselective and noncoherent selective processes is verified. Because the algorithm is blind, it releases capacity based on current channel state that traditionally is fixed and reserved for channel gain estimation and distortion mitigation. The CSR algorithm enables cognitive communication system control including signal processing, resource allocation/deallocation, or distortion mitigation selections based on channel coherence states. MWC coherent and noncoherent states, ergodicity, stationarity, uncorrelated scattering, and Markov processes are assumed for each time block. Furthermore, a hidden Markov model (HMM) is utilized to represent the statistical relationships between hidden dispersive processes and observed receive waveform processes. First-order and second-order statistical extracted features support state hard decisions which are combined in order to increase the accuracy of channel state estimates. This research effort has architected, designed, and verified a blind statistical feature recognition algorithm capable of detecting coherent nonselective, single time selective, single frequency selective, or dual selective noncoherent states. A MWC coherence state model (CSM) was designed to represent these hidden dispersive processes. Extracted statistical features are input into a parallel set of trained HMMs that compute state sequence conditional likelihoods. Hard state decisions are combined to produce a single most likely channel state estimate for each time block. To verify the CSR algorithm performance, combinations of hidden state sequences are applied to the CSR algorithm and verified against input hidden state sequences. State sequence recognition accuracy sensitivity was found to be above 99% while specificity was determined to be above 98% averaged across all features, states, and sequences. While these results establish the feasibility of a MWC blind CSR algorithm, optimal configuration requires future research to further improve performance including: 1) characterizing the range of input signal configurations, 2) waveform feature block size reduction, 3) HMM parameter tracking, 4) HMM computational complexity and latency reduction, 5) feature soft decision combining, 6) recursive implementation, 7) interfacing with state based mobile wireless communication control processes, and 8) extension to wired or wireless waveform recognition

Blind separation for intermittent sources via sparse dictionary learning

Radio frequency sources are observed at a fusion center via sensor measurements made over slow flat-fading channels. The number of sources may be larger than the number of sensors, but their activity is sparse and intermittent with bursty transmission patterns. To account for this, sources are modeled as hidden Markov models with known or unknown parameters. The problem of blind source estimation in the absence of channel state information is tackled via a novel algorithm, consisting of a dictionary learning (DL) stage and a per-source stochastic filtering (PSF) stage. The two stages work in tandem, with the latter operating on the output produced by the former. Both stages are designed so as to account for the sparsity and memory of the sources. To this end, smooth LASSO is integrated with DL, while the forward-backward algorithm and Expectation Maximization (EM) algorithm are leveraged for PSF. It is shown that the proposed algorithm can enhance the detection and the estimation performance of the sources, and that it is robust to the sparsity level and average duration of transmission of the source signals

Infinite Factorial Finite State Machine for Blind Multiuser Channel Estimation

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 does not require a prior channel estimation step, prior knowledge of the number of transmitters, or any signaling information. Our experimental results, loosely based on the LTE random access channel, show that the proposed approach can effectively recover the data-generating process for a wide range of scenarios, with varying number of transmitters, number of receivers, constellation order, channel length, and signal-to-noise ratio