The analytical error performance of convolutionalcodes with short constraint length and rate 1/n can be derived by iterative calculation of probability density function of relative state metric. This analytical techn...
详细信息
ISBN:
(纸本)9784885522673
The analytical error performance of convolutionalcodes with short constraint length and rate 1/n can be derived by iterative calculation of probability density function of relative state metric. This analytical technique can be also applied to punctured convolutional codes by periodic probability density function. In this paper, an analytical results of bit error probability for punctured convolutional codes using Viterbi decoding over binary symmetric channel are presented.
punctured convolutional codes are widely applied in satellite communication systems and mobile communication systems. Blind recognition of channel coding plays a significant role in wireless communication technologies...
详细信息
ISBN:
(纸本)9798350329285
punctured convolutional codes are widely applied in satellite communication systems and mobile communication systems. Blind recognition of channel coding plays a significant role in wireless communication technologies such as cognitive radio and radio spectrum detection. This work proposes a deep multi-scale convolution neural network (CNN) which is composed of a multi-scale feature extractor and dilated convolution layers for punctured convolutional codes recognition. The multi-scale feature extractor can better extract the features of different punctured matrices from codeword sequence with convolution kernels of different sizes. The dilated convolution layers expand the receptive field by using different dilation factors. In addition, mixture of experts is adopted to improve model stability and increase classification accuracy. Experimental results demonstrate that the proposed model performs consistently better than existing models on punctured convolutional codes. The proposed multi-scale CNN also shows better performance on common convolutionalcodes with code rate R = 1/2 and diverse constraint lengths.
The existing method for blind identification of a punctured convolutional code involves searching for dual words and the puncturing pattern exhaustively. As the length of the dual words and the code rate increase, the...
详细信息
The existing method for blind identification of a punctured convolutional code involves searching for dual words and the puncturing pattern exhaustively. As the length of the dual words and the code rate increase, the computational complexity of this method expands exponentially. To address this problem, a fast scheme for blind identification of punctured convolutional codes is proposed. First, a recursive algorithm for solving the parity check equation set is proposed. The dual word and generator polynomial bases of the punctured convolutional code are estimated by using the recursive algorithm. After this, by using the structural properties of the generator matrix of the blocked code, possible generator matrices of the punctured convolutional code are obtained. Finally, since a generator polynomial of the parent convolutionalcode can be recovered from any column of its polycyclic pseudocirculant matrix, the corresponding generator matrix of the parent code and the puncturing pattern are reconstructed simultaneously from an estimation of the generator matrix of the puncturedcode. The reconstructed generator matrix of the parent code with a minimal constraint length is determined to be the identification result. Simulation experiments show the effectiveness of the proposed method. As there is no need to search for the dual word and puncturing pattern exhaustively, the method can achieve fast identification of punctured convolutional codes. Additionally, the method is robust to bit errors in the received sequence.
It is well-known that the computational complexity of the Viterbi decoding algorithm for an (n, k, V) convolutionalcode grows exponentially with k and the code memory v, and thus it becomes quickly impractical as the...
详细信息
It is well-known that the computational complexity of the Viterbi decoding algorithm for an (n, k, V) convolutionalcode grows exponentially with k and the code memory v, and thus it becomes quickly impractical as the code rate increases. A solution, so far, has been to use punctured convolutional codes, which strongly reduces the decoding complexity but leads to a slightly worse performance. Recently, it has been pointed out that every non-punctured high-rate convolutionalcode (with 2(k) > 2(v)) can be viewed as the concatenation of a block code and a simpler convolutionalcode. In this paper, we exploit this property of high-rate codes to facilitate the implementation of the Viterbi algorithm. We propose a modification of the Viterbi decoding algorithm for non-punctured high-rate convolutionalcodes which results in very significant computational savings. Copyright (c) 2005 AEIT.
Puncturing is the most common way of increasing the rate of convolutionalcodes. The puncturing process is done to the original code called the mother code by a specific puncturing pattern. In this article, we investi...
详细信息
ISBN:
(纸本)9781467383080
Puncturing is the most common way of increasing the rate of convolutionalcodes. The puncturing process is done to the original code called the mother code by a specific puncturing pattern. In this article, we investigate into the question whether any convolutionalcode is obtainable by puncturing some (n, 1) mother codes. We present two sufficient conditions for the mother code and the puncturing pattern to satisfy in order that the puncturedcode is equivalent to the given (N, K) convolutionalcode.
In this paper, adaptive code-rate and modulation allocation algorithm are considered for multi-user, OFDM system depending on transmission power and the transfer function of frequency selective channel. The purpose of...
详细信息
ISBN:
(纸本)0780374673
In this paper, adaptive code-rate and modulation allocation algorithm are considered for multi-user, OFDM system depending on transmission power and the transfer function of frequency selective channel. The purpose of the presented adaptive code-rate and modulation OFDM system using punctured convolutional code and various constellation size is to maximize total capacity and to adapt proper service for each user according to channel conditions and the transmit power while maintaining transmission's quality of service (QoS) at the receiver. Computer simulation results show that the capacity of the adaptive code-rate and modulation OFDM system can be adaptively changed for various services. Also performance of the system in multipath fading channel with different delay spread is also analyzed.
This paper presents a new intelligent computing method of adaptive streaming video delivery based on Unequal Error Protection (UEP) rateless code for a Scalable Video Coding (SVC) video source, which can be applied to...
详细信息
ISBN:
(纸本)9781479947195
This paper presents a new intelligent computing method of adaptive streaming video delivery based on Unequal Error Protection (UEP) rateless code for a Scalable Video Coding (SVC) video source, which can be applied to both broadcast and end-to-end scenario. The proposed rateless UEP code is generated by concatenating punctured convolutional codes and LT codes with a specific coding graph. It provides superior UEP performance on different quality level symbols and gives greater decoding probability and higher priority to the base layer over the enhancement layers without excessive overhead. Meantime, the proposed delivery ensures that the layer with higher important level completes decoding before the layer with relatively lower important level. In this paper, the performance of coding scheme in terms of overhead and decoding probability is analyzed and the applicability to bandwidth and packet loss rate (PLR) of Dynamic Adaptive Streaming based on HTTP (DASH) and HTTP Live Streaming (HLS) are compared in the simulation. The simulation results have shown that the new adaptive streaming video delivery method is more suitable to the fluctuant bandwidth and has better performance on preventing packet loss.
This paper proposes a spectrum resource reduction method using a hybrid ARQ for OFDM cellular system by relaying the required data with error from the relay station. In this system, we consider a direct communication ...
详细信息
ISBN:
(纸本)9781424440665
This paper proposes a spectrum resource reduction method using a hybrid ARQ for OFDM cellular system by relaying the required data with error from the relay station. In this system, we consider a direct communication from a base station to a mobile station using OFDM cellular system like WiMAX and a relayed network from the relay station to the mobile station using highly reliable short range network like wireless LAN. In order to reduce the spectrum resource from the base station to the mobile station by using the relay station, we apply an adaptive rate control and an adaptive retransmission control based on a Hybrid ARQ by using a punctured convolutional code. The proposed method controls the coding rate transmitted from the base station by checking two kinds of the channel status one is from the base station to the relay station, and the other one is from the base station to the mobile station.
This paper presents a new intelligent computing method of adaptive streaming video delivery based on Unequal Error Protection(UEP) rateless code for a Scalable Video Coding(SVC) video source,which can be applied to bo...
详细信息
This paper presents a new intelligent computing method of adaptive streaming video delivery based on Unequal Error Protection(UEP) rateless code for a Scalable Video Coding(SVC) video source,which can be applied to both broadcast and end-to-end *** proposed rateless UEP code is generated by concatenating punctured convolutional codes and LT codes with a specific coding *** provides superior UEP performance on different quality level symbols and gives greater decoding probability and higher priority to the base layer over the enhancement layers without excessive ***,the proposed delivery ensures that the layer with higher important level completes decoding before the layer with relatively lower important *** this paper,the performance of coding scheme in terms of overhead and decoding probability is analyzed and the applicability to bandwidth and packet loss rate(PLR) of Dynamic Adaptive Streaming based on HTTP(DASH) and HTTP Live Streaming(HLS) are compared in the *** simulation results have shown that the new adaptive streaming video delivery method is more suitable to the fluctuant bandwidth and has better performance on preventing packet loss.
暂无评论