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 a new family of irregular repeat accumulate (IRA) low-density parity-check (LDPC) codes with the characteristic of random-like structure, a common feature of the practical LDPC codes adopted in most communication industrial standards. The systematic IRA-LDPC codes are defined by the parity-check matrix H = [Hd HP], in which Hd and HP correspond to the information bits and the parity...
A random-like framework of the IRA-LDPC codes based on the identity column vectors (ICV) was defined and created. A new family of the IRA-LDPC codes under the constraint of the framework was investigated using algebraic and random methods. Its structural features is that the large-sized sparse parity check matrix Hd corresponding to the information bits is extruded into two smaller-sized easy-to-compute...
As compared to uncoded unitary space-time modulation (USTM), channel coded USTM has received increased attention for its large coding gain. However, low-density parity-check (LDPC) coded USTM has only received limited attention. This paper proposes a scheme of combining LDPC code with USTM for noncoherent MIMO communication system over Rayleigh flat fading and additive white Gaussian noise (AWGN)...
This paper is concerned with threshold performance analysis of implement-oriented low-density parity check (LDPC) ensemble on binary erasure channel and design of its H-matrix structure and encoder hardware architecture. We construct a class of the special LDPC ensemble which has capacity-achieving degree distribution pair for infinity length code over the binary erasure channel (BEC). Its special...
In this paper we present three optimization techniques of improving the performance of some irregular low-density parity-check ensemble with determinate structure and finite block length. Firstly, its permutation matrix optimization. We present a new random permutation matrix called as the Q-matrix. We substituted Q-matrix for identity matrix in base matrix array which can be expanded into H-matrix...
Low density parity check codes are a popular class of linear block codes for forward error correction in communication channels. Recent years have seen a lot of work towards the hardware-oriented constructions for LDPC codes which have comparable error-correcting performance to random construction codes. This paper proposes a novel method called Iterative-filled (IF) to construct LDPC codes and a...
This paper have developed farther the method of constructing sparse parity-check matrix (H-matrix) with determinate systemic structure as well as designing practice recursive encoding algorithm of the low-density parity-check (LDPC) codes. It discovers that the LDPC codes based on the circulant-shifted permutation Q-matrix created by N-queens searching algorithm perform better than them based on permutation...
We propose a general method for constructing regular and irregular quasi-cyclic LDPC codes based on the modified PEG (progressive edge growth) graph. The idea of permutation vector is introduced. Through permutation vectors, the QC-LDPC codes based on arbitrary circulant permutation matrices, which are not limited to identity matrix, Q-matrix or D-matrix, can be generated with flexible parameters...
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.