一种伪随机LDPC码构造方法与性能研究

低密度校验(Low-Density Parity-Check)码作为迄今为止性能最好的纠错码之一, 目前已经被许多数字通信标准广泛采用。伪随机低密度校验码(Pseudo-Random)是 LDPC 码的一个子类,已被应用于空间通信和无线网络技术。本文给出了一种基于有限域的伪随机 LDPC 码构造方法,并采用理论分析和仿真结果分析相结合的方法,对伪随机 LDPC 码的构造和编译码方法进行了研究,并给出了实现中适合的译码算法及量化方案。     

激光伪随机编码的最小周期识别技术研究

针对激光制导武器使用的有限位伪随机码的特点,提出了对其最小周期的识别算法.利用Dephi开发软件编程实现了该算法,并统计研究了该方法对伪随机编码的识别概率.研究表明该算法可以接收较少的制导信号就能有效地识别出伪随机编码的最小周期.     

一种脉冲间隔编码的实现方法

脉冲编码主要有重频编码、周期编码、脉冲间隔编码(PCM编码)及伪随机码4种码型样式,各种脉冲编码中脉冲间隔编码的应用最为广泛。文中以基础频率为5～50 Hz、1～12 bits可变码位的脉冲间隔编码为研究对象,对脉冲间隔编码的特点及生成机理进行分析,并通过实际的硬件、软件设计讨论其实现方法,最终给出几种脉冲间隔编码的输出结果。     

非周期长码直扩信号的伪随机码盲估计

研究了m序列三阶相关函数特性,证明了不同周期m序列三阶相关函数存在共同峰,推导得到共同峰的特性以及共同峰坐标与m序列本原多项式之间对应关系,基于上述理论提出了非合作通信下的非周期长码直扩信号伪随机码估计方法。加性高斯白噪声下的仿真结果表明,本方法仅需1/4倍长码周期长度信号和4 dB信噪比,估计非周期长码直扩信号的扩频码和长扰码的正确概率就可达到99%以上。     

比特级码率兼容多元LDPC码打孔算法

多元低密度奇偶校验(Non-binary Low-density Parity-check,NB-LDPC)码在中短码情况下性能优于传统二元LDPC码,更接近香农限.针对多元LDPC码码率兼容(Rate-compatible)的问题,提出了一种基于比特级的新型多元打孔算法.首先采用二进制镜像矩阵概念对多元校验矩阵进行映...     

A new high rate code scheme with highly parallel and low complexity decoding algorithm

A new high rate code scheme is proposed in this paper. It consists of serial concatenated recursive systematic ordinary (nonpunctured) convolutional codes with only 8 states in the trellis of the corresponding reciprocal dual codes. With a low complexity and highly parallel decoding algorithm, over additive white Gaussian noise channels, the proposed codes can achieve good bit error rate (BER) performance comparable to that of turbo codes and low density parity check (LDPC) codes. At code rate R=16/17, the overall decoding complexity of the proposed code scheme is almost half that of the LDPC codes.     

并行级联分组码的一种新的迭代译码算法

并行级联分组码比串行级联分组码具有更高的码率,基于LLR计算的Turbo迭代译码算法使其内外分量码均做到了软判决译码。通过引入校正因子a（m）,将接收信息与子译码器的输出软信息进行线性叠加反馈能在省去繁琐的LLR计算的情况下实现并行级联分组码的Turbo迭代译码。仿真研究表明,若将译码器的输出进行简单的相关运算,可进一步改善译码器性能。     

FFT快速捕获算法在GPSC／A码与P（Y）码中的应用

一种快速、有效的GPS信号捕获方法是通过在整段数据上并行搜索伪码相位,对一段输入数字中频(IF)序列和一段本地复现伪码序列进行快速傅里叶变换(FFT)运算来实现。分析了用FFT实现循环相关及其在GPS C/A码捕获中的应用,采用整区间相关、扩展复现码折叠、叠加相加和叠加丢弃法实现P(Y)码快速直接捕获,用补零、线性内插、Sinc内插、平均相关和双倍长度补零法解决计算点数问题,用扩展计算点数方法解决由导航数据引起的相位反转、超长序列与短序列进行线形相关运算及用循环相关实现线形相关等应用中的具体问题。     

空间耦合LDPC码在AWGN信道下的性能分析

