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.     

Single-symbol ML decoding for orthogonal and quasi-orthogonal STBC in clipped MIMO-OFDM systems using a clipping noise model with Gaussian approximation

An efficient way to reduce the peak-to-average power ratio (PAPR) in OFDM systems is clipping. After the clipping in an MIMO-OFDM system, the additive noise may not be white. In this paper, we develop fast (single-symbol) ML decoding algorithms for orthogonal space-time block codes (OSTBC) and (linearly transformed) quasi orthogonal space- time block codes (QOSTBC) in clipped MIMO-OFDM systems by using a clipping noise model with Gaussian approximation. By using the statistics of the clipping distortions, our newly developed fast ML decoding algorithms improve the performance for clipped MIMO-OFDM systems with OSTBC and QOSTBC while the decoding complexities are not increased. Simulation results are presented to illustrate the improvement.     

Orthogonal space-time block codes: maximum likelihood detection for unknown channels and unstructured interferences

Space-time coding (STC) schemes for communication systems employing multiple transmit and receive antennas have been attracting increased attention. The so-called orthogonal space-time block codes (OSTBCs) have been of particular interest due to their good performance and low decoding complexity. In this paper, we take a systematic maximum-likelihood (ML) approach to the decoding of OSTBC for unknown propagation channels and unknown noise and interference conditions. We derive a low-complexity ML decoding algorithm based on cyclic minimization and assisted by a minimum amount of training data. Furthermore, we discuss the design of optimal training sequences and optimal information transfer to an outer decoder. Numerical examples demonstrate the performance of our algorithm.     

基于预编码的全码率准正交空时分组码

针对传统八天线全码率准正交空时分组码解码复杂度高的问题,该文提出了两种基于预编码的传输方案。利用四天线正交码扩展得到新的八天线准正交码,结合两个反馈相位信息构成的预编码矩阵,使信道矩阵正交化,消除码间串扰,实现码元独立最大似然解码。发送端采用交织技术,进一步提高了性能,实现了双码元联合最大似然解码。和获得满分集增益的星座图旋转方案不同,预编码方案最大程度上减少了码间串扰,提高准正交码的性能。仿真结果表明,基于预编码的两种准正交码性能好于星座旋转准正交码,而且降低了解码复杂度。     

Maximum multipath diversity with linear equalization in precoded OFDM systems

In wireless communications, the fading multipath channel attenuates and distorts the transmitted signal. To decode the transmitted symbols and take advantage of the full multipath diversity that the channel has to offer, computationally complex maximum-likelihood (ML) decoding is often employed. We show that a linear equalizer followed by a hard decision is capable of benefiting from maximum multipath diversity in linearly precoded orthogonal frequency-division multiplexing (OFDM) systems, where the information symbols are mapped through a matrix transformation before the inverse fast Fourier transform (IFFT) at the OFDM transmitter. As far as we are aware, this is the first proof of a linear equalization scheme achieving maximum multipath diversity over single-input single-output wireless links. We can conclude from this result that at sufficiently high signal-to-noise ratios (SNR), precoded OFDM systems will perform better over channels with more taps even with linear equalization, due to the increase in diversity order.     

Differential spatial modulation scheme based on orthogonal space-time block coded

Focusing on the problem that differential spatial modulation (DSM) couldn’t obtain transmit diversity and has high decoding complexity,a new differential spatial modulation scheme based on the orthogonal space-time block code was proposed and the proposed scheme is called OSTBC-DSM.There were two matrices in this scheme:the spatial modulation matrix and the symbol matrix.The former was aimed to activate different transmit antennas by setting the position of nonzero elements,and the latter structured symbolic matrix by using orthogonal space-time block codes (OSTBC) as the basic code block.The proposed scheme could obtain full transmit diversity and higher spectral efficiency compared with the conventional DSM schemes.Moreover,the OSTBC-DSM supported linear maximum likelihood (ML) decoding.The simulation results show that under different spectral efficiencies,the proposed OSTBC-DSM scheme has better bit error rate (BER) performance than other schemes.     

Soft-limiter RAKE receivers for coded DS/DPSK systems over pulsejammed multipath-fading channels

Two soft-limiter RAKE receivers are evaluated for coded direct-sequence/differential phase shift keying (DS/DPSK) signaling over a pulse jammed multipath-fading channel that use a combination of antenna and multipath diversity. One uses predetection selective (antenna) combining followed by postdetection equal gain (multipath) combining, and the other uses postdetection equal gain combining only. In either case, the postdetection diversity combiner output is soft-limited prior to decoding. It is shown that for increasing levels of diversity the soft-limiter becomes quite effective, resulting in a receiver performance that approaches a maximum likelihood (ML) soft decision receiver with perfect jammer state information     

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

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

Space–Time Block Codes Achieving Full Diversity With Linear Receivers

