一种基于分布式发射天线的差分空时调制方法

在基于分布式发射天线的多入多出（MIMO）系统中,由于各发射天线的发射信号不同时到达接收端,用于信道估计的导引设计及发射方法存在一定困难。针对这一问题,该文提出一种无需信道估计的分布式MIMO差分编码及检测方法：发送端将发射矩阵进行相位差分调制后发射,接收端利用前后接收量判断相位信息恢复出发送端数据信息。该方法频谱效率与V—BLAST相同,适用于任意发射天线数和接收天线数,且不要求接收天线数大于发射天线数。仿真结果表明,在不同信道传播时延情况下,误码率性能不同。     

基于APSK信号的分布式MIMO差分检测方法

提出一种基于APSK信号的分布式MIMO差分编码及检测方法:发送端将待发射的数据符号与前一个发射矩阵中的数据符号进行相位和幅度差分调制,生成新的发射矩阵进行发射;接收端对接收信号匹配滤波之后,利用前后接收量判断相位信息和幅度信息恢复出发送端数据.该方法使得系统无需进行信道估计,频谱效率与V-BLAST (Vertical Bell Laboratories Layered Space-Time)相同,但不受天线数目限制,解决了传统V-BLAST算法无法进行非相干检测的难题.仿真结果显示,该算法在不同信道传播时延情况下的误码率性能不同.     

一种分布式MIMO差分检测方法

本文提出一种无需信道估计的分布式MIMO差分编码及检测方法:发送端将发射符号进行相位差分调制后生成空时码矩阵进行发射,接收端利用前后接收量判断相位信息恢复出发送端数据信息.本文将该方法在不同信道传播时延场景下进行了仿真验证,仿真结果表明,在相同E_b/N₀情况下,不同信道传播时延对应的误码率性能不同:在信道传播时延从0.1T_s到0.9T_s的变化过程中,误码率随信道传播时延的增大先降低后升高,当信道传播时延为0.6T_s左右误码率达到最低,存在使系统误码率性能较好的信道传播时延.     

一种分布式MIMO信号的发射与检测方法

在 V-BLAST结构的分布式多输入多输出(MIMO)系统中,针对发射天线地域分布所引起的发射符号异步到达接收天线的问题,给出了一种分布式 MIMO 系统的信号发射与检测方法。在慢衰落信道中,该方法利用接收端反馈的信道状态信息,采用几何平均分解(GMD)构建等对角的上三角矩阵,消除子信道间增益的不平衡。在莱斯衰落信道下的计算机仿真表明,与已有 QR分解的分层算法相比,该检测方法能够显著提升系统的误码性能。     

分布式MIMO中的最大似然频偏估计

在考虑分布式多入多出(MIMO)系统中各收发天线对之间的频偏均可能不同的一般情况下,推导出了平坦衰落MIMO信道模型下的最大似然频偏估计.针对收端是否采用分布式天线的两种不同情况,分别提出了一种只涉及一维最大化问题的较低复杂度频偏估计方法.仿真结果表明,所提频偏估计方法在平坦衰落MIMO信道下可以获得令人满意的估计性能;而在收端仍采用集中式天线这一特殊情况下,利用所有接收天线上的接收信号进行联合估计,可以进一步提高估计性能.     

分布式发射天线MIMO信号的最优线性检测

 在分布式发射天线多输入多输出(MIMO)系统中,信道传播时延使各个发射天线的符号异步到达接收天线.接收信号符号间干扰的特殊性使分布式发射天线MIMO信号的线性检测算法更加复杂,最优线性检测算法也不能直接由最小均方误差(MMSE)准则得到.针对这一问题,提出了基于MMSE准则的分布式发射天线MIMO信号的最优线性检测算法:先最大比合并,再最小均方误差检测.并且,通过界定误码率上下限,得到其分集阶数.仿真结果验证了最优线性检测接收端信号处理方式的正确性.     

多径信道下MIMO系统发送天线数估计

为了解决认知无线电或信号截获中多径信道下MIMO系统发送天线数估计问题,首先分析了现有模型在多径信道下失效的原因,将MIMO多径信道模型等效变换出一种虚拟信道矩阵,从而建立多径信道下MIMO系统发送天线数估计模型;然后,利用随机矩阵理论中协方差矩阵最小特征值分布的相关研究结果,证明了时不变瑞利信道的协方差矩阵最小特征值收敛于第二类Tracy-Widom分布,分析了该特点对发送天线数估计的影响,并提出一种改进的RMT估计算法来估计多径信道下MIMO系统发送天线数.最后对改进算法进行了仿真验证,结果表明在低信噪比和小数据条件下,改进算法的估计性能相比RMT算法有较大提升.     

分布式MIMO系统中最优检测的简化算法

在V-BLAST结构的分布式MIMO系统中,针对发射天线地域上的分布性所引起的发射符号异步到达接收天线的问题,提出了一种接近最优检测性能简化算法。该算法首先遍历部分码元符号,且每次遍历时都使用分布式排序干扰抵消算法检测剩余符号,然后对得到的符号候选集进行搜索,恢复发送信号。莱斯衰落信道下的计算机仿真表明,该算法对接收端天线数目没有要求,且在获取接近最优检测性能的同时,有效地降低了计算复杂度。     

接收机准确估计信道条件下MIMO系统的信道容量分析

文中考虑独立Rayleigh衰落环境下的单用户点对点多输入多输出系统,假定接收端能准确估计信道状态信息,推导出系统的容量公式,相比单天线系统,多天线系统能取得更大的容量,当输入信号是高斯分布时,系统容量随着发射天线和接收天线数目的最小值线性增加,如果发送端完全知道信道状态信息,采用注水原理的功率分配策略,可以获得更高的容量增益,最后推导出各态历经容量的数学表达式.     

一种新的MIMO系统空间相关性的估计技术

该文提出了在MIMO系统中一种估计发射及接收天线相关矩阵RT,RR的新算法。算法揭示了对于发射端（接收端）相关矩阵的估计精度和接收端（发射端）的天线的相关度密切有关,而与发射端（接收端）自身天线的相关度无关。此外,该文对估计性能与天线数量的关系也进行了分析。模拟结果表明,在使用约200个训练符号时,相关矩阵中每个元素的平均估计误差在0．05以下,而使用更多的训练符号时,估计精度将会进一步提高。     

基于TR-RASK的多输入多输出UWB方案

本文提出了一种基于时间反演接收天线移位键控的多输入多输出超宽带（time reversal receive antenna shift keying multiple input multiple output ultra wide band,TR-RASK-UWB）方案,较好地解决了MIMO-UWB系统中多天线干扰和多径干扰的问题。首先,该方案利用RASK调制将发射天线阵列形成空间波束,同时使用TR技术聚焦发射信号到达目标接收天线;其次,通过最大接收功率检测算法理论推导了该方案在UWB多径信道下的误比特率（bit error rate,BER）表达式,并通过仿真得到验证;最后结果表明,在发射天线和接收天线相同的情况下,所提方案的性能相比于MIMO-UWB有较大提升。      

二进制猫群算法在大规模MIMO天线选择中的应用

在多输入多输出(MIMO)系统中,天线选择技术平衡了系统的性能和硬件开销,但大规模MI-MO系统收发端天线选择复杂度问题一直没有得到很好的解决.基于信道容量最大化的准则,采用两个二进制编码字符串分别表示发射端和接收端天线被选择的状态,提出将二进制猫群算法(BCSO)应用于多天线选择中,以MIMO系统信道容量公式作为猫群的适应度函数,将收发端天线选择问题转化为猫群的位置寻优过程.建立了基于BCSO的天线选择模型,给出了算法的实现步骤.仿真结果表明所提算法较之于基于矩阵简化的方法、粒子优化算法具有更好的收敛性和较低的计算复杂度,选择后的系统信道容量接近于最优算法,非常适用于联合收发端天线选择的大规模MIMO系统中.     

Scheduling Algorithms and Throughput Maximization for the Downlink of Packet-Data Cellular Systems with Multiple Antennas at the Base Station

The capacity-achieving coding scheme for the multiple-input multiple-output (MIMO) broadcast channel is dirty-paper coding. With this type of transmission scheme the optimal number of active users that receive data and the optimal power allocation strategy are highly dependent on the structure of the channel matrix and on the total transmit power available. In the context of packet-data access with adaptive transmission where mobile users are equipped with a single receive antenna and the base station has multiple transmit antennas, we study the optimal number of active users and the optimal power allocation. In the particular case of two transmit antennas, we prove that the optimal number of active users can be a non-monotonic function of the total transmit power. Thus not only the number of users that should optimally be served simultaneously depends on the user channel vectors but also on the power available at the base station transmitter. The expected complexity of optimal scheduling algorithms is thus very high. Yet we then prove that at most as many users as the number of transmit antennas are allocated a large amount of power asymptotically in the high-power region in order to achieve the sum-capacity. Simulations confirm that constraining the number of active users to be no more than the number of transmit antennas incurs only a marginal loss in spectral efficiency. Based on these observations, we propose low-complexity scheduling algorithms with sub-optimal transmission schemes that can approach the sum-capacity of the MIMO broadcast channel by taking advantage of multiuser diversity. The suitability of known antenna selection algorithms is also demonstrated. We consider the cases of complete and partial channel knowledge at the transmitter. We provide simulation results to illustrate our conclusions.     

Optimized Transmission for Fading Multiple-Access and Broadcast Channels With Multiple Antennas

In mobile wireless networks, dynamic allocation of resources such as transmit powers, bit-rates, and antenna beams based on the channel state information of mobile users is known to be the general strategy to explore the time-varying nature of the mobile environment. This paper looks at the problem of optimal resource allocation in wireless networks from different information-theoretic points of view and under the assumption that the channel state is completely known at the transmitter and the receiver. In particular, the fading multiple-access channel (MAC) and the fading broadcast channel (BC) with additive Gaussian noise and multiple transmit and receive antennas are focused. The fading MAC is considered first and a complete characterization of its capacity region and power region are provided under various power and rate constraints. The derived results can be considered as nontrivial extensions of the work done by Tse and Hanly from the case of single transmit and receive antenna to the more general scenario with multiple transmit and receive antennas. Efficient numerical algorithms are proposed, which demonstrate the usefulness of the convex optimization techniques in characterizing the capacity and power regions. Analogous results are also obtained for the fading BC thanks to the duality theory between the Gaussian MAC and the Gaussian BC.     

Khatri-Rao space-time codes

Space-time (ST) coding techniques exploit the spatial diversity afforded by multiple transmit and receive antennas to achieve reliable transmission in scattering-rich environments. ST block codes are capable of realizing full diversity and spatial coding gains at relatively low rates; ST trellis codes can achieve better rate-diversity tradeoffs at the cost of high complexity. On the other hand, V-BLAST supports high rates but has no built-in spatial coding and does not work well with fewer receive than transmit antennas. We propose a novel linear block coding scheme based on the Khatri-Rao matrix product. The proposed scheme offers flexibility for achieving full-rate or full-diversity, or a desired rate-diversity tradeoff, and it can handle any transmit/receive antenna configuration or signal constellation. The proposed codes are shown to have numerous desirable properties, including guaranteed unique linear decodability, built-in blind channel identifiability, and efficient near-maximum likelihood decoding.     

频率选择性信道下高速数据传输中的单载波频域均衡技术

本文利用空时联合检测的方法，提出了在频率选择性信道下多天线发送的单载波频域均衡方案，它可以提供和一个发送天线多个接收天线单载波系统相同的分集增益，和单载波时域均衡相比具有低的复杂度。分析了信道估计误差对系统的影响，类似于基于迫零算法的线性均衡器的情形，在低信噪比下，信道估计误差对系统影响很大，给出了一种简单的克服方法。在不增加发射功率的情况下，使用信道编码可以进一步改善系统的性能。本方案的系统性能在6径典型城市信道模型下进行了评估，仿真的结果证明了本方案的有效性。     

Reduced-Complexity Receiver Structures for Space–Time Bit-Interleaved Coded Modulation Systems

