旋转星座下匙孔信道的四元素准正交空时分组码研究

提出了一种基于匙孔信道的旋转四元素准正交空时分组码(QQOSTBC-CR,Constellation Rotation Quaternion Quasi-Orthogonal Space Time Block Code),该码可以通过极化天线进行发射和接收,设计出发射天线数为8的QOSTPBC-CR,并对N＝8的情况进行成对译码,最后与匙孔信道下传统旋转准正交空时分组码(QOSTBC CR,Constellation Rotation Quasi Orthogonal Space Time Block Code)、准正交空时分组码(QOSTBC,Quasi Orthogonal Space Time Block Code)以及瑞利信道下QQOSTBC-CR进行了仿真比较.结果表明:对4个发射天线的情况,当BER＝10(-3)时,BPSK和QPSK调制下本文所提QQOSTBC-CR分别比QOSTBC-CR有4.5dB和7dB的增益,分别比瑞利信道下QQOSTBC-CR有-4dB和-3dB的增益.     

适于匙孔信道的准正交极化空时分组码及性能分析

构建了一种适于匙孔信道的满码率极化准正交空时分组码以改善其误比特率性能,采用快速最大似然译码算法进行译码,并与匙孔信道的传统准正交空时分组码、单中继瑞利信道和单中继匙孔信道的极化准正交空时分组码分别进行误比特率的仿真和比较.结果表明:在相同SNR条件下,本文构建的分组码比传统准正交分组码具有更低的误比特率;与两种单中继极化准正交空时分组码相比,在SNR较高情况下本文分组码具有更好的性能.     

一种面向长期演进的空时分组传输方案

移动基站MS（Mobile Station）在LTE-A（Long Term Evolution-Advanced长期演进）协议中要求上行链路的数据要在双天线和三个时隙中传输,这就使得针对LTE的空时分组码有了一个新的应用点.本文在传统的STBC（Space-Time Block Coding空时分组码）的基础上,通过改进,提出一种新的传输方案,使得数据实现在三个时隙使用双发射天线的传输.该方案特点：（1）它可以实现传输的全速率和全分集;（2）它的最大似然译码（Maximum Likelihood,ML）需要联合三个实信号;（3）它的最小行列式值并没有通过信号星座图的改变而变化;（4）它与单天线传输的模式相兼容.仿真结果显示提出的方案比传统的准正交空时分组码QSTBC方案和Alamouti方案在相同信噪比（SNR）的情况下有着更好的误比特率（BER）.     

准正交编码最大似然检测优化算法

准正交空时编码(QOSTC)可以提高多天线系统的信道容量,但其最大似然(ML)检测算法复杂。在分析了QOSTC的ML检测算法的基础上,提出了一种ML检测优化算法,与ML相比,该优化算法在大幅度降低检测所需的运算量的同时,保持了与ML相同的检测性能,从而解决了QOSTC相对于正交空时编码(OSTC)而言,采用ML检测时复杂度较高的缺点。数值分析与仿真结果验证了上述结论。     

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

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

旋转星座下极化准正交空时分组码及性能分析

设计了发射天线数分别为8和6、码率为3/4的极化准正交空时分组码,对星座图进行最佳角度旋转,接收机采用成对译码算法,并对未旋转-极化、旋转-极化、未旋转-传统、旋转-传统这4种准正交空时分组码进行了仿真比较.结果表明,在相同条件下,当采用双极化天线时,星座图旋转对系统误码率性能改善不明显;当采用单极化天线时,旋转对系统误码率性能改善明显.     

一类三元线性分组码的译码

Ｐｌｅｓｓ［１］证明了三元（１２，６，６）Ｇｏｌａｙ码具有一种双层结构，并据此给出了该码的快速硬判决译码算法。本文推广了Ｇｏｌａｙ码的Ｐｌｅｓｓ结构，给出了由三元（ｎ，ｋ，ｄ）线性分组码构造的三元（３，ｎ＋ｋ，≥ｍｉｎ（ｎ，２ｄ，６））线性分组码，其中包括（１２，６，６）Ｇｏｌａｙ码和（１８，９，６）码，并以三元（１８，９，６）码为例给出了这类码的最大似然软判决译码算法。     

