DC-free error-correcting codes based on convolutional codes

Mao‐Ching Chiu

doi:10.1109/26.917767

Return

DC-free error-correcting codes based on convolutional codes

2001-04-01

PRE

Mao‐Ching Chiu *

DOI：10.1109/26.917767

Original

Original request for help

Save

Abstract

En 中文

A new construction of direct current (dc)-free error-correcting codes based on convolutional codes is proposed. The new code is constructed by selecting a proper subcode from a convolutional code composed of two different component codes. The encoder employs a Viterbi algorithm as the codeword selector so that the selected code sequences satisfy the de constraint. A lower bound on the free distance of such codes is proposed, and a procedure for obtaining this bound is presented. A sufficient condition for these codes to have a bounded running digital sum (RDS) is proposed. Under the assumption of a simplified codeword selection algorithm, we present an upper bound on the maximum absolute value of RDS and derive the sum variance for a given code. A new construction of standard de-free codes, i,e., dc-free codes without error-correcting capability, is also proposed. These codes have the nice property that the decoder can be implemented by simple symbol-by-symbol hard decisions. Finally, under the new construction, we propose several codes that are suitable far the systems that require small sum variance and good error-correction capability.

Keywords:

convolutional codes

runlength codes

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.