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

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

瑞利衰落信道下的网格酉空时调制的研究

酉空时是一种多天线系统信号调制方案,可以在不知道信道状态下进行解调。文中将网格编码与酉空时星座结合运用,性能仿真证明了网格酉空时调制系统非常适合无信道状态信息的无线通信系统,网格编码在一定程度上改进了系统的比特误码率性能。将网格编码下的酉空时调制与未编码的酉空时调制进行对比,结果显示在10^-4的比特误码率下可以得到10～15dB的编码增益。     

基于非理想信道状态信息对DCO-OFDM-IM系统建模与分析

针对传统DCO-OFDM-IM系统进行信道估计时没有考虑信道误差影响,导致获得非理想信道状态信息（CSI）而造成信道估计有效性降低等问题,利用最小均方误差信道估计（MMSE）算法并基于非理想信道状态信息建立了DCO-OFDM-IM系统模型,推导了其理论误码率闭合表达式。同时考虑到DCO-OFDM-IM系统中采用最大似然检测算法（ML）当调制阶数增大时存在检测复杂度高,系统传输速率低等问题,而利用对数似然检测算法（LLR）降低检测复杂度,最后采用蒙特卡罗方法进行系统仿真性能的仿真对比。结果表明：当调制阶数和索引组合相同,误码率为10^-3时,LLR检测算法比ML所需信噪比平均改善约2 dB;在能量比为1∶8时,采用MMSE估计比LS信道估计算法系统性能改善约4 dB;当系统信道估计误差越小时,越可能获得理想CSI,提升了信道估计有效性。     

双向中继信道中物理层网络编码的检测

对双向中继信道中物理层网络编码的检测进行了研究,最大似然检测性能好但是实现复杂度高。因此,在信源节点未知信道状态信息情况下,提出了2种检测方案:基于似然比函数的似然比检测和基于最大后验概率准则的最大后验概率检测。同时,针对信源节点已知信道状态信息的特殊情形,进行了同样的推导。分析和仿真结果表明,相比于分别检测出2个信源信息的最大似然检测,似然比检测的BER性能更优,但似然比检测需要知道额外的噪声方差信息,最大后验概率检测与最大似然检测等价,而且最大后验概率检测在实现复杂度上相对较低。     

空间相关信道下酉空时系统的最大似然 多符号差分检测算法

 传统的酉空时系统,通常假设信道衰落系数之间相互独立,这个条件在实际系统中却很难满足,天线之间的空间相关性造成系统性能恶化.针对该问题,本文提出了空间相关信道下酉统空时系的最大似然多符号差分检测算法.本算法只需获取每个观测窗口的第一个符号,以该符号为导频符号,其传输效率渐近为1,并且不要求系统具有反馈信道,算法中最大似然解的快速搜索可以通过球形译码来实现.计算机仿真结果表明:本算法可以在不明显增加开销的情况下,有效的提高空间相关信道下酉空时系统的误码率性能.     

空间相关连续衰落信道下对角酉空时星座的最大似然多符号差分检测算法

空间相关性会造成MIMO系统的性能损失.针对这种空间相关性,大部分酉空时系统利用反馈信道将空间相关信息反馈给发射机,发射机通过有效利用该信息,进一步提高系统的性能.本文针对实际应用的另一种情形,当酉空时系统不存在反馈信道时,提出了空间相关连续衰落信道下,对角酉空时星座的最大似然多符号差分检测算法.与传统的准静态信道模型相比,本算法基于连续衰落假设,是一种更一般的信道模型.计算机仿真结果表明:本算法可以在不明显增加开销的情况下,有效的提高空间相关连续衰落信道下对角酉空时星座的误码率性能.     

基于高阶矩的Nakagami-m参数估计方法

