Nakagami衰落信道中差分空时分组码误比特率分析

研究差分空时分组码在Nakagami衰落信道下的性能.在介绍2发1收差分空时分组码编译码方案的基础上,得出Nakagami信道下差分空时分组码的误比特率.仿真结果与理论计算值一致,证明了所推导误比特率计算表达式的正确性.     

一种新的两用户协作分集方案及其-l生能研究

该文提出了一种基于信道编码和分布式空时分组码级联下的两用户协作分集方案,并且在准静态的瑞利衰落信道下对此方案的系统容量,中断概率以及误比特率进行了理论推导和系统仿真,分别给出了解析表达式和数值结果。通过将信道编码和空时码引入到协作分集中,系统容量得到显著改善,同时中断概率也明显降低。在协作用户间信道存在噪声的情况下,对卷积码与分布式空时分组码级联下的发射方案进行了性能分析和仿真。仿真结果表明：即使协作用户间的信道存在噪声,该文所提方案在各方面都优于传统协作分集,系统容量明显增大,中断概率及误比特率大大降低。     

一种新的两用户协作分集方案及其性能研究

该文提出了一种基于信道编码和分布式空时分组码级联下的两用户协作分集方案,并且在准静态的瑞利衰落信道下对此方案的系统容量,中断概率以及误比特率进行了理论推导和系统仿真,分别给出了解析表达式和数值结果。通过将信道编码和空时码引入到协作分集中,系统容量得到显著改善,同时中断概率也明显降低。在协作用户间信道存在噪声的情况下,对卷积码与分布式空时分组码级联下的发射方案进行了性能分析和仿真。仿真结果表明:即使协作用户间的信道存在噪声,该文所提方案在各方面都优于传统协作分集,系统容量明显增大,中断概率及误比特率大大降低。     

空时分组码在编码协作通信中的性能研究

为提高系统性能,有效抵抗衰落,提出了采用空时分组码的双中继编码协作通信系统,并给出了中继点使用Alamouti码的发送方式。根据源点和中继点产生LDPC码的整体校验矩阵,导出了目的点进行联合迭代译码所需的初始化消息。理论分析和数值模拟表明,在相同条件下,采用Alamouti码可以明显提高系统性能。当误比特率达到10-4,Alamouti码编码协作通信系统较相应的普通编码协作具有1.6 dB增益。     

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

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

级联LDPC的空时分组码性能研究

阐述了空时分组码的编译码算法并进行性能分析,就其编码能提供分集增益但不能提供编码增益的特点,给出空时分组码级联LDPC(low density parity check code,低密度奇偶校验码)的系统模型。最后利用Matlab对级联LDPC的空时分组码进行仿真,结果表明:级联LDPC码的空时分组码能有效提高编码性能。     

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

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

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

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

基于信道编码及空时编码级联的两用户协同分集

传统协同分集通过使网络中各单天线用户共享彼此天线,形成虚拟多天线阵列来实现空间分集,使得体积和功耗受限的网络终端也能获得分集增益,然而这并没有将信道编码和空时编码结合起来以使系统得到编码增益。为了能够获得编码增益来进一步改善系统性能,本文提出了一种基于信道编码和分布式空时分组码级联方式下的两用户协同分集方案,并且在准静态的瑞利衰落信道下对系统误码性能进行了理论推导和系统仿真,给出了误比特率的上限解析表达式。在协同用户间信道存在噪声的情况下,我们分别对CRC-DSTBC和CC-DSTBC级联下的发射方案进行了性能分析和系统仿真。仿真结果表明:即使协同用户间的信道存在噪声,本文所提出的协同分集方案与传统协同分集相比,不但获得了分集增益,同时也得到了编码增益,系统误比特率大大降低,从而显著提高了系统性能,并且这也和理论分析相吻合。     

结合信道编码的两用户协作分集方案及其性能研究

基于一种分布式空时码的非正交协作分集（DSTC-NOCD）系统,并且结合信道编码,在译码转发（DF）中继信道模型下对两用户协作分集的方案性能进行了研究。通过将turbo码和空时码引入到协作分集中,在准静态的瑞利衰落信道下对此方案的误比特率进行了系统仿真。仿真结果表明：即使协作用户间的信道存在噪声,该文所采用的方案仍优于未加信道编码的分布式空时码的非正交协作分集系统,使得误比特率进一步降低。     

A Theoretical Method for Estimating Performance of Reed-Solomon Codes Concatenated with Orthogonal Space-Time Block Codes

1　ＩｎｔｒｏｄｕｃｔｉｏｎＲｅｃｅｎｔｌｙ,ａｎｅｗｓｐａｃｅ ｔｉｍｅｃｏｄｅａｄａｐｔｅｄｔｏｍｕｌｔｉｐｌｅａｎｔｅｎｎａｓｗｉｒｅｌｅｓｓｆａｄｉｎｇｃｈａｎｎｅｌｈａｓｂｅｅｎｐｒｏｐｏｓｅｄ[1～6] .Ｔｈｅｃｏｄｅｓａｒｅｔｈｅｊｏｉｎｔｄｅｓｉｇｎｏｆｃｏｄｉｎｇ ,ｍｏｄｕｌａｔｉｏｎ ,ｔｒａｎｓｍｉｓｓｉｏｎａｎｄｒｅｃｅｐｔｉｏｎｄｉ ｖｅｒｓｉｔｙｔｏ ｐｒｏｖｉｄｅｔｈｅｂｅｓｔｔｒａｄｅｏｆｆｂｅｔｗｅｅｎｄａｔａｒａｔｅｓ,ｄｉｖｅｒｓｉｔｙａｄｖａｎｔａｇｅａｎｄｃｏｄｅｓ…     

