On unequal error protection of convolutional codes from an algebraic perspective

  • Authors:
  • Chung-Hsuan Wang;Mao-Ching Chiu;Chi-Chao Chao

  • Affiliations:
  • Institute of Communication Engineering and Department of Electrical Engineering, National Chiao Tung University, Hsinchu, Taiwan, R.O.C.;Department of Electrical Engineering, National Chung Cheng University, Chia-Yi, Taiwan, R.O.C.;Institute of Communications Engineering and The Department of Electrical Engineering, National Tsing Hua University, Hsinchu, Taiwan, R.O.C.

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2010

Quantified Score

Hi-index 754.84

Visualization

Abstract

In this paper, convolutional codes are studied for unequal error protection (UEP) from an algebraic theoretical viewpoint. We first show that for every convolutional code there exists at least one optimal generator matrix with respect to UEP. The UEP optimality of convolutional encoders is then combined with several algebraic properties, e.g., systematic, basic, canonical, and minimal, to establish the fundamentals of convolutional codes for UEP. In addition, a generic lower bound on the length of a UEP convolutional code is proposed. Good UEP codes with their lengths equal to the derived lower bound are obtained by computer search.