arXiv subjects

Moe Z. Win

Publications and source records attributed to Moe Z. Win.

At least 37 records · Page 2Linked to original sources

arXiv2019

A Belief Propagation Algorithm for Multipath-Based SLAM

We present a simultaneous localization and mapping (SLAM) algorithm that is based on radio signals and the association of specular multipath components (MPCs) with geometric features. Especially in indoor scenarios, robust localization from radio signals is challenging due to diffuse multipath propagation, unknown MPC-feature association, and limited visibility of features. In our approach, specular reflections at flat surfaces are described in terms of virtual anchors (VAs) that are mirror images of the physical anchors (PAs). The positions of these VAs and possibly also of the PAs are unknown. We develop a Bayesian model of the SLAM problem and represent it by a factor graph, which enables the use of belief propagation (BP) for efficient marginalization of the joint posterior distribution. The resulting BP-based SLAM algorithm detects the VAs associated with the PAs and estimates jointly the time-varying position of the mobile agent and the positions of the VAs and possibly also of the PAs, thereby leveraging the MPCs in the radio signal for improved accuracy and robustness of agent localization. The algorithm has a low computational complexity and scales well in all relevant system parameters. Experimental results using both synthetic measurements and real ultra-wideband radio signals demonstrate the excellent performance of the algorithm in challenging indoor environments.

cs.IT↗

arXiv2018

Efficient Entanglement Distillation for Quantum Channels with Polarization Mode Dispersion

Quantum entanglement shared by remote network nodes serves as a valuable resource for promising applications in distributed computing, cryptography, and sensing. However, distributing entanglement with high-quality via fiber optic routes could be challenging due to the various decoherence mechanisms in fibers. In particular, one of the primary polarization decoherence mechanisms in optical fibers is polarization mode dispersion (PMD), which is the distortion of optical pulses by randomly varying birefringences in the system. To mitigate the effect of decoherence in entangled particles, quantum entanglement distillation (QED) algorithms have been proposed. One particular class, the recurrence QED algorithms, stands out because it has relatively relaxed requirements on both the size of the quantum circuits involved and on the initial quality of entanglement in particles. However, because the number of particles required grows exponentially with the number of rounds of distillation, an efficient recurrence algorithm needs to converge quickly. We present a recurrence QED algorithm designed for photonic qubit pairs affected by PMD-degraded channels. Our proposed algorithm achieves the optimal fidelity as well as the optimal success probability (conditional on the optimal fidelity being achieved) in every round of distillation. The attainment of optimal fidelity improves the convergence speed of fidelity with respect to the rounds of distillation from linear to quadratic, and hence significantly reduces the number of distillation rounds. Combined with the fact that the optimal success probability is achieved, the proposed algorithm provides an efficient method to distribute entangled states with high fidelity via optic fibers.

quant-ph↗

arXiv2018

Doppler Spread Estimation in MIMO Frequency-selective Fading Channels

One of the main challenges in high-speed mobile communications is the presence of large Doppler spreads. Thus, accurate estimation of maximum Doppler spread (MDS) plays an important role in improving the performance of the communication link. In this paper, we derive the data-aided (DA) and non-data-aided (NDA) Cramer-Rao lower bounds (CRLBs) and maximum likelihood estimators (MLEs) for the MDS in multiple-input multiple-output (MIMO) frequency-selective fading channel. Moreover, a lowcomplexity NDA-moment-based estimator (MBE) is proposed. The proposed NDA-MBE relies on the second- and fourth-order moments of the received signal, which are employed to estimate the normalized squared autocorrelation function of the fading channel. Then, the problem of MDS estimation is formulated as a non-linear regression problem, and the least-squares curvefitting optimization technique is applied to determine the estimate of the MDS. This is the first time in the literature when DAand NDA-MDS estimation is investigated for MIMO frequency-selective fading channel. Simulation results show that there is no significant performance gap between the derived NDA-MLE and NDA-CRLB even when the observation window is relatively small. Furthermore, the significant reduced-complexity in the NDA-MBE leads to low root-mean-square error (NRMSE) over a wide range of MDSs when the observation window is selected large enough.

eess.SP↗

arXiv2017

