Demo Data from EDBT 2026 / reviewers in the wild / expert
Richard H.-H. Yang
dblp:17/6345
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1994
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory 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.
| Theoretical computer science
1 paper |
Coding theory · 100% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › error-correcting codes › coded modulation
continuous phase frequency-shift keying |
0.0 | 1 | 1994 | Trellis-coded continuous-phase frequency-shift keying with ring convolutional codes · IEEE Trans. Inf. Theory 1994 |
Coding theory › error-correcting codes
convolutional codes |
0.0 | 1 | 1994 | Trellis-coded continuous-phase frequency-shift keying with ring convolutional codes · IEEE Trans. Inf. Theory 1994 |
Coding theory › error-correcting codes › convolutional codes › algebraic convolutional code
ring convolutional codes |
0.0 | 1 | 1994 | Trellis-coded continuous-phase frequency-shift keying with ring convolutional codes · IEEE Trans. Inf. Theory 1994 |
Coding theory › error-correcting codes › coded modulation
trellis-coded modulation |
0.0 | 1 | 1994 | Trellis-coded continuous-phase frequency-shift keying with ring convolutional codes · IEEE Trans. Inf. Theory 1994 |
Methods — techniques the papers use, named apart from their topics
trellis coding · 0.0euclidean distance optimization · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1994 | Trellis-coded continuous-phase frequency-shift keying with ring convolutional codesabstractTrellis-coding techniques are applied to continuous-phase frequency-shift keying (CPFSK). A new coding scheme based on convolutional codes on the ring of integers modulo-P is shown to be a natural way to apply trellis coding to CPFSK. Previous work has decomposed CPFSK into two parts: a linear encoder, with memory called the continuous phase encoder (CPE), and a memoryless modulator (MM), where the CPE often has a code structure defined over the ring of integers modulo-P. The combination of a modulo-P convolutional channel encoder (CE) and the CPE is a linear modulo-P encoder. Design examples are given for rate-1/2 coded quaternary CPFSK with modulation indexes 1/2 and 1/4, and rate-2/3 coded octal CPFSK with modulation index 1/8. Combinations are optimized in the normalized minimum Euclidean distance sense for a given total number of states in the overall MLSE receiver. Numerical results show that this new coding scheme consistently obtains better performance than previous schemes.> Richard H.-H. Yang, Desmond P. Taylor |
IEEE Trans. Inf. Theory | 1 |