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

Corneliu Eugen D. Sterian

dblp:20/2329 · DBLP profile ↗
← Back
6ranked-venue papers
6as first author
0since 2021 · last 2006
—ORCID · none

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

Computer networks · 2 · 2 first-authorTheory of computation · 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%
Theoretical computer science
2 papers
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications › modulation › constellation design
constellation shaping
0.011999
The constellation-shaping algorithm using closed-form expressions for the number of ring combinations · IEEE Trans. Commun. 1999
Physical-layer communications
modulation
0.011999
The constellation-shaping algorithm using closed-form expressions for the number of ring combinations · IEEE Trans. Commun. 1999
Coding theory › error-correcting codes › coded modulation
multidimensional constellations
0.011997
Wei-type trellis-coded modulation with 2N -dimensional rectangular constellation for N not a power of two · IEEE Trans. Inf. Theory 1997
Coding theory › error-correcting codes › coded modulation
trellis-coded modulation
0.011997
Wei-type trellis-coded modulation with 2N -dimensional rectangular constellation for N not a power of two · IEEE Trans. Inf. Theory 1997

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

closed-form expressions · 0.0trellis coding · 0.0
YearPublicationVenuePosition
2006 A 32QAM Super-Quasi-Orthogonal Space-Time Trellis Code for Four Transmit Antennas
abstract
We demonstrate a super-quasi-orthogonal space- time (ST) trellis code for four transmit antennas with rectangular signal constellations for wireless communications with a spectral efficiency of 5bits/s/Hz, thus larger than only 4 bits/s/Hz as shown in our previous conference paper. Considering a mobile wireless communications system with four transmit antennas, we form an 8D signal constellation as Cartesian product of four 2D rectangular signal sets, an 8D point being transmitted by the first antenna as four concatenated 2D points in four consecutive channel uses. The 2D symbols transmitted by the other three antennas are not independent, but so chosen as to form, together with the symbols transmitted by the first antenna, the entries of a 4times4 quasi-orthogonal matrix. The union of two sets of quasi-orthogonal matrices forms a super-quasi-orthogonal signal set. With 4x4 quasi-orthogonal matrices, we then label the state transitions of a trellis diagram describing the operation of the encoder. The frame error rate (FER) and the bit error rate (BER) performance results show an excellent behavior of our proposed super-quasi-orthogonal ST trellis codes.
Corneliu Eugen D. Sterian, Yi Wu 0006, Matthias Pätzold 0001
VTC Fall1
2006 A 16QAM Super-Quasi-Orthogonal Space-Time Trellis Code for Four Transmit Antennas
abstract
We demonstrate a super-quasi-orthogonal space- time (ST) trellis code for four transmit antennas with rectangular signal constellations for wireless communications with a spectral efficiency of 4 bits/s/Hz. Considering a mobile wireless communications system with four transmit antennas, we form an 8D signal constellation as Cartesian product of four 2D rectangular signal sets, an 8D point being transmitted by the first antenna as four concatenated 2D points in four consecutive channel uses. The 2D symbols transmitted by the other three antennas are not independent, but so chosen as to form, together with the symbols transmitted by the first antenna, the entries of a 4 times 4 quasi- orthogonal matrix. The union of two sets of quasi-orthogonal matrices forms a super-quasi-orthogonal signal set. With 4times4 quasi-orthogonal matrices, we then label the state transitions of a trellis diagram describing the operation of the encoder. The frame error rate (FER) and the bit error rate (BER) performance results show an excellent behavior of our proposed super-quasi- orthogonal ST trellis codes.
Corneliu Eugen D. Sterian, Yi Wu 0006, Matthias Pätzold 0001
VTC Fall1
2006 Using Constellation Shaping to Reduce the Peak and Average Power of OFDM Signals
abstract
We suggest applying constellation shaping to reduce the peak and average power of orthogonal frequency division multiplexing (OFDM) signals using quadrature amplitude modulation (QAM) in all subcarriers without clipping or reducing the data rate. Adopting the successful shell mapping algorithm for high data rate transmission over telephone channels, as described in the V.34 Recommendation of ITU-T, we build a shell mapping algorithm for multidimensional constellation in the frequency domain for OFDM communication systems with N subcarriers. We give closed-form expressions of the functions needed to apply the constellation shaping algorithm for any N being a power of two. No side information needs to be transmitted and the data rate remains the same as for the basic OFDM system. Our simulation results show that we are able to reduce the peak and mean power by about 1 dB for OFDM signals with N = 16. For a higher number of subcarriers, we expect that we obtain more freedom in power minimization and the resulting gain will be higher. The only price to be paid is the enhanced complexity of the system by an amount that is rather acceptable.
Corneliu Eugen D. Sterian, Krzysztof Wesolowski, Yi Wu 0006, Matthias Pätzold 0001
VTC Fall1
2006 Super-orthogonal space-time codes with rectangular constellations and two transmit antennas for high data rate wireless communications
abstract
We demonstrate super-orthogonal space-time (ST) trellis codes with rectangular signal constellations for wireless communications with a spectral efficiency of 4 bits/s/Hz. Considering a mobile wireless communications system with two transmit antennas, we form a 4D signal constellation as Cartesian product of two 2D rectangular signal sets, a 4D point being transmitted by the first antenna as two concatenated 2D points in two consecutive channel uses. The 2D symbols transmitted by the second antenna are not independent, but so chosen as to form, together with the symbols transmitted by the first antenna, the entries of a 2 times 2 orthogonal matrix. This can be done in four different ways, resulting in four sets of 2 times 2 orthogonal matrices. To obtain a higher data rate, the union of two of them forms a super-orthogonal signal set. With 2 times 2 orthogonal matrices, we then label the state transitions of a trellis diagram describing the operation of the encoder. We perform simulations using a model that takes into account the Doppler effect as well as the effect of spatial antenna correlation at both the base station (BS) and at the mobile station (MS). The frame error rate (FER) and the bit error rate (BER) performance results show an excellent behaviour of our proposed super-orthogonal ST trellis code, which clearly outperforms all known simple ST trellis codes of same spectral efficiency using 16QAM or 16PSK
Corneliu Eugen D. Sterian, Matthias Pätzold 0001, Bjørn Olav Hogstad
IEEE Trans. Wirel. Commun.1
1999 The constellation-shaping algorithm using closed-form expressions for the number of ring combinations
abstract
The V.34 high-speed modem combines a number of advanced techniques including constellation shaping by shell mapping. This technique makes use of some functions representing the number of ring combinations with a given cost. In this correspondence, closed-form expressions for these functions are given and used in the constellation shaping by the shell-mapping algorithm.
Corneliu Eugen D. Sterian
IEEE Trans. Commun.1
1997 Wei-type trellis-coded modulation with 2N -dimensional rectangular constellation for N not a power of two
abstract
The Wei method of constructing trellis codes with 2N-dimensional rectangular signal constellations is limited to N being an integer power of two. In the present correspondence, this limitation is removed and examples of six-dimensional (6-D) and twelve-dimensional (12-D) trellis codes are given.
Corneliu Eugen D. Sterian
IEEE Trans. Inf. Theory1