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

Meesue Shin

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

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

Computer networks · 2 · 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
1 paper
Physical-layer communications · 100%
Theoretical computer science
1 paper
Coding theory · 100%
Computer graphics and multimedia
1 paper
Multimedia systems and quality of experience · 100%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications
MIMO
0.412020
Joint Source, Channel, and Space-Time Coding of Progressive Bitstream in MIMO Channels · IEEE Trans. Commun. 2020
Physical-layer communications › MIMO
space-time coding
0.412020
Joint Source, Channel, and Space-Time Coding of Progressive Bitstream in MIMO Channels · IEEE Trans. Commun. 2020
Coding theory
joint source-channel coding
0.412020
Joint Source, Channel, and Space-Time Coding of Progressive Bitstream in MIMO Channels · IEEE Trans. Commun. 2020
Multimedia systems and quality of experience › image transmission
progressive image transmission
0.112020
Joint Source, Channel, and Space-Time Coding of Progressive Bitstream in MIMO Channels · IEEE Trans. Commun. 2020

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

parametric optimization · 1.3
YearPublicationVenuePosition
2020 Joint Source, Channel, and Space-Time Coding of Progressive Bitstream in MIMO Channels
abstract
The optimization of joint source and channel coding for a sequence of numerous progressive packets has been a challenging problem. Further, the problem becomes more complicated if the space-time coding is also involved with the optimization in a multiple-input multiple-output (MIMO) system. This is because the number of ways of jointly assigning channel codes and space-time codes to progressive packets is much larger than that of solely assigning channel codes to the packets. To our knowledge, there is no complete and feasible solution for the optimization of joint source, channel, and space-time coding of progressive packets. This paper applies a parametric approach to address such a highly nonlinear optimization problem in MIMO systems. We use the parametric methodology and derive some relevant properties, which are exploited to propose an efficient optimization method where the joint assignment of channel codes and space-time codes to the packets can be optimized in a packet-by-packet manner. As a result, the computational complexity of the proposed method linearly increases in the number of packets, whereas that of the exhaustive search exponentially increases in the number of packets. The numerical results show that the proposed method significantly improves the peak-signal-to-noise ratio performance of the conventional rate-based optimal solution in a MIMO system.
Seok-Ho Chang, Meesue Shin, Sang-Hyo Kim
IEEE Trans. Commun.2
2017 Optimization of Joint Progressive Source and Channel Coding for MIMO Systems
abstract
The optimization of joint source and channel coding for a sequence of numerous progressive packets is a challenging problem. Further, the problem becomes more complicated if the space- time coding is also involved with the optimization in a multiple-input multiple-output (MIMO) system. This is because the number of ways of jointly assigning channel codes and space-time codes to progressive packets is much larger than that of solely assigning channel codes to the packets. This paper applies a parametric approach to address that complex joint optimization problem in a MIMO system. Employing the parametric distortion-rate function, the joint assignment of channel codes and space-time codes to the packets can be optimized in a packet-by- packet manner. As a result, the computational complexity of the optimization is exponentially reduced, compared to the exhaustive search. The numerical results show that the proposed method significantly improves the peak-signal-to-noise ratio performance of the rate-based optimal solution in a MIMO system.
Meesue Shin, Sang-Hyo Kim, Laura Toni, Seok-Ho Chang
GLOBECOM1