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, the authors propose new decoding scheme of punctured LDPC codes with dual-diagonal parity structure by merging check nodes connected to the punctured parity nodes. This check-node merging decoding not only needs smaller number of operations at each iteration but also shows faster decoding convergence speed than the conventional erasure decoding. For the binary erasure channel (BEC)...
In this paper, we study and propose a puncturing algorithm of block-type low-density parity-check (B-LDPC) codes. This optimal puncturing algorithm is derived from the fact that puncturing of parity bits is equivalent to merging the check nodes. Furthermore, we propose a new decoding algorithm suitable for the punctured B-LDPC codes. This decoding algorithm needs not only smaller number of operations...
In this paper, we construct rate-compatible block-type low-density parity-check (B-LDPC) codes using splitting that cover a wide range of code rates from 1/3 to 4/5. They outperform other rate-compatible B-LDPC codes for all rates and can be decoded conveniently and efficiently. A strong motivation for proposing splitting scheme comes from the observation that the quality of the initial transmission...
In this paper we investigate the puncturing scheme of low-density parity-check code with zigzag parity structure (Z-LDPC code) using the fact that two check nodes can be merged if they are connected to the same parity node. By applying this result to Tanner graph of punctured Z-LDPC code, we can obtain simple Tanner graph, called effective Tanner graph (eTanner graph), which does not include the punctured...
Capacity-approaching codes using iterative decoding have been the main research subject of coding area during past decade. In this paper, a new channel coding scheme called irregular concatenated zigzag (ICZZ) code is proposed. ICZZ codes can be viewed as a special case of irregular low-density parity-check (LDPC) codes with linear-time encodable structure. They are different from concatenated zigzag...
In this paper, new rate-compatible punctured concatenated zigzag (RCPCZ) codes are proposed and analyzed by using the density evolution technique. This analysis gives the design criteria for the rate-compatible puncturing patterns and accordingly good puncturing patterns for constructing RCPCZ codes are obtained. Since RCPCZ codes are linear-time encodable and show capacity-approaching performance,...
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.