一种降低接收机复杂度的差分空时调制方案

基于对角信号的差分酉空时调制技术不需要信道估计并能实现满天线分集,但接收机的计算复杂度与发射天线数和数据率成指数关系。该文针对发射天线数为偶数的系统,提出了一种降低接收机计算复杂度的差分空时调制方案。该方案将发射天线分成相等数目的两组并在每一组天线上分别进行对角酉空时调制,接着构造差分编码矩阵使得两个对角信号的最大似然检测可以分开进行,从而大大降低了接收机的计算复杂度。理论分析和仿真表明,该方案仍实现了满天线分集,并且对于某些应用环境能提供比对角信号更好的误比特率性能。     

An Ordered Successive Interference Cancellation Scheme in UWB MIMO Systems

In this letter, an ordered successive interference cancellation (OSIC) scheme is applied for multiple‐input multiple‐output (MIMO) detection in ultra‐wideband (UWB) communication systems. The error rate expression of an OSIC receiver on a log‐normal multipath fading channel is theoretically derived in a closed form solution. Its bit error rate performance is analytically compared with that of a zero forcing receiver in the UWB MIMO detection scheme followed by RAKE combining.     

Performance analysis for V‐BLAST system using OSIC receiver in correlated channel

Vertical‐Bell Labs Layered Space–Time (V‐BLAST) system is an emerging spatial multiplexing scheme that can achieve high spectral efficiency. Ordered successive interference cancellation (OSIC) detection algorithm is suitable for V‐BLAST system because it can afford a reasonable trade‐off between complexity and performance. However, the correlation of a real‐world wireless channel may result in a substantial degradation of the OSIC performance. In this paper, the performance of OSIC under correlated fading is analyzed. We obtain the closed‐form expression of post‐processing signal‐to‐noise ratio (SNR) for each sub‐stream based on V‐BLAST architecture, and then derive the distribution of post‐processing SNR based on multivariate statistical theory. The upper bound of the average probability of error (APE) is derived by the nearest neighbor union bound theory. From the expression of APE for each sub‐stream, it is shown that the diversity gain at the ith processing step is (N ? M + i), where N and M are the number of receive and transmit antennas, respectively. Correlation can decrease the effective post‐processing SNR rather than the diversity gain, and the decreased amount of the effective post‐processing SNR is accurately measured by the corresponding diagonal element of the inverse of the transmit correlation matrix. The optimal ordering can improve the performance and this advantage vanishes gradually as the scattering angle decreases. Copyright © 2010 John Wiley & Sons, Ltd.     

Ordered Successive Interference Cancellation (OSIC) in V-BLAST Systems with Asynchronous Transmission Mode

In this paper, we first present a successive interference cancellation (SIC) architecture for the V-BLAST system with asynchronous transmission mode, which is proposed in Shao and Tang (IEEE Trans Veh Technol 56(6):3827–3837, 2007) and characterized by achieving maximum possible diversity only by using a simple linear detection scheme under zero forcing (ZF) criterion. The SIC architecture that intuitively derived form the mathematical expression of the sampled output vector of a bank of matched filters at each receive antenna has a very low complexity, however, it can not employ the optimal detection order to minimize the propagation of errors from one step of detection to the next. Furthermore we find that it actually consumes extra energy of the previously detected signals to recover a signal. Therefore a ordered successive interference cancellation (OSIC) architecture is subsequently proposed to overcome the two shortcomings mentioned above. Simulations demonstrate that the OSIC in the asynchronous V-BLAST system can give much better performance at a little cost of complexity than it dose in conventional synchronous scheme.     

慢衰落信道下的自适应MIMO检测算法

针对现有V-BLAST检测算法复杂度高的问题,本文提出了一种适用于慢衰落信道环境下的自适应MIMO检测算法。该算法首先利用基于最小均方误差准则的排序干扰抵消算法获得信号检测顺序和初始滤波器系数;利用信道之间的相关性,应用最小均方误差（LMS）算法到判决反馈均衡（DFE）结构中,完成滤波器系数的更新,从而避免了大量的矩阵求逆操作。仿真结果表明,与传统的MMSE-OSIC算法相比,本文算法在检测性能上略有下降,但具有更低的计算复杂度和更高的处理效率。      