两类新的线性分组码的译码

本文推广了Ｐｌｅｓｓ由四元线性分组码构造Ｇｏｌａｙ码和由三元（４，２，３）线性分组码构造三元（１２，６，６）Ｇｏｌａｙ码的投影方法，给出了由四元（ｎ，ｋ，ｄ）线性分组码构造的二元（４ｎ，ｎ＋２ｋ，≥ｍｉｎ（８，ｎ，２ｄ）线性分组码和由三元（ｎ，ｋ，ｄ）线性分组码构造的三元（３ｎ，ｎ＋ｋ，≥ｍｉｎ（ｎ，２ｄ，６）线性分组码，并根据所得码的结构给出了有效的最大似然译码算法。     

基于子空间的空时分组码的解码

空时码解码算法往往假设信道状态信息(CSI)已经事先估计出,信道估计需要额外的运算量,而且信道估计误差使解码性能降低.本文提出一种基于子空间方法的空时分组码直接解码算法,利用空时分组码的结构,结合子空间算法,可以不需要信道信息,直接得到码符信息的闭式解.仿真实验结果表明,随着噪声子空间求解准确度的提高,直接解码算法性能逐渐接近使用确切信道信息的相关解码器.     

极化码序列连续删除译码算法的改进设计

极化码连续删除译码算法性能和传统的LDPC码存在一定差距。序列连续删除算法(SCL)的提出极大地改善译码性能,是极化码推向实际应用中的重要一步。但是该算法复杂度较高,延迟大。改进的序列连续删除(SCL)译码算法是基于改善极化码码长受限的情况,文中描述SCL算法是通过码树上的搜索序列路径来表示译码过程。改进的算法通过减少译码算法在码树上的序列路径来降低时间和空间复杂度。通过仿真表明,改进的算法有效地降低了译码的复杂度同时在性能上也接近最大似然(ML)译码算法。     

基于逐幸存路径处理的空时格形码自适应解码器

本文探讨了无线移动信道中空时格形码的一种自适应解码技术.通过分析无周期间插正交导引信号下空时格形码的最大似然序列检测,指出可利用逐幸存路径处理得到该情形下可实用的最大似然序列检测算法;以此为依据,结合利用自调整LMS算法实现的信道跟踪,本文提出一种空时格形码的自适应解码器,该解码器具有所采用信道跟踪参数与信道衰落速度无关的优点;文章最后给出计算机仿真结果.     

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

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

Combined simplified maximum likelihood and sphere decoding algorithm for MIMO system

In this article, a new system model for sphere decoding （SD） algorithm is introduced. For the 2 × 2 multipleinput multiple-out （MIMO） system, a simplified maximum likelihood （SML） decoding algorithm is proposed based on the new model. The SML algorithm achieves optimal maximum likelihood （ML） performance, and drastically reduces the complexity as compared to the conventional SD algorithm. The improved algorithm is presented by combining the sphere decoding algorithm based on Schnorr-Euchner strategy （SE-SD） with the SML algorithm when the number of transmit antennas exceeds 2. Compared to conventional SD, the proposed algorithm has low complexity especially at low signal to noise ratio （SNR）. It is shown by simulation that the proposed algorithm has performance very close to conventional SD.     

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

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

Mode‐SVD‐Based Maximum Likelihood Source Localization Using Subspace Approach

A mode‐singular‐value‐decomposition (SVD) maximum likelihood (ML) estimation procedure is proposed for the source localization problem under an additive measurement error model. In a practical situation, the noise variance is usually unknown. In this paper, we propose an algorithm that does not require the noise covariance matrix as a priori knowledge. In the proposed method, the weight is derived by the inverse of the noise magnitude square in the ML criterion. The performance of the proposed method outperforms that of the existing methods and approximates the Taylor‐series ML and Cramér‐Rao lower bound.     

