Search for High-Rate Punctured Convolutional Codes through Transformed Identical Codes

Sen MORIYA; Kana KIKUCHI; Hiroshi SASANO

doi:10.1587/transfun.E100.A.2607

Search for High-Rate Punctured Convolutional Codes through Transformed Identical Codes

Sen MORIYA, Kana KIKUCHI, Hiroshi SASANO

Full Text Views

0

Share
Cite this

Summary :

In this study, we consider techniques to search for high-rate punctured convolutional code (PCC) encoders by rearranging row vectors of identical-encoder generator matrices. One well-known method to obtain a good PCC encoder is to perform an exhaustive search of all candidates. However, this approach is time-intensive. An exhaustive search with a rate R_G=1/2 original encoder requires a relatively short time, whereas that with an R_G=1/3 or lower original encoder takes significantly longer. The encoders with lower-rate original encoders are expected to create better PCC encoders. Thus, this paper proposes a method that uses exhaustive search results with rate R_G=1/2 original encoders, and rearranges row vectors of identical-encoder generator matrices to create PCCs with a lower rate original code. Further, we provide PCC encoders obtained by searches that utilize our method.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E100-A No.12 pp.2607-2614

Publication Date: 2017/12/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1587/transfun.E100.A.2607

Type of Manuscript: Special Section PAPER (Special Section on Information Theory and Its Applications)

Category: Coding Theory and Techniques

Authors

Sen MORIYA
  Kindai University
Kana KIKUCHI
  Kindai University
Hiroshi SASANO
  Kindai University

Keyword

convolutional code, punctured code, identical code, weight spectrum

Cite this

Copy

Sen MORIYA, Kana KIKUCHI, Hiroshi SASANO, "Search for High-Rate Punctured Convolutional Codes through Transformed Identical Codes" in IEICE TRANSACTIONS on Fundamentals, vol. E100-A, no. 12, pp. 2607-2614, December 2017, doi: 10.1587/transfun.E100.A.2607.
Abstract: In this study, we consider techniques to search for high-rate punctured convolutional code (PCC) encoders by rearranging row vectors of identical-encoder generator matrices. One well-known method to obtain a good PCC encoder is to perform an exhaustive search of all candidates. However, this approach is time-intensive. An exhaustive search with a rate R_G=1/2 original encoder requires a relatively short time, whereas that with an R_G=1/3 or lower original encoder takes significantly longer. The encoders with lower-rate original encoders are expected to create better PCC encoders. Thus, this paper proposes a method that uses exhaustive search results with rate R_G=1/2 original encoders, and rearranges row vectors of identical-encoder generator matrices to create PCCs with a lower rate original code. Further, we provide PCC encoders obtained by searches that utilize our method.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/transfun.E100.A.2607/_p

Copy

@ARTICLE{e100-a_12_2607,
author={Sen MORIYA, Kana KIKUCHI, Hiroshi SASANO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Search for High-Rate Punctured Convolutional Codes through Transformed Identical Codes},
year={2017},
volume={E100-A},
number={12},
pages={2607-2614},
abstract={In this study, we consider techniques to search for high-rate punctured convolutional code (PCC) encoders by rearranging row vectors of identical-encoder generator matrices. One well-known method to obtain a good PCC encoder is to perform an exhaustive search of all candidates. However, this approach is time-intensive. An exhaustive search with a rate R_G=1/2 original encoder requires a relatively short time, whereas that with an R_G=1/3 or lower original encoder takes significantly longer. The encoders with lower-rate original encoders are expected to create better PCC encoders. Thus, this paper proposes a method that uses exhaustive search results with rate R_G=1/2 original encoders, and rearranges row vectors of identical-encoder generator matrices to create PCCs with a lower rate original code. Further, we provide PCC encoders obtained by searches that utilize our method.},
keywords={},
doi={10.1587/transfun.E100.A.2607},
ISSN={1745-1337},
month={December},}

Copy

TY - JOUR
TI - Search for High-Rate Punctured Convolutional Codes through Transformed Identical Codes
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2607
EP - 2614
AU - Sen MORIYA
AU - Kana KIKUCHI
AU - Hiroshi SASANO
PY - 2017
DO - 10.1587/transfun.E100.A.2607
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E100-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2017
AB - In this study, we consider techniques to search for high-rate punctured convolutional code (PCC) encoders by rearranging row vectors of identical-encoder generator matrices. One well-known method to obtain a good PCC encoder is to perform an exhaustive search of all candidates. However, this approach is time-intensive. An exhaustive search with a rate R_G=1/2 original encoder requires a relatively short time, whereas that with an R_G=1/3 or lower original encoder takes significantly longer. The encoders with lower-rate original encoders are expected to create better PCC encoders. Thus, this paper proposes a method that uses exhaustive search results with rate R_G=1/2 original encoders, and rearranges row vectors of identical-encoder generator matrices to create PCCs with a lower rate original code. Further, we provide PCC encoders obtained by searches that utilize our method.
ER -