首页 | 本学科首页   官方微博 | 高级检索  
     

LLL格基约减中选择δ的一种方法
引用本文:肖剑. LLL格基约减中选择δ的一种方法[J]. 电子科技, 2012, 25(6): 38-40
作者姓名:肖剑
作者单位:(西安电子科技大学 电子工程学院,陕西 西安 710071)
摘    要:LLL格基约减是一种强大的格基约减算法,其可在多项式时间里输出一组近乎正交的已减格基,且已被应用于预编码领域,可在无线通信中,获得理想的分集性能。LLL格基约减算法需要人为指定参数δ。参数δ的大小决定了算法的执行时间及已减格基的好坏。在LLL格基约减算法基础上,文中提出了一种改进算法,针对特定输入矩阵H,算法自动选择δ,在执行时间和已减格基质量间达到平衡。

关 键 词:MIMO  格基约减  预编码  

A Method for Choosing δ Based on the LLL Lattice Reduction Algorithm
XIAO Jian. A Method for Choosing δ Based on the LLL Lattice Reduction Algorithm[J]. Electronic Science and Technology, 2012, 25(6): 38-40
Authors:XIAO Jian
Affiliation:(School of Electronic Engineering,Xidian University,Xi'an 710071,China)
Abstract:LLL lattice reduction is a powerful algorithm which can output a group of nearly orthogonal reduced lattice basis from original basis.Recently,LLL lattice reduction has been found useful for precoding in wireless MIMO systems.There is a factor δ in LLL lattice reduction which should be specified manually.Algorithm execution time and quality of reduced lattice basis depend on the factor δ.On the base of the LLL lattice reduction algorithm,this paper propose an improved algorithm for choosing the factor δ automatically according to a specific input matrix H to meet the tradeoff between the quality of reduced lattice basis and algorithm execution time.
Keywords:MIMO  lattice reduction  precoding
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《电子科技》浏览原始摘要信息
点击此处可从《电子科技》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号