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

Dirk Blömker

dblp:80/2065 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2004
0000-0003-3114-9193ORCID · verified

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 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Physical-layer communications
diversity
0.012004
Matched-filter bound for binary signaling over dispersive fading channels with receive diversity · IEEE Trans. Commun. 2004
Physical-layer communications
diversity combining
0.012004
Matched-filter bound for binary signaling over dispersive fading channels with receive diversity · IEEE Trans. Commun. 2004
Physical-layer communications
fading channels
0.012004
Matched-filter bound for binary signaling over dispersive fading channels with receive diversity · IEEE Trans. Commun. 2004
Physical-layer communications › fading channels
fading dispersive channels
0.012004
Matched-filter bound for binary signaling over dispersive fading channels with receive diversity · IEEE Trans. Commun. 2004
Physical-layer communications › error probability analysis
matched filter bound
0.012004
Matched-filter bound for binary signaling over dispersive fading channels with receive diversity · IEEE Trans. Commun. 2004

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

karhunen-loève expansion · 0.0
YearPublicationVenuePosition
2004 Matched-filter bound for binary signaling over dispersive fading channels with receive diversity
abstract
The matched-filter bound (MFB) for continuously dispersive Rayleigh fading channels with receive diversity is derived. The treatment is quite general, as the case of discrete multipath channels with correlated fading is included in our model as a special case, and we impose no constraints with regard to the selectivity of the channel. It is assumed that a statistical characterization of the channel is available through its direction-delay-Doppler power spectral density. The Karhunen-Loe/spl grave/ve expansion for vector processes is used to describe the received signal. The MFB is analyzed with respect to several parameters characterizing the mobile radio channel, the waveform, and the antenna configuration.
Hafez Hadinejad-Mahram, Dirk Dahlhaus, Dirk Blömker
IEEE Trans. Commun.3