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

Zizheng Cao

dblp:142/3776 · DBLP profile ↗
← Back
7ranked-venue papers
1as first author
1since 2021 · last 2021
0000-0002-4774-7545ORCID · verified

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

Computer networks · 5 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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
2 papers
Coding theory · 100%
Computer networks
2 papers
Physical-layer communications · 67% Optical networks · 33%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Integrated circuit design · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory › channel coding
polar codes
0.512021
Threshold-Based Fast Successive-Cancellation Decoding of Polar Codes · IEEE Trans. Commun. 2021
Coding theory › channel coding › polar codes
successive cancellation decoding
0.512021
Threshold-Based Fast Successive-Cancellation Decoding of Polar Codes · IEEE Trans. Commun. 2021
Coding theory › error-correcting codes
forward error correction
0.412019
Improved Decoding of Staircase Codes: The Soft-Aided Bit-Marking (SABM) Algorithm · IEEE Trans. Commun. 2019
Coding theory › error-correcting codes › decoding
iterative decoding
0.412019
Improved Decoding of Staircase Codes: The Soft-Aided Bit-Marking (SABM) Algorithm · IEEE Trans. Commun. 2019
Coding theory › error-correcting codes › block codes
product codes
0.412019
Improved Decoding of Staircase Codes: The Soft-Aided Bit-Marking (SABM) Algorithm · IEEE Trans. Commun. 2019
Coding theory › error-correcting codes › block codes › product codes
staircase codes
0.412019
Improved Decoding of Staircase Codes: The Soft-Aided Bit-Marking (SABM) Algorithm · IEEE Trans. Commun. 2019
Physical-layer communications › optical wireless communication
indoor optical wireless
0.312018
Photonic integration technologies for indoor optical wireless communications · Sci. China Inf. Sci. 2018
Physical-layer communications
optical wireless communication
0.312018
Photonic integration technologies for indoor optical wireless communications · Sci. China Inf. Sci. 2018
Optical networks › optical access network
optical wireless access network
0.212013
Energy Efficient and Transparent Platform for Optical Wireless Networks Based on Reverse Modulation · IEEE J. Sel. Areas Commun. 2013
Optical networks › optical fiber communication
radio-over-fiber
0.212013
Energy Efficient and Transparent Platform for Optical Wireless Networks Based on Reverse Modulation · IEEE J. Sel. Areas Commun. 2013
Integrated circuit design › digital circuit design › combinational logic
decoder architecture
0.112021
Threshold-Based Fast Successive-Cancellation Decoding of Polar Codes · IEEE Trans. Commun. 2021

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

