TY - JOUR UR - http://lib.ugent.be/catalog/pug01:5828092 ID - pug01:5828092 LA - eng TI - Low-complexity a posteriori probability approximation in EM-based channel estimation for trellis-coded systems PY - 2014 JO - (2014) EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING SN - 1687-1499 PB - 2014 AU - Aerts, Nico UGent 002003222576 802000640539 AU - Avram, Iancu UGent 002003333724 801002037663 AU - Moeneclaey, Marc AB - When estimating channel parameters in linearly modulated communication systems, the iterative expectation-maximization (EM) algorithm can be used to exploit the signal energy associated with the unknown data symbols. It turns out that the channel estimation requires at each EM iteration the a posteriori probabilities (APPs) of these data symbols, resulting in a high computational complexity when channel coding is present. In this paper, we present a new approximation of the APPs of trellis-coded symbols, which is less complex and requires less memory than alternatives from literature. By means of computer simulations, we show that the Viterbi decoder that uses the EM channel estimate resulting from this APP approximation experiences a negligible degradation in frame error rate (FER) performance, as compared to using the exact APPs in the channel estimation process. ER -Download RIS file
00000nam^a2200301^i^4500 | |||
001 | 5828092 | ||
005 | 20180813143606.0 | ||
008 | 150128s2014------------------------eng-- | ||
022 | a 1687-1499 | ||
024 | a 000347402300001 2 wos | ||
024 | a 1854/LU-5828092 2 handle | ||
024 | a 10.1186/1687-1499-2014-153 2 doi | ||
040 | a UGent | ||
245 | a Low-complexity a posteriori probability approximation in EM-based channel estimation for trellis-coded systems | ||
260 | c 2014 | ||
520 | a When estimating channel parameters in linearly modulated communication systems, the iterative expectation-maximization (EM) algorithm can be used to exploit the signal energy associated with the unknown data symbols. It turns out that the channel estimation requires at each EM iteration the a posteriori probabilities (APPs) of these data symbols, resulting in a high computational complexity when channel coding is present. In this paper, we present a new approximation of the APPs of trellis-coded symbols, which is less complex and requires less memory than alternatives from literature. By means of computer simulations, we show that the Viterbi decoder that uses the EM channel estimate resulting from this APP approximation experiences a negligible degradation in frame error rate (FER) performance, as compared to using the exact APPs in the channel estimation process. | ||
598 | a A1 | ||
100 | a Aerts, Nico u UGent 0 002003222576 0 802000640539 0 971557835154 | ||
700 | a Avram, Iancu u UGent 0 002003333724 0 801002037663 0 973809356213 | ||
700 | a Moeneclaey, Marc u TW07 0 801000521231 | ||
650 | a Technology and Engineering | ||
653 | a A posteriori symbol probability | ||
653 | a ML estimation | ||
653 | a ALGORITHM | ||
653 | a CONVOLUTIONAL-CODES | ||
653 | a Trellis-coded modulation | ||
653 | a EM algorithm | ||
653 | a Viterbi decoder | ||
773 | t EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING g EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING. 2014. q :< | ||
856 | 3 Full Text u https://biblio.ugent.be/publication/5828092/file/5847153 z [open] y 1687-1499-2014-153.pdf | ||
920 | a article | ||
Z30 | x EA 1 TW07 | ||
922 | a UGENT-EA |
All data below are available with an Open Data Commons Open Database License. You are free to copy, distribute and use the database; to produce works from the database; to modify, transform and build upon the database. As long as you attribute the data sets to the source, publish your adapted database with ODbL license, and keep the dataset open (don't use technical measures such as DRM to restrict access to the database).
The datasets are also available as weekly exports.