arXiv subjects

Behnaam Aazhang

Publications and source records attributed to Behnaam Aazhang.

27 records · Page 2Linked to original sources

arXiv2015

Signaling Design of Two-Way MIMO Full-Duplex Channel: Optimality Under Imperfect Transmit Front-End Chain

We derive the optimal signaling for a multiple input multiple output (MIMO) full-duplex two-way channel under the imperfect transmit front-end chain. We characterize the two-way rates of the channel by using a game-theoretical approach, where we focus on the Pareto boundary of the achievable rate region and Nash equilibia (NE). For a MISO full-duplex two-way channel, we prove that beamforming is an optimal transmission strategy which can achieve any point on the Pareto boundary. Furthermore, we present a closed-form expression for the optimal beamforming weights. In our numerical examples we quantify gains in the achievable rates of the proposed beamforming over the zero-forcing beamforming. For a general MIMO full-duplex channel, we establish the existence of NE and present a condition for the uniqueness of NE. We then propose an iterative water-filling algorithm which is capable of reaching NE. Through simulations the threshold of the self-interference level is found, below which the full-duplex NE outperforms the half-duplex TDMA.

cs.IT↗

arXiv2015

Optimal Signaling of MISO Full-Duplex Two-Way Wireless Channel

We model the self-interference in a multiple input single output (MISO) full-duplex two-way channel and evaluate the achievable rate region. We formulate the boundary of the achievable rate region termed as the Pareto boundary by a family of coupled, non-convex optimization problems. Our main contribution is decoupling and reformulating the original non-convex optimization problems to a family of convex semidefinite programming problems. For a MISO full-duplex two-way channel, we prove that beamforming is an optimal transmission strategy which can achieve any point on the Pareto boundary. Furthermore, we present a closed-form expression for the optimal beamforming weights. In our numerical examples we quantify gains in the achievable rates of the proposed beamforming over the zero-forcing beamforming.

cs.IT↗

arXiv2013

An Analog Baseband Approach for Designing Full-Duplex Radios

Recent wireless testbed implementations have proven that full-duplex communication is in fact possible and can outperform half-duplex systems. Many of these implementations modify existing half-duplex systems to operate in full-duplex. To realize the full potential of full-duplex, radios need to be designed with self-interference in mind. In our work, we use an experimental setup with a patch antenna prototype to characterize the self-interference channel between two radios. In doing so, we form an analytical model to design analog baseband cancellation techniques. We show that our cancellation scheme can provide up to 10 dB improved signal strength, 2.5 bps/Hz increase in rate, and a 10,000 improvement in BER as compared to the RF only cancellation provided by the patch antenna.

cs.NI↗

arXiv2013

Analog Baseband Cancellation for Full-Duplex: An Experiment Driven Analysis

Recent wireless testbed implementations have proven that full-duplex communication is in fact possible and can outperform half-duplex systems. Many of these implementations modify existing half-duplex systems to operate in full-duplex. To realize the full potential of full-duplex, radios need to be designed with self-interference in mind. In our work, we use a novel patch antenna prototype in an experimental setup to characterize the self-interference channel between transmit and receive radios. We derive an equivalent analytical baseband model and propose analog baseband cancellation techniques to complement the RF cancellation provided by the patch antenna prototype. Our results show that a wide bandwidth, moderate isolation scheme achieves up to 2.4 bps/Hz higher achievable rate than a narrow bandwidth, high isolation scheme. Furthermore, the analog baseband cancellation yields a 10-10,000 improvement in BER over RF only cancellation.

cs.NI↗

arXiv2013

Spectrum Sharing Scheme Between Cellular Users and Ad-hoc Device-to-Device Users

In an attempt to utilize spectrum resources more efficiently, protocols sharing licensed spectrum with unlicensed users are receiving increased attention. From the perspective of cellular networks, spectrum underutilization makes spatial reuse a feasible complement to existing standards. Interference management is a major component in designing these schemes as it is critical that licensed users maintain their expected quality of service. We develop a distributed dynamic spectrum protocol in which ad-hoc device-to-device users opportunistically access the spectrum actively in use by cellular users. First, channel gain estimates are used to set feasible transmit powers for device-to-device users that keeps the interference they cause within the allowed interference temperature. Then network information is distributed by route discovery packets in a random access manner to help establish either a single-hop or multi-hop route between two device-to-device users. We show that network information in the discovery packet can decrease the failure rate of the route discovery and reduce the number of necessary transmissions to find a route. Using the found route, we show that two device-to-device users can communicate with a low probability of outage while only minimally affecting the cellular network, and can achieve significant power savings when communicating directly with each other instead of utilizing the cellular base station.

