No abstract

No abstract

No abstract

This paper proposes a closed-loop sparse channel estimation (CE) scheme for wideband millimeter-wave hybrid full-dimensional multiple-input multiple-output and time division duplexing based systems, which exploits the channel sparsity in both angle and delay domains. At the downlink CE stage, random transmit precoding matrix is designed at base station (BS) for channel sounding, and receive combining matrices at user devices (UDs) are designed whereby the hybrid array is visualized as a low-dimensional digital array for facilitating the multi-dimensional unitary ESPRIT (MDU-ESPRIT) algorithm to estimate respective angle-of-arrivals (AoAs). At the uplink CE stage, the estimated downlink AoAs, namely, uplink angle-ofdepartures (AoDs), are exploited to design multi-beam transmit precoding matrices at UDs to enable BS to estimate the uplink AoAs, i.e., the downlink AoDs, and delays of different UDs, whereby the MDU-ESPRIT algorithm is used based on the designed receive combining matrix at BS. Furthermore, a maximum likelihood approach is proposed to pair the channel parameters acquired at the two stages, and the path gains are then obtained using least squares estimator. According to spectrum estimation theory, our solution can acquire the super-resolution estimations of the AoAs/AoDs and delays of sparse multipath components with low training overhead. Simulation results verify the better CE performance and lower computational complexity of our solution over state-of-the-art approaches.

No abstract

Localization and synchronization are very important in many wireless applications such as monitoring and vehicle tracking. Utilizing the same time of arrival (TOA) measurements for simultaneous localization and synchronization is challenging. In this paper, we present a factor graph (FG) representation of the joint localization and time synchronization problem based on TOA measurements, in which the non-line-of-sight measurements are also taken into consideration. On this FG, belief propagation (BP) message passing and variational message passing (VMP) are applied to derive two fully distributed cooperative algorithms with low computational requirements. Due to the nonlinearity in the observation function, it is intractable to compute the messages in closed form and most existing solutions rely on Monte Carlo methods, e.g., particle filtering. We linearize a specific nonlinear term in the expressions of messages, which enables us to use a Gaussian representation for all messages. Accordingly, only the mean and variance have to be updated and transmitted between neighboring nodes, which significantly reduces the communication overhead and computational complexity. A message passing schedule scheme is proposed to trade off between estimation performance and communication overhead. Simulation results show that the proposed algorithms perform very close to particle-based methods with much lower complexity especially in densely connected networks.

No abstract

No abstract