Demo Data from EDBT 2026 / reviewers in the wild / expert
Lee-Fang Wei
dblp:25/3847
· DBLP profile ↗
10ranked-venue papers
9as first author
0since 2021 · last 1994
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 8 · 7 first-authorTheory of computation · 2 · 2 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
8 papers |
Physical-layer communications · 100% | |
| Theoretical computer science
5 papers |
Coding theory · 100% | |
| Computer graphics and multimedia
2 papers |
Multimedia systems and quality of experience · 100% |
Topics — the 27 heaviest of 28, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › error-correcting codes
coded modulation |
0.0 | 3 | 1993 | Coded M-DPSK with built-in time diversity for fading channels · IEEE Trans. Inf. Theory 1993 Coded modulation with unequal error protection · IEEE Trans. Commun. 1993 Multidimensional constellations. I. Introduction, figures of merit, and generalized cross constellations · IEEE J. Sel. Areas Commun. 1989 |
Physical-layer communications › modulation
coded modulation |
0.0 | 4 | 1994 | Generalized square and hexagonal constellations for intersymbol-interference channels with generalized Tomlinson-Harashima precoders · IEEE Trans. Commun. 1994 Rotationally invariant trellis-coded modulations with multidimensional M-PSK · IEEE J. Sel. Areas Commun. 1989 Rotationally Invariant Convolutional Channel Coding with Expanded Signal Space-Part II: Nonlinear Codes · IEEE J. Sel. Areas Commun. 1984 |
Physical-layer communications › modulation
constellation design |
0.0 | 2 | 1994 | Generalized square and hexagonal constellations for intersymbol-interference channels with generalized Tomlinson-Harashima precoders · IEEE Trans. Commun. 1994 Precoding Technique for Partial-Response Channels with Applications to HDTV Transmission · IEEE J. Sel. Areas Commun. 1993 |
Physical-layer communications › modulation › coded modulation
trellis-coded modulation |
0.0 | 2 | 1994 | Two-level coding based on trellis-coded modulation and Reed-Solomon codes · IEEE Trans. Commun. 1994 Rotationally invariant trellis-coded modulations with multidimensional M-PSK · IEEE J. Sel. Areas Commun. 1989 |
Physical-layer communications
channel coding |
0.0 | 4 | 1993 | Precoding Technique for Partial-Response Channels with Applications to HDTV Transmission · IEEE J. Sel. Areas Commun. 1993 Rotationally Invariant Convolutional Channel Coding with Expanded Signal Space-Part II: Nonlinear Codes · IEEE J. Sel. Areas Commun. 1984 Rotationally Invariant Convolutional Channel Coding with Expanded Signal Space-Part I: 180° · IEEE J. Sel. Areas Commun. 1984 |
Physical-layer communications
modulation |
0.0 | 2 | 1993 | Precoding Technique for Partial-Response Channels with Applications to HDTV Transmission · IEEE J. Sel. Areas Commun. 1993 Rotationally invariant trellis-coded modulations with multidimensional M-PSK · IEEE J. Sel. Areas Commun. 1989 |
Physical-layer communications › MIMO › precoding
tomlinson-harashima precoding |
0.0 | 1 | 1994 | Generalized square and hexagonal constellations for intersymbol-interference channels with generalized Tomlinson-Harashima precoders · IEEE Trans. Commun. 1994 |
Coding theory › error-correcting codes
concatenated codes |
0.0 | 1 | 1994 | Two-level coding based on trellis-coded modulation and Reed-Solomon codes · IEEE Trans. Commun. 1994 |
Coding theory › error-correcting codes › coded modulation
multidimensional constellations |
0.0 | 2 | 1989 | Multidimensional constellations. I. Introduction, figures of merit, and generalized cross constellations · IEEE J. Sel. Areas Commun. 1989 Trellis-coded modulation with multidimensional constellations · IEEE Trans. Inf. Theory 1987 |
Physical-layer communications › channel modeling › channel with memory
partial-response channel |
0.0 | 1 | 1993 | Precoding Technique for Partial-Response Channels with Applications to HDTV Transmission · IEEE J. Sel. Areas Commun. 1993 |
Physical-layer communications › MIMO
precoding |
0.0 | 1 | 1993 | Precoding Technique for Partial-Response Channels with Applications to HDTV Transmission · IEEE J. Sel. Areas Commun. 1993 |
Physical-layer communications › modulation
quadrature amplitude modulation |
0.0 | 1 | 1993 | Precoding Technique for Partial-Response Channels with Applications to HDTV Transmission · IEEE J. Sel. Areas Commun. 1993 |
Coding theory › error-correcting codes › coded modulation
constellation design |
0.0 | 1 | 1993 | Coded modulation with unequal error protection · IEEE Trans. Commun. 1993 |
Coding theory › error-correcting codes
unequal error protection |
0.0 | 1 | 1993 | Coded modulation with unequal error protection · IEEE Trans. Commun. 1993 |
Multimedia systems and quality of experience › interactive multimedia
interactive television |
0.0 | 2 | 1993 | Coded modulation with unequal error protection · IEEE Trans. Commun. 1993 Precoding Technique for Partial-Response Channels with Applications to HDTV Transmission · IEEE J. Sel. Areas Commun. 1993 |
Physical-layer communications › channel coding › error control coding
convolutional codes |
0.0 | 2 | 1984 | Rotationally Invariant Convolutional Channel Coding with Expanded Signal Space-Part II: Nonlinear Codes · IEEE J. Sel. Areas Commun. 1984 Rotationally Invariant Convolutional Channel Coding with Expanded Signal Space-Part I: 180° · IEEE J. Sel. Areas Commun. 1984 |
Physical-layer communications › modulation › phase-shift keying
MPSK |
0.0 | 1 | 1989 | Rotationally invariant trellis-coded modulations with multidimensional M-PSK · IEEE J. Sel. Areas Commun. 1989 |
Physical-layer communications › channel coding › error control coding
rotationally invariant code |
0.0 | 2 | 1984 | Rotationally Invariant Convolutional Channel Coding with Expanded Signal Space-Part II: Nonlinear Codes · IEEE J. Sel. Areas Commun. 1984 Rotationally Invariant Convolutional Channel Coding with Expanded Signal Space-Part I: 180° · IEEE J. Sel. Areas Commun. 1984 |
Coding theory
lattice codes |
0.0 | 1 | 1989 | Multidimensional constellations. I. Introduction, figures of merit, and generalized cross constellations · IEEE J. Sel. Areas Commun. 1989 |
Coding theory › signal sets › signal set design
shaping gain |
0.0 | 1 | 1989 | Multidimensional constellations. I. Introduction, figures of merit, and generalized cross constellations · IEEE J. Sel. Areas Commun. 1989 |
Coding theory › error-correcting codes
code construction |
0.0 | 1 | 1987 | Trellis-coded modulation with multidimensional constellations · IEEE Trans. Inf. Theory 1987 |
Coding theory › error-correcting codes › coded modulation
trellis-coded modulation |
0.0 | 1 | 1987 | Trellis-coded modulation with multidimensional constellations · IEEE Trans. Inf. Theory 1987 |
Physical-layer communications › channel modeling › channel with memory
intersymbol interference channel |
0.0 | 1 | 1994 | Generalized square and hexagonal constellations for intersymbol-interference channels with generalized Tomlinson-Harashima precoders · IEEE Trans. Commun. 1994 |
Coding theory › error-correcting codes
reed-solomon codes |
0.0 | 1 | 1994 | Two-level coding based on trellis-coded modulation and Reed-Solomon codes · IEEE Trans. Commun. 1994 |
Multimedia systems and quality of experience › video transmission
HDTV transmission |
0.0 | 1 | 1993 | Precoding Technique for Partial-Response Channels with Applications to HDTV Transmission · IEEE J. Sel. Areas Commun. 1993 |
Physical-layer communications
fading channels |
0.0 | 1 | 1993 | Coded M-DPSK with built-in time diversity for fading channels · IEEE Trans. Inf. Theory 1993 |
Physical-layer communications › channel coding › convolutional decoding
viterbi decoding |
0.0 | 1 | 1987 | Trellis-coded modulation with multidimensional constellations · IEEE Trans. Inf. Theory 1987 |
Methods — techniques the papers use, named apart from their topics
viterbi decoding · 0.0coded modulation · 0.0bit interleaving · 0.0time-division multiplexing · 0.0time division multiplexing · 0.0lattice partitioning · 0.0constellation expansion ratio analysis · 0.0computer simulation · 0.0code design · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1994 | Generalized square and hexagonal constellations for intersymbol-interference channels with generalized Tomlinson-Harashima precodersabstractFor channels with severe amplitude distortion such as high-speed digital subscriber loops, using a Tomlinson-Harashima (TH) precoder in the transmitter has the same intersymbol-interference-elimination and noise-suppression advantages as using a decision feedback equalizer in the receiver, but without its disadvantage of error propagation. TH precoders have a further advantage of interworking easily with coded modulation techniques. Square constellations are generally preferred in systems using conventional TH precoders. The choice for the size of square constellations is, however, limited. The authors widen that choice by designing new families of generalized square and hexagonal constellations together with their matched generalized TH precoders. The design of the constellation and TH precoder is closely related to the design. Using a generalized TH precoder also results in a smaller peak-to-average power ratio of the transmitted signal than that for conventional TH precoders. Simple modifications of Viterbi decoders required by the use of TH precoders are also discussed.> Lee-Fang Wei |
IEEE Trans. Commun. | 1 |
| 1994 | Two-level coding based on trellis-coded modulation and Reed-Solomon codesabstractA number of two-level codes based on trellis-coded modulation (TCM) schemes and their matched single or double error-correcting Reed-Solomon codes using QAM constellations are presented and evaluated. Compared to the well-known 4D 16-state TCM scheme with a comparable bandwidth efficiency, these two-level codes provide greater immunity from both Gaussian and impulse noise, at the cost of a reasonably higher complexity and a longer decoding delay, on the order of a few hundred symbols. The authors also show how to cope with phase ambiguities of the constellation in these two-level codes. Both rotationally invariant coding and rotation detecting techniques are considered.> Lee-Fang Wei |
IEEE Trans. Commun. | 1 |
| 1993 | Precoding Technique for Partial-Response Channels with Applications to HDTV TransmissionabstractAn equivalent partial-response (PR) channel 1-Z/sup -k/ arises in the envisioned terrestrial over-the-air broadcasting of digital high-definition television (HDTV) signals when a comb filter is used by an HDTV receiver to reduce the NTSC cochannel interference. The design of signal constellations and their associated precoders for this PR channel is considered. Besides PAM and square QAM, it is shown that generalized square and hexagonal constellations can also be used. Coded modulation and graceful degradation in the received signal quality are discussed. The results extended to a more general PR channel.> Lee-Fang Wei |
IEEE J. Sel. Areas Commun. | 1 |
| 1993 | Coded modulation with unequal error protectionabstractIt is always desirable to maintain communications in difficult situations, even though fewer messages can get across. The author has developed such capabilities for one-way broadcast media, such as the envisioned terrestrial broadcasting of digital high-definition television signals. In this television broadcasting, the data from video source encoders are not equally important. It is desirable that the important data be recovered by each receiver even under poor receiving conditions. Two approaches for providing such unequal error protection to different classes of data are presented. Power-efficient and bandwidth-efficient coded modulation is used in both approaches. The first approach is based on novel signal constellations with nonuniformly spaced signal points. The second uses time division multiplexing of different conventional coded modulation schemes. Both approaches can provide error protection for the important data to an extent that can hardly be achieved using conventional coded modulation with equal error protection. For modest amounts of important data, the first approach has, additionally, the potential of providing immunity from impulse noise through simple bit or signal-point interleaving.> Lee-Fang Wei |
IEEE Trans. Commun. | 1 |
| 1993 | Coded M-DPSK with built-in time diversity for fading channelsabstractGood coded modulation for fading channels requires built-in time diversity. Under a constraint on the interleaving delay, the authors construct and compare three categories of coded M-DPSK (M-ary differential phase-shift keying) schemes with 4> Lee-Fang Wei |
IEEE Trans. Inf. Theory | 1 |
| 1989 | Multidimensional constellations. I. Introduction, figures of merit, and generalized cross constellationsabstractThe authors discuss the major attributes desired in signal constellations, such as signal-to-noise ratio (SNR) efficiency, simplicity of mapping bits to points and vice versa, compatibility with coded modulation schemes, and compatibility with quadrature amplitude modulation (QAM). The capability of supporting a so-called opportunistic secondary channel, often used for internal control signaling, is considered. The gain in SNR efficiency of a multidimensional constellation (lattice code) consisting of the points from a lattice Lambda within a region R compared to a cubic constellation is shown to be approximately separable into the coding gain of Lambda and the shape gain of R, for large constellations. Similarly, the expansion of the associated constituent 2-D constellation is shown to be approximately separable into a constellation expansion ratio (CER) coding component CER/sub c/( Lambda ) and a shaping component CER/sub s/(R). The N sphere is the region R with the best shape gain, but N also has large constellation expansion. Bounds for the best possible shape gain versus CER/sub s/(R) or peak-to-average-power ratio (PAR) are given. Generalized cross constellations are discussed. These constellations yield a modest shape gain with very low CER/sub s/(R) or PAR, are easily implemented, are well suited for use with coded QAM modems, and can be readily adapted to support an opportunistic secondary channel.> G. David Forney Jr., Lee-Fang Wei |
IEEE J. Sel. Areas Commun. | 2 |
| 1989 | Rotationally invariant trellis-coded modulations with multidimensional M-PSKabstractUsing a multidimensional approach, the author discovers a large family of rotationally invariant trellis-coded M-PSK (M-ary shift keying) schemes, M>or=8, with nominal coding gains ranging from 3 to 5 dB and with bandwidth requirements the same as, or even less than, those of uncoded M/2-PSK schemes at the same information bit rate. The rotationally invariant schemes have performance and complexities comparable to the best known nonrotationally-invariant trellis-coded two-dimensional M-PSK schemes. Computer simulation results for these schemes, assuming an additive white-Gaussian-noise (AWGN) channel, are reported.> Lee-Fang Wei |
IEEE J. Sel. Areas Commun. | 1 |
| 1987 | Trellis-coded modulation with multidimensional constellationsabstractTrellis-coded modulation schemes using four-, eight-, or16-dimensional constellations have a number of potential advantages over the usual two-dimensional schemes: a smaller constituent two-dimensional constellation, easier tolerance to phase ambiguities, and a better trade-off between complexity and coding gain. A number of such schemes are presented and evaluated. Starting with a variety of multidimensional lattices, we show how to select multidimensional constellations, how to partition them into subsets, how to construct trellis codes using those subsets, and how to map hits to constellation points. Simplifications of the Viterbi decoding algorithm are presented. We conclude that there are multidimensional trellis-coded modulation schemes that perform better for the same complexity than do two-dimensional schemes. Lee-Fang Wei |
IEEE Trans. Inf. Theory | 1 |
| 1984 | Rotationally Invariant Convolutional Channel Coding with Expanded Signal Space-Part I: 180°abstractConvolutional channel coding with expanded signal space improves error performance of synchronous data links without sacrificing data rate or requiring more bandwidth. Due to the phase ambiguity(ies) in the expanded signal space, it is desirable to design the code' to be transparent to signal element rotations. In this paper, design rules and procedures for 180° rotationally invariant codes are presented. In a companion paper, we extend these rules and procedures to codes which are transparent to 90, 180, and 270° signal element rotations. We illustrate these rules and procedures by designing simple codes that achieve coding gain of 3-4 dB. These are the codes of practical interest. Codes with higher coding gain can be obtained using the same rules and procedures. Both feedforward and feedback codes are considered. Lee-Fang Wei |
IEEE J. Sel. Areas Commun. | 1 |
| 1984 | Rotationally Invariant Convolutional Channel Coding with Expanded Signal Space-Part II: Nonlinear CodesabstractThis is the second paper on rotationally invariant convolutional channel coding with expanded signal space. Signal space with 90, 180, and 270° phase ambiguities is generally preferred to signal space with only 180° phase ambiguity. In this paper, design rules and procedures for 180° rotationally invariant convolutional codes in the previous paper are extended to rotationally invariant codes with expanded signal space having 90, 180, and 270° phase ambiguities. As in the previous paper, we illustrate these rules and procedures by designing simple codes with coding gain of 4 dB. Nonlinear convolutional codes result from these design rules and procedures. These simple nonlinear convolutional codes are being considered as international standards on voiceband modems at rate greater than or equal to 9.6 kbits/s. Codes with higher coding gain can be obtained using the same rules and procedures. Both feedforward and feedback codes are considered. In addition, a new class of codes described as "generalized feedback" is also considered. Lee-Fang Wei |
IEEE J. Sel. Areas Commun. | 1 |