软信息辅助硬判决译码在自由空间光通信中的应用

由于在性能和复杂度之间的良好折中,软信息辅助硬判决译码近年来受到了光通信领域的高度关注,其中包括了软信息辅助比特标记(Soft-Aided Bit-Marking,SABM)算法.为了易于硬件实现,本文基于阶梯码(Staircase Code,SCC)提出了一种改进型SABM算法(improved SABM,iSABM),称为iSABM-SCC.iSABM-SCC利用信道软信息,通过两个可信度阈值将硬判决输出比特标记为三种可信度等级,用以辅助硬判决译码识别译码错误和扩展纠错能力,达到提升阶梯码性能的目的.在受大气湍流影响的自由空间光通信中的仿真表明,iSABM-SCC性能显著优于标准SCC和RS码.以强湍流信道为例,码率为0.75的iSABM-SCC在4-PAM调制下较标准SCC产生的性能增益可达4.37 dB,在8-PAM调制下较RS码产生的性能增益可达11.06 dB.     

行星际网络中AR4JA码性能分析

为了深入研究AR4JA码在行星际网络中的性能,对AR4JA码的构造特点及性能进行系统的理论分析,并使用BP译码算法和最小和译码算法对AR4JA码进行译码.分析发现,AR4JA码具有编码简单并呈现系统性,通过打孔提高码率,码间最小距离的增加与码长成线性关系等优势,非常适合在行星际网络中应用.同时实验结果表明,两种译码算法均适用于在行星际网络中使用的AR4JA码.在此情况下,相对BP译码算法,最小和译码算法在损失较小增益的同时减少译码复杂度,更便于行星际网络探测器小型化需求.     

一种应用于DMB-T的基于RS码软判决译码的级联码方案

结合DMB—T系统的信道编码方案以及编码领域的最新进展,即RS码软判决译码算法的发展,提出了一种应用于DMB-T系统基于和积算法(SPA)的RS码软判决译码的级联码方案。该方案仅需在现有方案的基础上作少量调整即可获得可观的编码增益。和其它流行的软判决译码算法的比较表明,此方案提出的RS码软判决译码算法在DMB-T系统的应用中具有一定的优势。     

类卷积译码的容错解扰算法

针对自同步扰码系统的联合信源信道译码问题,本文将自同步扰码看作一种特殊的卷积编码,提出了类似卷积译码的软输入软输出(SISO)自同步去扰算法。该算法利用信源冗余更新扰码序列的外信息,在信道译码时作为先验信息进行译码,实现了自同步去扰与信道译码之间的软信息交互,充分利用了信源冗余信息,使得接收系统的性能得到了有效提升。仿真结果表明,在TPC编码条件下,当信源冗余度为70%时,联合信源信道译码的性能增益约为4.1dB。相比于单一纠错编码系统,当通信系统中存在自同步扰码时,联合信源信道译码具有更大的性能增益。      

一种新的缩短RS码迭代译码方案

为了在EPON中应用GF(256)标准RS码对信息帧长大于255位的信息流进行编码,并提高RS码的编码增益,提出了一种新的缩短RS码的编译码方案。该方案通过两个缩短RS码的交叠编码和互相迭代译码,可以提高编译码增益。RS码BM硬判决译码和chase软判决译码的计算机仿真表明,该方案对缩短RS码的软硬判决译码性能都有明显提高。     

面向6G的循环码低复杂度软判决译码技术

超高可靠低时延传输是未来6G通信系统的关键需求,相应的高性能中短块长弹性编码是亟需研究的热点问题。在已有的各类信道编码方案中,循环码得到了长期和深入的研究,具有优异的汉明距离和低复杂度编译码等特性,并能提供丰富的多码率多码长编码。但循环码却因为缺乏高效的软判决译码机制而难以充分发挥其性能潜力。基于导数分解的译码方法,通过将循环码分解成不同方向上导数,并根据导数码的译码投票结果,得到软量输出,为循环码译码提供了一种高效的软判决译码方案。分别从导数码译码的导数译码方案和导数方向选择两方面,完成了基于导数分解的循环码译码算法优化。通过优化导数码的译码机制,可以在高信噪比条件下的大幅度降低译码复杂度。另外,通过添加导数方向筛选机制,优化投票结果,可有效提升导数码译码性能。仿真结果表明,对码长为256的循环码采用上述改进导数码译码,可以降低最多60%的计算复杂度,并获得约0.2 dB的性能增益。     

