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.
One of the most powerful ways to achieve transmission reliability over wireless links is to employ efficient coding techniques. This paper investigates the performance of a transmission over a relay channel where information is protected by two layers of coding. In the first layer, transmission reliability is ensured by fountain coding at the source. The second layer incorporates network coding at...
In this paper, two novel decoding methods are designed for two kinds of rateless codes: binary deterministic rateless (BDRC) codes and LT codes. The traditional decoding algorithms for the two kinds of codes discard the erroneous packets that may only contain few erroneous bits, which will causes the waste of bandwidth. The novel decoding methods adopt the packet combining technology to find the positions...
Cloud storage systems commonly use replication of stored data sets to ensure high reliability and availability. However, the high storage overhead of replication becomes increasingly unacceptable with the explosive growth of data stored in cloud. Some cloud storage systems have attempted to replace replication with erasure coding to reduce storage overhead, that is just the thinking behind Cloud RAID...
In this paper we present a hybrid discrete Particle Swarm Optimization (PSO) algorithm for the Mobile Network Deployment Problem (MNDP). First, we fully describe the MNDP, including a term for taking into account the Electromagnetic field produced by new locations of BTSs. We also describe the proposed PSO algorithm and some variations incorporated in order to cope with discrete search spaces, such...
Page-based software Distributed Shared Memory (sDSM) systems suffer from their high memory consistency costs. Utilizing an effective prefetch technique can reduce this overhead. However, it is hard to predict accurately for applications exhibiting dynamic memory accessing and paging behavior. In this paper, we use Intel Cluster OpenMP (CLOMP) to study this problem. First, we present a stride augmented...
This thesis proposed 8-bit parallel CRC-32 in order to meet the high throughput of USB3.0. The highest speed of USB3.0 reaches 5G bps. Firstly, we researched the Data Packet structure and the principles of the CRC-32 in the USB3.0 Specification. Secondly, deduced the equation of the 8-bit input data and the CRC-32. Finally, implemented the CRC-32 coding and decoding by the verilog HDL, verified the...
Fractal image coding method is a novel compression method, in which the local self-similarity of the image is used to eliminate cross-scale redundancy existing in image data. It receives wide academic attention with its innovative idea, high compression ratio, high decoding speed, independent resolution etc. however, for the encoding time and quality of decoding needs to be improved, there have been...
In this paper we present the design of an on-lineadder dealing with two RBCD numbers. This basic elementis intended to be be used in any on-line system in which theaddition is involved. We obtain the on-line adder by serializa-tion of a recent parallel RBCD adder with minimum latency.To reduce the cycle time a pipelined version is proposed. Todeal with data stream the throughput has been reduced toits...
In this paper, the fractal Image Compression technique proposed by Jacquin is investigated for 24 bits/pixel color image with some improvements introduce on the IFS matching stage. One of them is using stopping search condition (e ) when monitoring the minimum matching error. This will reduce the required long fractal coding time. The other is using the domain block position index (PosI) instead of...
The dynamics of a class of recurrent neural networks with uniform constant external input is investigated in this paper. Nowadays, continuous attractors have been recognized as promising model for describing the encoding of continuous stimuli in neural networks. The existence of the continuous attractors depends on a lot of factors such as connection wight and the external input and so on. The external...
We investigate the wavelet-based scalable video coding problem and present a solution that takes account of each user's preferred resolution. Based on the preference, we formulate the bit allocation problem of wavelet-based scalable video coding. We propose three methods to solve the problem. The first is an efficient Lagrangian-based method that solves the upper bound of the problem optimally, and...
Multiple description coding (MDC) can be applied for multipath communication to reduce the negative affect of packet loss, and it is composed of three processes: encoding, quantizing, and decoding. Encoding and decoding are well researched in MDC, but there are few researches that focus on the quantization process. Therefore, this paper focuses on the quantization process of MDC. The aim of this paper...
Video calling incurs very high power consumption on mobile platforms usually powered by capacity-constrained batteries. To remedy this problem, we develop a cross-layer energy-aware optimization framework to reduce CPU energy consumption for mobile video calls. We explore the texture similarity between neighboring macro blocks during H.264 coding and control the quality-complexity tradeoff with a...
Computational Fluid Dynamics simulations require an enormous computational effort if a physically reasonable accuracy should be reached. Therefore, a parallel implementation is inevitable. This paper describes the basics of our implemented fluid solver with a special aspect on the hierarchical data structure, unique cell and grid identification, and the neighbourhood relations in-between grids on...
In this paper, we propose a simple loss less algorithm which can compress all types of images with the same high Compression Rate. The algorithm consists of two phases. First, it removes the correlation between pixels with Snake Scan to get residual of data. And then encode the residual of data with an Adaptive Arithmetic Coding. This Adaptive Arithmetic Coding only uses adjacent data to build the...
Cloud computing is quickly becoming the infrastructure of choice for hosting data and software solutions for many individuals, businesses, and governmental organizations. While such systems may provide increased flexibility and utility, efficient and easily-managed cloud storage solutions that ensure data confidentiality are needed to maintain this trend. In this work, we propose an algebraic-based...
With the advances in mobile technologies, smart mobile computing devices have become increasingly affordable and powerful, leading to a significant growth in both the number of advanced mobile users and their bandwidth demands. Moreover multimedia streaming to these high-end mobile devices has become widespread. However, multimedia applications are known to be resource-hungry and in order to cope...
It was recently shown that the reverse carpooling technique can realize the benefits of network coding while requiring only a simple coding scheme that can be efficiently implemented in practice. However, when no opportunity for coding exists at an intermediate (relay) node, it needs to decide whether to transmit an uncoded packet or wait for the next opportunity to create a coded packet. While the...
We consider single-hop broadcast packet erasure channels (BPEC) with degraded message sets and instantaneous feedback regularly available from all receivers, and demonstrate that the main principles of the virtual-queue-based algorithms in [1], which were proposed for multiple unicast sessions, can still be applied to this setting and lead to capacity-achieving algorithms. Specifically, we propose...
A fast particle swarm optimization method for the multidimensional knapsack problem is presented. In this approach the potential solutions are represented by vectors of real values; the dimension of each vector corresponds to the number of constraints of the problem rather than the number of items. Each of these values measures the significance of the corresponding constraint and, together with the...
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.