Fig 1 - available via license: Creative Commons Attribution 4.0 International
Content may be subject to copyright.
Source publication
p>Joint Detection and Decoding over Multipath Channels: the Known Path</p
Context in source publication
Similar publications
Overview of the joint profiling technologies of 5mC and 5hmC.
In this chapter, we propose unique methods that give very good approximations and easy calculations for the design of press-connect joints.
Citations
... By focusing on front-end communication systems, we can track all unknown channel parameters through SPA on factor graphs. While this approach, i.e., the front-end receiver design using SPA, was initially proposed by the authors of this paper in [13], its advantages quickly gained the attention of researchers [14], where it has been named as discrete time models. In our study, we discretize channel parameters such as channel paths and attenuation coefficients, both in the channel low-pass equivalent (for illustrative purposes) and in the front-end strategy. ...
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.