In most of the existing space–time code designs, achieving full diversity is based on maximum-likelihood (ML) decoding at the receiver that is usually computationally expensive and may not have soft outputs. Recently, Zhang–Liu–Wong introduced Toeplitz codes and showed that Toeplitz codes achieve full diversity when a linear receiver, zero-forcing (ZF) or minimum mean square error (MMSE) receiver, is used. Motivated from Zhang–Liu–Wong's results on Toeplitz codes, in this paper, we propose a design criterion for space–time block codes (STBC), in which information symbols and their complex conjugates are linearly embedded, to achieve full diversity when ZF or MMSE receiver is used. The (complex) orthogonal STBC (OSTBC) satisfy the criterion as one may expect. We also show that the symbol rates of STBC under this criterion are upper bounded by 1. Subsequently, we propose a novel family of STBC that satisfy the criterion and thus achieve full diversity with ZF or MMSE receiver. Our newly proposed STBC are constructed by overlapping the $2,times,2$ Alamouti code and hence named overlapped Alamouti codes in this paper. The new codes are close to orthogonal and their symbol rates can approach 1 for any number of transmit antennas. Simulation results show that overlapped Alamouti codes significantly outperform Toeplitz codes for all numbers of transmit antennas and also outperform OSTBC when the number of transmit antennas is above $4$.      

Lattice-reduction aided equalization for OFDM systems

Orthogonal Frequency Division Multiplexing (OFDM) is an effective technique to deal with frequency-selective channels since it facilitates low complexity equalization and decoding. Many existing OFDM designs successfully exploit the multipath diversity offered by frequency-selective channels. However, most of them require maximum likelihood (ML) or near-ML detection at the receiver, which is of high complexity. On the other hand, empirical results have shown that linear detectors have low complexity but offer inferior performance. In this paper, we analytically quantify the diversity orders of linear equalizers for linear precoded OFDM systems, and prove that they are unable to collect full diversity. To improve the performance of linear equalizers, we further propose to use a lattice reduction (LR) technique to help collect diversity. The LR-aided linear equalizers are shown to achieve maximum diversity order (i.e., the one collected by the ML detector), but with low complexity that is comparable to that of conventional linear equalizers. The theoretical findings are corroborated by simulation results.     

A novel QO-STBC scheme with linear decoding for three and four transmit antennas

In this letter, we propose a quasi-orthogonal spacetime block coding (QO-STBC) scheme with maximum likelihood (ML) decoding via simple linear detection. A conventional QOSTBC scheme can achieve the full rate, but at the cost of decoding complexity and diversity gain. These disadvantages of the conventional QO-STBC scheme are mainly a result of interference terms in the detection matrix. In this letter, we propose a new QO-STBC scheme which eliminates interference terms. The proposed method achieves improved diversity gain with respect to the conventional QO-STBC scheme, as well as a great reduction in decoding complexity.     

Real-Domain Decoder for Full-Rate Full-Diversity STBC with Multidimensional Constellations

In this letter, we present a new maximum likelihood (ML) decoding algorithm for space time block codes (STBCs) that employ multidimensional constellations. We start with a lattice representation for STBCs which transforms complex channel models into real matrix equations. Based on the lattice representation, we propose a new decoding algorithm for quasiorthogonal STBCs (QO-STBC) which allows simpleML decoding with performance identical to the conventional ML decoder. Multidimensional rotated constellations are constructed for the QO-STBCs to achieve full diversity. As a consequence, for quasi-orthogonal designs with an arbitrary number of transmit antennas N (N ? 4), the proposed decoding scheme achieves full rate and full diversity while reducing the decoding complexity from ∂(M_c^N/2) to ∂(M_c^N/4) in a M_c-QAM constellation.     

一种高性能全分集LDPC码的构造方法

块衰落信道上全分集LDPC的构造与性能分析成为近期研究的热点。ML译码算法下全分集LDPC码可以通过设计列满秩的校验子矩阵来实现。然而,基于ML准则的全分集码字,采用迭代译码算法时,不能保证全分集。因此,该文通过设计特定结构的校验矩阵,实现了在迭代译码算法下能取得全分集的LDPC码,分析了其密度演化过程。 在此基础上,进一步研究了全分集LDPC码字结构与性能的关系,提出了提高全分集LDPC码编码增益的方法。仿真结果表明,该文构造的LDPC码不仅能够取得全分集,并且具有较高的编码增益。     

大气无线光通信系统中一种正交空时分组码编译方法

为了降低湍流对大气无线光通信的影响,提高无线光通信系统性能,提出了一种4发射天线、4接收天线的无线光多发射多接收系统模型,针对该模型设计了一种正交空时分组码(OSTBC)编译方法,并对该码的平均误比特性能进行了仿真分析。结果表明,该方案具有很大的分集优势,可获得的最大分集度为16,达到了4发4收系统所能获得的最大空间分集增益,同时该编码方法与传统的Alamouti方案一样能实现最大传输速率。通过对译码算法进行简单修改,OSTBC编译方法也可以应用在接收天线数目为1,2或3个的多光束发射和接收系统中。     

