一种性能更优的差分酉空时码正交旋转信号星座

由于差分酉空时码信号星座点之间的分集乘积是影响系统的重要因素.本文利用代数理论构造出一种正交旋转的差分酉空时码的信号星座集,使得原循环群星座成为新正交旋转星座的一个搜索子集,以扩大信号星座点之间的分集乘积,其误码率性能将比原循环群星座差分酉空时码有2dB多的增益.     

基于空时Turbo网格码的MIMO-OFDM系统

提出了使用空时Turbo网格编码的MIMO-OFDM系统,分析了系统的性能,给出了衰落信道中的性能上界以及编码和分集增益表达式。通过仿真评估了空时Turbo网格码在慢衰落信道中的性能,与传统的STTC方法相比,该系统可以获得更好的分集增益和编码增益。     

一种新的网格空时码

本文分析了空时码在平坦准静态衰落信道下的性能,指出分集增益和编码增益并不能准确衡量空时码的性能,提出一种设计网格空时码的新思路,即通过牺牲部分分集增益来降低调制阶数以提高系统性能.依据这一思想,本文给出一种传输速率为3bits/s/Hz,4-PSK调制,8状态的新的非满秩网格空时码.仿真结果表明,这种码虽然没有获得最大分集增益,但相比同速率的满秩网格空时码性能更好,实现更简单.     

级联 Turbo-空时格码 OFDM 系统的性能分析

在研究传统的空时编码 OFDM 系统模型及误码率性能的基础上,提出了 Turbo 码级联空时格码的 OFDM 系统方案；并给出了该系统在无线瑞利衰落信道中的性能上界和误码率仿真结果,仿真结果表明：该系统能最大限度地利用所有的分集资源,获得相当大的分集增益和编码增益。     

在频率选择性信道中的差分空频编码

本文提出了频率选择性衰变信道中采用了差分空频编码的正交频分复用(OFDM)传输方法。根据信道长度,我们将每个天线OFDM帧中的输入数据分组,同一组中各天线上的数据编码组成为一个对角信号星座,沿频域方向独立的对每组信号实施差分编码。通过分析成对错误概率,我们证明了这种码潜在能提供的分集是发射天线数,接收天线数和信道长度的乘积,比差分空时码具有更大分集增益,因而具有更好的性能,这一分析结果也为我们的仿真实验证实了。     

一种简单的空时频编解码方法

本文给出了一种传输速率为1/2的简单的空时频码(STFC)的编解码方法.该方法通过简单地在天线(空间)、子载波(频率)和时间三个维数上同时进行编码,能获得完全的空间和频率分集度.且由于该编码结构的特殊性,可以简化矩阵求逆的运算复杂度.并且在对信号判决之前,通过对信号进行有效的噪声平滑处理,能降低系统的误码率.仿真结果表明,该码的性能要好于传统的通过重复映射构造的空时频码.     

空时格码和OFDM系统联合建模及性能分析

发射端分集、编码和调制结合空时格码，可以有效地提高信号在无线衰落信道中传输的有效性和可靠性；在正交频分复用调制OFDM(Omiogonal Frequency Division Multiplexing)系统中应用空时格码可以有效地对抗多径干扰，提高系统容量，适合于在高速无线数据通信中采用。本文详细地说明了它们结合的基础，进而构造了一个基于空时格码的OFDM系统模型，并分析了在高斯信道下的系统性能。     

一种具有快速译码结构和优化编码增益的全分集空频码

本文通过将一个对角空时码乘以一个压缩映射矩阵(Compact Mapping Matrix,CMM)从而得到一个空频码字,在获得空时码原有空间分集性能的基础上可以获得指定阶数的频率分集,从而提高了频率选择性信道下相干空频编码MIMO-OFDM的性能,该文还对码字的编码增益进行了优化,进一步提高了系统性能.同时,利用对角星座的快速译码研究的新成果,该方法设计的码字其译码过程得到了大大的简化,有利于系统的硬件实现.     

一种基于线性星座预编码和坐标交织的空时频发射方案

