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

Zixuan Huang 0002

dblp:218/2712-2 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2020
0000-0002-6718-2377ORCID · verified

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

Computer networks · 1

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 · 64% Information theory · 36%

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

TopicWeightPapersLastEvidence papers
Coding theory › channel coding
finite blocklength
0.412020
Finite Block-Length Analog Fountain Codes for Ultra-Reliable Low Latency Communications · IEEE Trans. Commun. 2020
Coding theory › error-correcting codes › rateless codes
fountain codes
0.412020
Finite Block-Length Analog Fountain Codes for Ultra-Reliable Low Latency Communications · IEEE Trans. Commun. 2020
Information theory
ultra-reliable low-latency communication
0.412020
Finite Block-Length Analog Fountain Codes for Ultra-Reliable Low Latency Communications · IEEE Trans. Commun. 2020
Information theory
achievable rate analysis
0.112020
Finite Block-Length Analog Fountain Codes for Ultra-Reliable Low Latency Communications · IEEE Trans. Commun. 2020
Coding theory › error-correcting codes › decoding › iterative decoding › iterative decoding analysis
EXIT chart analysis
0.112020
Finite Block-Length Analog Fountain Codes for Ultra-Reliable Low Latency Communications · IEEE Trans. Commun. 2020

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

weight selection · 0.4extrinsic information transfer analysis · 0.4
YearPublicationVenuePosition
2020 Finite Block-Length Analog Fountain Codes for Ultra-Reliable Low Latency Communications
abstract
In this paper, a theoretical framework for the design and evaluation of finite block-length analog fountain codes (AFC) towards ultra-reliable low latency communications (URLLC) is proposed. First, based on the achievable rate analysis and extrinsic information transfer (EXIT) analysis for AFC, we propose a weight adaptive (WA) AFC transmission scheme by introducing a limited feedback link, which can realize the lowest complexity AFC over a wide range SNRs. Further, by combining the conventional EXIT analysis and the dispersion perspective of mutual information, we propose a modified weight selection scheme for short block length WA-AFC (SWA-AFC) scheme. Simulation results show that our SWA-AFC scheme can achieve a superior performance than the existing AFC schemes, and approaching to the Polyansky-Poor-Verdu (PPV) bound.
Ke Zhang 0015, Jian Jiao 0001, Zixuan Huang 0002, Shaohua Wu 0002, Qinyu Zhang 0001
IEEE Trans. Commun.3
2018 Analysis and Design of Ultra-Reliable Short Blocklength Analog Fountain Codes
abstract
Machine-to-Machine (M2M) communications are expected to support extremely harsh requirements on both latency and reliability, which is characterized by the ultra-reliable, low-latency coding (uRLLC) technology in physical layer. In this paper, motivated by the recent development on the finite-blocklength information theory, we propose an ultra-reliable short blocklength analog fountain code (AFC) for M2M communications. First, we use the extrinsic information transfer (EXIT) chart to analyze the AFC compressive sensing belief propagation (CS-BP) decoding algorithm, by tracking the mutual information of AFC CS-BP decoding process, which related to the channel dispersion for the short blocklength AFC. Then, based on the EXIT chart analysis, we propose a Weight-set optimization progressive edge-growth (WO-PEG) encoding algorithm for the short blocklength AFC. Simulation results show that the proposed WO-PEG AFC scheme can effectively improve block error rate (BLER) in the short blocklength regime.
Ke Zhang 0015, Jian Jiao 0001, Zixuan Huang 0002, Bowen Feng, Shaohua Wu 0002, Bin Cao 0003, Qinyu Zhang 0001
VTC Fall3