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.
Online compression of I/O-data streams in Custom Computing Machines will enhance the effective network band-width of computing systems as well as storage bandwidth and capacity. In this paper a self-adaptive dynamic partial reconfigurable architecture for online compression is proposed. The proposed architecture will bring new possibilities in online compression due to its adaptivity to dynamic environments...
In a distributed video coding problem, use of a correct model for the correlation noise plays a significant role in improving the decoding performance and consequently in providing higher coding efficiency. In this work, we first study the predictive and additive correlation noise models at the DCT coefficient band level for transform-domain distributed video coding. Then, bounds on compression rates...
Encoding a sequence of independent symbols over a large alphabet size is a challenging problem with applications in many fields. The most widely used adaptive entropy coding techniques (namely, arithmetic and Huffman coding) are known to achieve an average codeword length which may be significantly greater than the empirical entropy of the sequence, as the alphabet size increases. In this work we...
Multichannel elctrocardiogram (MECG) signals are correlated both in spatial domain as well as in temporal domain and this correlation is stronger at multiscale levels (Fig. 1). To exploit this correlation in compressed sensing (CS) based ECG tele-monitoring systems, a joint multiscale compressed sensing (JMCS) technique is proposed in this work. CS is a novel signal acquisition/reconstruction paradigm...
In this paper, we investigate how to adapt a composite decode-forward (DF) two-way relaying scheme to fading links. We develop a maximum entropy (ME) quantization algorithm to feed back the link magnitudes such that the transmitters are able to perform link adaptation. The ME algorithm outperforms that of Lloyd-Max in mid and high range SNR, and performs comparably at low SNR. With just one bit of...
There has been long-standing interest in constructing reliable memory systems from unreliable components like noisy bit-cells and noisy logic gates, under circuit complexity constraints. Prior work has focused exclusively on constructive achievability results, but here we develop converse theorems for this problem for the first time. The basic technique relies on entropy production/dissipation arguments...
Emerging applications including semantic information processing impose priorities on the possible realizations of information sources, so that not all source sequences are important. This paper proposes an initial framework for optimal lossless compression of subsets of the output of a discrete memoryless source (DMS). It turns out that, the optimal source code may not index the conventional source-typical...
Guesswork is the position at which a random string drawn from a given probability distribution appears in the list of strings ordered from the most likely to the least likely. We define the tilt operation on probability distributions and show that it parametrizes an exponential family of distributions, which we refer to as the tilted family of the source. We prove that two sources result in the same...
We consider a distributed parameter estimation problem, in which multiple terminals send messages related to their local observations using limited rates to a fusion center who will obtain an estimate of a parameter related to observations of all terminals. It is well known that if the transmission rates are in the Slepian-Wolf region, the fusion center can fully recover all observations and hence...
In this paper we consider regular low-density parity-check codes over a binary-symmetric channel in the decoding regime. We prove that up to a certain noise threshold the bit-error probability of the bit-sampling decoder converges in mean to zero over the code ensemble and the channel realizations. To arrive at this result we show that the bit-error probability of the sampling decoder is equal to...
The extension of Decode-and-Forward (DF) relaying by lossy forwarding has the potential to ensure a reliable multi-hop message transport in wireless mesh networks. Unlike in conventional DF relaying, with lossy forwarding a relay forwards a message regardless whether errors have been detected after decoding. At the destination, a proper joint decoding technique exploits the high correlation of messages...
Reversible watermarking (RW) is one of the best possible solutions for content authentication of a digital data. In RW the decoder may recover the hidden and original information losslessly. Existing works suggest that prediction error expansion (PEE) based RW scheme ensures higher embedding capacity with low imperceptibility. In general, PEE based RW schemes use a single predictor. But this is seen...
High Efficiency Video Coding (HEVC) is becoming more and more important in current consumer application platforms. Compared with H264 standard, it can reach up to 8192×4320 resolutions at 120fps. To accelerate HEVC decoding processing, this paper presents an efficient hardware entropy decoding architecture, Entropy decoding includes Colomb and CABAC decoding. Hierarchy ring buffer is designed to storage...
In the communication of source-coded messages, certain dependency structures often exist among the messages, where a source model is proposed to model arbitrary dependency structure of such kind. Under a message-dependency model, the problem of communicating dependent messages subject to certain delay constraint is formulated as the problem of maximizing the average utility at the receiver. In this...
We study classical source coding with quantum side-information where the quantum side-information is observed by a helper and sent to the decoder via a classical channel. We derive a single-letter characterization of the achievable rate region for this problem. The direct part of our result is proved via the measurement compression theory by Winter. Our result reveals that a helper's scheme that separately...
This paper studies the problem of secure communication over broadcast channels under the lens of individual secrecy constraints (i.e., information leakage from each message to an eavesdropper is made vanishing). It is known that, for the communication over the degraded broadcast channels, the stronger receiver is able to decode the message of the weaker receiver. In the individual secrecy setting,...
We consider the model of random binning and finite-temperature (FT) decoding for Slepian-Wolf (SW) codes, from a statistical-mechanical perspective. While ordinary random channel coding is intimately related to the random energy model (REM) in statistical mechanics, it turns out that random binning (for SW coding) is analogous to another, related statistical mechanical model, which we call the random...
We study the secrecy of a distributed-storage system for passwords. The encoder, Alice, observes a length-n password and describes it using δ s-bit hints, which she stores in different locations. The legitimate receiver, Bob, observes ν of those hints. In one scenario we require that the expected number of guesses it takes Bob to guess the password approach 1 as n tends to infinity, and in the other...
Consider an energy-harvesting receiver that uses the same received signal both for decoding information and for harvesting energy to power its circuitry. When the receiver has limited battery size, a signal with bursty energy content may cause power outage since the battery will drain during intervals with low signal energy. The energy content in the signal may be regularized by requiring that sufficient...
Entropy coding is an integral part of most data compression systems. Huffman coding (HC) and arithmetic coding (AC) are two of the most widely used coding methods. HC can process a large symbol alphabet at each step allowing for fast encoding and decoding. However, HC typically provides suboptimal data rates due to its inherent approximation of symbol probabilities to powers of 1 over 2. In contrast,...
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.