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

Srijidtra Mahapakulchai

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

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

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

Theoretical computer science
1 paper
Coding theory · 100%
Computer graphics and multimedia
1 paper
Image and video coding · 100%

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

TopicWeightPapersLastEvidence papers
Image and video coding › image compression
wavelet-based image coding
0.012004
Design of ring convolutional trellis codes for MAP decoding of MPEG-4 images · IEEE Trans. Commun. 2004
Coding theory › error-correcting codes › convolutional codes › algebraic convolutional code
ring convolutional codes
0.012004
Design of ring convolutional trellis codes for MAP decoding of MPEG-4 images · IEEE Trans. Commun. 2004
Coding theory › error-correcting codes › coded modulation
trellis-coded modulation
0.012004
Design of ring convolutional trellis codes for MAP decoding of MPEG-4 images · IEEE Trans. Commun. 2004

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

maximum a posteriori decoding · 0.1CPFSK · 0.1
YearPublicationVenuePosition
2009 Mismatched source transition probability matrix for adaptive MAP decoding in MPEG-4 imagery wireless transmission systems
abstract
Here, we design the efficient technique of transmitting the source transition probability matrix (STPM) by accompanied with the lowest frequency subband (LFS). The entries of this stochastic matrix are adaptively computed by applying the first order Markov model with MPEG-4 zerotree sequences. Because of channel disturbances, we obtain the mismatched STPM at the ML-Viterbi receiver and then employ it for newly computed branch metrics at the MAP source-controlled channel decoder. For analysis, we also evaluate the residual redundancies for both the ¿Lena¿ and the ¿Barbara¿ images. The system performance is summarized in term of both PSNR (dB) and WER for three types of slow flat Rician fading channels. In the mismatched STPM simulation results, we still obtain the most PSNR improvement of about 0.14 dB.
Srijidtra Mahapakulchai, Chalie Charoenlarpnopparut, Siriwat Hasajitto
PIMRC1
2004 Design of ring convolutional trellis codes for MAP decoding of MPEG-4 images
abstract
We propose a trellis-coded modulation system using continuous-phase frequency-shift keying (CPFSK) and ring convolutional codes for transmitting the bits generated by an embedded zerotree wavelet encoder. Improved performance is achieved by using maximum a posteriori decoding of the zerotree symbols, and ring convolutional trellis codes are determined for this decoding method. The CPFSK transmitter is decomposed into a memoryless modulator and a continuous phase encoder over the ring of integers modulo 4; the latter is combined with a polynomial convolutional encoder over the same ring. In the code design process, a search is made of the combined trellis, where the branch metrics are modified to include the source transition matrix. Simulation results of image transmission are provided using the optimized system, including mismatched channel cases.
Srijidtra Mahapakulchai, Robert E. Van Dyck
IEEE Trans. Commun.1
2001 Design of ring convolutional trellis codes for MAP decoding of MPEG-4 imagery
abstract
Previously, we proposed a trellis coded modulation system using CPFSK and ring convolutional codes for transmitting the bits generated by an embedded zerotree wavelet encoder. Improved performance is achieved by using maximum a posteriori (MAP) decoding of the zerotree symbols. In this paper, the optimal ring convolutional trellis codes are determined for MAP decoding. The CPFSK transmitter is decomposed into a memoryless modulator and a continuous phase encoder over the ring of integers modulo 4; the latter is combined with a polynomial convolutional encoder over the same ring. In the code design process, a search is made of the combined trellis, where the branch metrics are modified to include the source transition matrix. Simulation results of image transmission are provided using the optimized system.
Srijidtra Mahapakulchai, Robert E. Van Dyck
ICC1