MAP optimum receiver mitigating correlated impulsive noise

Sacuto, Fabien; Ndo, Gaetan; Labeau, Fabrice; Agba, Basile L.

doi:10.1109/wcnc.2016.7564982

Cited by 2 publications

(2 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Using the transition probabilities of the Markov chain, the detection is done using the BCJR algorithm as discussed before. A related method has been proposed in [20] for symbol detection in the presence of impulsive noise for powerline communications. However, a fixed noise model with a given and constant number of states and known noise variances corresponding to the states and transition probabilities between states has been assumed in [20].…”

Section: E Further Complexity Reductionmentioning

confidence: 99%

“…A related method has been proposed in [20] for symbol detection in the presence of impulsive noise for powerline communications. However, a fixed noise model with a given and constant number of states and known noise variances corresponding to the states and transition probabilities between states has been assumed in [20]. Thus, it was sufficient to consider 19 states for the full-state modeling of the impulsive noise.…”

Section: E Further Complexity Reductionmentioning

confidence: 99%

See 1 more Smart Citation

Efficient Detectors for Telegram Splitting based Transmission in Low Power Wide Area Networks with Bursty Interference

Kisseleff¹,

Kneissl²,

Kilian³

et al. 2020

Preprint

View full text Add to dashboard Cite

Low Power Wide Area (LPWA) networks are known to be highly vulnerable to external in-band interference in terms of packet collisions which may substantially degrade the system performance. In order to enhance the performance in such cases, the telegram splitting (TS) method has been proposed recently. This approach exploits the typical burstiness of the interference via forward error correction (FEC) and offers a substantial performance improvement compared to other methods for packet transmissions in LPWA networks. While it has been already demonstrated that the TS method benefits from knowledge on the current interference state at the receiver side, corresponding practical receiver algorithms of high performance are still missing. The modeling of the bursty interference via Markov chains leads to the optimal detector in terms of a-posteriori symbol error probability. However, this solution requires a high computational complexity, assumes an a-priori knowledge on the interference characteristics and lacks flexibility. We propose a further developed scheme with increased flexibility and introduce an approach to reduce its complexity while maintaining a close-to-optimum performance. In particular, the proposed lowcomplexity solution substantially outperforms existing practical methods in terms of packet error rate and therefore is highly beneficial for practical LPWA network scenarios.

show abstract

Section: E Further Complexity Reductionmentioning

confidence: 99%

Section: E Further Complexity Reductionmentioning

confidence: 99%