English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Recently, it has been observed that terminated low-density-parity-check(LDPC) convolutional codes (or spatially-coupled codes) appear to approachcapacity universally across the class of binary memoryless channels. This isfacilitated by the "threshold saturation" effect whereby the belief-propagation(BP) threshold of the spatially-coupled ensemble is boosted to the maximuma-posteriori (MAP) threshold of the underlying constituent ensemble.  In this paper, we consider the universality of spatially-coupled codes overintersymbol-interference (ISI) channels under joint iterative decoding. Morespecifically, we empirically show that threshold saturation also occurs for theconsidered problem. This can be observed by first identifying the EXIT curvefor erasure noise and the GEXIT curve for general noise that naturally obey thegeneral area theorem. From these curves, the corresponding MAP and the BPthresholds are then numerically obtained. With the fact that regular LDPC codescan achieve the symmetric information rate (SIR) under MAP decoding,spatially-coupled codes with joint iterative decoding can universally approachthe SIR of ISI channels. For the dicode erasure channel, Kudekar and Kasairecently reported very similar results based on EXIT-like curves.

Spatially-Coupled Codes and Threshold Saturation on Intersymbol-Interference Channels