为获得存在多径衰落的MIMO-OFDM系统中高速率传输方案，给出了一种基于线形星座预编码和坐标交织的速率为1的简单空时频分组码．该传输方案通过线性星座预编码来获得频率分集增益，通过坐标交织变换来获得传输速率为1，且能适当改善系统的误码性能．仿真结果表明，与传统的结合空时码的OFDM系统相比，该方案能获得更大的分集增益、更高的频谱效率和更好的误码性能．在误码率为10^-2的未加信道编码的条件，本文方案与传统方案相比，至少能够提供约4dB的性能增益．若在接收端采用MMSE等线性接收方案，本文方案的计算复杂度并没有明显的增加。     

一种降低码构造复杂度的QSTBC设计

本文采用分圆格方法,设计了一种简化型具全分集、满速率特性的四发四收准正交空时分组码。该准正交空时分组码不仅比传统的基于星座调制技术的四发四收准正交空时码具有更大的分集增益上界,而且比已有的八发一收分圆准正交空时码在误码率和信道容量、以及中断概率等方面皆具有显著的优越性。     

Interlevel‐correlated orthogonal space–time block codes based on the expanded signal constellation

Orthogonal space–time block codes provide full diversity with a very simple decoding scheme. However, they do not provide much coding gain. For a given space–time block code, we combine several component codes in conjunction with set partitioning of the expanded signal constellation according to the coding gain distance (CGD) criterion. By providing proper interlevel coding between adjacent blocks, we can design an orthogonal space–time block code with high rate, large coding gain, and low decoding complexity. The error performance of an example code is compared with some codes in computer simulation. These codes are compared based on the situation of the same transmission rate, space diversity order, and state complexity of decoding trellis. Copyright © 2010 John Wiley & Sons, Ltd.     

Diversity Combining and SNR Estimation for Turbo-Coded Frequency-Hopped Spread-Spectrum in Partial-Band Interference and Fading Channels

We compare different combinations of the repetition diversity order L and code rate R for turbo-coded Frequency-Hopped Spread-Spectrum (FH/SS) communication systems in the presence of fading and partial-band Gaussian interference. For a fixed overall channel code rate R/L we show that using the lowest code rate and no repetition diversity always performs better than using a higher code rate and some repetition for both coherent and non-coherent schemes. We then propose a simple maximum-likelihood-based method for signal-to-noise-ratio (SNR) estimation in Non-Coherent Binary Frequency Shift Keying (NCBFSK) without training symbols. Except for impractically small hop sizes of 8 bits or less we obtain performance virtually equal to that of perfect SNR knowledge but with much less complexity than iterative schemes previously proposed. For the case of Coherent Binary Phase Shift Keying (CBPSK) we derive the Expectation Maximization (EM) estimate of the SNR without training symbols and iteratively feed the estimator with the extrinsic information from the turbo decoder. The performance for CBPSK is near that of perfect SNR knowledge for hop sizes of 64 bits or more. Unlike previously proposed methods for CBPSK the EM estimate of SNR does not require knowledge of the noise and interference variance, received bit energy, or the fading channel model.

Nonlinear hierarchical space-time block codes: construction and regular MTCM design

The performance criteria of multiple-input multiple-output (MIMO) fading channels, diversity gain and coding gain, demand quite different coding techniques than those for Gaussian channels. This paper proposes a new approach to space-time block code (STBC) construction for coherent systems different from algebraic constructions (unitary, orthogonal) by explicitly manipulating the relationship between codewords rather than properties of the individual codeword. Algebraic constructions may incur performance losses of several decibels, relative to code sets determined by exhaustive search. By characterizing the structure of exhaustively searched code sets, a set of isometries between code words is determined. These isometries, in turn, suggest a greedy code construction method: nonlinear hierarchical codes (NHCs). NHCs of arbitrary block sizes/constellations can be constructed bottom-up by optimizing the coding gain layer-by-layer and reusing the optimized structure. The strong symmetry and layered structure make NHCs ideal constituent codes for regular multiple trellis-coded modulation (RMTCM). New RMTCM design procedures are proposed for various rates/block sizes/constellation sizes. The match between the distance spectrum of NHCs to the regular trellis structure optimizes coding gain directly, and full diversity is naturally maintained given the full rank of the constituent NHCs. Several factors which affect performance are analyzed and exploited to improve the overall performance. Set expansion is used to improve high-rate MTCM designs. In each design, the performance/rate/complexity tradeoffs are gracefully balanced and optimized. With limited growth in complexity, the proposed designs can achieve more than 2 dB gain over current MTCM designs.     

