The construction of periodically time-variant convolutional codes using binary linear block codes

✍ Scribed by Naonori Ogasahara; Manabu Kobayashi; Shigeichi Hirasawa

• Publisher: John Wiley and Sons
• Year: 2007
• Tongue: English
• Weight: 483 KB
• Volume: 90
• Category: Article
• ISSN: 1042-0967
• DOI: 10.1002/ecjc.20271

✦ Synopsis

Abstract

In 1996 Rosenthal and York proposed (time‐invariant) BCH convolutional codes [4] in which the parity check matrix of a BCH code is used in the construction of the convolutional code. The lower bound on the minimum free distance of a BCH convolutional code is guaranteed by the BCH limit. In this paper we propose a periodically time‐variant convolutional code that can be constructed not only using the BCH parity check matrix but using the check matrix of any binary linear block code and show that the lower bound on the minimum free distance is guaranteed by the minimum free distance of the binary linear block code. In addition, taking 12 binary linear block codes as examples, we perform comparisons of the proposed codes with BCH convolutional codes using three evaluation criteria (minimum free distance, number of delay elements, coding rate) and show that there exist proposed codes that are superior to existing ones. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(9): 31– 40, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20271