Robust channel estimation for ultra-wide band communications
UWB (ultra-wide band) systems transmit low power signals through communication channels that operate in closed environments and in short distances resulting in multiple propagation trajectories. Moreover, the noise affecting these channels can be characterized by the use of statistical models with h...
- Autores:
-
Yánez Sánchez, Nicey Alberto
Ramirez, Juan Marcos
Paredes, Jose Luis
Pinto, Angel Dario
Torres, Jose Manuel
Perez, Marvin Luis
- Tipo de recurso:
- Article of journal
- Fecha de publicación:
- 2019
- Institución:
- Universidad de Medellín
- Repositorio:
- Repositorio UDEM
- Idioma:
- spa
- OAI Identifier:
- oai:repository.udem.edu.co:11407/5526
- Acceso en línea:
- http://hdl.handle.net/11407/5526
https://doi.org/10.22395/rium.v18n34a11
- Palabra clave:
- Ultra wide-band
Weighted median
Channel model
Low density representation
Robust channel estimation
Ultra wide-band
Média ponderada
Modelo do canal
Representação pouco poco densa
Estimativa robusta do canal
Ultra wide-band
Mediana ponderada
Modelo del canal
Representación poco densa
Estimación robusta del canal
- Rights
- License
- http://creativecommons.org/licenses/by-nc-sa/4.0/
Summary: | UWB (ultra-wide band) systems transmit low power signals through communication channels that operate in closed environments and in short distances resulting in multiple propagation trajectories. Moreover, the noise affecting these channels can be characterized by the use of statistical models with heavier tails that the ones exhibited by gaussian distribution. This article proposes a robust approach for the estimation of the parameters of UWB channels based on the weighted median. More specifically, it develops an algorithm of greedy search that exploits the low density characteristic of the channel’s impulsive response, in which the gains and delays of the relevant channels are determined by applying the weighted median on an scaled and displaced version of the signal received. This newly introduced algorithm is evaluated using extensive simulations in which the performance of the proposed algorithm surpasses the performance of the traditional greedy search algorithm for different levels of impulsive noise. |
---|