Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
With the rapid growth of content-based network services, there is increasing interest in reducing the emissions associated with brown-energy consumption in Content Delivery Networks (CDNs). At the same time, content needs to be placed in safe Data Center (DC) locations, which are unlikely to be hit by disasters. Further risk reduction is achieved using content replication which provides inter-DC content...
Encoding a sequence of independent symbols over a large alphabet size is a challenging problem with applications in many fields. The most widely used adaptive entropy coding techniques (namely, arithmetic and Huffman coding) are known to achieve an average codeword length which may be significantly greater than the empirical entropy of the sequence, as the alphabet size increases. In this work we...
Error detection and correction techniques are used to accomplish reliable data transmission through a communication channel. Redundant Residue Number System (RRNS) is a type of number system in which the arithmetic operations are carry free, so errors do not propagate from one residue to other. This paper analyses the performance of burst error correction algorithm using RRNS code and is compared...
The key problem in photo album compression is how to exploit the correlation among the images. In this paper, we propose a novel incremental structure from motion (SfM) based prediction method for lossless photo album compression. Unlike the previous methods, we exploit the redundancy among images through their inherent geometric relationship generated by SfM. Based on the point cloud and camera poses,...
The bit recycling compression technique has been introduced to minimize the redundancy caused by the multiplicity of encodings present in many compression techniques. It has achieved about 9% as a reduction in the size of the files compressed by Gzip. In prior work, we have proposed an arbitrary-precision technique to adapt bit recycling to arithmetic code instead of Huffman code. We have shown that...
Fractal compression is a lossy compression method for digital images based on fractals rather than pixels, which are best suited for textures and natural images. It works on self- similarity property in various fractions of images, relying on the fact that parts of an image often resemble other parts of the same image. It takes long encoding time and affects the image quality. This paper introduces...
Centralised management of distributed systems require a significant amount of monitoring traffic to maintain an accurate view of the system global state. The communication overhead of these systems becomes a bottleneck as the number of processing elements in the network and workload increase. State-of-the art in decentralised resource management techniques address this issue by allowing individual...
To achieve high compression efficiency, traditional video coding standards like H.264/AVC usually use entropy coding and prediction coding. As a result, a single channel error may lead to artifacts in decoding the following bitstream and even affect the following frames, which will deteriorate the video quality greatly. A robust video decoding method called the iterative verification decoding (IVD)...
One of the most calculation intensive operations for a 100 Gbps wireless packet processing is a forward error correction (FEC). We are using standard field programmable gate arrays (FPGAs) to prepare a data link layer demonstrator. Therefore, we need to find a high-parallelized FEC structure for our device. The difficulty is to design the 100 Gbps FEC engine that can be realized in an FPGA. In one...
This paper studies defect memory cells and in particular partially stuck-at memory cells, which occur when charge is trapped in multi-level cells of non-volatile memories such as flash memories. If a cell can store the q levels 0, 1, …, q − 1, we say that it is partially stuck-at level s, where 1 ≤ s ≤ q − 1, if it can only store values which are at least s. We follow the common setup where the encoder...
In spite of recent progress of the wireless communication technology, the high bit error rate always restrains its better transmission efficiency. Especially, the errors in protocol header would incur the discard of valid information in the check-failure packets. In order to improve the utilization of transmitted data, an iterative header recovery scheme between two associated layers is proposed in...
It is widely believed that future small-cell unmanaged wireless networks will be dominated by interference caused by packet collisions and not by signal-to-noise issues. In such a network, a large fraction of the collisions are caused by hidden terminals. Here we present the design and evaluation of RoXOR, a system that can effectively combat random collisions caused by bursty traffic from hidden...
Tunstall proposed an efficient algorithm for constructing the optimal dictionary of any particular size to obtain a variable-to-fixed code. More accurately, the algorithm constructs the optimal uniquely parsable dictionary. In fact, Savari showed that, if one allows herself to consider plurally parsable dictionaries, better codes may be constructed. Savari found a class of plurally parsable dictionaries...
The rapid growth of video in wireless networks is a crucial issue to be addressed by content providers. Nowadays, an emerging and promising trend is the development of solutions aimed at maximizing the quality of experience (QoE) of end users. However, the prediction of the QoE perceived by users in different conditions remains a major challenge. In this paper, we propose a two-layer hierarchical...
Separating redundancy, proposed by Abdel-Ghaffar and Weber, is an important concept in the analysis of the error and erasure decoding of a linear block code using a parity-check matrix of the code. In this paper, we investigate the second and third separating redundancies of extended Hamming codes. For an extended Hamming code, we establish two binary integer linear program problems, the optima of...
Multiport switches are commonly used as data processing and routing devices in computer networks. A network switch routes data packets between its multiple input and output ports. Packets from input ports are stored upon arrival in a switch fabric comprising multiple memory banks. This can lead to memory contention when distinct output ports request packets from the same memory bank, resulting in...
This paper constructs WOM codes that combine rewriting and error correction for mitigating the reliability and the endurance problems in flash memory.We consider a rewriting model that is of practical interest to flash applications where only the second write uses WOM codes. Our WOM code construction is based on binary erasure quantization with LDGM codes, where the rewriting uses message passing...
Fire codes are cyclic codes generated by the product of two polynomials: a binomial that characterizes the code's guaranteed burst correcting capability and an irreducible polynomial that characterizes the code length. However, the true burst correcting capability of a Fire code may exceed its guaranteed burst correcting capability. The true burst correcting capability of primitive Fire codes, in...
Nowadays the need for fast and reliable communication is increasing, which leads us to look for new ways to enhance channel coding. In this paper, we will study the case of a distributed coding between two users that aim to transmit data to a common destination, where each user transmits a partial redundancy to the destination, and relies on the second user for the remaining. The purpose of distributing...
DRAM industry faces a grand challenge on continuing the scaling of storage node aspect ratio (A/R) to maintain the storage node storage capacitance. One viable option is to intentionally slow down the A/R scaling at the penalty of irreparable weak cells that cannot guarantee target data retention time under worst-case scenarios, and compensate the weak-cell- induced memory errors at the system level...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.