衰落信道参数估计是无线信道传输系统中的关键技术。首先建立了噪声条件Nakagami-m分布模型,提出了一种基于高阶矩的Nakagami-m参数估计方法。该方法利用了高阶矩具有检测高斯分布特性的特点,用以识别衰落信道的属性。理论分析和仿真试验均证明了新方法的可行性和有效性,并对矩估计方法的计算复杂度进行了分析,从理论上证明其运算量低于最大似然估计方法。     

基于空时分组编码的差分检测方法

利用正交设计原理提出了通用的差分空时分组码(GDSTBC，general differential space-time block code)。与已有的差分调制方法相比，GDSTBC对信号星图无任何限制，因而可利用幅度和相位同时携带信息提高频谱效率。基于最大似然准则，给出了平坦。Rayleigh衰落信道下的非相干译码器。我们将证明：在高信噪比下，GDSTBC能够以线性复杂度和满天线分集恢复数据符号；在PSK调制方式下，没有信道估计时性能下降3dB；Ganesan基于PSK星图的差分空时分组码、Xia基于APSK星图的差分空时调制技术都可看成GDSTBC的特例。     

一种新颖的基于子矩阵交织的差分酉空时调制

差分酉空时调制(DUSTM)是一种应用于时变衰落信道下的多天线调制方法。该方法在慢衰落信道下无需知道信道状态信息而能获得全发送分集增益。但是,在快速衰落信道下,其性能明显恶化并且呈现出较高的误码平层。该文通过在差分酉空时调制中引入矩阵分割和子矩阵交织等操作提出了一种基于子矩阵交织的差分酉空时调制(SMI-DUSTM)方案,并对其性能进行了分析。性能分析和相应的计算机仿真证明了SMI-DUSTM 不仅能够继承DUSTM在慢衰落信道下的优点,而且在快速衰落信道下能够保持良好的系统性能。     

连续衰落信道下适用于酉空时调制的最大似然多符号差分检测算法

为酉空时调制系统设计的多符号差分球形译码(MSDSD)能以较低复杂度获得最大似然(ML)检测性能。但是,该算法基于准静态信道假设,当将它用于快衰落信道时会出现严重的误码平层现象。本文基于连续衰落信道假设,推导了一种ML度量的递推形式,并将其嵌入自动球形译码算法中,得到了的多符号差分自动球形译码(MSDASD)算法。该算法适用于一般酉空时星座,克服了MSDSD的误码平层现象,可达到ML检测的性能,其平均复杂度在大多数情况下低于相同假设下的判决反馈检测算法。     

Antenna selection for unitary space-time modulation

This correspondence studies receive antenna selection (AS) for multiple-antenna systems that employ unitary space-time (ST) signals, where the channel state information (CSI) is known neither at the transmitter nor at the receiver. Without CSI at the receiver, we perform AS only at the receiver and the selection is based on a maximum-norm criterion, i.e., a subset of receive antennas that have the largest received signal power is chosen. Using a Chernoff bound approach, we present theoretical performance analysis based on the pairwise error probability (PEP) and quantify the asymptotic performance at high signal-to-noise ratio (SNR) by giving the diversity and coding gain expressions. We prove that with no CSI at the receiver, the diversity gain with AS is preserved for unitary ST codes with full spatial diversity, the same as the case with known CSI. As a concrete example, for differential unitary ST modulation with M=2 transmit antennas and N=2 receive antennas, we have devised new excellent-performing parametric codes based on the derived PEP bound. The new codes, which are specifically designed for differential AS systems, outperform known differential codes when AS is employed. Corroborating simulations validate our analysis and code design.     

A space-time coding modem for high-data-rate wirelesscommunications

