检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]重庆邮电大学计算机科学与技术学院,重庆400065 [2]中国移动通信集团重庆有限公司,重庆400042
出 处:《重庆邮电大学学报(自然科学版)》2015年第6期798-802,共5页Journal of Chongqing University of Posts and Telecommunications(Natural Science Edition)
摘 要:预编码技术是提高多输入多输出(multiple-input multiple-output,MIMO)无线系统容量的有效措施,提出了一种基于星座扩展的脏纸编码(dirty paper coding,DPC)方法,通过结合网格编码方法中的分集思想,在编码过程中加入星座扩展,利用大星座图冗余编码比特,能够在不消耗额外系统带宽的基础上实现系统容量提升。在发射信号相对应的扩展星座子集中寻找与归一化噪声最接近的星座点,将该星座点与归一化噪声的差值作为编码信号。该方法可以避免THP(Tomlinson-Harashima precoding)在对称取模过程中带来的性能损失,尤其是在低信噪比环境中。通过链路仿真,验证了基于星座扩展的DPC方法具有实现复杂度低、能够和相移键控调制技术相结合、提升系统容量的优点。Precoding technology is to improve the capacity of multiple input multiple output( MIMO) wireless systems of effective measures. This paper proposes a dirty paper coding( DPC) based on the constellation extension method,by combining grid coding method of diversity of ideas,to join the constellation extension in the encoding process,using big star redundancy coding bits,so that they need not consume extra bandwidth capacity improvement based on the implementation system. In this paper,the corresponding extend constellation subset and normalized noise for the closest constellation points is adopted,then the constellation points and normalized difference are found as a coded signal noise. This kind of treatment method can avoid THP in symmetric modulus in the process of the performance loss. Especially in low SNR environment,symmetrical modulus magnified greatly influenced by the noise of the system,the joint constellation extension DPC can avoid this. Verified by link simulation,this paper proposes constellation extension of the DPC has low implementation complexity,with the method of phase shift keying modulation technology,and promotes the combination of the advantages of the system capacity.
分 类 号:TN914.53[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7