{"arxiv_id":"2305.08363","incoming":{"papers":0,"sentences":0,"groups":[],"unlabelled_sentences":0},"outgoing":{"papers":3,"sentences":16,"groups":[{"kind":"extends","label":"Builds on","papers":1,"sentences":1,"quotes":[{"arxiv_id":"2211.15294","title":"Fairness Scheduling in Dense User-Centric Cell-Free Massive MIMO Networks","url":"/paper/2211.15294","section":"Related Literature","sentence":"We build on the system proposed in [ref] , which considers $>$ UEs, and sets $$ as the number of active users that (approximately) maximizes the network total SE.","intent_p":0.85,"contests_p":null}]},{"kind":"method_or_tool","label":"Uses the method or tool of","papers":2,"sentences":3,"quotes":[{"arxiv_id":"2207.11478","title":"Overloaded Pilot Assignment with Pilot Decontamination for Cell-Free Systems","url":"/paper/2207.11478","section":"Pilot and Cluster Reallocation Scheme","sentence":"Given the selected set $(t)$, UL pilots and user-centric clusters are assigned to the active UEs following the semi-overloaded pilot assignment method from [ref] , where an RU may assign the same pilot sequence to multiple UEs provided that the channel subspaces of the UEs are nearly mutually orthogonal, such that accurate channel estimation is possible (negligible mutual pilot contamination, using the decontamination method of [ref] ).","intent_p":1.0,"contests_p":null},{"arxiv_id":"2211.15294","title":"Fairness Scheduling in Dense User-Centric Cell-Free Massive MIMO Networks","url":"/paper/2211.15294","section":"Rate Allocation","sentence":"Hence, the optimization of $r_k$ is immediate and yields [ref] [equation] Since, as said before, the statistics of $_k( _k (t), (t) )$ for a UE $k$ are generally extremely hard to obtain and depend on the scheduling policy itself, here we consider the localized adaptive scheme proposed in [ref] , where each user $k$ collects a sliding window of $N$ past samples of the instantaneous mutual information and optimizes its transmission rate $r_k$ using the empirical complementary CDF based on these samples.[As in [ref] , the allocated rates are initialized by a “start-up” phase consisting of $N_init$ time slots.","intent_p":0.97,"contests_p":null}]},{"kind":"data_used","label":"Uses data or values from","papers":1,"sentences":1,"quotes":[{"arxiv_id":"2211.15294","title":"Fairness Scheduling in Dense User-Centric Cell-Free Massive MIMO Networks","url":"/paper/2211.15294","section":"Numerical Evaluations and Outlook","sentence":"Since we consider a network like in [ref] , we choose $τ_p = 20$ and $=40$, the approximate optimal parameters according to the results in [ref] .","intent_p":0.92,"contests_p":null}]},{"kind":"comparison","label":"Compares with","papers":1,"sentences":2,"quotes":[{"arxiv_id":"2211.15294","title":"Fairness Scheduling in Dense User-Centric Cell-Free Massive MIMO Networks","url":"/paper/2211.15294","section":"Concluding Remarks","sentence":"We proposed a fixed pilot and cluster assignment scheme under scheduling, which greatly reduces the communication overhead between UEs and RUs, while also achieving better performance compared to the scheme in [ref] .","intent_p":1.0,"contests_p":null}]},{"kind":"supports_this_paper","label":"Cites as support","papers":1,"sentences":1,"quotes":[{"arxiv_id":"2301.06520","title":"UL-DL duality for cell-free massive MIMO with per-AP power and information constraints","url":"/paper/2301.06520","section":"Uplink Decoding with Partial Channel State Information","sentence":"We focus on UL results, since by duality, the UL and downlink data rates and system performance are almost identical [ref] . =-1","intent_p":0.96,"contests_p":null}]},{"kind":"background","label":"Cites as background","papers":1,"sentences":2,"quotes":[{"arxiv_id":"2211.15294","title":"Fairness Scheduling in Dense User-Centric Cell-Free Massive MIMO Networks","url":"/paper/2211.15294","section":"Related Literature","sentence":"Scheduling in cell-free massive MIMO has been considered in relatively few works [ref] in comparison with the very large number of papers considering the ergodic rate of a fixed set of “always active” users (see, e.g., [ref] and references therein).","intent_p":0.88,"contests_p":null}]}],"unlabelled_sentences":6},"claims":[],"thresholds":{"intent_p":0.8,"supports_p":0.95,"contests_p":0.7},"method":"Citing sentences come from each paper's LaTeX source; every \\cite marks the sentence and the works it cites. Pith's classifier typed each sentence. A label is shown at intent probability 0.8 or more (0.95 for support), a contest at 0.7 or more. Measured accuracy against two blind model families is at https://pith.science/accuracy. The quoted sentences are the citing authors' own.","held_up":null,"_links":{"html":"https://pith.science/paper/2305.08363"}}