Decision feedback differential detection for differential orthogonal space-time modulation with APSK signals over flat-fading channels

Differential orthogonal space-time modulation (DOSTM) with amplitude/phase shift keying (APSK) signals has been recently proposed to improve the data throughput of the DOSTM with PSK signals over quasi-static channels. In this letter, decision feedback differential detection (DF-DD) based on linear prediction is presented for the DOSTM with APSK Signals (DOSTM-APSK) over flat-fading channels. The proposed DF-DD offers better performance than the differential detection when the channel experiences fast fading. The coefficients of the linear prediction based DF-DD can be obtained by an adaptive recursive least-squares algorithm, where the channel statistics are not needed. The proposed DF-DD is also applicable to the general unitary differential space-time modulation.     

频率选择信道下的空时分组码盲识别

在单接收天线下,针对频率选择性衰落信道下空时分组码( STBC)的盲识别问题,提出了一种基于Kolmogorov-Smirnov( K-S)检测的有效算法。该算法以经验累积分布函数作为特征函数,通过K-S检测经验累积分布函数之间的距离,达到识别空时分组码的目的。在不同调制方式、采样因子和置信区间的条件下分别对算法进行仿真并讨论其性能,结果表明,该算法性能较好,在信噪比大于6 dB时可达到90%以上的正确识别概率,在非合作通信方面具有一定的实用价值。     

Bit-error probability for orthogonal space-time block codes with differential detection

Explicit closed-form expressions of the bit-error probabilities are obtained for space-time block codes based on generalized orthogonal designs with differential encoding and differential detection using 2/sup b/-ary phase-shift keying mapping. The frequency-nonselective, block-wise constant Rayleigh fading channel is considered here. The results are applicable to any number of transmit and receive antennas, where the number of transmit antennas is dictated by the available coding schemes.     

Successive interference cancelation for space-time block codes over time-selective channels

In this letter, we propose a very simple successive interference cancelation (SIC) based signal detector for space-time block codes (STBC) to combat time-selective fading. The main idea is to treat un-detected symbols as noise using a Gaussian approximation. Simulation results show that our scheme can provide performance very close to ML decoding with extremely low computational complexity     

Channel estimation for space-time orthogonal block codes

Channel estimation is one of the key components of space-time systems design. The transmission of pilot symbols, referred to as training, is often used to aid channel acquisition. In this paper, a class of generalized training schemes that allow the superposition of training and data symbols is considered. First, the Cramer-Rao lower bound (CRLB) is derived as a function of the power allocation matrices that characterize different training schemes. Then, equivalent training schemes are obtained, and the behavior of the CRLB is analyzed under different power constraints. It is shown that for certain training schemes, superimposing data with training symbols increases CRLB, and concentrating training power reduces CRLB. On the other hand, once the channel is acquired, uniformly superimposed power allocation maximizes the mutual information and, hence, the capacity.     

Performance analysis of space-time block codes over keyhole Nakagami-m fading channels

In multiple-input-multiple-output (MIMO) fading environments, degenerate channel phenomena, called keyholes or pinholes, may exist under the realistic assumption that the spatial fading is uncorrelated at the transmitter and the receiver, but the channel has a rank-deficient transfer matrix. In this paper, we analyze the exact average symbol error rate (SER) of orthogonal space-time block codes (STBCs) with M-PSK and M-QAM constellations over Nakagami-m fading channels in the presence of the keyhole. We derive the moment generating function (MGF) of instantaneous signal-to-noise ratio (SNR) after space-time block decoding (signal combining) in such channels. Using a well-known MGF-based analysis approach, we express the average SER of the STBC in the form of single finite-range integrals whose integrand contains only the derived MGF. Numerical results show that the keyhole significantly degrades the SER performance of the STBC from idealistic behaviors in independent identically distributed MIMO channels.     

Performance of concatenated channel codes and orthogonal space-time block codes

