arXiv subjects

Petar Popovski

Publications and source records attributed to Petar Popovski.

481 records · Page 27Linked to original sources

arXiv2012

A Study of Trade-off between Opportunistic Resource Allocation and Interference Alignment in Femtocell Scenarios

One of the main problems in wireless heterogeneous networks is interference between macro- and femto-cells. Using Orthogonal Frequency-Division Multiple Access (OFDMA) to create multiple frequency orthogonal sub-channels, this interference can be completely avoided if each sub-channel is exclusively used by either macro- or a femto-cell. However, such an orthogonal allocation may be inefficient. We consider two alternative strategies for interference management, opportunistic resource allocation (ORA) and interference alignment (IA). Both of them utilize the fading fluctuations across frequency channels in different ways. ORA allows the users to interfere, but selecting the channels where the interference is faded, while the desired signal has a good channel. IA uses precoding to create interference-free transmissions; however, such a precoding changes the diversity picture of the communication resources. In this letter we investigate the interactions and the trade-offs between these two strategies.

cs.IT↗

arXiv2012

Two-Way Communication with Energy Exchange

The conventional assumption made in the design of communication systems is that the energy used to transfer information between a sender and a recipient cannot be reused for future communication tasks. A notable exception to this norm is given by passive RFID systems, in which a reader can transfer both information and energy via the transmitted radio signal. Conceivably, any system that exchanges information via the transfer of given physical resources (radio waves, particles, qubits) can potentially reuse, at least part, of the received resources for communication later on. In this paper, a two-way communication system is considered that operates with a given initial number of physical resources, referred to as energy units. The energy units are not replenished from outside the system, and are assumed, for simplicity, to be constant over time. A node can either send an "on" symbol (or "1"), which costs one unit of energy, or an "off" signal (or "0"), which does not require any energy expenditure. Upon reception of a "1" signal, the recipient node "harvests" the energy contained in the signal and stores it for future communication tasks. Inner and outer bounds on the achievable rates are derived, and shown via numerical results to coincide if the number of energy units is large enough.

cs.IT↗

arXiv2012

Protocol Coding through Reordering of User Resources: Applications and Capacity Results

While there are continuous efforts to introduce new communication systems and standards, it is legitimate to ask the question: how can one send additional bits by minimally changing the systems that are already operating? This is of a significant practical interest, since it has a potential to generate additional value of the systems through, for example, introduction of new devices and only a software update of the access points or base stations, without incurring additional cost for infrastructure hardware installation. The place to look for such an opportunity is the communication protocol and we use the term *protocol coding* to refer to strategies for sending information by using the degrees of freedom available when one needs to decide the actions taken by a particular communication protocol. In this paper we consider protocol coding that gives a rise to *secondary communication channels*, defined by combinatorial ordering of the user resources (packets, channels) in a primary (legacy) communication system. We introduce communication models that enable us to compute the capacity of such secondary channels under suitable restrictions imposed by the primary systems. We first show the relation to the capacity of channels with causal channel state information at the transmitter (CSIT), originally considered by Shannon. By using the specific communication setup, we develop an alternative framework for achieving the capacity and we discuss coding strategies that need to be used over the secondary channels. We also discuss some practical features of the secondary channels and their applications that add value to the existing wireless systems.

cs.IT↗

arXiv2012

Protocol Coding through Reordering of User Resources, Part I: Capacity Results

The vast existing wireless infrastructure features a variety of systems and standards. It is of significant practical value to introduce new features and devices without changing the physical layer/hardware infrastructure, but upgrade it only in software. A way to achieve it is to apply protocol coding: encode information in the actions taken by a certain (existing) communication protocol. In this work we investigate strategies for protocol coding via combinatorial ordering of the labelled user resources (packets, channels) in an existing, primary system. Such a protocol coding introduces a new secondary communication channel in the existing system, which has been considered in the prior work exclusively in a steganographic context. Instead, we focus on the use of secondary channel for reliable communication with newly introduced secondary devices, that are low-complexity versions of the primary devices, capable only to decode the robustly encoded header information in the primary signals. We introduce a suitable communication model, capable to capture the constraints that the primary system operation puts on protocol coding. We have derived the capacity of the secondary channel under arbitrary error models. The insights from the information-theoretic analysis are used in Part II of this work to design practical error-correcting mechanisms for secondary channels with protocol coding.

cs.IT↗

arXiv2012

Protocol Coding through Reordering of User Resources, Part II: Practical Coding Strategies