Cooperative Network Synchronization: Asymptotic Analysis

Accurate clock synchronization is required for collaborative operations among nodes across wireless networks. Compared with traditional layer-by-layer methods, cooperative network synchronization techniques lead to significant improvement in performance, efficiency, and robustness. This paper develops a framework for the performance analysis of cooperative network synchronization. We introduce the concepts of cooperative dilution intensity (CDI) and relative CDI to characterize the interaction between agents, which can be interpreted as properties of a random walk over the network. Our approach enables us to derive closed-form asymptotic expressions of performance limits, relating them to the quality of observations as well as network topology.

cs.IT↗

arXiv2017

Adaptive recurrence quantum entanglement distillation for two-Kraus-operator channels

Quantum entanglement serves as a valuable resource for many important quantum operations. A pair of entangled qubits can be shared between two agents by first preparing a maximally entangled qubit pair at one agent, and then sending one of the qubits to the other agent through a quantum channel. In this process, the deterioration of entanglement is inevitable since the noise inherent in the channel contaminates the qubit. To address this challenge, various quantum entanglement distillation (QED) algorithms have been developed. Among them, recurrence algorithms have advantages in terms of implementability and robustness. However, the efficiency of recurrence QED algorithms has not been investigated thoroughly in the literature. This paper put forth two recurrence QED algorithms that adapt to the quantum channel to tackle the efficiency issue. The proposed algorithms have guaranteed convergence for quantum channels with two Kraus operators, which include phase-damping and amplitude-damping channels. Analytical results show that the convergence speed of these algorithms is improved from linear to quadratic and one of the algorithms achieves the optimal speed. Numerical results confirm that the proposed algorithms significantly improve the efficiency of QED.

quant-ph↗

arXiv2016

Modeling and Analysis of Cellular Networks using Stochastic Geometry: A Tutorial

This paper presents a tutorial on stochastic geometry (SG) based analysis for cellular networks. This tutorial is distinguished by its depth with respect to wireless communication details and its focus on cellular networks. The paper starts by modeling and analyzing the baseband interference in a basic cellular network model. Then, it characterizes signal-to-interference-plus-noise-ratio (SINR) and its related performance metrics. In particular, a unified approach to conduct error probability, outage probability, and rate analysis is presented. Although the main focus of the paper is on cellular networks, the presented unified approach applies for other types of wireless networks that impose interference protection around receivers. The paper then extends the baseline unified approach to capture cellular network characteristics (e.g., frequency reuse, multiple antenna, power control, etc.). It also presents numerical examples associated with demonstrations and discussions. Finally, we point out future research directions.

cs.IT↗

arXiv2015

Performance Limits and Geometric Properties of Array Localization

Location-aware networks are of great importance and interest in both civil and military applications. This paper determines the localization accuracy of an agent, which is equipped with an antenna array and localizes itself using wireless measurements with anchor nodes, in a far-field environment. In view of the Cramér-Rao bound, we first derive the localization information for static scenarios and demonstrate that such information is a weighed sum of Fisher information matrices from each anchor-antenna measurement pair. Each matrix can be further decomposed into two parts: a distance part with intensity proportional to the squared baseband effective bandwidth of the transmitted signal and a direction part with intensity associated with the normalized anchor-antenna visual angle. Moreover, in dynamic scenarios, we show that the Doppler shift contributes additional direction information, with intensity determined by the agent velocity and the root mean squared time duration of the transmitted signal. In addition, two measures are proposed to evaluate the localization performance of wireless networks with different anchor-agent and array-antenna geometries, and both formulae and simulations are provided for typical anchor deployments and antenna arrays.

cs.IT↗

arXiv2015

Group-blind detection with very large antenna arrays in the presence of pilot contamination

Massive MIMO is, in general, severely affected by pilot contamination. As opposed to traditional detectors, we propose a group-blind detector that takes into account the presence of pilot contamination. While sticking to the traditional structure of the training phase, where orthogonal pilot sequences are reused, we use the excess antennas at each base station to partially remove interference during the uplink data transmission phase. We analytically derive the asymptotic SINR achievable with group-blind detection, and confirm our findings by simulations. We show, in particular, that in an interference-limited scenario with one dominant interfering cell, the SINR can be doubled compared to non-group-blind detection.

