全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

MIMO系统中树搜索检测的排序算法

DOI: 10.13190/jbupt.200802.137.yangy, PP. 137-141

Keywords: 树搜索算法,多输入多输出系统,排序算法,对数似然比

Full-Text   Cite this paper   Add to My Lib

Abstract:

提出了树搜索算法中基于对数似然比信息的排序算法,给出了使用对数似然比信息排序的一般公式。在未编码情况下给出使用线性检测器近似的对数似然比信息排序方法,在迭代检测解码情况下给出使用解码器反馈的比特后验信息进行对数似然比排序的方法。使用对数似然比信息的排序算法不但用到了信道信息,还利用了每帧中的接收信号矢量和先验信息,使各层信号能按照后验概率的大小进行检测。仿真结果表明,该算法在未编码情况下能显著提高系统性能,在编码情况下能加快整个系统的收敛速度。

References

[1]  Foschini G J. Layered space-time architecture for wireless communication in a fading environment when using multielement antennas[J]. Bell Labs Tech J, 1996, 1(2): 41-59.
[2]  Kim S W, Kim K P. Log-likehood-ratio-based detection ordering in V-BLAST[J]. IEEE Trans on Commun, 2006, 54(2): 302-307.
[3]  De J Y L C, Willink T J. Iterative tree search detection for MIMO wireless systems[J]. IEEE Trans on Commun, 2005, 53(6): 930-935.
[4]  Murugan A D, Gamal H E, Damen M O, et al. A unified framework for tree search decoding: rediscovering the sequential decoder[J]. IEEE Trans on Inform Theory, 2006, 52(3): 933-953.
[5]  Hochwald B M, Ten B S. Achieving near-capacity on a multiple-antenna channel[J]. IEEE Trans on Commun, 2003, 51(3): 389-399.
[6]  Sellathurai M, Haykin S. Turbo-BLAST for wireless communications: theory and experiments[J]. IEEE Trans on Signal Process, 2002, 50(10): 2538-2546.
[7]  孙艳华, 龚萍, 梁鹏, 等. 基于列表的迭代分支定界MIMO检测算法[J]. 北京邮电大学学报, 2006, 29(1): 50-53. Sun Yanhua, Gong Ping, Liang Peng, et al. List based iterative branch algorithm for MIMO detection[J]. Journal of Beijing University of Posts and Telecommunications, 2006, 29(1): 50-53.(上接第67页)
[8]  Huang Xinyi, Susilo W, Mu Yi. On the security of certificateless signature schemes from asiacrypt 2003//Proc CANS 2005. Berlin: Springer-Verlag, 2005:13-25.
[9]  Ming Yang, Shen Xiaoqin, Wang Yumin. Certificateless universal designated verifier signature schemes[J]. The Journal of China Universities of Posts and Telecommunications, 2007, 14(3): 85-90.
[10]  Gorantla M C, Saxena A. An efficient certificateless signature scheme//Proc of CIS 05. Berlin: Springer-Verlag, 2005: 110-116.
[11]  Boneh D, Lynn B, Shacham H. Short signatures from the weil pairing//Proc of Asiacrypt 01. Berlin: Springer-Verlag, 2001: 514-532.
[12]  禹勇, 杨波, 李发根, 等. 一个有效的代理环签名方案[J]. 北京邮电大学学报, 2007, 30(3): 23-26. Yu Yong, Yang Bo, Li Fagen, et al. An efficient proxy ring signature scheme[J]. Journal of Beijing University of Posts and Telecommunications, 2007, 30(3): 23-26.
[13]  Choi K, Park J, Hwang J, et al. Efficient certificateless signature schemes//Proc of ACNS 2007. Berlin:Springer-Verlag, 2007: 443-458.
[14]  Zhang Zhengfeng, Wong D S, Feng Dengguo. Certificateless public-key signature: security model and efficient construction//Proc of ACNS 06. Berlin: Springer-Verlag, 2006: 293-308.
[15]  Pointcheval D, Stern J. Security proofs for signature schemes[J]. Journal of Cryptology, 2000, 13(3):1-12.
[16]  Dang Lanjun, Kou Weidong, Dang Nan, et al. Mobile IP registration in certificateless key infrastructure[J]. IET Information Security, 2007, 1(4):167-173.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133