空间耦合LDPC(Spatially Coupled LDPC,SC-LDPC)码由于阈值饱和特性,被证明是未来无线通信系统的有力候选码型。SC-LDPC码是一种卷积LDPC码,在二元无记忆对称信道下采用置信传播译码算法时具有逼近香农限的性能。对SC-LDPC码的构造及其经典的置信传播译码算法进行了阐述,并在加性高斯白噪声信道下进行了性能仿真和分析。仿真结果表明,SC-LDPC码的约束长度越长或最大迭代次数越大,其性能就越逼近香农容量限。SC-LDPC码在误码率为10-5、最大迭代次数为100时,码长20000比码长10000大约有0.68 dB的增益;在误码率为10-5、码长为10000时,最大迭代次数100的SC-LDPC码比最大迭代次数10的码大约有0.66 dB的增益。仿真结果有效验证了SCLDPC码在无线通信系统中的良好性能。     

A fast parallel implementation of a Berlekamp-Massey algorithm foralgebraic-geometric codes

We obtain a parallel Berlekamp-Massey-type algorithm for determining error locating functions for the class of one point algebraic-geometric codes. The proposed algorithm has a regular and simple structure and is suitable for VLSI implementation. We give an outline for an implementation, which uses as main blocks γ copies of a modified one-dimensional Berlekamp-Massey algorithm, where γ is the order of the first nongap in the function space associated with the code. Such a parallel implementation determines the error locator for an algebraic-geometric code using the same time requirements as the underlying one-dimensional Berlekamp-Massey algorithm applied to the decoding of Reed-Solomon codes     

Efficient encoding of quasi-cyclic low-density parity-check codes

Quasi-cyclic (QC) low-density parity-check (LDPC) codes form an important subclass of LDPC codes. These codes have encoding advantage over other types of LDPC codes. This paper addresses the issue of efficient encoding of QC-LDPC codes. Two methods are presented to find the generator matrices of QC-LDPC codes in systematic-circulant (SC) form from their parity-check matrices, given in circulant form. Based on the SC form of the generator matrix of a QC-LDPC code, various types of encoding circuits using simple shift registers are devised. It is shown that the encoding complexity of a QC-LDPC code is linearly proportional to the number of parity bits of the code for serial encoding, and to the length of the code for high-speed parallel encoding.     

Inter-Group Complementary Codes for Interference-Resistant CDMA Wireless Communications

Spreading code plays an extremely important role on the overall performance of a CDMA system. The correlation properties and available number of spreading codes determine the interference-resist capability as well as system capacity. In this paper, we analyze the characteristics and limitations of traditional and recently reported spreading codes. Based on the analysis, we propose a new code design approach which will be used to generate inter-group complementary (IGC) codes. The correlation functions of the IGC codes possess definite and bi-valued interference-free windows. In addition, a corresponding code assignment algorithm and spreading scheme will be introduced to take advantage of the desirable properties of the IGC codes for their applications in CDMA systems. Both theoretical analysis and simulation results show that an IGC-CDMA system is interference-resistant and capable to offer a high spectral efficiency if compared with the ones based on other spreading codes.     

Symbol-by-symbol MAP decoding algorithm for high-rate convolutionalcodes that use reciprocal dual codes

A symbol-by-symbol maximum a posteriori (MAP) decoding algorithm for high-rate convolutional codes applying reciprocal dual convolutional codes is presented. The advantage of this approach is a reduction of the computational complexity since the number of codewords to consider is decreased. All requirements for iterative decoding schemes are fulfilled. Since tail-biting convolutional codes are equivalent to quasi-cyclic block codes, the decoding algorithm for truncated or terminated convolutional codes is modified to obtain a soft-in/soft-out decoder for high-rate quasi-cyclic block codes which also uses the dual code because of complexity reasons. Additionally, quasi-cyclic block codes are investigated as component codes for parallel concatenation. Simulation results obtained by iterative decoding are compared with union bounds for maximum likelihood decoding. The results of a search for high-rate quasi-cyclic block codes are given in the appendix     

Design and decoding of optimal high-rate convolutional codes

This correspondence deals with the design and decoding of high-rate convolutional codes. After proving that every (n,n-1) convolutional code can be reduced to a structure that concatenates a block encoder associated to the parallel edges with a convolutional encoder defining the trellis section, the results of an exhaustive search for the optimal (n,n-1) convolutional codes is presented through various tables of best high-rate codes. The search is also extended to find the "best" recursive systematic convolutional encoders to be used as component encoders of parallel concatenated "turbo" codes. A decoding algorithm working on the dual code is introduced (in both multiplicative and additive form), by showing that changing in a proper way the representation of the soft information passed between constituent decoders in the iterative decoding process, the soft-input soft-output (SISO) modules of the decoder based on the dual code become equal to those used for the original code. A new technique to terminate the code trellis that significantly reduces the rate loss induced by the addition of terminating bits is described. Finally, an inverse puncturing technique applied to the highest rate "mother" code to yield a sequence of almost optimal codes with decreasing rates is proposed. Simulation results applied to the case of parallel concatenated codes show the significant advantages of the newly found codes in terms of performance and decoding complexity.     

