對具異質回饋之抹除廣播通道的容量分析

This thesis work investigates the capacity region, i.e. the achievable information rates, of the Broadcast Erasure Channel (BEC) with heterogeneous Channel State Information (CSI) at the encoder. The adjective“heterogeneous” means that in the BEC under examination coexist two types of receivers: those that instantaneously feedback the channel realization in terms of ACK/NACK (D-type users) and those that are silent (N-type users). The capacity region of the BEC entirely composed of N-type users is a long-standing and classical result of network information theory while the BEC entirely made of D-type users has been characterized only in the last decade. For the mixed case, the capacity region has not been characterized yet and only recently it has been shown that, for the two user BEC, the D-N and D-D scenarios have the same capacity region. In view of this result, we investigate mixed case with more than two users: we provide novel outer-bounds, achievability results, we show that the capacity decreases (with respect to the all-D scenario) when there is more than one N-type user in the communication system and we prove that time-division is no longer the optimal way to trade rate between N-type user in presence of D-type users in the system

並列關鍵字

Broadcast Channel ； Erasure Channel ； Network Information Theory ； Heterogeneous Feedback ； Capacity Region

參考文獻

[1] P Bergmans. Random coding theorem for broadcast channels with degraded components. IEEE Transactions on Information Theory, 19(2):197–207, 1973.

Google Scholar

[2] Leonard S Charlap, Howard D Rees, and David P Robbins. The asymptotic probability that a random biased matrix is invertible. Discrete Mathematics, 82(2):153–163, 1990.