缩短RS码的伽罗华域傅里叶变换识别方法
作者:
作者单位:

作者简介:

通讯作者:

基金项目:

中国工程物理研究院科学技术发展基金—基于异构体系架构的高性能信号处理技术研究(2015B0403087)

伦理声明:



Shortened RS code recognition based on Galois Field Fourier Transform
Author:
Ethical statement:

Affiliation:

Funding:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
    摘要:

    为了解决缩短里德-所罗门(RS)码的识别问题,提出一种基于任意长度伽罗华域傅里叶变换(GFFT)的识别方法。把限定长度GFFT拓展到任意长度,在阶数、本原多项式、码长三个维度上计算缩短RS码GFFT谱,统计谱累积量;再根据谱累积量的概率分布确定判决阈值,并进行判决,从而实现缩短RS码编码参数的识别。仿真结果表明,当阶数不大于8,误比特率不大于0.001时,采用文中识别方法可实现不小于99%的正确识别率。

    Abstract:

    In order to recognize the shortened Reed-Solomon(RS) code, a recognition method based on the Galois domain Fourier transform of arbitrary length is proposed. Firstly, the limited length of the Galois Field Fourier Transform(GFFT) is extended to any length, then the GFFT spectrum of the shortened RS code is calculated for different orders, primitive polynomial and code length, and the spectral cumulant is calculated; then the decision threshold value is determined according to the probability distribution of the spectral cumulant, and the decision is made so as to realize the identification of the coding parameters of the shortened RS code. The simulation results show that when the order is no more than 8 and the bit error rate is no more than 0.001, the correct recognition rate is no less than 99%.

    参考文献
    相似文献
    引证文献
引用本文

王甲峰,吴 辉,蒋鸿宇,胡茂海.缩短RS码的伽罗华域傅里叶变换识别方法[J].太赫兹科学与电子信息学报,2020,18(1):116~122

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
历史
  • 收稿日期:2018-04-15
  • 最后修改日期:2018-05-15
  • 录用日期:
  • 在线发布日期: 2020-02-28
  • 出版日期:
关闭