Efficient Decoding for Generalized Quasi-Orthogonal Space–Time Block Codes

Space–time coding can achieve transmit diversity and power gain over spatially uncoded systems without sacrificing bandwidth. There are various approaches in coding structures, including space–time block codes. A class of space–time block codes namely quasi-orthogonal space–time block codes can achieve the full rate, but the conventional decoders of these codes experience interference terms resulting from neighboring signals during signal detection. The presence of the interference terms causes an increase in the decoder complexity and a decrease in the performance gain. In this article, we propose a modification to the conventional coding/decoding scheme that will improve performance, reduce decoding complexity, and improve robustness against channel estimation errors as well.     

Fast turbo codes with space‐time block codes in fast fading channels

In this paper, space‐time block coding has been used in conjunction with Turbo codes to provide good diversity and coding gains. A new method of dividing turbo encoder and decoder into several parallel encoding and decoding blocks is considered. These blocks work simultaneously and yield a faster coding scheme in comparison to classical Turbo codes. The system concatenates fast Turbo coding as an outer code with Alamouti's G2 space‐time block coding scheme as an inner code, achieving benefits associated with both techniques including acceptable diversity and coding gain as well as short coding delay. In this paper, fast fading Rayleigh and Rician channels are considered for discussion. For Rayleigh fading channels, a fixed frame size and channel memory length of 5000 and 10, respectively, the coding gain is 7.5 dB and bit error rate (BER) of 10^?4 is achieved at 7 dB. For the same frame size and channel memory length, Rician fading channel yields the same BER at about 4.5 dB. Copyright © 2013 John Wiley & Sons, Ltd.     

线性分组码与时空分组码级联的迭代译码

提出了线性分组码与时空分组码的级联编码方案,推导了时空分组码在比特级上的软输入软输出译码算法,进而给出了在线性分组码和时空分组码之间进行迭代译码的算法。仿真结果表明这种方案与现有方案相比在能够获得最大分集增益的同时还能获得更大的编码增益。     

非同步扩频系统中空时分组码的阵列处理

针对非同步DS-CDMA系统提出了一种基于空时分组码的阵列处理干扰对消的技术。通过对发射信号进行空时分组编码,可以使发射信号在瑞利衰落信道中传输时信息不会畸变,并取得最大分集增益和码增益。利用空时分组码的性质有效抑制干扰的同时,大大简化了空时分组码的解码。仿真结果表明,这里提出的方法与传统的抑制干扰的方法相比具有更低的误比特率,并且有更快的解码速率。     

Adaptive Channel‐Matched Extended Alamouti Space‐Time Code Exploiting Partial Feedback

Since the publication of Alamouti's famous space‐time block code, various quasi‐orthogonal space‐time block codes (QSTBC) for multi‐input multi‐output (MIMO) fading channels for more than two transmit antennas have been proposed. It has been shown that these codes cannot achieve full diversity at full rate. In this paper, we present a simple feedback scheme for rich scattering (flat Rayleigh fading) MIMO channels that improves the coding gain and diversity of a QSTBC for 2ⁿ (n = 3, 4,…) transmit antennas. The relevant channel state information is sent back from the receiver to the transmitter quantized to one or two bits per code block. In this way, signal transmission with an improved coding gain and diversity near to the maximum diversity order is achieved. Such high diversity can be exploited with either a maximum‐likelihood receiver or low‐complexity zero‐forcing receiver.     

Efficient Space-Time Block Codes Derived from Quasi-Orthogonal Structures

We propose a new class of block codes that outperforms known space-time block codes at low rates. The new codes are designed by using appropriate rotations and set partitioning on two quasi-orthogonal codes, and combining subsets of their codewords. Using these techniques we are able to obtain higher coding gain at a given rate and improve performance. Simulations confirm the advantages of this code compared to other codes operating at the same rate and signal-to-noise ratio (SNR). We also provide an efficient maximum likelihood (ML) decoding algorithm for the new code     

Linear Decoupled and Quasi-Decoupled Space–Time Codes

