Enhancing the Error-correcting Capability of Imai-Kamiyanagi Codes for Data Storage Systems by Adopting Iterative Decoding using a Parity Check Tree

摘要

A novel low-complexity, soft decision technique which allows the decoding of distance-5 double error-correcting Imai-Kamiyanagi codes by using a parity check tree associated with the Tanner graph is proposed. These codes have been applied to memory subsystems and digital storage devices in order to achieve efficient and reliable data processing and storage. For the AWGN channel, gains in excess of 1.5 dB at reasonable bit error rates with respect to conventional hard decision decoding are demonstrated for the (46, 32), (81, 64), and (148,128) shortened Imai-Kamiyanagi codes.