arXiv subjects

H. Vincent Poor

Publications and source records attributed to H. Vincent Poor.

At least 865 records · Page 48Linked to original sources

arXiv2008

Energy-Efficient Power Control in Multipath CDMA Channels via Large System Analysis

This paper is focused on the design and analysis of power control procedures for the uplink of multipath code-division-multiple-access (CDMA) channels based on the large system analysis (LSA). Using the tools of LSA, a new decentralized power control algorithm aimed at energy efficiency maximization and requiring very little prior information on the interference background is proposed; moreover, it is also shown that LSA can be used to predict with good accuracy the performance and operational conditions of a large network operating at the equilibrium over a multipath channel, i.e. the power, signal-to-interference-plus-noise ratio (SINR) and utility profiles across users, wherein the utility is defined as the number of bits reliably delivered to the receiver for each energy-unit used for transmission. Additionally, an LSA-based performance comparison among linear receivers is carried out in terms of achieved energy efficiency at the equilibrium. Finally, the problem of the choice of the utility-maximizing training length is also considered. Numerical results show a very satisfactory agreement of the theoretical analysis with simulation results obtained with reference to systems with finite (and not so large) numbers of users.

cs.IT↗

arXiv2008

Dimensionally Distributed Learning: Models and Algorithm

This paper introduces a framework for regression with dimensionally distributed data with a fusion center. A cooperative learning algorithm, the iterative conditional expectation algorithm (ICEA), is designed within this framework. The algorithm can effectively discover linear combinations of individual estimators trained by each agent without transferring and storing large amount of data amongst the agents and the fusion center. The convergence of ICEA is explored. Specifically, for a two agent system, each complete round of ICEA is guaranteed to be a non-expansive map on the function space of each agent. The advantages and limitations of ICEA are also discussed for data sets with various distributions and various hidden rules. Moreover, several techniques are also designed to leverage the algorithm to effectively learn more complex hidden rules that are not linearly decomposable.

cs.IT↗

arXiv2008

On the Performance of Selection Relaying

Interest in selection relaying is growing. The recent developments in this area have largely focused on information theoretic analyses such as outage performance. Some of these analyses are accurate only at high SNR regimes. In this paper error rate analyses that are sufficiently accurate over a wide range of SNR regimes are provided. The motivations for this work are that practical systems operate at far lower SNR values than those supported by the high SNR analysis. To enable designers to make informed decisions regarding network design and deployment, it is imperative that system performance is evaluated with a reasonable degree of accuracy over practical SNR regimes. Simulations have been used to corroborate the analytical results, as close agreement between the two is observed.

cs.IT↗

arXiv2008

An ESPRIT-based approach for Initial Ranging in OFDMA systems

This work presents a novel Initial Ranging scheme for orthogonal frequency-division multiple-access networks. Users that intend to establish a communication link with the base station (BS) are normally misaligned both in time and frequency and the goal is to jointly estimate their timing errors and carrier frequency offsets with respect to the BS local references. This is accomplished with affordable complexity by resorting to the ESPRIT algorithm. Computer simulations are used to assess the effectiveness of the proposed solution and to make comparisons with existing alternatives.

cs.IT↗

arXiv2008

Opportunistic Collaborative Beamforming with One-Bit Feedback

An energy-efficient opportunistic collaborative beamformer with one-bit feedback is proposed for ad hoc sensor networks over Rayleigh fading channels. In contrast to conventional collaborative beamforming schemes in which each source node uses channel state information to correct its local carrier offset and channel phase, the proposed beamforming scheme opportunistically selects a subset of source nodes whose received signals combine in a quasi-coherent manner at the intended receiver. No local phase-precompensation is performed by the nodes in the opportunistic collaborative beamformer. As a result, each node requires only one-bit of feedback from the destination in order to determine if it should or shouldn't participate in the collaborative beamformer. Theoretical analysis shows that the received signal power obtained with the proposed beamforming scheme scales linearly with the number of available source nodes. Since the the optimal node selection rule requires an exhaustive search over all possible subsets of source nodes, two low-complexity selection algorithms are developed. Simulation results confirm the effectiveness of opportunistic collaborative beamforming with the low-complexity selection algorithms.

cs.IT↗

arXiv2008

Uplink Macro Diversity of Limited Backhaul Cellular Network

