Zhongfeng Wang

Zhongfeng Wang

Auto-generated profile, based on publicly available information

Zhongfeng Wang

School of EECS, Oregon State University, Corvallis, OR 97331-5501, USA

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

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

Representative Publications

View All Publications
1 June 2015 in China Communications
Verified
Journal Article
Closed access
JSJin Sha
Jin Sha
XLXing Liu
Xing Liu
ZWZhongfeng Wang
Zhongfeng Wang
XZXiaoyang Zeng
Xiaoyang Zeng
Polar codes have become increasingly popular recently because of their capacity achieving property. In this paper, a memory efficient stage-combined belief propagation (BP) decoder design for polar codes is presented. Firstly, we briefly reviewed the conventional BP decoding algorithm. Then a stage-combined BP decoding algorithm which combines two adjacent stages into one stage and the corresponding belief message updating rules are introduced. Based on this stage-combined decoding algorithm, a memory-efficient polar BP decoder is designed. The demonstrated decoder design achieves 50% memory and decoding latency reduction in the cost of some combinational logic complexity overhead. The proposed decoder is synthesized under TSMC 45nm Low Power CMOS technology. It achieves 0.96 Gb/s throughput with 14.2mm2 area when code length N=216 which reduces 51.5% decoder area compared with the conventional decoder design.

25 November 2008 in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Verified
Journal Article
Closed access
JSJin Sha
Jin Sha
ZWZhongfeng Wang
Zhongfeng Wang
MGMinglun Gao
Minglun Gao
LLLi Li
Li Li
Low-density parity-check (LDPC) code, a very promising near-optimal error correction code (ECC), is being widely considered in next generation industry standards. The VLSI implementation of high-speed LDPC decoder remains a big challenge. This paper presents the construction of a new class of implementation-oriented LDPC codes, namely shift-LDPC codes. With girth optimization, this kind of codes can perform as well as computer generated random codes. More importantly, the decoder can be efficiently implemented to obtain very high decoding speeds. In addition, more than 50% of message memory can be generally saved over conventional partially parallel decoder architectures. We demonstrate the benefits of the proposed techniques with an application-specific integrated circuit (ASIC) design (in 0.18-mum CMOS) for a 8192-bit regular LDPC code, which can achieve 5 Gb/s throughput at 15 iterations.

16 March 2009 in IEEE Transactions on Circuits and Systems II: Express Briefs
Verified
Journal Article
Closed access
JLJun Lin
Jun Lin
ZWZhongfeng Wang
Zhongfeng Wang
LLLi Li
Li Li
JSJin Sha
Jin Sha
MGMinglun Gao
Minglun Gao
In this brief, a new algorithm that can efficiently generate all the control signals for the shuffle network used in flexible low-density parity-check (LDPC) decoders is proposed. Employing the proposed algorithm, the hardware complexity of the controller of shuffle networks using the Benes network structure can be significantly reduced. In addition, a low-complexity reconfigurable shuffle network architecture for flexible LDPC decoders is developed. Both the Benes network and the controller can be tailored to fit specific applications. Consequently, an efficient shuffle network for WiMAX LDPC decoders is presented. Synthesis results demonstrate that with the SMIC 0.18-mum complementary metal-oxide-semiconductor process, the total gate count of the proposed shuffle network is only 16 000. The area saving is between 26.6% and 71.1% compared to related works in the literature.

1 June 2006
Verified
Conference Paper
Closed access
JSJin Sha
Jin Sha
MGMinglun Gao
Minglun Gao
ZZZhongjin Zhang
Zhongjin Zhang
LLLi Li
Li Li
ZWZhongfeng Wang
Zhongfeng Wang
Channel coding is an important building block in communication systems. Low-density parity-check codes is one kind of prominent error correcting codes being considered in next generation industry standards. This paper presents a memory efficient, very high speed decoder architecture suited for quasi-cyclic low-density parity-check codes using modified Min-Sum decoding algorithm. In general, about seventy percent of message memory can be saved over conventional decoder architectures, and the decoding speed can be largely accelerated because of the highly efficient VLSI architecture. Consequently, the proposed approach facilitates the applications of LDPC codes in area/latency sensitive communication systems.

7 August 2009 in IEEE Transactions on Consumer Electronics
Verified
Journal Article
Closed access
JSJin Sha
Jin Sha
JLJun Lin
Jun Lin
ZWZhongfeng Wang
Zhongfeng Wang
LLLi Li
Li Li
MGMinglun Gao
Minglun Gao
This paper presents two efficient decoder designs for the low-density parity-check codes in IEEE 802.15.3 standard proposal. These decoders feature by efficient hardware usage, low message memory requirement and code rate flexibility. The highly parallel level design can reach a throughput of 3.6 Gbps, which fulfills the standard requirement by processing 72 columns and 72 rows in parallel. The low cost design offers another tradeoff which significantly reduces the area and power consumption while maintaining necessary data throughput required by specific applications. Furthermore, both decoders support three different code rates by employing flexible check node processing units.

1 December 2006
Verified
Conference Paper
Closed access
JSJin Sha
Jin Sha
MGMinglun Gao
Minglun Gao
ZZZhongjin Zhang
Zhongjin Zhang
LLLi Li
Li Li
ZWZhongfeng Wang
Zhongfeng Wang
Low-density parity-check (LDPC) code is one kind of prominent error correcting codes (ECC) being considered in next generation industry standards. This paper presents an FPGA implementation of array code based low-density parity-check code decoder. The advantages of the proposed architecture as compared to the fully parallel or partially parallel architecture are: less memory requirement, avoidance of complex global interconnects and its satisfying throughput. These advantages are derived from exploiting the well-defined structure of the parity check matrix of array code based LDPC codes