Abstract
Low density parity check (LDPC) codes are fundamentally linear error-correcting codes that have a parity check matrix with a small number of nonzero elements in each row and column. The number of nonzero elements is determined by the regularity of the matrix, which may be constrained or unconstrained. The structure of the matrix plays an important role in the encoding and decoding performance of the LDPC codes. The size and structure of the LDPC matrix have significant impact on the hardware implementation complexity of LDPC encoders and decoders. The size of the matrix depends on the code length and code rate specified by the application standards, for example, WLAN, LTE, DVB-S2, etc. The structure and sparseness of the matrix depends on the BER requirements of the target application and also on the matrix construction algorithm. The flexibility of the parity check matrix is very important in accommodating the requirements of various applications. This chapter presents some of the common and most popular techniques used in the construction of LDPC matrices.
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.
