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.

Rodrigo de Miguel

dblp:90/3272 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2012
0000-0002-4057-3570ORCID · corroborated

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

Theory of computation · 2Computer networks · 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
1 paper
Physical-layer communications · 100%
Theoretical computer science
1 paper
Information theory · 100%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications
MIMO
0.112012
Vector Precoding for Gaussian MIMO Broadcast Channels: Impact of Replica Symmetry Breaking · IEEE Trans. Inf. Theory 2012
Physical-layer communications › MIMO
precoding
0.112012
Vector Precoding for Gaussian MIMO Broadcast Channels: Impact of Replica Symmetry Breaking · IEEE Trans. Inf. Theory 2012
Information theory
channel capacity
0.112012
Vector Precoding for Gaussian MIMO Broadcast Channels: Impact of Replica Symmetry Breaking · IEEE Trans. Inf. Theory 2012
Information theory › network information theory › broadcast channel
MIMO broadcast channel
0.112012
Vector Precoding for Gaussian MIMO Broadcast Channels: Impact of Replica Symmetry Breaking · IEEE Trans. Inf. Theory 2012

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

replica symmetry breaking · 0.3replica method · 0.3lattice relaxation · 0.3convex relaxation · 0.3
YearPublicationVenuePosition
2012 Vector Precoding for Gaussian MIMO Broadcast Channels: Impact of Replica Symmetry Breaking
abstract
The “replica method” of statistical physics is employed for the large-system analysis of vector precoding for the Gaussian multiple-input multiple-output broadcast channel. The transmitter comprises a linear front-end combined with nonlinear precoding, minimizing transmit energy by means of input alphabet relaxation. For the common discrete lattice-based relaxation, the problem violates replica symmetry and a replica symmetry breaking (RSB) ansatz is taken. The limiting empirical distribution of the precoder's output and the limiting transmit energy are derived for one-step RSB. Particularizing to a “zero-forcing” (ZF) linear front-end, a decoupling result is derived. For discrete lattice-based relaxations, the impact of RSB is demonstrated for the transmit energy. The spectral efficiencies of the aforementioned precoding methods are compared to linear ZF and Tomlinson-Harashima precoding (THP). Focusing on quaternary phase shift-keying (QPSK), significant performance gains of both lattice and convex relaxations are revealed for medium to high signal-to-noise ratios (SNRs) when compared to linear ZF precoding. THP is shown to be outperformed as well. Comparing certain lattice-based relaxations for QPSK against a convex counterpart, the latter is found to be superior for low and high SNRs but slightly inferior for medium SNRs in terms of spectral efficiency.
Benjamin M. Zaidel, Ralf R. Müller, Aris L. Moustakas, Rodrigo de Miguel
IEEE Trans. Inf. Theory4
2012 Corrections to "Vector Precoding for Gaussian MIMO Broadcast Channels: Impact of Replica Symmetry Breaking"
abstract
There are a number of corrections for the above titled paper (ibid., vol. 58, no. 3, pp. 1413-1440, Mar. 2012). They are presented here.
Benjamin M. Zaidel, Ralf R. Müller, Aris L. Moustakas, Rodrigo de Miguel
IEEE Trans. Inf. Theory4
2010 On overloaded vector precoding for single-user MIMO channels
abstract
We address the possibility of overloaded vector precoding in single user MIMO channels, i.e. the number of data streams is larger than the minimum of the number of antennas at transmitter and receiver side.We find that the convex vector precoding introduced in [1] allows for overloading while, with a certain probability, keeping the received signal free of interference. We find that the probability that overloading is not possible decays exponentially with the size of the system as long as the number of data streams is less than twice the minimum number of antennas. We give an explicit formula to calculate this probability for any antenna configuration in presence of correlated Rayleigh fading. Although overloading comes with the need for increased transmitted power, we show by means of the replica method that overloading up to 22% yields better spectral and power efficiency than without overload and spatial matched filter processing at the receiver.
Rodrigo de Miguel, Vesna Gardasevic, Ralf R. Müller, Finn F. Knudsen
IEEE Trans. Wirel. Commun.1
2008 Real vs. complex BPSK precoding for MIMO broadcast channels
abstract
Recently Muller et al. (IEEE J. Select. Areas Commun. 2008) used asymptotic methods from statistical physics to analyze non-linear vector precoding for MIMO broadcast channels. They proposed to extend BPSK input alphabets onto both real and complex supersets of the original constellation points. They showed that, as the optimization space is greater, lower energies are achieved when the extended alphabets are complex. In this work we use similar asymptotic methods and propose an alternative channel inversion technique which makes purely real alphabets perform as well as their complex extensions, which results in reduced complexity in the optimization process.
Rodrigo de Miguel, Ralf R. Müller
PIMRC1