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 presents a non-binary finite-stat Markov channel (FSMC) that captures both the soft-decision information and the temporal correlation of a discrete fading channel (DFC) with 2ξ quantization levels. The parameters of the FSMC that approximate the DFC with fixe parameters are found using the Baum-Welch algorithm. An iterative decoding scheme, based on the sum-product algorithm, is also discussed...
In this article a new class of receiver subsystems is introduced to enhance the performance of detection of signals in wireless sensor networks. The receiver design is applicable for detection of signals from any active or passive sensor, and ideal specifically for passive Radio Frequency Identification (RFID) tags. The system proposed herein employs iterative algorithms based on so called “Turbo...
This paper considers the analysis of communication protocols in wireless networks implementing both cooperation and Hybrid Automatic Repeat reQuest (HARQ) for Type I decoder and Type II decoder with Chase Combining. Using an example of a three-node network, we show that the communication protocol can be modeled using Finite State Markov Chains. This model efficiently predicts the performance of the...
In this paper, we propose a simple and efficient soft- in soft-out (SISO) equalization for block Markov superposition transmission (BMST) in the coded OFDM system (called BMST-OFDM) over high-mobility wireless communication channels. In the BMST-OFDM system, the proposed SISO equalizer can exchange soft messages with the soft demapper and the BMST decoder in an iterative fashion. Simulation results...
Licensed-Assisted Access Long-Term Evolution (LAA- LTE) framework can offload excessive data stream to the unlicensed spectrum. Devices from different operators will compete for the same band and have to endure a more complex and congested channel conditions. Therefore a rapid and efficient access mechanism should be introduced in the LAA framework. Based on the Type B LBT channel access scheme, this...
This paper Introduces the discrete memoryless multiple access wiretap channel with noiseless cribbing, where the cribbing may be either causal or strictly causal. We derive lower bounds for secrecy rates for both causal and strictly causal cribbing under either a decode-forward or partial-decode-forward strategy. Our results recover the achievable rate regions of the MAC wiretap and MAC with cribbing,...
The K-user discrete memoryless (DM) broadcast channel (BC) with two degraded messages, with one common message to be decoded by all receivers and a private message by a subset of receivers, is studied. The receivers that must decode both messages are referred to as private receivers and the remaining ones that need only decode the common message as common receivers. We obtain two main results. The...
This paper defines and studies the problem of universal clustering using responses of crowd workers, without knowledge of worker reliability or task difficulty. We model stochastic worker response distributions by incorporating traits of memory for similar objects and traits of distance among differing objects. We are particularly interested in two limiting worker types — temporary and long-term workers,...
We study the lossy communication of correlated sources over a multiple access channel (MAC). In particular, we provide a new set of necessary conditions for the achievability of a distortion pair over a given channel. The necessary conditions are then specialized to the case of bivariate Gaussian sources and doubly symmetric binary sources over a Gaussian multiple access channel. Our results indicate...
This paper investigates the Multiple Description (MD) Chief Executive Officer (CEO) problem under logarithmic-loss distortion. The setup extends previous work of Courtade and Weissman (2014) by requiring the CEO to obtain a useful reconstruction also from a reduced set of descriptions. A single-letter characterization of the achievable region is derived under a suitable conditional independence assumption...
With the constant development of smart devices, Gesture recognition is applied on more and more fields. Gesture recognition devices currently on the market are inconvenient and expensive. A gesture recognition method based on Kinect is proposed in this paper. The camera of Kinect is used to get gesture images and then a hidden Markov model is established to recognize dynamic gesture so that the operation...
Simultaneous (Nash) and sequential (Stackelberg) equilibria of two-player dynamic quadratic cheap talk and signaling game problems are investigated under a perfect Bayesian formulation. For the dynamic scalar and multi-dimensional cheap talk, the Nash equilibrium cannot be fully revealing whereas the Stackelberg equilibrium is always fully revealing. Further, the final state Nash equilibria have to...
We study the problem of joint information and energy transfer in a two-hop channel with a Radio frequency (RF) energy harvesting relay. We consider a finite battery size at the relay and deterministic energy loss in transmitting energy. In other words, to be able to send an energy-contained symbol, the relay must receive multiple energy-contained symbols. Thus, we face a kind of channel with memory...
We present Marlin, a variable-to-fixed (VF) codec optimized for decoding speed. Marlin builds upon a novel way of constructing VF dictionaries that maximizes efficiency for a given dictionary size. On a lossless image coding experiment, Marlin achieves a compression ratio of 1.94 at 2494MiB/s. Marlin is as fast as state-of-the-art high-throughput codecs (e.g., Snappy, 1.24 at 2643MiB/s), and its compression...
This paper presents a framework for modeling neural decoding using electromyogram (EMG) and electrocorticogram (ECoG) signals to interpret human intent and control prosthetic arms. Specifically, the method of this paper employs Markov Decision Processes (MDP) for neural decoding, parameterizing the policy using an artificial neural network. The system is trained using a modification of the Dataset...
In this paper, we examine message prioritization in terms of both rate and reliability in the two-way relay channel using decode-forward relaying. Each source sends both a low priority message and a high priority message. We design a scheme that routes the high priority messages through the relay and direct link but the low priority message is only decoded by the destination. For fixed message priorities,...
This contribution considers the word error rate (WER) performance of a concatenated coding scheme in the presence of impulsive noise (IN), which is modeled as gated white Gaussian noise, with on- and off-times governed by a 2-state Markov model. The scheme consists of a Reed-Solomon (RS) outer code and a low-density parity-check (LDPC) inner code, which are separated by a block interleaver with finite...
The discrete memoryless Z-Channel with a confidential message and a cooperative receiver (DM-ZC-CMCR) is considered. A noiseless one-sided rate-limited cooperation link exists between the two receivers. The secrecy level is measured by the equivocation rate. An outer bound on the secrecy-capacity-region DM-ZC-CMCR is derived. An achievable secrecy-rate region is proposed. The secrecy-sum capacity...
The source coding problem with common reconstruction constraint is considered, where the encoder can produce an exact copy of the compressed source reconstructed by the decoder. In this paper, we consider the variation of this problem in which the encoder can observe the side information which may be different from the decoder side information. For the doubly-symmetric binary source, we derive the...
This paper studies the impact of encoder side information (SI) on the Heegard-Berger (HB) problem with common reconstruction (CR) constraints, where the encoder has access to the side information. In this scenario, the rate distortion function is calculated explicitly for the doubly-symmetric binary source.
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.