scispace - formally typeset
Search or ask a question
Author

Raymond Knopp

Bio: Raymond Knopp is an academic researcher from Institut Eurécom. The author has contributed to research in topics: Communication channel & MIMO. The author has an hindex of 32, co-authored 230 publications receiving 6832 citations. Previous affiliations of Raymond Knopp include École Polytechnique Fédérale de Lausanne & McGill University.


Papers
More filters
DOI
01 Jan 1997
TL;DR: These Ecole polytechnique federale de Lausanne EPFL students developed a novel and scalable system of communication based on the principles of reinforcement learning and social reinforcement learning.
Abstract: These Ecole polytechnique federale de Lausanne EPFL, n° 1672 (1997)Section de systemes de communication Reference doi:10.5075/epfl-thesis-1672Print copy in library catalog Record created on 2005-03-16, modified on 2016-08-08

45 citations

Journal ArticleDOI
TL;DR: In this paper, the authors considered a Gaussian relay network where a source transmits a message to a destination with the help of $N$ half-duplex relays, and the information theoretic cut-set upper bound to the capacity was achieved to within 1.96(N+2) bits by noisy network coding, thereby reducing the previously known gap.
Abstract: This paper considers a Gaussian relay network where a source transmits a message to a destination with the help of $N$ half-duplex relays. The information theoretic cut-set upper bound to the capacity is shown to be achieved to within $1.96(N+2)$ bits by noisy network coding, thereby reducing the previously known gap. This gap is obtained as a special case of a more general constant gap result for Gaussian half-duplex multicast networks. It is then shown that the generalized degrees-of-freedom of this network is the solution of a linear program, where the coefficients of the linear inequality constraints are proved to be the solution of several linear programs referred as the assignment problem in graph theory, for which efficient numerical algorithms exist. The optimal schedule, that is, the optimal value of the $2^{N}$ possible transmit-receive configuration states for the relays, is investigated and known results for diamond networks are extended to general relay networks. It is shown, for the case of $N=2$ relays, that only $N+1=3$ out of the $2^{N}=4$ possible states have a strictly positive probability and suffice to characterize the capacity to within a constant gap. Extensive experimental results show that, for a general $N$ -relay network with $N\leq 8$ , the optimal schedule has at most $N+1$ states with a strictly positive probability. As an extension of a conjecture presented for diamond networks, it is conjectured that this result holds for any half-duplex relay network and any number of relays. Finally, a network with $N=2$ relays is studied in detail to illustrate the channel conditions under which selecting the best relay is not optimal, and to highlight the nature of the rate gain due to multiple relays.

43 citations

Proceedings ArticleDOI
08 Jun 1997
TL;DR: This work considers the achievable diversity for coded systems appropriately characterized by a block-fading channel model and presents the results of code searches for rate 1/n convolutional codes for simple AM constellations, which show the minimum complexity needed to achieve maximum diversity.
Abstract: This work considers the achievable diversity for coded systems appropriately characterized by a block-fading channel model. We are primarily interested in cases where the number of uncorrelated fading channel realizations (blocks) F, is small, so that ideal interleaving assumptions do not hold. This is usually the case in mobile radio systems which employ coded slow frequency-hopping such as the GSM system and its derivatives, We show that the diversity order is limited to a value less than or equal to F which depends on the code rate and the size of the signaling constellation. We report on the results of code searches for rate 1/n convolutional codes for simple AM constellations, which show the minimum complexity needed to achieve maximum diversity. We also present computer simulations of some codes in order to determine the effect of code complexity on the frame and bit error-rate performance.

40 citations

Journal ArticleDOI
TL;DR: It is shown that multi-user MIMO can deliver its promised gains in modern wireless systems in spite of the limited channel state information at the transmitter (CSIT) only if users resort to intelligent interference-aware detection rather than the conventional single-user detection.
Abstract: In this paper, we propose a novel low-complexity interference-aware receiver structure for multi-user MIMO that is based on the exploitation of the structure of residual interference. We show that multi-user MIMO can deliver its promised gains in modern wireless systems in spite of the limited channel state information at the transmitter (CSIT) only if users resort to intelligent interference-aware detection rather than the conventional single-user detection. As an example, we focus on the long term evolution (LTE) system and look at the two important characteristics of the LTE precoders, i.e., their low resolution and their applying equal gain transmission (EGT). We show that EGT is characterized by full diversity in the single-user MIMO transmission but it loses diversity in the case of multi-user MIMO transmission. Reflecting on these results, we propose a LTE codebook design based on two additional feedback bits of CSIT and show that this new codebook significantly outperforms the currently standardized LTE codebooks for multi-user MIMO transmission.

