排序方式: 共有695条查询结果,搜索用时 15 毫秒
1.
介绍了非规则LDPC码的发展并给出了其优势及缺点,重点论述用ACE算法来构造非规则LDPC码从而降低其差错平底特性。对降低非规则LDPC码的差错平底特性的其它方法提出了展望。 相似文献
2.
OFDM是一项能有效对抗高速无线通信中多径衰落的关键技术,为了进一步提高OFDM系统的误码性能,许多信道编码技术已被应用于OFDM系统中,二元域LDPC码以其近香农限的误码性能和较低的译码复杂度成为研究的热点。在AWGN信道下,多元域LDPC码比等效码长的二元域LDPC码有更好的纠错性能。本文提出了一种将多元域LDPC码经过MPSK调制后用于OFDM系统的新方法。仿真结果表明,在多径衰落信道下,通过合理选择多元LDPC码域的阶数和调制的方法,多元域LDPC编码的高阶调制OFDM系统比等效码长的二元域LDPC编码OFDM系统具有更好的性能,并且由于采用了多元域LDPC的快速BP译码,译码复杂度只是稍有增加。 相似文献
3.
面向DVB-S2标准LDPC码,该文旨在实现一种基于FPGA的高效编码结构,提出一种快速流水线并向递归编码算法,可以显著提高编码数据信息吞吐率。同时,通过并向移位运算和并向异或运算的处理结构计算编码中间变量及校验位信息,在提高编码并行度的同时可有效减少存储资源的消耗。此外,针对动态自适应编码的情况优化了LDPC码编码存储结构,有效复用了数据存储单元和RAM地址发生器,进一步提高FPGA的硬件逻辑资源利用率。针对DVB-S2标准LDPC码,基于Stratix IV系列FPGA的验证结果表明,所提编码结构在系统时钟为126.17 MHz时,编码数据信息吞吐率达20 Gbps以上。 相似文献
4.
恶劣情况下的非相干水声通信信道模型为随机相位Rayleigh衰落,推导了该模型的信道容量曲线。为实现接近非相干信道容量的可靠通信,提出多进制低密度校验码(LDPC)和恒重码级联码的多进制非相干概率域迭代处理算法。在信道幅度和相位完全未知的情况下,根据矩估计得到信号和噪声频点幅度的统计参量,进而得到恒重码的码字后验概率,再对多进制LDPC码进行因子图迭代译码。仿真证明本算法与现有的最大能量检测非迭代译码算法相比,与信道容量曲线的差距从4.5dB缩小至1.5dB。给出了实际海试湖试通信效果,频段为6~10kHz,数据速率为357bps,海试时近似垂直通信距离为5km,湖试时水平通信距离近3km、多径超过50mS,两种情况下无差错通信的信噪比门限为2dB,验证了本算法的优势。 相似文献
5.
6.
7.
8.
码长连续变化的QC-LDPC码的设计 总被引:2,自引:0,他引:2
该文基于有限多项式环的理论,提出了码长连续变化的准循环低密度奇偶校验(Quasi-Cyclic Low Density Parity Check, QC-LDPC)码的设计方法。当有限环基数大于某个门限值时,在此环内通过一定规则选择参数生成移位项,利用它们构造出的校验矩阵均可以达到较大的圈长(girth)值。在设计中,有限环基数为连续的整数,且基数与码长呈线性关系,因此能够在girth值不变的前提下实现码长的连续变化。该文分析并证明了该构造方法大大增加了可用的高性能QC-LDPC码数量,更好地服务于自适应链路系统。 相似文献
9.
Loop distribution of Tanner graph affects the BER performance of low-density parity-check codes(LDPC) decoding.To count short cycles in the Tanner graph efficiently,a side by side recursion algorithm based on matrix computation was proposed.Firstly,5 basic graph structures were defined to realize recursive calculate in the implementation process.Compared with previous works,the algorithm provided many methods for counting the same length of cycles.The same result confirmed the correctness of the algorithm.The new algorithm could not only calculate the total number of cycles,but also gave the number each edge participating in fixed-length cycles.Its complexity was proportional to the product of D and square of N,where D was the average degree of variable nodes,and N denoted the code length.For LDPC codes,D was far less than N.For most of the LDPC codes,the calculation for numbers of cycle-length g、g+2、g+4 was only several seconds. 相似文献
10.
Zijing Wu Kaixiong SuAuthor VitaeLiting GuoAuthor Vitae 《AEUE-International Journal of Electronics and Communications》2014,68(10):994-999
A new modified Min Sum decoding algorithm based on parameter estimation theory for Low Density Parity Check (LDPC) codes is presented in this paper. First, Linear Minimum Mean Square Error (LMMSE) estimate criterion is used to model the magnitude of check-to-variable message and calculate estimated parameters, furthermore the golden section search algorithm is used to speed up getting the boundary, with which the parameters can be determined. Then, the parameters are modified further on the basis of the relationship between the iteration number and the estimated parameters. Finally, the same estimated parameters are used for different signal to noise ratio (SNR) to ensure the decoding performance and reduce the hardware complexity. The simulation results show that a gain of 0.3–0.5 dB can be achieved in comparison with other kinds of modified Min Sum algorithms, which is very close to that of BP algorithm. What's more, the algorithm has the following characteristics: low computation complexity, small decoding delay, easiness of calculation for estimated parameters, and simplicity in hardware implementation. 相似文献