一种短延时Turbo编码调制系统的设计

本文设计了一种比传统体制减少了一半延时的Turbo编码调制系统,介绍了交织器的相关限制.提出了一种在译码过程中对信道值的估计方法,使得外信息的计算更加趋于精确,从而提高了译码性能.这种迭代译码算法是标准格码调制译码算法的一种自然推广,同时也类似于二元Turbo码在BPSK调制下的逐比特译码算法.采用吞吐率为2bits/s/Hz的8PSK调制,比特错误率为10^-5所需的信噪比与Shannon限相距不到0.4dB.     

级联纠错编码DS/BPSK系统性能分析与仿真

为了研究级联编码对DS/BPSK系统性能的影响,设计了一种基于RS与卷积码级联编码的DS/BPSK系统,分析了该级联编码直扩系统的性能,仿真了在纠错编码参数发生改变时的系统性能。仿真结果表明,级联编码的DS/BPSK系统性能比单码编码的DS/BPSK系统性能要好。在RS码参数保持不变时,降低卷积码的码率,采用软判决方式译码以及多比特软判决,能有效提升系统性能;同时,交织在一定程度上能改善系统的性能。     

基于LDPC乘积码的BICM-ID方案性能分析

提出一种采用LDPC乘积码和BICM-ID相结合的编码调制技术.该方案编码采用LDPC乘积码,译码可以采取三个迭代过程:在解调器和译码器之间迭代,LDPC乘积码的分量码之间迭代,以及分量码内部迭代.因此采取合理的迭代译码策略,可以提高的译码效率.仿真结果显示,该方案在AWGN信道和Rayleigh信道条件下,与数字电视地面多媒体广播DTMB采用的编码调制方案相比具有更好的误比特性能.     

高阶调制系统下LDPC码优化设计

为了提高编码调制系统的整体编码增益,提出一种高阶调制系统下LDPC码的度分布优化方法.根据高阶调制符号中不同比特的误比特特性,将调制符号所经历信道建模为一组对称二进制输入加性高斯信道.在此基础上,推导了高阶调制系统下LDPC码高斯近似密度进化分析方法,并得到译码收敛条件.结合度分布约束关系及译码收敛条件,提出高阶调制系统下LDPC码的度分布优化问题及差分进化实现方法.仿真结果表明,设计的LDPC码在高阶调制系统中的渐进性能和误码性能优于基于比特优化映射的编码调制方案.     

一种基于Turbo编译码方案的BPSK系统误比特性能研究

在介绍Turbo编码、译码原理的基础上,建立一个典型BPSK通信系统模型,将Turbo码与其它编码方式分别运用于该系统模型,通过Matlab仿真,研究、分析了系统在不同编译码方式下的误比特性能,最后给出结论。     

基于LDPC码有效编码算法的编码调制系统

低密度奇偶校验码(LDPC码)的直接编码运算量较大,采用基于下三角矩阵的有效编码算法,通过重排列的顺序得到一个新的校验矩阵,以控制编码运算量为线性复杂度。编码后经过BPSK调制,采用对数域的BP译码算法进行解码。仿真结果表明,在AWGN信道下该系统有较好的误码率性能。     

基于TPC编码的双多进制正交码扩频系统性能分析

本文以传统单正交码扩频技术为基础,提出了一种双多进制正交码扩频 4DPSK的复合调制方式,以进一步提高频谱利用率。首先给出了复合调制方案以及采用最大后验概率(MAP)准则的最佳非相干接收方法,其次提出了适合Turbo乘积码(TPC)SISO(软输入软输出)译码的软判决信息提取算法,最后测试了系统在高斯白噪声信道下的误比特性能。仿真表明该系统可以获得比传统正交扩频系统更高的抗噪声干扰能力,引入TPC编码技术后性能有较大改善。     

Turbo码综合性能分析与Turbo编码调制

对 Ｔｕｒｂｏ码的 ＲＳＣ分量码、交织器、调制方式、信道以及迭代译码算法进行了综合研究与性能分析，并给出了一种基于逐比特ＭＡＰ算法的Ｔｕｒｂｏ编码与多元调制相结合的编码调制方式。仿真结果表明，该方案将Ｔｕｒｂｏ码的高编码增益与多元调制的高频谱利用率有效地结合在一起，是一种功率和频谱高效的编码调制方式，比传统的ＴＣＭ方式有更好的性能。     

一种用于BICM-ID系统的新颖8APSK映射方案

