High-throughput error correcting space-time block codes

This letter investigates using an error correction code (ECC) to construct the space-time block code (STBC). Block ECCs over several Galois fields are considered. The resulting STBCs have significantly higher throughput and better performance than orthogonal STBCs, at the cost of increased decoding complexity.     

Capacity achieving high rate space-time block codes

It is well known, that the Alamouti scheme is the only space-time code from orthogonal design achieving the capacity of multiple-input multiple-output (MIMO) wireless communication system with n/sub T/=2 transmit antennas and n/sub R/=1 receive antenna. In this work, we propose the n-times stacked Alamouti scheme for n/sub T/=2n transmit antennas and show that this scheme achieves the capacity in the case of n/sub R/=1 receive antenna. 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.     

On the probability of error of antenna-subset selection with space-time block codes

Orthogonal space-time block codes (OSTBCs) can obtain full diversity advantage with a simple, but optimal, receiver. Unfortunately, OSTBCs lack in array gain compared with beamforming techniques and suffer a rate loss for more than two transmit antennas. One simple method for improving the array gain and adapting OSTBCs to any number of transmit antennas is antenna-subset selection, where the OSTBC is transmitted on a subset of the transmit antennas. In this letter, we analyze the symbol-error rate performance of antenna-subset selection combined with OSTBCs.     

Decision feedback detection with error compensation for hybrid space-time block codes

Spatial division multiplexing (SDM) techniques increase the total throughput by transmitting independent information streams through multiple transmit antennas whereas space time coding (STC) techniques utilize diversity gain. Hybrid space-time block code (STBC) schemes proposed combine the above two techniques to maximize the link performance. We propose a decision feedback detection method to improve the performance of the hybrid STBC scheme for orthogonal frequency division multiplexing (OFDM). In this scheme, we take the error propagation effect into account to enhance the detection performance. Simulation results show that the proposed method outperforms the conventional hybrid STBC detection algorithm by more than 3dB at 1% frame error rate for frequency selective fading channels.     

Diagonal algebraic space-time block codes

We construct a new family of linear space-time (ST) block codes by the combination of rotated constellations and the Hadamard transform, and we prove them to achieve the full transmit diversity over a quasi-static or fast fading channels. The proposed codes transmit at a normalized rate of 1 symbol/s. When the number of transmit antennas n=1, 2, or n is a multiple of four, we spread a rotated version of the information symbol vector by the Hadamard transform and send it over n transmit antennas and n time periods; for other values of n, we construct the codes by sending the components of a rotated version of the information symbol vector over the diagonal of an n × n ST code matrix. The codes maintain their rate, diversity, and coding gains for all real and complex constellations carved from the complex integers ring Z [i], and they outperform the codes from orthogonal design when using complex constellations for n > 2. The maximum-likelihood (ML) decoding of the proposed codes can be implemented by the sphere decoder at a moderate complexity. It is shown that using the proposed codes in a multiantenna system yields good performances with high spectral efficiency and moderate decoding complexity     

Design of channel-estimate-dependent space-time block codes

So far, the assumption of no channel knowledge at the transmitter has generally been inherent in the design of space-time codes. This paper, on the other hand, assumes that quantized channel information obtained from a feedback link is available at the transmitter and investigates how such channel information can be incorporated into the design of unstructured space-time block codes. Efficient codes are found by means of a gradient search over a continuous alphabet. Simulation results for an uncorrelated Rayleigh fading scenario using two and four transmit antennas and one receive antenna show the benefits of the code designs.     

Effect of smooth nonlinear distortion on OFDM symbol error rate

Nonlinear distortion of OFDM signals can significantly increase the receiver symbol error rate (SER). Currently, distortion analyses rely on simulation, not yielding insight into the problem, or apply to specific nonlinearities only. In this letter, general analytic results are presented on the errors resulting from distortion. The results are applicable to smooth nonlinear distortion of an OFDM signal, which is the most common distortion. Simple analytical expressions are derived which allows a designer to determine the SER before performing simulations. Further, it is shown that the error on each OFDM subcarrier is approximately equally large     

Encoding and decoding for the minimization of message symbol error rates in linear block codes

Given any fixed linear block code, the error rates for the message symbols depend both on the encoding function and on the decoding map. This research shows how to optimize the choice of a generator matrix and decoding map simultaneously to minimize the error rates for all message symbols. The model used assumes that the distribution of messages is flat and that the distribution of error vectors defining the channel is independent of the message transmitted. In addition, it is shown that, with proper choice of coset leaders, standard array decoding is optimal in this circumstance. The results generalize previously known results on unequal error protection and are sufficiently general to apply when a code is used for error detection only.     

发射天线选择空时分组码的误符号率分析

研究瑞利衰落信道上使用发射天线选择和空时分组编码的多输入多输出系统的误码性能。使用矩生成函数法和Apell超几何函数、Lauricella多变量超几何函数,推导采用相干检测的M进制相移键控(MPSK)和广义矩形M进制正交幅度调制(GR-MQAM)的平均符号错误概率(SEP)的精确闭合表达式。数值计算结果表明:增加发射天线或/和接收天线数可以改善MIMO瑞利衰落上MPSK和GR-MQAM的平均SEP性能。     

