HuiHui Wu

Dr. HuiHui Wu

orcid

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
19 March 2020 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
HWHuiHui Wu
HuiHui Wu
AAAlexei Ashikhmin
Alexei Ashikhmin
XWXiaodong Wang
Xiaodong Wang
CLChong Li
Chong Li
SYSichao Yang
Sichao Yang
LZLei Zhang
Lei Zhang
This paper presents a novel way to reduce blockchain nodes memory requirements using error correcting codes. In particular, LDPC codes are taken as examples to explicitly demonstrate the scheme. The proposed coding scheme encodes data across of multiple blocks, respectively block headers, in the blockchain. This leads to a significant reduction in required memory at each node. We then apply the proposed coding technique to blockchains organized in two different ways. Our first scheme has the same protocol for mining, broadcasting and verification of blocks, as Bitcoin-type blockchains. Our scheme is different in that full nodes do not have to store all blocks. Instead they will need to store only one block of a group of t blocks. In the second scheme, we consider a new block verification protocol and an account based model, under the assumption that a transmission between any two nodes can be established, as well as the broadcast transmission. Our block verification protocol uses Byzantine fault tolerance algorithm and requires sending a newly mined block to only a small number of verification nodes, instead of broadcasting it to the entire network, which leads to reduction of the network load.

9 November 2020 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
Qiwang ChenQiwang Chen
Qiwang Chen
FLFrancis C. M. Lau
Francis C. M. Lau
HWHuiHui Wu
HuiHui Wu
CCChen Chen
Chen Chen
In a joint source-channel coding (JSCC) system, excessive source compression can cause an error floor. In the original JSCC scheme based on double protograph LDPC (DPLDPC) codes, only connections exist between check nodes (CNs) of the source protograph and variable nodes (VNs) of the channel protograph, and error floors are observed. In this paper, we investigate the joint protograph that forms the basis of a DP-LDPC code. The joint protograph consists of a source protograph, a channel protograph, and connections between the two protographs. Our main focus is on the complete-sourcevariable-linking (CSVL) protomatrix of the joint protograph, which determines the error floor of the DP-LDPC code. We propose a generalized source protograph extrinsic information transfer (GSP-EXIT) algorithm for evaluating the source decoding thresholds of the CSVL protomatrix. Based on the proposed algorithm, we analyze CSVL protomatrices with regular or irregular source protographs. We present design criteria for connections between VNs of the source protograph and CNs of the channel protograph. Such design rules will result in a higher source decoding threshold, which implies a lower error floor. We also propose a differential evolution algorithm for optimizing the source protograph. We present/compare analytical results and/with simulation results, and conclude that they are consistent.

1 December 2021 in IEEE Wireless Communications Letters
Verified
Journal Article
Closed access
YZYitian Zhang
Yitian Zhang
HWHuiHui Wu
HuiHui Wu
MCMark Coates
Mark Coates
This paper presents an autoencoder-based channel coding scheme in the presence of inter-symbol interference (ISI) and additive white Gaussian noise (AWGN), supporting arbitrary coding rates. Both the transmitter and receiver of the proposed autoencoder employ bi-directional gated recurrent unit (Bi-GRU) layers. Additional extra dense layers are applied at the end of the transmitter and at the beginning of the receiver, serving as learnable puncture and depuncture modules, respectively. Different code rates can be achieved by adjusting the output dimension of the extra dense layers. Experimental results demonstrate that the proposed autoencoder significantly outperforms conventional convolutional codes over ISI channels, for multiple code rates. The proposed autoencoder also outperforms LDPC codes in the low signal-to-noise ratio (SNR) regime. The neural codes still require improvement to be competitive in the high SNR regime.

3 January 2018 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
HWHuiHui Wu
HuiHui Wu
SDSorina Dumitrescu
Sorina Dumitrescu
This paper proposes an algorithm for the design of entropy-constrained unrestricted polar quantizer (ECUPQ) for bivariate circularly symmetric sources. The algorithm is globally optimal for the class of ECUPQs with magnitude quantizer thresholds confined to a finite set. The optimization problem is formulated as the minimization of a weighted sum of distortion and entropy, and the proposed solution is based on modeling the problem as a minimum-weight path problem in a certain weighted directed acyclic graph. Each graph edge corresponds to a possible magnitude quantizer bin and computing its weight involves solving another optimization problem. We develop a fast strategy for evaluating all edge weights, leading to a O(K 2 + KP max ) time solution algorithm, where K is the size of the set of possible magnitude thresholds and Pmax is the maximum number of phase levels. The practical performance of the proposed algorithm is assessed for a bivariate circularly symmetric Gaussian source, at rates ranging from 0.5 to 6 bits/sample. Our results demonstrate that the proposed approach achieves performance very close to the asymptotically optimal ECUPQ at all rates, while at low rates it significantly outperforms all previous UPQ schemes. Notably, peak improvement of 0.755 dB can be achieved for rates below 2.5.

30 January 2023 in Entropy
Verified
Journal Article
Open access
PDF file
JRJinkai Ren
Jinkai Ren
DSDan Song
Dan Song
HWHuiHui Wu
HuiHui Wu
Lin WangLin Wang
Lin Wang
It is challenging to design an efficient lossy compression scheme for complicated sources based on block codes, especially to approach the theoretical distortion-rate limit. In this paper, a lossy compression scheme is proposed for Gaussian and Laplacian sources. In this scheme, a new route using “transformation-quantization” was designed to replace the conventional “quantization-compression”. The proposed scheme utilizes neural networks for transformation and lossy protograph low-density parity-check codes for quantization. To ensure the system’s feasibility, some problems existing in the neural networks were resolved, including parameter updating and the propagation optimization. Simulation results demonstrated good distortion-rate performance.

17 October 2022 in Electronics
Verified
Journal Article
Open access
PDF file
Runfeng WangRunfeng Wang
Runfeng Wang
SLSanya Liu
Sanya Liu
HWHuiHui Wu
HuiHui Wu
Lin WangLin Wang
Lin Wang
Considering the high compression requirements of transmission, lossy block codes are particularly concerned due to their good compression performance and simple implementation. This paper investigates and analyzes the distortion rate performance of protograph LDPC (P-LDPC) codes for Bernoulli sources over AWGN channels. We first analytically establish the connection between the parity check matrix of a P-LDPC code and the extra distortion caused by the noisy channels. It was found that the additional distortion related to channel noise increases with the rising total degree of a parity check matrix. Further, two design algorithms are proposed for optimizing lossy multirate P-LDPC codes, considering the effect of noisy channels. Finally, simulation results demonstrate the robustness of the optimized P-LDPC codes over noisy channels.