Low-Complexity Map Channel Estimation for Mobile MIMO-OFDM Systems

This paper presents a reduced-complexity maximum a posteriori probability (MAP) channel estimator with iterative data detection for orthogonal frequency division multiplexing (OFDM) systems over mobile multiple-input multiple- output channels. The optimal MAP estimator needs to invert an NN_T x NN_T data-dependent matrix each in OFDM symbol interval, where N is the number of subcarriers and N_T is the number of transmit antennas. We derive an expectation maximization (EM) algorithm with low-rank approximation to avoid inverting large-size matrices, and thus drastically reduce the receiver complexity. In the iterative process, channel parameters are initially obtained by a least square (LS) estimator for temporary symbol decisions. Then, inter-carrier interference (ICI) due to fast fading is approximated and canceled. Finally, the temporary symbol decisions and the ICI-canceled received signals are processed by the EM-based MAP estimator to refine the channel state information for improved detection. The proposed scheme achieves about 2 dB gain over the LS scheme in channels with medium to high normalized Doppler shifts.     

On channel orthogonalization using space-time block coding with partial feedback

Orthogonal space-time block codes (OSTBCs) yield full diversity gain even while requiring only a linear receiver. Such full-rate (rate-one) orthogonal designs are available for complex symbol constellations only for N=2 transmit antennas. In this paper, we propose a new family of full-rate space-time block codes (STBCs) using a single parameter feedback for communication over Rayleigh fading channels for N=3,4 transmit antennas and M receive antennas. The proposed rate-one codes achieve full diversity, and the performance is similar to maximum receiver ratio combining. The decoding complexity of these codes are only linear even while performing maximum-likelihood decoding. The partial channel information is a real phase parameter that is a function of all the channel gains, and has a simple closed-form expression for N=3,4. This feedback information enables us to derive (channel) orthogonal designs starting from quasi-orthogonal STBCs. The feedback complexity is significantly lower than conventional closed-loop transmit beamforming. We compare the proposed codes with the open-loop OSTBCs and also with the closed-loop equal gain transmission (EGT) scheme which uses equal power loading on all antennas. Simulated error-rate performances indicate that the proposed channel orthogonalized STBCs significantly outperform the open-loop orthogonal designs, for the same spectral efficiency. Moreover, even with significantly lower feedback and computational complexity, the proposed scheme outperforms the EGT technique for M>N.     

联合ML和OSIC的VBLAST解码算法

使用多个发射天线和多个接收天线可以获得巨大的通信容量。作为MIMO系统的一种实现方案，VBLAST可以获得很高的频谱利用率。传统的VBLAST译码算法OSIC(Ordered Successive Interference Cancellation)在其译码性能上和最大似然ML(Maximum Likelihood)译码差距较大，而ML，的复杂度是随着发射天线数呈指数增加的。因此，本文针对VBLAST的译码，折中考虑VBLAST的解码复杂度和解码性能，提出了联合ML，和OSIC的两种改进的VBLAST解码算法：ML_OSIC和OSIC_ML。当选取用ML译码的符号数适中时，可以在远低于ML的复杂度基础上获得远好于OSIC的译码性能。     

COMBINED TRANSMIT ANTENNA SELECTION AND DETECTION OVER SPATIAL CORRELATED MIMO SYSTEMS

In this paper a method that combines transmit antenna selection and reduced-constellation detection in spatially correlated Multi-Input Multi-Output (MIMO) fading channels is presented. To mitigate the performance degradation caused by the use of antenna selection that is based on correlation among columns, an iterative receiver scheme that uses only a subset of the constellation points close to the expected symbol value estimated in the previous iteration is proposed. The size of the subset can adapt to the maximum correlation of the sub-matrix after the simple antenna selection. Furthermore, the error rate performance of the scheme under linear Minimum Mean Square Error (MMSE) or Ordered Successive Interference Cancellation (OSIC) for the first run detection and different interleaver lengths is investigated while the transmit antenna selection is considered. The simulation results show a sig- nificant advantage both for implementation complexity and for error rate performance under a fixed data rate.     