In this work new achievable rates are derived, for the uplink channel of a cellular network with joint multicell processing, where unlike previous results, the ideal backhaul network has finite capacity per-cell. Namely, the cell sites are linked to the central joint processor via lossless links with finite capacity. The cellular network is abstracted by symmetric models, which render analytical treatment plausible. For this idealistic model family, achievable rates are presented for cell-sites that use compress-and-forward schemes combined with local decoding, for both Gaussian and fading channels. The rates are given in closed form for the classical Wyner model and the soft-handover model. These rates are then demonstrated to be rather close to the optimal unlimited backhaul joint processing rates, already for modest backhaul capacities, supporting the potential gain offered by the joint multicell processing approach. Particular attention is also given to the low-SNR characterization of these rates through which the effect of the limited backhaul network is explicitly revealed. In addition, the rate at which the backhaul capacity should scale in order to maintain the original high-SNR characterization of an unlimited backhaul capacity system is found.

cs.IT↗

arXiv2008

Lossless Compression with Security Constraints

Secure distributed data compression in the presence of an eavesdropper is explored. Two correlated sources that need to be reliably transmitted to a legitimate receiver are available at separate encoders. Noise-free, limited rate links from the encoders to the legitimate receiver, one of which can also be perfectly observed by the eavesdropper, are considered. The eavesdropper also has its own correlated observation. Inner and outer bounds on the achievable compression-equivocation rate region are given. Several different scenarios involving the side information at the transmitters as well as multiple receivers/eavesdroppers are also considered.

cs.IT↗

arXiv2008

Lossy Source Transmission over the Relay Channel

Lossy transmission over a relay channel in which the relay has access to correlated side information is considered. First, a joint source-channel decode-and-forward scheme is proposed for general discrete memoryless sources and channels. Then the Gaussian relay channel where the source and the side information are jointly Gaussian is analyzed. For this Gaussian model, several new source-channel cooperation schemes are introduced and analyzed in terms of the squared-error distortion at the destination. A comparison of the proposed upper bounds with the cut-set lower bound is given, and it is seen that joint source-channel cooperation improves the reconstruction quality significantly. Moreover, the performance of the joint code is close to the lower bound on distortion for a wide range of source and channel parameters.

cs.IT↗

arXiv2008

On the Spectrum of Large Random Hermitian Finite-Band Matrices

The open problem of calculating the limiting spectrum (or its Shannon transform) of increasingly large random Hermitian finite-band matrices is described. In general, these matrices include a finite number of non-zero diagonals around their main diagonal regardless of their size. Two different communication setups which may be modeled using such matrices are presented: a simple cellular uplink channel, and a time varying inter-symbol interference channel. Selected recent information-theoretic works dealing directly with such channels are reviewed. Finally, several characteristics of the still unknown limiting spectrum of such matrices are listed, and some reflections are touched upon.

cs.IT↗

arXiv2008

Distributed MIMO Systems with Oblivious Antennas

A scenario in which a single source communicates with a single destination via a distributed MIMO transceiver is considered. The source operates each of the transmit antennas via finite-capacity links, and likewise the destination is connected to the receiving antennas through capacity-constrained channels. Targeting a nomadic communication scenario, in which the distributed MIMO transceiver is designed to serve different standards or services, transmitters and receivers are assumed to be oblivious to the encoding functions shared by source and destination. Adopting a Gaussian symmetric interference network as the channel model (as for regularly placed transmitters and receivers), achievable rates are investigated and compared with an upper bound. It is concluded that in certain asymptotic and non-asymptotic regimes obliviousness of transmitters and receivers does not cause any loss of optimality.

cs.IT↗

arXiv2008

On the Secure Degrees of Freedom in the K-User Gaussian Interference Channel

This paper studies the K-user Gaussian interference channel with secrecy constraints. Two distinct network models, namely the interference channel with confidential messages and the one with an external eavesdropper, are analyzed. Using interference alignment along with secrecy pre-coding at each transmitter, it is shown that each user in the network can achieve non-zero secure Degrees of Freedoms (DoFs) in both scenarios. In particular, the proposed coding scheme achieves (K-2)/(2K-2) secure DoFs for each user in the interference channel with confidential messages model, and (K-2)/2K secure DoFs in the case of an external eavesdropper. The fundamental difference between the two scenarios stems from the lack of channel state information (CSI) about the external eavesdropper. Remarkably, the results establish the positive impact of interference on the secrecy capacity of wireless networks.

cs.IT↗

arXiv2008

Optimal Node Density for Two-Dimensional Sensor Arrays

The problem of optimal node density for ad hoc sensor networks deployed for making inferences about two dimensional correlated random fields is considered. Using a symmetric first order conditional autoregressive Gauss-Markov random field model, large deviations results are used to characterize the asymptotic per-node information gained from the array. This result then allows an analysis of the node density that maximizes the information under an energy constraint, yielding insights into the trade-offs among the information, density and energy.

cs.IT↗

arXiv2008

