.png){kind=icon}
返回
Novel reduced-state BCJR algorithms
.png){kind=icon}
OA
AI
DOI：10.1109/TCOMM.2007.898830.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
BCJR algorithm is an exact and efficient algorithm to compute the marginal posterior distributions of state variables and pairs of consecutive state variables of a trellis structure. Due to its overwhelming complexity, reduced complexity variations, such as the M-BCJR algorithm, have been developed. In this paper, we propose improvements upon the conventional M-BCJR algorithm based on modified active state selection criteria. We propose selecting the active states based on estimates of the fixed-lag smoothed distributions of the state variables. We also present Gaussian approximation techniques for the low-complexity estimation of these fixed-lag smoothed distributions. The improved performance over the M-BCJR algorithm is shown via computer simulations.
Keyword:
decoding
digital communication
fading channels
multiple-input multiple-output (MIMO) systems
nonlinear detection
signal detection
state space methods
期刊
IF:
8.3
论文数:
1.2W
被引数:
3.6W
机构
暂无机构信息
引用论文
A TUTORIAL ON HIDDEN MARKOV-MODELS AND SELECTED APPLICATIONS IN SPEECH RECOGNITION关于语音识别中的隐马尔可夫模型和选定应用的教程.png)
PROCEEDINGS OF THE IEEE
PROCEEDINGS OF THE IEEEIF25.9
PREAI
分享收藏分享收藏分享收藏
查看更多内容