Citation Context

...large-scale integration (VLSI) implementations. The properties of absorbing sets are a critical factor in the design of a high-throughput hardware emulator that operates in very low BER regions [33], =-=[34]-=-. In addition, an ongoing work has demonstrated that the absorbing sets are also a fundamental component in an importance-sampling-based method for estimating error floor probabilities [9]; in the dev...

Citation Context

... These approaches increase the power consumption and complicate the system integration. This work implements a post-processing algorithm that utilizes the graph-theoretic structure of LDPC code [21], =-=[22]-=-. The post-processing approach is based on a message-passing algorithm with selectively-biased messages. As a result, it can be seamlessly integrated with the messagepassing decoder. Results show perf...

Citation Context

...f sum-product BP appears to be dropping at a constant slope. In this regime we found that the non-saturating BP decoder is not converging to a trapping set, but is rather oscillating, as discussed in =-=[57]-=- [34]. However, as we see in our next 21word-error-rate (WER) 10 −6 10 −4 10 −2 10 0 ADMM Non-saturating BP ML lower bound 10 −8 10 −10 2.5 3 3.5 4 4.5 5 SNR (dB) Figure 4: Word error rate (WER) of t...

Citation Context

...variable node degree and c is the check node degree. They are constructed as r rows and c columns of circulant matrices. They are particularly compatible with high-throughput hardware implementations =-=[10]-=-. The parity-check matrix of circulant-based LDPC codes has the following general structure: ⎡ σ ⎢ f(0,0) σ f(0,1) σ f(0,2) . . . σ f(0,c−1) σ f(1,0) σ f(1,1) σ f(1,2) . . . σ f(1,c−1) ⎤ ⎥ H r,c p,f =...

Citation Context

...nitudes less than 1, all quantization bits were used to represent the fractional part; for magnitudes greater than or equal to 1, all bits were dedicated to the representation of the integer part. In =-=[11]-=-, [12], Zhang et al. proposed a conceptually similar idea to increase precision in the quantization of the log-tanh function. Uniform quantization was applied to messages generated by both variable no...

Citation Context

...et of (r, c) regular LDPC codes, where r is the variable node degree and c is the check node degree. The structure of these codes is particularly compatible with high-throughput hardware applications =-=[13]-=-.The parity-check matrix of circulant-based LDPC codes can After reviewing absorbing sets [4] below, (2) is used to be described as follows: ⎡ σ f(0,0) σ f(0,1) σ f(0,2) . . . σ f(0,c−1) construct a ...

Citation Context

...tructural properties of dominant absorbing sets for a representative class of practical regular LDPC codes. Concurrently, absorbing sets were also experimentally verified on a hardware emulator [28], =-=[30]-=- to govern the low BER region performance for several representative LDPC code families. Recent results in [1], [10], [18], [24] provided insights into the trapping set spectrum of other important cla...

Citation Context

...er a bitflipping decoder. Structural properties of absorbing sets for a representative class of LDPC codes were studied in [7]. Absorbing sets were also experimentally verified on a hardware emulator =-=[27]-=- to govern the low BER region performance for several representative LDPC code families. One promising direction of improving the performance (and alleviating the error floors) of sparse graph codes i...

Citation Context

...n approach is a decoder-based strategy to remove or reduce the effect of harmful trapping sets on error-floor. Several such decoderbased strategies have been recently proposed [53], [54], [56], [58], =-=[61]-=-, [67], [68]. Among them, the most effective decoding strategy is the backtracking iterative decoding algorithm recently presented in [68]. B. An Analysis of Trapping Sets of the RC-Constrained LDPC C...