SearcharxivSearch

arXiv subjects

Moe Z. Win

Publications and source records attributed to Moe Z. Win.

At least 19 recordsLinked to original sources

A simple derivation of the Kalman filter

In this lecture note, we present a concise and self-contained derivation of the discrete-time Kalman filter equations that requires only a basic understanding of least squares estimation. The treatment is designed to minimize mathematical overhead while preserving both rigor and generality.

math.OC

DCFNet: Doppler Correction Filter Network for Integrated Sensing and Communication in Multi-User MIMO-OFDM Systems

Integrated sensing and communication (ISAC) is a headline feature for the forthcoming IMT-2030 and 6G releases, yet a concrete solution that fits within the established orthogonal frequency division multiplexing (OFDM) family remains open. Specifically, Doppler-induced inter-carrier interference (ICI) destroys sub-carrier orthogonality of OFDM sensing signals, blurring range-velocity maps and severely degrading sensing accuracy. Building on multi-user multi-input-multi-output (MIMO) OFDM systems, this paper proposes Doppler-Correction Filter Network (DCFNet), an AI-native ISAC model that delivers fine range-velocity resolution at minimal complexity without altering the legacy frame structure. A bank of DCFs first shifts dominant ICI energy away from critical Doppler bins; a compact deep learning network then suppresses the ICI. To further enhance the range and velocity resolutions, we propose DCFNet with local refinement (DCFNet-LR), which applies a generalized likelihood ratio test (GLRT) to refine target estimates of DCFNet to sub-cell accuracy. Simulation results show that DCFNet-LR runs $143\times$ faster than maximum likelihood search and achieves significantly superior performance, reducing the range RMSE by up to $2.7 \times 10^{-4}$ times and the velocity RMSE by $6.7 \times 10^{-4}$ times compared to conventional detection methods.

eess.SP

Satellite-Terrestrial Quantum Networks and the Global Quantum Internet

This paper will explore the design and implementation of quantum networks in space integrated with quantum networks on Earth. We propose a three-layer approach, involving GEO and LEO satellites integrated with terrestrial ground stations. We first analyze the channel conditions between the three layers, and then highlight the key role of LEO satellites in the integrated space-terrestrial system - namely the source of entanglement distribution between specified terrestrial stations via direct downlink quantum-optical channels. The GEO satellites in the considered system are used primarily as coordination stations, managing and directing the LEO satellites regarding the positioning and timing of entanglement distribution. Complexity, in the form of entanglement distillation and quantum-state correction, is concentrated at the terrestrial stations, and teleportation is used as the primary quantum channel in the LEO uplinks and the inter-terrestrial channels. Although our designs are futuristic in that they assume limited quantum memory at the transceivers, we also discuss some near-term uses of our network in which no quantum memory is available.

quant-ph

Self-supervised Contrastive Learning for 6G UM-MIMO THz Communications: Improving Robustness Under Imperfect CSI

This paper investigates the potential of contrastive learning in 6G ultra-massive multiple-input multiple-output (UM-MIMO) communication systems, specifically focusing on hybrid beamforming under imperfect channel state information (CSI) conditions at THz. UM-MIMO systems are promising for future 6G wireless communication networks due to their high spectral efficiency and capacity. The accuracy of CSI significantly influences the performance of UM-MIMO systems. However, acquiring perfect CSI is challenging due to various practical constraints such as channel estimation errors, feedback delays, and hardware imperfections. To address this issue, we propose a novel self-supervised contrastive learning-based approach for hybrid beamforming, which is robust against imperfect CSI. We demonstrate the power of contrastive learning to tackle the challenges posed by imperfect CSI and show that our proposed method results in improved system performance in terms of achievable rate compared to traditional methods.

eess.SP

Massive Uncoordinated Multiple Access for Beyond 5G

