LWLigong Wang

Ligong Wang

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Ligong Wang has a total of 9 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • The State-Dependent Semideterministic Broadcast Channel

    by Amos Lapidoth, Ligong Wang

    We derive the capacity region of the state-dependent semideterministic broadcast channel with noncausal state information at the transmitter. One of the two outputs of this channel is a deterministic function of the channel input and the channel state, and the state is assumed to be known noncausally to the transmitter but not to the receivers. We show that appending the state to the deterministic output does not increase capacity. We also derive an outer bound on the capacity of general (not necessarily semideterministic) state-dependent broadcast channels.


  • Open Access

    Covering Point Patterns

    by Amos Lapidoth, Andreas Malär, Ligong Wang

    An encoder observes a point pattern---a finite number of points in the interval $[0,T]$---which is to be described to a reconstructor using bits. Based on these bits, the reconstructor wishes to select a subset of $[0,T]$ that contains all the points in the pattern. It is shown that, if the point pattern is produced by a homogeneous Poisson process of intensity $\lambda$, and if the reconstructor is restricted to select a subset of average Lebesgue measure not exceeding $DT$, then, as $T$ tends to infinity, the minimum number of bits per second needed by the encoder is $-\lambda\log D$. It is also shown that, as $T$ tends to infinity, any point pattern on $[0,T]$ containing no more than $\lambda T$ points can be successfully described using $-\lambda \log D$ bits per second in this sense. Finally, a Wyner-Ziv version of this problem is considered where some of the points in the pattern are known to the reconstructor.

  • Open Access

    Simple Channel Coding Bounds

    by Ligong Wang, Roger Colbeck, Renato Renner

    New channel coding converse and achievability bounds are derived for a single use of an arbitrary channel. Both bounds are expressed using a quantity called the "smooth 0-divergence", which is a generalization of Renyi's divergence of order 0. The bounds are also studied in the limit of large block-lengths. In particular, they combine to give a general capacity formula which is equivalent to the one derived by Verdu and Han.

  • Open Access

    The Poisson Channel with Side Information

    by Shraga Bross, Amos Lapidoth, Ligong Wang

    The continuous-time, peak-limited, infinite-bandwidth Poisson channel with spurious counts is considered. It is shown that if the times at which the spurious counts occur are known noncausally to the transmitter but not to the receiver, then the capacity is equal to that of the Poisson channel with no spurious counts. Knowing the times at which the spurious counts occur only causally at the transmitter does not increase capacity.

  • Low SNR Capacity of Fading Channels -MIMO and Delay Spread

    by Vignesh Sethuraman, Ligong Wang, Bruce Hajek, Amos Lapidoth

    Discrete-time Rayleigh fading multiple-input multiple-output (MIMO) channels are considered, with no channel state information at the transmitter and receiver. The fading is assumed to be correlated in time and independent from antenna to antenna. Peak and average transmit power constraints are imposed, either on the sum over antennas, or on each individual antenna. In both cases, an upper bound and an asymptotic lower bound, as the signal-to-noise ratio approaches zero, on the channel capacity are presented. The limit of normalized capacity is identified under the sum power constraints, and, for a subclass of channels, for individual power constraints. These results carry over to a SISO channel with delay spread (i.e. frequency selective fading).


  • Open Access

    Low SNR Capacity of Fading Channels -- MIMO and Delay Spread

    by Vignesh Sethuraman, Ligong Wang, Bruce Hajek, Amos Lapidoth

    Discrete-time Rayleigh fading multiple-input multiple-output (MIMO) channels are considered, with no channel state information at the transmitter and receiver. The fading is assumed to be correlated in time and independent from antenna to antenna. Peak and average transmit power constraints are imposed, either on the sum over antennas, or on each individual antenna. In both cases, an upper bound and an asymptotic lower bound, as the signal-to-noise ratio approaches zero, on the channel capacity are presented. The limit of normalized capacity is identified under the sum power constraints, and, for a subclass of channels, for individual power constraints. These results carry over to a SISO channel with delay spread (i.e. frequency selective fading).

  • Open Access

    On the Low SNR Capacity of Peak-Limited Non-Coherent Fading Channels with Memory

    by Amos Lapidoth, Ligong Wang

    The capacity of non-coherent stationary Gaussian fading channels with memory under a peak-power constraint is studied in the asymptotic weak-signal regime. It is assumed that the fading law is known to both transmitter and receiver but that neither is cognizant of the fading realization. A connection is demonstrated between the asymptotic behavior of channel capacity in this regime and the asymptotic behavior of the prediction error incurred in predicting the fading process from very noisy observations of its past. This connection can be viewed as the low signal-to-noise ratio (SNR) analog of recent results by Lapidoth & Moser and by Lapidoth demonstrating connections between the high SNR capacity growth and the noiseless or almost-noiseless prediction error. We distinguish between two families of fading laws: the ``slowly forgetting'' and the ``quickly forgetting''. For channels in the former category the low SNR capacity is achieved by IID inputs, whereas in the latter such inputs are typically sub-optimal. Instead, the asymptotic capacity can be approached by inputs with IID phase but block-constant magnitude.