Space-time transmit diversity results in coupling of transmitted symbols across different antennas, which increases the complexity of maximum-likelihood decoding. Symbol coupling can be completely or partially avoided if the space-time code (STC) satisfies specific decoupling conditions; examples of such codes are orthogonal space-time block codes and quasi-orthogonal codes. In this letter, we study decoupling conditions for a linear full-diversity STC. Quasi-decoupled codes are proposed as a partially decoupled full-diversity STC of any rate for any number of transmit antennas with minimum decoding delay. By optimizing the coding gain of quasi-decoupled codes, it is shown that quasi-orthogonal codes have competitive performance with respect to the Alamouti code, and the more-recent threaded algebraic space-time (TAST) codes and ABBA codes. A general full-diversity decoupling condition is considered, and the general solution to this case, which also encompasses previously known orthogonal STCs, is derived     

多天线对角空频编码传输

将平坦衰落信道的对角代数空时码(DAST)推广到频率选择性衰落信道,提出了对角空频分组码(DSF).基于多输入多输出天线和正交频分复用(OFDM),DSF码将满秩的旋转信号星座和子载波分组结合起来,以对角发送方式(每时刻只有一个天线发射)发射旋转信息符号向量的每个分量.成对错误概率分析表明:在频率选择性信道中,通过选择最佳的旋转矩阵,这种DSF-OFDM系统能实现满分集增益和最大的编码增益.系统采用了球型解码器对DSF码实施最大似然解码,它的解码复杂性是中等的,并且,解码算法的复杂性与信号星座的维数无关.此外,和先前所提出的一些方法相比,提出的空频码还具有频谱效率高(1symbol/s/Hz)的性能特点.     

一种新的准正交空时分组码的编码研究

准正交空时分组码可以牺牲一定的分集增益和解码的简单性,来避免当天线数目大于2时正交空时分组码码率下降的缺点。基于准正交空时编码的优点,为了进一步提升性能,提出一种新的4天线准正交空时分组码,并与RS码进行级联编码。仿真表明这种新的编码方法可以保证在复杂度不是很高的前提下,相比Jafarkhani码、TBH码和该广义复正交码具有更低的误码率。     

Gaussian integers and interleaved rank codes for space–time block codes

This paper presents the design of space–time block codes (STBCs) over maximum rank distance (MRD) codes, energy‐efficient STBCs, STBCs using interleaved‐MRD codes, the use of Gaussian integers for STBCs modulation, and Gabidulin's decoding algorithm for decoding STBCs. The design fundamentals of STBCs using MRD codes are firstly put forward for different number of transmit antennas. Extension finite fields (Galois fields) are used to design these linear block codes. Afterward, a comparative study of MRD‐based STBCs with corresponding orthogonal and quasi‐orthogonal codes is also included in the paper. The simulation results show that rank codes, for any number of transmit antennas, exhibit diversity gain at full rate contrary to orthogonal codes, which give diversity gain at full rate only for two transmit antennas case. Secondly, an energy‐efficient MRD‐STBC is proposed, which outperforms orthogonal STBC at least for 2 × 1 antenna system. Thirdly, interleaved‐MRD codes are used to construct higher‐order transmit antenna systems. Using interleaved‐MRD codes further reduces the complexity (compared with normal MRD codes) of the decoding algorithm. Fourthly, the use of Gaussian integers is utilized in mapping MRD‐based STBCs to complex constellations. Furthermore, it is described how an efficient and computationally less complex Gabidulin's decoding algorithm can be exploited for decoding complex MRD‐STBCs. The decoding results have been compared against hard‐decision maximum likelihood decoding. Under this decoding scheme, MRD‐STBCs have been shown to be potential candidate for higher transmit antenna systems as the decoding complexity of Gabidulin's algorithm is far less, and its performance for decoding MRD‐STBCs is somewhat reasonable. Copyright © 2015 John Wiley & Sons, Ltd.     

Adaptive Generator Sequence Selection in Multilevel Space–Time Trellis Codes

