arXiv subjects

Urbashi Mitra

Publications and source records attributed to Urbashi Mitra.

104 records · Page 6Linked to original sources

arXiv2012

A Game Theoretic Model for the Gaussian Broadcast Channel

The behavior of rational and selfish players (receivers) over a multiple-input multiple-output Gaussian broadcast channel is investigated using the framework of noncooperative game theory. In contrast to the game-theoretic model of the Gaussian multiple access channel where the set of feasible actions for each player is independent of other players' actions, the strategies of the players in the broadcast channel are mutually coupled, usually by a sum power or joint covariance constraint, and hence cannot be treated using traditional Nash equilibrium solution concepts. To characterize the strategic behavior of receivers connected to a single transmitter, this paper models the broadcast channel as a generalized Nash equilibrium problem with coupled constraints. The concept of normalized equilibrium (NoE) is used to characterize the equilibrium points and the existence and uniqueness of the NoE are proven for key scenarios.

cs.IT↗

arXiv2012

Action Dependent Strictly Causal State Communication

The problem of communication and state estimation is considered in the context of channels with actiondependent states. Given the message to be communicated, the transmitter chooses an action sequence that affects the formation of the channel states, and then creates the channel input sequence based on the state sequence. The decoder estimates the channel to some distortion as well as decodes the message. The capacity-distortion tradeoff of such a channel is characterized for the case when the state information is available strictly causally at the channel encoder. The problem setting extends the action dependent framework of [1] and as a special case recovers the results of few previously considered joint communication and estimation scenarios in [2], [3], [4]. The scenario when the action is also allowed to depend on the past observed states (adaptive action) is also considered. It is shown that such adaptive action yields an improved capacity-distortion function.

cs.IT↗

arXiv2011

Cognitive Interference Management in Retransmission-Based Wireless Networks

Cognitive radio methodologies have the potential to dramatically increase the throughput of wireless systems. Herein, control strategies which enable the superposition in time and frequency of primary and secondary user transmissions are explored in contrast to more traditional sensing approaches which only allow the secondary user to transmit when the primary user is idle. In this work, the optimal transmission policy for the secondary user when the primary user adopts a retransmission based error control scheme is investigated. The policy aims to maximize the secondary users' throughput, with a constraint on the throughput loss and failure probability of the primary user. Due to the constraint, the optimal policy is randomized, and determines how often the secondary user transmits according to the retransmission state of the packet being served by the primary user. The resulting optimal strategy of the secondary user is proven to have a unique structure. In particular, the optimal throughput is achieved by the secondary user by concentrating its transmission, and thus its interference to the primary user, in the first transmissions of a primary user packet. The rather simple framework considered in this paper highlights two fundamental aspects of cognitive networks that have not been covered so far: (i) the networking mechanisms implemented by the primary users (error control by means of retransmissions in the considered model) react to secondary users' activity; (ii) if networking mechanisms are considered, then their state must be taken into account when optimizing secondary users' strategy, i.e., a strategy based on a binary active/idle perception of the primary users' state is suboptimal.

cs.IT↗

arXiv2011

Joint Transmission and State Estimation: A Constrained Channel Coding Approach

A scenario involving a source, a channel, and a destination, where the destination is interested in {\em both} reliably reconstructing the message transmitted by the source and estimating with a fidelity criterion the state of the channel, is considered. The source knows the channel statistics, but is oblivious to the actual channel state realization. Herein it is established that a distortion constraint for channel state estimation can be reduced to an additional cost constraint on the source input distribution, in the limit of large coding block length. A newly defined capacity-distortion function thus characterizes the fundamental tradeoff between transmission rate and state estimation distortion. It is also shown that non-coherent communication coupled with channel state estimation conditioned on treating the decoded message as training symbols achieves the capacity-distortion function. Among the various examples considered, the capacity-distortion function for a memoryless Rayleigh fading channel is characterized to within 1.443 bits at high signal-to-noise ratio. The constrained channel coding approach is also extended to multiple access channels, leading to a coupled cost constraint on the input distributions for the transmitting sources.

cs.IT↗

arXiv2011

Active Classification: Theory and Application to Underwater Inspection

