A New Solution for Simple Cooperative Relaying

In this paper we present a new simple cooperative relaying scheme. The proposed scheme is compared with simple cooperative schemes with virtual orthogonal space time block coding (OSTBC) and quasi orthogonal space time block coding (QOSTBC). Every of these three schemes includes one base station with two antennas, two relay stations each with a single antenna and one mobile station with a single antenna. The aim of the proposed scheme is to preserve, as much as it is possible bit error rate (BER) performance of the cooperative scheme with virtual OSTBC, but with increased code rate. It is shown that the presented scheme obviously outperforms simple cooperative scheme with virtual QOSTBC, while in comparison with simple cooperative scheme with virtual OSTBC has very similar BER performance and increased code rate.     

Double-differential orthogonal space-time block codes for arbitrarily correlated Rayleigh channels with carrier offsets

The presence of carrier offsets in the multiple-input multiple-output (MIMO) channels is an important practical and theoretical problem. Double-differential coding is a technique which allows the receiver to decode the data without any channel or carrier offset knowledge. We propose a double-differential (DD) coding scheme which is applicable to square orthogonal space-time block codes (OSTBC) using M-PSK constellation. The main advantages of our proposed DD coding scheme are: 1) The previously proposed DD codes are applicable only to the specific class of space-time block codes which follow the diagonal unitary group property, whereas our DD coding is applicable to any square OSTBC. 2) We propose a suboptimal decoder which preserves the linear decoding property of the OSTBC. 3) A theoretical analysis is performed to find a pairwise error probability (PEP) upper bound of the proposed doubledifferential orthogonal space-time block codes (DDOSTBC). 4) In order to improve the performance of DDOSTBC over the arbitrarily correlated Rayleigh channels we propose a precoder which minimizes an upper bound of the PEP. The proposed DDOSTBC are able to achieve higher coding gain than the similar rate existing DD coding scheme. In addition, the proposed precoded DDOSTBC achieves performance gain for correlated channels as compared to the unprecoded DDOSTBC.     

New Solutions for Cooperative Relaying Implementation of OSTBC with 3/4 Code Rate

In this paper we propose two new cooperative relaying schemes which enable distributed implementation of the orthogonal space time block coding (OSTBC) with 3/4 code rate. These proposed schemes are compared with cooperative relaying scheme with virtual OSTBC and 1/2 code rate. The considered schemes are used for creating virtual 4 × 1 multiple input–single output (MISO) channel, and include one base station with two antennas, two relay stations each with a single antenna and one mobile station with a single antenna. Obtained results show that in the case of the same bit rate the proposed schemes provide better bit error rate (BER) performances than virtual OSTBC with 1/2 code rate. On the other side, for the same symbol constellations the proposed schemes have almost identical BER performances as virtual OSTBC with 1/2 code rate, but with a benefit of 1.5 times increased code rate.     

无线光通信中一种TPC+OSTBC的级联空时编码方法

在正交空时分组码(OSTBC)基础上,分析了Turbo乘积码(TPC)和OSTBC级联方案的可行性,提出了一种采用TPC+OSTBC级联的空时编译码方案,分别仿真分析了不同TPC分量码、不同接收天线数目下系统的差错性能,并对采用OSTBC和TPC+OSTBC级联方法系统的差错性能进行了对比分析.仿真结果表明:该级联空时编码方法可同时获得全分集和全速率,且差错性能明显优于只采用OSTBC.     

FSO-MIMO中的自适应多层空时编码

为了根据信道的时变特性来选择合适的空时编码方式,结合正交空时分组码与分层空时码的优点,并借鉴天线分组的多层空时编码原理,提出了一种在自由空间光通信多输入多输出中4×4的自适应多层空时编码方案,并用Monte Carlo法进行仿真研究。结果表明,在一定的信噪比范围内,采用自适应多层空时,编码方案在保证一定误比特率的条件下,能使数据传输速率达到最大化;采用自适应调制方式能更有效地利用资源并提高数据的传输速率。     

Improving BER performance of virtual QOSTBC

