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.
Network coding (NC) is one of the promising techniques to improve network throughput towards the Shannon limit. NC has been proven to be able to achieve the max-flow min-cut bound for single source multicast networks. For multi-information-source multicast networks, however, the question of how to use NC is still to be answered. In this paper we will focus on the simple case of multi-information-source...
The prototypical brain-computer interface (BCI) algorithm translates brain activity into changes in the states of a computer program, for typing or cursor movement. Most approaches use neural decoding which learns how the user has encoded their intent in their noisy neural signals. Recent adaptive decoders for cursor movement improved BCI performance by modeling the user as a feedback controller;...
Distributed Video Coding (DVC) is a video coding paradigm where the source statistics are exploited at the decoder based on the availability of Side Information (SI). In a monoview video codec, the SI is generated by exploiting the temporal redundancy of the video, through motion estimation and compensation techniques. In a multiview scenario, the correlation between views can also be exploited to...
We consider the one helper source coding problem posed and investigated by Ahlswede, Körner, and Wyner for a class of information sources with memory. For this class of information sources we derive single letter characterization of inner and outer bounds of the admissible rate region. Our characterizations involve new auxiliary random variables. In particular, the auxiliary random variables in the...
The classical discrete memoryless network (DMN) is characterized by one channel and every node in the network incurs a delay. On the other hand, the generalized DMN can be characterized by multiple channels and some nodes in the network may incur no delay. It is well-known that the classical cut-set bound serves as an outer bound for the classical DMN, but it is not applicable to some generalized...
This paper proposes a joint turbo equalization and bit interleaved coded modulation with iterative detection-based interleave division multiple access (IDMA) technique over frequency selective fading channels. The transmission chain's parameters are optimized by using extrinsic information transfer-constrained Binary Switching Algorithm at a very low signal-to-noise power ratio range. A frequency...
In this paper we study the rate distortion trade off for source coding with side information at the decoder. This problem was posed and investigated by Wyner and Ziv. We call this problem the Wyner-Ziv source coding problem. In this paper we study the Wyner-Ziv source coding problem for a class of information sources with memory. For this class of information sources we give explicit inner and outer...
In this paper a novel region of interest (ROI) based scalable multiple description image coding technique using multiple description scalar quantizer with successive refinement (MDSQ-SR) is proposed. Visual attention model using graph based visual saliency is used to find the region of interest in the image. ROI based scalable multiple descriptions are then generated by selecting different refinement...
We design a video coding and decoding framework for multi-view video systems based on compressed sensing imaging principles. Specifically, we focus on joint decoding of independently encoded compressively-sampled multi-view video streams. We first propose a novel distributed coding/decoding architecture designed to leverage inter-view correlation through joint decoding of the received compressively-sampled...
Structured prediction has wide applications in many areas. Powerful and popular models for structured prediction have been developed. Despite the successes, they suffer from some known problems: (i) Hidden Markov models are generative models which suffer from the mismatch problem. Also it is difficult to incorporate overlapping, non-independent features into a hidden Markov model explicitly. (ii)...
In this paper, we develop an iterative multiuser joint decoding of code-division multiple-access (CDMA) signals based on a distributed optimization algorithm. For the joint decoding problem, decoding algorithm based on the turbo principle is widely used. The algorithm consists of soft-input soft-output (SISO) channel decoder and SISO multiuser detector and it can be derived as an application of the...
Multi-way relaying is a widely considered network configuration, where multiple communication nodes exchange their information via a single relay. In this configuration, a pairwise information exchange and a channel condition based node pair selection for simultaneous information transfer provide the best performance. For such schemes, the relationship between the minimum number of time slots required...
We investigate a relay network where the source and destination select one relay out of a group of untrusted relay nodes to establish a reliable and confidential connection. We assume there is no direct link between them, and the users have to employ an untrusted relay while simultaneously protecting the confidential data from it. We study joint transmit design and node selection strategies for both...
We present a survey of recent research works on multiview image compression and transmission techniques developed for Wireless Multimedia Sensor Networks (WMSNs). We classify them into two categories with respect to the coding methods adopted: (i) in-network processing with joint coding schemes, and (ii) distributed source coding schemes. The survey also includes a comprehensive evaluation of the...
This paper proposes a transmission method of compressed sensing as a source processing technology combined with network coding. In wireless sensor networks, using compressed sensing and network coding technology jointly, not only can reduce the times of packet transmission, but also improves the efficiency of data transmission and the throughput of the network. The scheme in this paper takes full...
In this paper, we consider the problem of distributed compression of correlated sources with action-dependent joint distribution. This setup is an extension of the Slepian Wolf model, but where actions taken by the encoder or the decoder and affect the generation of one of the sources. In both cases, we characterize the set of achievable rates completely, and show how the actions in the system affect...
We provide an information-theoretic analysis of reliable decoding of functions of transmitted signals for the class of binary-input discrete memoryless two-way relay channels. Two popular decoding paradigms for reliable physical layer network coding, decode-and-forward and compute-and-forward, are each suboptimal for the computation problem depending on the channel parameters. Adaptively using the...
In this paper, we derive a new outer and two inner bounds for a class of Interference Relay Channels (IRCs) which includes the Gaussian IRC as a special case. The inner bounds are based on the idea of rate-splitting at the sources with either decode-and-forward (DF) or compress-and-forward (CF) at the relay. Our main contribution lies in showing for a wide range of regimes of the Gaussian IRC that...
We consider the following primitive relay channel. A source X wants to send information to a destination Y with the help of a relay Z. The link from Z to Y is assumed to be lossless with rate R0. It is shown that destination Y's capability in simulating relay Z's observations, a function of the channel, is fundamentally linked to Z's capability in utilizing the full rate of the ZY link. A general...
An iterative Joint Source and Turbo Trellis Coded Hierarchical Modulation is introduced for robust context-aware medical image transmission. Lossless source compression as well as Quality of Service (QoS) might be considered as the main constraints in the telemedicine field. Our proposed scheme advocated was design to exploit both the joint source-and-channel iterative decoding and the cooperative...
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.