We discuss the problem in which an autonomous vehicle must classify an object based on multiple views. We focus on the active classification setting, where the vehicle controls which views to select to best perform the classification. The problem is formulated as an extension to Bayesian active learning, and we show connections to recent theoretical guarantees in this area. We formally analyze the benefit of acting adaptively as new information becomes available. The analysis leads to a probabilistic algorithm for determining the best views to observe based on information theoretic costs. We validate our approach in two ways, both related to underwater inspection: 3D polyhedra recognition in synthetic depth maps and ship hull inspection with imaging sonar. These tasks encompass both the planning and recognition aspects of the active classification problem. The results demonstrate that actively planning for informative views can reduce the number of necessary views by up to 80% when compared to passive methods.

cs.RO↗

arXiv2011

Capacity Bounds for Relay Channels with Inter-symbol Interference and Colored Gaussian Noise

The capacity of a relay channel with inter-symbol interference (ISI) and additive colored Gaussian noise is examined under an input power constraint. Prior results are used to show that the capacity of this channel can be computed by examining the circular degraded relay channel in the limit of infinite block length. The current work provides single letter expressions for the achievable rates with decodeand- forward (DF) and compress-and-forward (CF) processing employed at the relay. Additionally, the cut-set bound for the relay channel is generalized for the ISI/colored Gaussian noise scenario. All results hinge on showing the optimality of the decomposition of the relay channel with ISI/colored Gaussian noise into an equivalent collection of coupled parallel, scalar, memoryless relay channels. The region of optimality of the DF and CF achievable rates are also discussed. Optimal power allocation strategies are also discussed for the two lower bounds and the cut-set upper bound. As the maximizing power allocations for DF and CF appear to be intractable, the desired cost functions are modified and then optimized. The resulting rates are illustrated through the computation of numerical examples.

cs.IT↗

arXiv2010

Optimization of ARQ Protocols in Interference Networks with QoS Constraints

We study optimal transmission strategies in interfering wireless networks, under Quality of Service constraints. A buffered, dynamic network with multiple sources is considered, and sources use a retransmission strategy in order to improve packet delivery probability. The optimization problem is formulated as a Markov Decision Process, where constraints and objective functions are ratios of time-averaged cost functions. The optimal strategy is found as the solution of a Linear Fractional Program, where the optimization variables are the steady-state probability of state-action pairs. Numerical results illustrate the dependence of optimal transmission/interference strategies on the constraints imposed on the network.

eess.SY↗

arXiv2008

Orthogonal Codes for Robust Low-Cost Communication

Orthogonal coding schemes, known to asymptotically achieve the capacity per unit cost (CPUC) for single-user ergodic memoryless channels with a zero-cost input symbol, are investigated for single-user compound memoryless channels, which exhibit uncertainties in their input-output statistical relationships. A minimax formulation is adopted to attain robustness. First, a class of achievable rates per unit cost (ARPUC) is derived, and its utility is demonstrated through several representative case studies. Second, when the uncertainty set of channel transition statistics satisfies a convexity property, optimization is performed over the class of ARPUC through utilizing results of minimax robustness. The resulting CPUC lower bound indicates the ultimate performance of the orthogonal coding scheme, and coincides with the CPUC under certain restrictive conditions. Finally, still under the convexity property, it is shown that the CPUC can generally be achieved, through utilizing a so-called mixed strategy in which an orthogonal code contains an appropriate composition of different nonzero-cost input symbols.

cs.IT↗

arXiv2008

A Spectrum-Shaping Perspective on Cognitive Radio

A new perspective on cognitive radio is presented, where the pre-existent legacy service is either uncoded or coded and a pair of cognitive transceivers need be appropriately deployed to coexist with the legacy service. The basic idea underlying the new perspective is to exploit the fact that, typically, the legacy channel is not fully loaded by the legacy service, thus leaving a non-negligible margin to accommodate the cognitive transmission. The exploitation of such a load margin is optimized by shaping the spectrum of the transmitted cognitive signal. It is shown that non-trivial coexistence of legacy and cognitive systems is possible even without sharing the legacy message with the cognitive transmitter. Surprisingly, the optimized cognitive transmitter is no longer limited by its interference power at the legacy receiver, and can always transmit at its full available device power. Analytical development and numerical illustration are presented, in particular focusing on the logarithmic growth rate, {\it i.e.}, the prelog coefficient, of cognitive transmission in the high-power regime.

cs.IT↗

arXiv2008

A Constrained Channel Coding Approach to Joint Communication and Channel Estimation