Tight error bounds for space-time orthogonal block codes under slow Rayleigh flat fading

The performance of space-time orthogonal block (STOB) codes over slow Rayleigh fading channels and maximum-likelihood (ML) decoding is investigated. Two Bonferroni-type bounds (one upper bound and one lower bound) for the symbol error rate (SER) and bit error rate (BER) of the system are obtained. The bounds are expressed in terms of the pairwise error probabilities (PEPs) and the two-dimensional pairwise error probabilities (2-D PEPs) of the transmitted symbols. Furthermore, the bounds can be efficiently evaluated and they hold for arbitrary (nonstandard) signaling schemes and mappings. Numerical results demonstrate that the bounds are very accurate in estimating the performance of STOB codes. In particular, the upper and lower bounds often coincide even at low channel signal-to-noise ratios, large constellation sizes, and large diversity orders.     

Efficiently decoded full-rate space-time block codes

Space-time block codes with orthogonal structures typically provide full-diversity reception and simple receiver processing. However, rate-1 orthogonal codes for complex constellations have not been found for more than two transmit antennas. By using a genetic algorithm, rate-1 space-time block codes that accommodate very simple receiver processing at the cost of reduced diversity are designed in this paper for more than two transmit antennas. Simulation results show that evolved codes combined with efficient outer codes provide better performance over fading channels than minimum-decoding-complexity quasiorthogonal codes at typical operating signal-to-noise ratios. When the fading is more severe than Rayleigh fading, the spectral efficiency is specified, and an efficient outer code is used, evolved codes outperform orthogonal space-time block codes.     

Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)

The general problem of estimating the a posteriori probabilities of the states and transitions of a Markov source observed through a discrete memoryless channel is considered. The decoding of linear block and convolutional codes to minimize symbol error probability is shown to be a special case of this problem. An optimal decoding algorithm is derived.     

Full rate space-time turbo codes

This paper proposes a class of full space diversity full rate space-time turbo codes. Both parallel concatenated and serially concatenated codes are designed. A rank theory proposed by the authors earlier is employed to check the full space diversity of the codes. The simulations show that the space-time turbo codes can take full advantage of space diversity and time diversity if they are available in the channels. We also study the robustness of performance of both turbo codes and trellis codes in space-time correlated fading channels     

On diagonal algebraic space-time block codes

Theoretical and practical aspects of diagonal algebraic space-time block codes over n transmit and m receive antennae are examined. These codes are obtained by sending a rotated version of the information symbols over the principal diagonal of the n /spl times/ n space-time matrix over n transmit antennae and n symbol periods. The output signal-to-noise ratios of two predecoding filters and two decoding algorithms are derived. Analysis of the information loss incurred by using the codes considered is used to clarify their structures, and the expected performances. Different algebraic real and complex rotations presented in the literature are analyzed and compared as regards the achieved coding gains, the complexities, performances, and peak-to-mean envelope power ratios.     

Exact pairwise error probability of space-time codes

We describe a simple technique for the numerical calculation, within any desired degree of accuracy, of the pairwise error probability (PEP) of space-time codes over fading channels. This method applies also to the calculation of E[Q(√ξ)] for any nonnegative random variable ξ whose moment-generating function Φ_ξ(s)=E[exp(-sξ)] is known. Its application to the multiple antenna independent Rayleigh-fading channel and to the Rayleigh block fading channel is discussed, and illustrated by two simple examples     

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

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

Chernoff bounds on pairwise error probabilities of space-time codes

We derive Chernoff bounds on pairwise error probabilities of coherent and noncoherent space-time signaling schemes. First, general Chernoff bound expressions are derived for a correlated Ricean fading channel and correlated additive Gaussian noise. Then, we specialize the obtained results to the cases of space-time-separable noise, white noise, and uncorrelated fading. We derive approximate Chernoff bounds for high and low signal-to-noise ratios (SNRs) and propose optimal signaling schemes. We also compute the optimal number of transmitter antennas for noncoherent signaling with unitary mutually orthogonal space-time codes.     

Matrices analysis of quasi-orthogonal space-time block codes

In this paper, according to the analysis of existing transmission matrices of quasi-orthogonal space-time block codes (STBC), we generalize some of their characters and derive several new patterns to enrich the family of quasi-orthogonal STBC.     

On the error performance analysis of space-time trellis codes

We present analytical performance results for space-time trellis codes over spatially correlated Rayleigh fading channels. Bit-error-probability estimates are obtained based on the derivation of an exact pairwise error probability expression using a residue technique combined with a characteristic function approach. We investigate both quasi-static and interleaved channels and demonstrate how the spatial fading correlation affects the performance of space-time codes over these two different channel models. Simulation results are also included to confirm the accuracy of analytical estimates.