It has been shown that multilevel space–time trellis codes (MLSTTCs) designed by combining multilevel coding (MLC) with space–time trellis codes (STTCs) can provide improvement in diversity gain and coding gain of the STTCs. MLSTTCs assume perfect channel state information (CSI) at receiver and no knowledge of CSI at transmitter. Weighted multilevel space–time trellis codes (WMLSTTCs), designed by combining MLSTTCs and perfect CSI at transmitter are capable of providing improvement in coding gain of MLSTTCs. In this paper, we present improvement in performance of MLSTTCs by using channel feedback information from the receiver for adaptive selection of generator sequences. The selected generator sequences are used for encoding the component STTCs. The receiver compares current channel profile at receiver with a set of predetermined channel profiles, and sends an index of a predefined channel profile closest to the current channel profile to the transmitter. The transmitter selects a code set that matches best with the current channel profile at receiver using the index. The selected code set having different sets of generator sequences is used by STTC encoders to generate dynamic space–time trellis codes (DSTTCs). The DSTTCs act as component codes in multilevel coding for generating new codes henceforth referred to as multilevel dynamic space–time trellis codes (MLDSTTCs). Analysis and simulation results show that MLDSTTCs provide improvement in performance over MLSTTCs.     

Generalized OSTBC‐based subcarrier intensity‐modulated MIMO optical wireless communication system

In this paper, we analyze an optical wireless communication (OWC) system having a source and a destination node, equipped with multiple transmit and receive apertures, respectively. We utilize generalized orthogonal space‐time block codes (OSTBCs) of any arbitrary order and subcarrier intensity modulation scheme for data transmission over gamma–gamma (GG) fading optical links using M ‐ary phase‐shift keying (PSK) constellation. A symbol‐wise decoding is utilized, and the closed‐form expression of the approximate average symbol error rate (SER) of multi‐aperture‐based OWC system is obtained for the generalized OSTBC and an arbitrary M ‐PSK constellation. Using the derived SER expression, we analytically evaluate the diversity order and the coding gain of the OWC system with GG atmospheric turbulence. It has been shown by the numerical results that the maximum possible diversity is achieved by using the symbol‐wise maximum likelihood decoding in the destination. Copyright © 2016 John Wiley & Sons, Ltd.     

Low complexity concatenated coding schemes for digital satellite communications

A study of reduced complexity concatenated coding schemes, for commercial digital satellite systems with low-cost earth terminals, is reported. The study explored trade-offs between coding gain, overall rate and decoder complexity, and compared concatenated schemes with single codes. It concentrated on short block and constraint length inner codes, with soft decision decoding, concatenated with a range of Reed-Solomon outer codes. The dimension of the inner code was matched to the outer code symbol size, and appropriate interleaving between the inner and outer codes was used. Very useful coding gains were achieved with relatively high-rate, low-complexity schemes. For example, concatenating the soft decision decoded (9,8) single parity check inner code with the CCSDS recommended standard Reed-Solomon outer code gives a coding gain of 4.8dB at a bit error probability of 10^?5, with an overall rate of 0-78.     

Generalized Partial Feedback Based Orthogonal Space-Time Block Coding

Recently, a full rate orthogonal space-time block code achieving full diversity while preserving low decoding complexity with very limited feedback was proposed. Based on a feedback of only p?1 bits, these codes exhibit a higher coding gain as well. In this work, we propose a low complexity, though close to optimal, feedback selection scheme. Furthermore, we analyze the performance of these codes with arbitrary number of transmit and receive antennas. We show that with this feedback based codes full diversity of n_T n_Rp is obtained. Finally, we provide closed form expressions for the ergodic and outage mutual information as well as error rates.     

A novel grouped multilevel dynamic space–time trellis coding scheme

Grouped multilevel space–time trellis codes (GMLSTTCs) utilize multilevel coding, antenna grouping and STTCs for simultaneously providing coding gain, diversity improvement and increased spectral efficiency. The performance of GMLSTTCs is limited because of using predefined STTCs as component codes in multilevel coding. GMLSTTCs assume perfect channel state information (CSI) at the receiver only and do not consider the CSI at the transmitter. It has been shown that when perfect or partial CSI is available at the transmitter, the performance and capacity of a space–time coded system can be further improved. In this paper, we present new codes, designed by combining GMLSTTCs and the CSI information at the transmitter, henceforth referred to as grouped multilevel dynamic space–time trellis codes (GMLDSTTCs). A code set having different sets of generator sequences is selected that matches best with the current channel profile. The selected code set is used for generating DSTTCs. DSTTCs are used as component codes in GMLSTTCs instead of predefined STTCs to generate GMLDSTTCs. Analysis and simulation results show that GMLDSTTCs outperform GMLSTTCs. Copyright © 2014 John Wiley & Sons, Ltd.     

