检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]中国电子科技集团公司第七研究所,广东广州510310
出 处:《移动通信》2015年第14期83-87,共5页Mobile Communications
摘 要:无线宽带系统常采用多进制调制来提高频谱利用率,同时根据应用的环境,选用卷积码或者Turbo码作为差错控制编码来对抗传输信道的噪声和衰落的影响。在信道解码的过程中,为了提高解码增益,译码时需要软解调信息,一般采用对数似然比LLR作为软解调的输出信息。LLR通常采用经典的欧式距离计算方法得到,但是这种方法运算量大、处理时间长、实现成本高。为了解决这个问题,设计了边界判决法和星座点合并法来计算LLR,最后通过仿真比较了简化前后算法的性能,并给出了实际应用的效果。High-order modulation is often adopted in wireless broadband system to enhance spectrum utilization. In addition, error control coding, such as convolutional code or Turbo code is selected to reduce impacts of channel noise and fading. In the process of channel decoding, soft demodulation information is necessary to improve decoding gain. In general, LLR (Log Likelihood Ratio) is used as the output of soft demodulation. LLR is calculated according to classical Euclidean distance decision, but the algorithm suffers from large amounts of computation, long processing time and high implementation cost. In order to solve the problem, the combination of boundary decision with constellation point was designed to calculate LL1L Finally, the performances of the two algorithms were compared and the actual effect was presented.
关 键 词:八进制相移键控 对数似然比 欧式距离 边界判决法 星座点合并法
分 类 号:TN92[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.173