The modified uniformly most powerful belief-propagation (UMP-BP) decoding algorithm is proposed. This utilises a new normalisation factor to diminish the error introduced by approximation of the soft values. The propo...
详细信息
The modified uniformly most powerful belief-propagation (UMP-BP) decoding algorithm is proposed. This utilises a new normalisation factor to diminish the error introduced by approximation of the soft values. The proposed algorithm shows better performance than the normalisation UMP-BP algorithm, and has the same complexity of implementation.
This paper presents a hardware architecture for Context-Based Adaptive Binary Arithmetic Coding (CABAC) codec in H.264/AVC main profile. The similarities between encoding algorithm and decoding algorithm are explored ...
详细信息
ISBN:
(纸本)9781424405824
This paper presents a hardware architecture for Context-Based Adaptive Binary Arithmetic Coding (CABAC) codec in H.264/AVC main profile. The similarities between encoding algorithm and decoding algorithm are explored to fulfill hardware reuse. Meanwhile, dynamic pipeline scheme is adopted to speedup the throughput. The characteristics of CABAC algorithm are utilized to reduce pipeline latency. Proposed codec design is implemented under TSMC 0. IS [uri technology. Results show that the equivalent gate counts is 33.2k when the maximum frequency is 230MHz. It is estimated that the proposed CABAC codec can process the input binary symbol at 135Mb/s for encoding and 90Mb/s for decoding.
We propose a scheme to implement lossy data compression for discrete equiprobable sources using block codes based on sparse matrices. We prove asymptotic optimality of the codes for a Hamming distortion criterion. We ...
详细信息
ISBN:
(纸本)9781424415632
We propose a scheme to implement lossy data compression for discrete equiprobable sources using block codes based on sparse matrices. We prove asymptotic optimality of the codes for a Hamming distortion criterion. We also present a suboptimal decoding algorithm, which has near optimal performance for moderate blocklengths.
Based on the research of MDS array code of size nxn in distributed storage system, in this paper, we present a novel encoding scheme called the F-code and prove that the column distance of the F-code is 3, i.e. F-code...
详细信息
ISBN:
(纸本)9783540741701
Based on the research of MDS array code of size nxn in distributed storage system, in this paper, we present a novel encoding scheme called the F-code and prove that the column distance of the F-code is 3, i.e. F-code is a MDS array code given that odd number n is greater than 3 and does not include factor 3. And we also implement a novel decoding algorithm of the F-code. The algorithm only needs two decoding chains in each linear equation group and is able to recover all unknown symbols on two erasure columns. The analysis of F-code shows that our method extends the range of number n in nxn MDS array code and gets lower/reduction algorithmic complexity. Therefore, the reliability of a distributed storage system that features the F-code can be effectively reinforced.
We present a superresolving approach that allows one to exceed the diffraction limit and recover highly resolved contours of moving targets from a sequence of low-resolution images. The presented approach is suitable ...
详细信息
We present a superresolving approach that allows one to exceed the diffraction limit and recover highly resolved contours of moving targets from a sequence of low-resolution images. The presented approach is suitable for remote sensing applications. The resolution decoding algorithm that is used to recover the highresolution features of the target can be run partially via optical means and that way can be used to reduce the required computational complexity. (c) 2006 Optical Society of America.
Two-dimensional array codes correcting rectangular burst errors are considered. We give a construction and examples of linear two-dimensional array codes correcting rectangular burst errors of size b(1) x b(2) with mi...
详细信息
Two-dimensional array codes correcting rectangular burst errors are considered. We give a construction and examples of linear two-dimensional array codes correcting rectangular burst errors of size b(1) x b(2) with minimum redundancy r = 2b(1) b(2). We present constructions of cyclic two-dimensional array codes correcting phased and arbitrary rectangular burst errors;their encoding and decoding algorithms are also given. A class of cyclic two-dimensional array codes correcting rectangular burst errors with asymptotically minimal redundancy is described. We construct a class of linear two-dimensional array codes correcting cyclic rectangular b(1) x b(2) burst errors with asymptotic excess redundancy (r) over tilde (C)(b(1), b(2)) = 2b(1) b(2) - 3.
In speech recognition, not just the accuracy of an automatic speech recognition application is important, but also its speed. However, if we want to create a real-time speech recognizer, this requirement limits the ti...
详细信息
In speech recognition, not just the accuracy of an automatic speech recognition application is important, but also its speed. However, if we want to create a real-time speech recognizer, this requirement limits the time that is spent on searching for the best hypothesis, which can even affect the recognition accuracy. Thus the applied search method plays an important role in the speech recognition task, and so does its efficiency, i. e. how quickly it finds the uttered words. To speed up this search process, various ideas are available in the literature: we can use search heuristics, multi-pass search, or apply a family of aggregation operators. In this paper we test all these methods in turn, and combine them with a set of other novel speed-up ideas. The test results confirm that all of these techniques are valuable: using combinations of them helped make the speech recognition process over 12 times faster than the basic multi-stack decoding algorithm, and almost 11 times faster than the Viterbi beam search method.
In this paper, we propose a scheme for distributed source coding that achieves any arbitrary rate on the Slepian-Wolf rate region using a single systematic LDPC code. This method is based on sending a fraction of the ...
详细信息
ISBN:
(纸本)0780389662
In this paper, we propose a scheme for distributed source coding that achieves any arbitrary rate on the Slepian-Wolf rate region using a single systematic LDPC code. This method is based on sending a fraction of the information bits along with a fraction of parity bits generated by the LDPC code. First, we study the problem of distributed source coding of two correlated sources at the symmetric rate. We propose to use non-uniform LDPC codes for this application. Then, we generalize our approach to any arbitrary rate on the Slepian-Wolf rate region. The detailed construction of this scheme is investigated. We illustrate that the design procedure for the LDPC code simplifies to the design of rate-adaptive LDPC codes that need unequal error protection. It is shown that the performance of distributed source coding at any arbitrary rate is almost the same as that of asymmetric rates. Because of the proposed decoding algorithm, each of the sources is decoded independently (only part of the information bits are being exchanged between the decoders). Therefore, this approach does not suffer from the problems of heavily damaged or propagation of the errors. This method can be easily applied to joint source-channel coding.
In this correspondence, it is proved that Hermitian code is a direct sum of concatenated Reed-Solomon codes over GF (q(2)). Based on this discovery, first, a new method for computing the dimension and tightly estimati...
详细信息
In this correspondence, it is proved that Hermitian code is a direct sum of concatenated Reed-Solomon codes over GF (q(2)). Based on this discovery, first, a new method for computing the dimension and tightly estimating the minimum distance of the Hermitian code is derived. Secondly, a new decoding algorithm, which is especially effective in dealing with burst errors with complexity O(n(5/3)), is described. Finally, some possible approaches for optimization of Hermitian codes are discussed.
暂无评论