一种基于混合星座编码的全速率全分集准正交空时分组码

准正交空时分组码对发射天线数大于2的复信号能够实现全速率的发射,它在低信噪比的情况下有比较好的性能,但是由于准正交空时分组码不是全发射分集的,因而在高信噪比时性能并不优越。为了改善准正交空时分组码在高信噪比时的性能,本文采用对准正交空时分组码进行混合星座编码的形式来提高准正交空时分组码的分集度。仿真及计算结果显示,采用混合星座编码能在少量频带利用率损失的情况下大幅提高准正交空时分组码的性能。     

一种新的准正交空时分组码的设计

根据正交设计理论,当发送天线数大于2时,不存在可以获得完全分集增益和全速率的复正交空时分组码.对空时分组码采用准正交设计,能够保证数据以全速率传输,但是会使其误码性能降低.文章在对准正交空时分组码(QOSTBC)结构研究的基础上,提出了一种全速率的四发射天线准正交空时分组码,并给出了基于最大似然译码方法.仿真结果表明,文章方案与已有典型的Jafarkhani准正交空时分组码相比,在高信噪比时有更好的误码性能.     

一种改进的准正交空时分组码设计方案

基于MIMO天线系统的空时编码技术是改善无线通信性能、提高带限系统数据速率的一种理想选择。但是由于正交空时分组码不能保证数据全速率传输,为此提出一种改进的准正交空时分组码设计方案。该编码方法利用准正交准则,能够保证数据以全速率传输。并在此基础上具体讨论和分析了编码的编、译码算法和误码性能。该编码方法既不降低分集增益也不增加译码复杂度,并且可以获得一定的编码增益。仿真结果表明,这种方法的误比特率无论在低信噪比还是在高信噪比条件下都要优于已有的准正交空时分组码——Jafarkhani码。     

全速率满分集准正交空时分组码的设计

在未来的第四代移动通信中,基于多输入多输出（MIMO）天线系统的空时编码技术是改善无线通信性能,提高带限系统数据传输速率的一种理想选择,但由于正交空时分组编码不能保证满分集和数据全速率传输,提出了一种利用星座图旋转可获得全速率满分集传输的旋转准正交空时分组码的设计方法。仿真结果表明,这种方法在不增加译码复杂度的情况下,其误比特率无论在低信噪比还是在高信噪比条件下都要优于已有的准正交空时分组码。     

一种新的准正交空时分组码的设计

ABBA码是一种可用于3个以上发射天线系统的准正交空时分组码,该方案虽然可以实现全速率传输,但是其译码复杂度高。针对上述缺点提出了一种基于星座旋转的能够实现满分集增益、全速率传输的准正交空时分组码,给出了接收端最大似然译码的独立译码方案,简化了译码过程,降低了译码复杂度,仿真结果表明其误码性能与ABBA码相比得到了较大的改善。     

一种提高空时分组码低信噪比性能的方法

通过对空时分组码（Space-Time Block Code，STBC）在低信噪比时的成对差错概率（Pairwise Error Probability，PEP）的分析，提出了一种针对全分集准正交空时分组码（Quasi-Orthogonal Space-Time Block Code，QOSTBC）低信噪比性能的改进方法。该方法是利用分组码的码字差别矩阵的最大特征值所对应的特征向量，来提高空时分组码的性能。本文用严格的数学推导证明了该方法，并通过了仿真验证。     

闭环扩展正交空时分组码的设计研究

基于复正交设计的空时编码在发射天线数大于2时不能同时达到满速率全分集,针对这个问题,利用正交空时分组码系统的等效信道矩阵的正交性及系统信道信息的反馈,提出了两种针对闭环扩展正交空时分组码的改进设计方案.系统在接收端以最大等效信道增益为目标进行设计,分别结合天线选择技术和功率自适应分配技术进行信道信息的反馈,并对其性能进行理论分析与比较,仿真结果显示,两种改进方案均能减小系统的误码率,提高系统的信噪比增益,和结合天线选择技术的方案相比,与功率自适应分配相结合的设计方案性能更为优越.     

四发送天线无线通信系统的空时分组编码

介绍了用于四发送天线无线通信系统的完全正交的空时分组码、准正交的空时分组码及利用星座旋转的空时分组码的编译码方案；给出了它们的性能仿真结果，并进行了分析比较；得出了在同等条件下，能同时获得全分集和全速率的空时分组码的性能更优的结论。     

四天线准正交空时分组码的设计和性能分析

本文提出了一种新的四天线准正交空时分组码的通用设计方法.与Jafarkhani提出的设计方法相比,本方法大大增加了四天线准正交空时分组码的可用码字.在此基础上,对准正交空时分组码进行了性能分析.仿真结果表明,本文提出的准正交空时分组码与Jafarkhani提出的准正交空时分组码具有相似的误码率,并且有些码字的误码率优于Jafarkhani提出的码字的误码率.     

基于准正交空时码的最优线性预编码矩阵设计

为了充分利用信道信息改善应用准正交空时分组码的MIMO系统的性能,该文提出了将预编码矩阵和准正交空时分组码相结合的发射机制。信息在经过准正交空时分组码编码后,要经过线性预编码矩阵进行处理,才可以从发射天线发送。文中的预编码矩阵设计利用了MIMO信道的非零均值矩阵和相关矩阵,并采用成对差错概率作为其最优设计准则。仿真结果表明,相对于未经过预编码矩阵的系统,新系统的误码率性能有明显改善。     

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     

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.     

A Kind of Quasi-Orthogonal Space-Time Block Code and its Decoding Methods

It is well known that it is impossible for complex orthogonal space-time block codes with full diversity and full rate to have more than two transmit antennas while non-orthogonal designs will lose the simplicity of maximum likelihood decoding at receivers. In this paper, we propose a new quasi-orthogonal space-time block code. The code is quasi-orthogonal and can reduce the decoding complexity significantly by employing zero-forced and minimum mean squared error criteria. This paper also presents simulation results of two examples with three and four transmit antennas respectively.     

A Kind of Quasi-Orthogonal Space-Time Block Codes and its Decoding Methods

1IntroductionSpace-Ti me Coding(STC)technology has been stud-ied extensively in recent years as a method to combatdetri mental effects in wireless fading channel and in-crease the transmission capacity in an open-loop way.Therein,a special class of space-…     

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.     

A quasi-orthogonal space-time block code

It has been shown that a complex orthogonal design that provides full diversity and full transmission rate for a space-time block code is not possible for more than two antennas. Previous attempts have been concentrated in generalizing orthogonal designs which provide space-time block codes with full diversity and a high transmission rate. We design rate one codes which are quasi-orthogonal and provide partial diversity. The decoder of the proposed codes works with pairs of transmitted symbols instead of single symbols     

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