The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Progressive edge-growth (PEG) algorithm was proven to be a simple and effective approach to design good LDPC codes. However, the low-density parity-check (LDPC) constructed by PEG algorithm is of a single code rate. In this paper, we propose a modified PEG algorithm to construct multiple-rate LDPC codes, which is referred to as the multiple-rate PEG (MR-PEG) algorithm. The obtained LDPC codes with...
For a given base graph, the lifted graph can be obtained by a copy-and-permute procedure. If the permutation is cyclic, the lifted graph corresponds to a quasi-cyclic (QC) protograph low-density parity-check (LDPC) code. The girth of the QC protograph LDPC code is determined by the girth of the base graph and the permutation shifts. In this paper, we first derive a lower bound on the lifting degree...
Product replacement gives a simple approach for code construction. This paper investigates the use of replacement product graphs for the recursive construction of QC cycle LDPC codes. It is proved that the QC cycle LDPC codes constructed by our approach are of girth 6. Simulation results show that QC cycle LDPC codes constructed by the replacement product perform well over the AWGN channel.
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.