Improved Performance of Maximum Likelihood Decoding Algorithm with Efficient Use of Algebraic Decoder

A new soft decision maximum-likelihood decoding algorithm, which generates the minimum set of candidate codewords by efficiently applying the algebraic decoder is proposed. As a result, the decoding complexity is reduced without degradation of performance. The new algorithm is tested and verified by simulation results.Panagiotis G. Babalis was born in Athens, Greece, on January 3, 1974. He received his Diploma of electrical and computer engineering and the Ph.D. degree, both from National Technical University of Athens (NTUA), Athens, Greece, in 1996 and 2001, respectively. His main research interests include mobile satellite communications, modulation, and wireless communications systems coding. Dr. Babalis is a member of the technical Chamber of Greece.Panagiotis T. Trakadas was born in Athens, Greece, on January 14, 1972. He received his Diploma of Electrical and Computer Engineering and the Ph.D. degree from National Technical University of Athens (NTUA), Athens, Greece, in 1996, and 2001, respectively. From 1998 to 2001, he participated in many European projects as a researcher. His main research interests include mobile communications systems and electromagnetic compatibility topics. Dr. Trakadas is a member of the Technical Chamber of Greece and IEEE Society.Theodore B. Zahariadis received his Ph.D. degree in electrical and computer engineering from the National Technical University of Athens, Greece, and his Dipl.-Ing. Degree in computer engineering and information science from the University of Patras, Greece. Currently, he is the technical director of Ellemedia Technologies, where he leads R&D of end-to-end interactive multimedia services, embedded systems, and 3G/4G core network services. Since 1994 he has participated in many European co-funded projects. His research interests are in the fields of broadband wireline/wireless/mobile communications, interactive service deployment, management of IP/WDM networks, and embedded systems. He has published more than 30 papers. He has been a reviewer and principal guest editor in many journals and magazines. He is a member of the ACM and the Technical Chamber of Greece.Christos N. Capsalis was born in Greece, in 1956. He received the diploma in electrical and mechanical engineering from the National Technical University of Athens (NTUA), Athens, Greece, in 1979, the B.Sc. degree in economics from the University of Athens, Athens, Greece, in 1983, and the Ph.D. degree in electrical engineering from NTUA in 1985. He is currently a Professor at NTUA and Director of the wireless communications laboratory. His current research activities include wireless and satellite communications systems and EMC topics.     

基于空时编码的波束形成接收端改进模式

文章提出了一种基于准正交空时编码的波束形成系统的接收端改进模式,对接收端信号进行选择性接收,从而提高了系统性能。在文章提出的接收模式中,接收端把接收信号分成两组进行接收,通过这种方式可以减少来自邻近信号的干扰。仿真结果表明在完美信道估计下提出的方法能够很好改善系统性能。     

MIMO系统中球形译码算法的应用

MIMO系统在带来巨大容量的同时,也产生了极大的接收信号检测复杂度。球形译码算法是较好解决这一问题的有效途径之一,通过减少比较信号点的个数达到降低计算量的要求。根据MIMO系统的信号模型特点,结合相关研究的新进展,对球形译码原理和算法进行了探讨。理论分析表明,该方法可以用较少的计算量来获得最大似然检测性能,有较高的应用价值。     

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

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

基于译码前传协作中继网络的类准正交线性分散码

提出了一种基于译码前传协作中继网络的类准正交线性分散码,该码的码字矩阵实部和虚部可以分解成满足准正交设计的实码字矩阵;对接收端的译码考虑了2种方式,一种是对总的接收信号进行快速最大似然译码,另一种是对经过中继和未经过中继的接收信号分别进行快速最大似然译码;分析了2种方式的计算复杂度,对2种方式的信道容量、中断概率和误比特率等特性进行了仿真对比,结果表明,在相同条件下,方式2比方式1信道容量更高,中断概率和误比特率更低,但计算复杂度更高.