An efficient algorithm for the reconstruction of punctured convolutional codes
Abstract Puncturing is one of the methods of increasing the code rate, and the original code before puncturing is called the mother code. Any (N,K) convolutional code is obtainable by puncturing some (n,1) mother codes. The objective of a blind recognition of a channel code is to obtain its generato...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SpringerOpen
2017-05-01
|
| Series: | EURASIP Journal on Wireless Communications and Networking |
| Subjects: | |
| Online Access: | http://link.springer.com/article/10.1186/s13638-017-0869-4 |
| _version_ | 1818957743189393408 |
|---|---|
| author | Habong Chung Hwanseok Jang Jinwoo Seong |
| author_facet | Habong Chung Hwanseok Jang Jinwoo Seong |
| author_sort | Habong Chung |
| collection | DOAJ |
| description | Abstract Puncturing is one of the methods of increasing the code rate, and the original code before puncturing is called the mother code. Any (N,K) convolutional code is obtainable by puncturing some (n,1) mother codes. The objective of a blind recognition of a channel code is to obtain its generator from the intercepted noisy bit stream. The process of the blind recognition of punctured convolutional codes consists of two parts: the reconstruction of the PGM of the (N,K) punctured convolutional code and the searching process of the mother code and its puncturing pattern. The process of finding the mother code is important for designing the optimum channel decoder. In this paper, a new searching algorithm with the computational complexity of O(K 4) polynomial operations is proposed, compared to the existing searching algorithm by M. Cluzeau which requires O(K 6) polynomial operations. |
| first_indexed | 2024-12-20T11:14:42Z |
| format | Article |
| id | doaj.art-4d2ee30335974f6bab0e481b8f601a9a |
| institution | Directory Open Access Journal |
| issn | 1687-1499 |
| language | English |
| last_indexed | 2024-12-20T11:14:42Z |
| publishDate | 2017-05-01 |
| publisher | SpringerOpen |
| record_format | Article |
| series | EURASIP Journal on Wireless Communications and Networking |
| spelling | doaj.art-4d2ee30335974f6bab0e481b8f601a9a2022-12-21T19:42:39ZengSpringerOpenEURASIP Journal on Wireless Communications and Networking1687-14992017-05-01201711510.1186/s13638-017-0869-4An efficient algorithm for the reconstruction of punctured convolutional codesHabong Chung0Hwanseok Jang1Jinwoo Seong2Department of Electronic Engineering, Hongik UniversityDaumsoftElectronic Information and Communication Engineering, Hongik UniversityAbstract Puncturing is one of the methods of increasing the code rate, and the original code before puncturing is called the mother code. Any (N,K) convolutional code is obtainable by puncturing some (n,1) mother codes. The objective of a blind recognition of a channel code is to obtain its generator from the intercepted noisy bit stream. The process of the blind recognition of punctured convolutional codes consists of two parts: the reconstruction of the PGM of the (N,K) punctured convolutional code and the searching process of the mother code and its puncturing pattern. The process of finding the mother code is important for designing the optimum channel decoder. In this paper, a new searching algorithm with the computational complexity of O(K 4) polynomial operations is proposed, compared to the existing searching algorithm by M. Cluzeau which requires O(K 6) polynomial operations.http://link.springer.com/article/10.1186/s13638-017-0869-4Punctured convolutional codeMother codeBlocked convolutional codePolynomial generator matrix |
| spellingShingle | Habong Chung Hwanseok Jang Jinwoo Seong An efficient algorithm for the reconstruction of punctured convolutional codes EURASIP Journal on Wireless Communications and Networking Punctured convolutional code Mother code Blocked convolutional code Polynomial generator matrix |
| title | An efficient algorithm for the reconstruction of punctured convolutional codes |
| title_full | An efficient algorithm for the reconstruction of punctured convolutional codes |
| title_fullStr | An efficient algorithm for the reconstruction of punctured convolutional codes |
| title_full_unstemmed | An efficient algorithm for the reconstruction of punctured convolutional codes |
| title_short | An efficient algorithm for the reconstruction of punctured convolutional codes |
| title_sort | efficient algorithm for the reconstruction of punctured convolutional codes |
| topic | Punctured convolutional code Mother code Blocked convolutional code Polynomial generator matrix |
| url | http://link.springer.com/article/10.1186/s13638-017-0869-4 |
| work_keys_str_mv | AT habongchung anefficientalgorithmforthereconstructionofpuncturedconvolutionalcodes AT hwanseokjang anefficientalgorithmforthereconstructionofpuncturedconvolutionalcodes AT jinwooseong anefficientalgorithmforthereconstructionofpuncturedconvolutionalcodes AT habongchung efficientalgorithmforthereconstructionofpuncturedconvolutionalcodes AT hwanseokjang efficientalgorithmforthereconstructionofpuncturedconvolutionalcodes AT jinwooseong efficientalgorithmforthereconstructionofpuncturedconvolutionalcodes |