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.
Underwater acoustic sensor networks are characterized by limited transmit power and bandwidth, and a harsh communication environment. Different techniques for reliable communication in underwater networks have been studied in the literature at different layers of the network protocol stack. Among these, the use of fountain codes as a way for improving the quality of the communication over a highly...
This paper investigates the energy harvesting fading multiple-access channels, where the transmitters harvest random amounts of energy from the environment and the data transmissions are subject to statistical quality of service (QoS) constraints in the form of limitations on the buffer overflow probability. With the assumption that the channel state information (CSI) and harvested energy in all time...
Interference alignment (IA) is a prospective method to manage interference between users in multi-user networks. On the other hand, jamming can be an effective way to combat adversarial eavesdropping for legitimate networks. In this paper, a beneficial jamming scheme is proposed for interference alignment networks. In the scheme, the jammer utilizes its precoding vector to constrain the jamming signal...
The existing secure transmission methods based on fountain codes require a quite dominant quality of the main channel. In this paper, we propose a novel feedback-based method for fountain code to achieve stronger security. In the binary erasure channel model, the legitimate user shares the decoding situation with transmitter via feedback messages. The transmitter updates the coding process based on...
This paper studies an uplink simultaneous wireless information and power transfer (SWIPT) system with non-orthogonal multiple access (NOMA), consisting of two users and one energy-harvesting access point (AP). The users transmit their independent information simultaneously to the AP which harvests energy and decodes information at the same time by dynamic power splitting (DPS). We focus on the ergodic...
In this paper Barnes-Wall lattices for the K-user symmetric interference channel are considered. This paper is inspired by the work of Jafar [1], where a deterministic model is used in order to build a scheme to obtain the generalized degrees of freedom for each type of interference. The scheme uses a base Q expression to build the transmitted signals. This is an inspiration for [2] where, for some...
The Gaussian fading channel is studied, in which the channel from the transmitter to the receiver is corrupted by a multiplicative fading coefficient H and an additive Gaussian random noise. It is assumed that the channel is experiencing block fading, and the transmitter does not know the channel state information (CSI). The receiver is assumed to have full knowledge of the CSI. If the channel state...
We define a multiaccess communication scheme that effectively eliminates interference and resolves collisions in many-to-one and many-to-many communication scenarios. Each transmitter is uniquely identified by a coding vector. Using these vectors, all signals issued from a specific transmitter will be aligned along a unique dimension at all receivers hearing this transmission. This dimension is characteristic...
The inherent nature of polar codes being channel specific makes it difficult to use them in a setting where the communication channel changes with time. In particular, to be able to use polar codes in a wireless scenario, varying attenuation due to fading needs to be mitigated. To the best of our knowledge, there has been no comprehensive work in this direction thus far. In this work, a practical...
Multilayer coding represents an appealing solution for the broadcasting of common data when we want to ensure the receivers decode the signal with different distortion levels depending on the quality of the received signal. In addition, the combination of digital and analog techniques to encode the source data allows to solve the limitation of these approaches when they are applied separately. In...
Molecular communication via diffusion (MCvD) is a new research area that considers the communication using messenger molecules in a diffusive fluidic channel. In this area, various modulation methods have been proposed to overcome the problems in the channel, especially the inter symbol interference (ISI). However, these methods are generally considered and tested for the channels that do not change...
In this paper, a high throughput pipeline HARQ scheme of polar codes is proposed as the throughput of conventional schemes are to be promoted. In this scheme, we use a pipeline structure that the current HARQ process may combine the source bits of the current process and the retransmission bits of the incorrectly decoded previous HARQ processes and the source bits of the current process may be retransmitted...
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...
The arbitrarily varying channel (AVC) models communication over a channel that varies in an arbitrary and unknown manner from channel use to channel use. This paper considers the AVC under list decoding and studies the corresponding list capacity. In particular, the list capacity function is shown to be discontinuous and the corresponding discontinuity points are characterized for all possible list...
The problem of three-user multiple-access channel (MAC) with noiseless feedback is investigated. A new coding strategy is presented. The coding scheme builds upon the natural extension of the Cover-Leung (CL) scheme [1]; and uses quasi-linear codes. A new single-letter achievable rate region is derived. The new achievable region strictly contains the CL region. This is shown through an example. In...
A broadcast strategy for multiple access communication over slowly fading channels is introduced, in which the channel state information is known to only the receiver. In this strategy, the transmitters split their information streams into multiple independent information layers, each adapted to a specific actual channel realization. The major distinction between the proposed strategy and the existing...
In this paper, throughput of hybrid automatic repeat request (HARQ) schemes with finite blocklength codes is studied for both constant-rate and ON-OFF discrete-time Markov arrivals under statistical queuing constraints and deadline limits. After analyzing the decoding error probability and outage probability, the distribution of transmission period is characterized, and the throughput expressions...
The problem of computing the modulo-sum of messages over a finite-field erasure multiple access channel (MAC) is studied, and the role of feedback for function computation is explored. Our main contribution is two-fold. First, a new outer bound on the non-feedback computation capacity is proved, which strictly improves the state of the art [1]. The new outer bound answers a previously unsettled question...
We analyze the problem of secure communication over a wiretap channel with an active adversary, in which the legitimate transmitter has the opportunity to sense and learn the adversary's actions. Specifically, the adversary has the ability to switch between two channels and to observe the corresponding output at every channel use; the encoder, however, has causal access to observations impacted by...
Capacity bounds for the two-user interference channels with cooperative receivers via conferencing links of finite capacities are investigated. Capacity results known for these communication scenarios are limited to a very few special cases of the one-sided channels. One of the major challenges in analyzing such cooperative networks is how to establish efficient capacity outer bounds for them. In...
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.