cs.NI↗

arXiv2013

Toward Resource-Optimal Consensus over the Wireless Medium

We carry out a comprehensive study of the resource cost of averaging consensus in wireless networks. Most previous approaches suppose a graphical network, which abstracts away crucial features of the wireless medium, and measure resource consumption only in terms of the total number of transmissions required to achieve consensus. Under a path-loss dominated model, we study the resource requirements of consensus with respect to three wireless-appropriate metrics: total transmit energy, elapsed time, and time-bandwidth product. First we characterize the performance of several popular gossip algorithms, showing that they may be order-optimal with respect to transmit energy but are strictly suboptimal with respect to elapsed time and time-bandwidth product. Further, we propose a new consensus scheme, termed hierarchical averaging, and show that it is nearly order-optimal with respect to all three metrics. Finally, we examine the effects of quantization, showing that hierarchical averaging provides a nearly order-optimal tradeoff between resource consumption and quantization error.

cs.IT↗

arXiv2013

Femtocell Architectures with Spectrum Sharing for Cellular Radio Networks

Femtocells are an emerging technology aimed at providing gains to both network operators and end-users. These gains come at a cost of increased interference, specifically the cross network interference between the macrocell and femtocell networks. This interference is one of the main performance limiting factors in allowing an underlaid femtocell network to share the spectrum with the cellular network. To manage this interference, we first propose a femtocell architecture that orthog- onally partitions the network bandwidth between the macrocell and femtocell networks. This scheme eliminates the cross network interference thus giving the femtocells more freedom over their use of the spectrum. Specifically, no interference constraint is imposed by the cellular network allowing femto users to transmit at a constant power on randomly selected channels. Although simple, this scheme is enough to give gains up to 200% in sum rate. We then propose a second architecture where both networks share the bandwidth simultaneously. A femtocell power control scheme that relies on minimal coordination with the macrocell base station is used in conjunction with an interference sensing channel assignment mechanism. These two schemes together yield sum rate gains up to 200%. We then develop a technique for macro users to join a nearby femtocell and share a common chan- nel with a femtocell user through the use of successive interfer- ence cancellation. By adding this mechanism to the power control and channel assignment schemes, we show sum rate gains over 300% and up to 90% power savings for macrocell users.

cs.NI↗

arXiv2012

Cooperative Compute-and-Forward

We examine the benefits of user cooperation under compute-and-forward. Much like in network coding, receivers in a compute-and-forward network recover finite-field linear combinations of transmitters' messages. Recovery is enabled by linear codes: transmitters map messages to a linear codebook, and receivers attempt to decode the incoming superposition of signals to an integer combination of codewords. However, the achievable computation rates are low if channel gains do not correspond to a suitable linear combination. In response to this challenge, we propose a cooperative approach to compute-and-forward. We devise a lattice-coding approach to block Markov encoding with which we construct a decode-and-forward style computation strategy. Transmitters broadcast lattice codewords, decode each other's messages, and then cooperatively transmit resolution information to aid receivers in decoding the integer combinations. Using our strategy, we show that cooperation offers a significant improvement both in the achievable computation rate and in the diversity-multiplexing tradeoff.

cs.IT↗

arXiv2007

Building a Cooperative Communications System

In this paper, we present the results from over-the-air experiments of a complete implementation of an amplify and forward cooperative communications system. Our custom OFDM-based physical layer uses a distributed version of the Alamouti block code, where the relay sends one branch of Alamouti encoded symbols. First we show analytically and experimentally that amplify and forward protocols are unaffected by carrier frequency offsets at the relay. This result allows us to use a conventional Alamouti receiver without change for the distributed relay system. Our full system implementation shows gains up to 5.5dB in peak power constrained networks. Thus, we can conclusively state that even the simplest form of relaying can lead to significant gains in practical implementations.

cs.IT↗