The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper, we propose an adaptive cluster-centric small cell network with cooperative caching and transmission design, in which small base stations (SBSs) are grouped into disjoint clusters and in-cluster cache space is utilized as an entity. We design a combined caching scheme where part of the available cache space is reserved for caching the most popular content in every SBS, while the remaining...
The entropy decoder proposed in this paper was implemented in VLSI (65nm process). It supports video decoding algorithms for three most popular video standards, H.264, AVS and MPEG-2. The decoding modules of H.264, AVS and MPEG-2 have some shared components, which greatly reduces the cost of hardware resources. Verification results showed that when exploiting a 200MHz working frequency, the entropy...
The computational complexity of H.264 video coding standard is two or three times higher than that of H.263 and MPEG-4. Especially, the operations of the entropy coding and deblocking filter are the most complex parts in the decoder. In order to reduce the computational complexity of these operations, we propose a fast algorithm for H.264 decoder implementation, which containing a group-based CAVLC...
A method of rapid secret sharing scheme based on STAR codes is proposed. Due to the characteristic of array codes such as STAR codes, the computation in secret sharing scheme need only XOR operation on GF(2), which is distinguished with the modulation and other complex operation on GF(q) in the traditional schemes. Thus, it's more rapid and suitable for large capacity secret sharing, and also appropriate...
We present a new class of erasure codes of size ntimesn (n is a prime number) called T-code, a new family of simple, highly fault tolerant XOR-based erasure codes for storage systems (with fault tolerance up to 15). T-code is not maximum distance separable (MDS), but has many other advantages, such as high fault tolerance, simple computability, and high efficiency of coding and decoding. Because of...
Notice of Violation of IEEE Publication Principles"Exploring Fault-tolerant Distributed Storage System using GE code"by Zheng Chen, Xiaojing Wang, Yili Jin, Honglei Zhouin the Proceedings of the 2008 International Conference on Embedded Software and Systems, July 2008, pp. 142-148After careful and considered review of the content and authorship of this paper by a duly constituted expert...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.