We use the term protocol coding to denote the communication strategies in which information is encoded through the actions taken by a certain communication protocol. In this work we investigate strategies for protocol coding via combinatorial ordering of the labelled user resources (packets, channels) in an existing, primary system. This introduces a new, secondary communication channel in the existing system, which has been considered in the prior work exclusively in a steganographic context. Instead, we focus on the use of secondary channel for reliable communication with newly introduced secondary devices, that are low-complexity versions of the primary devices, capable only to decode the robustly encoded header information in the primary signals. In Part I of the work we have characterized the capacity of the secondary channel through information-theoretic analysis. In this paper we consider practical strategies for protocol coding inspired by the information-theoretic analysis. It turns out that the insights from Part I are instrumental for devising superior design of error-control codes. This is demonstrated by comparing the error performance to the "na"ıve" strategy which is presumably available without carrying out the analysis in Part I. These results are clearly outlining both the conceptual novelty behind the discussed concept of secondary channel as well as its practical applicability.

cs.IT↗

arXiv2011

Cognitive Multiple Access Network with Outage Margin in the Primary System

This paper investigates the problem of spectrally efficient operation of a multiuser uplink cognitive radio system in the presence of a single primary link. The secondary system applies opportunistic interference cancelation (OIC) and decode the primary signal when such an opportunity is created. We derive the achievable rate in the secondary system when OIC is used. This scheme has a practical significance, since it enables rate adaptation without requiring any action from the primary system. The \emph{exact} expressions for outage probability of the primary user are derived, when the primary system is exposed to interference from secondary users. Moreover, approximated formulas and tight lower and upper bounds for the ergodic sum-rate capacity of the secondary network are found. Next, the power allocation is investigated in the secondary system for maximizing the sum-rate under an outage constraint at the primary system. We formulate the power optimization problem in various scenarios depending on the availability of channel state information and the type of power constraints, and propose a set of simple solutions. Finally, the analytical results are confirmed by simulations, indicating both the accuracy of the analysis, and the fact that the spectral-efficient, low-complexity, flexible, and high-performing cognitive radio can be designed based on the proposed schemes.

cs.IT↗

arXiv2010

Fast and Power Efficient Sensor Arbitration: Physical Layer Collision Recovery of Passive RFID Tags

This work concerns physical layer collision recovery for cheap sensors with allowed variations in frequency and delay of their communications. The work is presented as a generic, communication theoretic framework and demonstrated using UHF RFID tag technology. Previous work in this area has not provided recovery for more than two tags, which is shown to be possible in this work. Also presented is a novel mathematical model of the tag signal, incorporating the allowed variations in frequency and delay. The main motivation is seen in the observation that random variations in frequency and delay make the collided signals of different tags separable. The collision recovery is done by estimating the sensor specific variation in frequency and delay and using these estimates in a successive interference cancellation algorithm and a maximum likelihood sequence decoder, to iteratively reconstruct a sensor signal and remove it from the received signal. Numerical simulations show that the estimates and proposed algorithm are effective in recovering collisions. The proposed algorithm is then incorporated into a numerical simulation of the Qprotocol for UHF RFID tags and is shown to be effective in providing fast and power efficient sensor arbitration.

cs.NI↗

arXiv2010

On the Role of Feedback in LT Codes

This paper concerns application of feedback in LT codes. The considered type of feedback is acknowledgments, where information on which symbols have been decoded is given to the transmitter. We identify an important adaptive mechanism in standard LT codes, which is crucial to their ability to perform well under any channel conditions. We show how precipitate application of acknowledgments can interfere with this adaptive mechanism and lead to significant performance degradation. Moreover, our analysis reveals that even sensible use of acknowledgments has very low potential in standard LT codes. Motivated by this, we analyze the impact of acknowledgments on multi layer LT codes, i.e. LT codes with unequal error protection. In this case, feedback proves advantageous. We show that by using only a single feedback message, it is possible to achieve a noticeable performance improvement compared to standard LT codes.

cs.IT↗

arXiv2010

Coordinated Transmissions to Direct and Relayed Users in Wireless Cellular Systems

The ideas of wireless network coding at the physical layer promise high throughput gains in wireless systems with relays and multi-way traffic flows. This gain can be ascribed to two principles: (1) joint transmission of multiple communication flows and (2) usage of \emph{a priori} information to cancel the interference. In this paper we use these principles to devise new transmission schemes in wireless cellular systems that feature both users served directly by the base stations (direct users) and users served through relays (relayed users). We present four different schemes for \emph{coordinated transmission} of uplink and downlink traffic in which one direct and one relayed user are served. These schemes are then used as building blocks in multi-user scenarios, where we present several schemes for scheduling pairs of users for coordinated transmissions. The optimal scheme involves exhaustive search of the best user pair in terms of overall rate. We propose several suboptimal scheduling schemes, which perform closely to the optimal scheme. The numerical results show a substantial increase in the system--level rate with respect to the systems with non--coordinated transmissions.