Information, Energy and Density for Ad Hoc Sensor Networks over Correlated Random Fields: Large Deviations Analysis

Using large deviations results that characterize the amount of information per node on a two-dimensional (2-D) lattice, asymptotic behavior of a sensor network deployed over a correlated random field for statistical inference is investigated. Under a 2-D hidden Gauss-Markov random field model with symmetric first order conditional autoregression, the behavior of the total information [nats] and energy efficiency [nats/J] defined as the ratio of total gathered information to the required energy is obtained as the coverage area, node density and energy vary.

cs.IT↗

arXiv2008

The Gaussian Wiretap Channel with a Helping Interferer

Due to the broadcast nature of the wireless medium, wireless communication is susceptible to adversarial eavesdropping. This paper describes how eavesdropping can potentially be defeated by exploiting the superposition nature of the wireless medium. A Gaussian wire-tap channel with a helping interferer (WTC-HI) is considered in which a transmitter sends confidential messages to its intended receiver in the presence of a passive eavesdropper and with the help of an interferer. The interferer, which does not know the confidential message assists the confidential message transmission by sending a signal that is independent of the transmitted message. An achievable secrecy rate and a Sato-type upper bound on the secrecy capacity are given for the Gaussian WTC-HI. Through numerical analysis, it is found that the upper bound is close to the achievable secrecy rate when the interference is weak for symmetric interference channels, and under more general conditions for asymmetric Gaussian interference channels.

cs.IT↗

arXiv2008

Cellular Systems with Full-Duplex Compress-and-Forward Relaying and Cooperative Base Stations

In this paper the advantages provided by multicell processing of signals transmitted by mobile terminals (MTs) which are received via dedicated relay terminals (RTs) are studied. It is assumed that each RT is capable of full-duplex operation and receives the transmission of adjacent relay terminals. Focusing on intra-cell TDMA and non-fading channels, a simplified relay-aided uplink cellular model based on a model introduced by Wyner is considered. Assuming a nomadic application in which the RTs are oblivious to the MTs' codebooks, a form of distributed compress-and-forward (CF) scheme with decoder side information is employed. The per-cell sum-rate of the CF scheme is derived and is given as a solution of a simple fixed point equation. This achievable rate reveals that the CF scheme is able to completely eliminate the inter-relay interference, and it approaches a ``cut-set-like'' upper bound for strong RTs transmission power. The CF rate is also shown to surpass the rate of an amplify-and-forward scheme via numerical calculations for a wide range of the system parameters.

cs.IT↗

arXiv2008

Sum-Capacity of Ergodic Fading Interference and Compound Multiaccess Channels

The problem of resource allocation is studied for two-sender two-receiver fading Gaussian interference channels (IFCs) and compound multiaccess channels (C-MACs). The senders in an IFC communicate with their own receiver (unicast) while those in a C-MAC communicate with both receivers (multicast). The instantaneous fading state between every transmit-receive pair in this network is assumed to be known at all transmitters and receivers. Under an average power constraint at each source, the sum-capacity of the C-MAC and the power policy that achieves this capacity is developed. The conditions defining the classes of strong and very strong ergodic IFCs are presented and the multicast sum-capacity is shown to be tight for both classes.

cs.IT↗

arXiv2008

Decentralized Two-Hop Opportunistic Relaying With Limited Channel State Information

A network consisting of $n$ source-destination pairs and $m$ relays is considered. Focusing on the large system limit (large $n$), the throughput scaling laws of two-hop relaying protocols are studied for Rayleigh fading channels. It is shown that, under the practical constraints of single-user encoding-decoding scheme, and partial channel state information (CSI) at the transmitters (via integer-value feedback from the receivers), the maximal throughput scales as $\log n$ even if full relay cooperation is allowed. Furthermore, a novel decentralized opportunistic relaying scheme with receiver CSI, partial transmitter CSI, and no relay cooperation, is shown to achieve the optimal throughput scaling law of $\log n$.

cs.IT↗

arXiv2008

Rateless Coding for MIMO Block Fading Channels

In this paper the performance limits and design principles of rateless codes over fading channels are studied. The diversity-multiplexing tradeoff (DMT) is used to analyze the system performance for all possible transmission rates. It is revealed from the analysis that the design of such rateless codes follows the design principle of approximately universal codes for parallel multiple-input multiple-output (MIMO) channels, in which each sub-channel is a MIMO channel. More specifically, it is shown that for a single-input single-output (SISO) channel, the previously developed permutation codes of unit length for parallel channels having rate LR can be transformed directly into rateless codes of length L having multiple rate levels (R, 2R, . . ., LR), to achieve the DMT performance limit.

cs.IT↗