scispace - formally typeset
Search or ask a question
Author

H. Vincent Poor

Other affiliations: Beihang University, Peking University, University of Edinburgh  ...read more
Bio: H. Vincent Poor is an academic researcher from Princeton University. The author has contributed to research in topics: Computer science & Communication channel. The author has an hindex of 109, co-authored 2116 publications receiving 67723 citations. Previous affiliations of H. Vincent Poor include Beihang University & Peking University.


Papers
More filters
Book
01 Jan 1988
TL;DR: Signal Detection in Discrete Time and Signal Estimation in Continuous Time: Elements of Hypothesis Testing and Elements of Parameter Estimation.
Abstract: Preface I. Introduction II. Elements of Hypothesis Testing III. Signal Detection in Discrete Time IV. Elements of Parameter Estimation V. Elements of Signal Estimation VI. Signal Detection in Continuous Time VII. Signal Estimation in Continuous Time References Index

4,096 citations

Journal ArticleDOI
TL;DR: It is shown analytically that the maximal rate achievable with error probability ¿ isclosely approximated by C - ¿(V/n) Q-1(¿) where C is the capacity, V is a characteristic of the channel referred to as channel dispersion, and Q is the complementary Gaussian cumulative distribution function.
Abstract: This paper investigates the maximal channel coding rate achievable at a given blocklength and error probability. For general classes of channels new achievability and converse bounds are given, which are tighter than existing bounds for wide ranges of parameters of interest, and lead to tight approximations of the maximal achievable rate for blocklengths n as short as 100. It is also shown analytically that the maximal rate achievable with error probability ? isclosely approximated by C - ?(V/n) Q-1(?) where C is the capacity, V is a characteristic of the channel referred to as channel dispersion , and Q is the complementary Gaussian cumulative distribution function.

3,242 citations

Journal ArticleDOI
TL;DR: In this letter, the performance of non-orthogonal multiple access (NOMA) is investigated in a cellular downlink scenario with randomly deployed users and developed analytical results show that NOMA can achieve superior performance in terms of ergodic sum rates; however, the outage performance of N OMA depends critically on the choices of the users' targeted data rates and allocated power.
Abstract: In this letter, the performance of non-orthogonal multiple access (NOMA) is investigated in a cellular downlink scenario with randomly deployed users. The developed analytical results show that NOMA can achieve superior performance in terms of ergodic sum rates; however, the outage performance of NOMA depends critically on the choices of the users' targeted data rates and allocated power. In particular, a wrong choice of the targeted data rates and allocated power can lead to a situation in which the user's outage probability is always one, i.e. the user's targeted quality of service will never be met.

1,762 citations

Journal ArticleDOI
TL;DR: A systematic treatment of non-orthogonal multiple access, from its combination with MIMO technologies to cooperative NOMA, as well as the interplay between N OMA and cognitive radio is provided.
Abstract: As the latest member of the multiple access family, non-orthogonal multiple access (NOMA) has been recently proposed for 3GPP LTE and is envisioned to be an essential component of 5G mobile networks. The key feature of NOMA is to serve multiple users at the same time/frequency/ code, but with different power levels, which yields a significant spectral efficiency gain over conventional orthogonal MA. The article provides a systematic treatment of this newly emerging technology, from its combination with MIMO technologies to cooperative NOMA, as well as the interplay between NOMA and cognitive radio. This article also reviews the state of the art in the standardization activities concerning the implementation of NOMA in LTE and 5G networks.

1,687 citations

Journal ArticleDOI
TL;DR: Both analytical and numerical results are provided to demonstrate that F-NOMA can offer a larger sum rate than orthogonal MA, and the performance gain of F- NOMA over conventional MA can be further enlarged by selecting users whose channel conditions are more distinctive.
Abstract: Nonorthogonal multiple access (NOMA) represents a paradigm shift from conventional orthogonal multiple-access (MA) concepts and has been recognized as one of the key enabling technologies for fifth-generation mobile networks. In this paper, the impact of user pairing on the performance of two NOMA systems, i.e., NOMA with fixed power allocation (F-NOMA) and cognitive-radio-inspired NOMA (CR-NOMA), is characterized. For F-NOMA, both analytical and numerical results are provided to demonstrate that F-NOMA can offer a larger sum rate than orthogonal MA, and the performance gain of F-NOMA over conventional MA can be further enlarged by selecting users whose channel conditions are more distinctive. For CR-NOMA, the quality of service (QoS) for users with poorer channel conditions can be guaranteed since the transmit power allocated to other users is constrained following the concept of cognitive radio networks. Because of this constraint, CR-NOMA exhibits a different behavior compared with F-NOMA. For example, for the user with the best channel condition, CR-NOMA prefers to pair it with the user with the second best channel condition, whereas the user with the worst channel condition is preferred by F-NOMA.

1,391 citations


Cited by
More filters
Journal ArticleDOI

[...]

08 Dec 2001-BMJ
TL;DR: There is, I think, something ethereal about i —the square root of minus one, which seems an odd beast at that time—an intruder hovering on the edge of reality.
Abstract: There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality. Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …

33,785 citations

Christopher M. Bishop1
01 Jan 2006
TL;DR: Probability distributions of linear models for regression and classification are given in this article, along with a discussion of combining models and combining models in the context of machine learning and classification.
Abstract: Probability Distributions.- Linear Models for Regression.- Linear Models for Classification.- Neural Networks.- Kernel Methods.- Sparse Kernel Machines.- Graphical Models.- Mixture Models and EM.- Approximate Inference.- Sampling Methods.- Continuous Latent Variables.- Sequential Data.- Combining Models.

10,141 citations

01 Jan 2002

9,314 citations

Book
01 Jan 2005

9,038 citations