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.     

一种用于CDMA下行链路的空时编码盲多用户检测

提出了一种适用于下行链路的盲多用户检测器,在下行链路的接收方只需进行简单解码和盲多用户检测就可以获得同采用多天线接收相同的效果。仿真结果表明当加入空时编码和盲多用户检测后对移动接收方南误码率有提高。     

Multi-user receiver scheme and uplink performance of space–time-coded CDMA system in Rician fading channels

The uplink performance of multi-user space–time-coded code-division multiple access (STC-CDMA) system in Rician fading channel is presented. A simple and effective multi-user receiver scheme is developed for STC-CDMA system. The scheme has linear decoding complexity when compared to the existing scheme with exponential decoding complexity, and thus implements low-complexity decoding. Based on the bit error rate (BER) analysis and moment generation function, theoretical BER expressions are derived for STC-CDMA with orthogonal and quasi-orthogonal spreading code, respectively. It is shown that these expressions have more accuracy. Using these expressions and the approximation of error function, closed-form approximate BER expressions are obtained, which can simplify the calculation of the derived theoretical BER. Simulation results show that the developed low-complexity decoding scheme can achieve almost the same performance as the existing scheme. The theoretical BER are in good agreement with the corresponding simulated values. Moreover, the presented approximate expressions are also close to the simulated values due to the better approximation. Under the same system throughput and concatenation of channel code, the presented full-rate STC-CDMA system has lower BER than the corresponding full-diversity STC-CDMA systems.     

协作通信中一种分布式酉空时码

提出了一种基于三角函数酉星座的分布式酉空时码,主要介绍了编码矩阵结构及其低复杂度的译码算法。根据仿真结果可知:提出的酉空时性能差于正交设计、系统设计和循环酉群码的性能,但从译码复杂度看,所提出的译码算法计算复杂度相比其他3种简单很多,具有很大的优势。并且还证明了同样的码字采用最大似然译码算法与所提出的低复杂度算法性能相近,但是计算复杂度相差较大。总的来说,所提出的编码矩阵结构简单,易于构造,且具有较低的译码复杂度。     

Improved space-time processing for X channel using precoders

The article investigates how to send perfect space-time codes with low feedback amount and symbol-by-symbol decoding for X channel using precoders. It is assumed that two users are introduced with two antennas and two receivers. Each user employs a rate-2 space-time block code and follows certain rule when sending codewords. The multi-user interference is eliminated by pre-coding at the transmitter and linear processing at the receiver. Compared with the existing scheme for the same scene, the proposed scheme greatly reduces feedback amount and improves the transmission efficiency, while keeping the same decoding complexity. Simulations demonstrate the validity of the proposed scheme.     

Multi-user detection scheme for SCMA systems based on iteration removal

A multi-user detection scheme based on iteration removal (RM-MPA) was proposed to solve the problem of high complexity of decoding algorithm for sparse code multiple access (SCMA) systems.Firstly,a simple and novel method to compare the decoding advantages between users was proposed.Then n users in front of them with higher decoding advantages directly decoded and removed after each iteration,the users removed no longer participate in the subsequent iteration,so the complexity of subsequent iterations decreased gradually.Moreover,two iteration removed strategies based on decoding advantages of users and orthogonal user grouped were proposed respectively.Simulation results show that the RM-MPA with removed strategies based on orthogonal user grouped,which can reduce the decoding complexity with well decoding performance,and the decoding delay is also decreased.     

Two Bit-Flipping Decoding Algorithms for Low-Density Parity-Check Codes

In this letter, a low complexity decoding algorithm for binary linear block codes is applied to low-density paritycheck (LDPC) codes and improvements are described, namely an extension to soft-decision decoding and a loop detection mechanism. For soft decoding, only one real-valued addition per code symbol is needed, while the remaining operations are only binary as in the hard decision case. The decoding performance is considerably increased by the loop detection. Simulation results are used to compare the performance with other known decoding strategies for LDPC codes, with the result that the presented algorithms offer excellent performances at smaller complexity.     

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

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

基于线性变换的TCM-LSTBC解码方案

文中针对TCM分层结构空时分组编码系统,提出了一种新的接收解码方案。该方案首先对接收数据进行线性变换,虚拟的将接收天线个数加倍,然后采用奇异值（SVD）组干抑制方法对信号进行分离。由于提出的新解码方案突破了SVD组干扰抑制技术对接收天线个数的限制,因此可降低接收端的复杂性。仿真结果表明本文提出的解码方案的系统误码性能优于传统组干扰抑制法的系统误码性能。     

Fast generalized minimum-distance decoding of algebraic-geometryand Reed-Solomon codes

Generalized minimum-distance (GMD) decoding is a standard soft-decoding method for block codes. We derive an efficient general GMD decoding scheme for linear block codes in the framework of error-correcting pairs. Special attention is paid to Reed-Solomon (RS) codes and one-point algebraic-geometry (AG) codes. For RS codes of length n and minimum Hamming distance d the GMD decoding complexity turns out to be in the order O(nd), where the complexity is counted as the number of multiplications in the field of concern. For AG codes the GMD decoding complexity is highly dependent on the curve in consideration. It is shown that we can find all relevant error-erasure-locating functions with complexity O(o₁nd), where o₁ is the size of the first nongap in the function space associated with the code. A full GMD decoding procedure for a one-point AG code can be performed with complexity O(dn²)     

Product accumulate codes: a class of codes with near-capacity performance and low decoding complexity

