Abstract
The Euclidean projection involved in the decoding of low-density parity-check (LDPC) codes with the alternating direction method of multipliers (ADMM) can be simplified by jointly using uniform quantization and look-up tables (LUTs). However, the memory requirement for the original LUT-based ADMM decoding is comparatively large. In this letter, a nonuniform quantization method is proposed to save the memory cost by minimizing the mean square error of the outputs of Euclidean projections during quantization. Simulation results over two exemplified LDPC codes show that the proposed method can achieve similar error-rate performances when compared with the original LUT-based ADMM decoding by using significantly less memory units.
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.