Generalized PSK in space-time coding

A wireless communication system using multiple antennas promises reliable transmission under Rayleigh flat fading assumptions. Design criteria and practical schemes have been presented for both coherent and noncoherent communication channels. In this paper, we generalize one-dimensional (1-D) phase-shift keying (PSK) signals and introduce space-time constellations from generalized PSK (GPSK) signals based on the complex and real orthogonal designs. The resulting space-time constellations reallocate the energy for each transmitting antenna and feature good diversity products; consequently, their performances are better than some of the existing comparable codes. Moreover, since the maximum-likelihood (ML) decoding of our proposed codes can be decomposed to 1-D PSK signal demodulation, the ML decoding of our codes can be implemented in a very efficient way.     

Rate-one space-time block codes with full diversity

Orthogonal space-time block codes provide full diversity, and maximum-likelihood (ML) decoding for orthogonal codes can be realized on a symbol-by-symbol basis. It has been shown that rate-one complex orthogonal codes do not exist for systems with more than two transmit antennas. For a general system with N transmit and M receive antennas, it is very desirable to design rate-one complex codes with full diversity. In this letter, we provide a systematic method of designing rate-one codes (real or complex) for a general multiple-input multiple-output system. Full diversity of these codes is then achieved by constellation rotation. A generalized, reduced-complexity decoding method for rate-one codes is also provided.     

Signal constellations for quasi-orthogonal space-time block codes with full diversity

Space-time block codes (STBCs) from orthogonal designs proposed by Alamouti, and Tarokh-Jafarkhani-Calderbank have attracted considerable attention lately due to their fast maximum-likelihood (ML) decoding and full diversity. However, the maximum symbol transmission rate of an STBC from complex orthogonal designs for complex signals is only 3/4 for three and four transmit antennas, and it is difficult to construct complex orthogonal designs with rate higher than 1/2 for more than four transmit antennas. Recently, Jafarkhani, Tirkkonen-Boariu-Hottinen, and Papadias-Foschini proposed STBCs from quasi-orthogonal designs, where the orthogonality is relaxed to provide higher symbol transmission rates. With the quasi-orthogonal structure, the quasi-orthogonal STBCs still have a fast ML decoding, but do not have the full diversity. The performance of these codes is better than that of the codes from orthogonal designs at low signal-to-noise ratio (SNR), but worse at high SNR. This is due to the fact that the slope of the performance curve depends on the diversity. It is desired to have the quasi-orthogonal STBCs with full diversity to ensure good performance at high SNR. In this paper, we achieve this goal by properly choosing the signal constellations. Specifically, we propose that half of the symbols in a quasi-orthogonal design are chosen from a signal constellation set A and the other half of them are chosen from a rotated constellation e/sup j/spl phi// A. The resulting STBCs can guarantee both full diversity and fast ML decoding. Moreover, we obtain the optimum selections of the rotation angles /spl phi/ for some commonly used signal constellations. Simulation results show that the proposed codes outperform the codes from orthogonal designs at both low and high SNRs.     

Comparison of decoding algorithms of binary linear block codes inRayleigh fading channels with diversity reception

The word error probability of binary linear block codes is evaluated in Rayleigh fading channels with diversity reception for three decoding algorithms: error correction (EC), error/erasure correction (EEC), and maximum likelihood (ML) soft decoding algorithms. The performance advantage of EEC over EC in the required average SNR decreases as the number of diversity channels increases. The performance advantage of EEC over EC does not depend on the specific value of word error probability although the advantage of ML soft decoding over EC increases for lower word error probability     

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.     

A RAKE-based iterative receiver for space-time block-coded multipath CDMA

A turbo multiuser receiver is proposed for space-time block and channel-coded code division multiple access (CDMA) systems in multipath channels. The proposed receiver consists of a first stage that performs detection, space-time decoding, and multipath combining followed by a second stage that performs the channel decoding. A reduced complexity receiver suitable for systems with large numbers of transmitter antennas is obtained by performing the space-time decoding along each resolvable multipath component and then diversity combining the set of space-time decoded outputs. By exchanging the soft information between the first and second stages, the receiver performance is improved via iteration. Simulation results show that while in some cases a noniterative space-time coded system may have inferior performance compared with a system without space-time coding in a multipath channel, proposed iterative schemes significantly outperform systems without space-time coding, even with only two iterations. Furthermore, the performance loss in the reduced-complexity receiver due to decoupling of interference suppression, space-time decoding, and multipath combining is very small for error rates of practical interest.