期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
Enhanced Beam-forming Technique
1
作者 Rakesh Tamrakar 《China Communications》 SCIE CSCD 2009年第2期144-149,共6页
In TD-SCDMA, due to single-stream beam-forming, there is a limit in peak data rate and the spatial multiplexing is not possible. In LTE-A or B3G, the requirements for the peak data rate and the cell throughput is very... In TD-SCDMA, due to single-stream beam-forming, there is a limit in peak data rate and the spatial multiplexing is not possible. In LTE-A or B3G, the requirements for the peak data rate and the cell throughput is very high, multi-streams beam-forming and spatial division multiple access (SDMA) are effective measures to meet these requirements. In this paper, enhancement of beam-forming technique is presented to support the multi-streams beam-forming and the SDMA. 展开更多
关键词 通信技术 波束 智能天线 网络配置 安全技术
下载PDF
Research on the Block Repeated-OFDMA
2
作者 Rakesh Tamrakar 《China Communications》 SCIE CSCD 2008年第3期95-98,10,共5页
In this paper a new multiple access technology based on OFDM is introduced.
关键词 Research on the Block Repeated-OFDMA In PRB CDMA
下载PDF
REDUCED-COMPLEXITY DECODING ALGORITHMS FOR UNITARY SPACE-TIME CODES
3
作者 Su Xin Yi Kechu +1 位作者 Tian Bin Sun Vongjun 《Journal of Electronics(China)》 2007年第1期112-115,共4页
Two reduced-complexity decoding algorithms for unitary space-time codes based on tree-structured constellation are presented. In this letter original unitary space-time constellation is divided into several groups. Ea... Two reduced-complexity decoding algorithms for unitary space-time codes based on tree-structured constellation are presented. In this letter original unitary space-time constellation is divided into several groups. Each one is treated as the leaf nodes set of a subtree. Choosing the unitary signals that represent each group as the roots of these subtrees generates a tree-structured constellation. The proposed tree search decoder decides to which sub tree the receive signal belongs by searching in the set of subtree roots. The final decision is made after a local search in the leaf nodes set of the se-lected sub tree. The adjacent subtree joint decoder performs joint search in the selected sub tree and its “surrounding” subtrees,which improves the Bit Error Rate (BER) performance of purely tree search method. The exhaustively search in the whole constellation is avoided in our proposed decoding al-gorithms,a lower complexity is obtained compared to that of Maximum Likelihood (ML) decoding. Simulation results have also been provided to demonstrate the feasibility of these new methods. 展开更多
关键词 酉空时码 复杂性 简化解码算法 译码 局部搜索算法 星座
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部