Transceiver optimization for block-based multiple access through ISI channels
Transceiver optimization for block-based multiple access through ISI channels
复制标题
DOI：
10.1109/tsp.2004.823502
复制
发表时间：
2004-04
影响因子：
5.4
通讯作者：
Z. Luo;T. Davidson;G. Giannakis;K. M. Wong
中科院分区：
文献类型：
--
作者：
Z. Luo;T. Davidson;G. Giannakis;K. M. Wong
在本文中，我们描述了在码间干扰（ISI）信道上基于块的多址通信的最小均方误差（MMSE）联合收发器设计问题的一个公式。由于该问题的直接公式是非凸的，我们利用线性矩阵不等式（lmi）和二阶锥规划（SOCP）的技术开发了各种替代的凸公式。特别是，我们证明了最优MMSE收发器设计问题可以重新表述为一个半定程序（SDP），可以使用高效的内点法解决。当信道矩阵为对角线时（如在循环前缀多载波系统中），我们证明了通过子载波分配和对所有用户的每个子载波的最优功率负载可以获得最佳的MMSE收发器。此外，通过与所有子载波对应的子信道增益幅度的相对比率，可以相当简单地（在多项式时间内）计算出最佳子载波分配和功率负载。我们还证明了在最优的MMSE收发器中，任意两个用户可以共享不超过一个子载波。利用这一特性，我们设计了一种有效的强多项式时间算法来确定双用户情况下的最优功率负载和子载波分配。
In this paper, we describe a formulation of the minimum mean square error (MMSE) joint transmitter-receiver design problem for block-based multiple access communication over intersymbol interference (ISI) channels. Since the direct formulation of this problem turns out to be nonconvex, we develop various alternative convex formulations using techniques of linear matrix inequalities (LMIs) and second-order cone programming (SOCP). In particular, we show that the optimal MMSE transceiver design problem can be reformulated as a semidefinite program (SDP), which can be solved using highly efficient interior point methods. When the channel matrices are diagonal (as in cyclic prefixed multicarrier systems), we show that the optimal MMSE transceivers can be obtained by subcarrier allocation and optimal power loading to each subcarrier for all the users. Moreover, the optimal subcarrier allocation and power-loading can be computed fairly simply (in polynomial time) by the relative ratios of the magnitudes of the subchannel gains corresponding to all subcarriers. We also prove that any two users can share no more than one subcarrier in the optimal MMSE transceivers. By exploiting this property, we design an efficient strongly polynomial time algorithm for the determination of optimal powerloading and subcarrier allocation in the two-user case.