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

Hafez Hadinejad-Mahram

dblp:75/5565 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2004
—ORCID · none

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

Computer networks · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1Theory of computation · 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%
Theoretical computer science
1 paper
Coding theory · 100%

Topics — the 8 heaviest of 8, 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
Coding theory › sequences › binary sequences
optimal autocorrelation
0.012003
Binary and quadriphase sequences with optimal autocorrelation properties: a survey · IEEE Trans. Inf. Theory 2003
Coding theory › sequences
sequence design
0.012003
Binary and quadriphase sequences with optimal autocorrelation properties: a survey · IEEE Trans. Inf. Theory 2003
Coding theory › sequences › binary sequences
merit factor
0.012003
Binary and quadriphase sequences with optimal autocorrelation properties: a survey · IEEE Trans. Inf. Theory 2003

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

karhunen-loève expansion · 0.0computer search · 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.1
2003 Binary and quadriphase sequences with optimal autocorrelation properties: a survey
abstract
Time-discrete signals with good autocorrelation properties are used in various applications in communications engineering. From an implementation point of view, usually sequences with a small phase alphabet and a maximal energy efficiency, i.e., a uniform envelope, are most favorable. For this reason, known methods as well as several new construction techniques of binary and quadriphase sequences with optimal or best known autocorrelation properties are discussed in this correspondence. In many cases, the achievable correlation properties can be improved significantly if a single zero element per sequence is accepted. These "almost" binary and "almost" quadriphase sequences are considered as well. The optimality criteria used include the maximum absolute sidelobe and the merit factor of the periodic and the odd-periodic autocorrelation function, respectively. For sequence lengths of up to 44 in the binary case and up to 32 in the quadriphase case, the best known parameters obtained by computer search are compared with the constructed results.
Hans-Dieter Lüke, Hans D. Schotten, Hafez Hadinejad-Mahram
IEEE Trans. Inf. Theory3
2000 Robust QAM modulation classification via moment matrices
abstract
We discuss a method for classification of digitally modulated signals based on performing subspace decomposition on a positive definite matrix of higher order moments of the received signals. Specifically, we specialize a general approach originally introduced for detection and classification of noise contaminated patterns to the case of digitally modulated signals such as M-ary PSK and QAM. We consider two different classifiers: one that provides only satisfactory performance for high signal-to-noise ratio, and one that performs also well in the low SNR regime. The former has the additional advantage of being invariant to both unknown phase angle (rotation) and signal amplitude, and can be used for all QAM signal constellations (including M-ary PSK), whereas the latter is only used for discrimination of M-ary PSK signals. Using simulation, we analyze the performance of the proposed classifier for transmission over the additive white Gaussian noise channel and both coherent and non-coherent reception. Moreover, the robustness of the classifier against mismatched noise modeling is discussed.
Hafez Hadinejad-Mahram, Alfred O. Hero III
PIMRC1
1998 Digital modulation classification using power moment matrices
abstract
With the rising number of modulation types used in multi-user and multi-service digital communication systems, the need to find efficient methods for their discrimination in the presence of noise has become increasingly important. We present a new approach based on a pattern recognition method previously applied to word spotting problems in binary images. In this approach, a large number of spatial moments are arranged in a symmetric positive definite matrix for which eigendecomposition and noise subspace processing methods can be applied. The resultant denoised moment matrix has entries which are used in place of the raw moments for improved pattern classification. In this paper, we generalize the moment matrix technique to grey scale images and apply the technique to discrimination between M-ary PSK and QAM constellations in signal space. Invariance to unknown phase angle and signal amplitude is achieved by representing the in-phase and quadrature components of the signal in the complex plane, and computing joint moments of normalized magnitude and phase components.
Alfred O. Hero III, Hafez Hadinejad-Mahram
ICASSP2