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.
Let (S1,i, S2,i) ~ i.i.d p(s1, s2), i = 1, 2, ... be a memoryless correlated partial side information sequence. In this work we study channel coding and source coding problems, where the encoder is informed with the encoder's side information (ESI, S1) and the decoder is informed with the decoder's side information (DSI, S2), and additionally, either the encoder or the decoder is also informed with...
In this paper, we evaluate a multilevel coding (MLC) scheme with multi-stage decoding (MSD) designed for satellite broadcasting communications, where services with different quality of service (QoS) are desirable. A simple Land-Mobile-Satellite (LMS) channel model is presented, based on channel states and their transitions. The instantaneous channel capacity for suburban and forest scenarios is calculated...
In this contribution, we propose a Distributed Concatenated Irregular Convolutional Coded Unity Rate Coded and Space Time Trellis Coded (DC-IrCC-URC-STTC) scheme for cooperative communications employing multiple single-antenna relays. Each coding arrangement is designed for efficient decoding convergence by employing non-binary Extrinsic Information Transfer (EXIT) charts. The source node transmits...
Under the standard random coding framework, the conditional entropy rate of the channel output given the codebook information is investigated. It is shown that there exists an interesting dichotomy: with respect to the unconditional entropy rate of the output, this conditional entropy rate is reduced when the communication rate is below the channel capacity, but remains the same when the communication...
Polar codes have been recently proposed as the first low complexity class of codes that can provably achieve the capacity of symmetric binary-input memoryless channels. Here, we study the bit error rate performance of finite-length polar codes under Belief Propagation (BP) decoding. We analyze the stopping sets of polar codes and the size of the minimal stopping set, called “stopping distance”. Stopping...
In interference alignment, users sharing a wireless channel are each able to achieve data rates of up to half of the non-interfering channel capacity, no matter the number of users. In an ergodic setting, this is achieved by pairing complementary channel realizations in order to amplify signals and cancel interference. However, this scheme has the possibility for large delays in decoding message symbols...
Air bandwidth is a precious resource for wireless communication. Multiple-antenna (MIMO) systems enable an increase in channel capacity without increasing the air bandwidth. An iterative demapping and decoding at the receiver improves the communications performance remarkably. However, MIMO demapping and channel decoding have a high computational complexity. Energy consumption, latency and throughput...
In downlink relay systems, the conventional straightforward relaying scheme named decode-and-forward (DF) protocol is used at relay station (RS) to decode the data received from base station (BS) and forward the decoded data to the mobile station (MS) to improve the spatial diversity gain. However, conventional DF mode is spectral inefficient and not capacity optimal since the wireless channels in...
In energy harvesting communication systems, an exogenous recharge process supplies energy for the data transmission and arriving energy can be buffered in a battery before consumption. Transmission is interrupted if there is not sufficient energy. We address communication with such random energy arrivals in an information-theoretic setting. Based on the classical additive white Gaussian noise (AWGN)...
A problem of state information transmission over a state-dependent discrete memoryless channel (DMC) with independent and identically distributed (i.i.d.) states, known strictly causally at the transmitter is investigated. It is shown that block-Markov encoding coupled with channel state estimation conditioned on treating the decoded message and received channel output as side information at the decoder...
A single-letter characterization is provided for the capacity region of finite-state multiple access channels, when the channel state is a Markov process, the transmitters have access to delayed state information, and channel state information is available at the receiver. The delays of the channel state information are assumed to be asymmetric at the transmitters. We apply the result to derive power...
We present the ε-outage capacity in the low signal-to-noise ratio (SNR) regime of an incremental relaying network. The network consists of one source, one destination, and two half-duplex relays. The one-bit feedback from the destination node is considered to be imperfect and is modeled as binary symmetric channel. The basic idea is that in each block only one terminal transmits depending on the feedback...
We characterize the capacity of a class of primitive relay channels. The primitive relay channel considered in this paper consists of a semi-deterministic broadcast channel to the relay and the decoder. The relay can help the message transmission through an orthogonal finite capacity link to the decoder. We show that the capacity of this class of primitive relay channels is given by the cut-set upper...
We consider the problem of optimal probing of communication channel at the encoder for discrete memoryless channels (DMC) with i.i.d. states. The encoder generates an action sequence dependent on the message with which it probes the channel and hence acquires partial state information. This is further used causally or non-causally to generate channel input symbols while decoder may or may not have...
A multiple-input multiple-output two-way relay channel consisting of two communication nodes and a full-duplex relay node is considered, assuming that no direct link exists between the two communication nodes. We propose an achievable scheme using lattice codes combined with generalized singular value decomposition-based precoding for the first phase and vertically encoded structural bining for the...
The interference channel with a relay (ICR) is the fundamental building block of cooperation in wireless networks consisting of multiple communicating pairs. This work considers ICRs in which the links are subject to i.i.d. phase fading. Strong interference conditions are derived for the case where the links from the sources to the relay are good, leading to the characterization of the capacity region...
Over binary input channels, the uniform distribution is a universal prior, in the sense that it maximizes the worst case mutual information of all binary input channels and achieves at least 94.2% of the capacity. In this paper, we address a similar question. We look for the best collection of finitely many a posteriori metrics, to maximize the worst case mismatched mutual information achieved by...
A polar coding scheme is suggested for the binary-input memoryless symmetric and degraded wire-tap channel. The provided scheme achieves the entire rate-equivocation region for the considered model.
This paper presents an extension of the memoryless channel coding theorem to noisy functions, i.e. unreliable computing devices without internal states. It is shown that the concepts of equivocation and capacity can be defined for noisy computations in the simple case of memoryless noisy functions. Capacity is the upper bound of input rates allowing reliable computation, i.e. decodability of noisy...
In this paper, we investigate Causal Cognitive Interference Channel (CC-IFC) with delay in which the cognitive user transmission can depend on L future received symbols as well as the past ones. We study two special cases: CC-IFC without delay (L = 1), where the cognitive user can use only current and past received symbols, and CC-IFC with a block length delay (L = n), wherein the entire received...
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.