This paper presents the theory and practice of a new advanced modem technology suitable for high-data-rate wireless communications and presents its performance over a frequency-flat Rayleigh fading channel. The new technology is based on space-time coded modulation (STCM) with multiple transmit and/or multiple receive antennas and orthogonal pilot sequence insertion (O-PSI). In this approach, data is encoded by a space-time (ST) channel encoder and the output of the encoder is split into N streams to be simultaneously transmitted using N transmit antennas. The transmitter inserts periodic orthogonal pilot sequences in each of the simultaneously transmitted bursts. The receiver uses those pilot sequences to estimate the fading channel. When combined with an appropriately designed interpolation filter, accurate channel state information (CSI) can be estimated for the decoding process. Simulation results of the proposed modem, as applied to the IS-136 cellular standard, are presented. We present the frame error rate (FER) performance results as a function of the signal-to-noise ratio (SNR) and the maximum Doppler frequency, in the presence of timing and frequency offset errors. Simulation results show that for a 10% FER, a 32-state eight-phase-shift keyed (8-PSK) ST code with two transmit and two receive antennas can support data rates up to 55.8 kb/s on a 30-kHz channel, at an SNR of 11.7 dB and a maximum Doppler frequency of 180 Hz. Simulation results for other codes and other channel conditions are also provided. We also compare the performance of the proposed STCM scheme with delay diversity schemes and conclude that STCM can provide significant SNR improvement over simple delay diversity     

Matrix Coded Modulation: A New Non-coherent MIMO Scheme

This paper describes a new space-time coding scheme for non-coherent multi-antenna multi-input multi-output (MIMO) systems. This new MIMO scheme merges error-correcting and space-time coding functions by transmitting invertible matrices, so this scheme has been called “Matrix Coded Modulation” or “MCM”. Coherent systems require channel state information (CSI) at the transmitters and/or at the receivers, and their performances strongly depend on the channel estimation. For example, in systems using Orthogonal frequency division multiplexing, the channel estimation requires the insertion of pilot-symbols in the transmitted frame which implies a spectral efficiency loss of the global system that increase with the number of transmit antennas. The existing non-coherent schemes such as the differential space-time modulation leads to performance degradation compared to coherent systems in which perfect CSI is assumed. Decoding in the MCM scheme is performed iteratively, based on a specified detection criteria. In the proposed MCM scheme, decoding can be achieved with or without CSI at the receiving antennas. As the space-time coding function is merged with the error-correcting code, the euclidean distances distribution between modulated signals based on the detection criteria is strongly linked to the Hamming weights distribution of the channel error-correcting code used in the MCM scheme. Moreover, a low-complexity decoding algorithm is described and compared to the existing differential schemes.     

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     

Matrix Coded Modulation: A New Non-coherent MIMO Scheme

This paper describes a new space-time coding scheme for non-coherent multi-antenna Multi-Input Multi-Output (MIMO) systems. This new MIMO scheme merges error-correcting and space-time coding functions by transmitting invertible matrices, so this scheme has been called “Matrix Coded Modulation” or “MCM”. Coherent systems require Channel State Information (CSI) at the transmitters and/or at the receivers, and their performances strongly depend on the channel estimation. For example, in systems using Orthogonal Frequency Division Multiplexing, the channel estimation requires the insertion of pilot-symbols in the transmitted frame which implies a spectral efficiency loss of the global system that increase with the number of transmit antennas. The existing non-coherent schemes such as the Differential Space-Time Modulation leads to performance degradation compared to coherent systems in which perfect CSI is assumed. Decoding in the MCM scheme is performed iteratively, based on a specified detection criteria. In the proposed MCM scheme, decoding can be achieved with or without CSI at the receiving antennas. As the space-time coding function is merged with the error-correcting code, the euclidean distances distribution between modulated signals based on the detection criteria is strongly linked to the Hamming weights distribution of the channel error-correcting code used in the MCM scheme. Moreover, a low-complexity decoding algorithm is described and compared to the existing differential schemes.     

Combined turbo coding and unitary space-time modulation

Space-time coding is well understood for high data rate communications over wireless channels with perfect channel state information. On the other hand, channel coding for multiple transmit antennas when channel state information is unknown has only received limited attention. A new signaling scheme, named unitary space-time modulation, has been proposed for the latter case. In this paper, we consider the use of turbo coding together with unitary space-time modulation. We demonstrate that turbo coded space-time modulation systems are well suited to wireless communication systems when there is no channel state information, in the sense that the turbo coding improves the bit error rate (BER) performance of the system considerably. In particular, we observe that the turbo-coded system provides 10-15 dB coding gain at a BER of 10/sup -5/ compared to the unitary space-time modulation for various transmit and receive antenna diversity cases.     

