The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Two polar coding schemes are proposed for the degraded broadcast channel under different reliability and secrecy requirements. In these settings, the transmitter wishes to send multiple messages to a set of legitimate receivers keeping them masked from a set of eavesdroppers, and individual channels are assumed to gradually degrade in such a way that each legitimate receiver has a better channel than...
The problem of distributed function computation for the class of smooth sources is studied, where functions to be computed are compositions of symbol-wise functions and some outer functions that are not symbol-wise. The optimal rate for computing those functions is characterized in terms of the Slepian-Wolf rate and an equivalence class of sources induced by functions. To prove the result, a new method...
The problem of one-way file synchronization from the client to the data-center, namely, file updates, is studied. The problem is investigated in particular when an old version of a file which can be available at both client and data-center, is edited by the client to a new version. The edits are modeled as random insertions and deletions (InDels). Based on the updated and the previous version of the...
In-situ timing error detection and correction mechanisms (such as Razor) monitor the performance of actual datapaths, and are believed more resilient in adaptive voltage scaling (AVS) systems, especially when considering local variations. However, Razor has serious hold time problems, of which the overwhelming buffer padding makes it infeasible in advanced process technologies. Pre-error (or in-situ...
Distributed storage systems need to guarantee reliable access to stored data. Resilience to node failures can be increased by using erasure encoding. A variety of erasure codes are discussed in literature and implemented in practice. This multiplicity of codes puts a heavy burden on existing systems. In scenarios such as multi-cloud file delivery or migration of data to a new erasure code, the ability...
This paper is concerned with the coded orthogonal frequency division multiplexing (OFDM) with index modulation (IM) for highly mobile wireless communication based on block Markov superposition transmission (BMST). In the OFDM-IM scheme, the information bits are not only mapped into the conventional two-dimensional signal points but also into the indices of the subcarriers. For the coded IM system,...
The article considers the optimal transmission of stochastic processes through continuous-discrete memory channels with noiseless feedback. The extreme properties of optimal coding in terms of information amount maximization are proved.
The article examines the optimal transmission of stochastic processes with delay through the continuous-discrete channels. The extreme properties of optimal coding in terms of information amount maximization are proved.
Power control policies in the fading multiple-access channels (MAC) with quality of service (QoS) constraints and random arrivals are studied. Perfect channel side information (CSI) is assumed to be available at both the transmitters and the receiver. Two types of Markovian sources, namely discrete Markov source and Markov fluid source, are considered. The maximum average arrival rates that can be...
Telemetry systems suffer from inter-system interference due to other technologies competing for the shared unlicensed ISM/SRD band. The resultant collisions could have a profound impact on the underlying BLER performance of telemetry systems. A telegram splitting approach has been recently proposed in the literature that suggests splitting transmitted telemetry blocks into multiple telegrams and transmitting...
We consider the optimum transmit scheduling problem for a two user energy harvesting cooperative multiple access channel. We assume a slotted model where energy harvests in each slot are known a priori. We propose a delay tolerant cooperation model: the transmitters create common information in a given slot, but need not cooperatively send the created common information immediately; they may relegate...
An information-theoretic lower bound is developed for the caching system studied by Maddah-Ali and Niesen. By comparing the proposed lower bound with the decentralized coded caching scheme of Maddah-Ali and Niesen, the optimal memory-rate tradeoff is characterized to within a multiplicative gap of 4.7 for the worst case, improving the previous analytical gap of 12. Furthermore, for the case when users'...
In this paper, a novel Joint Source-Channel Coding scheme based on Irregular Repeat-Accumulate codec is proposed for the transmission of Hidden Markov Source in AWGN scenarios. The encoder structure of the scheme consists of two units, one for source assign and another for encode. The simulation results demonstrate that the proposed scheme have better compression performance than the traditional code...
With the growing popularity of mobile applications such as voice over IP (VoIP) and real-time conversational video, and due to the scarcity of the available radio spectrum, increasing the spectral efficiency of wireless systems under quality of service (QoS) constraints becomes increasingly important. Accordingly, in this paper we investigate the maximum achievable rate of incremental redundancy type...
This paper presents a new innovation network architecture for the analytical model by the integration which challenges both fountain code and Markov chain modeling to improve the throughput performance for ideal channel conditions. In this context, the collision result in corrupted packets and the following MAC layer retransmissions consume extra energy. Channel contention is a serious problem in...
Given a private source of information, Xn and a public correlated source, Yn, we study the problem of encoding the two-dimensional source (Xn; Yn) into an index J such that a remote party, knowing J and some external side information Zn, can losslessly recover Yn while any eavesdropper knowing J and possibly a correlated side information En can retrieve very little information about Xn. We give general...
When transmitting information over a noisy channel, two approaches are common: assuming the channel errors are independent of the transmitted content and devising an error-correcting code, or assuming the errors are data dependent and devising a constrained-coding scheme that eliminates all offending data patterns. In this paper we analyze a middle road, which we call a semiconstrained system. In...
Several new expressions for the anytime capacity of Sahai and Mitter are presented for a time-varying rate-limited channel with noiseless output feedback. These follow from a parametric characterization obtained in the case of Markov channels, and include an explicit formula for the r-bit Markov erasure channel, as well as formulas for memoryless rate processes including Binomial, Poisson, and Geometric...
This paper reexamines the decoding problem for a distributed Turbo code (DTC) over a 3-node relay network applying the decode-and-forward strategy under the half-duplex constraint. The conventional decoder simply assumes that the relay performs error-free decoding. In practice, unsuccessful decoding at the relay causes error propagation, which may become a performance bottleneck. Improved decoders...
A single-letter lower bound on the sum rate of multiple description coding with tree-structured distortion constraints is established and is shown to be tight in the quadratic Gaussian case.
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.