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.
A sender and receiver are connected by two links, which both pass through a burst erasure channel. The channel induces an erasure burst of length B onto both links, but the bursts are separated by d time units. Source packets arrive at the sender, and are encoded with a streaming code such that the receiver can decode with a delay T. If source packet s[t] arrives at the sender at time t, then the...
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...
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 work we consider the communication of information in the presence of a delayed adversarial jammer. In the setting under study, a sender wishes to communicate a message to a receiver by transmitting a codeword x = (x1, ..., xn) over a communication channel. The adversarial jammer can view the transmitted symbols xi one at a time, but must base its action (when changing xi) on xj for j ≤ i -...
The capacity per unit cost, or equivalently minimum cost to transmit one bit, is a well-studied quantity. It has been studied under the assumption of full synchrony between the transmitter and the receiver. In many applications, such as sensor networks, transmissions are very bursty, with small amounts of bits arriving infrequently at random times. In such scenarios, the cost of acquiring synchronization...
This paper examines ways of improving channel estimation using successive decoding for the time varying frequency selective fading channel in a point to point wireless communication system. The channel state information (CSI) is not known a priori at either the transmitter or the receiver. The paper first presents the conventional pilot-symbol aided channel estimation (PACE) scheme and then the sequential...
In this paper, the effect of the Minimum-Mean-Square Error Decision Feedback Equalizer (MMSE-DFE) when combined with decoding that is applied to the coded transmission, is studied. When the length of MMSE-DFE is large, it is more realizable to use the decoding value as the decision value. Here, the DFE using the Nordstrom-Robinson (NR) decoding value is proposed. Through simulation and by testing...
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.