为了能够通过高阶调制信号增加信道容量,提高编码增益和频谱效率,对8阶振幅移相键控(APSK)星座映射方案进行优化.基于欧氏距离设计准则提出一种新颖(2,6)-scheme 8APSK映射方案,并应用于联合准循环构造法构造的低密度奇偶校验(LDPC)(4599,4307)码的比特交织编码调制迭代译码(BICM-ID)系统中.信道容量仿真表明,所提方案在高、低信噪比区域都具有非常优越的互信息性能.误码率(BER)性能仿真表明,在BER为10-7时,联合LDPC(4599,4307)码的(2,6)-scheme 8APSK映射方案较(4,4)-scheme 8APSK映射方案、8PSK调制的格雷(Gray)映射、集分割(SP)映射、半集分割(SSP)映射分别提高了约0.45 dB、1.10 dB、1.62 dB、2.13 dB的编码增益.外附信息转移(EXIT)图仿真说明,所提方案能够更早地打开译码通道,从而更早地通过迭代来实现无错译码.     

基于Turbo码的非理想中继协作性能研究

基于Turbo码的非理想中继信道协作方式是在加性高斯白噪声(AWGN)的环境下提出的一种协作通信方式。源节点将编码并调制后的信息分别传送给中继节点和目的节点,中继节点对接收到的码字进行译码、传送,目的节点接收2路不同的信号(一路是来自源节点未经过交织的信息比特和校验比特,另一路是来自中继信道经过交织后来的校验比特)并采用联合迭代的译码方式对其进行译码。仿真结果表明,同等条件下,基于Turbo码的非理想中继信道协作方式在纠错方面的性能远胜于点对点的Turbo码非协作方式。     

Generalized Low-Density Parity-Check Codes Based on Hadamard Constraints

In this paper, we consider the design and analysis of generalized low-density parity-check (GLDPC) codes in AWGN channels. The GLDPC codes are specified by a bipartite Tanner graph, as with standard LDPC codes, but with the single parity-check constraints replaced by general coding constraints. In particular, we consider imposing Hadamard code constraints at the check nodes for a low-rate approach, termed LDPC-Hadamard codes. We introduce a low-complexity message-passing based iterative soft-input soft-output (SISO) decoding algorithm, which employs the a posteriori probability (APP) fast Hadamard transform (FHT) for decoding the Hadamard check codes at each decoding iteration. The achievable capacity with the GLDPC codes is then discussed. A modified LDPC-Hadamard code graph is also proposed. We then optimize the LDPC-Hadamard code ensemble using a low-complexity optimization method based on approximating the density evolution by a one-dimensional dynamic system represented by an extrinsic mutual information transfer (EXIT) chart. Simulation results show that the optimized LDPC-Hadamard codes offer better performance in the low-rate region than low-rate turbo-Hadamard codes, but also enjoy a fast convergence rate. A rate-0.003 LDPC-Hadamard code with large block length can achieve a bit-error-rate (BER) performance of 10^-5 at -1.44 dB, which is only 0.15 dB away from the ultimate Shannon limit (-1.592 dB) and 0.24 dB better than the best performing low-rate turbo-Hadamard codes     

Low-rate turbo-Hadamard codes

This paper is concerned with a class of low-rate codes constructed from Hadamard code arrays. A recursive encoding principle is employed to introduce an interleaving gain. Very simple trellis codes with only two or four states are sufficient for this purpose, and the decoding cost involved in the trellis part is typically negligible. Both simulation and analytical results are provided to demonstrate the advantages of the proposed scheme. The proposed scheme is of theoretical interest as it can achieve performance of BER=10/sup -5/ at E/sub b//N/sub 0//spl ap/-1.2dB (only about 0.4 dB away from the ultimate low-rate Shannon limit) with an information block size of 65534. To the authors' knowledge, this is the best result achieved to date with respect to the ultimate Shannon limit. With regard to practical issues, the decoding complexity of the proposed code is considerably lower than that of existing low-rate turbo-type codes with comparable performance.     

Sequential Decoding of Convolutional Codes for Rayleigh Fading Channels

The performance of sequential decoding of long constraint length convolutional codes is evaluated for Rayleigh fading channels. Sequential decoding is not practical below a certain theoretical signal-to-noise ratio, and these theoretical limits are calculated for a number of modulation methods and code rates. As an example, with BPSK modulation, soft decisions and code rate 1/2, the theoretical signal-to-noise ratio per information bit is 5.7 dB. Above this limit the bit error rate can be made arbitrarily small by increasing the constraint length at no significant complexity cost. Furthermore, it is shown that with carefully chosen quantization steps, 8 level uniform quantization gives a negligible loss also for sequential decoding on a Rayleigh fading channel. Simulation results using 8 level quantization correspond well with the theoretical performance bounds. Also, the performance on a correlated channel with finite interleaving has been obtained. With an interleaver depth of 50×50 and a normalized doppler frequency equal to 0.01 we are only 0.5 dB away from the performance with perfect interleaving. Finally, bit error rate results show this scheme to compete well with Turbo codes.     