A construction of a space-time code based on number theory

We construct a full data rate space-time (ST) block code over M=2 transmit antennas and T=2 symbol periods, and we prove that it achieves a transmit diversity of 2 over all constellations carved from Z[i]⁴ . Further, we optimize the coding gain of the proposed code and then compare it to the Alamouti code. It is shown that the new code outperforms the Alamouti (see IEEE J Select. Areas Commun., vol.16, p.1451-58, 1998) code at low and high signal-to-noise ratio (SNR) when the number of receive antennas N>1. The performance improvement is further enhanced when N or the size of the constellation increases. We relate the problem of ST diversity gain to algebraic number theory, and the coding gain optimization to the theory of simultaneous Diophantine approximation in the geometry of numbers. We find that the coding gain optimization is equivalent to finding irrational numbers "the furthest," from any simultaneous rational approximations     

Distributed Space-Time Codes Using Constellation Rotation

Rate and diversity impose a fundamental tradeoff in wireless communication. We propose a novel distributed space-time coding (DSTC) scheme based on constellation rotation (DSTC-CR) for Amplify-and-Forward relay networks. The proposed code can achieve full-diversity or full-rate, and also offers a flexibility for a desired rate-diversity tradeoff. This code can work well with arbitrary signal constellation and any number of relays and achieve minimal-delay. Through analysis of pairwise error probability, coding design criteria, Chernoff bound, decoding strategies and optimal power allocation are provided. Simulation results show that DSTC-CR scheme outperforms diagonal DSTC (DDSTC) and distributed linear dispersion (DLD) code at high power. From the comparison with DDSTC, the DSTC-CR scheme can achieve the same information rate using a lower modulation order.     

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.     

多天线对角空频编码传输

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

Achieving Full Frequency and Space Diversity in Wireless Systems via BICM, OFDM, STBC, and Viterbi Decoding

Orthogonal frequency-division multiplexing (OFDM) is known as an efficient technique to combat frequency-selective channels. In this paper, we show that the combination of bit-interleaved coded modulation (BICM) and OFDM achieves the full frequency diversity offered by a frequency-selective channel with any kind of power delay profile (PDP), conditioned on the minimum Hamming distance dfree of the convolutional code. This system has a simple Viterbi decoder with a modified metric. We then show that by combining such a system with space-time block coding (STBC), one can achieve the full space and frequency diversity of a frequency-selective channel with N transmit and M receive antennas. BICM-STBC-OFDM achieves the maximum diversity order of NML over L-tap frequency-selective channels regardless of the PDP of the channel. This latter system also has a simple Viterbi decoder with a properly modified metric. We verify our analytical results via simulations, including channels employed in the IEEE 802.11 standards     

Some analytical tools for the design of space-time convolutional codes

Space-time convolutional codes have shown considerable promise for providing improved performance for wireless communication through combined diversity and coding gain. An efficient design procedure is presented for optimizing the coding and diversity gain measures proposed in the first papers on space-time codes. The procedure is based on some simple lower and upper bounds on coding gain. The same calculations needed to compute these bounds can be used to check either necessary or sufficient conditions on space-time codes which achieve maximum diversity gain. A new simple, but useful, measure of code performance is also suggested which augments existing measures. The use of the design procedure is illustrated and new codes are provided. These codes are shown to outperform the space-time convolutional codes provided in the initial papers introducing space-time codes.     

Obtaining full-diversity space-frequency codes from space-time codes via mapping

This paper considers the problem of space-frequency code design for frequency-selective multiple-input-multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) modulation. We show that space-time codes achieving full diversity in quasistatic flat fading environment can be used to construct space-frequency codes that can achieve the maximum diversity available in frequency-selective MIMO fading channels. Since the codes are constructed via a simple mapping from space-time codes to space-frequency codes, the abundant classes of existing space-time block and trellis codes can be used for full diversity transmission in MIMO-OFDM systems. The proposed mapping provides a tradeoff between the achieved diversity order and the symbol rate. Moreover, we characterize the performance of the space-frequency codes obtained via the mapping by finding lower and upper bounds on their coding advantages as functions of the coding advantages of the underlying space-time codes. This result will allow us to investigate the effects of the delay distribution and the power distribution of the channel impulse responses on the performance of the resulting space-frequency codes. Extensive simulation results are also presented to illustrate and support the theory.