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.

Welly Firmanto

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

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

Computer networks · 3 · 2 first-authorTheory 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.

Theoretical computer science
1 paper
Coding theory · 77% Information theory · 23%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
fading channel coding
0.012003
Performance and design of space-time coding in fading channels · IEEE Trans. Commun. 2003
Information theory › channel capacity › fading channel
rician fading channel
0.012003
Performance and design of space-time coding in fading channels · IEEE Trans. Commun. 2003
Coding theory › error-correcting codes
space-time codes
0.012003
Performance and design of space-time coding in fading channels · IEEE Trans. Commun. 2003
Coding theory › error-correcting codes › space-time codes
space-time code design
0.012003
Performance and design of space-time coding in fading channels · IEEE Trans. Commun. 2003
Coding theory › error-correcting codes › error probability analysis
pairwise error probability
0.012003
Performance and design of space-time coding in fading channels · IEEE Trans. Commun. 2003

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

simulation · 0.0pairwise-error probability bounds · 0.0
YearPublicationVenuePosition
2003 Performance and design of space-time coding in fading channels
abstract
The pairwise-error probability upper bounds of space-time codes (STCs) in independent Rician fading channels are derived. Based on the performance analysis, novel code design criteria for slow and fast Rayleigh fading channels are developed. It is found that, in fading channels, the STC design criteria depend on the value of the possible diversity gain of the system. In slow fading channels, when the diversity gain is smaller than four, the code error performance is dominated by the minimum rank and the minimum determinant of the codeword distance matrix. However, when the diversity gain is larger than, or equal to, four, the performance is dominated by the minimum squared Euclidean distance. Based on the proposed design criteria, new codes are designed and evaluated by simulation.
Jinhong Yuan, Zhuo Chen 0001, Branka Vucetic, Welly Firmanto
IEEE Trans. Commun.4
2001 Design of space-time turbo trellis coded modulation for fading channels
abstract
This paper presents the design of space-time turbo trellis coded modulation (ST turbo TCM). We introduce new recursive space-time trellis coded modulation (STTC) which outperform feedforward STTC proposed by Tarokh, Seshadri and Calderbank (see Trans. Inform. Theory, vol.44, no.2, p.744-65, 1998) and by Baro, Bauch and Hansmann (see IEEE Trans. Commun. Letters, vol.4, no.1, p.20-22, 2000) . A substantial improvement in performance can be obtained by constructing parallel concatenation of recursive STTC and making use of iterative decoding. The new recursive STTCs can be used directly in this scheme. ST turbo TCM outperforms the best known STTC by about 2 dB on slow fading channels and by up to 8 dB on fast fading channels.
Welly Firmanto, Zhuo Chen 0001, Branka Vucetic, Jinhong Yuan
GLOBECOM1
2001 Layered space-time coding: performance analysis and design criteria
abstract
A layered space-time architecture has been proposed to realize the tremendous increase in capacity which is offered by rich scattering wireless channels in comparison with a single transmit and single receive antenna case. We analyze the performance of horizontally (HLST) and diagonally (DLST) layered space-time architectures on slow and fast Rayleigh fading channels. Based on the analysis, we derive the code design criteria for the constituent codes for each architecture.
Welly Firmanto, Jinhong Yuan, Ka Leong Lo, Branka Vucetic
GLOBECOM1
2001 Design of space-time turbo TCM on fading channels
abstract
Novel code design criteria for space-time codes on slow Rayleigh fading channels are presented. It is shown that the code performance is dominated by the minimum rank r and the minimum determinant of the codeword distance matrix when the product of the minimum rank r and the number of receive antennas n/sub R/ is less than 4. However, when r/spl middot/n/sub R/ is greater than or equal to 4, the code error performance is dominated by the minimum trace of the codeword distance matrix. Furthermore, we present recursive spacetime trellis coded modulation (STTC) which outperforms feedforward STTC on slow and fast fading channels. A substantial increase in performance can be obtained by constructing spacetime turbo trellis coded modulation (ST turbo TCM) which consists of concatenated recursive STTC, decoded by iterative decoding algorithm. The proposed recursive STTC are used as constituent codes in this scheme. The proposed ST turbo TCM significantly outperforms the best known STTC on both slow and fast fading channels.
Jinhong Yuan, Branka Vucetic, Zhuo Chen 0001, Welly Firmanto
ITW4