Multilevel block codes for Rayleigh-fading channels

New multilevel block codes for Rayleigh-fading channels are presented. At high signal-to-noise ratios (SNRs), the proposed block codes can achieve better bit error performance over TCM codes, optimum for fading channels, with comparable decoder complexity and bandwidth efficiency. The code construction is based on variant length binary component block codes. As component codes for the 8-PSK multilevel block construction, the authors propose two modified forms of Reed-Muller codes giving a good trade-off between the decoder complexity and the effective code rates. Code design criteria are derived from the error performance analysis. Multistage decoding shows very slight degradation of bit error performance relative to the maximum likelihood algorithm     

Linear prediction receiver for differential space-time block codes with spatial correlation

The differential space-time block code is well-known to provide full spatial diversity and allows simple differential detection. Recent results have shown performance degradation when the channel is time-varying. The letter shows the effect on error performance of spatial correlation between transmit antennas. A generalized receiver which exploits spatial correlation information, is proposed and shown to outperform an existing receiver in terms of frame error rate for slowly varying channels with moderate to high spatial correlation.     

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     

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

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

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.     

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.     

BEM-based SISO detection of orthogonal space-time block codes over frequency flat-fading channels

The expectation-maximization algorithm for maximum a posteriori (MAP) estimation of a random vector is applied to the problem of detection of orthogonal space-time block codes over time-selective Rayleigh fading channels. This results in a soft-in soft-out detection algorithm suitable for iterative detection/decoding schemes. Simulation results show that the error performance of the proposed detection algorithm is very close to that of a MAP detector endowed with an ideal knowledge of the channel state if the fading rate is not too fast.     

Double differential space-time block coding for time-selectivefading channels

Most existing space-time coding schemes assume time-invariant fading channels and offer antenna diversity gains relying on accurate channel estimates at the receiver. Other single differential space-time block coding schemes forego channel estimation but are less effective in rapidly fading environments. Based on a diagonal unitary matrix group, a novel double differential space-time block coding approach is derived in this paper for time-selective fading channels. Without estimating the channels at the receiver, information symbols are recovered with antenna diversity gains regardless of frequency offsets. The resulting transceiver has very low complexity and is applicable to an arbitrary number of transmit and receive antennas. Approximately optimal space-time codes are also designed to minimize bit error rate. System performance is evaluated both analytically and with simulations     

Improved space-time convolutional codes for quasi-static slow fading channels

Space-time convolutional codes, that provide maximum diversity and coding gain, are produced for cases with PSK modulation and various numbers of states and antennas. The codes are found using a new approach introduced previously in a companion paper. The new approach provides an efficient method that allows a search for optimum codes for many practical problems. The new approach also provides a simple method for augmenting the criteria of maximum diversity and coding gain with a new measure which is shown to be extremely useful for evaluating code performance without extensive simulations. To validate the approach, an extensive set of simulation results are presented comparing the codes designed here to many other previously proposed space-time convolutional codes. The comparisons, given in terms of frame error rate (FER), indicate that our new method provides codes which yield excellent performance. The approach is especially useful for finding a handful of good codes. Selection among these codes can be made with a limited number of simulations for FER.     

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.     

Capacity maximizing MMSE-optimal pilots for wireless OFDM over frequency-selective block Rayleigh-fading channels

The location, number, and power of pilot symbols embedded in multicarrier block transmissions over rapidly fading channels, are important design parameters affecting not only channel estimation performance, but also channel capacity. Considering orthogonal frequency-division multiplexing (OFDM) systems with decoupled information-bearing symbols from pilot symbols transmitted over wireless frequency-selective Rayleigh-fading channels, we show that equispaced and equipowered pilot symbols are optimal in terms of minimizing the mean-square channel estimation error. We also design the number of pilots, and the power distributed between information bearing and pilot symbols, using as criterion a lower bound on the average capacity. Numerical results corroborate our theoretical findings.     

Iterative maximum-likelihood trellis decoding for block codes

An iterative trellis search technique is described for the maximum-likelihood (ML) soft decision decoding of block codes. The proposed technique derives its motivation from the fact that a given block code may be a subcode for a parent code whose associated trellis has substantially fewer edges. Through the use of list-Viterbi (1967) decoding and an iterative algorithm, the proposed technique allows for the use of a trellis for the parent code in the ML decoding of the desired subcode. Complexity and performance analyses, as well as details of potential implementations, indicate a substantial reduction in decoding complexity for linear block codes of practical length while achieving ML or near-ML soft decision performance     

