13,039 research outputs found

    MAC with Action-Dependent State Information at One Encoder

    Full text link
    Problems dealing with the ability to take an action that affects the states of state-dependent communication channels are of timely interest and importance. Therefore, we extend the study of action-dependent channels, which until now focused on point-to-point models, to multiple-access channels (MAC). In this paper, we consider a two-user, state-dependent MAC, in which one of the encoders, called the informed encoder, is allowed to take an action that affects the formation of the channel states. Two independent messages are to be sent through the channel: a common message known to both encoders and a private message known only to the informed encoder. In addition, the informed encoder has access to the sequence of channel states in a non-causal manner. Our framework generalizes previously evaluated settings of state dependent point-to-point channels with actions and MACs with common messages. We derive a single letter characterization of the capacity region for this setting. Using this general result, we obtain and compute the capacity region for the Gaussian action-dependent MAC. The unique methods used in solving the Gaussian case are then applied to obtain the capacity of the Gaussian action-dependent point-to-point channel; a problem was left open until this work. Finally, we establish some dualities between action-dependent channel coding and source coding problems. Specifically, we obtain a duality between the considered MAC setting and the rate distortion model known as "Successive Refinement with Actions". This is done by developing a set of simple duality principles that enable us to successfully evaluate the outcome of one problem given the other.Comment: 1. Parts of this paper appeared in the IEEE International Symposium on Information Theory (ISIT 2012),Cambridge, MA, US, July 2012 and at the IEEE 27th Convention of Electrical and Electronics Engineers in Israel (IEEEI 2012), Nov. 2012. 2. This work has been supported by the CORNET Consortium Israel Ministry for Industry and Commerc

    Improved Finite Blocklength Converses for Slepian-Wolf Coding via Linear Programming

    Full text link
    A new finite blocklength converse for the Slepian- Wolf coding problem is presented which significantly improves on the best known converse for this problem, due to Miyake and Kanaya [2]. To obtain this converse, an extension of the linear programming (LP) based framework for finite blocklength point- to-point coding problems from [3] is employed. However, a direct application of this framework demands a complicated analysis for the Slepian-Wolf problem. An analytically simpler approach is presented wherein LP-based finite blocklength converses for this problem are synthesized from point-to-point lossless source coding problems with perfect side-information at the decoder. New finite blocklength metaconverses for these point-to-point problems are derived by employing the LP-based framework, and the new converse for Slepian-Wolf coding is obtained by an appropriate combination of these converses.Comment: under review with the IEEE Transactions on Information Theor

    Wiretap and Gelfand-Pinsker Channels Analogy and its Applications

    Full text link
    An analogy framework between wiretap channels (WTCs) and state-dependent point-to-point channels with non-causal encoder channel state information (referred to as Gelfand-Pinker channels (GPCs)) is proposed. A good sequence of stealth-wiretap codes is shown to induce a good sequence of codes for a corresponding GPC. Consequently, the framework enables exploiting existing results for GPCs to produce converse proofs for their wiretap analogs. The analogy readily extends to multiuser broadcasting scenarios, encompassing broadcast channels (BCs) with deterministic components, degradation ordering between users, and BCs with cooperative receivers. Given a wiretap BC (WTBC) with two receivers and one eavesdropper, an analogous Gelfand-Pinsker BC (GPBC) is constructed by converting the eavesdropper's observation sequence into a state sequence with an appropriate product distribution (induced by the stealth-wiretap code for the WTBC), and non-causally revealing the states to the encoder. The transition matrix of the state-dependent GPBC is extracted from WTBC's transition law, with the eavesdropper's output playing the role of the channel state. Past capacity results for the semi-deterministic (SD) GPBC and the physically-degraded (PD) GPBC with an informed receiver are leveraged to furnish analogy-based converse proofs for the analogous WTBC setups. This characterizes the secrecy-capacity regions of the SD-WTBC and the PD-WTBC, in which the stronger receiver also observes the eavesdropper's channel output. These derivations exemplify how the wiretap-GP analogy enables translating results on one problem into advances in the study of the other

    Code designs for MIMO broadcast channels

    Get PDF
    Recent information-theoretic results show the optimality of dirty-paper coding (DPC) in achieving the full capacity region of the Gaussian multiple-input multiple-output (MIMO) broadcast channel (BC). This paper presents a DPC based code design for BCs. We consider the case in which there is an individual rate/signal-to-interference-plus-noise ratio (SINR) constraint for each user. For a fixed transmitter power, we choose the linear transmit precoding matrix such that the SINRs at users are uniformly maximized, thus ensuring the best bit-error rate performance. We start with Cover's simplest two-user Gaussian BC and present a coding scheme that operates 1.44 dB from the boundary of the capacity region at the rate of one bit per real sample (b/s) for each user. We then extend the coding strategy to a two-user MIMO Gaussian BC with two transmit antennas at the base-station and develop the first limit-approaching code design using nested turbo codes for DPC. At the rate of 1 b/s for each user, our design operates 1.48 dB from the capacity region boundary. We also consider the performance of our scheme over a slow fading BC. For two transmit antennas, simulation results indicate a performance loss of only 1.4 dB, 1.64 dB and 1.99 dB from the theoretical limit in terms of the total transmission power for the two, three and four user case, respectively

    Successive Refinement with Decoder Cooperation and its Channel Coding Duals

    Full text link
    We study cooperation in multi terminal source coding models involving successive refinement. Specifically, we study the case of a single encoder and two decoders, where the encoder provides a common description to both the decoders and a private description to only one of the decoders. The decoders cooperate via cribbing, i.e., the decoder with access only to the common description is allowed to observe, in addition, a deterministic function of the reconstruction symbols produced by the other. We characterize the fundamental performance limits in the respective settings of non-causal, strictly-causal and causal cribbing. We use a new coding scheme, referred to as Forward Encoding and Block Markov Decoding, which is a variant of one recently used by Cuff and Zhao for coordination via implicit communication. Finally, we use the insight gained to introduce and solve some dual channel coding scenarios involving Multiple Access Channels with cribbing.Comment: 55 pages, 15 figures, 8 tables, submitted to IEEE Transactions on Information Theory. A shorter version submitted to ISIT 201
    corecore