突发信道下多进制LDPC码的性能研究

给出一种新的Q LDPC码(多进制LDPC码)译码简化算法,比较了在突发噪声信道以及衰落信道下,高码率(码率不低于8/9),短帧(帧长小于5 000 b)情况下Q LDPC码与RS码的纠错性能,并分析了其译码复杂度。仿真结果表明,改进后的Q LDPC码具有很好的抗突发和抗衰落性能,在突发噪声长度高达144 b的情况下,在误帧率为10-4的水平下,Q LDPC码的编码增益超出RS码2.7 dB,而在瑞利衰落信道下,则要比RS码多出9 dB的编码增益。这对于Q LDPC码应用具有重要的实际意义。     

一种基于错误集的极化码改进SCL译码算法

针对极化码在中短码长时纠错性能的不足,提出了一种基于错误集的极化码改进串行抵消列表(Successive Cancellation List of Polar Codes Based on Error Set,ES-SCL)译码算法。该算法首先根据极化码的信道特性构造错误集,在极化码编码时根据错误集中的元素设置奇偶校验(Parity Check,PC)位,其余位置则放置信息比特和冻结比特,译码器在译码PC位时,每条路径通过校验函数得到PC位的比特估计,不执行路径分裂和剪枝,其余位置则执行SCL译码。仿真结果表明,在加性高斯白噪声信道下,当码长为512,码率为0.5,误块率为10-5,最大译码列表数为8时,相较于PC-PSCL译码算法以及CA-SCL译码算法,所提出的ES-SCL译码算法获得了约0.18和0.15dB的增益;当码长为256,码率为0.5,误码率为10-5,最大译码列表数为8时,相较于CA-SCL,PC-PSCL译码算法,获得了约0.3和0.35dB的增益;此外,采用部分比特分裂译码的ES-SCL译码算法可以在误块率与PC-PSCL译码算法几乎相同的情况下,减少约50%的排序次数,具有更低的译码复杂度。     

光传输系统中LDPC码的新颖随机构造方法

分析光传输系统的传输特性与规则LDPC码的随机构造方法之后,提出LDPC码的一种新颖随机构造方法。基于该构造方法构造了一种新颖的码率为93.7%、冗余度为6.69%的规则SCG-LDPC(3969,3720)码,该规则LDPC码在将来的硬件实现中可相对地节省硬件存储空间和减少计算量。仿真分析表明:该新颖的SCG-LDPC(3969,3720)码在BER为10-8时,与同码率同冗余度的ITU-T G.975建议中RS(255,239)码和ITU-T G.975.1建议中LDPC(32640,30592)码相比,其净编码增益(NCG)和距离Shannon限都分别改善了约1.92dB和0.97dB。因而该规则LDPC码的纠错性能更为优越,更适用于光传输系统。     

光通信系统中一种新颖的随机交织型级联码方案

基于LDPC码,提出一种新颖的随机交织型级联码(RICC,random interleaved concatenatedcode)方案。在编码阶段,根据LDPC码中不同度数的变量节点采用不同纠错能力的BCH外码,分别进行保护的思想进行集分割编码;在译码阶段,采用硬判决辅助软判决的联合迭代译码。不同于传统的单极型和交织型级联方式,它是一种根据LDPC码变量节点(VN)度数来决定交织深度,因而交织方式是随机的。仿真结果分析表明,在误比特率(BER)为10-8时,四集合分割的RICC-4P的净编码增益(NCG)比无分割的单级型级联码提高了0.15dB,比ITU-T G.709和G.975.1标准中的RS(255,239)、RS(255,239)+CSOC(n/k=7/6,J=8)级联码和开销为25%的正交级联BCH码的NCG分别提高了3.0、1.5和0.4dB,其纠错性能的提升得益于采用集分割保护和硬判决辅助软判决的联合迭代译码。     

Block-coded M-PSK modulation over GF(M)

