Derives average SINR expressions for linear detectors in BSNs and applies Max-Sum message-passing to solve integer programming for sub-channel allocation, claiming ZF superiority for large networks and order-of-magnitude faster runtime than convex optimization.
On the e xactness of the cavity method for weighted b-matchings on arbitrary graphs and its relation to linear programs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Inference-Based Resource Allocation for Multi-Cell Backscatter Sensor Networks
Derives average SINR expressions for linear detectors in BSNs and applies Max-Sum message-passing to solve integer programming for sub-channel allocation, claiming ZF superiority for large networks and order-of-magnitude faster runtime than convex optimization.