Alex E. Geyer

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

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

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

TopicWeightPapersLastEvidence papers
Physical-layer communications
coding theory
0.212015
Euclidean and Space-Time Block Codes: Relationship, Optimality, Performance Analysis Revisited · IEEE Trans. Commun. 2015
Physical-layer communications › channel coding › error control coding
distance spectrum
0.212015
Euclidean and Space-Time Block Codes: Relationship, Optimality, Performance Analysis Revisited · IEEE Trans. Commun. 2015
Physical-layer communications
MIMO
0.212015
Euclidean and Space-Time Block Codes: Relationship, Optimality, Performance Analysis Revisited · IEEE Trans. Commun. 2015
Physical-layer communications › MIMO › space-time coding › space-time block codes
orthogonal space-time block codes
0.212015
Euclidean and Space-Time Block Codes: Relationship, Optimality, Performance Analysis Revisited · IEEE Trans. Commun. 2015
Physical-layer communications › MIMO › space-time coding
space-time block codes
0.212015
Euclidean and Space-Time Block Codes: Relationship, Optimality, Performance Analysis Revisited · IEEE Trans. Commun. 2015
Physical-layer communications › error probability analysis
symbol error probability
0.112015
Euclidean and Space-Time Block Codes: Relationship, Optimality, Performance Analysis Revisited · IEEE Trans. Commun. 2015

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

performance analysis · 0.2asymptotic upper bound · 0.2
YearPublicationVenuePosition
2015 Euclidean and Space-Time Block Codes: Relationship, Optimality, Performance Analysis Revisited
abstract
An equivalent model for a multiple-input-multiple-output communication system with space-time block codes (STBCs) is proposed based on a revealed connection between STBCs and Euclidean codes. Examples of distance spectra, signal constellations, and signal coordinate diagrams of Euclidean codes equivalent to simplest orthogonal STBCs are given. A new asymptotic upper bound for the symbol error rate (SER) of STBCs, based on the distance spectra of the equivalent Euclidean codes, is derived, and new general design criteria for signal constellations of the optimal code are proposed. Some bounds relating distance properties, dimensionality, and cardinality of STBCs with constituent signals of equal energy are given, and new signal constellations with cardinalities of 8 and 16 for Alamouti's code are designed. A general methodology for performance analysis of STBCs is revisited. As an example of the application of this methodology, an exact evaluation of the SER of an orthogonal STBC is given. Namely, a new expression for the SER of Alamouti's code with binary phase shift keying signals is derived.
Alex E. Geyer, Reza Nikjah, Sergiy A. Vorobyov, Norman C. Beaulieu
IEEE Trans. Commun.1