activity
20102020
most citedA Low-Latency List Successive-Cancellation Decoding Implementation for Polar Codes

59 citations · 189 across the 12 of their papers we have counts for

collaborators

13 papers

eess.SP2020

An Improved Square-root Algorithm for V-BLAST Based on Efficient Inverse Cholesky Factorization

Hufei Zhu, Wen Chen, Bin Li +1

A fast algorithm for inverse Cholesky factorization is proposed, to compute a triangular square-root of the estimation error covariance matrix for Vertical Bell Laboratories Layere…

eess.SP2020

A Fast Recursive Algorithm for G-STBC

Hufei Zhu, Wen Chen, Bin Li +1

This paper proposes a fast recursive algorithm for Group-wise Space-Time Block Code (G-STBC), which takes full advantage of the Alamouti structure in the equivalent channel matrix…

cs.IT2018★ 59 cited

A Low-Latency List Successive-Cancellation Decoding Implementation for Polar Codes

YouZhe Fan, ChenYang Xia, Ji Chen +4

Due to their provably capacity-achieving performance, polar codes have attracted a lot of research interest recently. For a good error-correcting performance, list successive-cance…

eess.SP2018★ 15 cited

An Implementation of List Successive Cancellation Decoder with Large List Size for Polar Codes

ChenYang Xia, YouZhe Fan, Ji Chen +4

Polar codes are the first class of forward error correction (FEC) codes with a provably capacity-achieving capability. Using list successive cancellation decoding (LSCD) with a lar…

eess.SP2018★ 34 cited

A High-Throughput Architecture of List Successive Cancellation Polar Codes Decoder with Large List Size

ChenYang Xia, Ji Chen, YouZhe Fan +4

As the first kind of forward error correction (FEC) codes that achieve channel capacity, polar codes have attracted much research interest recently. Compared with other popular FEC…

cs.IT2015★ 4 cited

Capacity-Achieving Rateless Polar Codes

Bin Li, David Tse, Kai Chen +1

A rateless coding scheme transmits incrementally more and more coded bits over an unknown channel until all the information bits are decoded reliably by the receiver. We propose a…