Existing wireless communication systems have been mainly designed to provide substantial gain in terms of data rates. However, 5G and Beyond will depart from this scheme, with the objective not only to provide services with higher data rates. One of the main goals is to support massive machine-type communications (mMTC) in the IoT applications. Supporting massive uplink (UP) communications for devices with sporadic traffic pattern and short-packet size, as it is in many mMTC use cases, is a challenging task, particularly when the control signaling is not negligible in size compared to the payload. Also, channel estimation is challenging for sporadic and short-packet transmission due to the limited number of employed pilots. In this paper, a new UP multiple access (MA) scheme is proposed for mMTC, which can support a large number of uncoordinated IoT devices with short-packet and sporadic traffic. The proposed UP MA scheme removes the overheads associated with the device identifier as well as pilots related to channel estimation. An alternative mechanism for device identification is proposed, where a unique spreading code is dedicated to each IoT device. This unique code is simultaneously used for the spreading purpose and device identification. Two IoT device identification algorithms which employ sparse signal reconstruction methods are proposed to determine the active IoT devices prior to data detection. Specifically, the BIC model order selection method is employed to develop an IoT device identification algorithm for unknown and time-varying probability of device activity. Our proposed MA scheme benefits from a non-coherent multiuser detection algorithm based on machine learning to enable data detection without a priori knowledge on channel state information. The effectiveness of the proposed MA scheme for known and unknown probability of activity is supported by simulation results.

cs.IT

Quantum-enhanced Doppler lidar

We propose a quantum-enhanced lidar system to estimate a target's radial velocity which employs squeezed and frequency entangled signal and idler beams. We compare its performance against a classical protocol using a coherent state with the same pulse duration and energy, showing that quantum resources provide a precision enhancement in the estimation of the velocity of the object. We identify three distinct parameter regimes characterized by the amount of squeezing and frequency entanglement. In two of them, a quantum advantage exceeding the standard quantum limit is achieved assuming no photon losses. Additionally, we show that an optimal measurement to attain these results in the lossless case is frequency-resolved photon counting. Finally, we consider the effect of photon losses for the high-squeezing regime, which leads to a constant factor quantum advantage higher than $3$ dB in the variance of the estimator, given a roundtrip lidar-to-target-to-lidar transmissivity larger than $50\%$.

quant-ph

Cramér-Rao Bounds for Near-Field Localization

Multiple antenna arrays play a key role in wireless networks for communications but also localization and sensing. The use of large antenna arrays pushes towards a propagation regime in which the wavefront is no longer plane but spherical. This allows to infer the position and orientation of an arbitrary source from the received signal without the need of using multiple anchor nodes. To understand the fundamental limits of large antenna arrays for localization, this paper fusions wave propagation theory with estimation theory, and computes the Cram{é}r-Rao Bound (CRB) for the estimation of the three Cartesian coordinates of the source on the basis of the electromagnetic vector field, observed over a rectangular surface area. To simplify the analysis, we assume that the source is a dipole, whose center is located on the line perpendicular to the surface center, with an orientation a priori known. Numerical and asymptotic results are given to quantify the CRBs, and to gain insights into the effect of various system parameters on the ultimate estimation accuracy. It turns out that surfaces of practical size may guarantee a centimeter-level accuracy in the mmWave bands.

eess.SP

Fusion of Sensor Measurements and Target-Provided Information in Multitarget Tracking

Tracking multiple time-varying states based on heterogeneous observations is a key problem in many applications. Here, we develop a statistical model and algorithm for tracking an unknown number of targets based on the probabilistic fusion of observations from two classes of data sources. The first class, referred to as target-independent perception systems (TIPSs), consists of sensors that periodically produce noisy measurements of targets without requiring target cooperation. The second class, referred to as target-dependent reporting systems (TDRSs), relies on cooperative targets that report noisy measurements of their state and their identity. We present a joint TIPS-TDRS observation model that accounts for observation-origin uncertainty, missed detections, false alarms, and asynchronicity. We then establish a factor graph that represents this observation model along with a state evolution model including target identities. Finally, by executing the sum-product algorithm on that factor graph, we obtain a scalable multitarget tracking algorithm with inherent TIPS-TDRS fusion. The performance of the proposed algorithm is evaluated using simulated data as well as real data from a maritime surveillance experiment.

eess.SP

Cooperative Localization and Multitarget Tracking in Agent Networks with the Sum-Product Algorithm