cs.IT↗

arXiv2015

Indoor Localization Algorithm For Smartphones

Increasing sources of sensor measurements and prior knowledge have become available for indoor localization on smartphones. How to effectively utilize these sources for enhancing localization accuracy is an important yet challenging problem. In this paper, we present an area state-aided localization algorithm that exploits various sources of information. Specifically, we introduce the concept of area state to indicate the area where the user is on an indoor map. The position of the user is then estimated using inertial measurement unit (IMU) measurements with the aid of area states. The area states are in turn updated based on the position estimates. To avoid accumulated errors of IMU measurements, our algorithm uses WiFi received signal strength indicator (RSSI) to indicate the vicinity of the user to the routers. The experiment results show that our system can achieve satisfactory localization accuracy in a typical indoor environment.

cs.NI↗

arXiv2015

Generalized Interference Alignment --- Part II: Application to Wireless Secrecy

In contrast to its wired counterpart, wireless communication is highly susceptible to eavesdropping due to the broadcast nature of the wireless propagation medium. Recent works have proposed the use of interference to reduce eavesdropping capabilities in wireless wiretap networks. However, the concurrent effect of interference on both eavesdropping receivers (ERs) and legitimate receivers (LRs) has not been thoroughly investigated, and carefully engineering the network interference is required to harness the full potential of interference for wireless secrecy. This two part paper addresses this issue by proposing a generalized interference alignment (GIA) technique, which jointly designs the transceivers at the legitimate partners to impede the ERs without interfering with LRs. In Part I, we have established a theoretical framework for the GIA technique. In Part II, we will first propose an efficient GIA algorithm that is applicable to large-scale networks and then evaluate the performance of this algorithm in stochastic wireless wiretap network via both analysis and simulation. These results reveal insights into when and how GIA contributes to wireless secrecy.

cs.IT↗

arXiv2015

Generalized Interference Alignment --- Part I: Theoretical Framework

Interference alignment (IA) has attracted enormous research interest as it achieves optimal capacity scaling with respect to signal to noise ratio on interference networks. IA has also recently emerged as an effective tool in engineering interference for secrecy protection on wireless wiretap networks. However, despite the numerous works dedicated to IA, two of its fundamental issues, i.e., feasibility conditions and transceiver design, are not completely addressed in the literature. In this two part paper, a generalised interference alignment (GIA) technique is proposed to enhance the IA's capability in secrecy protection. A theoretical framework is established to analyze the two fundamental issues of GIA in Part I and then the performance of GIA in large-scale stochastic networks is characterized to illustrate how GIA benefits secrecy protection in Part II. The theoretical framework for GIA adopts methodologies from algebraic geometry, determines the necessary and sufficient feasibility conditions of GIA, and generates a set of algorithms that can solve the GIA problem. This framework sets up a foundation for the development and implementation of GIA.

cs.IT↗

arXiv2013

Power Optimization for Network Localization

Reliable and accurate localization of mobile objects is essential for many applications in wireless networks. In range-based localization, the position of the object can be inferred using the distance measurements from wireless signals exchanged with active objects or reflected by passive ones. Power allocation for ranging signals is important since it affects not only network lifetime and throughput but also localization accuracy. In this paper, we establish a unifying optimization framework for power allocation in both active and passive localization networks. In particular, we first determine the functional properties of the localization accuracy metric, which enable us to transform the power allocation problems into second-order cone programs (SOCPs). We then propose the robust counterparts of the problems in the presence of parameter uncertainty and develop asymptotically optimal and efficient near-optimal SOCP-based algorithms. Our simulation results validate the efficiency and robustness of the proposed algorithms.

cs.IT↗

arXiv2013

Modified CRB for Location and Velocity Estimation using Signals of Opportunity

We consider the problem of localizing two sensors using signals of opportunity from beacons with known positions. Beacons and sensors have asynchronous local clocks or oscillators with unknown clock skews and offsets. We model clock skews as random, and analyze the biases introduced by clock asynchronism in the received signals. By deriving the equivalent Fisher information matrix for the modified Bayesian Cramér-Rao lower bound (CRLB) of sensor position and velocity estimation, we quantify the errors caused by clock asynchronism.

