For greedy block sparse recovery with unknown sparsity level, we theoretically derive a stopping condition to terminate the iteration process and thus to estimate the sparsity level. Focused on the block orthogonal matching pursuit (BOMP) algorithm, we model the energy of residual signals from a probabilistic perspective and we use its distribution to derive a threshold, the iteration process is terminated when the residual energy is below the given threshold. Specifically, a communication scenario of small packet transmission is considered, which uses the interference cancellation based BOMP (ICBOMP) algorithm to recover sparse signal, we apply the stopping condition to terminate the iterations, and thus to estimate the number of active users. Simulation results show that our derived condition can accurately estimate the sparsity level and at the same time guarantees a favorable recovery accuracy, both for the BOMP and ICBOMP recoveries.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Stopping Condition for Greedy Block Sparse Signal Recovery


    Contributors:
    Luo, Yu (author) / Xie, Ronggui (author) / Yin, Huarui (author) / Wang, Weidong (author)


    Publication date :

    2017-09-01


    Size :

    165486 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Stopping distance and signal spacing

    Sheets, R.A. | Engineering Index Backfile | 1935


    RAIL FOUNDATION BLOCK AND SYSTEM FOR STOPPING

    OIKE HIDEMI / OIKE ETSUJI | European Patent Office | 2022

    Free access

    Traffic Signal Optimization with Greedy Randomized Tabu Search Algorithm

    Hu, T.-Y. / Chen, L.-W. | British Library Online Contents | 2012