Performance Analysis of Space-Time Coded CDMA System Over Nakagami Fading Channels with Perfect and Imperfect CSI

In this paper, the performance of multiuser CDMA systems with different space time code schemes is investigated over Nakagami fading channel. Low-complexity multiuser receiver schemes are developed for space-time coded CDMA systems with perfect and imperfect channel state information (CSI). The schemes can make full use of the complex orthogonality of space-time coding to obtain the linear decoding complexity, and thus simplify the exponential decoding complexity of the existing scheme greatly. Moreover, it can achieve almost the same performance as the existing scheme. Based on the bit error rate (BER) analysis of the systems, the theoretical calculation expressions of average BER are derived in detail for both perfect CSI and imperfect CSI, respectively. As a result, tight closed-form BER expressions are obtained for space-time coded CDMA with orthogonal spreading code, and approximate closed-form BER expressions are attained for space-time coded CDMA with quasi-orthogonal spreading code. Computer simulation for BER shows that the theoretical analysis and simulation are in good agreement. The results show that the space-time coded CDMA systems have BER performance degradation for imperfect CSI.     

Layered maximum likelihood detection for MIMO systems in frequency selective fading channels

By transmitting different substreams in different antennas simultaneously, a multiple element antenna array system provides increased capacity that grows linearly with the number of transmit antennas. Layered space-time processing that performs ing, detection and cancellation for each substream can be used for reception, with a linear growth in receiver complexity. This paper considers this multi-input multi-output system over a slow time-varying frequency selective Rayleigh fading channel environment. With the equivalent channel tap delay line model, each delayed tap in every transmit-receive antenna pair can be considered as an imaginary antenna transmitting a delayed version of the substreams. Based on this idea, we propose a layered maximum likelihood detection (L-MLD) scheme which performs layered processing and maximum likelihood detection for each substream and its delayed elements. To further improve the performance, a group maximum likelihood detection (G-MLD) scheme is also proposed by grouping the substreams and performing layered processing in groups and maximum likelihood detection within the group. However, both schemes increase the required number of receiving antennas, which increases hardware cost and size. To reduce this requirement, we propose the use of oversampling technique to increase the dimension of the received signal. Simulation results show that the L-MLD scheme achieves frequency diversity and outperforms existing schemes such as the V-BLAST system with OFDM and multi-input multi-output decision feedback equalizers (MIMO-DFE). Moreover, the G-MLD scheme performs better than L-MLD with an increased detection complexity. In addition, it was showed that further increasing the oversampling rate beyond the minimum requirement does not improve the performance.     

The Code Design of the Space-time Trellis Codes with Dynamic Transmit Power Allocation

Space-time trellis codes (STTCs) have been shown to efficiently use transmit diversity to improve the error performance. In existing space-time trellis codes, the transmit power is equally distributed across all transmit antennas. However, this power allocation strategy is not optimum regarding the error performance. In this paper, we propose a design of space-time trellis codes with dynamic transmit power allocation (STTCs/DTPA), when partial channel state information (CSI) is available at the transmitter side. It is demonstrated that this new scheme can achieve a full diversity order and have much better error performance than the standard STTCs scheme, the existing STTCs/DTPA, and some other closed-loop transmit diversity schemes with partial CSI.     

多发射天线的差分酉空时调制信号星座图

在无法获得信道状态信息的瑞利衰落信道里,分集积是高信噪比场景下酉空时信号具有良好性能的首要指标。采用全旋转矩阵的方法获得了极大分集积非群空时码,仿真结果表明,在高信噪比下,该非群空时码性能优于传统的酉空时循环码。