cs.IT↗

arXiv2009

Reliable Identification of RFID Tags Using Multiple Independent Reader Sessions

Radio Frequency Identification (RFID) systems are gaining momentum in various applications of logistics, inventory, etc. A generic problem in such systems is to ensure that the RFID readers can reliably read a set of RFID tags, such that the probability of missing tags stays below an acceptable value. A tag may be missing (left unread) due to errors in the communication link towards the reader e.g. due to obstacles in the radio path. The present paper proposes techniques that use multiple reader sessions, during which the system of readers obtains a running estimate of the probability to have at least one tag missing. Based on such an estimate, it is decided whether an additional reader session is required. Two methods are proposed, they rely on the statistical independence of the tag reading errors across different reader sessions, which is a plausible assumption when e.g. each reader session is executed on different readers. The first method uses statistical relationships that are valid when the reader sessions are independent. The second method is obtained by modifying an existing capture-recapture estimator. The results show that, when the reader sessions are independent, the proposed mechanisms provide a good approximation to the probability of missing tags, such that the number of reader sessions made, meets the target specification. If the assumption of independence is violated, the estimators are still useful, but they should be corrected by a margin of additional reader sessions to ensure that the target probability of missing tags is met.

cs.IT↗

arXiv2008

Wireless Secrecy in Cellular Systems with Infrastructure--Aided Cooperation

In cellular systems, confidentiality of uplink transmission with respect to eavesdropping terminals can be ensured by creating intentional inteference via scheduling of concurrent downlink transmissions. In this paper, this basic idea is explored from an information-theoretic standpoint by focusing on a two-cell scenario where the involved base stations are connected via a finite-capacity backbone link. A number of transmission strategies are considered that aim at improving uplink confidentiality under constraints on the downlink rate that acts as an interfering signal. The strategies differ mainly in the way the backbone link is exploited by the cooperating downlink- to the uplink-operated base stations. Achievable rates are derived for both the Gaussian (unfaded) and the fading cases, under different assumptions on the channel state information available at different nodes. Numerical results are also provided to corroborate the analysis. Overall, the analysis reveals that a combination of scheduling and base station cooperation is a promising means to improve transmission confidentiality in cellular systems.

cs.IT↗

arXiv2007

Physical Network Coding in Two-Way Wireless Relay Channels

It has recently been recognized that the wireless networks represent a fertile ground for devising communication modes based on network coding. A particularly suitable application of the network coding arises for the two--way relay channels, where two nodes communicate with each other assisted by using a third, relay node. Such a scenario enables application of \emph{physical network coding}, where the network coding is either done (a) jointly with the channel coding or (b) through physical combining of the communication flows over the multiple access channel. In this paper we first group the existing schemes for physical network coding into two generic schemes, termed 3--step and 2--step scheme, respectively. We investigate the conditions for maximization of the two--way rate for each individual scheme: (1) the Decode--and--Forward (DF) 3--step schemes (2) three different schemes with two steps: Amplify--and--Forward (AF), JDF and Denoise--and--Forward (DNF). While the DNF scheme has a potential to offer the best two--way rate, the most interesting result of the paper is that, for some SNR configurations of the source--relay links, JDF yields identical maximal two--way rate as the upper bound on the rate for DNF.

cs.IT↗

arXiv2007

Rate Adaptation for Cognitive Radio under Interference from Primary Spectrum User

A cognitive radio can operate as a secondary system in a given spectrum. This operation should use limited power in order not to disturb the communication by primary spectrum user. Under such conditions, in this paper we investigate how to maximize the spectral efficiency in the secondary system. A secondary receiver observes a multiple access channel of two users, the secondary and the primary transmitter, respectively. We show that, for spectrally-efficient operation, the secondary system should apply Opportunistic Interference Cancellation (OIC). With OIC, the secondary system decodes the primary signal when such an opportunity is created by the primary rate and the power received from the primary system. For such an operation, we derive the achievable data rate in the secondary system. When the primary signal is decodable, we devise a method, based on superposition coding, by which the secondary system can achieve the maximal possible rate. Finally, we investigate the power allocation in the secondary system when multiple channels are used. We show that the optimal power allocation with OIC can be achieved through intercepted water-filling instead of the conventional water-filling. The results show a significant gain for the rate achieved through an opportunistic interference cancellation.

cs.IT↗