arXiv subjects

Yimin Pang

Publications and source records attributed to Yimin Pang.

4 recordsLinked to original sources

arXiv2018

A Unified Theory of Multiple-Access and Interference Channels via Approximate Capacity Regions for the MAC-IC-MAC

Approximate capacity regions are established for a class of interfering multiple access channels consisting of two multiple-access channels (MACs), each with an arbitrary number of transmitters, with one transmitter in each MAC causing interference to the receiver of the other MAC, a channel we refer to henceforth as the MAC-IC-MAC. For the discrete memoryless (DM) MAC-IC-MAC, two inner bounds are obtained that are generalizations of prior inner bounds for the two-user DM interference channel (IC) due to Chong {\em et al}. For the semi-deterministic MAC-IC-MAC, it is shown that single-user coding at the non-interfering transmitters and superposition coding at the interfering transmitter of each MAC achieves a rate region that is within a quantifiable gap of the capacity region, thereby extending such a result for the two-user semi-deterministic IC by Telatar and Tse. For the Gaussian MAC-IC-MAC, an approximate capacity region that is within a constant gap of the capacity region is obtained, generalizing such a result for the two-user Gaussian IC by Etkin {\em et al}. Contrary to the aforementioned approximate capacity results for the two-user IC whose achievability requires the union of all admissible input distributions, our gap results on the semi-deterministic and the Gaussian MAC-IC-MAC are achievable by only a subset and one of all admissible coding distributions, respectively. The symmetric generalized degrees of freedom (GDoF) of the symmetric Gaussian MAC-IC-MAC with more than one user per cell, which is a function of the interference strength (the ratio of INR to SNR at high SNR, both expressed in dB) and the numbers of users in each cell, is V-shaped with flat shoulders. ...

cs.IT↗

arXiv2016

Wi-Fi Coexistence with Duty Cycled LTE-U

Coexistence of Wi-Fi and LTE-Unlicensed (LTE-U) technologies has drawn significant concern in industry. In this paper, we investigate the Wi-Fi performance in the presence of duty cycle based LTE-U transmission on the same channel. More specifically, one LTE-U cell and one Wi-Fi basic service set (BSS) coexist by allowing LTE-U devices transmit their signals only in predetermined duty cycles. Wi-Fi stations, on the other hand, simply contend the shared channel using the distributed coordination function (DCF) protocol without cooperation with the LTE-U system or prior knowledge about the duty cycle period or duty cycle of LTE-U transmission. We define the fairness of the above scheme as the difference between Wi-Fi performance loss ratio (considering a defined reference performance) and the LTE-U duty cycle (or function of LTE-U duty cycle). Depending on the interference to noise ratio (INR) being above or below -62dbm, we classify the LTE-U interference as strong or weak and establish mathematical models accordingly. The average throughput and average service time of Wi-Fi are both formulated as functions of Wi-Fi and LTE-U system parameters using probability theory. Lastly, we use the Monte Carlo analysis to demonstrate the fairness of Wi-Fi and LTE-U air time sharing.

cs.IT↗

arXiv2011

An Upper Bound on Broadcast Subspace Codes

Linear operator broadcast channel (LOBC) models the scenario of multi-rate packet broadcasting over a network, when random network coding is applied. This paper presents the framework of algebraic coding for LOBCs and provides a Hamming-like upper bound on (multishot) subspace codes for LOBCs.

cs.IT↗

arXiv2011

Towards the Capacity Region of Multiplicative Linear Operator Broadcast Channels

Recent research indicates that packet transmission employing random linear network coding can be regarded as transmitting subspaces over a linear operator channel (LOC). In this paper we propose the framework of linear operator broadcast channels (LOBCs) to model packet broadcasting over LOCs, and we do initial work on the capacity region of constant-dimension multiplicative LOBCs(CMLOBCs), a generalization of broadcast erasure channels. Two fundamental problems regarding CMLOBCs are addressed-finding necessary and sufficient conditions for degradation and deciding whether time sharing suffices to achieve the boundary of the capacity region in the degraded case.

cs.IT↗