排序方式: 共有13条查询结果,搜索用时 15 毫秒
11.
This letter presents a systematic and recursive method to construct good low-density parity-check (LDPC) codes, especially those with high rate. The proposed method uses a parity check matrix of a quasi-cyclic LDPC code with given row and column weights as a core upon which the larger code is recursively constructed with extensive use of pseudorandom permutation matrices. This construction preserves the minimum distance and girth properties of the core matrix and can generate either regular, or irregular LDPC codes. The method provides a unique representation of the code in compact notation. 相似文献
12.
In this letter, the construction of irregular LDPC codes obtained by concatenating regular ones is considered. These codes are analyzed for the binary symmetric channel (BSC). It is shown via proper distribution evolution that such concatenated codes have in general a threshold value weaker (but not necessarily much different) than their unconstrained counterparts for the BSC. On the other hand, they can offer advantages in term of convergence and error performance for lengths of practical interest and long enough to validate the degree distribution selection. 相似文献
13.