期刊文献+
共找到8篇文章
< 1 >
每页显示 20 50 100
Turbo码译码器“及早判决”门限的确定及输出信噪比停止迭代准则 被引量:7
1
作者 李祥明 乐光新 尹长川 《北京邮电大学学报》 EI CAS CSCD 北大核心 2000年第1期46-50,共5页
提出将实际的 AWGN信道与 Turbo码译码器构成的联合信道看成一个等效 AWGN信道 ,在此基础上 ,提出一种新的采用译码器输出对数似然比序列的信噪比作为译码器停止迭代的判决准则 .为减少译码复杂度 ,可以将 Turbo码译码过程中对数似然比... 提出将实际的 AWGN信道与 Turbo码译码器构成的联合信道看成一个等效 AWGN信道 ,在此基础上 ,提出一种新的采用译码器输出对数似然比序列的信噪比作为译码器停止迭代的判决准则 .为减少译码复杂度 ,可以将 Turbo码译码过程中对数似然比超过某一门限的符号及时判决输出 .给出了门限值的理论确定方法 . 展开更多
关键词 信道编码 TURBO码 并行级联码 译码器 信噪比
下载PDF
Turbo码软输入/软输出最大后验概率译码模型
2
作者 肖炜丹 唐忠礼 张曙 《哈尔滨工程大学学报》 EI CAS CSCD 2001年第4期46-50,2,共5页
根据Turbo码软输入 /软输出译码结构 ,对其最优译码算法 :最大后验概率 (MAP)译码算法进行研究 ,探讨了软信息这一概念 ,并推导出SISO算法中用于迭代译码的软信息 ,从而建立了Turbo码最大后验概率译码的软输入 /软输出模型 .
关键词 TURBO码 MAP算法 并行级联码 SISO模型 译码结构 最大后验概率译码算法
下载PDF
Multiple accumulated-crossover parallel concatenated SPC codes 被引量:1
3
作者 GUO Kai CHEN YanHui LI JianDong 《Science in China(Series F)》 2009年第5期894-898,共5页
By constructing an accumulated-crossover relationship in multiple parallel concatenated single parity check (M-PC-SPC) codes, a class of error-correcting codes, termed multiple accumulated-crossover parallel concate... By constructing an accumulated-crossover relationship in multiple parallel concatenated single parity check (M-PC-SPC) codes, a class of error-correcting codes, termed multiple accumulated-crossover parallel concatenated single parity check (M-ACPC-SPC) codes, is proposed. M-ACPC-SPC codes possess linear encoding complexity and can be decoded iteratively with low complexity by the sum-product algorithm (SPA). Simulation results show that M-ACPC-SPC codes have lower error floors than M-PCSPC codes with the same dimension, and when the dimension is 5, M-ACPC-SPC codes achieve bit error rate (BER) better than (3, 6) regular low density parity check (LDPC) codes. 展开更多
关键词 parallel concatenated codes single parity check codes low density parity check codes iterative decoding
原文传递
之型码和级联之型码
4
作者 李明 曹家麟 +1 位作者 邓家梅 李坪 《通信学报》 EI CSCD 北大核心 2002年第4期22-28,共7页
本文介绍了一种新型的纠错码,称之为“之型码”。之型码可以形成非常简捷的软输入软输出译码规则。我们在Max-Log-MAP(MLM)译码方法的基础上提出了一种译码规则,这一译码规则的计算复杂度为每次迭代计算单位信息比特大约需要20次加法运... 本文介绍了一种新型的纠错码,称之为“之型码”。之型码可以形成非常简捷的软输入软输出译码规则。我们在Max-Log-MAP(MLM)译码方法的基础上提出了一种译码规则,这一译码规则的计算复杂度为每次迭代计算单位信息比特大约需要20次加法运算操作。在仿真实验中,我们用最优译码器和更简捷的次最优译码器进行译码时,其性能在误比特率为10-5处分别距香农理论极限仅0.9dB和1.4dB。此外,上述码字与2维turbo码相比具有更低的误码基底值 (error floor)。 展开更多
关键词 级联之型码 TURBO码 之型码 纠错码
下载PDF
Turbo Coded OFDM with Large Number of Subcarriers
5
作者 Spyridon K. Chronopoulos Giorgos Tatsis Panos Kostarakis 《Journal of Signal and Information Processing》 2012年第2期161-168,共8页
Wireless communication systems have greatly advanced during the last years. A significant contributor in these systems’ performance has been Orthogonal Frequency Division Multiplexing (OFDM). Since its invention, it ... Wireless communication systems have greatly advanced during the last years. A significant contributor in these systems’ performance has been Orthogonal Frequency Division Multiplexing (OFDM). Since its invention, it is considered to be a technological leap. This leap in splitting an information stream in multiple frequency carriers has been adapted by various scientists working on the development of wireless systems. Moreover, as OFDM presented excellent tolerance of channel fading and noise signals, the evolvement in terms of speed and reliability was consequent, because only a small stream of information is lost due to noise effects. OFDM along with the knowledge that Turbo codes is another excellent scheme of reducing BER, has triggered us to expand our research. So, we experimented in simulation level not only in joining OFDM with Turbo Codes but even in finding a better Turbo scheme compared to a typical PCCC, SCCC and a Convolutional encoder with Viterbi decoder. As the last goal has already been accomplished, in this paper is presented the new OFDM system consisted of our Turbo scheme. The analysis of the previous system took into consideration the effects of an AWGN channel. Also, this noise analysis was conducted using a simulation platform with specific attributes such as transmitting and receiving fixed number of subcarriers (2048 carriers after IFFT block) while using different types of convolutional concatenated codes, such as PCCC (Parallel), SCCC (Serial) and the new PCCC scheme. The results clearly show not only the improvement in the BER performance of the Turbo Coded OFDM systems (compared to others consisted of Viterbi decoders) but the overall superiority of the proposed design. 展开更多
关键词 Orthogonal Frequency Division Multiplexing Cyclic PREFIX Zero PADDING Turbo CODES parallel Convolutional concatenATED CODES SERIAL Convolutional concatenATED CODES Iterative Decoding Noise Variance
下载PDF
Reducing Peak-to-Average Power Ratio of a Turbo Coded OFDM
6
作者 Spyridon K. Chronopoulos Vasilis Christofilakis +1 位作者 Giorgos Tatsis Panos Kostarakis 《Wireless Engineering and Technology》 2012年第4期195-202,共8页
Peak to Average Power Ratio (PAPR) is defined as the instantaneous power (maximum value) to the average power ratio. PAPR is considered to be a major problem in OFDM systems. This problem can cause radical unexpected ... Peak to Average Power Ratio (PAPR) is defined as the instantaneous power (maximum value) to the average power ratio. PAPR is considered to be a major problem in OFDM systems. This problem can cause radical unexpected behavior of the signal fluctuation. This fluctuation is constituted by a large number of power states. The enormous number of these states leads to an additional complexity of ADCs and DACs. This research addresses the previous problem in OFDM systems utilizing Turbo Codes. μLaCP technique is employed for the purpose of decreasing PAPR. Moreover, our OFDM system was simulated in the presence of an AWGN channel with four types of codes (without the presence of ADCs and DACs). These were constituted of PCCC (typical and new), SCCC, and Convolutional Codes. Our Turbo Coded OFDM exhibited unchanged BER performance before and after the use of μLaCP technique. This was accomplished by modifying our previous PAPR reduction technique without sacrificing greatly its attributes. 展开更多
关键词 Orthogonal Frequency Division Multiplexing PEAK to Average Power RATIO μ-Law μLaCP μLaIF parallel concatenATED Convolutional Codes A POSTERIORI Probability Cyclic PREFIX Zero PADDING PEAK RATIO Bit Error Rate
下载PDF
并行级联分组码基于相关运算的叠加反馈译码 被引量:1
7
作者 彭万权 《计算机仿真》 CSCD 北大核心 2009年第6期348-351,共4页
并行级联分组码和串行级联分组码均可实现基于LLR计算的Turbo迭代译码,但前者具有更高的码率。将接收信息与子译码器的输出软信息进行线性叠加反馈能在省去繁琐的LLR计算的情况下实现并行级联分组码的Turbo迭代译码,仅通过对译码器的输... 并行级联分组码和串行级联分组码均可实现基于LLR计算的Turbo迭代译码,但前者具有更高的码率。将接收信息与子译码器的输出软信息进行线性叠加反馈能在省去繁琐的LLR计算的情况下实现并行级联分组码的Turbo迭代译码,仅通过对译码器的输出进行简单的相关运算以及对Chase2译码算法进行适当的改进便可获得接近LLR算法的译码性能。仿真研究验证了算法的有效性。 展开更多
关键词 并行级联分组码 迭代译码 相关运算 线性叠加
下载PDF
并行级联卷积码基于软输入硬输出的迭代译码
8
作者 彭万权 《邵阳学院学报(自然科学版)》 2017年第2期23-26,31,共5页
以递归卷积系统码为分量码构造的并行级联卷积码具有优良的距离特性,本文提出一种新的迭代译码算法,通过引入校正因子α(n)和β(n),对viterbi译码输出和原始接收信息进行线性叠加,从而将当前的硬判决译码输出转化为下一次译码的软输入... 以递归卷积系统码为分量码构造的并行级联卷积码具有优良的距离特性,本文提出一种新的迭代译码算法,通过引入校正因子α(n)和β(n),对viterbi译码输出和原始接收信息进行线性叠加,从而将当前的硬判决译码输出转化为下一次译码的软输入。仿真结果表明,该算法与乘积码相比,具有更强的纠错性能和更快的译码速度。 展开更多
关键词 递归系统卷积码 并行级联卷积码 迭代译码 校正因子
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部