This paper addresses the problem of multitarget tracking using a network of sensing agents with unknown positions. Agents have to both localize themselves in the sensor network and, at the same time, perform multitarget tracking in the presence of clutter and miss detection. These two problems are jointly resolved using a holistic and centralized approach where graph theory is used to describe the statistical relationships among agent states, target states, and observations. A scalable message passing scheme, based on the sum-product algorithm, enables to efficiently approximate the marginal posterior distributions of both agent and target states. The proposed method is general enough to accommodate a full multistatic network configuration, with multiple transmitters and receivers. Numerical simulations show superior performance of the proposed joint approach with respect to the case in which cooperative self-localization and multitarget tracking are performed separately, as the former manages to extract valuable information from targets. Lastly, data acquired in 2018 by the NATO Science and Technology Organization (STO) Centre for Maritime Research and Experimentation (CMRE) through a network of autonomous underwater vehicles demonstrates the effectiveness of the approach in a practical application.

eess.SP

Cooperative Localization in Massive Networks

Network localization is capable of providing accurate and ubiquitous position information for numerous wireless applications. This paper studies the accuracy of cooperative network localization in large-scale wireless networks. Based on a decomposition of the equivalent Fisher information matrix (EFIM), we develop a random-walk-inspired approach for the analysis of EFIM, and propose a position information routing interpretation of cooperative network localization. Using this approach, we show that in large lattice and stochastic geometric networks, when anchors are uniformly distributed, the average localization error of agents grows logarithmically with the reciprocal of anchor density in an asymptotic regime. The results are further illustrated using numerical examples.

cs.IT

Counterfactual Full-Duplex Communication

This paper proposes two new full-duplex quantum communication protocols to exchange classical or quantum information between two remote parties simultaneously without transferring a physical particle over the quantum channel. The first protocol, called quantum duplex coding, enables to exchange of a classical bit using a preshared maximally entangled pair of qubits by means of counterfactual disentanglement. The second protocol, called quantum telexchanging, enables to exchange an arbitrary unknown qubit without using preshared entanglement by means of counterfactual entanglement and disentanglement. We demonstrate the quantum duplex coding and quantum telexchanging by exploiting counterfactual electron-photon interaction gates and show that these quantum duplex communication protocols form full-duplex binary erasure channel and quantum erasure channels, respectively.

quant-ph

Counterfactual Concealed Telecomputation

Distributed computing is a fastest growing field -- enabling virtual computing, parallel computing, and distributed storage. By exploiting the counterfactual techniques, we devise a distributed blind quantum computation protocol to perform a universal two-qubit controlled unitary operation for any input state without using preshared entanglement and without exchanging physical particles between remote parties. This distributed protocol allows Bob to counterfactully apply an arbitrary unitary operator to Alice's qubit in probabilistic fashion, without revealing the operator to her, using a control qubit -- called the counterfactual concealed telecomputation (CCT). It is shown that the protocol is valid for general input states and that single-qubit unitary teleportation is a special case of CCT. The quantum circuit for CCT can be implemented using the (chained) quantum Zeno gates and the protocol becomes deterministic with simplified circuit implementation if the initial composite state of Alice and Bob is a Bell-type state.

quant-ph

Enhanced Uplink Quantum Communication with Satellites via Downlink Channels

In developing the global Quantum Internet, quantum communication with low-Earth-orbit satellites will play a pivotal role. Such communication will need to be two way: effective not only in the satellite-to-ground (downlink) channel but also in the ground-to-satellite channel (uplink). Given that losses on this latter channel are significantly larger relative to the former, techniques that can exploit the superior downlink to enhance quantum communication in the uplink should be explored. In this work we do just that - exploring how continuous variable entanglement in the form of two-mode squeezed vacuum (TMSV) states can be used to significantly enhance the fidelity of ground-to-satellite quantum-state transfer relative to direct uplink-transfer. More specifically, through detailed phase-screen simulations of beam evolution through turbulent atmospheres in both the downlink and uplink channels, we demonstrate how a TMSV teleportation channel created by the satellite can be used to dramatically improve the fidelity of uplink coherent-state transfer relative to direct transfer. We then show how this, in turn, leads to the uplink-transmission of a higher alphabet of coherent states. Additionally, we show how non-Gaussian operations acting on the received component of the TMSV state at the ground station can lead to even further enhancement. Since TMSV states can be readily produced in situ on a satellite platform and form a reliable teleportation channel for most quantum states, our work suggests future satellites forming part of the emerging Quantum Internet should be designed with uplink-communication via TMSV teleportation in mind.

quant-ph

Piggybacking on Quantum Streams