Joint message-passing decoding of LDPC codes and partial-responsechannels

Ideas of message passing are applied to the problem of removing the effects of intersymbol interference (ISI) from partial-response channels. Both bit-based and state-based parallel message-passing algorithms are proposed. For a fixed number of iterations less than the block length, the bit-error rate of the state-based algorithm approaches a nonzero constant as the signal-to-noise ratio (SNR) approaches infinity. This limitation can be removed by using a precoder. It is well known that low-density parity-check (LDPC) codes can be decoded using a message-passing algorithm. Here, a single message-passing detector/decoder matched to the combination of a partial-response channel and an LDPC code is investigated     

低复杂度的TBCC自适应循环VA译码算法

咬尾是一种将卷积码转换为块码的技术,它消除了归零状态所造成的码率损失,同时避免了截尾带来的性能降低,在短块编码中具有明显优势.针对咬尾卷积码(TBCC)现有译码算法复杂度过大和收敛性问题,提出一种低复杂度的TBCC自适应循环维特比(VA)译码算法.该算法根据信道变化自适应调整译码迭代次数,使咬尾路径收敛到最佳.通过仿真...     

Design of parallel concatenated convolutional codes

A parallel concatenated convolutional coding scheme consists of two constituent systematic: convolutional encoders linked by an interleaver. The information bits at the input of the first encoder are scrambled by the interleaver before entering the second encoder. The codewords of the parallel concatenated code consist of the information bits followed by the parity check bits of both encoders. Parallel concatenated codes (turbo codes), decoded through an iterative decoding algorithm of relatively low complexity, have been shown to yield remarkable coding gains close to theoretical limits. We characterize the separate contributions that the interleaver length and constituent codes give to the overall performance of the parallel concatenated code, and present some guidelines for the optimal design of the constituent convolutional codes     

基于相关的SFFT的卫星信号捕获算法

GPS(Global Positioning System)接收机中,常用的捕获方法有时域串行捕获方法、基于FFT( Fast Fourier Transform)的并行频率捕获方法和基于FFT的并行码相位捕获方法,但在某些应用场景下,会对卫星信号的捕获速度提出更高的要求,因此给出了一种基于相关的SFFT(Sparse Fast Fourier Transform)的卫星信号快速捕获算法。该算法结合卫星信号伪随机码的强自相关性的特性,将原有的SFFT的幅度估值去掉,利用时域串行的捕获方法,将SFFT算法中输出的大值坐标点对应的本地伪码与接收卫星信号做相关,进而捕获卫星信号。通过实验对算法进行验证,并与已有的卫星信号捕获方法进行对比,结果表明该方法能有效地运用于卫星信号捕获中,并且该算法的运算量要比传统捕获算法更低。      

Layered Approx-Regular LDPC: Code Construction and Encoder/Decoder Design

Layered approximately regular (LAR) low-density parity-check (LDPC) codes are proposed, with which one single pair of encoder and decoder support various code lengths and code rates. The parity check matrices of LAR-LDPC codes have a "layer-block-cell" structure with some additional constraints. An encoder architecture is then designed for LAR-LDPC codes, by making two improvements to the Richardson-Urbanke approach: the forward substitution operation is entirely removed and the dense-matrix-vector multiplication is handled using feedback shift-registers. A partially parallel decoder architecture is also designed for LAR-LDPC codes, where a layered modified min-sum decoding algorithm is used to trade off among complexity, speed, and performance. More importantly, the interconnection network, which is inevitable for partially parallel decoders, has much lower hardware complexity compared with that for general LDPC codes. Both the encoder and decoder architectures are highly flexible in code length and code rate.     

A class of generalized LDPC codes with fast parallel decoding algorithms

Given the Tanner graph of a generalized low-density parity-check (GLDPC) code, the decoding complexity is mainly dominated by the decoding algorithm of subcodes. In this paper, we propose a class of GLDPC codes with fast parallel decoding algorithm. The parity-check matrices of the newly constructed subcodes are composed of several square matrices, which can be viewed as elements of a finite field. Therefore the FFT-based a posteriori probability (APP) algorithm for nonbinary codes can be applied to decode the subcodes. When compared with the trellis-based APP algorithm, the FFT-based APP algorithm can be implemented in parallel and has lower complexity. Simulation results show that the proposed GLDPC codes perform well on AWGN channels.