{"paper":{"title":"DoF Analysis of the MIMO Broadcast Channel with Alternating/Hybrid CSIT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Borzoo Rassouli, Bruno Clerckx, Chenxi Hao","submitted_at":"2016-01-27T11:09:20Z","abstract_excerpt":"We consider a $K$-user multiple-input single-output (MISO) broadcast channel (BC) where the channel state information (CSI) of user $i(i=1,2,\\ldots,K)$ may be instantaneously perfect (P), delayed (D) or not known (N) at the transmitter with probabilities $\\lambda_P^i$, $\\lambda_D^i$ and $\\lambda_N^i$, respectively. In this setting, according to the three possible CSIT for each user, knowledge of the joint CSIT of the $K$ users could have at most $3^K$ states. In this paper, given the marginal probabilities of CSIT (i.e., $\\lambda_P^i$, $\\lambda_D^i$ and $\\lambda_N^i$), we derive an outer bound"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.07325","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}