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

Abderraouf Yamani

dblp:177/4124 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2016
—ORCID · none

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

Computer networks · 1

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%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications
MIMO
0.212016
Low-Complexity MU-MIMO Nonlinear Precoding Using Degree-2 Sparse Vector Perturbation · IEEE J. Sel. Areas Commun. 2016
Physical-layer communications › MIMO
multiuser MIMO
0.212016
Low-Complexity MU-MIMO Nonlinear Precoding Using Degree-2 Sparse Vector Perturbation · IEEE J. Sel. Areas Commun. 2016
Physical-layer communications › MIMO › precoder design
nonlinear precoding
0.212016
Low-Complexity MU-MIMO Nonlinear Precoding Using Degree-2 Sparse Vector Perturbation · IEEE J. Sel. Areas Commun. 2016
Physical-layer communications › MIMO
precoding
0.212016
Low-Complexity MU-MIMO Nonlinear Precoding Using Degree-2 Sparse Vector Perturbation · IEEE J. Sel. Areas Commun. 2016

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

vector perturbation · 0.2sphere encoding · 0.2lattice reduction · 0.2
YearPublicationVenuePosition
2016 Low-Complexity MU-MIMO Nonlinear Precoding Using Degree-2 Sparse Vector Perturbation
abstract
Multiuser multiple-input multiple-output (MUMIMO) nonlinear precoding techniques face the problem of poor computational scalability to the size of the network. In this paper, the fundamental problem of MU-MIMO scalability is tackled through a novel signal-processing approach, which is called degree-2 vector perturbation (D2VP). Unlike the conventional VP approaches that aim at minimizing the transmit-to-receive energy ratio through searching over an N-dimensional Euclidean space, D2VP shares the same target through an iterative-optimization procedure. Each iteration performs vector perturbation over two optimally selected subspaces. By this means, the computational complexity is managed to be in the cubic order of the size of MU-MIMO, and this mainly comes from the inverse of the channel matrix. In terms of the performance, it is shown that D2VP offers comparable bit-error-rate to the sphere encoding approach for the case of small MU-MIMO. For the case of medium and large MU-MIMO when the sphere encoding does not apply due to unimplementable complexity, D2VP outperforms the lattice-reduction VP by around 5-10 dB in Eb/No and 10-50 dB in normalized computational complexity.
Yi Ma 0002, Abderraouf Yamani, Na Yi, Rahim Tafazolli
IEEE J. Sel. Areas Commun.2