Abstract
In this paper, we explore the identification of sparse FIR systems having quantized output data. Our approach is based on the use of regularization. We explore several aspects concerning the implementation of the Expectation-Maximization (EM) algorithm, including: i) a general framework, based on mean-variance Gaussian mixtures, for incorporating a regularization term that forces sparsity, ii) utilization of Markov Chain Monte Carlo techniques (namely a Gibbs sampler) and scenarios to implement the EM algorithm for multiple input multiple output systems. We show that for single input single output systems, it is possible to obtain closed form expressions for solving the EM algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
