An alternative derivation for the well-known approximate message passing (AMP) algorithm proposed by Donoho is presented in this letter. Compared with the original derivation, which exploits central limit theorem and Taylor expansion to simplify belief propagation (BP), our derivation resorts to expectation propagation (EP) and the neglect of high-order terms in large system limit. This alternative derivation leads to a different yet provably equivalent form of message passing, which explicitly establishes the intrinsic connection between AMP and EP, thereby offering some new insights in the understanding and improvement of AMP.
This paper investigates the linear precoder design for spectrum sharing in multi-antenna cognitive radio networks with finite-alphabet inputs. It formulates the precoding problem by maximizing the constellation-constrained mutual information between the secondary-user transmitter and secondary-user receiver while controlling the interference power to primary-user receivers. This formulation leads to a nonlinear and nonconvex problem, presenting a major barrier to obtain optimal solutions. This work proposes a global optimization algorithm, namely Branch-and-bound Aided Mutual Information Optimization (BAMIO), that solves the precoding problem with arbitrary prescribed tolerance. The BAMIO algorithm is designed based on two key observations: First, the precoding problem for spectrum sharing can be reformulated to a problem minimizing a function with bilinear terms over the intersection of multiple co-centered ellipsoids. Second, these bilinear terms can be relaxed by its convex and concave envelopes. In this way, a sequence of relaxed problems is solved over a shrinking feasible region until the tolerance is achieved. The BAMIO algorithm calculates the optimal precoder and the theoretical limit of the transmission rate for spectrum sharing scenarios. By tuning the prescribed tolerance of the solution, it provides a trade-off between desirable performance and computational complexity. Numerical examples show that the BAMIO algorithm offers near global optimal solution with only several iterations. They also verify that the large performance gain in mutual information achieved by the BAMIO algorithm also represents the large gain in the coded bit-error rate.
1 December 2015 in IET Control Theory & Applications
This study is concerned with the navigational state estimation problem for a class of networked spatial‐navigation systems subject to random parametric uncertainties (RPUs) and communication link failures (CLFs). The observations of the novel systems, comprising remote‐access neighbours' states and relative measures, are communicated through wireless packets, and thus are exposed to the impacts of RPUs and CLFs. In this study, a decentralised moving‐horizon estimation approach is introduced to handle these ill‐conditioned issues, and comprises two stages. First, a regional estimation is determined based on cooperative observations of spatial neighbours; and second, a collective estimation is derived through the fusion of regional estimation, local estimation and/or the cooperative estimations from spatial neighbours. Moreover, the resulting min–max problem is solved by a robust recursive scheme, which allows one to determine approximate estimates with a reduced computational condition. The convergence properties of the optimal estimator are also studied. The obtained stability condition implicitly establishes a relationship among the upper bound of estimation error, RPUs, and the CLF probability. Finally, an illustrative example of networked unmanned aerial vehicles (UAVs) is given to demonstrate the main features of the proposed estimator design approach.
22 January 2020 in IEEE Journal of Selected Topics in Signal Processing
The 360-degree video/image, also called an omnidirectional video/image or panoramic video/image, is very important in some emerging areas such as virtual reality (VR). Therefore, corresponding image generation algorithms are urgently needed. However, existing image generation models mainly focus on 2-D images and do not consider the spherical structures of panoramic images. In this paper, we propose a panoramic image generation method based on spherical convolution and generative adversarial networks, called spherical generative adversarial networks (SGANs). We adopt the sketch map as the input, which is a concise geometric structure representation of the panoramic image, e.g., comprising approximately 7% of the pixels for a 583×1163 image. Through adversarial learning, a realistic-looking, plausible and high-fidelity spherical image can be obtained from the sparse sketch map. In particular, we build a dataset of the sketch maps using a visual computation-based sketching model. Then, by optimizing SGANs with GAN loss, feature matching loss and perceptual loss, realistic textures and details are recovered gradually. On one hand, it is an improvement using the sparse sketch map as input rather than the denser input, e.g., the features of the textures and colors. On the other hand, spherical convolution helps to remedy space-varying distortions of the planar projection. We conduct extensive experiments on some public panoramic image datasets and compare them with state-of-the-art techniques to validate the superior performance of the proposed approach.