cs.IT↗

arXiv2013

Robust power allocation for energy-efficient location aware networks

In wireless location-aware networks, mobile nodes (agents) typically obtain their positions through ranging with respect to nodes with known positions (anchors). Transmit power allocation not only affects network lifetime, throughput, and interference, but also determines localization accuracy. In this paper, we present an optimization framework for robust power allocation in network localization to tackle imperfect knowledge of network parameters. In particular, we formulate power allocation problems to minimize the squared position error bound (SPEB) and the maximum directional position error bound (mDPEB), respectively, for a given power budget. We show that such formulations can be efficiently solved via conic programming. Moreover, we design an efficient power allocation scheme that allows distributed computations among agents. The simulation results show that the proposed schemes significantly outperform uniform power allocation, and the robust schemes outperform their non-robust counterparts when the network parameters are subject to uncertainty.

cs.IT↗

arXiv2013

On the Performance Limits of Map-Aware Localization

Establishing bounds on the accuracy achievable by localization techniques represents a fundamental technical issue. Bounds on localization accuracy have been derived for cases in which the position of an agent is estimated on the basis of a set of observations and, possibly, of some a priori information related to them (e.g., information about anchor positions and properties of the communication channel). In this manuscript new bounds are derived under the assumption that the localization system is map-aware, i.e., it can benefit not only from the availability of observations, but also from the a priori knowledge provided by the map of the environment where it operates. Our results show that: a) map-aware estimation accuracy can be related to some features of the map (e.g., its shape and area) even though, in general, the relation is complicated; b) maps are really useful in the presence of some combination of low signal-to-noise ratios and specific geometrical features of the map (e.g., the size of obstructions); c) in most cases, there is no need of refined maps since additional details do not improve estimation accuracy.

cs.IT↗

arXiv2012

The Feasibility Conditions for Interference Alignment in MIMO Networks

Interference alignment (IA) has attracted great attention in the last few years for its breakthrough performance in interference networks. However, despite the numerous works dedicated to IA, the feasibility conditions of IA remains unclear for most network topologies. The IA feasibility analysis is challenging as the IA constraints are sets of high-degree polynomials, for which no systematic tool to analyze the solvability conditions exists. In this work, by developing a new mathematical framework that maps the solvability of sets of polynomial equations to the linear independence of their first-order terms, we propose a sufficient condition that applies to MIMO interference networks with general configurations. We have further proved that this sufficient condition matches with the necessary conditions under a wide range of configurations. These results further consolidate the theoretical basis of IA.

cs.IT↗

arXiv2011

Cooperative Network Navigation: Fundamental Limit and its Geometrical Interpretation

Localization and tracking of moving nodes via network navigation gives rise to a new paradigm, where nodes exploit both temporal and spatial cooperation to infer their positions based on intra- and inter-node measurements. While such cooperation can significantly improve the performance, it imposes intricate information processing that impedes network design and operation. In this paper, we establish a theoretical framework for cooperative network navigation and determine the fundamental limits of navigation accuracy using equivalent Fisher information analysis. We then introduce the notion of carry-over information, and provide a geometrical interpretation of the navigation information and its evolution in time. Our framework unifies the navigation information obtained from temporal and spatial cooperation, leading to a deep understanding of information evolution in the network and benefit of cooperation.

cs.IT↗

arXiv2011

Wireless Secrecy in Large-Scale Networks

The ability to exchange secret information is critical to many commercial, governmental, and military networks. The intrinsically secure communications graph (iS-graph) is a random graph which describes the connections that can be securely established over a large-scale network, by exploiting the physical properties of the wireless medium. This paper provides an overview of the main properties of this new class of random graphs. We first analyze the local properties of the iS-graph, namely the degree distributions and their dependence on fading, target secrecy rate, and eavesdropper collusion. To mitigate the effect of the eavesdroppers, we propose two techniques that improve secure connectivity. Then, we analyze the global properties of the iS-graph, namely percolation on the infinite plane, and full connectivity on a finite region. These results help clarify how the presence of eavesdroppers can compromise secure communication in a large-scale network.

cs.IT↗