Abstract
A novel block wise convex combination algorithm with adjusting blocks is proposed for block-sparse system identification. The proposed algorithm unifies the complementary advantages of different block-induced algorithms, which are based on block proportionate matrix and block zero attracting penalty. A mixing parameter for block wise combination is designed as a block diagonal matrix. The mixing parameter is obtained using the conventional mixing parameter, which represents convergence state, and a block activeness indicator. The indicator for each block is derived from the lϵ0-norm measure of the block. Moreover, a block adjustment algorithm is developed using the indicator to overcome the main disadvantage of block-induced algorithms, i.e., the dependency on cluster location. The simulations for system identification are performed on several block-sparse systems including systems with single cluster and double clusters. The simulation results show that the proposed algorithm not only combines the different block-induced algorithms effectively but also improves the performance via the block adjustment 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.
