English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The number of wireless devices which are connected to a single Wireless LocalArea Network continues to grow each year. As a result, the orchestration of somany devices becomes a daunting, resource--consuming task, especially when theresources available at the single access point are limited, and it is hard toanticipate which devices will request access at any given time. On the otherhand, the number of antennas on both the devices and the access point grows aswell, facilitating advanced joint scheduling and coding techniques.  In this paper, we leverage the large number of antennas and suggest a massivemultiple-user multiple-input-multiple-output (MU-MIMO) scheme using sparsecoding based on Group Testing (GT) principles. The scheme allows for a smallsubset of devices to transmit simultaneously, without a preceding schedulingphase or coordination, thus reducing overhead and complexity.  Specifically, we show that out of a population of \(N\) devices, it ispossible to jointly identify and decode \(K\) devices, unknown in advance,simultaneously and without any scheduling. The scheme utilizes minimalknowledge of channel state, uses an efficient (in both run-time and space)decoding algorithm, and requires \(O(K\log N\mathcal{M})\) antennas, where\(\mathcal{M}\) is the number of messages per device. In fact, we prove thatthis scheme is order--optimal in the number of users and messages.  This is done by deriving sufficient conditions for a vanishing errorprobability (a direct result), bounding the minimal number of antennasnecessary for any such scheme (a converse result), and showing that theseresults are asymptotically tight.

Order-optimal Joint Transmission and Identification in Massive Multi-User MIMO via Group Testing