Font Size: a A A

Research On Parameter Identification Of Reed-Solomon Codes Based On Soft-selection Tactics

Posted on:2024-04-08Degree:MasterType:Thesis
Country:ChinaCandidate:X Q LiFull Text:PDF
GTID:2568306941498374Subject:Information and Communication Engineering
Abstract/Summary:PDF Full Text Request
Blind recognition technology of channel coding is the basis for information acquisition in the fields of intelligent communication and non-cooperative communication.How to analyze and identify the parameters of channel coding in the intercepted limited information sequence,and then complete the recovery of the original information data,is an urgent problem to be solved.RS(Reed Solomon)code is a M-ary error-correction code and is used widely.Parameter identification of RS codes and interleaved RS codes is studied in this paper.To solve the high missed alarm probability and high complexity of conventional identification algorithms of RS codes,the concept of parameter soft-selection tactics is proposed.Additionally,the improved parameter identification algorithms of RS codes and interleaved RS codes based on softselection tactics for the two types of algorithms in the above two cases are proposed.Parameter identification algorithm of RS codes based on the distribution characteristics of code roots is used in the case without interleaving.This algorithm has better noise resistance compared to other algorithms.Additionally,a parameter identification algorithm of RS codes based on soft-selection tactics is proposed to reduce the high missed alarm probability and the high complexity of code roots trial in the case of short codes in the original algorithm.Firstly,the check relationship is solved in binary equivalently.Then,fast code root trial is used to acquire the distribution characteristics of code roots and the parameters are checked in sequence.Secondly,the theoretical threshold is derived by utilizing the distribution characteristics of the combined code roots.m-level primitive polynomial field and error-correction ability was associatively determined.Finally,the short codes and long codes were given different confidence weights.The undetermined parameters are associatively determined by softselection tactics based on non-singular extremum.The simulation results show that the proposed algorithm can effectively reduce the missed alarm probability under the condition of low complexity.Compared with the conventional algorithm,the performance of the proposed algorithm is improved.Parameter identification algorithm of RS codes based on Gaussian elimination is used in the case with interleaving.The independent related columns of the analysis matrix can still be obtained through Gaussian elimination processing in the case of misaligned codewords.The computational dimension of cyclic traversal symbol offset is reduced.Additionally,the parameter identification algorithm based on soft-selection tactics is proposed to solve the issues of low robustness and high complexity of the original algorithm.Firstly,a normalized determination coefficient measure method is defined to characterize the linear correlation column features of the analysis matrix.Secondly,the parameter identification algorithm of softselection tactics based on maximum common factor of maximum probability is introduced.The parameter combinations are screened twice.Finally,the algorithm of fast code root trial is also used to estimate the interleaving parameters.The encoding domain,code length,interleaving period,interleaving parameters,and symbol offset are associatively determined.The simulation results show that the proposed algorithm performs better and uses less data and computation compared to the original algorithm.In summary,the parameter identification algorithm based on soft-selection tactics is different from previous threshold judgment methods.It has stronger robustness and good adaptability which does not require prior information such as signal-to-noise ratio(SNR).
Keywords/Search Tags:Parameter Identification of RS Codes, Soft-Selection Tactics, Fast Code Root Trial, Missed Alarm Probability, Maximum Common Factor of Maximum Probability
PDF Full Text Request
Related items