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.
Underwater acoustic sensor networks are characterized by limited transmit power and bandwidth, and a harsh communication environment. Different techniques for reliable communication in underwater networks have been studied in the literature at different layers of the network protocol stack. Among these, the use of fountain codes as a way for improving the quality of the communication over a highly...
Multiple Cell Upsets (MCUs) induced by ionizing radiation in memories are becoming more likely to happen due to the continuous technology scaling down. Error Correction Codes (ECCs) are applied for recovering the stored information into its original state providing reliable computer systems. Several ECC are able to deal with MCUs, however, the higher the robustness of an ECC, more area, and energy...
In this paper, we study the tradeoff of efficiency and delay of Slepian-Wolf distributed source coding (DSC). In the considered network, Machine-Type Communications (MTC) devices transmit correlated data to one base station, the data sources follow a multi-variate Gaussian distribution. To reduce the consumption of communication resources by massive MTC devices, Slepian-Wolf coding is adopted to eliminate...
Dual Connectivity(DC) is one of the key technologies standardized in Release 12 of the 3GPP specifications for the Long Term Evolution (LTE) network. It attempts to increase the per-user throughput by allowing the user equipment (UE) to maintain connections with the MeNB (master eNB) and SeNB (secondary eNB) simultaneously, which are inter-connected via non-ideal backhaul. In this paper, we focus...
In this paper we introduce and evaluate Haar based codec assisted medium and long range data transport structures, e.g., bus segments, Network on Chip interconnects, able to deal with technology scaling related phenomena (e.g., increased susceptibility to proximity coupling noise and transmission delay variability), targeting energy savings at the expense of a reasonably small overhead, i.e., 1 extra...
Ste gano graphic systems are used for the transmission of hidden data in the original signal. The article describes the algorithm of the hidden data transmission using the speech signal as a carrier. The echo method is used for data embedding. In order to improve the decoding efficiency of embedded data, the procedure of voicing correction and mechanism of informed coding were developed and implemented...
Although, it was shown that NC is a promising technique to improve the throughput; especially for multicast environment; it also bears negative side-effects (e.g., high decoding delay). Since streaming video are usually subject to strict delay constraints, high decoding delay must be resolved to enhance the performance of the NC schemes. To overcome this issue, this paper presents a new scheme named...
Viterbi detectors are widely used in data recording channels in the timing loop as well as in the digital back end before error-correction decoding to detect data in the presence of inter-symbol interference (ISI) and noise. Further, soft reliability values assist in the decoding of outer codes. The state-of-the-art implementations of the Viterbi algorithm are synchronous which consider the ‘worst-case’...
In this paper, a high speed digital excess loop delay (ELD) compensation scheme with hybrid thermometer coding is proposed. In this high speed compensation, the time constraint of the DAC feedback route is shifted to the one clock compensation path. Also, the method to deal with the signal overflows the quantizer's range is analyzed. Compared to other digital ELD compensations, this scheme features...
The inherent nature of polar codes being channel specific makes it difficult to use them in a setting where the communication channel changes with time. In particular, to be able to use polar codes in a wireless scenario, varying attenuation due to fading needs to be mitigated. To the best of our knowledge, there has been no comprehensive work in this direction thus far. In this work, a practical...
Belief propagation (BP) polar code decoder is well-studied from many aspects. This study proposes a hardware optimization to improve performance of polar BP decoder by modifying both processing element (PE) and early stopping criterion (ESC). PE is optimized by using high-speed parallel-prefix Ling adder instead of carry ripple adder and WIB ESC introduced in literature is optimized by removing unnecessary...
In this paper, we address the need for motivating applications, such as mission critical industrial control and medical applications, to operate under the Ultra-Reliable Communication (URC) mode in the future 5th Generation (5G) cellular wireless networks, while also under strict Quality of Service (QoS) constraints such as ultra-low latency. Reliability has been shown to improve by using Hybrid Automatic...
A broadcast strategy for multiple access communication over slowly fading channels is introduced, in which the channel state information is known to only the receiver. In this strategy, the transmitters split their information streams into multiple independent information layers, each adapted to a specific actual channel realization. The major distinction between the proposed strategy and the existing...
This paper Introduces the discrete memoryless multiple access wiretap channel with noiseless cribbing, where the cribbing may be either causal or strictly causal. We derive lower bounds for secrecy rates for both causal and strictly causal cribbing under either a decode-forward or partial-decode-forward strategy. Our results recover the achievable rate regions of the MAC wiretap and MAC with cribbing,...
Binary AIFV codes, which can attain better compression rate than Huffman codes, uses two code trees that may have incomplete internal nodes, and source symbols are assigned to some internal nodes in addition to leaves. Although the code trees of Huffman codes, which are full binary trees, are well studied, the AIFV code trees have not been yet studied in detail. In this paper, we show that there exists...
The capacity region of 1-to-K broadcast packet erasure channels with ACK/NACK is known for some scenarios, e.g., K ≤ 3, etc. However, existing achievability schemes either require knowing the target rate R in advance, and/or have a complicated description of the achievable rate region that is difficult prove whether it matches the capacity or not. This work proposes a new network coding protocol with...
The end-to-end delay of streaming source coding is characterized by an age of information (AoI) metric that measures the number of symbol periods the decoder output lags behind the encoder input. The source encoder receives input source symbols one per unit time and sequentially outputs binary codewords to a constant rate channel that transmits bits to the decoder. We examine a system in which knowledge...
We study a setting where two source streams with different decoding deadlines must be transmitted over a burst erasure channel. The source streams are multiplexed into a single stream of channel-packets at the encoder and transmitted over a packet erasure channel. The decoder must recover the source-packets within each stream sequentially, by their corresponding deadlines. We consider the burst-erasure...
We consider a delay-constrained streaming model for zero-error communications and show that under this model, network coding and index coding problems are code equivalent. That is, any streaming network coding instance can be efficiently mapped to a corresponding acyclic streaming index coding instance such that an index code for the latter can be efficiently transformed into a network code for the...
This paper is concerned with block Markov super-position transmission of BCH (BMST-BCH) codes. Compared with other BMST codes, BMST-BCH codes can achieve a lower error floor with an encoding memory of two, which is critical to reduce both delay and implementation complexity. To further reduce the implementation complexity, we propose a hard-decision sliding-window decoding algorithm, in which only...
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.