Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Sebastien de la Kethulle de Ryhove

dblp:06/4244 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
0since 2021 · last 2008
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 3 · 2 first-authorTheory of computation · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
2 papers
Physical-layer communications · 100%
Theoretical computer science
1 paper
Information theory · 100%

Topics — the 10 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Physical-layer communications › information theory › capacity analysis
channel capacity
0.112008
Exact capacity expressions for dual-branch ricean MIMO channels · IEEE Trans. Commun. 2008
Physical-layer communications
MIMO
0.112008
Exact capacity expressions for dual-branch ricean MIMO channels · IEEE Trans. Commun. 2008
Physical-layer communications › information theory
mutual information
0.112008
Exact capacity expressions for dual-branch ricean MIMO channels · IEEE Trans. Commun. 2008
Physical-layer communications › fading channels
rician fading
0.112008
Exact capacity expressions for dual-branch ricean MIMO channels · IEEE Trans. Commun. 2008
Information theory
channel capacity
0.112008
On the Mutual Information and Low-SNR Capacity of Memoryless Noncoherent Rayleigh-Fading Channels · IEEE Trans. Inf. Theory 2008
Information theory › channel capacity
fading channel
0.112008
On the Mutual Information and Low-SNR Capacity of Memoryless Noncoherent Rayleigh-Fading Channels · IEEE Trans. Inf. Theory 2008
Information theory › information measures
mutual information
0.112008
On the Mutual Information and Low-SNR Capacity of Memoryless Noncoherent Rayleigh-Fading Channels · IEEE Trans. Inf. Theory 2008
Physical-layer communications
fading channels
0.012008
On the Mutual Information and Low-SNR Capacity of Memoryless Noncoherent Rayleigh-Fading Channels · IEEE Trans. Inf. Theory 2008
Physical-layer communications › channel modeling › propagation channel modeling
line-of-sight channel
0.012008
Exact capacity expressions for dual-branch ricean MIMO channels · IEEE Trans. Commun. 2008
Physical-layer communications › fading channels
rayleigh fading
0.012008
On the Mutual Information and Low-SNR Capacity of Memoryless Noncoherent Rayleigh-Fading Channels · IEEE Trans. Inf. Theory 2008

Methods — techniques the papers use, named apart from their topics

numerical root-finding · 0.2
YearPublicationVenuePosition
2008 Exact capacity expressions for dual-branch ricean MIMO channels
abstract
In this paper we derive exact expressions for the mutual information (MI) probability density function and the MI cumulative distribution function of dual-branch multipleinput multiple-output (MIMO) systems (either two transmit (Tx) or two receive (Rx) antennas) communicating over a Ricean channel with no constraint on the rank of the line-of-sight (LOS) channel matrix. This is done both for the case where the channel is only known at the Rx, and for the case where the channel is known both at the Tx and the Rx. As an example, to evaluate the expressions, we employ uniform linear arrays and give expressions for the eigenvalues of the LOS channel matrix for the dual-branch case.
Frode Bøhagen, Pål Orten, Geir E. Øien, Sebastien de la Kethulle de Ryhove
IEEE Trans. Commun.4
2008 On the Mutual Information and Low-SNR Capacity of Memoryless Noncoherent Rayleigh-Fading Channels
abstract
The memoryless noncoherent single-input-single-output (SISO) Rayleigh-fading channel is considered. Closed-form expressions are derived for the mutual information between the output and the input of this channel when the input magnitude distribution is discrete and is restricted to having two mass points. It is subsequently shown how these expressions can be used to obtain closed-form expressions for the capacity of this channel for signal to noise ratio (SNR) values of up to approximately 0 dB, and a tight capacity lower bound for SNR values between 0 dB and 10 dB. The expressions for the channel capacity and its lower bound are given as functions of a parameter which can be obtained via numerical root-finding algorithms.
Sebastien de la Kethulle de Ryhove, Ninoslav Marina, Geir E. Øien
IEEE Trans. Inf. Theory1
2007 Rate-Optimal Power Adaptation in Average and Peak Power Constrained Fading Channels
abstract
The power adaptation strategy which maximises the average information rate that can be reliably transmitted over average and peak power constrained block-fading single-user discrete-time channels, in which perfect transmitter and receiver channel state information (CSI) are available and in which any transmitted codeword spans a single fading block, is characterised by means of a theorem and subsequently computed numerically in different scenarios. The results reveal striking differences between the well known water-pouring power adaptation strategy which is optimal from a capacity point of view in the case of stationary and ergodic fading channels where the input is subject to an average power constraint only, and the rate-optimal power adaptation strategy of the average and peak power constrained block-fading channels studied in this document.
Sebastien de la Kethulle de Ryhove, Geir E. Øien
WCNC1
2006 A Design Methodology for Link Adaptation Schemes using Constellations of Constant PAPR
abstract
The energy-efficient design of short-distance wireless communication systems requires the inclusion of circuit energy consumption in the system's total energy budget. We consider the design of link adaptation schemes in which circuit energy consumption is included in the total energy budget, in which a set of signal constellations of constant peak-to-average power ratio (PAPR) is used, and in which the transmitted power is kept constant whatever be the particular signal constellation in use. We show how the dimensionality of the associated non-linear optimisation problem can be reduced from N + 1 to one, where N denotes the number of available transmission schemes. These principles are then applied to a design example.
Sebastien de la Kethulle de Ryhove, Geir E. Øien
ICC1