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.

Chang-Chih Huang

dblp:05/8515 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2011
—ORCID · none

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

Computer networks · 2

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
2 papers
Physical-layer communications · 100%
Theoretical computer science
1 paper
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications › modulation › coded modulation
trellis-coded modulation
0.222011
Noncoherently Non-Catastrophic Trellis Coded Modulation · IEEE Trans. Commun. 2011
Bandwidth-efficient noncoherent Trellis-coded MPSK · IEEE Trans. Commun. 2009
Physical-layer communications › modulation › amplitude-phase modulation
amplitude phase shift keying
0.112011
Noncoherently Non-Catastrophic Trellis Coded Modulation · IEEE Trans. Commun. 2011
Physical-layer communications
channel coding
0.112011
Noncoherently Non-Catastrophic Trellis Coded Modulation · IEEE Trans. Commun. 2011
Physical-layer communications
modulation
0.112011
Noncoherently Non-Catastrophic Trellis Coded Modulation · IEEE Trans. Commun. 2011
Physical-layer communications › signal detection
noncoherent detection
0.112011
Noncoherently Non-Catastrophic Trellis Coded Modulation · IEEE Trans. Commun. 2011
Coding theory › source coding › predictive coding
differential encoding
0.012009
Bandwidth-efficient noncoherent Trellis-coded MPSK · IEEE Trans. Commun. 2009

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

computer search for trellis codes · 0.2differential encoding · 0.1convolutional coding · 0.1
YearPublicationVenuePosition
2011 Noncoherently Non-Catastrophic Trellis Coded Modulation
abstract
In this paper, we propose a noncoherently non-catastrophic trellis-coded modulation scheme, in which the transmitter includes a differential encoder, a rotator, an inverse signal mapper, a convolutional encoder and a signal mapper. We present examples of the proposed scheme including MPSK (M-ary phase shift keying), QAM (quadrature-amplitude modulation), and TAPSK (twisted amplitude and phase shift keying). For trellis-coded QAM, a differential encoder with which the complexity of the proposed scheme can be reduced is proposed. Simulation results demonstrate that for noncoherent decoding, the proposed trellis-coded QAM has much better error performance than conventional trellis-coded QAM, and the proposed trellis-coded 16APSK outperforms trellis-coded 16QAM for short observation length.
Ruey-Yi Wei, Chang-Chih Huang
IEEE Trans. Commun.2
2010 Noncoherently Non-Catastrophic Trellis Coded QAM
abstract
In this paper, we propose a new noncoherent trellis-coded QAM (quadrature-amplitude modulation) scheme, in which a differential encoder, a rotator and an inverse signal mapper are added in front of the convolutional encoder. Trellis codes of the proposed scheme are shown to be noncoherently non-catastrophic and have better error performances than conventional trellis-coded QAM. %for short observation length. New trellis codes which, for the proposed cheme, have better bit error rates than Ungerboeck's codes are found by computer searches.
Ruey-Yi Wei, Chang-Chih Huang
VTC Spring2
2009 Bandwidth-efficient noncoherent Trellis-coded MPSK
abstract
In this letter, we propose a novel bandwidth-efficient noncoherent trellis-coded MPSK scheme, in which a particularly designed differential encoder is added in front of the trellis encoder. With this differential encoder, trellis-coded MPSK proposed by Ungerboeck is no longer noncoherently catastrophic and thus achieves better error performance. Moreover, new trellis codes which, for the proposed scheme, have better bit error rates than Ungerboeck's codes are found by computer searches.
Ruey-Yi Wei, Chang-Chih Huang
IEEE Trans. Commun.2