Multicasting in Large Wireless Networks: Bounds on the Minimum Energy per Bit (2009)
Jain, Aman, Kulkarni, Sanjeev R., Verdu, Sergio
We consider scaling laws for maximal energy efficiency of communicating a message to all the nodes in a wireless network, as the number of nodes in the network becomes large. Two cases of large...
Russian Academy of Sciences (2007)
Viacheslav Prelov, Sergio Verdu
A formula for the second-order expansion of the input-output mutual information of multidimensional channels as the signal-to-noise ratio goes to zero is obtained. While the additive noise is assumed...
Cognitive Interference Channels with Confidential Messages (2007)
Liang, Yingbin, Somekh-Baruch, Anelia, Poor, H. Vincent, Shamai, Shlomo, Verdu, Sergio
The cognitive interference channel with confidential messages is studied. Similarly to the classical two-user interference channel, the cognitive interference channel consists of two transmitters...
Capacity of Queues Via Point-Process Channels (2006)
Sundaresan, Rajesh, Verdu, Sergio
A conceptually simple proof for the capacity formula of an exponential server timing channel is provided. The proof links the timing channel to the point-process channel with instantaneous noiseless...
Fisher III., John W., Cetin, Mujdat, Jaakkola, Tommi, Tsitsiklis, John, Verdu, Sergio, Kulkarni, Sanjeev, ...
This final report summarizes the research and activities under the ODDR&E MURI on Data Fusion in Large Arrays of Microsensors. The report reviews the intellectual themes and research concentration...
Rickard, Scott T., Balan, Radu V., Poor, H. Vincent, Verdu, Sergio
Mobile communication channels are often modeled as linear time-varying filters or, equivalently, as time-frequency integral operators with finite support in time and frequency. Such a...
On-Off Frequency-Shift-Keying for Wideband Fading Channels (2005)
Gursoy, Mustafa Cenk, Verdu, Sergio, Poor, H. Vincent
M-ary On-Off Frequency-Shift-Keying (OOFSK) is a digital modulation format in which M-ary FSK signaling is overlaid on On/Off keying. This paper investigates the potential of this modulation format...
Randomly Spread CDMA: Asymptotics via Statistical Physics (2005)
This paper studies randomly spread code-division multiple access (CDMA) and multiuser detection in the large-system limit using the replica method developed in statistical physics. Arbitrary input...
The Noncoherent Rician Fading Channel -- Part I : Structure of the Capacity-Achieving Input (2005)
Gursoy, Mustafa Cenk, Poor, H. Vincent, Verdu, Sergio
Transmission of information over a discrete-time memoryless Rician fading channel is considered where neither the receiver nor the transmitter knows the fading coefficients. First the structure of...
Gursoy, Mustafa Cenk, Poor, H. Vincent, Verdu, Sergio
Transmission of information over a discrete-time memoryless Rician fading channel is considered where neither the receiver nor the transmitter knows the fading coefficients. The...
Mutual Information and Minimum Mean-square Error in Gaussian Channels (2004)
Guo, Dongning, Shamai, Shlomo, Verdu, Sergio
This paper deals with arbitrarily distributed finite-power input signals observed through an additive Gaussian noise channel. It shows a new formula that connects the input-output mutual information...
Practical schemes for interactive data exchange (2004)
Building upon Slepian-Wolf coding, sparse-graph codes, belief propagation, and closed-loop iterative doping, we propose new schemes for interactive data exchange between two agents who want to...
A "Small World" Approach to Heterogeneous Networks (2003)
Kulkarni, Sanjeev R., Reznik, Alex, Verdu, Sergio
We consider a heterogeneous (also called "hybrid") ad-hoc network with wired and wireless links. This type of network was previously considered by Kulkarni and Viswanath in [9] where achievable...
Inequalities for the L1 Deviation of the Empirical Distribution (2003)
Tsachy Weissman, Tsachy Weissman, Erik Ordentlich, Erik Ordentlich, Gadiel Seroussi, Gadiel Seroussi, ...
We derive bounds on the probability that the L 1 distance between the empirical distribution of a sequence of independent identically distributed random variables and the true distribution is more...
Spectral efficiency of low-complexity multiuser detectors (2000)
Abstract- A family of multiuser detectors is ana-lyzed which require neither matrix inversions nor oth-er operations with significant complexity. The time complexity per bit of most of them is...
Ning Zhang, Ada Poon, David Tse, Robert Brodersen, Sergio Verdu
Abstract-The performance and computational complexity of five multi-access receivers are compared A methodology is then presented for making area andpower estimates of these-algorithms for both...
The Multiuser Information Theory of Code-Division Multiple-Access Channels. (1998)
Final Report for a project on the fundamental limits of Code Division Multiple Access communications. It includes the Publications/Patents/Presentations/Honors report; a summary of publications...
Near/Far Resistant Receivers for DS/SSMA Communications. (1998)
In Code-Division Multiple-Access (CDMA), each transmitter is assigned a fixed, distinct signature waveform which he uses to modulate his message in the same fashion as in single-user communication....
Multi-User Detection for Next-Generation CDMA (1998)
The overall objective of this grant was to investigate basic research issues on signal processing for demodulation of multiuser digital wireless communication systems of interest to future U.S. Army...
Adaptive Multiuser Demodulation. (1997)
The purpose of this project has been to address the issue of informational complexity by developing adaptive structures that can achieve the performance advantages of multiuser detection, without the...
A lower bound on the probability of error in multihypothesis testing (1995)
[31 A. RCnyi, “On the amount of information concerning an unknown parameter in a sequence of observations, ” Magyar Tud. Akad. Mat.
Linear multiuser detectors for synchronous code-division multiple-access channels (1989)
Ruxandra Lupas, Student Member, Sergio Verdu, Senior Member
Abstract-In code-division multiple-access systems, simultaneous mul-tiuser accessing of a common channel is made possible by assigning a signature waveform to each user. Knowledge of these waveforms...