M元扩频信号的S码软判决译码算法研究与FPGA设计.pdfVIP

摘 要 M 元扩频信号相对于二元扩频信号具有更低的解调门限和更强的抗检测能 力。本文在研究 Reed-Solomon （RS ）码各种译码算法的基础上，提出了一种适合 M 元扩频信号的 RS 码软判决译码算法，完成了该算法的 FPGA 设计。主要内容如 下： 1．介绍了M 元扩频相关理论、RS 码的编码原理、译码原理及几种常见的 RS 码软判决译码算法。 2 ．在研究Chase 译码算法的基础上，提出了一种基于 M 元扩频信号的Modified Chase RS 码软判决译码算法。仿真结果表明该算法与 GMD （Generalized minimum distance ）、KV （koetter-vardy ）等译码算法相比，具有更好的译码性能。 3. 完成了基于 M 元扩频信号的 Modified Chase 算法 FPGA 设计，测试结果表 明功能达到设计要求。 关键词：Reed-Solomon 码 M 元扩频 Modified Chase 译码 FPGA 设计 Abstract Compared to binary-ary spread spectrum signal, M-ary spread spectrum signal has lower demodulation threshold and better anti-detection capability. Through studying several soft-decision decoding algorithms of RS codes, this thesis proposes a soft-decision decoding algorithm based on chase decoding algorithm for M-ary spread spectrum signal and implements the algorithm with FPGA. The main contents are as follows: 1. The principle of M-ary spread spectrum is introduced. The encoding and decoding principles of RS codes and several soft-decision decoding algorithms are studied. 2. A modified chase decoding algorithm for M-ary spread spectrum signal is proposed. Simulation results demonstrate the good performance of this algorithm compared with the GMD (Generalized minimum distance ）and KV （koetter-vardy ） decoding algorithm. 3. The modified chase decoding algorithm is implemented with FPGA, and the simulation results show that it satisfies design requirements. Keywords: Reed-Solomon codes M-ary spread spectrum Modified chase decoding FPGA design