Accurate channel estimation may require complex algorithms for effective results, especially in the case of a multiuser detector. The introduction of Graphic Processing Units (GPUs) has opened up new possibilities for the implementation of numerically intensive channel estimation algorithms. This paper studies the implementation on GPUs of channel estimation algorithms for channels affected by strong phase noise. While classic Maximum Likelihood estimation is still the most competitive in terms of throughput and memory bandwidth, Steepest Ascent algorithms show the largest speed improvement due to their structure, which is the most suitable for implementation on a parallel processor like the GPU.

Design Considerations for Massively Parallel Channel Estimation Algorithms

VANGELISTA, LORENZO
2011

Abstract

Accurate channel estimation may require complex algorithms for effective results, especially in the case of a multiuser detector. The introduction of Graphic Processing Units (GPUs) has opened up new possibilities for the implementation of numerically intensive channel estimation algorithms. This paper studies the implementation on GPUs of channel estimation algorithms for channels affected by strong phase noise. While classic Maximum Likelihood estimation is still the most competitive in terms of throughput and memory bandwidth, Steepest Ascent algorithms show the largest speed improvement due to their structure, which is the most suitable for implementation on a parallel processor like the GPU.
2011
Proceedings of the the 8th International al Symposium on Wireless Communications Systems
Proc. Intern. Symp. on Wireless Commun. Syst. (ISWCS)
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11577/2476345
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? ND
  • OpenAlex ND
social impact