38 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

Book
01 Jan 2005

9,038 citations

Journal ArticleDOI
TL;DR: Results show that, even though the interuser channel is noisy, cooperation leads not only to an increase in capacity for both users but also to a more robust system, where users' achievable rates are less susceptible to channel variations.
Abstract: Mobile users' data rate and quality of service are limited by the fact that, within the duration of any given call, they experience severe variations in signal attenuation, thereby necessitating the use of some type of diversity. In this two-part paper, we propose a new form of spatial diversity, in which diversity gains are achieved via the cooperation of mobile users. Part I describes the user cooperation strategy, while Part II (see ibid., p.1939-48) focuses on implementation issues and performance analysis. Results show that, even though the interuser channel is noisy, cooperation leads not only to an increase in capacity for both users but also to a more robust system, where users' achievable rates are less susceptible to channel variations.

6,621 citations

Journal ArticleDOI
TL;DR: While massive MIMO renders many traditional research problems irrelevant, it uncovers entirely new problems that urgently need attention: the challenge of making many low-cost low-precision components that work effectively together, acquisition and synchronization for newly joined terminals, the exploitation of extra degrees of freedom provided by the excess of service antennas, reducing internal power consumption to achieve total energy efficiency reductions, and finding new deployment scenarios.
Abstract: Multi-user MIMO offers big advantages over conventional point-to-point MIMO: it works with cheap single-antenna terminals, a rich scattering environment is not required, and resource allocation is simplified because every active terminal utilizes all of the time-frequency bins. However, multi-user MIMO, as originally envisioned, with roughly equal numbers of service antennas and terminals and frequency-division duplex operation, is not a scalable technology. Massive MIMO (also known as large-scale antenna systems, very large MIMO, hyper MIMO, full-dimension MIMO, and ARGOS) makes a clean break with current practice through the use of a large excess of service antennas over active terminals and time-division duplex operation. Extra antennas help by focusing energy into ever smaller regions of space to bring huge improvements in throughput and radiated energy efficiency. Other benefits of massive MIMO include extensive use of inexpensive low-power components, reduced latency, simplification of the MAC layer, and robustness against intentional jamming. The anticipated throughput depends on the propagation environment providing asymptotically orthogonal channels to the terminals, but so far experiments have not disclosed any limitations in this regard. While massive MIMO renders many traditional research problems irrelevant, it uncovers entirely new problems that urgently need attention: the challenge of making many low-cost low-precision components that work effectively together, acquisition and synchronization for newly joined terminals, the exploitation of extra degrees of freedom provided by the excess of service antennas, reducing internal power consumption to achieve total energy efficiency reductions, and finding new deployment scenarios. This article presents an overview of the massive MIMO concept and contemporary research on the topic.

6,184 citations

Journal ArticleDOI
01 Jun 2002
TL;DR: This work shows that true beamforming gains can be achieved when there are sufficient users, even though very limited channel feedback is needed, and proposes the use of multiple transmit antennas to induce large and fast channel fluctuations so that multiuser diversity can still be exploited.
Abstract: Multiuser diversity is a form of diversity inherent in a wireless network, provided by independent time-varying channels across the different users. The diversity benefit is exploited by tracking the channel fluctuations of the users and scheduling transmissions to users when their instantaneous channel quality is near the peak. The diversity gain increases with the dynamic range of the fluctuations and is thus limited in environments with little scattering and/or slow fading. In such environments, we propose the use of multiple transmit antennas to induce large and fast channel fluctuations so that multiuser diversity can still be exploited. The scheme can be interpreted as opportunistic beamforming and we show that true beamforming gains can be achieved when there are sufficient users, even though very limited channel feedback is needed. Furthermore, in a cellular system, the scheme plays an additional role of opportunistic nulling of the interference created on users of adjacent cells. We discuss the design implications of implementing. this scheme in a complete wireless system.

3,041 citations