A Class of Trellis-Codes for Partial Response Channel

Tadashi WADAYAMA; Atsushi NAGAO; Koichiro WAKASUGI; Masao KASAHARA

A Class of Trellis-Codes for Partial Response Channel

Tadashi WADAYAMA, Atsushi NAGAO, Koichiro WAKASUGI, Masao KASAHARA

Full Text Views

0

Cite this

Summary :

We present a new class of trellis-codes for partial-response channel. Our code configuration is based on the coded 1 - D scheme due to Wolf and Ungerboeck. However, no precoder between a convolutional encoder and the partialresponse channel is used. A new lower bound on the minimum free squared Euclidean distance of channel code is shown. The bound is available for any PR channel with a finite response. New codes for 1 - D and (1 - D) (1 + D)² channels are found by computer code search using the lower bound. Some of the new codes have excellent properties: a significant d²_free and a small decoding complexity.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E80-A No.2 pp.386-392

Publication Date: 1997/02/25

Publicized

Online ISSN

DOI

Type of Manuscript

Category: Information Theory and Coding Theory

Cite this

Copy

Tadashi WADAYAMA, Atsushi NAGAO, Koichiro WAKASUGI, Masao KASAHARA, "A Class of Trellis-Codes for Partial Response Channel" in IEICE TRANSACTIONS on Fundamentals, vol. E80-A, no. 2, pp. 386-392, February 1997, doi: .
Abstract: We present a new class of trellis-codes for partial-response channel. Our code configuration is based on the coded 1 - D scheme due to Wolf and Ungerboeck. However, no precoder between a convolutional encoder and the partialresponse channel is used. A new lower bound on the minimum free squared Euclidean distance of channel code is shown. The bound is available for any PR channel with a finite response. New codes for 1 - D and (1 - D) (1 + D)² channels are found by computer code search using the lower bound. Some of the new codes have excellent properties: a significant d²_free and a small decoding complexity.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e80-a_2_386/_p

Copy

@ARTICLE{e80-a_2_386,
author={Tadashi WADAYAMA, Atsushi NAGAO, Koichiro WAKASUGI, Masao KASAHARA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Class of Trellis-Codes for Partial Response Channel},
year={1997},
volume={E80-A},
number={2},
pages={386-392},
abstract={We present a new class of trellis-codes for partial-response channel. Our code configuration is based on the coded 1 - D scheme due to Wolf and Ungerboeck. However, no precoder between a convolutional encoder and the partialresponse channel is used. A new lower bound on the minimum free squared Euclidean distance of channel code is shown. The bound is available for any PR channel with a finite response. New codes for 1 - D and (1 - D) (1 + D)² channels are found by computer code search using the lower bound. Some of the new codes have excellent properties: a significant d²_free and a small decoding complexity.},
keywords={},
doi={},
ISSN={},
month={February},}

Copy

TY - JOUR
TI - A Class of Trellis-Codes for Partial Response Channel
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 386
EP - 392
AU - Tadashi WADAYAMA
AU - Atsushi NAGAO
AU - Koichiro WAKASUGI
AU - Masao KASAHARA
PY - 1997
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E80-A
IS - 2
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - February 1997
AB - We present a new class of trellis-codes for partial-response channel. Our code configuration is based on the coded 1 - D scheme due to Wolf and Ungerboeck. However, no precoder between a convolutional encoder and the partialresponse channel is used. A new lower bound on the minimum free squared Euclidean distance of channel code is shown. The bound is available for any PR channel with a finite response. New codes for 1 - D and (1 - D) (1 + D)² channels are found by computer code search using the lower bound. Some of the new codes have excellent properties: a significant d²_free and a small decoding complexity.
ER -