English

应用科学学报 ›› 2012, Vol. 30 ›› Issue (1): 1-6.doi: 10.3969/j.issn.0255-8297.2012.01.001

• 通信工程 •    下一篇

分布式空时码协同通信系统简化均衡方法

肖俊， 蒋雁翔， 尤肖虎   

  1. 东南大学移动通信国家重点实验室, 南京210096
  • 收稿日期:2011-01-03 修回日期:2011-10-23 出版日期:2012-02-09 发布日期:2012-01-30
  • 作者简介:蒋雁翔，博士，副教授，研究方向：新一代无线通信系统，E-mail: yxjiang@seu.edu.cn；尤肖虎，教授，博导，研究方向：未来移动通信系统，E-mail: xhyu@seu.edu.cn
  • 基金资助:

    国家“973” 重点基础研究发展计划基金(No.2012CB316004)；国家自然科学基金(No.61071112)；国家科技重大专项基金(No.
    2012ZX03003013-004, No.2009ZX03003-004-02)；东南大学科技基金(No.3204001105, No.KJ2010400) 资助

Simplified Equalization for Cooperative Communication Systems Based on Distributed Space-Time Codes

XIAO Jun, JIANG Yan-xiang, YOU Xiao-hu   

  1. National Mobile Communications Research Laboratory, Southeast University, Nanjing 210096, China
    Abstract:
  • Received:2011-01-03 Revised:2011-10-23 Online:2012-02-09 Published:2012-01-30

PDF

1930

摘要：

摘要： 由于协同通信系统各中继节点分布位置的不同，产生了不同于传统多天线通信系统的多时偏问题. 该文考虑基于分布式线性卷积空时码的异步协同通信系统，将对应每个中继节点的时延偏移量等效到对应生成多项式中的零矢量，进而构造等效的异步协同通信系统模型. 对等效信道矩阵的带状Toeplitz 性质进行研究，提出一种基于Trench 算法求解带状Toeplitz 线性系统的块最小均方误差均衡方法，从而将求解高阶带状Toeplitz 线性系统的运算简化为求解低阶Toeplitz 线性系统的运算，避免了传统最小均方误差均衡算法中的高阶矩阵求逆运算，极大地降低了计算复杂度. 仿真结果表明，该均衡方法能在适当的数据帧长以及较大的时延量情况下取得满意的系统性能.

关键词: 异步协同通信, 分布式线性卷积空时码, 托普利兹, 最小均方误差, 均衡

Abstract:

Different from traditional multi-antenna systems, cooperative communication systems are inherently time-asynchronous due to the nature of relay distribution. In this paper, we investigate cooperative communication systems based on distributed linear convolutional space-time codes. An equivalent asynchronous system model is obtained by converting the relays’ transmission delays to a zero vector of the corresponding
generator polynomials. With the banded Toeplitz property of the equivalent channel matrix, we propose a block minimum mean square error equalization method using the Trench algorithm to solve the Toeplitz linear systems. In the proposed equalization method, computation of the high order banded Toeplitz linear system is simplified to that of a low order system. The method avoids high order matrix inversion operations of the
traditional minimum mean square error equalization method, leading to substantial reduction of computational complexity. Simulation results show that satisfactory system performance can be achieved with non-minimumorder non-trace-orthogonal generator polynomials, proper data frame length and large delay.

Key words: asynchronous cooperative communication, distributed linear convolutional space-time code, Toeplitz, minimum mean square error, equalization

中图分类号: