MMSE准则下近似最优MIMO分组并行检测算法

在采用多天线高阶QAM的MIMO通信系统中,现有基于信道分组并行检测算法虽然接近最优检测性能但以牺牲计算效率为代价.针对这一问题,本文提出一种MMSE准则下基于信道分组的并行检测算法,不但有效降低计算复杂度,而且仍保证检测性能.该算法采用MMSE准则下格归约算法改进分组后条件较好子信道矩阵特性,并在消除参考信号基础上利用改进的子信道矩阵对剩余信号以非线性方式进行检测.仿真结果表明:对4×4和6×6MIMO系统,该算法检测性能达到最优,对于8×8 MIMO系统,比最优算法所需信噪比提高约1dB.复杂度分析表明:相比现有信道分组检测算法,相同检测性能下该算法在6×6 MIMO系统中复杂度降低90%以上,在8×8 MIMO系统中复杂度降低98%以上.     

基于MIMO系统的MDCMA盲均衡算法

基于对线性多输入多输出(MIMO)系统的自适应盲源分离和盲均衡的研究,为了能够有效恢复输入信号,提出了一种在MIMO系统中引入抖动处理技术的修正抖动符号误差恒模算法.仿真结果表明,该算法可以在仅已知输入信号统计量的情况下跟踪信道变化,并且有效克服多个均衡器的输出可能锁定到相同的源信号问题,抑制ISI和MUI,恢复所有发射天线的发送信息.     

Precoder design and blind identification of MIMO channels

In this paper, blind identification problem based on second-order statistics (SOS) of received signals is investigated for multiple-input multiple-output (MIMO) channels. It is shown that precoders introduced in transmitters can provide certain extra information for blind identification problem and commonly used identifiability conditions on MIMO channels can be relaxed. A design criterion for the precoders in frequency domain is proposed. Two blind identification algorithms based on the knowledge of the precoders and SOS of the received signals are then developed. In these algorithms, due to particular structure of the precoders, the blind identification problem for a MIMO channel is decomposed into several independent single-input multiple-output (SIMO) channel identification problems. The presented algorithms are robust to an overestimated channel order and not sensitive to signal-to-noise ratio (SNR). Compared with the existing results, a larger class of MIMO finite-impulse-response (FIR) channels can be identified by the new methods.     

On the utility of MIMO multi-relay networks for modulation identification over spatially-correlated channels

The necessity to perfectly monitor the intercepted signals for spatially-correlated multiple-input multiple-output (MIMO) systems, involves modulation identification algorithms. In this paper, we present an algorithm dedicated to the modulation identification for correlated MIMO relaying broadcast channels with direct link using multi-relay nodes. By modeling spatially-correlated MIMO channels as Kronecker-structured and the imperfect channel state information of both the source-to-destination and the relay-to-destination errors as independent complex Gaussian random variables, we firstly derive the ergodic capacity of the proposed transmission system. It turns out that the ergodic capacities improve with the number of relay nodes. Based on a pattern recognition approach using the higher order statistics features and the Bagging classifier, we show that the probability to distinguish among M-ary shift keying linear modulation types without any priori modulation information is enhanced compared to the decision tree (J48), the tree augmented naive Bayes, the naive Bayes using discretization and the multilayer perceptron classifiers. We also study the effect of increasing the number of relay nodes. Numerical simulations show that the proposed algorithm using the cooperation of multi-relay nodes with the source node can avoid the performance deterioration in modulation identification caused by both spatial correlation and imperfect CSI.     

一种多输入多输出系统的盲辨识算法

多输入多输出线性系统的盲辨识问题可以利用输出信号的高阶累积量来解决.针对已有的一个线性MIMO系统辨识方法没有充分利用累积量矩阵固有结构的不足,提出一个改进算法,从而提高估计性能.并通过计算机仿真作了验证.     

Equalization and semi-blind channel estimation for space-time block coded signals over a frequency-selective fading channel

In this paper, we investigate the equalization and channel identification for space-time block coded signals over a frequency-selective multiple-input multiple-output (MIMO) channel. The equalization has been considered by taking into account the cyclostationarity of space-time block coded signals. The minimum mean square error (MMSE) solutions have been derived for the linear and decision feedback (DF) equalizers. The channel estimation is required for the equalization. With known symbols (as pilot symbols), MIMO channels can be estimated. In addition, due to the redundancy induced by space-time block code, it is possible to identify MIMO channels blindly using the subspace method. We consider both blind and semi-blind channel estimation for MIMO channels. It is shown that the semi-blind channel estimate has fewer estimation errors, and it results in less (bit error rate) performance degradation of the MMSE linear and DF equalizers.     

MIMO-OFDM系统中信道盲估计与检测

针对MIMO-OFDM系统,提出了一种基于子空间的盲信道估计与检测方案,该算法将阵列信号处理的思想应用到MIMO-OFDM系统中,通过发送端信号的冗余编码,利用一种类ESPRIT算法进行盲信号检测和信道估计。仿真结果表明该算法的有效性及其信道盲估计方法的性能。     

Blind identification of FIR MIMO channels by decorrelating subchannels

We study blind identification and equalization of finite impulse response (FIR) and multi-input and multi-output (MIMO) channels driven by colored signals. We first show a sufficient condition for an FIR MIMO channel to be identifiable up to a scaling and permutation using the second-order statistics of the channel output. This condition is that the channel matrix is irreducible (but not necessarily column-reduced), and the input signals are mutually uncorrelated and of distinct power spectra. We also show that this condition is necessary in the sense that no single part of the condition can be further weakened without another part being strengthened. While the above condition is a strong result that sets a fundamental limit of blind identification, there does not yet exist a working algorithm under that condition. In the second part of this paper, we show that a method called blind identification via decorrelating subchannels (BIDS) can uniquely identify an FIR MIMO channel if a) the channel matrix is nonsingular (almost everywhere) and column-wise coprime and b) the input signals are mutually uncorrelated and of sufficiently diverse power spectra. The BIDS method requires a weaker condition on the channel matrix than that required by most existing methods for the same problem.     

Blind MIMO channel identification from second order statistics using rank deficient channel convolution matrix

For multiuser systems, several direct blind identification algorithms require that the linear multiple-input multiple-output (MIMO) system have a full rank convolution matrix. This condition requires that the system transfer function be irreducible and column reduced. We show that this restrictive identification condition can be relaxed for some direct blind identification methods to accommodate more practical scenarios. Algorithms such as the outer-product decomposition algorithm only require minor length adjustment to its processing window without the column-reduced condition. This result allows direct blind identification methods to be applicable to MIMO without requiring a full-rank channel convolution matrix.     

Blind identification of MIMO FIR systems driven by quasistationary sources using second-order statistics: a frequency domain approach

This paper discusses a frequency domain method for blind identification of multiple-input multiple-output (MIMO) convolutive channels driven by white quasistationary sources. The sources can assume arbitrary probability distributions, and in some cases, they can even be all Gaussian distributed. We also show that under slightly more restrictive assumptions, the algorithm can be applied to the case when the sources are colored, nonstationary signals. We demonstrate that by using the second-order statistics of the channel outputs, under mild conditions on the nonstationarity of sources, and under the condition that channel is column-wise coprime, the impulse response of the MIMO channel can be identified up to an inherent scaling and permutation ambiguity. We prove that by using the new algorithm, under the stated assumptions, a uniform permutation across all frequency bins is guaranteed, and the inherent frequency-dependent scaling ambiguities can be resolved. Hence, no post processing is required, as is the case with previous frequency domain algorithms. We further present an efficient, two-step frequency domain algorithm for identifying the channel. Numerical simulations are presented to demonstrate the performance of the new algorithm.     

Blind MAI and ISI suppression for DS/CDMA systems using HOS-basedinverse filter criteria

Cumulant-based inverse filter criteria (IFC) using second-and higher order statistics (HOS) proposed by Tugnait et al. (1993) have been widely used for blind deconvolution of discrete-time multi-input multi-output (MIMO) linear time-invariant systems with non-Gaussian measurements through a multistage successive cancellation procedure, but the deconvolved signals turn out to be an unknown permutation of the driving inputs. A multistage blind equalization algorithm (MBEA) is proposed for multiple access interference (MAI) and intersymbol interference (ISI) suppression of multiuser direct sequence/code division multiple access (DS/CDMA) systems in the presence of multipath. The proposed MBEA, which processes the chip waveform matched filter output signal without requiring any path delay information, includes blind deconvolution processing using IFC followed by identification of the estimated symbol sequence with the associated user through a user identification algorithm (UIA). Then, some simulation results are presented to support the proposed MBEA and UIA. Finally, some conclusions are drawn     

接近最优检测性能的低复杂度线性并行MIMO检测算法

在高阶正交幅度调制下,现有用于MIMO系统的并行检测算法复杂度极高,且随着天线数增多复杂度快速增加;而低复杂度的非并行检测算法与最优检测算法相比,其误比特率性能仍存在一定差距。针对上述问题,提出了一种接近最优检测性能的低复杂度并行MIMO检测算法,该算法基于信道分组检测的思想,对通过受噪声干扰严重的子信道信号采用遍历所有空间映射点的方式进行检测,对其余信号则采用新的基于lattice reduction的线性并行检测算法进行检测。仿真结果表明该算法在获得近似最优检测性能以及提高分集增益的同时,仍可保持较低的复杂度,且在高阶QAM调制方式下,复杂度降低尤为明显。     

MIMO blind equalization algorithm based on successive interference cancellation

Modified Constant Modulus Algorithm (MCMA) is widely used in the SISO blind equalization for its simplicity. For MIMO systems MCMA can only equalize one of the source signals. Through the combination of channel estimation and successive interference cancellation, source signals can be equalized in turn. However the recovery of the first source and the channel estimation are the key points, which directly affects the recovery of the subsequent sources. This paper proposes a channel estimation method with a small amount of calculation, and can accurately estimate the channel vector. Meanwhile, a new blind equalization algorithm is put forward to reliably recovery the first source signal. Simulation results verify the effectiveness of the proposed algorithm.     

An Efficient Adaptive Channel Estimation Algorithm for MIMO OFDM Systems—Study of Doppler Spread Tolerance

In this paper we develop an adaptive MIMO channel estimation algorithm for space–time block coded OFDM systems. The presented algorithm is based on Expectation Maximization (EM) technique by decomposing the superimposed received signals into their signal components, and estimating the channel parameters of each signal component separately. We also study and compare our proposed EM-based algorithm with a previously introduced recursive-least-squares based algorithm for MIMO OFDM systems. At each iteration the EM algorithm decomposes the problem of multi-channel estimation into channel estimation for each transmit–receive link. In this paper we also study the Doppler spread tolerance of our proposed algorithm in a fast fading environment, and investigate how it affects the system BER performance.     

PARAFAC-based channel estimation and data recovery in nonlinear MIMO spread spectrum communication systems

In this paper, a new tensorial modeling is first proposed for nonlinear multiple-input multiple-output (MIMO) direct sequence spread spectrum communication systems. The channel is modeled as an instantaneous MIMO Volterra system. Then, a direct data approach for joint blind channel estimation and data recovery is developed using the parallel factor (PARAFAC) decomposition of a third-order tensor composed of received signals, exploiting space, time and code diversities. A blind channel estimation method based on the PARAFAC decomposition of a fifth-order tensor composed of covariances of the received signals is also proposed, considering phase shift keying (PSK) modulated transmitted signals. The proposed estimation algorithms are evaluated by simulating a nonlinear uplink MIMO radio over fiber (ROF) communication system.     

MIMO-assisted space-code-division multiple-access: linear detectors and performance over multipath fading channels

In this contribution, we propose and investigate a multiple-input-multiple-output space-division, code-division multiple-access (MIMO SCDMA) scheme. The main objective is to improve the capacity of the existing direct-sequence (DS)-CDMA systems, for example, for supporting an increased number of users, by deploying multiple transmit and receive antennas in the corresponding systems and by using some advanced transmission and detection algorithms. In the proposed MIMO SCDMA system, each user can be distinguished jointly by its spreading code signature and its unique channel impulse response (CIR) transfer function referred to as spatial signature. Hence, the number of users might be supported by the MIMO SCDMA system and the corresponding achievable performance are determined by the degrees of freedom provided by both the code signatures and the spatial signatures, as well as by how efficiently the degrees of freedom are exploited. Specifically, the number of users supported by the proposed MIMO SCDMA can be significantly higher than the number of chips per bit, owing to the employment of space-division. In this contribution, space-time spreading is employed for configuring the transmitted signals. Three types of low-complexity linear detectors, namely, correlation, decorrelating, and minimum mean-square error (MMSE) are considered for detecting the MIMO SCDMA signals. The bit-error rate performance of the MIMO SCDMA system associated with these linear detectors are evaluated by simulations, when assuming that the MIMO SCDMA signals are transmitted over multipath Rayleigh-fading channels. Our study and simulation results show that MIMO SCDMA assisted by multiuser detection is capable of facilitating joint space-time despreading, multipath combining, and receiver diversity combining, while simultaneously suppressing the multiuser interfering signals.     

大规模MIMO时分双工系统的鲁棒预编码设计

对于采用大规模MIMO技术的时分双工系统,天线互易误差会破坏上下行信道互易特性,大幅降低预编码算法下行传输性能。由于实际系统难以完全消除天线互易误差,该文以最大化各用户平均信泄噪比为目标,根据天线互易误差的统计特性,设计了对该误差具有鲁棒性的线性预编码算法。同时为了进一步降低用户接收端的等效噪声功率,该文还将该线性鲁棒预编码算法扩展为基于矢量扰动的非线性鲁棒预编码算法,并通过减格辅助技术降低其扰动矢量求解复杂度,使其更适用于大规模MIMO系统应用。计算机仿真结果表明在存在基站天线互易误差条件下,该文所提出的线性与非线性鲁棒性预编码算法的性能均优于传统预编码算法的性能。     

基于信号共轭周期平稳特性的MIMO信道估计方法

MIMO系统中,由于各天线间干扰以及码间干扰等问题的存在,信道估计性能成为影响系统性能的决定性因素。直接利用接收信号的二阶统计特性进行信道估计是目前比较通用的方法之一。本文基于信号的二阶共轭周期平稳特性。提出了一种适用于MIMO系统的信道估计方法,该方法直接利用接收信号的共轭周期自相关函数间的关系,消除了系统的码间干扰(ISI)和信道间的互扰(CCI),分离出信道矩阵的各个元素分别加以估计。该估计算法不需要事先知道信道的准确阶数,整个估计结果不受信道阶数过估计的影响。由于一般的信号不具有共轭周期平稳特性,因而本文同时还提出了一种在MIMO系统中构造和处理二阶共轭周期平稳特性信号的方法。本文最后给出的仿真结果显示所提的估计方法具有良好的估计性能。     

A blind multichannel identification algorithm robust to orderoverestimation

Active research in blind single input multiple output (SIMO) channel identification has led to a variety of second-order statistics-based algorithms, particularly the subspace (SS) and the linear prediction (LP) approaches. The SS algorithm shows good performance when the channel output is corrupted by noise and available for a finite time duration. However, its performance is subject to exact knowledge of the channel order, which is not guaranteed by current order detection techniques. On the other hand, the linear prediction algorithm is sensitive to observation noise, whereas its robustness to channel order overestimation is not always verified when the channel statistics are estimated. We propose a new second-order statistics-based blind channel identification algorithm that is truly robust to channel order overestimation, i.e., it is able to accurately estimate the channel impulse response from a finite number of noisy channel measurements when the assumed order is arbitrarily greater than the exact channel order. Another interesting feature is that the identification performance can be enhanced by increasing a certain smoothing factor. Moreover, the proposed algorithm proves to clearly outperform the LP algorithm. These facts are justified theoretically and verified through simulations     

用于克服MIMO信道时变性的去相关自举均衡器

本文提出了一种用于克服MIMO信道时变性的自举均衡器.本文首先提出了用于MIMO通信系统的去相关均衡算法,该算法利用通信信源的统计特性实现不同源信号之间的去相关,从而克服了MIMO系统的同信道干扰.接着本文将去相关均衡算法用于时变的MIMO系统,提出了用于克服MIMO信道时变性的自举均衡器.该均衡器仅利用其输入信号来对时变的MIMO系统进行均衡,在仅增加很小的运算量的条件下,大大克服了因信道时变而在常规均衡器输出端产生的同信道干扰,提高了系统的误码性能.仿真实验证实,本文提出的去相关MIMO自举均衡器克服了信道时变的影响,明显改善了接收机的误码性能.