期刊文献+
共找到4篇文章
< 1 >
每页显示 20 50 100
Optimal M-BCJR Turbo Decoding: The Z-MAP Algorithm
1
作者 Aissa Ouardi Ali Djebbari Boubakar Seddik Bouazza 《Wireless Engineering and Technology》 2011年第4期230-234,共5页
In this paper, we propose a novel idea for improvement performances of the leader M-BCJR algorithm functioning in low complexity. The basic idea consists to localize error instant possibility, and then increase the co... In this paper, we propose a novel idea for improvement performances of the leader M-BCJR algorithm functioning in low complexity. The basic idea consists to localize error instant possibility, and then increase the complexity around this moment. We also propose an easy and important idea for early localisation of erroneous moments. We call this new algorithm Z-MAP. The simulations show that the improvement of performances is significant. The performances of Z-MAP turbo decoding are so close to full MAP-BCJR performances. Furthermore, the complexity is the same that of the M-BCJR. So, Z-MAP is an optimal version of M-BCJR algorithm. 展开更多
关键词 map-bcjr ALGORITHM M-BCJR TURBO Decoding Complexity Reduction Error LOCALISATION Criterion
在线阅读 下载PDF
基于最大后验概率准则的天基星座网络多用户检测方法 被引量:3
2
作者 张克楠 李兴乾 +1 位作者 杨胜 丁凯 《中国空间科学技术》 CSCD 北大核心 2023年第4期66-72,共7页
天基星座网络中用户可以随意进出自由组网,活动用户的数量、身份和发送的数据随机变化,对接收用户的性能造成很大影响。多用户检测是指识别每个活动用户的身份并检测每个活动用户发送的数据。传统方法假设活动用户数等于网络可以容纳的... 天基星座网络中用户可以随意进出自由组网,活动用户的数量、身份和发送的数据随机变化,对接收用户的性能造成很大影响。多用户检测是指识别每个活动用户的身份并检测每个活动用户发送的数据。传统方法假设活动用户数等于网络可以容纳的最大用户数,这种方法模型比较简单且误码率性能不够理想。提出了一种基于最大后验概率准则的多用户检测方法,该方法将用户的活动状态建模为马尔科夫链,并将多用户检测转换为在网格图中使用BCJR算法搜索最优路径。仿真结果表明,当活动状态错误概率和符号错误概率达到10^(-3)时,本文所提方法与对照方法相比分别获得2.6 dB和1 dB信噪比增益。 展开更多
关键词 天基星座网络 多用户检测 最大后验概率准则 BCJR算法 马尔科夫链 网格图
在线阅读 下载PDF
A New Improved Symbol Mapper/8-Ary Constellation for BICM-ID
3
作者 Slimane Benmahmoud Ali Djebbari 《Wireless Engineering and Technology》 2013年第2期65-70,共6页
This contribution proposes a new combination symbol mapper/8-ary constellation, which is a joint optimization of an 8-ary signal constellation and its symbol mapping operation, to improve the performance of Bit Interl... This contribution proposes a new combination symbol mapper/8-ary constellation, which is a joint optimization of an 8-ary signal constellation and its symbol mapping operation, to improve the performance of Bit Interleaved Coded Modulation with Iterative Decoding (BICM-ID). The basic idea was to use the so called (1,7) constellation (which is a capacitive efficient constellation) instead of the conventional 8-PSK constellation and to choose the most suitable mapping for it. A comparative study between the combinations most suitable mapping/(1,7) constellation and SSP mapping/conventional 8-PSK constellation has been carried out. Simulation results showed that the 1st combination significantly outperforms the 2nd combination and with only 4 iterations, it gives better performance than the 2nd combination with 8 iterations. A gain of 4 dB is given by iteration 4 of the 1st combination compared to iteration 8 of the 2nd combination at a BER level equal to 10-5, and it (iteration 4 of the 1st combination) can attain a BER equal to 10-7 for, only, a SNR = 5.6 dB. 展开更多
关键词 Bit Interleaved Coded Modulation BICM Iterative Decoding/Processing Log-Likelihood Ratios (LLRs) 8PSK CONSTELLATION Signal MAPPINGS CONSTELLATION Labeling Maps EXTRINSIC Information BCJR Algorithm
在线阅读 下载PDF
Layered MAP algorithm for MIMO ISI channels
4
作者 MO Yong ZHOU Xing-wei LI Dao-ben 《The Journal of China Universities of Posts and Telecommunications》 EI CSCD 2008年第4期19-23,共5页
The layered maximum a posteriori (L-MAP) algorithm has been proposed to detect signals under frequency selective fading multiple input multiple output (MIMO) channels. Compared to the optimum MAP detector, the L-M... The layered maximum a posteriori (L-MAP) algorithm has been proposed to detect signals under frequency selective fading multiple input multiple output (MIMO) channels. Compared to the optimum MAP detector, the L-MAP algorithm can efficiently identify signal bits, and the complexity grows linearly with the number of input antennas. The basic idea of L-MAP is to operate on each input sub-stream with an optimum MAP sequential detector separately by assuming the other streams are Gaussian noise. The soft output can also be forwarded to outer channel decoder for iterative decoding. Simulation results show that the proposed method can converge with a small number of iterations under different channel conditions and outperforms other sub-optimum detectors for rank-deficient channels. 展开更多
关键词 MIMO L-MAP Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm soft-in soft-out
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部