A Highly Compatible Circular-Shifting Network for Partially Parallel QC-LDPC Decoder

HTML  XML Download Download as PDF (Size: 342KB)  PP. 24-34  
DOI: 10.4236/ijcns.2017.105B003    1,129 Downloads   2,165 Views  

ABSTRACT

The conventional methodology for designing QC-LDPC decoders is applied for fixed configurations used in wireless communication standards, and the supported largest expansion factor Z (the parallelism of the layered decoding) is a fixed number. In this paper, we study the circular-shifting network for decoding LDPC codes with arbitrary Z factor, especially for decoding large Z (Z P) codes, where P is the decoder parallelism. By buffering the P-length slices from the memory, and assembling the shifted slices in a fixed routine, the P-parallelism shift network can process Z-parallelism circular-shifting tasks. The implementation results show that the proposed network for arbitrary sized data shifting consumes only one times of additional resource cost compared to the traditional solution for only maximum P sized data shifting, and achieves significant saving on area and routing complexity.

Share and Cite:

Wang, Y. , Wu, Z. , Liu, P. , Guan, N. and Wang, H. (2017) A Highly Compatible Circular-Shifting Network for Partially Parallel QC-LDPC Decoder. International Journal of Communications, Network and System Sciences, 10, 24-34. doi: 10.4236/ijcns.2017.105B003.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.