Window decoding of Braided Convolutional Codes

Abstract

We consider a window decoding scheme for Braided Convolutional Codes (BCCs) based on the BCJR algorithm. We describe the principle of this decoding scheme and show that BCCs with window decoding exhibit excellent performance. The tradeoff between performance and decoding latency is examined and, to reduce decoding complexity, both uniform and nonuniform message passing schedules within the decoding window are considered. Finally, puncturing is employed to obtain rate-compatible code rates of 1/2 and 2/3 starting from a rate 1/3 example mother code. Simulation results show that, with nonuniform message passing and puncturing, near capacity performance can be maintained throughout the rate range considered with reasonable decoding complexity and no visible error floors.