CN103399749B - RS code based on MFC dialog box coding and recognition methods - Google Patents
RS code based on MFC dialog box coding and recognition methods Download PDFInfo
- Publication number
- CN103399749B CN103399749B CN201310341578.9A CN201310341578A CN103399749B CN 103399749 B CN103399749 B CN 103399749B CN 201310341578 A CN201310341578 A CN 201310341578A CN 103399749 B CN103399749 B CN 103399749B
- Authority
- CN
- China
- Prior art keywords
- code
- coding
- matrix
- polynomial
- dialog box
- 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.)
- Expired - Fee Related
Links
Abstract
RS code based on MFC dialog box coding and recognition methods, belong to Channel coding parameters blind recognition technical field.The method achieves coding and the identification of RS code by MFC dialog box application program, it is achieved thereby that the realization approach of a kind of new MFC dialog box application program, i.e. user only need to select or according to the parameter needed for prompting input, then by the response of a button, these parameters are delivered to an interface function, this interface function with other needed for being defined in another single .cpp file of function, after parameter enters function body and then realize software.
Description
Technical field
The present invention relates to a kind of RS code based on MFC dialog box coding and recognition methods, belong to the blind knowledge of Channel coding parameters
Other technical field.
Background technology
MFC full name Microsoft Foundation Classes, namely Microsoft Foundation class libraries.It is the core of VC++
The heart, is the combination of C++ Yu Windows API.It encapsulates Windows SDK (Software Development with C++
Kit, SDK) in 26S Proteasome Structure and Function, provide application with the form of class members's function.MFC additionally provides one
Application framework, this framework completes the work of some routines, the most various windows, toolbar, the generation of menu and pipe
Reason etc..Thus greatly reduce the workload of software developer, improve development efficiency.MFC dialog box application program is
One of most important user interface in window application, is the important means mutual with user.In the process that program is run
In, dialog box can capture data and the information of user's input, is then added in the process of program and is applied.
RS code (Reed Solomon Codes) is the multi-system forward error correction letter that the error correcting capability of a kind of low rate is the strongest
Road encodes.It has application to the various fields such as radio communication, military communication and deep space communication at present.
Summary of the invention
In order to realize RS code coding time all parameters the most optional, facilitate the application in Practical Project of the RS code, this
Bright provide a kind of RS code based on MFC dialog box coding and recognition methods, utilize MFC dialog box application program by the volume of RS code
Code and identification are classified and pack so that it is applied in an engineering.During coding, user only need to select or according to carrying
Parameter needed for showing input can generate the RS code with some characteristic, it is achieved thereby that the parameter traversals of RS code;Use during identification
Family only need to select the file path of code word file and the parameter identified needing reading just can identify the ginseng of RS code code word
Number.
Technical scheme is as follows:
A kind of RS code based on MFC dialog box coding and recognition methods, first create dialog resources, generates dialog box
Class, then adds control for each dialog box and adds the message processing function of control, being ultimately written coding and recognition function, the party
Method step is as follows:
1) creating a new MFC engineering based on dialog box, after engineering creates, system can create main dialog interface;
Due to the corresponding class of a dialog box, so system current only one of which class " CRSCodeDlg ", i.e. RS code dialog class;So
It is that main interface is added control and revises the attribute of main interface and control afterwards, it is necessary first to add " coding ", " identification " and " exiting "
Three buttons, then arrange the attribute of dialog box and control, i.e. amendment dialog box and the Caption (title) of button and ID (sequence
Row number);
2) generating two dialog class, the most newly-built two dialog boxes, respectively RS code coding dialog box and RS code identification are right
Words frame, two corresponding classes are respectively " CRSCodeEncodeDlg " (RS code coding dialog class) and "
CRSCodeRecognitionDlg " (RS code identification dialog class);
3) it is that each dialog box adds control, and adds variable for each control, add static literary composition to RS code coding dialog box
This frame, combobox, text box, button and hyperlink, to RS code identification dialog box add static text box, text box, button and
Hyperlink;Then adding variable for each control, when program is run, user's operation on interface (includes selecting combobox
Value, in text box the value of input and the file path of selection) variable assignments of corresponding control can be given so that it is in a program
Used;
4) add the message processing function of control, add to " coding " and " identification " button " DoModal " function so that it is
RS code coding dialog box and RS code identification dialog box can be opened respectively after clicking;Function is added so that it is at list to the Browse button
User is made arbitrarily to select file path after hitting;
5) write coding and the interface function of recognizer, be respectively " RS_EncodeInterfaceFunc (order,
Capacity, zero, number, codeNumber, offset, ber, RSEncodePathbin, RSEncodePathgf) " and
" RS_RecogInterfaceFunc (RSCodePath, RSParaPath) ", wherein order is exponent number, and capacity is error correction
Capacity, zero is the power of polynomial first of generation, and number is primitive polynomial, and codeNumber is code word to be encoded
Number, offset is side-play amount, and ber is the bit error rate, and RSEncodePathbin is that code word writes file path,
RSEncodePathgf is parameter read-in file path, and RSCodePath is the code word file path read, and RSParaPath is
The path of the parameter read-in file identified;The most newly-built two .cpp files, are respectively written into the relevant of coding and recognizer
Function;
6), during coding, user needs to select the exponent number of RS code, primitive polynomial, the file path of parameter read-in on interface
With the file path of code word write, by prompting input error correction capability, the power of first of generator polynomial, code word number, skew
Amount and the bit error rate, click on after " coding " button, and the value of these variablees can be assigned to the variable that each control is corresponding by software, then this
A little variablees are re-used as parameter and are delivered to " RS_EncodeInterfaceFunc (order, capacity, zero, number,
CodeNumber, offset, ber, RSEncodePathbin, RSEncodePathgf) " function, and then complete coding, wherein
The step of coding is:
A. assume that message to be encoded is u=(u0,u1,…,uk-1), wherein u0,u1,…,uk-1Being 0 or 1, k is information bit
Number, then corresponding message multinomial is
U (X)=u0+u1X+…+uk-1Xk-1(1) wherein X is polynomial variable, then uses Xn-kIt is multiplied by u (X),
The multinomial of n-1 it is not more than to number of times
Xn-kU (X)=u0Xn-k+u1Xn-k+1+…+uk-1Xn-1 (2)
B. (n, k) in RS code, has and only a number of times is the code polynomial of n-k, and it is many that each code polynomial is this
Times formula of item formula, i.e. can be generated whole RS code by this multinomial, and this code polynomial is generator polynomial g (X);
Use Xn-kU (X) obtains divided by generator polynomial g (X)
Xn-kWherein, a's u (X)=a (X) g (X)+b (X) (3) (X) and b (X) is respectively divided by
Later business's formula and residue, owing to the number of times of g (X) is n-k, then the number of times of b (X) must be not more than n-k-1;Then can obtain
B (X)=b0+b1X+…bn-k-1Xn-k-1(4) by formula (3), we obtain following number of times not
Multinomial more than n-1:
-b(X)+Xn-kU (X)=a (X) g (X) (5) this multinomial is for generating polynomial times
Formula, therefore it is also the code polynomial of the RS code generated by multinomial g (X);
C. by b (X) and Xn-kU (X) do and, i.e. (2) formula obtains plus (4) formula:
Corresponding code word is
(b0,b1,…,bn-k-1,u0,u1,…,uk-1) (7) be can get one by said method
(n, k) the RS code of system form;
Therefore, code word is made up of information bit and n-k the check bit thereafter of k invariant position, this n-k check bit
It is Xn-kThe X obtained after being multiplied by message multinomial u (X)n-kU (X) is divided by the coefficient of generator polynomial g (X) gained residue;In system
In the RS code of form, front n-k symbol, i.e. X0,X1,……,Xn-k-1Coefficient be check bit, rear k symbol, i.e. Xn-k,Xn -k+1,……,Xn-1Coefficient be information bit, k information bit of n-k check bit sum is coupled together and can form a system shape
(n, k) the RS code of formula;
7), during the identification of RS code, user needs the parameter read-in after selecting the file path of code word reading on interface and identifying
File path;After click recognition button, the value of the two variable can be assigned to two variablees corresponding to text on path frame by software, so
Rear the two variable can be delivered to " RS_RecogInterfaceFunc (RSCodePath, RSParaPath) " letter as parameter
Number, and then complete to identify;
The identification of RS code uses row matrix abbreviation algorithm, will line up the recognition matrix on m × n (m > n) rank by recognition sequence,
The data that this matrix requirements is often gone are more than code length, and first data of all row are separated by the integral multiple of code length so that recognition matrix
All row are initially the starting point of code word from certain string, and there is complete code word in every guild, after this journey abbreviation, from the beginning of this string
The standard generator matrix of available linear block codes, extracts this generator matrix and i.e. completes the blind knowledge of Binary Linear Block Codes
Not;
The step of RS code identification is:
A. identification data are lined up matrix;For general linear block codes, in the case of there is no priori, it is difficult to
Determine the columns of recognition matrix, but Binary Linear Block Codes code length corresponding to RS code can only be quantized, i.e. m (2m-1), m
It it is the exponent number of RS code;M is traveled through, identification data are lined up 2m (2 by rowm-1)×4m(2m-1) recognition matrix on rank, if
Assuming that m be not coding time code word exponent number, there is no linear restriction relation between the most each row, unit matrix after abbreviation, can be obtained,
If this m is code word exponent number during coding, then this matrix columns is the twice of code length, and often first data of row are spaced apart code length
Twice, the form obtained after row abbreviation is
B. row abbreviation matrix, obtains the generator matrix of RS code binary derivative code;In [IP2] just
It is the generator matrix of linear block codes to be identified, extracts this matrix, just complete the identification of this linear block codes, this matrix institute
Being at row and identify the starting point of first complete code in data, the line number of this matrix is the length of information bit, and columns is code length;
C. identify primitive polynomial, then according to the primitive polynomial identified, the matrix after abbreviation is mapped to GF (2m)
On identify generator polynomial;Middle submatrix P2Form beIts
Middle PijIt is the matrix on m × m rank, makes PijMiddle any row moves to left one and mends 0 below, then distinguishes mould 2 with its lastrow corresponding bit
Add, if its result is not full 0, be then exactly the coefficient of primitive polynomial with the element in vector;[IP2In], last column is exactly
The coefficient of RS code generator polynomial.
Above-mentioned cpp is the suffix name of the source code file write with C Plus Plus;Wherein " CRSCodeEncodeFunction.
Cpp " in deposit the function of coding, " CRSCodeRecognitionFunction.cpp " and in deposit the function of identification.
Present invention achieves the realization approach of a kind of new MFC dialog box application program, i.e. user only need to select or according to
Then these parameters are delivered to an interface function, this interface by the response of a button by the parameter needed for prompting input
Function with other needed for being defined in another single .cpp file of function, and then realize software.
When 1. encoding, after user selects the exponent number of RS code, primitive polynomial can become with the difference of the exponent number that user selects
Change;
2. after clicking on " prompting 1 " button, the exponent number that user selects can be delivered to calculate in program, and then point out out and entangle
The scope of wrong capacity, makes user need not, further according to user's manual manual calculations, facilitate the input of user;
3., after clicking on " prompting 2 " button, exponent number and the error correction capability of input that user selects can be delivered in program carry out
Calculate, and then point out out the power of polynomial first of generation, facilitate the input of user;
4. the path of file can be manually entered, it is also possible to clicks on the Browse button, and then the path of selection file, convenient
The input of user, it is to avoid the generation of mistake;
5., after encoding or having identified, user can be by clicking on " Parameter File of generation " and " the parameter literary composition after identification
Part " Parameter File of two hyperlink buttons write when opening coding and the Parameter File that identifies, without user again
Look for, and then have great convenience for the user running software result is checked.
Can be seen that the present invention achieves man-machine interaction admirably by above 5, be very easy to making of user
With, this is also beneficial effects of the present invention.
Accompanying drawing explanation
Detailed description of the invention
Below in conjunction with embodiment, the present invention will be further described, but is not limited to this.
Embodiment:
A kind of RS code based on MFC dialog box coding and recognition methods, first create dialog resources, generates dialog box
Class, then adds control for each dialog box and adds the message processing function of control, being ultimately written coding and recognition function, the party
Method step is as follows:
1) creating a new MFC engineering based on dialog box, after engineering creates, system can create main dialog interface;
Due to the corresponding class of a dialog box, so system current only one of which class " CRSCodeDlg ", i.e. RS code dialog class;So
It is that main interface is added control and revises the attribute of main interface and control afterwards, it is necessary first to add " coding ", " identification " and " exiting "
Three buttons, then arrange the attribute of dialog box and control, i.e. amendment dialog box and the Caption (title) of button and ID (sequence
Row number);
2) generating two dialog class, the most newly-built two dialog boxes, respectively RS code coding dialog box and RS code identification are right
Words frame, two corresponding classes are respectively " CRSCodeEncodeDlg " (RS code coding dialog class) and "
CRSCodeRecognitionDlg " (RS code identification dialog class);
3) it is that each dialog box adds control, and adds variable for each control, add static literary composition to RS code coding dialog box
This frame, combobox, text box, button and hyperlink, to RS code identification dialog box add static text box, text box, button and
Hyperlink;Then adding variable for each control, when program is run, user's operation on interface (includes selecting combobox
Value, in text box the value of input and the file path of selection) variable assignments of corresponding control can be given so that it is in a program
Used;
4) add the message processing function of control, add to " coding " and " identification " button " DoModal " function so that it is
RS code coding dialog box and RS code identification dialog box can be opened respectively after clicking;Function is added so that it is at list to the Browse button
User is made arbitrarily to select file path after hitting;
5) write coding and the interface function of recognizer, be respectively " RS_EncodeInterfaceFunc (order,
Capacity, zero, number, codeNumber, offset, ber, RSEncodePathbin, RSEncodePathgf) " and
" RS_RecogInterfaceFunc (RSCodePath, RSParaPath) ", wherein order is exponent number, and capacity is error correction
Capacity, zero is the power of polynomial first of generation, and number is primitive polynomial, and codeNumber is code word to be encoded
Number, offset is side-play amount, and ber is the bit error rate, and RSEncodePathbin is that code word writes file path,
RSEncodePathgf is parameter read-in file path, and RSCodePath is the code word file path read, and RSParaPath is
The path of the parameter read-in file identified;The most newly-built two .cpp files, are respectively written into the relevant of coding and recognizer
Function;
6), during coding, user needs to select the exponent number of RS code, primitive polynomial, the file path of parameter read-in on interface
With the file path of code word write, by prompting input error correction capability, the power of first of generator polynomial, code word number, skew
Amount and the bit error rate, click on after " coding " button, and the value of these variablees can be assigned to the variable that each control is corresponding by software, then this
A little variablees are re-used as parameter and are delivered to " RS_EncodeInterfaceFunc (order, capacity, zero, number,
CodeNumber, offset, ber, RSEncodePathbin, RSEncodePathgf) " function, and then complete coding, wherein
The step of coding is:
A. assume that message to be encoded is u=(u0,u1,…,uk-1), wherein u0,u1,……,uk-1Being 0 or 1, k is information
The number of position, then corresponding message multinomial is
U (X)=u0+u1X+……+uk-1Xk-1(1) wherein X is polynomial variable, then
Use Xn-kIt is multiplied by u (X), obtains the multinomial that number of times is not more than n-1
Xn-kU (X)=u0Xn-k+u1Xn-k+1+……+uk-1Xn-1 (2)
B. (n, k) in RS code, has and only a number of times is the code polynomial of n-k, and it is many that each code polynomial is this
Times formula of item formula, i.e. can be generated whole RS code by this multinomial, and this code polynomial is generator polynomial g (X);
Use Xn-kU (X) obtains divided by generator polynomial g (X)
Xn-kWherein, a's u (X)=a (X) g (X)+b (X) (3) (X) and b (X) is respectively divided by
Later business's formula and residue, owing to the number of times of g (X) is n-k, then the number of times of b (X) must be not more than n-k-1;Then can obtain
B (X)=b0+b1X+……bn-k-1Xn-k-1(4) by formula (3), we obtain following number of times
The no more than multinomial of n-1:
-b(X)+Xn-kU (X)=a (X) g (X) (5) this multinomial is for generating polynomial times
Formula, therefore it is also the code polynomial of the RS code generated by multinomial g (X);
C. by b (X) and Xn-kU (X) do and, i.e. (2) formula obtains plus (4) formula:
Corresponding code word is
(b0,b1,……,bn-k-1,u0,u1,…,uk-1) (7) be can get one by said method
(n, k) the RS code of individual system form;
Therefore, code word is made up of information bit and n-k the check bit thereafter of k invariant position, this n-k check bit
It is Xn-kThe X obtained after being multiplied by message multinomial u (X)n-kU (X) is divided by the coefficient of generator polynomial g (X) gained residue;In system
In the RS code of form, front n-k symbol, i.e. X0,X1,…,Xn-k-1Coefficient be check bit, rear k symbol, i.e. Xn-k,Xn -k+1,…,Xn-1Coefficient be information bit, k information bit of n-k check bit sum is coupled together and can form a system form
(n, k) RS code;
7), during the identification of RS code, user needs the parameter read-in after selecting the file path of code word reading on interface and identifying
File path;After click recognition button, the value of the two variable can be assigned to two variablees corresponding to text on path frame by software, so
Rear the two variable can be delivered to " RS_RecogInterfaceFunc (RSCodePath, RSParaPath) " letter as parameter
Number, and then complete to identify;
The identification of RS code uses row matrix abbreviation algorithm, will line up the recognition matrix on m × n (m > n) rank by recognition sequence,
The data that this matrix requirements is often gone are more than code length, and first data of all row are separated by the integral multiple of code length so that recognition matrix
All row are initially the starting point of code word from certain string, and there is complete code word in every guild, after this journey abbreviation, from the beginning of this string
The standard generator matrix of available linear block codes, extracts this generator matrix and i.e. completes the blind knowledge of Binary Linear Block Codes
Not;
The step of RS code identification is:
A. identification data are lined up matrix;For general linear block codes, in the case of there is no priori, it is difficult to
Determine the columns of recognition matrix, but Binary Linear Block Codes code length corresponding to RS code can only be quantized, i.e. m (2m-1), m
It it is the exponent number of RS code;M is traveled through, identification data are lined up 2m (2 by rowm-1)×4m(2m-1) recognition matrix on rank, if
Assuming that m be not coding time code word exponent number, there is no linear restriction relation between the most each row, unit matrix after abbreviation, can be obtained,
If this m is code word exponent number during coding, then this matrix columns is the twice of code length, and often first data of row are spaced apart code length
Twice, the form obtained after row abbreviation is
B. row abbreviation matrix, obtains the generator matrix of RS code binary derivative code;In [IP2] just
It is the generator matrix of linear block codes to be identified, extracts this matrix, just complete the identification of this linear block codes, this matrix institute
Being at row and identify the starting point of first complete code in data, the line number of this matrix is the length of information bit, and columns is code length;
C. identify primitive polynomial, then according to the primitive polynomial identified, the matrix after abbreviation is mapped to GF (2m)
On identify generator polynomial;Middle submatrix P2Form beIts
Middle PijIt is the matrix on m × m rank, makes PijMiddle any row moves to left one and mends 0 below, then distinguishes mould 2 with its lastrow corresponding bit
Add, if its result is not full 0, be then exactly the coefficient of primitive polynomial with the element in vector;[IP2In], last column is exactly
The coefficient of RS code generator polynomial.
Claims (1)
1. RS code based on MFC dialog box coding and a recognition methods, first create dialog resources, generates dialog class,
Then add control for each dialog box and add the message processing function of control, being ultimately written coding and recognition function, the method
Step is as follows:
1) creating a new MFC engineering based on dialog box, after engineering creates, system can create main dialog interface;Due to
One corresponding class of dialog box, so system current only one of which class " CRSCodeDlg ", i.e. RS code dialog class;Then it is
Main interface is added control and revises the attribute of main interface and control, it is necessary first to interpolation " coding ", " identification " and " exiting " three
Button, then arranges the attribute of dialog box and control, i.e. amendment dialog box and Caption and ID of button;
2) two dialog class are generated, the most newly-built two dialog boxes, respectively RS code coding dialog box and RS code identification dialog box,
Two corresponding classes are respectively " CRSCodeEncodeDlg " i.e. RS code coding dialog class with "
CRSCodeRecognitionDlg " i.e. RS code identification dialog class;
3) be each dialog box add control, and for each control add variable, to RS code coding dialog box interpolation static text box,
Combobox, text box, button and hyperlink, add static text box, text box, button and hyperlink to RS code identification dialog box
Connect;Then for each control add variable, when program is run, user's operation on interface include selection combobox value,
In text box, the value of input and the file path of selection can give the variable assignments of corresponding control so that it is in a program so that
With;
4) add the message processing function of control, add to " coding " and " identification " button " DoModal " function so that it is clicking
After can open RS code coding dialog box and RS code identification dialog box respectively;Function is added so that it is after clicking to the Browse button
User is made arbitrarily to select file path;
5) write coding and the interface function of recognizer, be respectively " RS_EncodeInterfaceFunc (order,
Capacity, zero, number, codeNumber, offset, ber, RSEncodePathbin, RSEncodePathgf) " and
" RS_RecogInterfaceFunc (RSCodePath, RSParaPath) ", wherein order is exponent number, and capacity is error correction
Capacity, zero is the power of polynomial first of generation, and number is primitive polynomial, and codeNumber is code word to be encoded
Number, offset is side-play amount, and ber is the bit error rate, and RSEncodePathbin is that code word writes file path,
RSEncodePathgf is parameter read-in file path, and RSCodePath is the code word file path read, and RSParaPath is
The path of the parameter read-in file identified;The most newly-built two cpp files, are respectively written into coding and the relevant letter of recognizer
Number;
6), during coding, user needs to select the exponent number of RS code, primitive polynomial, the file path of parameter read-in and code on interface
The file path of word write, by prompting input error correction capability, the power of first of generator polynomial, code word number, side-play amount and
The bit error rate, after clicking on " coding " button, the value of these variablees can be assigned to the variable that each control is corresponding by software, and then these become
Amount is re-used as parameter and is delivered to " RS_EncodeInterfaceFunc (order, capacity, zero, number,
CodeNumber, offset, ber, RSEncodePathbin, RSEncodePathgf) " function, and then complete coding, wherein
The step of coding is:
A. assume that message to be encoded is u=(u0,u1,…,uk-1), wherein u0,u1,…,uk-1Being 0 or 1, k is the individual of information bit
Number, then corresponding message multinomial is
U (X)=u0+u1X+…+uk-1Xk-1 (1)
Wherein X is polynomial variable, then uses Xn-kIt is multiplied by u (X), obtains the multinomial that number of times is not more than n-1
Xn-kU (X)=u0Xn-k+u1Xn-k+1+…+uk-1Xn-1 (2)
B. (n, k) in RS code, has and code polynomial that only number of times is n k, and each code polynomial is this multinomial
Times formula, i.e. can be generated whole RS code by this multinomial, this code polynomial is generator polynomial g (X);
Use Xn-kU (X) obtains divided by generator polynomial g (X)
Xn-kU (X)=a (X) g (X)+b (X) (3)
Wherein, business's formula that a (X) and b (X) is respectively divided by later and residue, owing to the number of times of g (X) is n-k, then b (X) time
Number must be not more than n-k-1;Then can obtain
B (X)=b0+b1X+…bn-k-1Xn-k-1 (4)
By formula (3), we obtain the multinomial that following number of times is not more than n-1:
-b(X)+Xn-kU (X)=a (X) g (X) (5) this multinomial is for generating polynomial times
Formula, therefore it is also the code polynomial of the RS code generated by multinomial g (X);
C. by b (X) and Xn-kU (X) do and, i.e. (2) formula obtains plus (4) formula:
Corresponding code word is
(b0,b1,…,bn-k-1,u0,u1,…,uk-1) (7) be can get one by said method
(n, k) the RS code of system form;
Therefore, code word is made up of information bit and n-k the check bit thereafter of k invariant position, and this n-k check bit is Xn -kThe X obtained after being multiplied by message multinomial u (X)n-kU (X) is divided by the coefficient of generator polynomial g (X) gained residue;At system form
RS code in, front n-k symbol, i.e. X0,X1,…,Xn-k-1Coefficient be check bit, rear k symbol, i.e. Xn-k,Xn-k+1,…,Xn -1Coefficient be information bit, k information bit of n-k check bit sum is coupled together and can form (n, k) RS of a system form
Code;
7), during the identification of RS code, user needs the parameter read-in file after selecting the file path of code word reading on interface and identifying
Path;After click recognition button, the value of the two variable can be assigned to two variablees corresponding to text on path frame by software, then this
Two variablees can be delivered to " RS_RecogInterfaceFunc (RSCodePath, RSParaPath) " function as parameter, enters
And complete to identify;
The identification of RS code uses row matrix abbreviation algorithm, will line up the recognition matrix on m × n (m > n) rank, this square by recognition sequence
Battle array requires the data often gone more than code length, and first data of all row are separated by the integral multiple of code length so that recognition matrix owns
Row is initially the starting point of code word from certain string, and there is complete code word in every guild, after this journey abbreviation, starts to obtain from this string
To the standard generator matrix of linear block codes, extract this generator matrix and i.e. complete the blind recognition of Binary Linear Block Codes;
The step of RS code identification is:
A. identification data are lined up matrix;For general linear block codes, in the case of there is no priori, it is difficult to determine
The columns of recognition matrix, but Binary Linear Block Codes code length corresponding to RS code can only be quantized, i.e. m (2m-1), m is RS
The exponent number of code;M is traveled through, identification data are lined up 2m (2 by rowm-1)×4m(2m-1) recognition matrix on rank, if it is assumed that
M be not coding time code word exponent number, there is no linear restriction relation between the most each row, unit matrix after abbreviation, can be obtained, if
This m is code word exponent number during coding, then this matrix columns is the twice of code length, and often first data of row are spaced apart the two of code length
Times, the form obtained after row abbreviation is
B. row abbreviation matrix, obtains the generator matrix of RS code binary derivative code;In [IP2] it is exactly to wait to know
The generator matrix of other linear block codes, extracts this matrix, just completes the identification of this linear block codes, and this matrix column is i.e.
For identifying the starting point of first complete code in data, the line number of this matrix is the length of information bit, and columns is code length;
C. identify primitive polynomial, then according to the primitive polynomial identified, the matrix after abbreviation is mapped to GF (2mKnow on)
Other generator polynomial, GF (2m) represent containing 2mThe finite field of individual element;Middle submatrix P2Form beWherein PijIt is the matrix on m × m rank, makes PijMiddle any row moves to left one and mends 0 below, then
Add with its lastrow corresponding bit mould 2 respectively, if its result is not full 0, be then exactly primitive polynomial with the element in vector
Coefficient;[I P2In], last column is exactly the coefficient of RS code generator polynomial.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201310341578.9A CN103399749B (en) | 2013-08-07 | 2013-08-07 | RS code based on MFC dialog box coding and recognition methods |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201310341578.9A CN103399749B (en) | 2013-08-07 | 2013-08-07 | RS code based on MFC dialog box coding and recognition methods |
Publications (2)
Publication Number | Publication Date |
---|---|
CN103399749A CN103399749A (en) | 2013-11-20 |
CN103399749B true CN103399749B (en) | 2016-10-05 |
Family
ID=49563383
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201310341578.9A Expired - Fee Related CN103399749B (en) | 2013-08-07 | 2013-08-07 | RS code based on MFC dialog box coding and recognition methods |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN103399749B (en) |
Families Citing this family (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN106909394A (en) * | 2017-03-02 | 2017-06-30 | 国工信(沧州)数控科技有限公司 | Method that is a kind of nested based on MFC interfaces and being switched fast interface |
CN108512555B (en) * | 2018-03-13 | 2021-09-24 | 中国工程物理研究院电子工程研究所 | Method for identifying system RS code order and primitive polynomial |
Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20060224935A1 (en) * | 2005-04-01 | 2006-10-05 | Cameron Kelly B | System correcting random and/or burst errors using RS (Reed-Solomon) code, turbo/LDPC (Low Density Parity Check) code and convolutional interleave |
US20060224934A1 (en) * | 2005-04-01 | 2006-10-05 | Cameron Kelly B | System correcting random and/or burst errors using RS (Reed-Solomon) code, turbo/LDPC (Low Density Parity Check) code and convolutional interleave |
CN101534168A (en) * | 2009-04-16 | 2009-09-16 | 中国电子科技集团公司第五十四研究所 | Blind identification method of coding parameters of RS code of error-tolerant code |
CN101582744A (en) * | 2009-06-19 | 2009-11-18 | 重庆邮电大学 | Encoding and decoding method of RS fountain codes based on iterative approach |
CN102201883A (en) * | 2010-03-23 | 2011-09-28 | 中国电子科技集团公司第三十六研究所 | Reed-solomon (RS) code coding parameter blind identification method |
-
2013
- 2013-08-07 CN CN201310341578.9A patent/CN103399749B/en not_active Expired - Fee Related
Patent Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20060224935A1 (en) * | 2005-04-01 | 2006-10-05 | Cameron Kelly B | System correcting random and/or burst errors using RS (Reed-Solomon) code, turbo/LDPC (Low Density Parity Check) code and convolutional interleave |
US20060224934A1 (en) * | 2005-04-01 | 2006-10-05 | Cameron Kelly B | System correcting random and/or burst errors using RS (Reed-Solomon) code, turbo/LDPC (Low Density Parity Check) code and convolutional interleave |
CN101534168A (en) * | 2009-04-16 | 2009-09-16 | 中国电子科技集团公司第五十四研究所 | Blind identification method of coding parameters of RS code of error-tolerant code |
CN101582744A (en) * | 2009-06-19 | 2009-11-18 | 重庆邮电大学 | Encoding and decoding method of RS fountain codes based on iterative approach |
CN102201883A (en) * | 2010-03-23 | 2011-09-28 | 中国电子科技集团公司第三十六研究所 | Reed-solomon (RS) code coding parameter blind identification method |
Non-Patent Citations (1)
Title |
---|
"FPGA内RS编码器的3种算法实现";胡国庆等;《无线通信技术》;20090418;全文 * |
Also Published As
Publication number | Publication date |
---|---|
CN103399749A (en) | 2013-11-20 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Jin et al. | Construction of optimal locally repairable codes via automorphism groups of rational function fields | |
Jin et al. | Application of classical Hermitian self-orthogonal MDS codes to quantum MDS codes | |
KR20130111211A (en) | Generating text manipulation programs using input-output examples | |
CN104298672A (en) | Error correction method and device for input | |
CN102201883B (en) | Reed-solomon (RS) code coding parameter blind identification method | |
Cai et al. | On optimal locally repairable codes with multiple disjoint repair sets | |
Cai et al. | A new construction of zero-difference balanced functions and its applications | |
EP2863566A1 (en) | Method and apparatus for reconstructing a data block | |
Choi et al. | Weight distribution of some cyclic codes | |
CN103399749B (en) | RS code based on MFC dialog box coding and recognition methods | |
Langberg et al. | Coding for the $\boldsymbol\ell _\infty $-Limited Permutation Channel | |
Korchmáros et al. | Codes and gap sequences of Hermitian curves | |
CN102201882B (en) | Blind identification method for coding parameters of linear block codes | |
Titchener et al. | Deterministic complexity and entropy | |
CN105373527A (en) | Omission recovery method and question-answering system | |
Ouldridge et al. | Thermodynamics of deterministic finite automata operating locally and periodically | |
Daykin et al. | String comparison and Lyndon-like factorization using V-order in linear time | |
CN103701590A (en) | Dictionary-based complex password traversing method and device | |
US7970134B2 (en) | Method for generating, operating, and using a sparse w-NAF key for encryption | |
CN111126012B (en) | Custom generation expression method and device | |
Hao et al. | On the weight hierarchy of locally repairable codes | |
Galindo et al. | Locally recoverable J-affine variety codes | |
Anzis et al. | Error-correction of linear codes via colon ideals | |
Sun | A note on equivariantization of additive categories and triangulated categories | |
Molinier | Cohomology with twisted coefficients of the classifying space of a fusion system |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
C14 | Grant of patent or utility model | ||
GR01 | Patent grant | ||
CF01 | Termination of patent right due to non-payment of annual fee | ||
CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20161005 Termination date: 20200807 |