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.
In this paper, we proposed a construction of irregular QC-LDPC codes with improved approximated cycle extrinsic message degree (ACE) properties. The codes construct using the algorithm proposed have simple structure with good performance. Simulation results show that the proposed algorithm outperforms original PEG algorithm in the error-floor region.
Low-density parity-check (LDPC) codes can achieve better performance and lower decoding complexity than turbo codes and other error control codes. But it is difficult for LDPC codes to be commercial because of their high encoding complexity and consequent encoding delay. Using an efficient encoding method proposed by Richardson and Urbanke, we can efficiently reduce the LDPC encoding complexity apparently...
This paper introduced a construction for LDPC codes over GF(q) based on filling with circulant matrices. After expanded the cycles in the check matrix by filling circulant matrices, the error-correcting performance of the codes can be improved with a low constructing complexity. The simulation results shows that the codes constructed can achieve better error-correcting performance.
In this paper, we present a modified BP decoding algorithm based on select updating schedule by analyzing the properties of message-passing through cycles, we also proposed a concrete scheme to obtain the select updating schedule, the simulations prove that we could improve performance and reduce complexity at the same time for short regular LDPC codes which have a small difference between the maximal...
In this paper, we present the upper and lower bounds of the girth of MF-LDPC codes which are determined by the shift times of cyclic shift matrices by analysis the properties of cyclic shift matrices in cycle, we also propose a concrete conditional-filling construction, the simulations prove that sufficient utilization of the properties can reduce the amount of least cycle of the MF-matrix remarkably...
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.