In this paper, we propose a new solution for improving BER performance of virtual quasi orthogonal space-time block coding (QOSTBC). The proposed solution is compared with virtual QOSTBC and virtual orthogonal space-time block coding (OSTBC). One of the main disadvantages of virtual OSTBC is its code rate, while on the other side code rate of QOSTBC equals 1, but with BER performance degradation as a consequence. The scheme proposed here provides improved BER performance in comparison with QOSTBC, and has preserved code rate of 1. The considered schemes are used for creating virtual 4 × 1 multiple input-single output channel. These schemes include one base station, one relay station, both equipped with two antennas, and one mobile station with a single antenna.     

Stacked OSTBC: Error Performance and Rate Analysis

It is well known that the Alamouti scheme is the only space-time code from orthogonal designs achieving the capacity of a multiple-input multiple-output (MIMO) wireless communication system with n_T=2 transmit antennas and n_R=1 receive antenna. In this paper, we propose the n-times stacked Alamouti scheme for n_T=2n transmit antennas and show that this scheme achieves the capacity in the case of n_R=1 receive antenna. This result may regarded as an extension of the Alamouti case. For the more general case of more than one receive antenna, we show that if the number of transmit antennas is higher than the number of receive antennas, we achieve a high portion of the capacity with this scheme. Further, we show that the MIMO capacity is at most twice the rate achieved with the proposed scheme for all signal-to-noise ratio (SNR). We derive lower and upper bounds for the rate achieved with this scheme and compare it with upper and lower bounds for the capacity. In addition to the capacity analysis based on the assumption of a coherent channel, we analyze the error rate performance of the stacked orthogonal space-time block code (OSTBC) with the optimal maximum-likelihood (ML) detector and with the suboptimal lattice-reduction (LR)-aided zero-forcing detector. We compare the error rate performance of the stacked OSTBC with spatial multiplexing (SM) and full-diversity achieving schemes. Finally, we illustrate the theoretical results by numerical simulations.     

OFDM中结合延迟分集与空频编码的下行发射方案

正交空时／空频编码只有在发射天线数为2时才能进行满速率发射。当天线数大于2时,将循环延迟分集和空时编码相结合可在保持满速率发射的同时提高系统的性能,但是循环延迟分集和空频编码相结合却不能较好地提高系统性能。为此本文对循环延迟分集进行改进,将其和空频编码相结合在满速率发射的前提下仍能提高系统的频率分集增益。仿真结果表明,发射天线数大于2时,该方法提高了系统的分集增益,同时降低了误码率。     

Space‐time ring‐TCM codes with CPM based on the decomposed model for transmission over Rayleigh fading channels

Space–time (ST) coding is a proved technique for achieving high data rates in 3G mobile systems that combines coding, modulation and multiple transmitters and receivers. A novel algorithm is proposed for ST ring trellis‐coded modulation (ST‐RTCM) systems with continuous‐phase modulation (CPM) when the channel coefficients are known to the receiver. This algorithm is based on the CPM decomposed model, which exploits the memory properties of this modulation method, resulting in a straightforward implementation of joint ST coding and CPM, which is particularly suitable for ring codes. This new scheme is used to investigate the performance of the delay diversity code with CPM over slow Rayleigh fading channels, in particular with MSK which is one of the most widely used modulation methods of continuous phase. Furthermore, a feedback version of delay diversity allowed by the decomposition is tested in 1REC and 1RC systems. This feedback configuration is seen to provide good results for low signal‐to‐noise ratios. Simulations results are also provided for multilevel ST‐RTCM codes that achieve a higher throughput than MSK‐coded systems. Additionally the serial concatenation of an outer Reed–Solomon code with an ST‐RTCM code is shown, this combination further reduces the error probability and achieves even more reliable communications. Copyright © 2005 John Wiley & Sons, Ltd.     

高速铁路无线通信中基于正交空时码的格型正交重构算法

分析了基于正交空时码的开环和闭环MIMO系统,并着重研究了高铁场景下速度对正交空时码的影响：高速移动导致的快时变信道将会破环正交空时码的正交结构,降低由此获得的分集增益,从而引起了误码率性能的降低。提出了格型正交重构算法,通过givens变换对正交空时码进行码内正交重构;算法在恢复码内正交性的同时,也改变了发射端波束成形方向。因此,在高速移动场景下,所提算法使发射端获得了波束成形的阵列增益以及与用户静止时相同的分集增益。从系统性能仿真中看出,所提算法提升了高铁场景下基于正交空时码MIMO系统的误码性能。     

