Browsing by Subject "Coding scheme"
Now showing 1 - 3 of 3
Results Per Page
Sort Options
Item Open Access Broadcast erasure channel with feedback: The two multicast case-Algorithms and bounds(IEEE, 2013) Onaran, Efe; Gatzianas, M.; Fragouli, C.We consider the single hop broadcast packet erasure channel (BPEC) with two multicast sessions (each of them destined to a different group of N users) and regularly available instantaneous receiver ACK/NACK feedback. Using the insight gained from recent work on BPEC with unicast and degraded messages [1], [2], we propose a virtual queue based session-mixing algorithm, which does not require knowledge of channel statistics and achieves capacity for N = 2 and iid erasures. Since the extension of this algorithm to N > 2 is not straightforward, we describe a simple algorithm which outperforms standard timesharing for arbitrary N and is actually asymptotically better than timesharing, for any finite N, as the erasure probability goes to zero. We finally provide, through an information-theoretic analysis, sufficient but not necessary asymptotic conditions between N and n (the number of transmissions) for which the achieved sum rate, under any coding scheme, is essentially identical to that of timesharing. © 2013 IEEE.Item Open Access Multi-input multi-output deletion channel(Institute of Electrical and Electronics Engineers, 2012) Wang F.; Duman, T. M.We describe a new channel model suitable in certain applications, namely the multi-input multi-output (MIMO) deletion channel. This channel models the scenarios where multiple transmitters and receivers suffering from synchronization errors are employed. We then consider a coding scheme over such channels based on a serial concatenation of a low-density parity check (LDPC) code, a marker code and a layered space-time code. We design two detectors operating at the bit level which jointly achieve synchronization for the deletion channel (with the help of the marker code) and detection for the MIMO channel. Utilizing the proposed detector together with an LDPC code with powerful error-correction capabilities, we demonstrate that reliable transmission over a MIMO deletion channel is feasible.Item Open Access Polar coding for the Slepian-Wolf problem based on monotone chain rules(IEEE, 2012) Arıkan, ErdalWe give a polar coding scheme that achieves the full admissible rate region in the Slepian-Wolf problem without time-sharing. The method is based on a source polarization result using monotone chain rule expansions. © 2012 IEEE.