A joint communication and channel state estimation problem is investigated, in which reliable information transmission over a noisy channel, and high-fidelity estimation of the channel state, are simultaneously sought. The tradeoff between the achievable information rate and the estimation distortion is quantified by formulating the problem as a constrained channel coding problem, and the resulting capacity-distortion function characterizes the fundamental limit of the joint communication and channel estimation problem. The analytical results are illustrated through case studies, and further issues such as multiple cost constraints, channel uncertainty, and capacity per unit distortion are also briefly discussed.

cs.IT↗

arXiv2007

On Outage Behavior of Wideband Slow-Fading Channels

This paper investigates point-to-point information transmission over a wideband slow-fading channel, modeled as an (asymptotically) large number of independent identically distributed parallel channels, with the random channel fading realizations remaining constant over the entire coding block. On the one hand, in the wideband limit the minimum achievable energy per nat required for reliable transmission, as a random variable, converges in probability to certain deterministic quantity. On the other hand, the exponential decay rate of the outage probability, termed as the wideband outage exponent, characterizes how the number of parallel channels, {\it i.e.}, the ``bandwidth'', should asymptotically scale in order to achieve a target outage probability at a target energy per nat. We examine two scenarios: when the transmitter has no channel state information and adopts uniform transmit power allocation among parallel channels; and when the transmitter is endowed with an one-bit channel state feedback for each parallel channel and accordingly allocates its transmit power. For both scenarios, we evaluate the wideband minimum energy per nat and the wideband outage exponent, and discuss their implication for system performance.

cs.IT↗

arXiv2007

On Outage Behavior of Wideband Slow-Fading Channels

This paper investigates point-to-point information transmission over a wideband slow-fading channel, modeled as an (asymptotically) large number of independent identically distributed parallel channels, with the random channel fading realizations remaining constant over the entire coding block. On the one hand, in the wideband limit the minimum achievable energy per nat required for reliable transmission, as a random variable, converges in probability to certain deterministic quantity. On the other hand, the exponential decay rate of the outage probability, termed as the wideband outage exponent, characterizes how the number of parallel channels, {\it i.e.}, the ``bandwidth'', should asymptotically scale in order to achieve a targeted outage probability at a targeted energy per nat. We examine two scenarios: when the transmitter has no channel state information and adopts uniform transmit power allocation among parallel channels; and when the transmitter is endowed with an one-bit channel state feedback for each parallel channel and accordingly allocates its transmit power. For both scenarios, we evaluate the wideband minimum energy per nat and the wideband outage exponent, and discuss their implication for system performance.

cs.IT↗

arXiv2007

Capacity Gain from Two-Transmitter and Two-Receiver Cooperation

Capacity improvement from transmitter and receiver cooperation is investigated in a two-transmitter, two-receiver network with phase fading and full channel state information available at all terminals. The transmitters cooperate by first exchanging messages over an orthogonal transmitter cooperation channel, then encoding jointly with dirty paper coding. The receivers cooperate by using Wyner-Ziv compress-and-forward over an analogous orthogonal receiver cooperation channel. To account for the cost of cooperation, the allocation of network power and bandwidth among the data and cooperation channels is studied. It is shown that transmitter cooperation outperforms receiver cooperation and improves capacity over non-cooperative transmission under most operating conditions when the cooperation channel is strong. However, a weak cooperation channel limits the transmitter cooperation rate; in this case receiver cooperation is more advantageous. Transmitter-and-receiver cooperation offers sizable additional capacity gain over transmitter-only cooperation at low SNR, whereas at high SNR transmitter cooperation alone captures most of the cooperative capacity improvement.

cs.IT↗

arXiv2005

Performance of PPM Multipath Synchronization in the Limit of Large Bandwidth

The acquisition, or synchronization, of the multipath profile for an ultrawideband pulse position modulation (PPM) communication systems is considered. Synchronization is critical for the proper operation of PPM based For the multipath channel, it is assumed that channel gains are known, but path delays are unknown. In the limit of large bandwidth, W, it is assumed that the number of paths, L, grows. The delay spread of the channel, M, is proportional to the bandwidth. The rate of growth of L versus M determines whether synchronization can occur. It is shown that if L/sqrt(M) --> 0, then the maximum likelihood synchronizer cannot acquire any of the paths and alternatively if L/M --> 0, the maximum likelihood synchronizer is guaranteed to miss at least one path.

cs.IT↗