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.

Kwok Hung Chei

dblp:20/10713 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2000
—ORCID · none

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

Computer networks · 1Graphics, 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.

Theoretical computer science
1 paper
Coding theory · 100%
Computer networks
1 paper
Physical-layer communications · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory
source coding
0.012000
Optimal soft decoding for combined trellis-coded quantization/modulation · IEEE Trans. Commun. 2000
Coding theory › error-correcting codes › coded modulation
trellis-coded modulation
0.012000
Optimal soft decoding for combined trellis-coded quantization/modulation · IEEE Trans. Commun. 2000
Coding theory › source coding › quantization › structured vector quantization
trellis-coded quantization
0.012000
Optimal soft decoding for combined trellis-coded quantization/modulation · IEEE Trans. Commun. 2000
Physical-layer communications › channel coding › decoding algorithms
maximum a posteriori decoding
0.012000
Optimal soft decoding for combined trellis-coded quantization/modulation · IEEE Trans. Commun. 2000
Physical-layer communications › channel coding › error control coding › decoding
soft-decision decoding
0.012000
Optimal soft decoding for combined trellis-coded quantization/modulation · IEEE Trans. Commun. 2000

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

minimum mean-squared-error decoding · 0.1iterative optimization · 0.1
YearPublicationVenuePosition
2000 Design of optimal soft decoding for combined trellis coded quantization/modulation in Rayleigh fading channel
abstract
The well-known Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm is used as a minimum mean-squared error (MMSE) decoder for combined trellis-coded quantization and modulation. When the BCJR algorithm is used as decoder, the optimal trellis-coded encoder is derived. Both trellis-coded quantizer and the soft-decoder can be optimized iteratively for minimum overall distortion from transmitter input to receiver output. The optimal encoder/decoder is simulated for Rayleigh fading channel. Significant performance improvement is achieved for both memoryless Gaussian and uniform source, especially for very noisy channel.
Kwok Hung Chei, Keang-Po Ho
ICASSP1
2000 Optimal soft decoding for combined trellis-coded quantization/modulation
abstract
The maximum a posteriori (MAP) algorithm is used as a minimum mean-squared-error decoder for combined trellis-coded quantization and modulation. The optimal trellis-coded quantizer is derived when the soft-decoding MAP algorithm is used as a decoder. The trellis-coded quantizer and the soft decoder are optimized iteratively for minimum overall distortion from transmitter input to receiver output. Significant performance improvement is achieved for both memoryless Gaussian and uniform source, especially for very noisy channels.
Keang-Po Ho, Kwok Hung Chei
IEEE Trans. Commun.2