Pith. sign in

REVIEW

Hierarchical sparse recovery from hierarchically structured measurements with application to massive random access

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2105.03169 v1 pith:TK7G3WPQ submitted 2021-05-07 cs.IT eess.SPmath.IT

classification cs.ITeess.SPmath.IT
keywords hierarchicalrecoverysparseaccessblockframeworkhierarchicallymassive
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

A new family of operators, coined hierarchical measurement operators, is introduced and discussed within the well-known hierarchical sparse recovery framework. Such operator is a composition of block and mixing operations and notably contains the Kronecker product as a special case. Results on their hierarchical restricted isometry property (HiRIP) are derived, generalizing prior work on recovery of hierarchically sparse signals from Kronecker-structured linear measurements. Specifically, these results show that, very surprisingly, sparsity properties of the block and mixing part can be traded against each other. The measurement structure is well-motivated by a massive random access channel design in communication engineering. Numerical evaluation of user detection rates demonstrate the huge benefit of the theoretical framework.

Discussion (0). Continue with ORCID to comment.

Pith tools