瑞利衰落信道下基于LDPC码USTM的MIMO系统

研究了一种联合低密度校验(LDPC,Low-Density Parity-Check)码和酉空时调制(USTM,Unitary Space-Time Modulation)技术在不相关瑞利平坦衰落(Rayleigh flat fading)下的多输入多输出信道(MIMO,Multiple-Input Multiple-Output)系统的性能.在无信道状态信息下,采用可并行操作的和积译码算法(SPA,Sum-Product Algorithm)的LDPCC-USTM级联系统具有优异的性能,并分析了不同LDPC码集下对系统性能的影响.仿真结果表明LDPCC-USTM级联系统比与未级联的相比有近23dB的编码增益,与基于Turbo码的USTM[6]系统相比有5dB多的编码增益,且基于非规则的LDPC码的级联系统比基于规则码有近1dB的编码增益.     

一种未知信道下的发射分集差分检测新方法

本文提出一种收发端均不知道信道状态信息情况下发射分集差分检测新方法。该方法将发射天线分组,对每组进行独立的差分空时分组编码以降低编码复杂度,并对每组天线信号进行正交扩频,以便接收端分离各组天线信号实现解码。这种方法不仅编译码简单、编码速率高,而且仍然保持了差分空时分组码的发射端和接收端不需要知道状态信息的优点,同时由于引入了正交的扩频码,系统可获得扩频增益。     

空时编码OFDM与多维波束形成组合方案

针对MIMO-OFDM系统提出了一种简单灵活的空时分组码与多维特征波束形成组合方案,以充分利用MIMO信道的二阶统计信息。该方案在保证空时编码分集度的同时能最大化系统的编码增益,空时分组码的选取并不受实际发射天线数的限制,因此可以在分集度、编码增益以及系统码率之间进行灵活的折中。理论分析和仿真结果同时表明,当实际发射天线数大于空时码所需天线数时,系统的编码增益随着实际发射天线数的增加大致呈线性增长,发射天线阵列间相关性越强,增长速度越快。     

Super-quasi-orthogonal space-time trellis codes for four transmit antennas

We introduce a new family of space-time trellis codes that extends the powerful characteristics of super-orthogonal space-time trellis codes to four transmit antennas. We consider a family of quasi-orthogonal space-time block codes as building blocks in our new trellis codes. These codes combine set partitioning and a super set of quasi-orthogonal space-time block codes in a systematic way to provide full diversity and improved coding gain. The result is a powerful code that provides full rate, full diversity, and high coding gain. It is also possible to maintain a tradeoff between coding gain and rate. Simulation results demonstrate the good performance of our new super-quasi-orthogonal space-time trellis codes.     

Accumulate-Repeat-Accumulate Codes

In this paper, we propose an innovative channel coding scheme called accumulate-repeat-accumulate (ARA) codes. This class of codes can be viewed as serial turbo-like codes or as a subclass of low-density parity check (LDPC) codes, and they have a projected graph or protograph representation; this allows for high-speed iterative decoding implementation using belief propagation. An ARA code can be viewed as precoded repeat accumulate (RA) code with puncturing or as precoded irregular repeat accumulate (IRA) code, where simply an accumulator is chosen as the precoder. The amount of performance improvement due to the precoder will be called precoding gain. Using density evolution on their associated protographs, we find some rate-1/2 ARA codes, with a maximum variable node degree of 5 for which a minimum bit SNR as low as 0.08 dB from channel capacity threshold is achieved as the block size goes to infinity. Such a low threshold cannot be achieved by RA, IRA, or unstructured irregular LDPC codes with the same constraint on the maximum variable node degree. Furthermore, by puncturing the inner accumulator, we can construct families of higher rate ARA codes with thresholds that stay close to their respective channel capacity thresholds uniformly. Iterative decoding simulation results are provided and compared with turbo codes. In addition to iterative decoding analysis, we analyzed the performance of ARA codes with maximum-likelihood (ML) decoding. By obtaining the weight distribution of these codes and through existing tightest bounds we have shown that the ML SNR threshold of ARA codes also approaches very closely to that of random codes. These codes have better interleaving gain than turbo codes