In this paper we analyze the performance of an important class of MIMO systems that of orthogonal space-time block codes concatenated with channel coding. This system configuration has an attractive combination of simplicity and performance. We study this system under spatially independent fading as well as correlated fading that may arise from the proximity of transmit or receive antennas or unfavorable scattering conditions. We consider the effects of time correlation and present a general analysis for the case where both spatial and temporal correlations exist in the system. We present simulation results for a variety of channel codes, including convolutional codes, turbo codes, trellis coded modulation (TCM), and multiple trellis coded modulation (MTCM), under quasi-static and block-fading Rayleigh as well as Rician fading. Simulations verify the validity of our analysis.     

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.     

Performance analysis of orthogonal space-time block codes in spatially correlated MIMO Nakagami fading channels

Orthogonal space-time block coding (STBC) is an open-loop transmit diversity scheme that decouples the multiple-input multiple-output (MIMO) channel, thereby reducing the space-time decoding into a scalar detection process. This characteristic of STBC makes it a powerful tool, achieving full diversity over MIMO fading channels, and requiring little computational cost for both the encoding and decoding processes. In this paper, we exploit the single-input single-output equivalency of STBC in order to analyze its performance over nonselective Nakagami fading channels in the presence of spatial fading correlation. More specifically, we derive exact closed-form expressions for the outage probability and ergodic capacity of STBC, when the latter is employed over spatially correlated MIMO Nakagami fading channels. Moreover, we derive the exact symbol error probability of coherent M-PSK and M-QAM, when these modulation schemes are used along with STBC over such fading channels. The derived formulae are then used to assess the robustness of STBC to spatial correlation by considering general MIMO correlation models and analyzing their effects on the outage probability, ergodic capacity, and symbol error probability achieved by STBC.     

Robust non-orthogonal space-time block codes over highly correlated channels: a generalisation

Little has so far been reported on the robustness of non-orthogonal space-time block codes (NO-STBCs) over highly correlated channels (HCC). Some of the existing NO-STBCs are indeed weak in robustness against HCC. With a view to overcoming such a limitation, a generalisation of the existing robust NO-STBCs based on a 'matrix Alamouti (MA)' structure is presented.     

Improved approximate maximum-likelihood receiver for differential space-time block codes over Rayleigh-fading channels

In this paper, an approximate maximum-likelihood (ML) receiver for differential space-time block codes is investigated. The receiver is derived from the ML criterion and is shown to mitigate error floor occurring in a conventional differential receiver very well. Because the receiver employs knowledges of signal-to-noise ratio (SNR) and fading rate, we study mismatched cases when these parameters are not accurate. It is shown that the receiver is more sensitive to the mismatched parameters when the fading rate is high. Then, a union bound on the bit error probability is derived. The bounds show good agreement with the simulation results at high fading rate and at high SNR. Finally, a modified receiver, denoted as multistage receiver, is proposed to compensate the so-called intrablock interference caused by the time-varying characteristic of the channel within a transmission block. The multistage receiver offers further reduction of error floor of about half order of magnitude as compared with an approximate ML receiver.     

Limited feedback unitary precoding for orthogonal space-time block codes

Orthogonal space-time block codes (OSTBCs) are a class of easily decoded space-time codes that achieve full diversity order in Rayleigh fading channels. OSTBCs exist only for certain numbers of transmit antennas and do not provide array gain like diversity techniques that exploit transmit channel information. When channel state information is available at the transmitter, though, precoding the space-time codeword can be used to support different numbers of transmit antennas and to improve array gain. Unfortunately, transmitters in many wireless systems have no knowledge about current channel conditions. This motivates limited feedback precoding methods such as channel quantization or antenna subset selection. This paper investigates a limited feedback approach that uses a codebook of precoding matrices known a priori to both the transmitter and receiver. The receiver chooses a matrix from the codebook based on current channel conditions and conveys the optimal codebook matrix to the transmitter over an error-free, zero-delay feedback channel. A criterion for choosing the optimal precoding matrix in the codebook is proposed that relates directly to minimizing the probability of symbol error of the precoded system. Low average distortion codebooks are derived based on the optimal codeword selection criterion. The resulting design is found to relate to the famous applied mathematics problem of subspace packing in the Grassmann manifold. Codebooks designed by this method are proven to provide full diversity order in Rayleigh fading channels. Monte Carlo simulations show that limited feedback precoding performs better than antenna subset selection.     

