logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

Why use Bayesian equalization based on finite data blocks?

delete2001-01-01
delete4
PRE
AI
J
Jugurta Montalvão *
B
Bernadette Dorizzi
M
Mota, JCM
DOI：10.1016/S0165-1684(00)00194-8delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
A brief overview of Bayesian equalizers will be given. Knowing that all realistic implementations of Bayesian equalizers are approximations of the optimal one tin the sense of minimum decision error probability), we review some classical implementations found in literature and we study the performance degradation induced by the use of finite memory Bayesian equalizers instead of growing memory structures. Finally, we also point out some new ideas and results concerning sub-optimal Bayesian structures. (C) 2001 Elsevier Science B.V. All rights reserved.
Keywords:
finite memory equalizer
Bayesian equalizer
classification and equalization
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Signal Processing cover
Signal Processing
IF:
3.6
Papers:
9.9K
Citations:
1.7W

Organization

No organization information available