REDUCING THE PEAK-TO-AVERAGE POWER RATIO OF OFDM SYSTEM WITH LOW COMPLEXITY

This paper proposes a companding scheme, where small signals are enlarged and large signals are reduced, to reduce the Peak-to-Average Power Ratio（PAPR）. Computer simulation results show that the proposed technique has two advantages at least when compared with the conventional methods such as partial transmit sequence, selective mapping and the previous companding. First, it gets better PAPR performances with a lower complexity. Second, the scheme achieves greater performances gain with hardly any damnification of OFDM signals in some degree.     

基于采样点选择和矢量旋转的多载波CDMA定时跟踪方案

针对多载波CDMA系统的特点,该文提出一种基于采样点选择和矢量旋转的全数字定时跟踪方案。该方案充分利用准时路复相关矢量信息,通过矢量旋转得到非相干定时误差检测量,进行定时跟踪调整。理论分析和数值结果表明,该方案较传统的延迟锁定跟踪方案明显降低了实现复杂度,而且性能有所提高。     

Group transmit antenna selection based on GIS technology for V-BLAST system

The conventional transmit antenna selection for Vertical Bell Laboratories Layered Space Time （V-BLAST） system is very complex because it needs to compute the inverse of channel matrices time after time. In this paper, a new group transmit antenna selection scheme for V-BLAST system is proposed. The 1st group transmit antennas are decided according to a certain selection criterion among the available antennas. Then, with Group Interference Suppression （GIS） technology, the interferences of the transmit symbols from the selected antennas can be suppressed. Finally, the 2nd group transmit antennas are decided among the residual available antennas. Simulations show that its performance is lower than that of the conventional selection scheme. However, the new selection scheme has lower complexity than the conventional one.     

An efficient inter-unit interference reduction technique for a MSTTD system

A multiple space-time transmit diversity (MSTTD) detection scheme on quasi-static Rayleigh flat-fading channels is proposed. The proposed detection algorithm first determines the candidates for M units each using a QR decomposition, and computes a reference metric for a full-length vector consisting of the first candidates at each unit. Then it performs a more likely searching simply by comparing the reference metric with other candidates such that an inter-unit interference can be effectively eliminated. Through these procedures it can approach the ML performance with less complexity even compared to an improved Schnorr-Euchner (ISE) scheme.     

4×4 V-BLAST系统分组最大似然检测算法

对于V-BLAST系统的检测,最大似然(ML)算法有着最优的性能却也有最大的计算复杂度;经典的排序连续干扰抵消(OSIC)算法复杂度较低,但数值稳定性差,且性能与ML差距较大.因此,本文基于检测性能和计算复杂度折中的思想,针对4×4 V-BLAST系统提出了一种分组最大似然(Group ML,GML)检测算法,在保证较好检测性能的基础上,通过将四维ML检测器分成两组二维ML检测器来降低计算复杂度.此外,本文还提出了一种简化的最大似然(Simpli-fled ML,SML)检测算法,通过将每组中的二维ML检测器的搜索空间从二维降至一维,进一步降低了计算复杂度,并证明其与ML算法具有一致的性能.仿真表明,在误符号率为10~(-3)时GML算法相比OSIC算法有约7dB的性能提升.经分析知.GML算法复杂度与ML-OSIC算法相比在高阶调制方式下有着显著的降低,易于硬件实现.     

HTRCI and Channel Ranking Based Joint Symbols Detection for MQRD-PCM/MIMO-OFDM

MIMO-OFDM is considered a key technology in emerging high-data rate systems. In MIMO-OFDM systems, channel estimation and signal detection are important to distinguish transmit signals from multiple transmit antennas. Previously, we have proposed a parallel detection algorithm using multiple QR decompositions (Q is an orthogonal square matrix, R is upper triangular matrix) with permuted channel matrix (MQRD-PCM) to reduce the system complexity of MIMO-OFDM. This method achieves a good BER performance with a low system complexity. However, since MQRD-PCM is a kind of parallel detection method, the wrong detection probability is increased due to the bad channel signal-to-interference plus noise power ratio (SINR) of the transmitted signals. As a result, the average BER performance is influenced by the wrong detection probability of the bad channel SINR. To overcome the above-mentioned problems, in this paper, we propose the high time resolution carrier interferometry and channel ranking based joint signal detection for MQRD-PCM/MIMO-OFDM.     

