2013/06/16 by Shachar Shayovitz, Shayovitz, Shachar, Dan Rapaheli +1
Biochemistry, Genetics and Molecular Biology · Computer Science · Engineering · Mathematics · #Advanced Wireless Communication Techniques #Algorithms and Data Compression #FOS: Computer and information sciences #Fractal and DNA sequence analysis #Information Theory (cs.IT) #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1306.3693
submitted to IEEE transactions on communications
openalex publication_date 2013/06/16 · arxiv created 2013/06/22 · arxiv updated 2013/06/25 · openalex created_date 2019/06/27 · openalex updated_date 2026/07/28
In this work, a new low complexity iterative algorithm for decoding data transmitted over strong phase noise channels is presented. The algorithm is based on the Sum & Product Algorithm (SPA) with phase noise messages modeled as Tikhonov mixtures. Since mixture based Bayesian inference such as SPA, creates an exponential increase in mixture order for consecutive messages, mixture reduction is necessary. We propose a low complexity mixture reduction algorithm which finds a reduced order mixture whose dissimilarity metric is mathematically proven to be upper bounded by a given threshold. As part of the mixture reduction, a new method for optimal clustering provides the closest circular distribution, in Kullback Leibler sense, to any circular mixture. We further show a method for limiting the number of tracked components and further complexity reduction approaches. We show simulation results and complexity analysis for the proposed algorithm and show better performance than other state of the art low complexity algorithms. We show that the Tikhonov mixture approximation of SPA messages is equivalent to the tracking of multiple phase trajectories, or also can be looked as smart multiple phase locked loops (PLL). When the number of components is limited to one the result is similar to a smart PLL.