Channel codes where the redundancy is obtained not from parity symbols, but from expanding the channel signal-set, are addressed. They were initially proposed by G. Ungerboeck (1982) using a convolutional code. Here, a block coding approach is given. Rate m/(m+1) coded 2^m+1-ary phase-shift keying (PSK) is considered. The expanded signal-set is given the structure of a finite field. The code is defined by a square nonsingular circulant generator matrix over the field. Binary data are mapped on a dataword, of the same length as the codewords, over an additive subgroup of the field. The codes using trellises are described, and then the Viterbi algorithm for decoding is applied. The asymptotic coding gain ranges from 1.8 to 6.0 dB for QPSK going from blocklength 3 to 12. For 8-PSK, the gain is from 0.7 to 3.0 dB with blocklength 4 to 8. With only four states in the trellis, codes of any length for QPSK and 8-PSK are constructed, each having an asymptotic coding gain of 3.0 dB. Simulation results are presented. It is found that the bit-error rate performance at moderate signal-to-noise ratios is sensitive to the number of nearest and next-nearest neighbors     

Turbo decoding of simple product codes in a two user binary adder channel employing the Bahl–Cocke–Jelinek–Raviv algorithm

The main goal in this paper is an investigation of the Bahl–Cocke–Jelinek–Raviv (BCJR) algorithm applied in a turbo decoding scheme. Binary product codes are employed in a turbo coding scheme and the channel model considered is the two user binary adder channel (2-BAC) with additive white Gaussian noise. A trellis for two users is constructed for a pair of product codes tailored for use in the 2-BAC in order to employ the BCJR decoding algorithm. Computer simulation is employed to show that product codes on the 2-BAC, employing low-complexity component codes, produces considerable gain with few iterations under iterative BCJR decoding.     

A novel concatenated code based on the improved SCG-LDPC code for optical transmission systems

Based on the optimization and improvement for the construction method of systematically constructed Gallager (SCG) (4, k) code, a novel SCG low density parity check (SCG-LDPC)(3969, 3720) code to be suitable for optical transmission systems is constructed. The novel SCG-LDPC (6561,6240) code with code rate of 95.1% is constructed by increasing the length of SCG-LDPC (3969,3720) code, and in a way, the code rate of LDPC codes can better meet the high requirements of optical transmission systems. And then the novel concatenated code is constructed by concatenating SCG-LDPC(6561,6240) code and BCH(127,120) code with code rate of 94.5%. The simulation results and analyses show that the net coding gain (NCG) of BCH(127,120)+SCG-LDPC(6561,6240) concatenated code is respectively 2.28 dB and 0.48 dB more than those of the classic RS(255,239) code and SCG-LDPC(6561,6240) code at the bit error rate (BER) of 10 -7 .     

Turbo encoding and decoding of Reed-Solomon codes through binary decomposition and self-concatenation

This paper presents a two-stage turbo-coding scheme for Reed-Solomon (RS) codes through binary decomposition and self-concatenation. In this scheme, the binary image of an RS code over GF(2/sup m/) is first decomposed into a set of binary component codes with relatively small trellis complexities. Then the RS code is formatted as a self-concatenated code with itself as the outer code and the binary component codes as the inner codes in a turbo-coding arrangement. In decoding, the inner codes are decoded with turbo decoding and the outer code is decoded with either an algebraic decoding algorithm or a reliability-based decoding algorithm. The outer and inner decoders interact during each decoding iteration. For RS codes of lengths up to 255, the proposed two-stage coding scheme is practically implementable and provides a significant coding gain over conventional algebraic and reliability-based decoding algorithms.     

Near-capacity coding in multicarrier modulation systems

