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.
This paper proposes a probabilistic generative model of a sequence of vectors called the latent trajectory hidden Markov model (HMM). While a conventional HMM isonly capable of describing piecewise stationary sequences of data vectors, the proposed model is capable of describing continuously time-varying sequences of data vectors, governed by discrete hidden states. This feature is noteworthy in that...
In this paper, a new Slepian-Wolf codec was constructed with spatially coupled Low-Density Parity-Check Convolutional (SP-LDPCC) codes. The approach is based on considering the correlation as a virtual binary erasure channel (BEC) and Binary-Input Additive White Gaussian Noise (BIAWGN)channel and applying the syndrome concept. The system is focusing on the compression of a equal-probable memory less...
Brain-machine interfaces (BMIs) are human-machine integration systems that provide an interface between the brain and a machine to sense cortical neuronal activity for the purpose of restoring impaired motor tasks. In our previous work [1], an optimal design of BMIs based on artificial sensory feedback was developed using model predictive control which relied on neuronal activity in the form of spiking...
The method of typical sequences is a fundamental tool in asymptotic analyses of information theory. The conditional typicality lemma is one of the most commonly used lemmas in the method of typical sequences. Recent works have generalised the definition of typicality to general alphabets or general probability distributions. However, there is still a lack of the conditional typicality lemma based...
Emerging wireless sensor networks (WSNs) aim to overcome current needs for additional backbone infrastructure in mobile networks. Confronted with enormous requirements in terms of spectrum and energy efficiency, WSNs have been shown to benefit from distributed source coding (DSC) by means of multi-route redundancy. However, DSC in WSNs yields low performance regarding the correlation estimation of...
We study the optimization of analog joint source-channel coding schemes based on non-linear mappings for the transmission of independent Gaussian messages over the two user Gaussian Broadcast Channel (GBC). We focus on a low complexity, low delay, analog joint source channel coding communication system based on extensions of existing Nested Quantization techniques. A procedure to optimize the decoding...
The application of multiuser detection has been recently suggested as an effective solution to maximize the achievable rates in multibeam satellite systems. While the possibility of significant theoretical gains has already been proved, the question remains whether these gains can be achieved by practical schemes. In this work, we analyze the performance of coded schemes in two different transmission...
Recently a new “Colour-and-Forward” relaying strategy was proposed for the zero-error primitive relay channel, a relay channel in which the relay to destination link is out of band and of fixed, error-free capacity. This “Colour-and-Forward” scheme forwards the colour (from a minimum colouring) of the node corresponding to its received signal. This colouring is of a carefully designed graph based...
The coordination of autonomous agents is a critical issue for decentralized communication networks. Instead of transmitting information, the agents interact in a coordinated manner in order to optimize a general objective function. A target joint probability distribution is achievable if there exists a code such that the sequences of symbols are jointly typical. The empirical coordination is strongly...
This article continues the recent investigation of combinatorial joint source-channel coding. For the special case of a binary source and channel subject to distortion measured by Hamming distance, the lower (converse) bounds on achievable source distortion are improved for all values of channel noise. Operational duality between coding with bandwidth expansion factors ρ and 1 over ρ is established...
This paper offers a characterization of performance limits for classification and reconstruction of high-dimensional signals from noisy compressive measurements, in the presence of side information. We assume the signal of interest and the side information signal are drawn from a correlated mixture of distributions/components, where each component associated with a specific class label follows a Gaussian...
Consider the problem of packing Hamming balls of a given relative radius subject to the constraint that they cover any point of the ambient Hamming space with multiplicity at most L. For odd L ≥ 3 an asymptotic upper bound on the rate of any such packing is proven. The resulting bound improves the best known bound (due to Blinovsky'1986) for rates below a certain threshold. The method is a superposition...
We design low-complexity polar codes for empirical and strong coordination in two-node network. Our constructions hinge on the observation that polar codes may be used to approximate distribution; which we leverage to prove that nested polar codes achieve the capacity region of empirical coordination and strong coordination.
The problem of distributed data compression for function computation is considered, where (i) the function to be computed is not necessarily symbol-wise function and (ii) the information source has memory and may not be stationary nor ergodic. We introduce the class of smooth sources and give a sufficient condition on functions so that the achievable rate region for computing coincides with the Slepian-Wolf...
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,...
The asynchronous-communication model is studied by means of i.i.d. codes and ML decoding. A random-coding bound to the joint probability of decoding and synchronization error is determined and used to recover the region of achievable information rates and asynchrony exponents.
This paper studies likelihood decoding for channel coding over discrete memoryless channels. It is shown that the likelihood decoder recovers the same random-coding error exponents as the maximum-likelihood decoder for i.i.d. and constant-composition random codes. The role of mismatch in likelihood decoding is studied, and the notion of the mismatched likelihood decoder capacity is introduced. It...
It is well known that cooperation between users in a communication network can lead to significant performance gains relative to the same network without cooperation. One common model which has been studied recently is the two users degraded broadcast channel (BC) with cooperating decoders. It can be viewed as a special case of the relay-broadcast channel (RBC), where the link from the relay to the...
It is well-known that feedback does not increase the capacity of point-to-point memoryless channels, however, its effect in secure communications is not fully understood yet. In this work, an achievable scheme for the wiretap channel with generalized feedback -based on joint source-channel coding- is presented. This scheme recovers previous results, thus it can be seen as a generalization and unification...
The problem of mismatched decoding with an additive metric q for a discrete memoryelss channel W is addressed. Two max-min multi-letter upper bounds on the mismatch capacity Cq(W) are derived. We further prove that if the average probability of error of a sequence of codebooks converges to zero sufficiently fast, then the rate of the code-sequence is upper bounded by the “product-space” improvement...
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.