Abstract
Hardware complexity of LDPC decoders, which is caused by storage and processing of massive information, is the major reason that encumbers LDPC codes from widely application. Reducing the quantization word length of decoding information can effectively decrease the hardware complexity. But for the absolute value of information keeps increasing during decoding, short word length with finite quantization ranges will lead to serious saturation errors and damage decoding performance. Two quantization schemes is proposed in this paper to reduce the number of memory bits required by decoder design by using short word length while guarantee bit-error-rate (BER) performance. Results shows that these two quantization schemes can simplify the hardware complexity with very little loss of decoding performance.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