We apply irregular low-density parity-check (LDPC) codes to the design of multilevel coded quadrature amplitude modulation (QAM) schemes for application in discrete multitone systems in frequency-selective channels. A combined Gray/Ungerboeck scheme is used to label each QAM constellation. The Gray-labeled bits are protected using an irregular LDPC code with iterative soft-decision decoding, while other bits are protected using a high-rate Reed-Solomon code with hard-decision decoding (or are left uncoded). The rate of the LDPC code is selected by analyzing the capacity of the channel seen by the Gray-labeled bits and is made adaptive by selective concatenation with an inner repetition code. Using a practical bit-loading algorithm, we apply this coding scheme to an ensemble of frequency-selective channels with Gaussian noise. Over a large number of channel realizations, this coding scheme provides an average effective coding gain of more than 7.5 dB at a bit-error rate of 10/sup -7/ and a block length of approximately 10/sup 5/ b. This represents a gap of approximately 2.3 dB from the Shannon limit of the additive white Gaussian noise channel, which could be closed to within 0.8-1.2 dB using constellation shaping.     

A new differential space-time block coding scheme

We present a new differential space-time block code (DSTBC). The scheme can be represented by a trellis and decoded using the Viterbi algorithm. It provides a differential coding gain of 1 dB due to redundancy introduced in the differential encoding and it is only 2 dB away from the corresponding coherent space-time block code (STBC).     

Medical data transmission using the product of TLDPC and BCH error control coding systems with two interleavers

Medical data are very precious since it has the most sensitive data of patient which can save them. If it is handled wrongly or it is manipulated, then it could result in permanent problems or even it can result in fatal. So medical data widely used in a digital format with error detection and correction codes (EDC) in its transmission and storage process. EDC is a method of adding redundant bits to the static message bits to enhance the reliability of binary digital data broadcast while the medical data communication medium adds the errors in the course of transmission. In the proposed method, we use Bose–Chaudhuri–Hocquenghem codes (BCH) as an outline algorithm and trellis Low‐Density Parity Check code (TLDPC) as an inner algorithm along with two interleavers. Product of BCH code and TLDPC code with interleavers can control more errors as compared with its plain code and product of RS‐Hamming code. MATLAB used as a simulation tool. Plain BCH code is simulated first, and then plain LDPC code is simulated for the same information. Finally, the product of BCH and TLDPC with two interleavers is imposed on the same information. The result of our research work shows enhancement in bit error rate (BER) compared to other plain and product codes from 10^?2 to 10^?3. Also, frame error rate (FER) is improved in 0.5 scaling factors when compared with other trellis decoders. Hence, this proposed system can be utilized in an application where less error rate and high accuracy of information transmission between medical data processing systems are required.     

Eliminating the fanout bottleneck in parallel long BCH encoders

Long BCH codes can achieve about 0.6-dB additional coding gain over Reed-Solomon codes with similar code rate in long-haul optical communication systems. BCH encoders are conventionally implemented by a linear feedback shift register architecture. Encoders of long BCH codes may suffer from the effect of large fanout, which may reduce the achievable clock speed. The data rate requirement of optical applications require parallel implementations of the BCH encoders. In this paper, a novel scheme based on look-ahead computation and retiming is proposed to eliminate the effect of large fanout in parallel long BCH encoders. For a (2047, 1926) code, compared to the original parallel BCH encoder architecture, the modified architecture can achieve a speedup of 132%.     

Study on New Concatenated Code in WDM Optical Transmission Systems

A new concatenated code of RS（255,239）＋BCH（2 040,1 930） code to he suitable for WDM optical transmission systems is proposed. The simulation resuhs show that this new concatenated code. compared with the RS（255,239）4-CSOC（k0/n0=6/7, J= 8） code in ITU-TG. 75.1, has a lower redundancy and better error-correction performance, furthermore, its net coding gain（NCG） is respectively 0. 46 dB, 0.43 dB morethanthatofRS（255,239）＋CSOC（k0/n0= 6/7, J= 8） code and BCH（3860,3824）＋BCH （2 040,1 930） code in ITU TG. 75. 1 at the third iteration for the bit error rate（BER） of 10^-12. Therefore, the new super forward error correction（Super-FEC） concatenated code can be better used in ultra long-haul, ultra large-capacity and ultra high-speed WDM optical communication systems.     

A memory-efficient optimal APP symbol-decoding algorithm for linear block codes

We propose a simple modification of the famous Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm for linear block codes. The modified algorithm requires one forward and two backward recursions in the code trellis, but eliminates the need to store the whole trellis. Compared with the BCJR algorithm, the computational complexity is slightly increased, but the storage requirement is reduced.