Wei Yang

Wei Yang

Auto-generated profile, based on publicly available information

Wei Yang

Qualcomm Technologies, Inc., San Diego, 92121, USA

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
12 March 2019 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
WYWei Yang
Wei Yang
RSRafael F. Schaefer
Rafael F. Schaefer
H. Vincent PoorH. Vincent Poor
H. Vincent Poor

1 December 2010 in The Journal of China Universities of Posts and Telecommunications
Verified
Journal Article
Closed access
WYWei Yang
Wei Yang
LLLi-Hua Li
Li-Hua Li
WSWan-Lu Sun
Wan-Lu Sun
YWYing Wang
Ying Wang

16 May 2018 in IEEE Transactions on Information Theory
Verified
Journal Article
Open access
WYWei Yang
Wei Yang
ACAustin Collins
Austin Collins
GDGiuseppe Durisi
Giuseppe Durisi
YPYury Polyanskiy
Yury Polyanskiy
H. Vincent PoorH. Vincent Poor
H. Vincent Poor
It is well known that the mutual information between two random variables can be expressed as the difference of two relative entropies that depend on an auxiliary distribution, a relation sometimes referred to as the golden formula. This paper is concerned with a finite-blocklength extension of this relation. This extension consists of two elements: 1) a finiteblocklength channel-coding converse bound by Polyanskiy and Verdú, which involves the ratio of two Neyman-Pearson β functions (beta-beta converse bound); and 2) a novel beta-beta channel-coding achievability bound, expressed again as the ratio of two Neyman-Pearson β functions. To demonstrate the usefulness of this finite-blocklength extension of the golden formula, the beta-beta achievability and converse bounds are used to obtain a finite-blocklength extension of Verdú's wideband-slope approximation. The proof parallels the derivation of the latter, with the beta-beta bounds used in place of the golden formula. The beta-beta (achievability) bound is also shown to be useful in cases where the capacity-achieving output distribution is not a product distribution due to, e.g., a cost constraint or structural constraints on the codebook, such as orthogonality or constant composition. As an example, the bound is used to characterize the channel dispersion of the additive exponential-noise channel and to obtain a finite-blocklength achievability bound (the tightest to date) for multiple-input multiple-output Rayleigh-fading channels with perfect channel state information at the receiver.

6 October 2016 in IEEE Transactions on Information Theory
Verified
Journal Article
Open access
WYWei Yang
Wei Yang
GDGiuseppe Durisi
Giuseppe Durisi
YPYury Polyanskiy
Yury Polyanskiy
This paper investigates the minimum energy required to transmit k information bits with a given reliability over a multiple-antenna Rayleigh block-fading channel, with and without channel state information (CSI) at the receiver. No feedback is assumed. It is well known that the ratio between the minimum energy per bit and the noise level converges to -1.59 dB as k goes to infinity, regardless of whether CSI is available at the receiver or not. This paper shows that the lack of CSI at the receiver causes a slowdown in the speed of convergence to -1.59 dB as k → ∞ compared with the case of perfect receiver CSI. Specifically, we show that, in the no-CSI case, the gap to -1.59 dB is proportional to ((log k)/k) 1/3 , whereas when perfect CSI is available at the receiver, this gap is proportional V to 1/√k. In both cases, the gap to -1.59 dB is independent of the number of transmit antennas and of the channel's coherence time. Numerically, we observe that, when the receiver is equipped with a single antenna, to achieve an energy per bit of -1.5 dB in the no-CSI case, one needs to transmit at least 7 × 10 7 information bits, whereas 6 × 10 4 bits suffice for the case of perfect CSI at the receiver.

6 September 2018 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
KTKasper Floe Trillingsgaard
Kasper Floe Trillingsgaard
WYWei Yang
Wei Yang
GDGiuseppe Durisi
Giuseppe Durisi
PPPetar Popovski
Petar Popovski
We investigate the maximum coding rate for a given average blocklength and error probability over a K-user discrete memoryless broadcast channel for the scenario where a common message is transmitted using variable-length stop-feedback codes. For the point-to-point case, Polyanskiy et al. (2011) demonstrated that variable-length coding combined with stop-feedback significantly increases the speed of convergence of the maximum coding rate to capacity. This speed-up manifests itself in the absence of a square-root penalty in the asymptotic expansion of the maximum coding rate for large blocklengths, i.e., zero dispersion. In this paper, we present nonasymptotic achievability and converse bounds on the maximum coding rate of the common-message K-user discrete memoryless broadcast channel, which strengthen and generalize the ones reported in Trillingsgaard et al. (2015) for the twouser case. An asymptotic analysis of these bounds reveals that zero dispersion cannot be achieved for certain common-message broadcast channels (e.g., the binary symmetric broadcast channel). Furthermore, we identify conditions under which our converse and achievability bounds are tight up to the second order. Through numerical evaluations, we illustrate that our second-order expansions approximate accurately the maximum coding rate and that the speed of convergence to capacity is indeed slower than for the point-to-point case.

1 June 2014
Verified
Conference Paper
Open access
WYWei Yang
Wei Yang
Giuseppe CaireGiuseppe Caire
Giuseppe Caire
GDGiuseppe Durisi
Giuseppe Durisi
YPYury Polyanskiy
Yury Polyanskiy
This paper investigates the maximal channel coding rate achievable at a given blocklength n and error probability ε, when the codewords are subject to a long-term (i.e., averaged-over-all-codeword) power constraint. The second-order term in the large-n expansion of the maximal channel coding rate is characterized both for AWGN channels and for quasi-static fading channels with perfect channel state information at the transmitter and the receiver. It is shown that in both cases the second-order term is proportional to √(log n)/n.