An iterative particle filter signal detector for MIMO fast fading channels

For flat fast fading Multiple-Input Multiple-Output （MIMO） channels, this paper presents a sampling based channel estimation and an iterative Particle Filter （PF） signal detection scheme. The channel estimation is comprised of two parts： the adaptive iterative update on the channel distribution mean and a regular update on the ＂adaptability＂ via pilot. In the detection procedure, the PF is employed to produce the optimal decision given the known received signal and the sequence of the channel samples, where an asymptotic optimal importance density is constructed, and in terms of the asymptotic update order, the Parallel Importance Update （PIU） and the Serial Importance Update （SIU） scheme are performed respectively. The simulation results show that for the given fading channel, if an appropriate pilot mode is selected, the proposed scheme is more robust than the conventional Kalman filter based superimposed detection scheme.     

Real-Domain Decoder for Full-Rate Full-Diversity STBC with Multidimensional Constellations

In this letter, we present a new maximum likelihood (ML) decoding algorithm for space time block codes (STBCs) that employ multidimensional constellations. We start with a lattice representation for STBCs which transforms complex channel models into real matrix equations. Based on the lattice representation, we propose a new decoding algorithm for quasiorthogonal STBCs (QO-STBC) which allows simpleML decoding with performance identical to the conventional ML decoder. Multidimensional rotated constellations are constructed for the QO-STBCs to achieve full diversity. As a consequence, for quasi-orthogonal designs with an arbitrary number of transmit antennas N (N ? 4), the proposed decoding scheme achieves full rate and full diversity while reducing the decoding complexity from ∂(M_c^N/2) to ∂(M_c^N/4) in a M_c-QAM constellation.     

Geometrical properties of orthogonal space-time codes

We discuss the geometrical properties of a transmission scheme with orthogonal space-time codes. In particular, we show that the transmission channel can be interpreted as the rotation of a vector of transmit symbols in an Euclidean space, together with an attenuation and additive noise. We show that the receiver - as intuitively obvious - essentially has to perform a back-rotation. This geometrical interpretation applies to real vector spaces of signals, i.e., the complex transmit and receive symbols have to be split up into their real and imaginary parts.     

基于单路定时准确的低复杂度成对载波复用多址信号盲分离算法

该文分析了传统逐幸存路径处理(Per-Survivor Processing, PSP)算法模型,给出了改进的前馈非二元码软输出维特比(Soft Output Viterbi Algorithm, SOVA)PSP算法。针对单路定时准确的情况,提出了针对成对载波复用多址(Paired Carrier Multiple Access, PCMA)信号的SOVA-PSP盲分离算法。该算法相对传统的PSP算法状态数由原来的M2(L-1)减少到M(L-1)(其中M为调制阶数,L为等效信道响应长度),从而大幅度地降低了算法复杂度。仿真结果表明,改进的算法在降低复杂度的同时与传统PSP算法相比性能几乎没有损失。     

OFDM系统中一种联合改进的低复杂度SLM峰均比抑制技术

高的峰值平均功率比(Peak-to-Average Power Ratio,PAPR)是光正交频分复用(Optical Orthogonal Frequency Division Multiplexing,O-OFDM)系统的一个主要缺点,选择性映射(Selective Mapping,SLM)法能有效降低高PAPR出现的概率,但它的计算复杂度较高.一些低复杂度的SLM方案能够有效地降低复杂度,但同时也降低了PAPR的抑制性能.为了平衡这两个因素,将低复杂度SLM方案与次优选择的思想相结合,文章提出了一种联合改进的PAPR抑制方案.在低复杂度方案中,通过将一个复频域信号分为两个实信号,再利用快速傅里叶变换(Fast Fourier Transform,FFT)的平移和反折性质将其重建成新的信号,以得到更多的备选信号,如此便能降低计算复杂度.然后,再结合次优选择的思想,选择PAPR最小的一路以得到最优的PAPR抑制性能.仿真结果验证了该方案的有效性.