Exact split information function for SPC
Y. Min,Francis C. M. Lau,Chi K. Tse +2 more
- 27 Mar 2014
- pp 1208-1212
TL;DR: This letter derives an exact split information function for single-parity-check (SPC) codes that is very easy to compute and has been verified against the results obtained using the traversal method.
read more
Abstract: Split information functions are used in deriving closed-form Extrinsic Information Transfer (EXIT) curves of super-variable nodes (SVNs) in doubly-generalized low-density parity-check (DGLDPC) codes In this letter, we derive an exact split information function for single-parity-check (SPC) codes The function is very easy to compute and has been verified against the results obtained using the traversal method
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Figures
Fig. 4. The definition of the sub-matrix Sg,h for calculating the split information function ẽg,h for the (n, n− 1) SPC code. 
TABLE I THE SPLIT INFORMATION FUNCTION OF (5, 4) SPC CODE. 
Fig. 3. The vectors c, a and b shown from top to bottom. The shadowed parts in the vectors indicate the positions of ‘1’s. There are t, g and h ‘1’s in the vectors c, a and b, respectively. 
Fig. 2. The definition of the sub-matrix Sg,h for calculating the split information function ẽg,h for a general (nsvn, ksvn) SVN. 
TABLE II THE SPLIT INFORMATION FUNCTION OF (6, 5) SPC CODE. 
TABLE III THE SPLIT INFORMATION FUNCTION OF (7, 6) SPC CODE.
Citations
D-GLDPC codes with 3-D single parity-check product codes as super check nodes
Yejun He,Guiyuan Sun,Jie Yang,Francis C. M. Lau +3 more
- 22 Dec 2014
TL;DR: The extrinsic information transfer (EXIT) function of 3-D SPC-PCs used as SCNs is derived, and the performance of the proposed D-GLDPC codes over the additive white Gaussian noise (AWGN) channel with EXIT charts is analyzed.
1
References
Convergence behavior of iteratively decoded parallel concatenated codes
TL;DR: A code search based on the EXIT chart technique has been performed yielding new recursive systematic convolutional constituent codes exhibiting turbo cliffs at lower signal-to-noise ratios than attainable by previously known constituent codes.
Design of low-density parity-check codes for modulation and detection
TL;DR: A coding and modulation technique is studied where the coded bits of an irregular low-density parity-check (LDPC) code are passed directly to a modulator, and thereby outperforms a scheme employing a parallel concatenated (turbo) code by wide margins when there are more transmit than receive antennas.
1.2K
Extrinsic information transfer functions: model and erasure channel properties
TL;DR: A model is introduced that applies to decoding problems, including the iterative decoding of parallel concatenation codes, serially concatenated codes, low-density parity-check (LDPC) codes, and repeat-accumulate (RA) codes; several properties of such functions are proved for erasure channels.
872
Design of repeat-accumulate codes for iterative detection and decoding
S. ten Brink,Gerhard Kramer +1 more
TL;DR: Extrinsic information transfer charts are used to design systematic and nonsystematic repeat-accumulate (RA) codes for iterative detection and decoding and are shown to operate close to capacity.
291
On generalized low-density parity-check codes based on Hamming component codes
TL;DR: It is proved that there exist such generalized low-density (GLD) codes for which the minimum distance is growing linearly with the block length, and a lower bound of the minimum Distance is given.
212