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

Jin-Der Wang

dblp:123/2785 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
0since 2021 · last 1991
—ORCID · none

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

Computer networks · 4 · 3 first-authorGraphics, computer vision, multimedia, augmented reality and games · 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
4 papers
Physical-layer communications · 100%
Theoretical computer science
1 paper
Coding theory · 56% Information theory · 44%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications
signal processing for communications
0.021991
Second-order statistics of logarithmic quantization noise in QAM data communication · IEEE Trans. Commun. 1991
Trellis coded communication systems-colored noise and the swapping technique · IEEE Trans. Commun. 1990
Physical-layer communications › signal processing for communications › quantization
quantization noise analysis
0.011991
Second-order statistics of logarithmic quantization noise in QAM data communication · IEEE Trans. Commun. 1991
Physical-layer communications
equalization
0.011990
Trellis coded communication systems-colored noise and the swapping technique · IEEE Trans. Commun. 1990
Information theory › probability theory › stochastic processes › noise process
colored noise
0.011990
Trellis coded communication systems-colored noise and the swapping technique · IEEE Trans. Commun. 1990
Coding theory › error-correcting codes › coded modulation
trellis-coded modulation
0.011990
Trellis coded communication systems-colored noise and the swapping technique · IEEE Trans. Commun. 1990
Physical-layer communications › synchronization › frequency synchronization
carrier frequency offset compensation
0.011988
Performance analysis of an echo-cancellation arrangement that compensates for frequency offset in the far echo · IEEE Trans. Commun. 1988
Physical-layer communications › interference cancellation
echo cancellation
0.011988
Performance analysis of an echo-cancellation arrangement that compensates for frequency offset in the far echo · IEEE Trans. Commun. 1988
Physical-layer communications › digital transmission systems › wireline communication
power line communication
0.011988
Adaptive harmonic noise cancellation with an application to distribution power line communications · IEEE Trans. Commun. 1988
Physical-layer communications
modulation
0.011991
Second-order statistics of logarithmic quantization noise in QAM data communication · IEEE Trans. Commun. 1991
Physical-layer communications › modulation
quadrature amplitude modulation
0.011991
Second-order statistics of logarithmic quantization noise in QAM data communication · IEEE Trans. Commun. 1991
Coding theory › error-correcting codes › convolutional codes › convolutional code decoding
viterbi decoding
0.011990
Trellis coded communication systems-colored noise and the swapping technique · IEEE Trans. Commun. 1990
Physical-layer communications › signal processing for communications
adaptive filtering
0.011988
Adaptive harmonic noise cancellation with an application to distribution power line communications · IEEE Trans. Commun. 1988

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

computer simulation · 0.0second-order statistics analysis · 0.0phase-locked loop · 0.0least mean squares · 0.0convergence analysis · 0.0constrained adaptive filtering · 0.0
YearPublicationVenuePosition
1991 Second-order statistics of logarithmic quantization noise in QAM data communication
abstract
When a QAM (quadrature amplitude modulation) data signal is transmitted over a channel that includes PCM codecs, it has frequently been observed and shown that the resulting noise around the final received constellation points grows with the distance of the point from the origin. The authors extend the analysis of this effect, and further show that the noise distribution about each point is elliptical, with greater variance in the radial direction. Formulas giving the signal-dependent noise components as a function of the channel characteristics of the analog transmit and receive access legs are derived. Experimental results confirm the analysis.>
Burton R. Saltzberg, Jin-Der Wang
IEEE Trans. Commun.2
1990 Trellis coded communication systems-colored noise and the swapping technique
abstract
An analytical approach for investigating the effect of noise correlation on the performance of trellis-coded communication systems is described. Several trellis codes are investigated in the presence of colored noise, and computer simulation and real-time experimental results are given to confirm the analysis. In some practical cases, the actual coding gain could be as small as a fraction of 1 dB as opposed to the nominal 4-5 dB of coding gain that can be obtained on additive white Gaussian noise (AWGN) channels. A filter swapping technique which eliminates the performance degradation due to the effect of noise correlation is proposed. It is shown that if the equalizer is moved from the receiver to the transmitter and is scaled to satisfy an average power constraint, then the noise at the Viterbi decoder input is white and the signal-to-noise ratio remains the same. Doing this allows the nominal coding gain to be achieved.>
Jin-Der Wang, Hong Y. Chung
IEEE Trans. Commun.1
1988 Adaptive harmonic noise cancellation with an application to distribution power line communications
abstract
Adaptive LMS (least mean squares) filter are applied to cancel harmonic noise. Simulations were done using actual noise recorded at a distribution power substation. Two implementation methods are discussed. Using the characteristic properties of the noise, a constrained filter is proposed which greatly reduces computation without reducing its effectiveness. It is shown that both constrained and unconstrained adaptive noise cancellation filters can be used effectively. For either case, significant improvement in the error rate is obtained.>
Jin-Der Wang, H. Joel Trussell
IEEE Trans. Commun.1
1988 Performance analysis of an echo-cancellation arrangement that compensates for frequency offset in the far echo
abstract
Analytical and experimental results are presented for the performance of one echo canceller arrangement. It consists of a data-driven echo canceller having a so-called cross-coupled structure, which is followed by a rotator and a phase-locked loop (PLL). A cross-coupled echo canceller structure without a PLL is analyzed first. Expressions for speed of convergence and achievable echo-return-loss enhancement (ERLE) in the presence of frequency offset are derived. These results are compared in previously published results for a noncross-coupling echo canceller structure. Specifically, it is shown that the cross-coupled structure converges twice as fast as the noncross-coupled structure and provide an achievable ERLE that is about 6 dB better. The joint adaptation of the echo canceller and the PLL is then studied. It is shown that it is always possible to choose design parameters for the echo canceller which are consistent with adaptation requirements under double-talking conditions, provided that the PLL is properly engineered. The sensitivity of the performance of PLL to the power level of the far echo, as well as possible solutions to this problem, are discussed.>
Jin-Der Wang, Jean-Jacques Werner
IEEE Trans. Commun.1
1986 A unified derivation of the fast RLS algorithms
abstract
The equivalence of three fast fixed order reeursive least squares (RLS] algorithms is shown. The FAEST and FTF algorithms are derived by eliminating redundancies in the fast Kalman algorithm. Exact equivalence is obtained by careful selection of the initial conditions. This equivalence suggests a new rescue variable which can perform no worse than previous ones and can test other symptoms of divergence as well.
Jin-Der Wang, H. Joel Trussell
ICASSP1