共查询到20条相似文献,搜索用时 31 毫秒
1.
《IEEE transactions on information theory / Professional Technical Group on Information Theory》1982,28(3):522-530
Some important aspects of a series of concatenated codes subjected to matrix type-B codes are investigated. Concatenated matrix codes and the concatenated quadratic residue codes especially are emphasized. An analysis of the error patterns, which can be corrected with the matrix coding, also is given. These codes are suitable for compound channels with memory (i.e., channels on which burst, cluster, and random errors occur). Explicit formulas are given for the number of bursts, cluster, and random errors that can be corrected with these codes. Decoding schemes and techniques for studying error propagation in the proposed codes are given. In particular a new decoding algorithm for a concatenated matrix code is given. The performance of coding and decoding schemes of the various types of concatenated codes can be tested in practice. 相似文献
2.
Product codes are generally used for progressive image transmission when random errors and packet loss (or burst errors) co-exist. However, the optimal rate allocation considering both component codes gives rise to high-optimization complexity. In addition, the decoding performance may be degraded quickly when the channel varies beyond the design point. In this paper, we propose a new unequal error protection (UEP) scheme for progressive image transmission by using rate-compatible punctured Turbo codes (RCPT) and cyclic redundancy check (CRC) codes only. By sophisticatedly interleaving each coded frame, the packet loss can be converted into randomly punctured bits in a Turbo code. Therefore, error control in noisy channels with different types of errors is equivalent to dealing with random bit errors only, with reduced turbo code rates. A genetic algorithm-based method is presented to further reduce the optimization complexity. This proposed method not only gives a better performance than product codes in given channel conditions but is also more robust to the channel variation. Finally, to break down the error floor of turbo decoding, we further extend the above RCPT/CRC protection to a product code scheme by adding a Reed-Solomon (RS) code across the frames. The associated rate allocation is discussed and further improvement is demonstrated. 相似文献
3.
《IEEE transactions on information theory / Professional Technical Group on Information Theory》1969,15(6):710-715
An adaptive decoding technique called burst trapping is presented to correct both random and burst errors. Two decoding algorithms are used, one for random errors, and the other for bursts. The former is based on a conventional correction technique, the latter utilizes an encoding procedure for which each information digit appears twice in the data stream, first unchanged, and second combined with (addition modulo2 ) a check digit of a widely separated later block. Whenever the number of errors within a code block are detected to be too large to correct with the random-error-correcting algorithm, the burst-correcting algorithm corrects these errors by recovering the information from later blocks where it appears in combination with check digits. It is shown that the scheme requires very limited guard space and has limited error propagation. Furthermore, the storage requirement is even smaller than the guard space. This is the only known coding system that has this desirable feature. Results of simulation of such codes over telephone channels indicate that the performance of such codes, when compared with interleaved block codes, offers better results at significantly lower cost. 相似文献
4.
针对无人机巡查区域地理环境复杂、信道特性多变、突发衰减严重的问题,设计了一种基于多元低密度奇偶校验( Q-LDPC)码的无人机测控传输系统。为减小置信传播( BP)类译码算法中振荡变量节点引入的错误传播,采用加权因子校正迭代前后的变量信息,从而减小短环对遥测、遥控等中短码字译码性能的影响,提高无人机测控传输系统可靠性。基于突发衰减信道建立系统仿真模型,仿真结果表明,所提方案通过将连续的突发比特错误转换为数量较小的符号错误,能够有效抵御快速衰落,降低误码率,为无人机对地观测提供安全保障。 相似文献
5.
《IEEE transactions on information theory / Professional Technical Group on Information Theory》1971,17(6):736-742
The burst-trapping error control technique developed by Tong [1] corrects both random and burst errors adaptively. A generalization of this scheme, called generalized burst trapping (GBT), is presented here. Generalized burst-trapping codes (GBTC) also correct both random and burst errors adaptively but, in addition, are capable of correcting random errors in the guard space following a correctable burst. This added capability is obtained at the expense of a longer guard space or a lower rate and a modest increase in complexity of implementation. Nevertheless, these codes are simple to encode and decode and, in particular, the storage-saving technique used with the original burst-trapping codes is directly applicable to the generalized codes. Also it is shown that at most one block of error propagation can occur if a simple and reasonable condition is met. Thus the generalized codes have better propagation properties than the original burst-trapping codes. This new error control technique is well suited to error correction on channels where it cannot be assumed that bursts are isolated events separated by error-free intervals. Thus, for example, this technique appears well suited to error correction on telephone facilities that incorporate multiple-level signaling. 相似文献
6.
《IEEE transactions on information theory / Professional Technical Group on Information Theory》1971,17(4):487-491
In this paper, some properties of maximum-distance separable linear codes are presented. Based on these properties, a decoding algorithm for correcting random errors is established. A simpler decoding algorithm for correcting burst errors is also given. Applying these decoding algorithms to known classes of maximum-distance separable linear codes, the amount of hardware required for implementation is only a small fraction of those required by the existing decoding algorithms. 相似文献
7.
8.
The paper introduces a method of transmitting error resilient SPIHT coded images over highly error prone Rayleigh fading channels. First, the source significance of the SPIHT coded output is obtained. Based on the significance of the bits, the channel coding is varied accordingly. Channel coding consists of a mixture of rate compatible punctured convolutional (RCPC) codes and interleaving to combat the burst errors produced by the fading channel. An additional error concealment technique is also introduced into the SPIHT decoder to improve its results in cases where errors cause the corruption of the average luminance level during decoding. Comparison with using RS block codes at a total transmission rate of 1.0 bits/pixel is carried out over fading channels with very high error rates to show the superiority of this method over methods using burst error codes 相似文献
9.
该文针对Reed-Solomon码纠错算法计算复杂度较高、运算时间较长等问题,提出一种自适应数据逐层分解的Reed-Solomon码的迭代译码纠错方法。首先,接收码通过逐层分解将随机错误或突发错误分散于不同的子序列中,缩小突发或随机错误的查找范围;其次,制定约束规则确定错误数目,同时根据不同的伴随矩阵维数自适应选择迭代求解关键方程的方法,定位子序列中误码的位置;最后,计算正确码字,结束纠错。实验测试表明,该算法在保证不漏检误码的前提下,能够有效简化计算多项式的维数,减少计算量和复杂度,纠错时效优于DFT(Discrete Fourier Transform)算法和BM(Berlekamp-Massey)算法。特别是对2维码数据的纠错测试中,与传统算法相比,该算法纠错时效可提升一个数量级。 相似文献
10.
针对无线光通信中低密度奇偶校验码(LDPC)置信传播(BP)译码算法复杂度高及置信度振荡造成译码错误等缺点,基于对数BP算法提出了一种改进的译码算法。改进的译码算法在校验节点运算时,判断输入到校验节点消息的最小值与某个门限的大小,根据比较结果,分别用消息最小值或若干个最小值进行运算,在损失很少性能的情况下降低了运算复杂度;同时在比特节点采用振荡抵消处理运算,提高了算法的性能增益。最后在对数正态分布湍流信道模型下,分别对比特充分交织和交织深度为16的情况进行了仿真实验。仿真结果表明,改进的译码算法与BP算法相比,大幅度降低了计算复杂度,而且译码性能有一定的优势,收敛速度损失很少;而相对于最小和算法,改进的算法虽然译码复杂度有所增加,但误码率性能有明显的优势,并且收敛速度也优于最小和算法。因此,改进的译码算法是无线光通信中LDPC码译码算法复杂度和性能之间一个较好的折中处理方案。 相似文献
11.
《IEEE transactions on information theory / Professional Technical Group on Information Theory》1976,22(4):454-461
We present new classes of binary codes that are constructed on the basis of concatenated codes and product codes. We discuss the random-error-correction capabilities of these codes. Some examples of the codes for the correction of random errors are given which have at least as many codewords as the best codes previously known (to the authors) with the same minimum distance and same number of check symbols. The burst-error-correction capabilities of the codes are also discussed. Several examples of the codes for the correction of both random errors and burst errors are given. A decoding algorithm for the codes is also described. 相似文献
12.
Many digital communication channels are affected by errors that tend to occur in bursts. A great deal of work has been devoted to finding good burst-error-correcting codes and developing burst-error-correcting schemes. However, burst-error-correcting codes are generally not effective for long bursts. Some burst-error-correcting schemes suffer long delay in decoding. Others are very sensitive to random errors in the guard space. Most of these schemes are not adaptive to channel conditions. A new adaptive scheme is proposed to overcome these drawbacks. The scheme employs a combination of two complementary punctured convolutional (CPC) codes. One of the codes is used for burst detection and for channel state estimation, and both codes are used for error correction. The proposed scheme is analyzed over a two state Markov chain channel model. Unlike existing burst-error-correcting schemes, it is shown that the proposed scheme is adaptive to channel conditions and less sensitive to errors in the guard space. For the same delay, the proposed scheme offers better performance than the interleaving schemes. When the channel is heavily corrupted by bursts, the improvement is even more pronounced 相似文献
13.
《IEEE transactions on information theory / Professional Technical Group on Information Theory》1976,22(4):462-468
We present new classes of binary codes that are constructed on the basis of concatenated codes and product codes. We discuss the random-error-correction capabilities of these codes. Some examples of the codes for the correction of random errors are given which have at least as many codewords as the best codes previously known (to the authors) with the same minimum distance and same number of check symbols. The burst-error-correction capabilities of the codes are also discussed. Several examples of the codes for the correction of both random errors and burst errors are given. A decoding algorithm for the codes is also described. 相似文献
14.
15.
16.
《IEEE transactions on information theory / Professional Technical Group on Information Theory》1969,15(1):152-161
The problem of error propagation in uniform codes is investigated using the concept of parity-parallelogram submatrices and the threshold-decoding algorithm. A set of optimum orthogonalization rules is presented and it is shown that if these rules are incorporated into the decoder, then sufficient conditions can be found for the return of the decoder to correct operation following a decoding error. These conditions are considerably less stringent than the requirement that the channel be completely free of errors following a decoding error. However, this is not the case if the prescribed orthogonalization rules are not followed, as is demonstrated with a simple example. It is also shown that the syndrome memory required with Massey's orthogonalization procedure for definite decoding of uniform codes is the lowest possible. The results of simulation of the ratefrac{1}{4} andfrac{1}{8} uniform codes are presented, and these codes are seen to make fewer decoding errors with feedback decoding than with definite decoding. Comparison of the performance of an ordinary feedback decoder with a genie-aided feedback decoder, which never propagates errors, indicates that error propagation with uniform codes is a minor problem if the optimum orthogonalization rules are used, but that the situation is somewhat worse with nonoptimum orthogonalization. 相似文献
17.
Viterbi decoding of binary convolutional codes on bandlimited channels exhibiting intersymbol interference is considered, and a maximum likelihood sequence estimator algorithm is derived. This algorithm might be applied either to increase the allowable data rate for a fixed power transmitter or to reduce the required power for a fixed data rate. Upper and lower bounds on the bit error rate performance of several codes are found for selected values of the ratio of information rate to channel bandwidth, and results are compared against both conventional equalization techniques and the Shannon capacity limit. Results indicate that this algorithm can provide the power saving associated with low rate (highly redundant) codes without suffering the noise enhancement of linear equalization techniques. 相似文献
18.
《Vehicular Technology, IEEE Transactions on》1978,27(3):86-98
An introduction to redundancy encoding as used in digital data communications is described. The need for redundancy is first addressed, followed by a discussion of the binary symmetric channel, burst noise channels, and the use of interleaving to randomize burst errors. The concept of redundancy is presented next, showing how it is used to supply the highest possible degree of error detection or how it can be applied to provide for the detection and correction of a lesser number of errors. The use of some codes to correct some errors and also to detect, but not correct, additional errors is discussed. The properties of block codes are developed beginning with repetition codes then covering single-parity check codes, Hamming (single-error detection) codes, and Bose-Chadhuri-Hocquenghem (BCH)codes. The basic properties and structures of these codes are emphasized with examples of implementation procedures for both encoding and decoding. 相似文献
19.
Jun Shi Wesel R.D. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2007,53(9):3066-3074
Based on random codes and typical set decoding, an alternative proof of Root and Varaiya's compound channel coding theorem for linear Gaussian channels is presented. The performance limit of codes with finite block length under a compound channel is studied through error bounds and simulation. Although the theorem promises uniform convergence of the probability of error as the block length approaches infinity, with short block lengths the performance can differ considerably for individual channels. Simulation results show that universal performance can be a practical goal as the block lengths become large. 相似文献
20.
Haslach C. Han Vinck A.J. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》1999,45(7):2339-2344
We present a simple and efficient error correction scheme for array-like data structures. We assume that the channel behaves such that each row of a received array is either error-free or corrupted by many symbol errors. Provided that row error vectors are linearly independent, the proposed decoding algorithm can correct asymptotically one erroneous row per redundant row, even without having reliability information from the channel output. This efficient decoding algorithm can be used for correction of error clusters and for decoding of concatenated codes. We also derive a random access scheme that has many similarities with the Aloha system 相似文献