This paper shows that it is possible to piggyback classical information on a stream of qubits protected by quantum error correcting codes. The piggyback channel can be created by introducing intentional errors corresponding to a controlled sequence of syndromes. These syndromes are further protected, when quantum noise is present, by classical error correcting codes according to a performance-delay trade-off. Classical information can thus be added and extracted at arbitrary epochs without consuming additional quantum resources and without disturbing the quantum stream.

quant-ph

Peregrine: Network Localization and Navigation with Scalable Inference and Efficient Operation

Location-aware networks will enable new services and applications in fields such as autonomous driving, smart cities, and the Internet-of-Things. One promising solution for ubiquitous localization is network localization and navigation (NLN), where devices form a network that cooperatively localizes itself, reducing the infrastructure needed for accurate localization. This paper introduces a real-time NLN system named Peregrine, which combines distributed NLN algorithms with commercially available ultra-wideband (UWB) sensing and communication technology. The Peregrine software application, for the first time, integrates three NLN algorithms to jointly perform the tasks of localization and network operation in a technology agnostic manner, leveraging both spatial and temporal cooperation. Peregrine hardware is composed of low-cost, compact devices that comprise a microprocessor and a commercial UWB radio. This paper presents the design of the Peregrine system and characterizes the performance impact of each algorithmic component. Indoor experiments validate that our approach to realizing NLN is both reliable and scalable, and maintains sub-meter-level accuracy even in challenging indoor scenarios.

cs.IT

State Estimation for Future Energy Grids

Today's power generation and distribution networks are quickly moving toward automated control and integration of renewable resources - a complex, integrated system termed the Smart Grid. A key component in planning and managing of Smart Grids is State Estimation (SE). The state-of-the art SE technologies today operate on the basis of slow varying dynamics of the current network and make simplifying linearity assumptions. However, the integration of smart readers and green resources will result in significant non-linearity and unpredictability in the network. Therefore in future Smart Grids, there is need for ever more accurate and real-time algorithms. In this work, we propose and examine new SE methods that aim to achieve these measures by approximating the true distribution of the state variables, rather than a linearized version as done for instance in Kalman filtering. Through simulations we show that in the presence of non-linearities and non-Gaussian noise, our general SE framework improves accuracy where linear and Kalman-like filters exhibit impaired performance.

eess.SP

Molecular Communication with Anomalous Diffusion in Stochastic Nanonetworks

Molecular communication in nature can incorporate a large number of nano-things in nanonetworks as well as demonstrate how nano-things communicate. This paper presents molecular communication where transmit nanomachines deliver information molecules to a receive nanomachine over an anomalous diffusion channel. By considering a random molecule concentration in a space-time fractional diffusion channel, an analytical expression is derived for the first passage time (FPT) of the molecules. Then, the bit error rate of the lth nearest molecular communication with timing binary modulation is derived in terms of Fox's H-function. In the presence of interfering molecules, the mean and variance of the number of the arrived interfering molecules in a given time interval are presented. Using these statistics, a simple mitigation scheme for timing modulation is provided. The results in this paper provide the network performance on the error probability by averaging over a set of random distances between the communicating links as well as a set of random FPTs caused by the anomalous diffusion of molecules. This result will help in designing and developing molecular communication systems for various design purposes.

cs.IT

Molecular Communication in H-Diffusion

The random propagation of molecules in a fluid medium is characterized by the spontaneous diffusion law as well as the interaction between the environment and molecules. In this paper, we embody the anomalous diffusion theory for modeling and analysis in molecular communication. We employ H-diffusion to model a non-Fickian behavior of molecules in diffusive channels. H-diffusion enables us to model anomalous diffusion as the subordinate relationship between self-similar parent and directing processes and their corresponding probability density functions with two H-variates in a unified fashion. In addition, we introduce standard H-diffusion to make a bridge of normal diffusion across well-known anomalous diffusions such as space-time fractional diffusion, Erdelyi-Kober fractional diffusion, grey Brownian motion, fractional Brownian motion, and Brownian motion. We then characterize the statistical properties of uncertainty of the random propagation time of a molecule governed by H-diffusion laws by introducing a general class of molecular noise---called H-noise. Since H-noise can be an algebraic tailed process, we provide a concept of H-noise power using finite logarithm moments based on zero-order statistics. Finally, we develop a unifying framework for error probability analysis in a timing-based molecular communication system with a concept of signal-to-noise power ratio.

cs.IT