2008Unpublished venueRequires access

Enhanced delta-based layered decoding of WiMAX QC-LDPC codes

Tzu-Chieh Kuo, A.N. Willson

Open publisher page 2 citations

Abstract

Rovini, et al., have proposed a delta-based layered decoding algorithm to mitigate the latency constraint imposed by the layered decoding algorithm on QC-LDPC codes whose adjacent block rows overlap. We apply their algorithm and the low-complexity offset-based Min-Sum check equation to the decoding of the codes specified in WiMAX. The performance is simulated for two representative hardware pipeline depths, showing a maximal 0.13-dB performance loss, with respect to the ideal latency-free layered decoding algorithm, for a block error rate of 10−2in 15 iterations and a pipeline depth of eight. We further develop a systematic procedure to arrange the processing order of the block rows and block columns of a given QC parity check matrix, reducing the aforementioned performance loss to 0.03 dB at no extra hardware cost. The procedure can be applied to any QC-LDPC codes for any given pipeline depths.

About this research paper

What this paper is about

Rovini, et al., have proposed a delta-based layered decoding algorithm to mitigate the latency constraint imposed by the layered decoding algorithm on QC-LDPC codes whose adjacent block rows overlap. We apply their algorithm and the low-complexity offset-based Min-Sum check equation to the decoding of the codes specified in WiMAX. The performance is simulated for two representative hardware pipeline depths, showing a maximal 0.13-dB performance loss, with respect to the ideal latency-free layered decoding algorithm, for a block error rate of 10−2in 15 iterations and a pipeline depth of eight. We further develop a systematic procedure to arrange the processing order of the block rows and block columns of a given QC parity check matrix, reducing the aforementioned performance loss to 0.03 dB at no extra hardware cost. The procedure can be applied to any QC-LDPC codes for any given pipeline depths.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Rovini, et al., have proposed a delta-based layered decoding algorithm to mitigate the latency constraint imposed by the layered decoding algorithm on QC-LDPC codes whose adjacent block rows overlap. We apply their algorithm and the low-complexity offset-based Min-Sum check equation to the decoding of the codes specified in WiMAX. The performance is simulated for two representative hardware pipeline depths, showing a maximal 0.13-dB performance loss, with respect to the ideal latency-free layered decoding algorithm, for a block error rate of 10−2in 15 iterations and a pipeline depth of eight. We further develop a systematic procedure to arrange the processing order of the block rows and block columns of a given QC parity check matrix, reducing the aforementioned performance loss to 0.03 dB at no extra hardware cost. The procedure can be applied to any QC-LDPC codes for any given pipeline depths.

Key concepts: Decoding methods, Computer science, Low-density parity-check code, WiMAX, Algorithm, Pipeline (software), Offset (computer science), Block (permutation group theory)

Related papers

Back to paper searchBrowse research topicsOriginal source
Enhanced delta-based layered decoding of WiMAX QC-LDPC codes — Research Paper | ScholarLens