检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]浙江大学信息与电子工程学系,浙江杭州310027 [2]浙江省综合信息网技术重点实验室,浙江杭州310027
出 处:《通信学报》2012年第8期62-68,共7页Journal on Communications
基 金:国家自然科学基金资助项目(61101103)~~
摘 要:提出了一种实用的基于循环正交序列的信道估计算法。源节点发送循环正交的信道训练序列,各个中继节点对接收到的信道训练序列进行不同间隔的循环移位后向目的节点转发。尽管各个中继转发的序列在时间上是叠加的,但序列之间不存在相关性。由此可以推导出相应的最小二乘信道估计和线性最小均方误差信道估计。仿真结果证明该算法具有较高的估计精度和效率,同时运算复杂度较低。A practical channel estimation algorithm based on cyclic orthogonal training sequence for relay-assisted coop- erative system was presented. According to this algorithm, the source node transmitted a cyclic orthogonal training sequence, and the relay nodes circularly shifted the received training sequences before retransmitted them. Although the relays retransmitted the training sequences to the destination node simultaneously, the correlation among them was fully eliminated. The corresponding least square (LS) and linear minimum mean square (LMMSE) channel estimators were derived. Simulation results confirm that the proposed algorithm has high accuracy, high efficiency and low complexity.
分 类 号:TN925[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.142.55.180