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

Qingshuang Zhang

dblp:174/6387 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2016
—ORCID · unresolved

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

Computer networks · 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
channel coding
0.212016
Practical Design and Decoding of Parallel Concatenated Structure for Systematic Polar Codes · IEEE Trans. Commun. 2016
Coding theory › error-correcting codes
concatenated codes
0.212016
Practical Design and Decoding of Parallel Concatenated Structure for Systematic Polar Codes · IEEE Trans. Commun. 2016
Coding theory › error-correcting codes › decoding
iterative decoding
0.212016
Practical Design and Decoding of Parallel Concatenated Structure for Systematic Polar Codes · IEEE Trans. Commun. 2016
Coding theory › error-correcting codes › concatenated codes
parallel concatenation
0.212016
Practical Design and Decoding of Parallel Concatenated Structure for Systematic Polar Codes · IEEE Trans. Commun. 2016
Coding theory › channel coding
polar codes
0.212016
Practical Design and Decoding of Parallel Concatenated Structure for Systematic Polar Codes · IEEE Trans. Commun. 2016

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

simulation · 0.2minimum distance estimation · 0.2interleaver optimization · 0.2
YearPublicationVenuePosition
2016 Practical Design and Decoding of Parallel Concatenated Structure for Systematic Polar Codes
abstract
In this paper, a parallel concatenated structure is proposed to improve the performance of polar codes in finite length in which multiblocks systematic polar codes (SPC) and recursive systematic convolutional codes (RSC) are combined. We first design a weighted iterative decoding algorithm for the proposed structure such that better bit error rate performance can be obtained. Then, a deliberated interleaver is optimized for the new scheme. Thereafter, we introduce a strategy to estimate the minimum distance of the concatenation codeword, where an asymptotic performance and convergence behavior analysis are elaborated. Finally, the error performance of the proposed scheme is evaluated via simulations. The results show that our scheme almost outperforms all the existed concatenation ones using polar codes, making the codes more practical.
Qingshuang Zhang, Aijun Liu 0001, Yingxian Zhang, Xiaohu Liang
IEEE Trans. Commun.1