基于高阶累积量的正交空时分组码盲识别

针对多输入多输出(Multiple-Input-Multiple-Output, MIMO)系统中的空时码盲识别问题,提出一种基于高阶累积量的正交空时分组码(Orthogonal Space-Time Block Code, OSTBC)盲识别方法．推导给出了接收信号的两种高阶累积量公式,该高阶累积量包含发射信号信息,由此提出识别OSTBC信号的两个特征参数;利用MIMO信道估计得到空间信道矩阵,并提出了两种特征参数的估计方法;最后,利用最小距离准则实现对OSTBC信号的分类识别．仿真结果表明：所提出方法的正确识别率高于已有的识别方法,具有良好的识别性能．     

频率选择性衰落信道中一种低复杂度的正交空时分组码译码算法

针对正交空时分组码在频率选择性衰落信道中正交性被破坏的问题,该文提出了一种基于干扰对消的译码方案。该方案借鉴D-BLAST系统的检测方法,采用干扰抵消和干扰置零方法消除多径干扰,从而有效地检测出期望信号。理论分析和系统仿真表明,与迭代干扰抵消算法相比,该译码方案在有效地改善系统误码性能的同时,降低了译码复杂度,尤其适用于信道阶数较小的环境。     

一种自适应多层空时编码的MIMO传输方案

考虑到正交空时分组码可提供满分集增益,以及垂直多层空时分组码能达到较高的教据传输速率,借鉴Tarokh构建基于天线分组的多层空时编码方法,本文提出了一种能根据接收信噪比自适应选择空时编码调制方式的MIMO传榆方案,并给出了Monte-Carlo仿真与理论分析.仿真结果表明,在一定的信噪比范围内,方案在保证低误码率的条件下达到数据速率的最大化.     

Conventional and modified TAS/OSTBC schemes in dual‐hop fixed‐gain amplify‐and‐forward relaying systems with imperfect feedback

Modified transmit antenna selection (TAS)/orthogonal space‐time block coding (OSTBC) (M‐TAS/OSTBC) schemes have been shown to achieve superior error performance together with a reduced‐rate feedback channel in the presence of feedback errors (FEs) when compared with the conventional TAS/OSTBC (C‐TAS/OSTBC) schemes. This paper focuses on the bringing of fixed‐gain amplify‐and‐forward (FGAF) relaying schemes that employ M‐TAS/OSTBC schemes at both hops that provides reduced feedback‐rate and robust error performance in the presence of erroneous‐feedback channels. The exact expressions of the outage and error probabilities for both dual‐hop FGAF relaying schemes in Nakagami‐m fading channels have been derived and validated via Monte Carlo simulations. Additionally, with the help of high signal‐to‐noise ratio (SNR) (i.e., asymptotic) approaches and some analytical approximations, the asymptotic diversity order analysis has been carried out. Besides, by providing a simulation‐based examination on the inclusion of power allocation within the modified scheme, the additional advantages on the performance have been exhibited. The extensive investigation and comparisons to the conventional schemes have shown that M‐TAS/OSTBC schemes employed at each transmission link provide full diversity order and considerable error performance as the C‐TAS/OSTBC scheme in ideal feedback cases and also achieve more robust error performance in the presence of FEs. Thus, by using M‐TAS/OSTBC schemes, the overall performances of the dual‐hop FGAF relaying schemes have been enhanced, which would result in reductions on the average SNR requirements to achieve a specified error rate constraint. Copyright © 2015 John Wiley & Sons, Ltd.     

Analytical assessment of multi-user vs. spatial diversity trade-offs with delayed channel state information

In this letter, we explore the combined use of spatial and multi-user diversity in a cellular system where channel state information is subject to delays in the feedback channel. First, we analytically derive the probability and cumulative density functions of the post-scheduling signal-to-noise ratio (SNR) for both a single-input single-output (SISO) and an orthogonal space-time block coding (OSTBC) transmission schemes. Then, we obtain the closed-form expressions of the corresponding average system capacities. By evaluating those expressions, we analytically show that the OSTBC scheme is far less sensitive to delays in the feedback channel.     

