Open AccessBayesian blind turbo equaliser with reduced complexity based on channel estimate monitoring
Author(s) -
Alves João Paulo Luz,
Guimarães Alberto Gaspar,
Pinto Ernesto Leite
Publication year - 2015
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2015.0151
Subject(s) - equaliser , computer science , computational complexity theory , smoothing , channel (broadcasting) , algorithm , turbo , bayesian probability , sc fde , turbo code , decoding methods , equalization (audio) , artificial intelligence , telecommunications , engineering , computer vision , automotive engineering
The authors recall the application of fixed‐lag particle smoothing (FLPS) to perform blind turbo equalisation under a Bayesian framework, assuming that the noise variance is unknown. This approach has been successfully applied in previous works, at the price of increasing equaliser computational complexity. This study's main contribution is to propose a strategy to monitor, along the iterations, the quality of channel estimate and soft information about the coded symbols, to switch from FLPS to the BCJR algorithm when performing soft‐input soft‐output equalisation. This approach allows saving significant computational effort without affecting bit error rate performance. Simulation results and a careful computational complexity analysis show the effectiveness of the techniques herein presented.