Multistage decoding of multilevel block M-PSK modulationcodes and its performance analysis

Multistage decoding of multilevel block multilevel phase-shift keying (M-PSK) modulation codes for the additive white Gaussian noise (AWGN) channel is investigated. Several types of multistage decoding, including a suboptimum soft-decision decoding scheme, are devised and analyzed. Upper bounds on the probability of an incorrect decoding of a code are derived for the proposed multistage decoding schemes. Error probabilities of some specific multilevel block 8-PSK modulation codes are evaluated and simulated. The computation and simulation results for these codes show that with multistage decoding, significant coding gains can be achieved with large reduction in decoding complexity. In one example, it is shown that the difference in performance between the proposed suboptimum multistage soft-decision decoding and the single-stage optimum decoding is small, only a fraction of a dB loss in SNR at the block error probability of 10^-6     

基于原型图的低码率LDPC码最小和译码算法改进方案

低密度奇偶校验(LDPC)码的译码硬件实现方案大多采用计算复杂度较低的修正最小和(NMS)算法,然而对于低码率LDPC码,由于校验节点度数低,NMS算法的修正误差较大,导致其译码性能和标准的置信传播(BP)算法相比有较大差异。该文针对基于原图构造的一类低码率LDPC码,提出了在NMS迭代译码中结合震荡抵消(OSC)处理和多系数(MF)修正技术的方案。结合低码率原型图LDPC码行重分布差异较大的特点,MF修正算法可以有效地减少计算误差,从而改善译码性能。另外低码率原型图LDPC码的收敛较慢,而OSC处理则可以较好地抑制正反馈信息,进一步提高NMS算法的性能增益。仿真结果表明,对于此类低码率LDPC码, MF-OSC-NMS算法可以达到接近BP算法的性能。OSC处理和MF修正技术硬件实现简单,与NMS算法相比几乎没有增加计算复杂度,因此MF-OSC-NMS算法是译码算法复杂度和性能之间一个较好的折中处理方案。     

Space-Time Trellis Code Design Based on Super Quasi-Orthogonal Block Codes With Minimum Decoding Complexity

In this letter, we propose a new family of space-time trellis codes, which are constructed by combining a super set of quasi-orthogonal space-time block codes with minimum decoding complexity with an outer multiple trellis coded modulation encoder. A systematic set-partitioning method for quadratic amplitude modulation constellations is given. The proposed scheme can be used for systems with four or more than four transmit antennas. Furthermore, its decoding complexity is low because its branch metric calculation can be implemented in a symbolwise way. Simulation results demonstrate that the proposed scheme has a comparable performance as super quasi-orthogonal space-time trellis codes proposed by Jafarkhani and Hassanpour while providing a lower decoding complexity.     

Iterative decoding of parallel and serial concatenated single parity check product codes

An efficient, iterative soft-in-soft-out decoding scheme is employed for the parallel and serially concatenated single parity check (SPC) product codes, which has very low complexity, requiring only two addition-equivalent-operations per information bit. For a rate 0.8637 of parallel concatenated SPC product code, a performance of BER=10/sup -5/ at E/sub b//N/sub 0/=3.66 dB can be achieved using this decoding scheme, which is within 1 dB from the Shannon limit.     

Low-rate channel coding with complex-valued block codes

This paper addresses aspects of channel coding in orthogonal frequency-division multiplexing-code-division multiple access (OFDM-CDMA) uplink systems where each user occupies a bandwidth much larger than the information bit rate. This inherent bandwidth expansion allows the application of powerful low-rate codes under the constraint of low decoding costs. Three different coding strategies are considered: the combination of convolutional and repetition codes, the code-spread system consisting of one single very low-rate convolutional code and a serial concatenation of convolutional, Walsh-Hadamard and repetition code. The latter scheme is improved by combining the Walsh-Hadamard codes with an additional M-phase-shift keying modulation resulting in complex-valued Walsh-Hadamard codes (CWCs). Analytical performance evaluations will be given for these codes for the first time. The application of CWCs as inner codes in a serial code concatenation is also addressed. We derive a symbol-by-symbol maximum a posteriori decoding algorithm in the complex signal space in order to enable iterative decoding for the entire code. A comprehensive performance analysis by simulation of all the proposed coding schemes shows that the Walsh-Hadamard-based schemes are the best choice for low-to-medium system load. Note that even for fully loaded OFDM-CDMA systems, the concatenation with an inner complex-valued Walsh-Hadamard code leads to a bit-error rate less than 10/sup -5/ for an E/sub b//N/sub 0/ of about 6 dB.     

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.