基于OSTBC的有限反馈预编码设计

D.J.Love等在文献[7]中提出了基于正交空时码的有限反馈多天线系统,并且设计了至今保持最优性能的码本。这一系统已经被IEEE国际标准所采用。针对这一系统,本文基于文献[16]中的预编码设计准则,提出了新的预编码设计方案。相对于Love等在[7]中提出的码本,本文提出的新的码本在性能上有了提高。并且本文新的码本还具有快速选码方案,在其性能损失较小的情况下,有效降低了选码复杂度。     

On orthogonal space-time block codes and transceiver signal linearization

We present a necessary and sufficient condition for any orthogonal space-time block code (STBC) to allow transceiver signal linearization (as in the well-known case of the Alamouti scheme). Then, we show that all square orthogonal STBC's that satisfy the condition have rate that goes to zero linearly with the number of transmit antennas. Hence, multiple-antenna systems with orthogonal STBC's and satisfactory rate are possible only If we abandon the linearization property or utilize non-square codes (except for the 2 /spl times/ 2 Alamouti code).     

Optimized non-unitary linear precoding for orthogonal space-time block codes

This letter proposes a novel optimized non-unitary linear precoding design for orthogonal space-time block codes (OSTBCs). We dig out the transmission potentials by the analysis from eigen-space point of view according to the unique structure of OSTBCs. The proposed precoding form is proved to be theoretically optimized. Compared with the classical unitary Grassmannian codebook design, in the sense of restriction on the time average power of transmit signal, the proposed non-unitary codebook further improves the overall performance of practical systems. The new constraint on codebook size to guarantee full diversity order is given and proved. The advantages of our proposed design are verified in the numerical simulations.     

Signal detection for non-orthogonal space-time block coding over time-selective fading channels

In the case of non-quasi-static (i.e., time-selective fast fading) channels, which do exist in practice, the performance of the existing NO-STBC detectors can suffer from an irreducible error floor. To this end, this letter proposes a zero-forcing-based signal detector, which is not only computationally simple but also highly effective in mitigating the impact of channel variation on system performance.     

A systematic design of high-rate complex orthogonal space-time block codes

In this letter, a systematic design method to generate high-rate space-time block codes from complex orthogonal designs for any number of transmit antennas is proposed. The resulting designs have the best known rates. Two constructions with rates 2/3 and 5/8 are further illustrated for 6 and 7 transmit antennas, respectively.     

Closed-form blind MIMO channel estimation for orthogonal space-time block codes

In this paper, a new computationally simple approach to blind decoding of orthogonal space-time block codes (OSTBCs) is proposed. Using specific properties of OSTBCs, the authors' approach estimates the channel matrix in a closed form and in a fully blind fashion. This channel estimate is then used in the maximum-likelihood (ML) receiver to decode the information symbols. The proposed estimation technique provides consistent channel estimates, and, as a result, the performance of the authors' blind ML receiver approaches that of the coherent ML receiver, which exploits the exact channel state information (CSI). Simulation results demonstrate the performance improvements achieved by the proposed blind decoding algorithm relative to the popular differential space-time modulation scheme.     

Differentially en/decoded orthogonal space-time block codes withAPSK signals

In this letter, we propose a differential en/decoding scheme for Alamouti's orthogonal space-time code using amplitude/phase-shift keying (STC-APSK) signals and two transmit antennas. It is compared with the differential en/decoding scheme using 16APSK and single transmit antenna. It is also compared with the differential en/decoding scheme for Alamouti's orthogonal space-time code using 16PSK (STC-16PSK) signals and two transmit antennas. We find that the performance of the differentially en/decoded STC-APSK with 4.5 b/s/Hz is significantly better than that of the differentially en/decoded 16APSK with 4 b/s/Hz, and is almost the same as that of the STC-16PSK with 4 b/s/Hz over Rayleigh flat fading channels