Efficient Search for High-Rate Punctured Convolutional Codes Using Dual Codes
Summary :
In this study, we consider techniques to search for high-rate punctured convolutional code (PCC) encoders using dual code encoders. A low-rate R=1/n convolutional code (CC) has a dual code that is identical to a PCC with rate R=(n-1)/n. This implies that a rate R=1/n convolutional code encoder can assist in searches for high-rate PCC encoders. On the other hand, we can derive a rate R=1/n CC encoder from good PCC encoders with rate R=(n-1)/n using dual code encoders. This paper proposes a method to obtain improved high-rate PCC encoders, using exhaustive search results of PCC encoders with rate R=1/3 original encoders, and dual code encoders. We also show some PCC encoders obtained by searches that utilized our method.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E99-A No.12 pp.2162-2169
- Publication Date
- 2016/12/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E99.A.2162
- 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
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Sen MORIYA, Kana KIKUCHI, Hiroshi SASANO, "Efficient Search for High-Rate Punctured Convolutional Codes Using Dual Codes" in IEICE TRANSACTIONS on Fundamentals,
vol. E99-A, no. 12, pp. 2162-2169, December 2016, doi: 10.1587/transfun.E99.A.2162.
Abstract: In this study, we consider techniques to search for high-rate punctured convolutional code (PCC) encoders using dual code encoders. A low-rate R=1/n convolutional code (CC) has a dual code that is identical to a PCC with rate R=(n-1)/n. This implies that a rate R=1/n convolutional code encoder can assist in searches for high-rate PCC encoders. On the other hand, we can derive a rate R=1/n CC encoder from good PCC encoders with rate R=(n-1)/n using dual code encoders. This paper proposes a method to obtain improved high-rate PCC encoders, using exhaustive search results of PCC encoders with rate R=1/3 original encoders, and dual code encoders. We also show some PCC encoders obtained by searches that utilized our method.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E99.A.2162/_p
Copy
@ARTICLE{e99-a_12_2162,
author={Sen MORIYA, Kana KIKUCHI, Hiroshi SASANO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Efficient Search for High-Rate Punctured Convolutional Codes Using Dual Codes},
year={2016},
volume={E99-A},
number={12},
pages={2162-2169},
abstract={In this study, we consider techniques to search for high-rate punctured convolutional code (PCC) encoders using dual code encoders. A low-rate R=1/n convolutional code (CC) has a dual code that is identical to a PCC with rate R=(n-1)/n. This implies that a rate R=1/n convolutional code encoder can assist in searches for high-rate PCC encoders. On the other hand, we can derive a rate R=1/n CC encoder from good PCC encoders with rate R=(n-1)/n using dual code encoders. This paper proposes a method to obtain improved high-rate PCC encoders, using exhaustive search results of PCC encoders with rate R=1/3 original encoders, and dual code encoders. We also show some PCC encoders obtained by searches that utilized our method.},
keywords={},
doi={10.1587/transfun.E99.A.2162},
ISSN={1745-1337},
month={December},}
Copy
TY - JOUR
TI - Efficient Search for High-Rate Punctured Convolutional Codes Using Dual Codes
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2162
EP - 2169
AU - Sen MORIYA
AU - Kana KIKUCHI
AU - Hiroshi SASANO
PY - 2016
DO - 10.1587/transfun.E99.A.2162
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E99-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2016
AB - In this study, we consider techniques to search for high-rate punctured convolutional code (PCC) encoders using dual code encoders. A low-rate R=1/n convolutional code (CC) has a dual code that is identical to a PCC with rate R=(n-1)/n. This implies that a rate R=1/n convolutional code encoder can assist in searches for high-rate PCC encoders. On the other hand, we can derive a rate R=1/n CC encoder from good PCC encoders with rate R=(n-1)/n using dual code encoders. This paper proposes a method to obtain improved high-rate PCC encoders, using exhaustive search results of PCC encoders with rate R=1/3 original encoders, and dual code encoders. We also show some PCC encoders obtained by searches that utilized our method.
ER -
English