A Rate-1 Space-Time Diversity Method for Rotated 4-QAM Constellations

We propose a rate-1 space-time transmit diversity technique. We obtained second-order diversity by transmitting the real and imaginary parts of the symbols from two antennas. With four transmit antennas, we can add Alamouti coding to reach fourth-order transmit diversity. There is no need to detect symbols jointly in either of these applications. It is possible to use both Alamouti coding and Hadamard spreading diversity with the proposed method, thereby obtaining eighth-order (or even higher) transmit diversity. However, joint detection of the symbols is again required at this point. The proposed technique is a suitable space-frequency coding method for OFDM systems. We used computer simulations to compare our technique with the Alamouti coding, quasi-orthogonal space-time block coding (QOSTBC), and orthogonal space–time block coding (OSTBC) methods. We also compared its performance to that of Hadamard spreading diversity. Alamouti coding performs better than the proposed technique at the second order of transmit diversity, but is also limited to that order. The proposed technique performs better than OSTBC at the same order of the transmit diversity. QOSTBC performs slightly better than the proposed technique at the same order of transmit diversity. However, when all methods have the same detection complexity, the proposed technique performs better than both QOSTBC and Hadamard spreading diversity.     

PAPR Reduction for Repetition Space-Time-Frequency Coded MIMO-OFDM Systems Using Chu Sequences

Space-time/frequency coding (SFC) can achieve the spatial and multipath diversities for a MIMO-OFDM system by coding across subcarriers, multiple antennas, and/or multiple OFDM sysmbols, where an interesting method to achieve the multipath diversity is repeating across subcarriers proposed by Su et al. While most of the existing space-time/frequency codes do not have the fast ML decoding, a family of space-time-frequency codes with single-symbol ML decoding have been proposed lately by Zhang et al to achieve both full spatial and multipath diversities by using orthogonal space-time block codes (OSTBC) across multiple antennas and OFDM symbols and in the meantime repeating across the subcarriers. In this paper, we first generalize the above OSTBC to linearly transformed quasi OSTBC (QOSTBC) in a straightforward way. The main goal of this paper is to modify the repeating process and adjust their phases so that the peak-to-average power ratio (PAPR) of the OFDM system is reduced. In particular, we propose to use Chu sequences and show that the discrete PAPR can be reduced by Gamma times where Gamma is the times of the repeating across subcarriers for any SFC from the repeating.     

基于准正交空时分组码的多中继协作方案

根据准正交空时分组码提出了一种基于选择中继协议的多中继协作方案。从两个方面讨论了该方案的空间分集性能,通过分析成对差错概率证明,若所有的中继都正确译码,该方案可以获得全分集增益;若某些中继不能正确译码,该方案仍可以获得部分分集增益。将所提方案与使用正交空时分组码的协作方案进行比较,仿真结果表明,在信噪比较高时,两个方案都可获得全分集增益,但所提方案具有更高的编码增益。而当信噪比变低时,所提方案具有更高的分集增益和编码增益。     

High-rate concatenated space-time block code M-TCM designs

In this paper, a new technique to design improved high-rate space-time (ST) codes is proposed based on the concept of concatenated ST block code (STBC) and outer trellis-coded modulation (M-TCM) encoder constructions. Unlike the conventional rate-lossy STBC-MTCM schemes, the proposed designs produce higher rate ST codes by expanding the codebook of the inner orthogonal STBC. The classic set partitioning concept is adopted to realize the STBC-MTCM designs with large coding gains. The proposed expanded STBC-MTCM designs for the two-, three-, and four-transmitter cases are illustrated. Simulation results show the proposed STBC-MTCM designs significantly outperform the traditional ST-TCM schemes. Furthermore, decoding complexity of the proposed scheme is low because signal orthogonality is exploited to ease data decoding.     

An MMSE Decoding Algorithm without Matrix Inversion in QSTBC

The matrix inversion operation is needed in the MMSE decoding algorithm of orthogonal space-time block coding （OSTBC） proposed by Papadias and Foschini. In this paper, an minimum mean square error （MMSE） decoding algorithm without matrix inversion is proposed, by which the computational complexity can be reduced directly but the decoding performance is not affected.