Vector Symbol Decoding (VSD) with list of alternative vector symbol choices is presented as a relatively simple and high performance decoding technique for convolutional outer codes. The convolutional VSD technique ha...
详细信息
Vector Symbol Decoding (VSD) with list of alternative vector symbol choices is presented as a relatively simple and high performance decoding technique for convolutional outer codes. The convolutional VSD technique has the advantage over the block VSD technique in that most corrections are almost immediate based on observation of only one or a few syndromes. The list decoding also improves the performance and often simplifies the decoding. One main assumption of VSD is that the error symbols are linearly independent, which usually is true for large symbol size. The performance of VSD is compared to the Reed-Solomon code decoding for various types of inner codes and channel conditions. Interleaved Reed-Solomon codes are also considered. The decoding failure probability of VSD is evaluated by both analytically approach to find the upper bound and computer simulation approach to find the exact probability. The upper bound is shown to be extremely close to the simulation result. The decoding failure probability of VSD is considerably lower than the Reed-Solomon code in most cases.
High rate binary coset codes are investigated. The binary coset (BC) code is a binary convolutional code with parallel path. In our previous research of concatenated trellis-coded modulation (TCM) scheme, we have foun...
详细信息
High rate binary coset codes are investigated. The binary coset (BC) code is a binary convolutional code with parallel path. In our previous research of concatenated trellis-coded modulation (TCM) scheme, we have found that the effective minimum distance of inner code is more important than the minimum free distance when TCM is used as inner code. In this paper, for inner code, we construct the high rate BC codes by maximizing the effective minimum distance. With the new inner codes, we can decrease the decoding complexity of the inner code compared with conventional best convolutional code while maintaining the overall decoding performance.
In this study, we consider techniques to search for highrate 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 ...
详细信息
In this study, we consider techniques to search for highrate 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.
We study a multiple access encoding/decoding algorithm based on iterative (turbo) decoding. The algorithm is suitable for both synchronous and asynchronous systems. The quasi-orthogonal pseudo-noise sequences of the D...
详细信息
We study a multiple access encoding/decoding algorithm based on iterative (turbo) decoding. The algorithm is suitable for both synchronous and asynchronous systems. The quasi-orthogonal pseudo-noise sequences of the DS-SSMA system are replaced by independent channel codes constructed by combining convolutional codes and random interleavers. The interference is rebuilt using soft output information. The results show that the iterative joint decoder is able to completely eliminate the co-channel interference. The performance of the multiple access system tends practically to that of a single user system.
This paper proposes a method of improving reception of digital satellite broadcasting in a moving vehicle. According to some studies, the antennas used for mobile reception will be smaller in the next generation and r...
详细信息
This paper proposes a method of improving reception of digital satellite broadcasting in a moving vehicle. According to some studies, the antennas used for mobile reception will be smaller in the next generation and reception will be more difficult because of a fading multipath channel with delays in a low carrier-to-noise ratio. Commonly used approaches to reduce the inter symbol interference caused by a fading multipath channel with delays are pilot sequences and diversity reception. Digital satellite broadcasting, however. does not transmit pilot sequences for channel estimation and it is not possible to install multiple antennas in a vehicle. This paper does not propose any change to the broadcasting standards but discusses how to process currently available digital satellite signals to obtain better results. Our method does not rely on the pilot sequences or diversity reception, but consists of channel estimation and stochastic inference methods. For each task, two methods are proposed. The maximum likelihood estimation and higher order statistics matching methods are proposed for the estimation, and the marginal with the joint probability inference methods are proposed for the stochastic inference. The improvements were confirmed through experiments with numerical simulations and real data. The computational costs are also discussed for future implementation.
In this paper, we consider the applicability of turbo code for future third generation (3G) mobile telecommunication systems. Futhermore, we propose a simple method of estimating the channel variance which is necessar...
详细信息
In this paper, we consider the applicability of turbo code for future third generation (3G) mobile telecommunication systems. Futhermore, we propose a simple method of estimating the channel variance which is necessary for the MAP (Maximum A Posteriori) decoding algorithm. We compare the performance of turbo code with a known channel variance, conventional variance estimate and variance estimated by our proposed technique. We show that our variance estimation scheme is adequate for 3G WB-CDMA mobile systems without degradation of turbo code performance.
A decoding algorithm for a special error-correcting code is considered and its efficiency is estimated. This code is obtained as a result of processing information messages by finite automata and using a two-base nume...
详细信息
A decoding algorithm for a special error-correcting code is considered and its efficiency is estimated. This code is obtained as a result of processing information messages by finite automata and using a two-base numeral system. A general encoding algorithm is also considered. Both encoding or decoding are performed by a two-level system in which an input message is represented as a lower (2,3) code at the internal level, and the error correcting capabilities of this code are strengthened owing to its transformation with the help of a special finite automaton at the external level. In decoding, errors are first detected and corrected at the external level, and then possible remaining errors are eliminated by an internal automaton. The relationship between the external level of the system being considered and convolutional codes is investigated and the advantages of the proposed method are shown.
Methods for checking the generator polynomial of a convolutional code are mathematical derivation and using mathematical tools Matlab verification. However, the existing inspection methods do not apply to large constr...
详细信息
ISBN:
(纸本)9781538645093
Methods for checking the generator polynomial of a convolutional code are mathematical derivation and using mathematical tools Matlab verification. However, the existing inspection methods do not apply to large constraint length convolutional codes, using the method of parallel computing to make appropriate improvements to existing evil code checking algorithms, transform the parallel inspection algorithm into an algorithm suitable for FPGA hardware development platform. It can be used to improve the inspection efficiency of bad code.
This paper describes the hierarchical woven coded CPFSK (hWCCPFSK), is a serial concatenation of different outer convolutional codes and inner continuous phase frequency shift keying (CPFSK). Classical woven coded CPF...
详细信息
ISBN:
(纸本)0780382803
This paper describes the hierarchical woven coded CPFSK (hWCCPFSK), is a serial concatenation of different outer convolutional codes and inner continuous phase frequency shift keying (CPFSK). Classical woven coded CPFSK (cWCCPFSK) has identical outer convolutional codes. We show that with a proper choice of the outer codes, hWCCPFSK has better decoding behaviour but cWCCPFSK has larger free distance. Hence, hWCCPFSK performes better in the waterfall region of the bit error rate curves, while cWCCPFSK is better in the error floor region.
In this study, we consider techniques for searching high -rate convolutional code (CC) encoders using dual code encoders. A low-rate (R = 1/n) CC is a dual code to a high-rate (R = (n - 1)/n) CC. According to our past...
详细信息
In this study, we consider techniques for searching high -rate convolutional code (CC) encoders using dual code encoders. A low-rate (R = 1/n) CC is a dual code to a high-rate (R = (n - 1)/n) CC. According to our past studies, if a CC encoder has a high performance, a dual code encoder to the CC also tends to have a good performance. However, it is not guaranteed to have the highest performance. We consider a method to obtain a high-rate CC encoder with a high performance using good dual code encoders, namely, high-performance low-rate CC encoders. We also present some CC encoders obtained by searches using our method.
暂无评论