Walsh-Hadamard transform (WriT) can solve linear error equations on Field F2, and the method can be used to recover the parameters of convolutional code. However, solving the equations with many unknowns needs enorm...
详细信息
Walsh-Hadamard transform (WriT) can solve linear error equations on Field F2, and the method can be used to recover the parameters of convolutional code. However, solving the equations with many unknowns needs enormous computer memory which limits the application of WriT. In order to solve this problem, a method based on segmented WriT is proposed in this paper. The coefficient vector of high dimension is reshaped and two vectors of lower dimension are obtained. Then the WriT is operated and the requirement for computer memory is much reduced. The code rate and the constraint length of convolutional code are detected from the Walsh spectrum. And the check vector is recovered from the peak position. The validity of the method is verified by the simulation result, and the performance is proved to be optimal.
A Viterbi algorithm (VA) is the optimal decoding strategy for the convolutional code. The Viterbi algorithm is complex and requires a large memory and delay. In this paper, an alternative sub-optimal decoder based on ...
详细信息
A Viterbi algorithm (VA) is the optimal decoding strategy for the convolutional code. The Viterbi algorithm is complex and requires a large memory and delay. In this paper, an alternative sub-optimal decoder based on the artificial neural network (ANN) is proposed and studied using a sliding block decoding algorithm. The ANN is trained in a supervised manner and the system parameters are optimised using computer simulations for the optimum performance. Comparative study with the Viterbi decoder is carried out. The performance of the ANN decoder is found to be comparable to the Viterbi soft decoding with much reduced decoding length. The key advantages of the proposed ANN decoder compared with other ANN decoders are the reduced decoding and training length, adaptive decoding, no iteration required and possibility of parallel decoding. Copyright (C) 2012 John Wiley & Sons, Ltd.
To benefit the properties of both Low-Density Parity-Check (LDPC) and Turbo convolutional codes (TCC), we propose a practical concatenated Gallager/convolutional code in a turbo coding way. The modified code creates a...
详细信息
To benefit the properties of both Low-Density Parity-Check (LDPC) and Turbo convolutional codes (TCC), we propose a practical concatenated Gallager/convolutional code in a turbo coding way. The modified code creates a balance between the advantages and the disadvantages of LDPC and TCC in terms of the overall complexity and latency. This will be done through two different component SISO decoders;LDPC and convolutional code of the same rate 1/2 without interleaver. Since the two SISO decoders are different in nature, they exchange extrinsic information that will be easily adapted to each other. The study of computation complexity and decoding performance over an AWGN channel indicates that such approach leads to excellent performance because of several factors. The proposed approach achieves a trade-off between waterfall and error floor regions. It reduces complexity decoding compared to TCC and 3D-TCC. It provides a better coding gain over LDPC and PCGC (Parallel Concatenated Gallager codes). These features will ensure optimal outcomes and cost-performance ratio, and thus, this trend can be the best choice for today's communication systems.
The rank-based method is very effective to identify the convolutional code parameters in a non-cooperative context. This method cuts the received sequence up into vectors of length l to form the rows of matrix C-(l). ...
详细信息
The rank-based method is very effective to identify the convolutional code parameters in a non-cooperative context. This method cuts the received sequence up into vectors of length l to form the rows of matrix C-(l). It is well known that there is a relationship between the code parameters and the rank behavior of C-(l). However, finding the general form of this relation is a challenging open problem. In this letter, we formulate and solve this problem for rate k/n convolutional codes. Our analytical solution show that the rank behavior is highly dependent on the dual code constraint lengths. Moreover, it is proved that the applied experimental rank relation in prior works is true only for rate n-1/n codes.
In the orthogonal frequency division multiplexing (OFDM) transmission system, when the digital symbols are transmitted in the wireless channel, it would be affected by a lot of noise interference due to the unsatisfac...
详细信息
In the orthogonal frequency division multiplexing (OFDM) transmission system, when the digital symbols are transmitted in the wireless channel, it would be affected by a lot of noise interference due to the unsatisfactory condition characteristics of the wireless channel itself, therefore, the symbol error and bit error would be generated. To achieve a certain bit error rate (BER) under the condition of known signal-to-noise ratio (SNR), convolutional channel coding and block interleaver should be utilized to further reduce the BER. Moreover, convolutional code is almost utilized in all wireless communication systems. This paper proposes a convolutional code channel estimation method in multiple-input single-output (MISO)-based OFDM (MISO-OFDM) system with frequency-shift m-sequence (FSMS) as guard interval (GI) for avoiding inter-symbol interference (ISI). The proposed space-frequency block code (SFBC) MISO-OFDM system achieves higher transmit diversity gains and better BER performance. Simulation results verify that the proposed iterative threshold channel estimation (ITCE) method in octal representation generation vector (ORGV) convolutional code 4 x 1 MISO-OFDM system provides good BER and normalized mean squared error (NMSE) performance with significant coding gains in both static and dynamic multipath channels.
convolutional Goppa codes (CGC) were defined in Appl. Algebra Eng. Comm. Comput., vol. 15, pp. 51-61, 2004 and IEEE Trans. Inf. Theory, vol. 52, 340-344, 2006. In this paper, we prove that every convolutional code is ...
详细信息
convolutional Goppa codes (CGC) were defined in Appl. Algebra Eng. Comm. Comput., vol. 15, pp. 51-61, 2004 and IEEE Trans. Inf. Theory, vol. 52, 340-344, 2006. In this paper, we prove that every convolutional code is a CGC defined over a smooth curve over F-q(z) and we give an explicit construction of convolutional codes as CGC over the projective line P-Fq(z)(1). We characterize which convolutional codes are defined by a complete linear system over curves of genus 0, 1, and over hyperelliptic curves. We apply these results to provide detailed constructions of some linear block codes as Goppa codes.
The Golay convolutional code and related block codes are investigated from an application point of vies. We calculate the distance spectrum of the Golay convolutional code and the weight distributions of the block cod...
详细信息
The Golay convolutional code and related block codes are investigated from an application point of vies. We calculate the distance spectrum of the Golay convolutional code and the weight distributions of the block codes using the transfer-matrix method. The performance of the considered codes is shown and discussed. Moreover, the codes are applied as component codes of parallel concatenated codes which are iteratively decoded.
Based on the convolutional code model of error-correction coding theory, we propose an approach to characterize and compare DNA sequences with consideration of the effect of codon context. We construct an 8-component ...
详细信息
Based on the convolutional code model of error-correction coding theory, we propose an approach to characterize and compare DNA sequences with consideration of the effect of codon context. We construct an 8-component vector whose components are the normalized leading eigenvalues of the L/L and M/M matrices associated with the original DNA sequences and the transformed sequences. The utility of our approach is illustrated by the examination of the similarities/dissimilarities among the coding sequences of the first exon of -globin gene of 11 species, and the efficiency of error-correction coding theory in analysis of similarity/dissimilarity of DNA sequences is represented.
The problem of mitigating narrowband interference (NBI) due to coexistence between Digital Video Broadcasting-Terrestrial (DVB-T) and International Mobile Telecommunication-Advanced (IMT-A) system is considered. It is...
详细信息
ISBN:
(纸本)9783319076744;9783319076737
The problem of mitigating narrowband interference (NBI) due to coexistence between Digital Video Broadcasting-Terrestrial (DVB-T) and International Mobile Telecommunication-Advanced (IMT-A) system is considered. It is assumed that a spectrum of IMT-A system between 790 and 862 MHz interfere the spectrum of the OFDM signal in DVB-T band. Two types of convolutional code (CC) which are non-systematic convolutional code (NSCC) and recursive systematic convolutional code (RSCC) are proposed to mitigate NBI. The performance of the two techniques is compared under additive white Gaussian noise (AWGN) channel. It is observed that NSCC has a better bit error rate (BER) performance than RSCC. The result showed good performance for low SNR (<= 5 dB).
In this paper, we develop a soft-ware package on C ++ Builder language that consists to made a combination between chaos based spread sequence for DS-CDMA combined with covolutional code and with the discrete wavelet ...
详细信息
ISBN:
(纸本)0780387422
In this paper, we develop a soft-ware package on C ++ Builder language that consists to made a combination between chaos based spread sequence for DS-CDMA combined with covolutional code and with the discrete wavelet transform in microsatellite communication. The proposed strategy is based on tow key ideas The first concept consist the use of the chaotic spread-spectrum using discrete-time synchronization in order to minimize interference (MAI) caused by the multiple access, to assure the transmitter-receiver synchronization and to secure the transmission information. The second idea consist the use of convolutional code with Viterbi algorithm and discrete wavelet transform to decreases SNR in order to increases system capacity. The attractable soft-ware obtained can be suitably inserted as a routine code in a large soft-ware package.
暂无评论