A distance measure tailored to tailbiting codes

Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift

Standard

A distance measure tailored to tailbiting codes. / Höst, Stefan; Johannesson, Rolf; Zyablov, Viktor V.

I: Problems of Information Transmission, Vol. 38, Nr. 4, 2002, s. 280-295.

Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift

Harvard

APA

CBE

MLA

Vancouver

Author

RIS

TY - JOUR

T1 - A distance measure tailored to tailbiting codes

AU - Höst, Stefan

AU - Johannesson, Rolf

AU - Zyablov, Viktor V.

PY - 2002

Y1 - 2002

N2 - The error-correcting capability of tailbiting codes generated by convolutional encoders is described. In order to obtain a description beyond what the minimum distance d min of the tailbiting code implies, the active tailbiting segment distance is introduced. The description of correctable error patterns via active distances leads to an upper bound on the decoding block error probability of tailbiting codes. The necessary length of a tailbiting code so that its minimum distance is equal to the free distance d free of the convolutional code encoded by the same encoder is easily obtained from the active tailbiting segment distance. This is useful when designing and analyzing concatenated convolutional codes with component codes that are terminated using the tailbiting method. Lower bounds on the active tailbiting segment distance and an upper bound on the ratio between the tailbiting length and memory of the convolutional generator matrix such that d min equals d free are derived. Furthermore, affine lower bounds on the active tailbiting segment distance suggest that good tailbiting codes are generated by convolutional encoders with large active-distance slopes.

AB - The error-correcting capability of tailbiting codes generated by convolutional encoders is described. In order to obtain a description beyond what the minimum distance d min of the tailbiting code implies, the active tailbiting segment distance is introduced. The description of correctable error patterns via active distances leads to an upper bound on the decoding block error probability of tailbiting codes. The necessary length of a tailbiting code so that its minimum distance is equal to the free distance d free of the convolutional code encoded by the same encoder is easily obtained from the active tailbiting segment distance. This is useful when designing and analyzing concatenated convolutional codes with component codes that are terminated using the tailbiting method. Lower bounds on the active tailbiting segment distance and an upper bound on the ratio between the tailbiting length and memory of the convolutional generator matrix such that d min equals d free are derived. Furthermore, affine lower bounds on the active tailbiting segment distance suggest that good tailbiting codes are generated by convolutional encoders with large active-distance slopes.

U2 - 10.1023/A:1022097828917

DO - 10.1023/A:1022097828917

M3 - Article

VL - 38

SP - 280

EP - 295

JO - Problems of Information Transmission

T2 - Problems of Information Transmission

JF - Problems of Information Transmission

SN - 0032-9460

IS - 4

ER -