threshold-based hard-decision-aided decoding · 1.0parallel decoding · 1.0soft information · 0.4bounded-distance decoding · 0.4bit marking · 0.4numerical simulation · 0.2mach-zehnder modulator · 0.2
YearPublicationVenuePosition
2021 Threshold-Based Fast Successive-Cancellation Decoding of Polar Codes
abstract
Fast SC decoding overcomes the latency caused by the serial nature of the SC decoding by identifying new nodes in the upper levels of the SC decoding tree and implementing their fast parallel decoders. In this work, we first present a novel sequence repetition node corresponding to a particular class of bit sequences. Most existing special node types are special cases of the proposed sequence repetition node. Then, a fast parallel decoder is proposed for this class of node. To further speed up the decoding process of general nodes outside this class, a threshold-based hard-decision-aided scheme is introduced. The threshold value that guarantees a given error-correction performance in the proposed scheme is derived theoretically. Analysis and hardware implementation results on a polar code of length 1024 with code rates 1/4, 1/2, and 3/4 show that our proposed algorithm reduces the required clock cycles by up to 8%, and leads to a 10% improvement in the maximum operating frequency compared to state-of-the-art decoders without tangibly altering the error-correction performance. In addition, using the proposed threshold-based hard-decision-aided scheme, the decoding latency can be further reduced by 57% at Eb/N0= 5.0 dB.
Seyyed Ali Hashemi, Alexios Balatsoukas-Stimming, Zizheng Cao, Antonius M. J. Koonen, John M. Cioffi, Andrea J. Goldsmith
IEEE Trans. Commun.4
2020 Threshold-Based Successive-Cancellation Decoding of Polar Codes
abstract
This paper focuses on fast successive-cancellation (SC) decoding of polar codes. A threshold-based hard-decision-aided scheme is proposed to speed up the decoding process, especially when the communications channel has low noise. In addition, to eliminate the error-correction performance degradation caused by hard decisions, a backtracking strategy is introduced. Simulation results on a polar code of code length 1024 and rate 1/2 show that, with the help of the proposed scheme, the average decoding latency of existing fast SC decoding algorithms can be reduced by 53% at an Eb/N0 = 5.0 dB with negligible error-correction performance degradation.
Seyyed Ali Hashemi, Zizheng Cao, Antonius M. J. Koonen, John M. Cioffi, Andrea J. Goldsmith
ICC3
2019 Complexity-adjustable SC decoding of polar codes for energy consumption reduction
abstract
This study proposes an enhanced list‐aided successive cancellation stack (ELSCS) decoding algorithm with adjustable decoding complexity. Also, a logarithmic likelihood ratio‐threshold based path extension scheme is designed to further reduce the memory consumption of stack decoding. Numerical simulation results show that without affecting the error correction performance, the proposed ELSCS decoding algorithm provides a flexible trade‐off between time complexity and computational complexity, while reducing storage space up to 70%. Based on the fact that most mobile devices operate in environments with stringent energy budget to support diverse applications, the proposed scheme is a promising candidate for meeting requirements of different applications while maintaining a low computational complexity and computing resource utilisation.
Bin Chen 0006, Luis F. Abanto-Leon, Zizheng Cao, Antonius M. J. Koonen
IET Commun.4
2019 Improved Decoding of Staircase Codes: The Soft-Aided Bit-Marking (SABM) Algorithm
abstract
Staircase codes (SCCs) are typically decoded using iterative bounded-distance decoding (BDD) and hard decisions. In this paper, a novel decoding algorithm is proposed, which partially uses soft information from the channel. The proposed algorithm is based on marking certain number of highly reliable and highly unreliable bits. These marked bits are used to improve the miscorrection-detection capability of the SCC decoder and the error-correcting capability of BDD. For SCCs with 2-error-correcting Bose-Chaudhuri-Hocquenghem component codes, our algorithm improves upon standard SCC decoding by up to 0.30 dB at a bit-error rate (BER) of 10-7. The proposed algorithm is shown to achieve almost half of the gain achievable by a genie decoder with this structure. The increased complexity caused by bit marking and additional calls to the component BDD decoder is discussed as well. Our algorithm is also extended (with minor modifications) to product codes. The simulation results show that in this case, the algorithm offers gains of up to 0.5 dB at a BER of 10-7.
Bin Chen 0006, Gabriele Liga, Xiong Deng, Zizheng Cao, Jianqiang Li 0003, Kun Xu 0008, Alex Alvarado
IEEE Trans. Commun.5
2018 Photonic integration technologies for indoor optical wireless communications
Yuqing Jiao, Zizheng Cao
Sci. China Inf. Sci.2
2015 60 GHz MAC standardization: Progress and way forward
abstract
Communication at mmWave frequencies has been the focus in the recent years. In this paper, we discuss standardization efforts in 60 GHz short range communication and the progress therein. We compare the available standards in terms of network architecture, medium access control mechanisms, physical layer techniques and several other features. Comparative analysis indicates that IEEE 802.11ad is likely to lead the short-range indoor communication at 60 GHz. We bring to the fore resolved and unresolved issues pertaining to robust WLAN connectivity at 60 GHz. Further, we discuss the role of mmWave bands in 5G communication scenarios and highlight the further efforts required in terms of research and standardization.
Kishor Chandra Joshi, Arjan Doff, Zizheng Cao, R. Venkatesha Prasad, Ignas G. Niemegeers
CCNC3
2013 Energy Efficient and Transparent Platform for Optical Wireless Networks Based on Reverse Modulation
abstract
An energy efficient and transparent platform for optical wireless networks is proposed based on a novel reversely modulated optical single sideband scheme (RM-OSSB). This scheme is based on a parallel Mach-Zehnder modulator (P-MZM). The bandwidth limitation from electrical and optical components is overcome by down-conversion without electrical mixer, data format compatibility, and dispersion-free. It makes such scheme suitable for a universal platform. Moreover, the modulation power efficiency (MPE) of RM-OSSB can be improved. A theoretical model of RM-OSSB is built up for performance analysis. Both numerical simulations and experimental results match well with our theoretical model. Based on RM-OSSB scheme, a 58GHz full duplex RoF system is experimentally demonstrated. The 2.9Gb/s on-off keying (OOK) signals carried by 58GHz mm-wave is successfully delivered over 50km SMF with negligible power penalty.
Zizheng Cao, Jianjun Yu, Qinglong Shu, Lin Chen 0008
IEEE J. Sel. Areas Commun.1