衰落信道空间相关对空时编码性能的影响

在各收发天线间的信道相互独立时,空时编码技术可获得最大分集增益。而在实际环境中,信道之间是彼此相关的,这将在一定程度上影响通信系统的性能。结合差分空时编码方案研究该问题,并以2个发射天线,1个接收天线为例详细推导了空间相关衰落信道条件下,差分检测方案误码率上界的解析表示式。计算机仿真验证了该表示式的有效性。     

On CDMA with space-time codes over multipath fading channels

We explore code-division multiple-access systems with multiple transmitter and receiver antennas combined with algebraic constellations over a quasi-static multipath fading channel. We first propose a technique to obtain transmit diversity for a single user over quasi-static fading channels by combining algebraic constellations with full spatial diversity and spreading sequences with good cross-correlation properties. The proposed scheme is then generalized to a multiuser system using the same algebraic constellation and different spreading sequences. We also propose a linear multiuser detector based on the combination of linear decorrelation with respect to all users, and the application of the sphere decoder to decode each user separately. Finally, we consider the generalization to multipath fading channels where the additional diversity advantage due to multipath is exploited by the sphere decoder, and a method of blind channel estimation based on subspace decomposition is examined.     

Low-complexity maximum-likelihood decoder for four-transmit-antenna quasi-orthogonal space-time block code

This letter proposes a very low-complexity maximum-likelihood (ML) detection algorithm based on QR decomposition for the quasi-orthogonal space-time block code (QSTBC) with four transmit antennas, called the LC-ML decoder. The proposed algorithm enables the QSTBC to achieve ML performance with significant reduction in computational load for any high-level modulation scheme.     

Capacity-achieving codes for finite-state channels with maximum-likelihood decoding

Codes on sparse graphs have been shown to achieve remarkable performance in point-to-point channels with low decoding complexity. Most of the results in this area are based on experimental evidence and/or approximate analysis. The question of whether codes on sparse graphs can achieve the capacity of noisy channels with iterative decoding is still open, and has only been conclusively and positively answered for the binary erasure channel. On the other hand, codes on sparse graphs have been proven to achieve the capacity of memoryless, binary-input, output-symmetric channels with finite graphical complexity per information bit when maximum likelihood (ML) decoding is performed. In this paper, we consider transmission over finite-state channels (FSCs). We derive upper bounds on the average error probability of code ensembles with ML decoding. Based on these bounds we show that codes on sparse graphs can achieve the symmetric information rate (SIR) of FSCs, which is the maximum achievable rate with independently and uniformly distributed input sequences. In order to achieve rates beyond the SIR, we consider a simple quantization scheme that when applied to ensembles of codes on sparse graphs induces a Markov distribution on the transmitted sequence. By deriving average error probability bounds for these quantized code ensembles, we prove that they can achieve the information rates corresponding to the induced Markov distribution, and thus approach the FSC capacity.     

Error probability for block codes over channels with blockinterference

A methodology is presented to evaluate analytically the error probability for block codes over block interference channels. The proposed analysis is based on the knowledge of the moments of the bit-error probability over the interference, thus allowing, for instance, fast performance evaluation of block-coded slow frequency hopping (SFH) systems with antenna diversity over fading channels. As an example of application, slow frequency hopping multiple access (SFHMA) systems with nonideal interleaving are analyzed in the presence of fading, cochannel interference, and additive Gaussian noise     

BER analysis of MPSK space-time block codes with differential detection

Closed-form expressions of the bit error rate (BER) are derived for space-time block codes based on Alamouti's (1998) scheme and utilizing M-ary phase shift keying modulation with noncoherent differential encoding/decoding. The analysis is carried out for the flat block-fading Rayleigh channel, and the BER expression is an approximation for high signal to noise ratio. Theoretical results are validated by simulations for BPSK and QPSK modulations.     

Suboptimum receiver interfaces and space-time codes

We compare suboptimum linear and nonlinear interfaces to be used for decoding space-time codes transmitted over a multiple-antenna Rayleigh fading channel with perfect channel-state information available at the receiver. The codes we consider are obtained by apportioning evenly, among the transmit antennas, the symbols of off-the-shelf convolutional codes. We observe how the introduction of an interleaver can be beneficial here. We introduce a new simple iterative linear interface, based on hard Viterbi decoding and offering a performance considerably improved with respect to noniterative receivers.