We propose a novel class of provably good codes which are a serial concatenation of a single-parity-check (SPC)-based product code, an interleaver, and a rate-1 recursive convolutional code. The proposed codes, termed product accumulate (PA) codes, are linear time encodable and linear time decodable. We show that the product code by itself does not have a positive threshold, but a PA code can provide arbitrarily low bit-error rate (BER) under both maximum-likelihood (ML) decoding and iterative decoding. Two message-passing decoding algorithms are proposed and it is shown that a particular update schedule for these message-passing algorithms is equivalent to conventional turbo decoding of the serial concatenated code, but with significantly lower complexity. Tight upper bounds on the ML performance using Divsalar's (1999) simple bound and thresholds under density evolution (DE) show that these codes are capable of performance within a few tenths of a decibel away from the Shannon limit. Simulation results confirm these claims and show that these codes provide performance similar to turbo codes but with significantly less decoding complexity and with a lower error floor. Hence, we propose PA codes as a class of prospective codes with good performance, low decoding complexity, regular structure, and flexible rate adaptivity for all rates above 1/2.     

Improved QO-STBC for three and four transmit antennas

A new quasi-orthogonal space-time block code (QO-STBC) based on ABBA code with lower decoding complexity and higher bit error statistics (BER) performance was proposed by U.Park recently,which can obtain full transmission rate and full diversity.In this article,the authors proposed an improved U.Park scheme based on rotational ABBA code.For eliminating the interference terms resulting from neighboring signals during signal detection,two different matrixes are used.And independent decoding can be realized when maximum-likelihood decoding at the receiver is used.Simulation results demonstrate that the BER performance is improved dramatically without increasing the decoding complexity compared with U.Park scheme.     

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.     

A novel QO-STBC scheme with linear decoding

A new quasi-orthogonal space-time block code(QO-STBC)scheme,based on eigen value decomposition(EVD),is explored in this paper.The new scheme can significantly reduce the QO-STBC decoding complexity at receiver and achieves better bit-error rate(BER)performance as well.With EVD manipulations,the detection matrix and the channel matrix can be redefined to remove all interference terms which come from other antennas,and therefore the conventional maximum likelihood(ML)decoding method with less complexity can b...     

3G系统中Turbo译码改进及DSP实现

由于Turbo码优异的纠错性能,使其在第三代移动通信系统中倍受重视。为了解决Turbo码存在的译码复杂度大、译码延时长的缺点,在分析已有的Max-Log-Map码译码算法基础上,针对DSP的特点进行改进,提出加入滑动窗和改进的归一化度量算法,在保证译码性能的前提下,大大降低其运算复杂度,并将滑动窗的方法用于译码模块,极大的减少了存储空间。     

一种满速率空时分组编码CDMA系统及多用户接收方案

通过引入满速率空时分组码方案, 该文给出一种满速率空时分组编码CDMA系统模型, 并针对现有空时编码CDMA系统过高的译码复杂度, 提出一种低复杂度的多用户接收方案。该方案在通过类似多用户检测方法有效抑制多用户干扰后, 充分利用空时分组码的复正交性来简化原有方案高译码复杂度。与原有指数性译码复杂度相比, 该方案有着线性复杂度, 而且与满分集空时分组编码CDMA系统相比, 可实现满速率、低复杂度和部分分集, 有着相对多的空间冗余信息, 从而级联信道编码后可有效弥补部分分集所带来的性能损失。仿真结果表明在相同系统容量和级联码的情况下, 所给系统比相应的满分集空时编码CDMA系统有着低的误比特率。     

Implementation of burst-correcting convolutional codes

A general procedure is formulated for decoding any convolutional code with decoding delayNblocks that corrects all bursts confined toror fewer consecutive blocks followed by a guard space of at leastN-1consecutive error-free blocks. It is shown that all such codes can be converted to a form called "doubly systematic" which simplifies the decoding circuitry. The decoding procedure can then be implemented with a circuit of the same order of complexity as a parity-checking circuit for a block-linear code. A block diagram of a complete decoder is given for an optimal burst-correcting code. It is further shown that error propagation after a decoding mistake is always terminated by the occurrence of a double guard space of error-free blocks.     

Noncoherent block-coded MPSK

For coherent detection, block-coded modulation is a bandwidth efficient scheme. In this paper, we propose theorems about the error performance of block-coded modulation using M-ary phase-shift keying (MPSK) for noncoherent detection. Based on these theorems, we propose a novel block-coded modulation scheme for noncoherent detection called noncoherent block-coded MPSK. The proposed scheme provides flexible designs of noncoherent block codes with different code rate, block length and error performance. Good noncoherent block codes can be easily obtained by properly choosing binary linear block codes as the component codes. Moreover, noncoherent block codes of this new scheme can be decoded by multistage decoding, which has the advantage of low complexity and satisfactory error performance. In this paper, two algorithms of multistage decoding for noncoherent detection are proposed as well. The error performance of some designed codes and decoding algorithms is verified by computer simulation.     

多层交织分复用空时码系统的设计

IDMA技术以其抗多径干扰性好、接收复杂度低等优点成为第四代移动通信的关键技术之一。多层交织分多址复用时空码（ML-IDM-ST）系统是将空时码（STC）思想和IDMA系统相结合的演化而来,它具有接收简单,复杂度低和高吞吐量等优点。本文描述了多层交织分复用空时码系统（ML-IDM-ST）的基本原理和算法流程并对其发展前景进行了预测。     

基于MIMO系统的差分解码算法及性能分析

针对两用户MIMO系统,首先提出了一种基于正交空时分组码的部分差分解码算法,接收端获得一个用户的信道状态信息即可实现对两个用户的解码;然后给出了一种针对两用户MIMO系统的完全差分解码算法,可以在没有任何一个用户的信道状态信息情况下进行解码;最后针对该算法进行了复杂度分析和旋转预编码优化,并通过仿真给出了最优旋转角度。计算机仿真证明该完全差分解码算法有效地降低了解码复杂度。