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

Ammar Chkeif

dblp:96/1931 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2000
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 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%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications
antenna arrays
0.012000
Spatio-temporal blind adaptive multiuser detection · IEEE Trans. Commun. 2000
Physical-layer communications › signal detection › multiuser detection
blind multiuser detection
0.012000
Spatio-temporal blind adaptive multiuser detection · IEEE Trans. Commun. 2000
Physical-layer communications › signal detection
multiuser detection
0.012000
Spatio-temporal blind adaptive multiuser detection · IEEE Trans. Commun. 2000
Physical-layer communications › signal processing for communications › array signal processing
space-time processing
0.012000
Spatio-temporal blind adaptive multiuser detection · IEEE Trans. Commun. 2000
Physical-layer communications › channel estimation
subspace-based estimation
0.012000
Spatio-temporal blind adaptive multiuser detection · IEEE Trans. Commun. 2000

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

projection approximation subspace tracking · 0.0minimum mean-square error detection · 0.0decorrelating detector · 0.0
YearPublicationVenuePosition
2000 Orthogonal Oja algorithm
abstract
In this letter, we propose an orthogonalized version of the Oja algorithm (OOja) that can be used for the estimation of minor and principal subspaces of a vector sequence. The new algorithm offers, as compared to Oja, such advantages as orthogonality of the weight matrix, which is ensured at each iteration, numerical stability, and a quite similar computational complexity.
Karim Abed-Meraim, Samir Attallah, Ammar Chkeif, Yingbo Hua
IEEE Signal Process. Lett.3
2000 Fast orthonormal PAST algorithm
abstract
Subspace decomposition has proven to be an important tool in adaptive signal processing. A number of algorithms have been proposed for tracking the dominant subspace. Among the most robust and most efficient methods is the projection approximation and subspace tracking (PAST) method. This paper elaborates on an orthonormal version of the PAST algorithm for fast estimation and tracking of the principal subspace or/and principal components of a vector sequence. The orthonormal PAST (OPAST) algorithm guarantees the orthonormality of the weight matrix at each iteration. Moreover, it has a linear complexity like the PAST algorithm and a global convergence property like the natural power (NP) method.
Karim Abed-Meraim, Ammar Chkeif, Yingbo Hua
IEEE Signal Process. Lett.2
2000 Spatio-temporal blind adaptive multiuser detection
abstract
We propose blind multiuser detection schemes with antenna arrays, which is based on signal subspace estimation. They are a multichannel extension of the decorrelating and minimum mean-square-error detectors, and therefore they share their immunity to near-far effects. The blind scheme may be seen as an extension of the results in of Wang and Poor (see IEEE Trans. Inform. Theory, vol.44, p.677-90, 1998). However, it is seen that compared with the latter results when spatial diversity is considered, the proposed spatio-temporal detectors offer, with little attendant increase in computational complexity, a better performance. A blind adaptive implementation based on a new orthogonal PAST (projection approximation subspace tracking) algorithm, which is shown to be efficient for subspace tracking, is proposed. Also, we develop a blind estimation of the spatial signature based on the orthogonality between noise and signal subspaces. It is seen that the blind adaptive multiuser detection and blind spatio-temporal signature estimation can he integrated jointly.
Ammar Chkeif, Karim Abed-Meraim, Ghassan Kawas Kaleh, Yingbo Hua
IEEE Trans. Commun.1