Transmission efficiency in radio channels can be considerably improved by using multiple transmit and receive antennas and employing a family of schemes called space-time (ST) coding. Both extended range and/or improved bandwidth efficiency can be achieved, compared with a radio link with a single transmit and receive antenna. Bit-interleaved coded modulation schemes give diversity gains on fading channels with higher order modulation constellations combined with conventional binary convolutional codes also for the case of a single transmit and receive antenna radio link. In this paper, we study a family of flexible bandwidth-efficient ST coding schemes which combine these two ideas in a narrowband flat-fading channel and single-carrier modems. We address receiver complexity for the case of a large number of transmit antennas and higher order modulation constellations. Especially, we focus on practical configurations, where the number of transmit antennas is greater than that of receive antennas. Simplified receivers using tentative decisions are proposed and evaluated by means of simulations. Tradeoffs between complexity reduction and performance loss are presented. We emphasize systems that are of particular interest in applications where the number of transmit antennas exceeds the number of receive antennas. A system with four transmit antennas with an eight-fold complexity reduction and a performance loss of about 1 dB is demonstrated     

增强物理层安全的联合发射天线选择和人工噪声技术

针对未来多天线通信系统的安全问题,提出了一种增强无线物理层安全的传输策略。该策略基于发射天线的选择以及人工噪声,并采用Alamouti编码。它可以使发射机和接收机以较低的复杂度代价提高合法信道的分集增益,同时有效干扰窃听信道,使通信系统获得更高的安全容量。对系统安全容量、天线数量、以及信息信号与人工噪声之间的功率分配等问题进行了研究,仿真结果表明,该传输策略能够有效地增强物理层安全。      

Multiple trellis coded orthogonal transmit scheme for multiple antenna systems

In this paper, a novel multiple trellis coded orthogonal transmit scheme is proposed to exploit transmit diversity in fading channels. In this scheme, a unique vector from a set of orthogonal vectors is assigned to each transmit antenna. Each of the output symbols from the multiple trellis encoder is multiplied with one of these orthogonal vectors and transmitted from corresponding transmit antennas. By correlating with corresponding orthogonal vectors, the receiver separates symbols transmitted from different transmit antennas. This scheme can be adopted in coherent/differential systems with any number of transmit antennas. It is shown that the proposed scheme encompasses the conventional trellis coded unitary space-time modulation based on the optimal cyclic group codes as a special case. We also propose two better designs over the conventional trellis coded unitary space-time modulation. The first design uses 8 Phase Shift Keying （8-PSK） constellations instead of 16 Phase Shift Keying （16-PSK） constellations in the conventional trellis coded unitary space-time modulation. As a result, the product distance of this new design is much larger than that of the conventional trellis coded unitary space-time modulation. The second design introduces constellations with multiple levels of amplitudes into the design of the multiple trellis coded orthogonal transmit scheme. For both designs, simulations show that multiple trellis coded orthogonal transmit schemes can achieve better performance than the conventional trellis coded unitarv space-time schemes.     

Adaptive transmit antenna selection with pragmatic space-time trellis codes

We consider the problem of selecting a subset of transmit antennas in MIMO systems to minimize error probability when only partial channel information is available at the transmitter. An upper bound for error probability of space-time coded transmit antenna selection scheme conditioned on the channel state information is presented. Based on the performance analysis, a criterion of selecting a subset of available transmit antennas to minimize the upper bound on the PEP is proposed. In contrast to other transmit antenna selection schemes for uncoded transmission or with a fixed number of antennas within the selection subset in the literature, the proposed scheme can adaptively select both a variable number of transmit antennas and their corresponding space-time codes for transmission. Furthermore, we present pragmatic space-time trellis coding schemes for slow Rayleigh fading channels. The principal advantage of the schemes is that a single encoder and decoder can be used for systems with a variable number of transmit antennas. The performance of the pragmatic space-time codes with adaptive antenna selection and the effect of the imperfect channel estimation on performance are evaluated by simulations. It is shown that the adaptive selection offers considerable antenna selection gain relative to the antenna selection system with a fixed number of antennas within the selection subset