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.
Streaming erasure codes encode a source stream to guarantee that each source packet is recovered within a fixed delay at the receiver over a burst-erasure channel. This paper introduces diversity embedded streaming erasure codes (DE-SCo), that provide a flexible trade-off between the channel quality and receiver delay. When the channel conditions are good, the source stream is recovered with a low...
For a family/sequence of Space-Time Block Codes (STBCs) C1, C2, ..., with increasing number of transmit antennas Ni, with rates Ri complex symbols per channel use, i = 1, 2,..., the asymptotic normalized rate is defined as limi→∞ Ri/Ni. A family of STBCs is said to be asymptotically-good if the asymptotic normalized rate is non-zero, i.e., when the rate scales as a nonzero fraction of the number of...
In this paper a hybrid automatic repeat request (HARQ) with turbo codes in OFDM system, and the differences hybrid ARQ methods designed for Turbo-coded transmissions on OFDM are presented. Two kinds of modified methods, one without ARQ and the other one are with HARQ: HARQ type-I and HARQ type-II. The latter scheme is based on a combination of the transmitted packets, just before the turbo-decoder...
The recent trend in Internet traffic indicates the proliferation of usage of multimedia services where a substantial part is related to some sort of video transmission. Moreover, an increasing number of Internet users employ wireless access technologies. High-quality video streaming over wireless access in unison with great mobility brings challenges to sustain the mobile user perceived video quality...
In coding theory, concatenated codes form a class of error-correcting codes that are derived by combining an inner code with an outer code. This is a solution to the problem of finding a code that has both exponentially decreasing error probability with increasing block length and polynomial-time decoding complexity. The work presented in this paper, provides link level performance analysis of non-line...
In this work, we propose a novel superposition modulated cooperative scheme for the scenario with multiple source nodes. With the proposed scheme, multiple source nodes are divided into several subsets to cooperate in a Time Division Duplexing (TDD) manner. The transmission of each node is a superimposed signal consists of its own information and the estimated data of nodes in the previous subset...
We study an online random linear network coding approach for time division duplexing (TDD) channels under Poisson arrivals. We model the system as a bulk-service queue with variable bulk size and with feedback, i.e., when a set of packets are serviced at a given time, they might be reintroduced to the queue to form part of the next service batch. We show that there is an optimal number of coded data...
This paper presents the power-performance trade off of three different cache compression algorithms. Cache compression improves performance, since the compressed data increases the effective cache capacity by reducing the cache misses. The unused memory cells can be put into sleep mode to save static power. The increased performance and saved power due to cache compression must be more than the delay...
The adoption of scalable encoders can improve P2P-TV performance in heterogeneous scenarios, where peers with different capabilities coexist. In fact, each peer could dynamically adapt the resolution of the audio/video signals to its computation capabilities and available communication resources. Despite these clear benefits, casting a scalable encoder in a P2P-TV system requires sophisticated scheduling...
This paper presents a mesh-pull peer-to-peer (P2P) live video streaming system. The proposed XOR-based Network Coding (XOR-NC) system is based on GIA protocol and introduces new search and answer data formats for chunks which are used by the network coding algorithm for exchanging data among peers. The search message contains the XORed GOP (Group of Picture) keys and some meta-data such as search...
This paper introduces a hierarchical trick play mechanism for video streaming. Trick level concept is introduced to support multiple trick rates, reduce delay when switching from high to low rate and minimize network bandwidth usage. Dedicated trick play streams on server side are created to improve user experience and reduces client processing requirement. It is efficient and easy to implementation.
A novel implementation of the N-bit Successive Approximation Register (SAR) Delay Locked Loop (DLL) is proposed with a significantly reduced hardware overhead relative to the conventional approach. The hardware overhead for the proposed 2-bit SAR scheme is only 25% of that for the conventional 2-bit SAR scheme. In this work, a complete All-Digital DLL (ADDLL) design implementing the proposed 2-bit...
The main challenge in DTNs is how to deal with path uncertainty in achieving a reliable routing scheme. All Erasure coding based routing algorithms make the assumption that the underlying path probabilities are known previously and remain constant, which is unpractical. On the other hand, the overall behavior of path probability tends to be stable with the increasing number of paths, which can be...
Many state-of-the-art lossless image compression standards feature adaptive error modelling. This, however, leads to data dependency loops of the compression scheme such that a parallel compression of neighboring pixels is not possible. In this paper, we propose a relaxation to the context update of JPEG-LS by delaying the update procedure, in order to achieve a guaranteed degree of parallelism with...
3-D monolithic integration (3DMI), also termed as sequential integration, is a potential technology for future gigascale circuits. Since the device layers are processed in sequential order, the size of the vertical contacts is similar to traditional contacts unlike in the case of parallel 3-D integration with through silicon vias (FSVs). Given the advantage of such small contacts, 3DMI supports stacking...
In this work, we propose an effective live video streaming system, which exploits path diversity over heterogeneous wireless networks. Basically, fountain code is employed to efficiently integrate multiple paths and provide the error resilience for the live video streaming of high quality. In the proposed system, the path selection algorithm is designed to maximize the target video encoding rate while...
This paper presents an optimized architecture of shared memory controller in packet processing multi-processor system on chip (MPSoC). The rotation priority algorithm in arbitration mechanism is ameliorated so that fairness of the memory access response and continuity of read/write commands are guaranteed. A `ping-pong' structure is adopted in SRAM interface logic which optimizes the memory data throughput...
This paper presents the power-performance trade off of three different cache compression algorithms. Cache compression improves performance, since the compressed data increases the effective cache capacity by reducing the cache misses. The unused memory cells can be put into sleep mode to save static power. The increased performance and saved power due to cache compression must be more than the delay...
A single-letter characterization is provided for the capacity region of finite-state multiple access channels, when the channel state is a Markov process, the transmitters have access to delayed state information, and channel state information is available at the receiver. The delays of the channel state information are assumed to be asymmetric at the transmitters. We apply the result to derive power...
In this paper we consider the multiple access channel (MAC) with partial cribbing encoders which means that each encoder obtains a deterministic function of the other encoder output, possibly with delay. The partial cribbing is especially motivated by the additive noise gaussian MAC since perfect cribbing results in the degenerated case of full cooperation between the encoders and requires an infinite...
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.