Product Accumulate Codes: A Class of Codes With Near-Capacity Performance and Low Decoding Complexity

Li, Jing; Narayanan, Krishna R.; Georghiades, C.N.

doi:10.1109/tit.2003.821995

Cited by 86 publications

(86 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Figure 2 shows the upperbound of probability of error for the SCT code based on the effective IOWEF achieved in Equation 5. In order to verify the performance of the SCT code, its upperbound is compared with the upperbound of the corresponding turbo RSC code.…”

Section: Analysis Of Serially Concatenated Turbo Codesmentioning

confidence: 99%

“…Alternatively, Li proposed turbo accumulated codes formed by the combination of single parity check codes with RSC codes having the rate one (1). Codes with the high rate create similar or even better performance than turbo RSC codes, while at the low rates, they do not provide significant performance [5]. New scheme of serially concatenated codes were proposed by combination of BCH and RSC codes [6], [7].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Serially Concatenated Turbo Codes

Vafi

Wysocki

2009

2009 5th International Conference on Wireless Communications, Networking and Mobile Computing

View full text Add to dashboard Cite

Abstract-The paper presents a new scheme of concatenated codes, referred to as Serially Concatenated Turbo (SCT) codes. The code is constructed as the serial combinations of two turbo codes, i.e. turbo Recursive Systematic Convolutional (RSC) codes and turbo Bose Ray Chaudhuri Hocquenghem (BCH) codes, linked by a pseudo-random interleaver. In comparison with the conventional turbo RSC codes, SCT codes have higher minimum distance values. Based on conducted simulations, it is found that SCT codes outperform turbo RSC codes at the waterfall and error floor regions, while they require reasonable number of iterations at their iterative decoding structure to achieve good performance.

show abstract

Section: Analysis Of Serially Concatenated Turbo Codesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Serially Concatenated Turbo Codes

Vafi

Wysocki

2009

2009 5th International Conference on Wireless Communications, Networking and Mobile Computing

View full text Add to dashboard Cite

show abstract

“…More specifically, the outer codes are replaced by product codes [7] with Hamming codes and high-rate SPC codes as the two component codes. The resulting serially concatenated codes are called HSA codes (or exHSA codes for extended Hamming codes).…”

Section: Introductionmentioning

confidence: 99%

High rate serially concatenated codes with low error floors

Liu¹,

Tong

Guo³

et al. 2015

2015 9th International Conference on Signal Processing and Communication Systems (ICSPCS)

View full text Add to dashboard Cite

Serial concatenation of Hamming codes and an accumulator has been shown to achieve near capacity performance at high code rates. However, these codes usually exhibit poor error floor performance due to their small minimum distances. To overcome this weakness, we propose to replace the outer Hamming codes by product codes constructed from Hamming codes and single-parity-check codes. In this way, the minimum distance of the outer code can be doubled, which is expected to increase the minimum distance of the serially concatenated code and thus to improve error floor performance. Three-dimensional EXIT chart is used for their convergence analysis and the derived thresholds are shown to be close to Shannon limit. Low weight distance spectrum of the proposed code is also calculated and compared with the original code. Simulation results show that the proposed codes can lower the error floor by two orders of magnitudes without waterfall performance degradation at short block length. Abstract-Serial concatenation of Hamming codes and an accumulator has been shown to achieve near capacity performance at high code rates. However, these codes usually exhibit poor error floor performance due to their small minimum distances. To overcome this weakness, we propose to replace the outer Hamming codes by product codes constructed from Hamming codes and single-parity-check codes. In this way, the minimum distance of the outer code can be doubled, which is expected to increase the minimum distance of the serially concatenated code and thus to improve error floor performance. Three-dimensional EXIT chart is used for their convergence analysis and the derived thresholds are shown to be close to Shannon limit. Low weight distance spectrum of the proposed code is also calculated and compared with the original code. Simulation results show that the proposed codes can lower the error floor by two orders of magnitudes without waterfall performance degradation at short block length.

show abstract

“…We have examined a variety of different systems, including low-density parity-check (LDPC) codes with message-passing decoding, turbo codes with turbo decoding, product accumulate (PA) codes with iterative PA decoding [10], and convolutionally-coded inter-symbol interference (ISI) channel with turbo equalization. In all of these systems, we have observed the Z-crease phenomenon.…”

Section: Introductionmentioning

confidence: 99%

Numerical investigation on heat transfer in power-law fluids with variable thermal diffusivity in the presence of viscous dissipation and radiation

Li¹,

Zheng²,

Zhang³

2012

AIP Conference Proceedings

View full text Add to dashboard Cite

Abstract-Iterative probabilistic inference, popularly dubbed the soft-iterative paradigm, has found great use in a wide range of communication applications, including turbo decoding and turbo equalization. The classic approach of analyzing the iterative approach inevitably use the statistical and information-theoretical tools that bear ensemble-average flavors. This paper consider the per-block error rate performance, and analyzes it using nonlinear dynamical theory. By modeling the iterative processor as a nonlinear dynamical system, we report a universal "Z-crease phenomenon:" the zig-zag or up-and-down fluctuation -rather than the monotonic decrease -of the per-block errors, as the number of iteration increases. Using the turbo decoder as an example, we also report several interesting motion phenomenons which were not previously reported, and which appear to correspond well with the notion of "pseudo codewords" and "stopping/trapping sets." We further propose a heuristic stopping criterion to control Z-crease and identify the best iteration. Our stopping criterion is most useful for controlling the worst-case per-block errors, and helps to significantly reduce the averageiteration numbers.

show abstract

Product Accumulate Codes: A Class of Codes With Near-Capacity Performance and Low Decoding Complexity

Cited by 86 publications

References 35 publications

Serially Concatenated Turbo Codes

Serially Concatenated Turbo Codes

High rate serially concatenated codes with low error floors

Numerical investigation on heat transfer in power-law fluids with variable thermal diffusivity in the presence of viscous dissipation and radiation

Contact Info

Product

Resources

About