Feed-Forward Staircase Codes

TL;DR

This paper introduces feed-forward staircase codes that eliminate parity-propagation issues, enabling systematic termination and broadening application scope while maintaining comparable complexity and error performance to traditional staircase codes.

Contribution

The paper presents novel feed-forward and partial feed-forward staircase codes that resolve parity-propagation, allowing for systematic termination and application in systems requiring it.

Findings

Performance similar to staircase codes in error-floor and waterfall regions

Encoding complexity comparable to traditional staircase codes

Effective in systems where parity-propagation is undesirable

Abstract

We propose two variants of staircase codes that resolve the issue of parity-propagation in their encoding process. The proposed codes provide a systematic way of terminating a staircase code after an arbitrary number of blocks. The class of feed-forward staircase codes are introduced, which uses a self-protection technique to avoid parity-propagation. We also introduce the class of partial feed-forward staircase codes, which allows parity-propagation to occur over a given number of blocks. By amortizing the complexity of self-protection over several standard staircase blocks, the encoding complexity of these codes is made comparable to staircase codes. Partial feed-forward staircase codes have the same error-floor as staircase codes. Simulations confirm that the performance of the proposed codes in both the waterfall and error-floor regions is similar to the original staircase codes. The proposed codes help extend the domain of application of staircase codes to systems in which parity-propagation is undesirable or termination is necessary.