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 work is motivated by a distributed compressed sensing (DCS) scenario where multiple sensors independently perform compressed sensing and the sparse signals share a common support. The heterogeneous case is considered where the numbers of measurements and the noise levels at different sensors may be different. To analyse the performance, we focus on a probability model for sparse signals and use...
This paper provides a universal framework for establishing one-shot achievability results for coordination and secrecy problems. The framework is built on our previous framework [Yassaee et al. 13] for proving one-shot achievability results in the context of source and channel coding problems. In the coordination and secrecy problems, one needs to compare an induced distribution by encoding/decoding...
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...
This work investigates the Multicast Cognitive Interference Channel (CIFC) where many secondary users are interested in the same cognitive message. The focus is to study the role that Multiple Description (MD) coding can play under simultaneous transmissions. Though for the very weak, very strong, and mixed very weak/strong interference regimes, resorting to a Common Description (CD) alone is capacity...
The distributed binary hypothesis testing problem with communication and security constraints is investigated. A legitimate statistician (referred to as Bob) is interested in detecting the joint probability distribution of two remotely located sources. To this end, Bob has access to analog and coded data where the later is observed at another node (referred to as Alice) and communicated over a public...
A distributed hypothesis testing (HT) problem is considered, comprising two nodes and a unidirectional communication link. The receiving node is required to make a decision as to the probability distribution in effect. A binning process is used in order to minimize the probability of error, resulting in a new achievable error-exponent. A sub-class of HT problems with general hypotheses is defined,...
This paper addresses a coordination problem between two agents (Agents 1 and 2) in the presence of a noisy communication channel which depends on an external system state {x0,t}. The channel takes as inputs both agents' actions, {x1,t} and {x2,t} and produces outputs that are observed strictly causally at Agent 2 but not at Agent 1. The system state is available either causally or non-causally at...
We study co-primary spectrum sharing concept in two small cell multiuser network. Downlink transmission is explored with Rayleigh fading in interfering broadcast channel. Both base stations and all the users are equipped with multiple antennas. Resource allocation with joint precoder and decoder design is proposed for weighted sum rate (WSR) maximization problem. The problem becomes mixed-integer...
This paper studies the individual secrecy capacity region of the broadcast channel with receiver side information. First, an achievable rate region is established for the discrete memoryless case by employing superposition coding. Further, it is extended to the corresponding Gaussian case, where the individual secrecy capacity region is characterized in case of a weak or strong eavesdropper (compared...
In a joint source-channel coding scheme, a single mapping is used to perform both the tasks of data compression and channel coding in a combined way, rather than performing them separately. Usually for simple iid sources and channels, separation of the tasks is information theoretically optimal. In an adversarial joint source-channel coding scenario, instead of a stochastic channel, an adversary introduces...
The problem of simultaneously generating two keys for a cellular model is investigated, in which each of four terminals, X0, X1, X2, and X3 observes one component of correlated sources. The terminal X0 wishes to generate secret keys K1 and K2 respectively, with terminals X1 and X2 under the help of terminal X3. They are allowed to communicate over a public channel. Both K1 and K2 are required to be...
A packing lemma is proved using a setting where the channel is a binary-input discrete memoryless channel (X,w(y|x),Y ), the code is selected at random subject to parity-check constraints, and the decoder is a joint typicality decoder. The ensemble is characterized by (i) a pair of fixed parameters (H,q) where H is a parity-check matrix and q is a channel input distribution and (ii) a random parameter...
Improved exponential error bounds are derived for frame-asynchronous discrete memoryless multiple access channels with two senders. By numerical evaluation for a particular case, it follows that the best error exponent known for synchronous transmission may be beaten if the senders are allowed to transmit with a chosen delay.
This paper presents the approach and algorithm of joint detection decoding with turbo codes for MIMO wireless communication systems. To the best of the authors' knowledge, this is the first proposed approach that can perform MIMO detection and decoding of turbo codes in a single stage. The detailed introduction of the proposed method and outline of the algorithm are given, while extensive simulations...
Bit Patterned media recording (BPMR), heat assisted magnetic recording (HAMR), and shingled writing (SMR) with 2-dimensional (2-D) readback have been explored to further scale magnetic recording areal density over the next decade. However, from a signal processing perspective, all these magnetic recording technologies face a common challenge that is how to efficiently recover recorded data from the...
A method for securing wireless multiple access channels is proposed. The method is based on the dispersive nature of wireless channels. Specifically, on the fact the channels from distributed nodes in space to a receiver are unique to the receivers' point in space and change over time. Each node estimates the channel between itself and the receiver. It then transmits a compensated signal yielding...
In many joint source-channel coding applications, there is a need to assess the performance of a system on a given channel, with different combinations of channel codes. What is interesting is to know some measure of the overall bit error rate, in order to design the source and/or channel codes accordingly. We propose here an approximation of the bit error rate of the cascade of a linear block code...
The strong similarity between binary symmetric source (BSS) coding relative to Hamming distortion and binary symmetric channel (BSC) coding is discussed in this paper. It is further utilized for designing data compression systems with error probability criterion. These are, in turn, used Lo construct simple joint source and channel coding systems.
Data compression can help in relieving congestion by only reducing the effective data size without much effect on throughput. This paper proposes a joint data compression technique in congested networks. The proposed framework combines Lempel Ziv Welch (LZW) and Lightweight Dictionary-based Compression (LDC), the joint LZW and LDC is added on top of the TCP layer. When congestion is detected, the...
Coset-based codes are often proposed as an alternative to the theoretical probabilistic random binning in network coding. In this paper nested lattice codes recently proposed for multiterminal binning are used to devise a structured high dimensional Costa scheme for data hiding. The resulting embedding scheme overcomes both the famous Scalar Costa Scheme (SCS) and regular Quantization Index Modulation...
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.