正交空时分组码性能估计的一种方法

本文给出并证明了采用正交空时分组码传输的衰落信道条件下,接收机输出瞬时信噪比的一般表达形式,分析了瑞利衰落信道条件下接收机输出符号差错性能.给出了正交空时分组码的符号差错概率的最小距离球界,由此可以得到空时分组码关于发送天线数量的"地板效应".     

Error-Correcting Codes Against the Worst-Case Partial-Band Jammer

This paper provides performance analyses of a broad spectrum of error-correcting codes in an antijam communication system under worst-case partial-band noise jamming conditions. These analyses demonstrate the coding advantages available for systems operating with and without frequency diversity. Utilizing both the exact approach (where possible) and upper-bounding approaches (Chernoff and union bounds), the decoded bit error rates for typical error-correcting codes (binary andM-ary, block and convolutional) have been obtained, and these codes have been compared according to theE_{b}/N_{0}required to achieve a bit error rate of 10^-5. The best performance is achieved with the use ofM-ary signaling and optimum diversity withM-ary codes, such as Reed-Solomon block codes, dual-kconvolutional codes, convolutional orthogonal codes, or concatenated codes.     

Rician衰落信道下空时分组码的性能分析

基于Alamouti提出的BPSK调制下空时分组码在Rayleigh衰落信道中的码性能原理,推导出高阶(M ary)调制下Rician衰落信道中空时分组码的符号差错率的最小距离球界,并进行计算机仿真分析了两信道下引入空时分组码的多天线系统中发射和接收天线的分集增益,发射天线数量的“地板效应”以及Rician因子K对符号差错性能的影响。     

Performance of RS coded M-ary modulation with and without symbol overlapping

In this paper, we present analytical bit error probability results for M-ary modulation concatenated with Reed Solomon (RS) codes. The analysis of bit error probability is nontrivial as the number of bits per symbol for the RS codes may not be an integer multiple of the number of bits per symbol for a modulation symbol. We propose a Markov chain technique which allows analytical evaluation of the bit error probability for such cases. The performance of RS coding with coherent biorthogonal, coherent/non-coherent orthogonal modulation over an additive white Gaussian noise (AWGN) channel is evaluated. Simulation of the bit error probability of RS code concatenated with a Nordstrom Robinson (NR) code as an inner code is performed and compared with the case of biorthogonal modulation. From the results, we notice that a stronger inner code gives better bit error probability. In addition, the throughput of the coded system with biorthogonal modulation over an AWGN channel is discussed. For a Rayleigh flat fading and block fading channel, we analyze the bit error probability of RS codes concatenated with biorthogonal modulation. From the result, we notice that a stronger outer code gives a better bit error probability for the case of Rayleigh flat fading channel.     

满速率串行级联空时分组MTCM编码方法研究

该文研究了级联空时编码系统在编码增益,分集增益和传输能量效率的限定下最大化传输速率的问题,提出了一种在保留TCM编码方法校验位冗余的同时,还可获得满速率串行级联空时分组TCM编码方法。新方法通过引入具有不同功率分集因子的正交发射码字矩阵,并给出新的译码算法,从而使得新的编码方法在获得满速率的同时还可以获得满分集增益。分析和MATLAB仿真结果表明,在相同的编码状态数下,新方法在编码增益上比现有的满速率超正交空时分组编码方法提高1dB左右。     

Multistage recursive interleaver for turbo codes in DS-CDMA mobileradio

A multistage recursive block interleaver (MIL) is proposed for the turbo code internal interleaver. Unlike conventional block interleavers, the MIL repeats permutations of rows and columns in a recursive manner until reaching the final interleaving length. The bit error rate (BER) and frame error rate (FER) performance with turbo coding and MIL under frequency-selective Rayleigh fading are evaluated by computer simulation for direct-sequence code-division multiple-access mobile radio. The performance of rate-1/3 turbo codes with MIL is compared with pseudorandom and S-random interleavers assuming a spreading chip rate of 4.096 Mcps and an information bit rate of 32 kbps. When the interleaving length is 3068 bits, turbo coding with MIL outperforms the pseudorandom interleaver by 0.4 dB at an average BER of 10^-6 on a fading channel using the ITU-R defined Vehicular-B power-delay profile with the maximum Doppler frequency of f_D = 80 Hz. The results also show that turbo coding with MIL provides superior performance to convolutional and Reed-Solomon concatenated coding; the gain over concatenated coding is as much as 0.6 dB     

Performance of Concatenated Dual-k Codes on a Rayleigh Fading Channel with a Bandwidth Constraint

The error rate performance, obtained on a Rayleigh fading channel, is determined and illustrated graphically for concatenated codes in which the outer code is a dual-kconvolutional code and the inner code is either a Hadamard block code or a block orthogonal code. Comparison of the performance of these two types of concatenated codes is made on the basis of the same bandwidth utilization. It is also illustrated that the concatenated dual-kcode yields a significant improvement in performance relative to the performance achieved with the inner code alone.     

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.     

Concatenated coding with inner trellis codes for fading channels

It is known that concatenated coding can significantly enhance the performance of digital communication systems operating over fading channels when compared to uncoded or single-coded systems. The price to be paid for such an improvement, however, is a substantial increase in the required bandwidth. In this paper, we consider the use of a concatenation scheme in which the inner code is a trellis-coded modulation (TCM) system. The analysis is carried out for two different outer codes: a binary Golay code and a non-binary Reed-Solomon code. Results obtained for the Rayleigh and Rician fading channels through analytical bounds indicate that the use of this system does provide a significant reduction in the bit error probability, a fact that is also verified through computer simulation. Unlike a traditional concatenated system, the proposed method achieves the coding gain while maintaining acceptable bandwidth efficiency.