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.
This paper presents methods to the construction of regular and irregular low-density parity-check (LDPC) codes based on Euclidean geometries over the Galois field. Codes constructed by these methods have quasi-cyclic (QC) structure and large girth. By decomposing hyperplanes in Euclidean geometry, the proposed irregular LDPC codes have flexible column/row weights. Therefore, the degree distributions...
In this paper, we propose a method to construct the protograph LDPC codes based on Jacket matrices. In the proposed code construction, the Jacket matrices are regarded as derived protograph matrices, the column weights of permutation matrices in parity check matrix depend on the elements' values of Jacket matrices. While the shift rule of the permutation matrices needs to ensure no girth 4. The proposed...
The complex valued orthogonal variable spreading codes are presented for multiplexing of forward link in direct sequence code division multiple access (DS-CDMA) system for variable rates multimedia communications. The bit error rate (BER) performance under a multi-user environment suffering the additive white Gaussian noise (AWGN) channel and correlations of those codes are evaluated. The results...
In this paper we construct a novel family of (3,rho)-regular quasi-cyclic (QC) low-density parity-check (LDPC) codes, derived from permutation theorem for Latin squares, when used over binary input additive white Gaussian noise (BIAWGN) channel. The codes have high code rate, girth absence of 4, good minimum distance, and sparse parity check matrices. They are designed to perform well when iteratively...
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.