Partial Path Overlapping Mitigation: An Initial Stage for Joint Detection and Decoding in Multipath Channels Using the Sum–Product Algorithm
View/ Open
Author
Mirbadin, Anoush
Zaraki, Abolfazl
Attention
2299/28437
Abstract
This paper addresses the problem of mitigating unknown partial path overlaps in communication systems. This study demonstrates that by utilizing the front-end insight of communication systems along with the sum–product algorithm applied to factor graphs, it is possible not only to track these overlapping components accurately, but also to detect all multipath channel impairments simultaneously. The proposed methodology involves discretizing channel parameters, such as channel paths and attenuation coefficients, to ensure the most accurate computation of means of Gaussian observations. These parameters are modeled as Bernoulli random variables with priors set to 0.5. A notable aspect of the algorithm is its integration of the received signal power into the calculation of noise variance, which is critical for its performance. To further reduce the receiver complexity, a novel implementation strategy, based on provided pre-defined look up tables (LOTs) to the reciver, is introduced. The simulation results, covering both distributed and concentrated pilot scenarios, reveal that the algorithm performs almost equally under both conditions and surpasses the established upper bound in performance.