共查询到19条相似文献,搜索用时 93 毫秒
1.
2.
3.
针对Reed-Solomon(RS)码译码过程复杂、译码速度慢和专用译码器价格高等问题,以联合信息分发系统终端J系列报文信息位采用的RS(31,15)码为例,介绍了基于改进的无求逆运算的Berlekamp-Massey(BM)迭代算法的RS译码原理,采用Verilog硬件描述语言对译码器中各个子模块进行了设计,并基于现场可编程门阵列平台,在QuartusII6.0环境下进行了仿真,验证了RS译码器的纠错能力,实现了参数化与模块化的RS译码器设计。 相似文献
4.
5.
6.
7.
8.
9.
LTE中基于发送分集预编码的译码算法 总被引:1,自引:0,他引:1
主要研究了LTE系统中基于发射分集预编码的接收端译码算法。提出了在接收端采用的最大似然(ML)译码算法和最小均方误差(MMSE)译码算法,对这2种译码算法原理进行了分析,并对其性能进行了仿真和比较。仿真结果表明最大似然译码算法的性能比最小均方误差译码算法的性能要好,但LTE中基于空间复用的预编码在接收端可以采用最小均方误差算法进行译码,因此,如果接收端采用最小均方误差译码方案就可以对2种预编码方案进行译码,简化接收端译码的复杂度。 相似文献
10.
为了改善采用低密度奇偶校验(LDPC)码和高阶调制的无线通信系统在相关噪声下的译码性能,提出了一种联合优化降噪和译码的深度学习算法。降噪器中采用了残余收缩模块(RSBU),译码器采用了基于循环神经网络的神经网络最小和译码算法。在提出的联合降噪译码(JDD)算法中,利用复数神经网络在处理复信号方面比实数神经网络更有优势的特点,提出了一个复数RSCNN(CRSCNN),接收的复信号直接输入CRSCNN并利用新颖的联合优化降噪损失函数和译码损失函数的多任务学习策略来改善译码性能。仿真结果显示基于CRSCNN的JDD算法获得了比基于循环神经网络的神经网络最小和译码算法更好的译码性能。 相似文献
11.
由于传统的LLR BP译码算法不易于FPGA实现,为了降低实现复杂度,采用一种改进的LLR BP译码实现方法,设计了一种码长为40、码率为0.5的规则LDPC码译码器,并完成了FPGA仿真实现.仿真和综合的结果表明,所设计的译码器吞吐量达到15.68 Mbit/s,且译码器的资源消耗适中. 相似文献
12.
13.
Jyh-Horng Jeng Trieu-Kien Truong 《Communications, IEEE Transactions on》1999,47(10):1488-1494
In a previous article by Truong et al. (see ibid., vol.46, p.973-76, 1998), it was shown that an inverse-free Berlekamp-Massey (1968, 1969) algorithm can be generalized to find the error locator polynomial in a Reed-Solomon (RS) decoder for correcting errors as well as erasures. The basic idea of this procedure is the replacement of the initial condition of an inverse-free BM algorithm by the Forney (1965) syndromes. It is shown that the errata locator polynomial can be obtained directly by initializing an inverse-free BM algorithm with the erasure locator polynomial and the syndromes. An important ingredient of this new algorithm is a modified BM algorithm for computing the errata locator polynomial. As a consequence, the separate computation of the erasure locator polynomial and the Forney syndrome, needed in the decoder developed by Truong et al., are completely avoided in this modification of the BM algorithm. This modified algorithm requires fewer finite field addition and multiplication operations than the previous algorithm. Finally, the new decoding method was implemented on a computer using C++ language. It is shown in a simulation that the speed of this new decoder is faster than the decoder developed by Truong et al. An example using this program is given for an (255, 239) RS code for correcting errors and erasures with 2ν+s⩽10 相似文献
14.
15.
高速Reed-Solomon解码器及其FPGA的实现 总被引:2,自引:0,他引:2
提出了一种高速流水线型Reed-Solomon(RS)解码器,该解码器在Berlekamp-Massey(BM)原理基础上加以改进后更适宜用硬件描述语言(HDL)来描述并用FPGA来实现,时序仿真表明该解码器的最高时钟频率可达30MHz。对RS解码器的总体结构作了概述,并对校正子、乘法电路及改进的BM迭代作了较为详细的叙述。最后简单介绍了Xilinx的FPGA芯片的基本结构。 相似文献
16.
Low-density parity-check (LDPC) codes and convolutional Turbo codes are two of the most powerful error correcting codes that
are widely used in modern communication systems. In a multi-mode baseband receiver, both LDPC and Turbo decoders may be required.
However, the different decoding approaches for LDPC and Turbo codes usually lead to different hardware architectures. In this
paper we propose a unified message passing algorithm for LDPC and Turbo codes and introduce a flexible soft-input soft-output
(SISO) module to handle LDPC/Turbo decoding. We employ the trellis-based maximum a posteriori (MAP) algorithm as a bridge between LDPC and Turbo codes decoding. We view the LDPC code as a concatenation of n super-codes where each super-code has a simpler trellis structure so that the MAP algorithm can be easily applied to it.
We propose a flexible functional unit (FFU) for MAP processing of LDPC and Turbo codes with a low hardware overhead (about
15% area and timing overhead). Based on the FFU, we propose an area-efficient flexible SISO decoder architecture to support
LDPC/Turbo codes decoding. Multiple such SISO modules can be embedded into a parallel decoder for higher decoding throughput.
As a case study, a flexible LDPC/Turbo decoder has been synthesized on a TSMC 90 nm CMOS technology with a core area of 3.2 mm2. The decoder can support IEEE 802.16e LDPC codes, IEEE 802.11n LDPC codes, and 3GPP LTE Turbo codes. Running at 500 MHz clock
frequency, the decoder can sustain up to 600 Mbps LDPC decoding or 450 Mbps Turbo decoding. 相似文献
17.
18.
Multiple-Input-Multiple-Output communication systems demand fast sphere decoding with high performance. To speed up the computation,
we propose a scheme with multiple fixed complexity sphere decoders to construct a parallel soft-output fixed complexity sphere
decoder (PFSD). The proposed decoder is highly parallel and has performance comparable to soft-output list fixed complexity
sphere decoder (LFSD) and K-best sphere decoder. In addition, we propose a parallel QR decomposition algorithm to lower the preprocessing overhead, and
a low complexity LLR algorithm to allow parallel update of LLR values. We demonstrate that the PFSD algorithm can increase
the throughput and reduce bit error rate of a soft-output solution in a 4 × 4 16-QAM system, and has superior performance
compared to other soft decoders with comparable throughput and computation complexity. The PFSD algorithm has been mapped
onto Xilinx XC4VLX160 FPGA. The resulting PFSD decoder can achieve up to 75 Mbps throughput for 4 × 4 64-QAM configuration
at 100MHz with low control overhead. 相似文献
19.
介绍了运用于RS译码中的BM迭带算法及利用BM迭带进行RS译码的基本原理,同时给出了该算法的FPGA实现,并通过在高清晰度数字电视接收机中验证了设计的可行性与可靠性。 相似文献