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

Song-Jheng Lin

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

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

Computer networks · 1Theory of computation · 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%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
graph-based codes
0.212016
Residual-Quantization Based Code Design for Compressing Noisy Sources With Arbitrary Decoder Side Information · IEEE Trans. Commun. 2016
Coding theory › error-correcting codes
LDPC codes
0.212016
Residual-Quantization Based Code Design for Compressing Noisy Sources With Arbitrary Decoder Side Information · IEEE Trans. Commun. 2016
Coding theory › source coding › side information
remote source coding
0.212016
Residual-Quantization Based Code Design for Compressing Noisy Sources With Arbitrary Decoder Side Information · IEEE Trans. Commun. 2016
Coding theory
source coding
0.212016
Residual-Quantization Based Code Design for Compressing Noisy Sources With Arbitrary Decoder Side Information · IEEE Trans. Commun. 2016
Coding theory › source coding › side information
wyner-ziv coding
0.212016
Residual-Quantization Based Code Design for Compressing Noisy Sources With Arbitrary Decoder Side Information · IEEE Trans. Commun. 2016

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

residual quantization · 0.2reinforced quantization · 0.2belief propagation · 0.2
YearPublicationVenuePosition
2016 Residual-Quantization Based Code Design for Compressing Noisy Sources With Arbitrary Decoder Side Information
abstract
This paper considers noisy Wyner-Ziv coding (WZC), in which a remote noisy source is compressed with side information at the decoder only. The decoder side information is not limited to being Gaussian, thus this noisy WZC problem cannot be transformed into the conventional one tailored for noiseless sources. A new coding structure, named the residual-quantization (RQ) based noisy WZC, is proposed to solve the problem. This scheme explicitly constructs the theoretical auxiliary random variable to facilitate optimal reconstruction of the noisy source. In this two-stage encoder, the noisy source is quantized twice and the quantization error (residue) of the first stage is the input of the second stage. By sending only the quantization index of the second stage to the decoder, the corresponding code rate can theoretically approach the noisy WZC bound. Moreover, the RQ-based noisy WZC is implemented using graph-based codes. The main challenge is that it is necessary to design a codebook that is simultaneously good for source and channel coding for the first stage quantization, since this quantization code also acts as a channel code at the decoder. This problem is solved by constructing a low-density parity check (LDPC) code with edge degrees optimized for channel coding, and enhancing its performance for source coding by using a modified reinforced belief-propagation quantization algorithm. Simulation results show that the noisy Wyner-Ziv bounds can be practically approached by our implementation. In addition, the proposed implementation offers more flexibility in the code rates compared with the existing practical designs, making it more suitable for emerging applications such as fronthaul compression.
Yi-Peng Wei, Shih-Chun Lin 0001, Song-Jheng Lin, Hsuan-Jung Su, H. Vincent Poor
IEEE Trans. Commun.3
2009 Coding for noisy quadratic-Gaussian Wyner-Ziv problem : A successive quantization approach
abstract
Wyner-Ziv coding (WZC) is a compression technique which uses decoder side-information to help reconstruction. We present a new coding structure using two-stage successive quantization with two codebooks to solve the Wyner-Ziv problem in the quadratic Gaussian case. The optimal Wyner-Ziv bound is proved to be achievable by random coding analysis. Compared to the existing nested-lattice based design approaches, the two component codes in our construction can be designed independently, which simplifies the code design significantly. Moreover, besides the original noiseless setting where the source is directly observed by the encoder, our coding also suits for the noisy WZC problem where the source is observed via a noisy memoryless channel.
Song-Jheng Lin, Shih-Chun Lin 0001, Kai-Sheng Chen, Hsuan-Jung Su
ITW1