← Search

Chuan Zhang

12 accepted papers

2026

FedARC: Anchor-Guided Residual Compensation for Data and Model Heterogeneous Federated Learning

ICML 2026spotlight

Federated learning (FL) allows clients to collaboratively train models without exposing private data, but practical FL is simultaneously challenged by data heterogeneity and model heterogeneity. Prior heterogeneous FL (HtFL) approaches often fail to handle fine-grained feature shifts, leading to wea…

Cited by 0SourceScholar
2025

MDDM: Practical Message-Driven Generative Image Steganography Based on Diffusion Models

ICML 2025poster

Generative image steganography (GIS) is an emerging technique that conceals secret messages in the generation of images. Compared to GAN-based or flow-based GIS schemes, diffusion model-based solutions can provide high-quality and more diverse images, thus receiving considerable attention recently.…

Cited by 0SourcePDFScholar
2023

Improved Belief Propagation Decoding of Turbo Codes

ICASSP 2023accepted

Turbo codes have been successfully adopted in 4G LTE, which can approach the channel capacity with Bahl-Cocke-Jelinek-Raviv (BCJR) decoding. With the evolution from 4G LTE to 5G NR, there is a demand to design a unified channel decoder that supports both LTE Turbo codes and NR low-density parity-che…

Cited by 0SourceScholar
2020

Bipartite Belief Propagation Polar Decoding With Bit-Flipping

ICASSP 2020accepted

For the scenarios with high throughput requirements, the belief propagation (BP) decoding is one of the most promising decoding strategies for polar codes. By pruning the redundant variable nodes (VNs) and check nodes (CNs) in the original factor graph, the graph is condensed to a sparse bipartite g…

Cited by 0SourceScholar
2019

Efficient Belief Propagation Detection Based on Channel Hardening for Massive MIMO

ICASSP 2019accepted

For massive multiple-input multiple-output (MIMO) detection, belief propagation (BP) based on graphical models has become a popular detection algorithm since it provides a good tradeoff between performance and complexity. To further lower the complexity of BP detection, an efficient BP detection bas…

Cited by 0SourceScholar
2018

Approximate Belief Propagation Decoder for Polar Codes

ICASSP 2018accepted

Polar code is increasing its popularity recently for its capacity-achieving property for B-DMCs. However, when designing decoders for polar code, it has always been an inevitable concern for us to balance the decoding performance and the hardware consumption. In this paper, we propose an approximate…

Cited by 0SourceScholar
2018

Efficient Circulant Matrix Construction and Implementation for Compressed Sensing

ICASSP 2018accepted

The design of measurement matrices is an important part in compressed sensing (CS). Random matrices superior to incoherence are considered to be optimal measurement matrices to achieve successful recovery. However, they are deficient in memory cost. Structure matrices like circulant matrices are pre…

Cited by 0SourceScholar
2018

Efficient Deep Convolutional Neural Networks Accelerator without Multiplication and Retraining

ICASSP 2018accepted

Recently, low-precision weight method has been considered as a promising scheme to efficiently implement inference of deep convolutional neural networks (DCNN). But it suffers from expensive retraining cost and accuracy degradation. In this paper, a low-bit and retraining-free quantization method, w…

Cited by 0SourceScholar
2018

Joint List Polar Decoder with Successive Cancellation and Sphere Decoding

ICASSP 2018accepted

For polar codes, both successive cancellation list (SCL) decoding and list sphere decoding (LSD) aim to balance performance and complexity. The same list structure but different decoding schedules of SCL and LSD can lead to a combination of both schemes. In this paper, an efficient joint list decode…

Cited by 0SourceScholar
2016

Design space exploration for hardware-efficient stochastic computing: A case study on discrete cosine transformation

ICASSP 2016accepted

In recent years stochastic computing (SC) is re-gaining increasing attention for its unique advantages on low hardware cost and strong error resilience that are the key metrics for nanoscale CMOS era. However, the potential deployment of SC in practical applications is impeded by the long latency of…

Cited by 0SourceScholar