CN109861792A - BCH code blind identification method for coding parameters, interpretation method and satellite communication apparatus - Google Patents
BCH code blind identification method for coding parameters, interpretation method and satellite communication apparatus Download PDFInfo
- Publication number
- CN109861792A CN109861792A CN201910074466.9A CN201910074466A CN109861792A CN 109861792 A CN109861792 A CN 109861792A CN 201910074466 A CN201910074466 A CN 201910074466A CN 109861792 A CN109861792 A CN 109861792A
- Authority
- CN
- China
- Prior art keywords
- test
- code
- deviation
- bch code
- synchronism deviation
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Withdrawn
Links
Abstract
The invention discloses BCH code blind identification method for coding parameters, interpretation method and satellite communication apparatus, wherein, the code length of BCH code is first identified from minimal polynomial using the coding characteristic of BCH code, the code length based on BCH code identifies synchronism deviation again, generator polynomial is finally identified based on the code length and synchronism deviation identified, realizes the blind recognition of BCH code coding parameter.The present invention provides a kind of completely new methods to realize blind recognition, obtain more accurate blind recognition result.
Description
Technical field
The invention belongs to BCH code identification technology fields, and in particular to a kind of BCH code blind identification method for coding parameters is based on
The interpretation method and DVB-S2 satellite communication apparatus of BCH code coding parameter.
Background technique
Channel coding blind recognition is the key technology for realizing Adaptive Modulation and Coding, communication countermeasure, practical application value
Extensive concern both domestic and external is received, research is carried out to it and is had very important significance, BCH code is common linear point of one kind
Group code has the characteristics that error correcting capability is strong, Algebraic Structure is fixed and code construction is simple, is based on DVB-S2 Satellite Communication Receive
In system just use BCH code, it is carried out coding blind recognition timely study, can make intelligence communication field receiving end such as
What quickly and effectively identifies that coding parameter and modulation parameter guarantee that system communication is gone on smoothly according only to the information received；
And in cognition wireless electrical domain, end subscriber is received by channel coding blind recognition technology and identifies that the coding that transmitting terminal uses is joined
Correct decoding is counted and completed, is passed then needing the coding parameter information transmitted that can not need busy channel resource originally
It passs, to save the spectrum efficiency that limited frequency spectrum resource improves system.
However, combining existing method in linear block codes to be assisted in identifying about BCH code blind recognition at present more.Especially
About the identification of cyclic code code length, the matrix analysis gimmick in the identification of still block code that most document considers, such bring
One defect is that fault-tolerant ability is not high, and requires data volume huge.In addition, also having and being still for after cyclic code cyclic shift
The cycle characteristics of one effective code word, consideration carry out cyclic shift after being grouped all data by testing length, then ask most
The mode of big common factor formula carries out the identification of cyclic code, seeks maximum common divisor from implementation complexity to multiple multinomials to analyze
It is more complicated.The more of identification about BCH code is the treating method based on code root information difference entropy, and is assumed that in domain
Each element is identical for the probability of random number polynomial root, but is the general of its root in practice for each element in domain for random number polynomial
Rate is different.The recognition methods of BCH code includes following several:
(1) the BCH code recognition methods based on code root information difference entropy, the method for the information gap entropy are then utilized by multidigit scholar
Conducive to identification BCH code code length and other parameters, but this aspect assumes that each element is the probability of random number polynomial root in domain
Identical, but actually since external disturbance exists, each element is the probability of its root is not phase in domain for random number polynomial
With；
(2) the primitive BCH code blind identification method for coding parameters based on probabilistic approximation, by searching for simultaneously benefit between different domains
The root of domain and generator polynomial where determining coding with the continuity of generator polynomial root is to complete the identification of code word, equally
Text in algorithm assume that and realize under the conditions of ideal synchronisation that influence of the synchronism deviation to algorithm is not made to consider.Actual
In blind recognition scene, due to the interference of the factors such as noise, the validity of algorithm identified above with the presentation of certain probability, will reach
Best identified must pointedly provide optimal judgement circle under noise circumstance, and not perform an analysis to the boundary in document above.
In summary, existing scheme is partial to ecotopia and gets off realization, does not consider exist in practical application scene
The interference of noise, therefore the accuracy of blind recognition need to be improved.
Summary of the invention
The object of the present invention is to provide a kind of completely new BCH code blind identification method for coding parameters, while additionally providing and being based on
The interpretation method of the BCH code coding parameter identified, and the satellite communication apparatus based on BCH code.Its volume based on BCH code
Code is specific, searches for whole minimal polynomials of composition BCH code generator polynomial from minimal polynomial to realize that code length, frame are same
The blind recognition for walking deviation, generator polynomial reduces environment by introducing judgement circle and selecting the principle for dividing exactly maximum probability
Influence of the noise jamming to blind recognition result.
A kind of BCH code blind identification method for coding parameters, includes the following steps:
S1: length is the sequence of l as target sequence in interception BCH code code stream sequence；
S2: initialization domain exponent m, and the value range for being determined based on domain exponent m and testing code length n, test synchronism deviation dt
And the current field GF (2m) in minimal polynomial；
Wherein, the current field GF (2m) in minimal polynomial set Γ indicate are as follows: Γ={ mi(x) }, i=1,2 ..., t, mi
It (x) is i-th of minimal polynomial, t is the number of minimal polynomial, tests code length n are as follows: n=2m- 1, test synchronism deviation dt's
Value range are as follows: 1≤dt≤n；
S3: the corresponding the current field GF (2 of domain exponent m is foundm) all minimal polynomials in whether there is minimal polynomial
Divide exactly the corresponding codeword polynome c of analysis matrix Xj(x), when j=1,2 ..., M, divided evenly codeword polynome cj(x) number
More than or equal to default judgement circle Ti；
Wherein, by d preceding in target sequencetBit is deleted to be grouped remaining bits to obtain M group according still further to test code length n
Bit, the analysis matrix X are made of the M group bit, and the corresponding codeword polynome c of every group of bitj(x),
It indicates to be rounded symbol downwards；；If it does not exist, test synchronism deviation d is updatedtAnd/or it updates
Domain exponent m, until the corresponding the current field GF (2 of domain exponent mm) minimal polynomial in there are minimal polynomial divide exactly test synchronize
Deviation dt, the corresponding analysis matrix X of domain exponent m codeword polynome cj(x) when, divided evenly codeword polynome cj(x) number
More than or equal to default judgement circle Ti；
If it exists, the corresponding code length n of the current field exponent m is the code length of BCH code to be identified；
S4: test synchronism deviation d is obtained based on the domain exponent m met when dividing exactly condition in S3tTest scope, then be based on
The current field GF (2m) minimal polynomial and test scope in each test synchronism deviation dtThe code word of correspondence analysis matrix X is multinomial
Formula cj(x) probability of dividing exactly obtains substantial synchronization deviation；
Wherein, analysis matrix X corresponding test synchronism deviation d when dividing exactly maximum probabilitytFor substantial synchronization deviation；
S5: based on the substantial synchronization deviation restructuring analysis matrix X identified in the code length and step S4 identified in step S3,
By the current field GF (2m) each minimal polynomial respectively with the codeword polynome c of analysis matrix Xj(x) divisibility relation is carried out to test
Card；
Wherein, if the codeword polynome c of minimal polynomial aliquot analysis matrix Xj(x) when, divided evenly code word is multinomial
Formula cj(x) number is greater than or equal to default judgement circle Ti, then the minimal polynomial is stored in set Ξ；
S7: whole element multiplications in set Ξ are obtained into the generator polynomial g (x) of BCH code to be identified.
The present invention is based on the construction features that the coding characteristic of BCH code makes full use of its generator polynomial, from minimal polynomial
Angle set out to realize blind recognition, provide a kind of method of completely new blind recognition.For code length, the present invention is based on " principle:
If miIt (x) is GF (2m) on a d minimal polynomial, and miIt (x) is GF (2m) on [n, k] binary system primitive BCH code generate it is multinomial
The factor of formula g (x), then mi(x) this principle of certain aliquot codeword polynome c (x) ", and due to noise in propagation channel
Influence, might have error bit appearance in the sequence intercepted, so even if in the case where domain exponent m is correct, due to noise
Interference may be searched for also less than the minimal polynomial for meeting whole divisibility relations, for this purpose, the present invention is multinomial according to whole minimums
Formula mi(x) a judgement circle T is introducediIf the number N of divided evenly codeword polynomei≥Ti, then it is assumed that minimal polynomial mi
(x) be target BCH code sequence generator polynomial a factor, i.e. minimal polynomial mi(x) more for the minimum to be found
Item formula, and then determining domain exponent m is obtained, code length n is determined according to domain index；Again due to cyclic code cyclic shift characteristic,
So that the code length being previously obtained be it is correct and test synchronism deviation may inaccuracy, even if so code length is correct in step S3
When, test synchronism deviation dtIt may not be substantial synchronization deviation, therefore the present invention is based on synchronizations corresponding when dividing exactly maximum probability
Deviation is that the probability of substantial synchronization deviation is bigger, therefore the present invention determines substantial synchronization deviation according to maximum probability is divided exactly, according to
The domain exponent m uniquely determined determines the value range of synchronism deviation, then is directed to every kind of value creation analysis matrix, finally according to whole
Substantial synchronization deviation is determined except probability；Unique analysis square finally can be determined based on the code length and synchronism deviation that identify
Battle array, then the divisibility relation based on minimal polynomial codeword polynome corresponding with analysis matrix identify BCH code generator polynomial
Factor, then be multiplied based on the factor that identifies and calculate the generator polynomial of BCH code.
It should be noted that due to the influence of noise in propagation channel, be bound to wrong errored bit in the sequence that intercepts
Occur, so that even if may also search for less than the minimal polynomial for meeting whole divisibility relations, pass through under right domain exponent m
Boundary T is adjudicated in the decision rule of one flexibilityiIdentify minimal polynomial whether be generator polynomial factor, be by existing
Technology is come what is obtained, and judgement circle is usually to consider minimum probability criterion, and false probability, false dismissal probability, interchannel noise etc. derive
Out.
Further preferably, the implementation procedure of step S3 is as follows:
S31: according to test synchronism deviation dtValue range obtain test synchronism deviation dtInitial value, and surveyed based on current
Try code length n and test synchronism deviation dtInitial value construct current analysis matrix X；
S32: judge the current field GF (2m) all minimal polynomials in currently divide with the presence or absence of minimal polynomial aliquot
Analyse the corresponding codeword polynome c of matrix Xj(x) when, divided evenly codeword polynome cj(x) number is greater than or equal to default judgement
Boundary Ti；
If so, the corresponding code length n of the current field exponent m is the code length of BCH code to be identified；If no, executing S33；
S33: judge the corresponding test synchronism deviation d of the current field exponent mtValue range in whether there is also test synchronize
Deviation dtThe identification in S32 is not carried out；
If it exists, based on test synchronism deviation dtValue range update test synchronism deviation dt, then the test based on update
Synchronism deviation dtRestructuring analysis matrix X, returns again to the judgement of step S32；
S33: if it does not exist, more neofield exponent m, then the domain exponent m based on update updates test code length n, test synchronizes partially
Poor dtValue range and the current field GF (2m) in minimal polynomial, return again to step S31.
Further preferably, the implementation procedure of step S4 is as follows:
S41: test synchronism deviation d is obtained based on the domain exponent m met when dividing exactly condition in S3tTest scope；
S42: synchronism deviation d is tested in construction step S41 respectivelytTest scope in each test synchronism deviation dtPoint
Analyse matrix X；
S43: the corresponding the current field GF (2 of domain exponent m when dividing exactly condition in S3 will be metm) in each minimal polynomial point
Codeword polynome c not corresponding with each analysis matrix X in step S42j(x) carry out dividing exactly calculate each minimal polynomial with
Divide exactly probability between each analysis matrix X；
The formula for dividing exactly probability is as follows:
Pr (u)=Nu/ M, 1≤(dt=u)≤n
Wherein, Pr (u) is a minimal polynomial mi(x) with test synchronism deviation dtBetween analysis matrix X when for u
Divide exactly probability, NuFor a minimal polynomial mi(x) aliquot tests synchronism deviation dtThe corresponding generation of analysis matrix X when for u
Multinomial cj(x) number.
Second aspect, the present invention also provides a kind of interpretation methods based on above-mentioned blind-identification method, include the following steps:
Step 1: receiving BCH code and therefrom intercepted length is the sequence of l as target sequence；
Step 2: inclined using the code length n of any one of the claim 1-4 blind-identification method identification BCH code, substantial synchronization
Difference, generator polynomial g (x)；
Step 3: code length n, substantial synchronization deviation, generator polynomial g (x) based on the BCH code identified in step 2 are to real-time
Received BCH code is decoded.
The third aspect, the present invention also provides a kind of satellite communication apparatus based on above-mentioned interpretation method, including are connected with each other
Demodulator, blind recognition device and the channel decoder of communication；
Wherein, the BCH code to be decoded and demodulation that demodulator is sent by satellite reception transmitting terminal are sent to channel decoding
Device；
The blind recognition device, for BCH code sequence that intercepted length is l as target sequence, and based on claim 1-4
The code length n of described in any item blind-identification method processing target retrieval identification BCH codes, substantial synchronization deviation, generation are multinomial
Formula g (x)；
The channel decoder, code length n, substantial synchronization deviation, generator polynomial g (x) for the BCH code based on identification
The BCH code of real-time reception is decoded.
Further preferably, the satellite communication system is DVB-S2 satellite communication system.
Beneficial effect
The present invention is based on the construction features that the coding characteristic of BCH code makes full use of its generator polynomial, from minimal polynomial
Angle set out, realize blind recognition using the whole minimal polynomials that search constitutes BCH code generator polynomial, provide one kind
The method of completely new blind recognition, and this method can identify code length, synchronism deviation and generator polynomial.Algorithm is in identity
It can go up compared to existing algorithm by being improved, and be directed to the identification of synchronization parameter, avoid the two dimension time taken in conventional method
Method is gone through, greatly reduced algorithm implementation complexity.Especially the present invention is that electromagnetic environment complexity, noise are dry in satellite communication
The blind recognition scheme for disturbing the BCH code carried out under complex situations by setting judgement circle and divides exactly the principle of maximum probability and drops
The influence of low noise.
Detailed description of the invention
Fig. 1 is that code length provided by the invention obtains process；
Fig. 2 is that synchronism deviation provided by the invention obtains process；
Fig. 3 is the acquisition process of generator polynomial provided by the invention；
Fig. 4 is the schematic diagram provided by the invention for receiving sequence；
Fig. 5 is the schematic diagram of target sequence provided by the invention；
Fig. 6 is the schematic diagram of analysis matrix provided by the invention；
Fig. 7 is the configuration diagram of satellite communication system provided by the invention.
Specific embodiment
Below in conjunction with embodiment, the present invention is described further.
As shown in Figure 1, Figure 2 and shown in Fig. 3, a kind of BCH code blind identification method for coding parameters provided by the invention, including it is as follows
Step:
S1: length is the sequence of l as target sequence in interception BCH code code stream sequence.
S2: initialization domain exponent m, and test code length n, test synchronism deviation d are determined based on domain exponent mtValue range
And the current field GF (2m) in minimal polynomial.
Synchronism deviation refers to first of reception first bit of sequence and first complete code (including containing wrong situation)
The distance between bit.It is made of as shown in figure 4, receiving sequence a series of code word that code lengths are n, receives first of sequence
Bit is c1, i, first complete code is (c2,1, c2,2..., c2, n), then corresponding synchronism deviation dsFor bit c1, iTo bit
c2,2The distance between, as shown in Figure 4.It can be seen that dsValue range be 0≤ds< n, wherein ds=0 indicates no synchronism deviation.
As shown in figure 5, intercepting and capturing sequence is target sequence, in order to calculate synchronism deviation, setting test synchronism deviation dt,
Synchronism deviation d will be tested in target sequencetPart is deleted, and remainder sequence is analyzed.
The current field GF (2m) in minimal polynomial set Γ indicate are as follows: Γ={ mi(x) }, i=1,2 ..., t, miIt (x) is the
I minimal polynomial, t are the number of minimal polynomial, test code length n are as follows: n=2m- 1, test synchronism deviation dtValue range
Are as follows: 1≤dt≤n。
S3: the corresponding the current field GF (2 of domain exponent m is foundm) all minimal polynomials in whether there is minimal polynomial
The corresponding N of aliquot analysis matrix XiAll codeword polynome cj(x), j=1,2 ..., M.NiMore than or equal to default judgement
Boundary Ti, i.e., divided evenly codeword polynome cj(x) number NiMore than or equal to default judgement circle TiWhen, be treated as it is corresponding most
Small multinomial is target minimal polynomial, and concrete implementation process is as follows:
S31: according to test synchronism deviation dtValue range obtain test synchronism deviation dtInitial value, and surveyed based on current
Try code length n and test synchronism deviation dtInitial value construct current analysis matrix X.
As shown in fig. 6, synchronism deviation d will be tested with deleting in target sequencetAnalysis part structural analysis matrix afterwards, this
In embodiment, the size of analysis matrix X is M × n, i.e., is grouped to obtain M group ratio according to sequence of the code length n to analysis part
Spy, then by the M group bit arrangement at analysis matrix X.The corresponding codeword polynome c of every group of bitj(x),It indicates to be rounded symbol downwards.
Thus, it can be known that analysis matrix X is and test synchronism deviation dt, code length n it is relevant, therefore once test synchronism deviation
dtOr the variation of domain exponent m, then corresponding analysis matrix X also changes.
In the present embodiment, it is first determined domain exponent m determines test synchronism deviation d further according to domain exponent mtValue range,
And be first minimized, as in the present embodiment when parameter initialization, domain exponent m=mmin, a length of n=2 of test patternsm- 1, synchronism deviation
1≤d of ranget≤ n, and set initial testing value dt=1, synchronism deviation d is tested in subsequent updatetShi Ze is sequentially increased until value
For n.
S32: judge the current field GF (2m) all minimal polynomials in currently divide with the presence or absence of minimal polynomial aliquot
Analyse the corresponding N of matrix XiA codeword polynome cj(x)；
If so, the corresponding code length n of the current field exponent m is the code length of BCH code to be identified；If no, executing S33；
S33: judge the corresponding test synchronism deviation d of the current field exponent mtValue range in whether there is also test synchronize
Deviation dtThe identification in S32 is not carried out；
If it exists, based on test synchronism deviation dtValue range update test synchronism deviation dt, then the test based on update
Synchronism deviation dtRestructuring analysis matrix X, returns again to the judgement of step S32；
S33: if it does not exist, more neofield exponent m, then the domain exponent m based on update updates test code length n, test synchronizes partially
Poor dtValue range and the current field GF (2m) in minimal polynomial, return again to step S31.
After more neofield exponent m, code length n and test synchronism deviation dtIt is corresponding to update.It is further preferably set in the present embodiment
The maximum value m of domain exponent m is setmaxIf domain exponent m is in mmin-mmaxIn the range of still do not find the minimum for meeting above-mentioned condition
Multinomial regards the target sequence of interception then as primitive BCH code in non-test range.
To sum up step S31-S33 is updated in the present embodiment according to process as shown in Figure 1, that is, determines domain exponent m
Afterwards, dtGradually it is incremented by [1, n] to search whether the minimal polynomial for meeting above-mentioned condition in its value range；If no
It finds, then more neofield exponent m, domain exponent m is also gradually incremental.
S4: test synchronism deviation d is obtained based on the domain exponent m met when dividing exactly condition in S3tTest scope, then be based on
The current field GF (2m) minimal polynomial and test scope in each test synchronism deviation dtThe code word of correspondence analysis matrix X is more
Item formula cj(x) probability of dividing exactly obtains substantial synchronization deviation.Wherein, the corresponding test of analysis matrix X is same when dividing exactly maximum probability
Walk deviation dtFor substantial synchronization deviation.
Process as shown in Figure 2, available arrive tests synchronism deviation d after determining domain exponent mtTest scope, at this
In test scope value and corresponding analysis matrix X is constructed respectively respectively；
By the corresponding the current field GF (2 of domain exponent mm) most descend multinomial code word corresponding with each analysis matrix X respectively
Multinomial, which is divided exactly to obtain, divides exactly probability:
Pr (u)=Nu/ M, 1≤(dt=u)≤n
Wherein, Pr (u) is a minimal polynomial mi(x) with test synchronism deviation dtBetween analysis matrix X when for u
Divide exactly probability, NuFor a minimal polynomial mi(x) aliquot tests synchronism deviation dtThe corresponding generation of analysis matrix X when for u
Multinomial cj(x) number.
Finally therefrom select it is maximum divide exactly the corresponding analysis matrix X of probability, test synchronism deviation at this time is considered as very
Real synchronism deviation, such as substantial synchronization deviation ds=u=argmax1≤u≤n(Pr(u))。
S5: based on the substantial synchronization deviation restructuring analysis matrix X identified in the code length and step S4 identified in step S3,
By the current field GF (2m) each minimal polynomial respectively with the codeword polynome c of analysis matrix Xj(x) divisibility relation is carried out to test
Card；
Wherein, if the codeword polynome c of minimal polynomial aliquot analysis matrix Xj(x) number is greater than or equal to default
Adjudicate boundary Ti, the minimal polynomial is stored in set Ξ；
S7: whole element multiplications in set Ξ are obtained into the generator polynomial g (x) of BCH code to be identified.
As shown in figure 3, in the current field GF (2m) minimal polynomial set in search meet judgement circle TiMinimal polynomial
mi(x), as initially enabled g ' (x)=1, the current field GF (2 is then successively traversed againm) minimal polynomial set in minimum it is multinomial
Formula, if cj(x), by m in (j=1,2 ..., M)i(x) number divided exactly is greater than or equal to judgement circle Ti, then g ' (x)=g ' (x) mi
(x)；Generator polynomial g (x)=g ' (x) after traversal.In conclusion the present invention provides a kind of completely new means to realize
The coding parameter identification of BCH code, specially code length, synchronism deviation and generator polynomial.In practical applications it is found that BCM code
Coding parameter blind recognition be communication process core content, can be according only to the information received quickly and effectively in receiving end
Coding parameter and modulation parameter are identified to guarantee that system communication is gone on smoothly；And in cognition wireless electrical domain, receiving end
User identifies the coding parameter of transmitting terminal use by channel coding blind recognition technology and completes correct decoding, then needing originally
The coding parameter information to be transmitted can not need busy channel resource and be transmitted, and mention to save limited frequency spectrum resource
The high spectrum efficiency of system.
Therefore, the present invention also provides a kind of interpretation method based on above-mentioned blind-identification method, include the following steps:
Step 1: receiving BCH code and therefrom intercepted length is the sequence of l as target sequence；
Step 2: using the code length n of above-mentioned blind-identification method identification BCH code, substantial synchronization deviation, generator polynomial g (x)；
Step 3: code length n, substantial synchronization deviation, generator polynomial g (x) based on the BCH code identified in step 2 are to real-time
Received BCH code is decoded.It should be appreciated that carrying out decoding to received BCH code based on the coding parameter of BCH code is this field
Common knowledge, the present invention is to this realization process without specifically describing.
It include being connected with each other the present invention also provides a kind of satellite communication apparatus as shown in figure 5, being based on above-mentioned blind-identification method
Demodulator, blind recognition device and the channel decoder of communication；
Wherein, the BCH code to be decoded and demodulation that demodulator is sent by satellite reception transmitting terminal are sent to channel decoding
Device；
Blind recognition device, for BCH code sequence that intercepted length is l as target sequence, and based on above-mentioned blind recognition side
Method processing target retrieval identifies the code length n of BCH code, substantial synchronization deviation, generator polynomial g (x)；It can for example be based on
Blind recognition device is set in DVB-S2 satellite receiving system, then stores the program of above-mentioned recognition methods, it can be by blind recognition device
Processor call and run the program to realize the acquisition of code length n, substantial synchronization deviation, generator polynomial g (x) so that receiving
End quickly recognizes required information.
Channel decoder, for the code length n of the BCH code based on identification, substantial synchronization deviation, generator polynomial g (x) to reality
When received BCH code decoded.
It should be appreciated that satellite communication apparatus can also be considered as a satellite communication system, preferably DVB- in the present embodiment
S2 satellite communication system, at this point, satellite communication apparatus includes transmitting terminal, receiving end and satellite, receiving end includes being connected with each other
Demodulator, blind recognition device and the channel decoder of communication；Transmitting terminal includes signal coder corresponding with transmitting terminal, modulation
Device；
The BCH code to be decoded and demodulation that demodulator is sent by satellite reception transmitting terminal are sent to channel decoder；
Blind recognition device, for intercepted length be l BCH code sequence be used as target sequence, and use above-mentioned blind-identification method
Processing target retrieval identifies the code length n of BCH code, substantial synchronization deviation, generator polynomial g (x)；
Channel decoder, for the code length n of the BCH code based on identification, substantial synchronization deviation, generator polynomial g (x) to reality
When received BCH code decoded.
It is emphasized that example of the present invention be it is illustrative, without being restrictive, thus the present invention it is unlimited
Example described in specific embodiment, other all obtained according to the technique and scheme of the present invention by those skilled in the art
Embodiment does not depart from present inventive concept and range, and whether modification or replacement, also belong to protection model of the invention
It encloses.
Claims (6)
1. a kind of BCH code blind identification method for coding parameters, characterized by the following steps:
S1: length is the sequence of l as target sequence in interception BCH code code stream sequence；
S2: initialization domain exponent m, and test code length n, test synchronism deviation d are determined based on domain exponent mtValue range and work as
Front domain GF (2m) in minimal polynomial；
Wherein, code length n is tested are as follows: n=2m- 1, test synchronism deviation dtValue range are as follows: 1≤dt≤n；
S3: the corresponding the current field GF (2 of domain exponent m is foundm) all minimal polynomials in divide exactly point with the presence or absence of minimal polynomial
Analyse the corresponding codeword polynome c of matrix Xj(x), when j=1,2 ..., M, divided evenly codeword polynome cj(x) number be greater than or
Equal to default judgement circle Ti；
Wherein, by d preceding in target sequencetBit is deleted to be grouped remaining bits to obtain M group bit according still further to test code length n,
The analysis matrix X is made of the M group bit, and the corresponding codeword polynome c of every group of bitj(x),
It indicates to be rounded symbol downwards；
If it does not exist, test synchronism deviation d is updatedtAnd/or more neofield exponent m, until the corresponding the current field GF (2 of domain exponent mm)
There are minimal polynomials to divide exactly test synchronism deviation d in minimal polynomialt, the code word of the corresponding analysis matrix X of domain exponent m it is multinomial
Formula cj(x) when, divided evenly codeword polynome cj(x) number NiMore than or equal to default judgement circle Ti；
If it exists, the corresponding code length n of the current field exponent m is the code length of BCH code to be identified；
S4: test synchronism deviation d is obtained based on the domain exponent m met when dividing exactly condition in S3tTest scope, then based on current
Domain GF (2m) minimal polynomial and test scope in each test synchronism deviation dtThe codeword polynome c of correspondence analysis matrix Xj
(x) probability of dividing exactly obtains substantial synchronization deviation；
Wherein, analysis matrix X corresponding test synchronism deviation d when dividing exactly maximum probabilitytFor substantial synchronization deviation；
S5: based on the substantial synchronization deviation restructuring analysis matrix X identified in the code length and step S4 identified in step S3, will work as
Front domain GF (2m) each minimal polynomial respectively with the codeword polynome c of analysis matrix Xj(x) divisibility relation verifying is carried out；
Wherein, if the codeword polynome c of minimal polynomial aliquot analysis matrix Xj(x) when, divided evenly codeword polynome cj
(x) number is greater than or equal to default judgement circle Ti, then the minimal polynomial is stored in set Ξ；
S7: whole element multiplications in set Ξ are obtained into the generator polynomial g (x) of BCH code to be identified.
2. according to the method described in claim 1, it is characterized by: the implementation procedure of step S3 is as follows:
S31: according to test synchronism deviation dtValue range obtain test synchronism deviation dtInitial value, and be based on current test patterns
Long n and test synchronism deviation dtInitial value construct current analysis matrix X；
S32: judge the current field GF (2m) all minimal polynomials in whether there is minimal polynomial aliquot present analysis matrix
The corresponding codeword polynome c of Xj(x) when, divided evenly codeword polynome cj(x) number is greater than or equal to default judgement circle Ti；
If so, the corresponding code length n of the current field exponent m is the code length of BCH code to be identified；If no, executing S33；
S33: judge the corresponding test synchronism deviation d of the current field exponent mtValue range in whether there is also test synchronism deviation
dtThe identification in S32 is not carried out；
If it exists, based on test synchronism deviation dtValue range update test synchronism deviation dt, then the test synchronization based on update
Deviation dtRestructuring analysis matrix X, returns again to the judgement of step S32；
S33: if it does not exist, more neofield exponent m, then the domain exponent m based on update update test code length n, test synchronism deviation dt's
Value range and the current field GF (2m) in minimal polynomial, return again to step S31.
3. according to the method described in claim 1, it is characterized by: the implementation procedure of step S4 is as follows:
S41: test synchronism deviation d is obtained based on the domain exponent m met when dividing exactly condition in S3tTest scope；
S42: synchronism deviation d is tested in construction step S41 respectivelytTest scope in each test synchronism deviation dtAnalysis square
Battle array X；
S43: the corresponding the current field GF (2 of domain exponent m when dividing exactly condition in S3 will be metm) in each minimal polynomial respectively with
The corresponding codeword polynome c of each analysis matrix X in step S42j(x) it carries out dividing exactly and calculates each minimal polynomial and each
Divide exactly probability between analysis matrix X；
The formula for dividing exactly probability is as follows:
Pr (u)=Nu/ M, 1≤(dt=u)≤n
Wherein, Pr (u) is a minimal polynomial mi(x) with test synchronism deviation dtDividing exactly between analysis matrix X when for u
Probability, NuFor a minimal polynomial mi(x) aliquot tests synchronism deviation dtAnalysis matrix X when for u is corresponding generate it is multinomial
Formula cj(x) number.
4. a kind of interpretation method based on any one of the claim 1-3 blind-identification method, it is characterised in that: including walking as follows
It is rapid:
Step 1: receiving BCH code and therefrom intercepted length is the sequence of l as target sequence；
Step 2: using the code length n of any one of the claim 1-3 blind-identification method identification BCH code, substantial synchronization deviation, life
At multinomial g (x)；
Step 3: code length n, substantial synchronization deviation, generator polynomial g (x) based on the BCH code identified in step 2 are to real-time reception
BCH code decoded.
5. a kind of satellite communication apparatus based on interpretation method described in claim 4, it is characterised in that: communicated including being connected with each other
Demodulator, blind recognition device and channel decoder；
Wherein, the BCH code to be decoded and demodulation that demodulator is sent by satellite reception transmitting terminal are sent to channel decoder；
The blind recognition device, for intercepted length be l BCH code sequence as target sequence, and be based on claim 1-3 it is any
Code length n, substantial synchronization deviation, the generator polynomial g of blind-identification method processing target retrieval identification BCH code described in
(x)；
The channel decoder, for the code length n of the BCH code based on identification, substantial synchronization deviation, generator polynomial g (x) to reality
When received BCH code decoded.
6. satellite communication apparatus according to claim 5, it is characterised in that: the satellite communication system is DVB-S2 satellite
Communication device.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910074466.9A CN109861792A (en) | 2019-01-25 | 2019-01-25 | BCH code blind identification method for coding parameters, interpretation method and satellite communication apparatus |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910074466.9A CN109861792A (en) | 2019-01-25 | 2019-01-25 | BCH code blind identification method for coding parameters, interpretation method and satellite communication apparatus |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109861792A true CN109861792A (en) | 2019-06-07 |
Family
ID=66896290
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910074466.9A Withdrawn CN109861792A (en) | 2019-01-25 | 2019-01-25 | BCH code blind identification method for coding parameters, interpretation method and satellite communication apparatus |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109861792A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112821895A (en) * | 2021-04-16 | 2021-05-18 | 成都戎星科技有限公司 | Code identification method for realizing high error rate of signal |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100330981A1 (en) * | 2007-06-26 | 2010-12-30 | Telefonaktiebolaget L M Ericsson(Publ) | Device and Method for Transmitting Cell Offset in Telecommunication System |
| CN102970048A (en) * | 2012-09-13 | 2013-03-13 | 电子科技大学 | BCH-code coding parameter blind identification method based on BCH-code decoding |
-
2019
- 2019-01-25 CN CN201910074466.9A patent/CN109861792A/en not_active Withdrawn
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100330981A1 (en) * | 2007-06-26 | 2010-12-30 | Telefonaktiebolaget L M Ericsson(Publ) | Device and Method for Transmitting Cell Offset in Telecommunication System |
| CN102970048A (en) * | 2012-09-13 | 2013-03-13 | 电子科技大学 | BCH-code coding parameter blind identification method based on BCH-code decoding |
Non-Patent Citations (1)
| Title |
|---|
| 吴刚等: "非理想同步下BCH码盲识别的改进算法", 《信号处理》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112821895A (en) * | 2021-04-16 | 2021-05-18 | 成都戎星科技有限公司 | Code identification method for realizing high error rate of signal |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101297486B (en) | Information carrying synchronization code and method for frame timing synchronization | |
| US8312051B2 (en) | Incremental construction of search tree with signature pointers for identification of multimedia content | |
| Chan et al. | Non-adaptive probabilistic group testing with noisy measurements: Near-optimal bounds with efficient algorithms | |
| Gabrys et al. | Codes in the Damerau distance for DNA storage | |
| Hasler et al. | Optimal and suboptimal chaos receivers | |
| Alimpiev et al. | The video information resources integrity concept by using binomial slots | |
| CN113300993B (en) | Transmission method for bit field superposition pseudo-random sequence and sparse cascade coding | |
| CN107481738A (en) | Real-time audio comparison method and device | |
| Hei et al. | Feature extraction optimization for bitstream communication protocol format reverse analysis | |
| CN109495211A (en) | A kind of channel coding and coding/decoding method | |
| CN109861792A (en) | BCH code blind identification method for coding parameters, interpretation method and satellite communication apparatus | |
| RU2319308C1 (en) | Cyclic code synchronization method | |
| CN110249542A (en) | Digital radio | |
| CN103490856B (en) | Mark5B-format VLBI data receiving decoding and error correcting system and method used for deep space exploration | |
| Faure et al. | Methods of factorial coding of speech signals | |
| CN103269255A (en) | Generation method and device of parallel CRC (Cyclic Redundancy Check) circuit | |
| CN112821895B (en) | Code identification method for realizing high error rate of signal | |
| CN106973027A (en) | A kind of generation method of synchronizing signal, analysis method and device | |
| Veeravalli et al. | Hybrid acquisition of direct sequence CDMA signals | |
| CN111615187A (en) | Wireless signal synchronization method | |
| Jiang et al. | Low-complexity multi-user detection based on gradient information for uplink grant-free NOMA | |
| RU2359414C1 (en) | Method for code cyclic synchronisation | |
| CN109831280A (en) | A kind of sound wave communication method, apparatus and readable storage medium storing program for executing | |
| CN109274460A (en) | A kind of multi-bit parallel structure serially offsets interpretation method and device | |
| Deng et al. | Research on Blind Recognition Algorithm of Channel Coding Based on One-Dimensional Convolutional Neural Network Under the Low SNR Regime |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WW01 | Invention patent application withdrawn after publication |
Application publication date: 20190607 |
|
| WW01 | Invention patent application withdrawn after publication |