CN101969358B - High-speed parallel RS decoding method for space communication - Google Patents
High-speed parallel RS decoding method for space communication Download PDFInfo
- Publication number
- CN101969358B CN101969358B CN 201010297884 CN201010297884A CN101969358B CN 101969358 B CN101969358 B CN 101969358B CN 201010297884 CN201010297884 CN 201010297884 CN 201010297884 A CN201010297884 A CN 201010297884A CN 101969358 B CN101969358 B CN 101969358B
- Authority
- CN
- China
- Prior art keywords
- decoding
- afterwards
- data
- parameter
- equal
- 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.)
- Active
Links
Images
Abstract
The invention relates to a high-speed parallel Reed-Solomon (RS) decoding method for space communication. In the method, two decoding modules RS (255, 223) and RS (255, 239) are configured simultaneously, so that a decoder can configure decoding types on line according to coding parameters to flexibly adapt to two coding formats specified by the consultative committee for space data system (CCSDS) standard; input data is filled and acquired in first in first out (FIFO) by ping-pong operation during deinterlacing and interlacing, a multi-channel parallel pipeline mode is adopted during decoding, and a composite structure ensures the maximization of system performance and realizes the minimization of resources and is suitable for 1 to 8 arbitrary interlacing depths; and measures such as multi-channel parallel RS decoding, the optimization of realization logic of a finite field multiplier, and the like are adopted, so that decoding rate is greatly improved. The method can be directly applied to a high-code-rate remote sensing satellite ground receiving system and can further increase parallelism degree and improve performance when necessary by modular design.
Description
Technical field
The present invention relates to a kind of high speed decoding method that is used for the RS coding of space communication; Be mainly used in the space communication terrestrial channel decoder data after demodulating is carried out High-Speed RS decoding; Correct the Channel Transmission mistake, also can be used in the data demodulates receiving equipment of other application direction.
Background technology
The RS sign indicating number is one type of multi-system BCH code with very strong error correcting capability, also is the Algorithms of Algebraic Geometric Codes of a quasi-representative.It is at first used the MS multinomial by Reed and Solomon and constructs in nineteen sixty.RS sign indicating number with the MS polynomial construction is a nonsystematic code, and can produce systematic code with the BCH code building method.Add 1 because the minimum range of the maximum possible of linear code is the number of verification unit, and the RS sign indicating number is accomplished this point just, therefore, claims that the RS sign indicating number is very big minimum distance seperable code (a MDS sign indicating number).The RS sign indicating number is particularly suitable in fading channel, using, to overcome sudden mistake.Just owing to its superior performance, the RS sign indicating number is obtained extensive use in fields such as deep space communication, digital audio/video communication, magnetic recording medias, and it is to use error correction coding the most widely at present.
RS (255,223) or RS (255,239) sign indicating number that space communication uses the RS sign indicating number to recommend as consultative committee for space data system (CCSDS), these two kinds of sign indicating number basic coding parameters are identical, mainly are that error correcting capability is different.The adoptable interleave depth of CCSDS regulation RS sign indicating number is 1,2,3,4,5,8 totally 6 kinds.In different satellite communication systems, often selected different RS type of codings and different interleave depths for use, this has just just brought very big difficulty to space communication with the development of RS decoder.The interpretation method that existing RS decoder adopts realizes deinterleaving and decode procedure respectively that generally the advantage of doing like this is that implementation is simple, and shortcoming is that flexibility is not enough.The decode procedure of RS decoder need carry out a large amount of finite field operations, and wherein the multiplying unit is maximum and also maximum to the decoding velocity effect.Because the multiplier that uses in the RS decoder at present through optimizing, causes the work clock of decoder can not be too high.Simultaneously, improve constantly because the remote sensing satellite number passes bit rate, it is just bigger further to improve the bit rate difficulty on the basis of different RS coded formats of compatibility and interleave depth.
At present common in the various types of communication system all is the RS decoder of low bit rate rate usually, and general bit rate is at tens bit/s; Space communication uses the highest decoding speed of RS decoder single channel at present as about 470Mbps, and simultaneously compatible RS (255,223) with RS (255,239) yard, the interleave depth that can adapt to is generally fixed value.
Summary of the invention
Technology of the present invention is dealt with problems and is: the deficiency that overcomes prior art; A kind of high speed decoding method that is used for the RS coding of space communication is provided; This interpretation method is compatible RS (255 simultaneously; 223) and RS (255,239) sign indicating number and any interleave depth (1-8), and decoding speed is far above prior art.
Technical solution of the present invention is:
A kind of high-speed parallel RS interpretation method that is used for space communication, step is following:
(1) parameter of decode procedure is set, said parameter comprises pass-through state parameter, interleave depth parameter, total frame length, decoding type parameter;
(2) judge according to the pass-through state parameter that is provided with in the step (1) whether decode procedure is pass-through state, if pass-through state then will be imported data and directly export; If not pass-through state then gets into step (3);
(3) by the frame length counter input data are counted; Whether the count results according to the total frame length judgment frame long counter that is provided with in the step (1) equals total frame length; If be not equal to total frame length; Then data are write among i the input FIFO, the count results of frame length counter adds 1 simultaneously, gets into step (4) afterwards; If equal total frame length, the data that then read among all input FIFO get into step (5) afterwards; Said i is 1 natural number between the interleave depth parameter, and the initial value of i is 1;
(4) judge whether i equals the interleave depth parameter,, then i is initialized as 1 and returns step (3) afterwards if equal; If be not equal to, then return afterwards step (3) for i the i+1 assignment;
(5) judge that according to the decoding type parameter using any decoding module to carry out RS deciphers,, then use the RS223 decoding module to carry out RS decoding, decoding data are afterwards imported among j the output FIFO, get into step (6) afterwards if the decoding type parameter is 255/223; If the decoding type parameter is 255/239, then use the RS239 decoding module to carry out RS decoding, the data after the decoding are imported among j the output FIFO, get into step (6) afterwards; Said j is 1 natural number between the interleave depth parameter, and the initial value of j is 1;
(6) judge that whether j output FIFO is empty, if empty, then gets into step (7); If be not empty, then reading of data and output from j output FIFO gets into step (8) afterwards;
(7) judge whether j equals the interleave depth parameter,, then return afterwards step (6) for j the j+1 assignment if be not equal to; If equal, then return step (2);
(8) judge whether j equals the interleave depth parameter,, then j is initialized as 1 and returns step (6) afterwards if equal; If be not equal to, then return afterwards step (6) for j the j+1 assignment.
The middle RS223 of use of said step (5) decoding module carries out RS decoding and uses the RS239 decoding module to carry out RS decoding and carry out according to following steps:
(a) data that receive are deposited in the receiving sequence buffer memory wait for correction process, simultaneously, the said data that receive with Horner algorithm computation syndrome S, are got into step (b) afterwards;
(b) use the RiBM algorithm to try to achieve error location polynomial and improper value multinomial, get into step (c) afterwards by the syndrome S that obtains in the step (a);
(c) utilize the error location polynomial that obtains in the step (b) to make the searching algorithm mistake in computation position of spending money; Utilize the improper value multinomial that obtains in the step (b) to use Forney algorithm computation improper value simultaneously, according to said errors present and improper value the data of waiting for correction process in the receiving sequence buffer memory in the step (a) are carried out correction process and output afterwards.
Employed multiplication calculates according to following formula and realizes in said Horner algorithm, RiBM algorithm, money searching algorithm and the Forney algorithm:
C＝AB＝d+Q
Te＝Lb+Q
TUb，
Wherein, C is the product of A and B,
The vector representation of A is a=[a
0, a
1..., a
M-1]
TThe vector representation of B is b=[b
0, b
1..., b
M-1]
T,
Q is for satisfying α
↑The matrix of=Q α modp (α), p (α) is GF (2
m) primitive polynomial in territory, α is the root of primitive polynomial, α
↑=[α
m, α
M+1..., α
2m-1]
TThe present invention's beneficial effect compared with prior art is:
(1) the present invention makes decoder decipher type, above-mentioned two kinds of coded formats of flexible adaptation CCSDS standard code according to the coding parameter Configuration Online through disposing RS (255,223) and two kinds of decoding modules of RS (255,239) simultaneously;
(2) the present invention through in deinterleaving and interleaving process, adopt ping-pong operation accomplish the input data in FIFO filling and obtain; And in decode procedure, adopt the mode of multidiameter delay flowing water; Guarantee the maximization of systematic function and realized minimizing of resource through this composite construction, and can adapt to any interleave depth of 1 to 8;
(3) the present invention is through taking the measures such as realization logic of multidiameter delay RS decoding, optimization Galois field multiplier; Improved decoding rate greatly; Can directly apply to high bit rate remote sensing satellite ground receiving system; Through adopting modularized design, can further increase degree of parallelism when needed and improve performance.
Description of drawings
Fig. 1 forms sketch map for RS code decoder of the present invention;
Fig. 2 is a RS decoder process chart of the present invention;
Fig. 3 is a high-speed parallel RS interpretation method flow chart of the present invention.
Embodiment
Further describe in detail below in conjunction with the accompanying drawing specific embodiments of the invention.
The RS sign indicating number is a kind of chnnel coding form, and it belongs to linear block codes.Because the RS sign indicating number is to be based upon on the basis of finite field algebraically to make up, and is well suited for being used for the multi-system modulating system.The main application of RS sign indicating number is to overcome the unexpected error that produces in the fading channel, and it also usually uses as ISN and convolution code cascade, so that obtain bigger coding gain.Since in the space communication owing to often run into the unexpected error that lightning etc. causes, so RS is well suited in space communication, using.Be accompanied by the development of space communications technique, the transfer of data bit rate improves constantly, and the RS decoding rate also needs corresponding raising to adapt to growth requirement.The present invention mainly solves the problem that how to improve decoding rate in the realization of RS decoder; Interpretation method through adopting the present invention to propose can increase substantially decoding rate, compatible RS (255; 223) and RS (255; 239) two kinds of coded formats, and adapt to any interleave depth of 1 to 8, can directly apply to high bit rate remote sensing satellite ground receiving system.
Be illustrated in figure 1 as RS code decoder of the present invention and form sketch map; The present invention deciphers part and adopts 8 road parallel organizations, each road to include input FIFO, output FIFO; Decoding type gate; Decoding nuclear is formed, and like this can decoding speed accelerates greatly and can decipher needs according to reality and select interleave depth, and adapt to any interleave depth of 1 to 8.
High-speed parallel RS interpretation method of the present invention is as shown in Figure 3, carries out according to following steps:
(1) parameter of decode procedure is set, said parameter comprises pass-through state parameter, interleave depth parameter, total frame length, decoding type parameter; The pass-through state parameter is for more flexible when the RS decoder uses, and selecting to lead directly to when not needing RS decoding can be with data without directly output of decoding; The interleave depth parameter is any natural number of 1 to 8; Total frame length is confirmed to get final product according to the practical communication agreement; The decoding type parameter refers to that the RS coded format of using in the communication system is specially any of RS (255,233) or RS (255,239) sign indicating number.
(2) judge according to the pass-through state parameter that is provided with in the step (1) whether decode procedure is pass-through state, if pass-through state then will be imported data and directly export; If not pass-through state then gets into step (3).
What step 3 and step 4 were described is the process partly that interweaves, and belongs to ping-pong operation.
(3) by the frame length counter input data are counted; Whether the count results according to the total frame length judgment frame long counter that is provided with in the step (1) equals total frame length; If be not equal to total frame length; Then data are write among i the input FIFO, the count results of frame length counter adds 1 simultaneously, gets into step (4) afterwards; If equal total frame length, the data that then read among all input FIFO get into step (5) afterwards; Said i is 1 natural number between the interleave depth parameter, and the initial value of i is 1; Accomplish the deinterleaving process through this step, interleaving data is reverted to the output format of single channel RS coding.The frame length counter is exactly to be used for a counter of continuous data frame length.
(4) judge whether i equals the interleave depth parameter, and the interleave depth parameter sets when being the first step,, then i is initialized as 1 and returns step (3) afterwards if equal; If be not equal to, then return afterwards step (3) for i the i+1 assignment.
(5) judge that according to the decoding type parameter using any decoding module to carry out RS deciphers; If the decoding type parameter is 255/223; Then use the RS223 decoding module to carry out RS decoding, the data after the decoding are exported among j the output FIFO, get into step (6) afterwards; If the decoding type parameter is 255/239, then use the RS239 decoding module to carry out RS decoding, the data after the decoding are exported among j the output FIFO, get into step (6) afterwards; Said j is 1 natural number between the interleave depth parameter, and the initial value of j is 1; This step realizes RS decoding through the decoder that calls corresponding RS type, and the RS decode procedure comprises 5 modules, shown in accompanying drawing 2.
1) with the Horner algorithm by the syndrome that calculates that receives;
2) try to achieve error location polynomial and improper value multinomial by Si with the key equation solving algorithm with the RiBM algorithm;
3) search method of spending money is tried to achieve the root of error location polynomial, obtains the errors present number, confirms errors present;
4) try to achieve improper value with the Forney algorithm by the improper value multinomial, obtain improper value;
5) deduct improper value by the input data at corresponding errors present place at last, accomplish error correction.
If the receiving sequence multinomial is R (x)=r
N-1x
N-1+ ...+r
iX+r
0, then consider the data input condition of decoding algorithm, syndrome can be expressed as by the Horner algorithm computation:
i＝1，2，…D-1
Finding the solution the Horner algorithm of syndrome, the RiBM algorithm of finding the solution key equation, the Forney algorithm of finding the solution " the money search method " of errors present and finding the solution improper value has had fairly perfect achievement in research, belongs to the known technology of this area.But use in the process of these several kinds of algorithm computation; Can relate to a lot of multiplyings, in other words, the speed of a large amount of multiplyings has also just determined the execution speed of these several kinds of algorithms; Therefore; The present invention has designed a kind of method of new multiplying, has accelerated the arithmetic speed of these several kinds of algorithms greatly, thereby has improved the speed of decoding on the whole.
Following several steps belongs to the process of deinterleaving part, belongs to ping-pong operation.
(6) judge that whether j output FIFO is empty, if empty, then gets into step (7); If be not empty, then reading of data and output from i output FIFO gets into step (8) afterwards.
(7) judge whether j equals the interleave depth parameter,, then return afterwards step (6) for j the j+1 assignment if be not equal to; If equal, then return step (2).
(8) judge whether j equals the interleave depth parameter,, then j is initialized as 1 and returns step (6) afterwards if equal; If be not equal to, then return afterwards step (6) for j the j+1 assignment.
Employed multiplication calculates according to following formula and realizes in said Horner algorithm, RiBM algorithm, money searching algorithm and the Forney algorithm:
C＝AB＝d+Q
Te＝Lb+Q
TUb，
Wherein, C is the product of A and B,
The vector representation of A is a=[a
0, a
1..., a
M-1]
TThe vector representation of B is b=[b
0, b
1..., b
M-1]
T,
Q is for satisfying α
↑The matrix of=Q α modp (α), p (α) is GF (2
m) primitive polynomial in territory, be known content, so α is the root of primitive polynomial, contents known just, α
↑=[α
m, α
M+1..., α
2m-1]
TTherefore, from top these conditions, can obtain the value of Q, and then obtain product.
The realization of the element multiplication on two galois fields is difficulty comparatively, can be with the method realization of checking numerical table and antilogarithm table when software is realized; , then realizes by hardware in realizing with combinational logic.In the algebraic(al) decoder of RS sign indicating number, Galois field multiplier is to use at most and the maximum parts of time delay, and its calculation delay has determined the working clock frequency of decoder.How realizing Galois field multiplier, reduce its arithmetic time delay, improve the performance of RS code decoder, is a key issue will considering in the RS code decoder implementation procedure.Other computing in the finite field, for example division, invert and can realize indirectly with multiplier.In engineering practice, the most frequently used Galois field multiplier is nature base multiplier and antithesis-basic naturally multiplier.
Galois field multiplier can be divided into two kinds of bit serial multiplier and bit parallel multipliers from implementation structure.The bit serial multiplier architecture is realized going up fairly simple, and the area complexity is O (m), but because computing is undertaken by bit, the realization of High Speed difficulty is bigger.The bit parallel multiplier connects through circuit, directly realizes the result of output multidigit computing, can significantly improve processing speed, and the area complexity is O (m2).Be exactly mixing (Hybrid) structure of string and combination in addition.Remove the influence of implementation structure, the complexity that Galois field multiplier is realized the substrate main and territory is closely related.
The low complexity bit parallel finite territory multiplication algorithm that this method adopts, its main design philosophy are to do the processing that a similar LU decomposes, and greatly reduce the hardware implementation complexity, and tactical rule, and processing speed is fast.Its principle introduction is following.
If p (α) is GF (2
m) primitive polynomial in territory, α is the root of primitive polynomial, A, B are the element among the C=AB,
The vector representation of A is a=[a
0, a
1..., a
M-1]
TSimilarly, the vector representation of B is b=[b
0, b
1..., b
M-1]
TIntroduce GF (2
m) in variable α
↑(m-1) * and m rank matrix Q, satisfy:
α
↑＝Q·αmodp(α)
Wherein
α
↑＝[α
m，α
m+1，…，α
2m-1]
T
Introduce matrix:
If:
d＝Lb
e＝Ub
Then can prove and draw:
C＝AB＝d+Q
Te
Through a large amount of emulation and engineering test, use this method can make the RS decoding rate reach 1.2Gbit/s, the performance index of the decoder of the same type that is superior to delivering in the present document, the present invention when needed can also further improve performance through increasing degree of parallelism.
The content of not doing to describe in detail in the specification of the present invention belongs to the known technology of this area.
Claims (3)
1. high-speed parallel RS interpretation method that is used for space communication is characterized in that step is following:
(1) parameter of decode procedure is set, said parameter comprises pass-through state parameter, interleave depth parameter, total frame length, decoding type parameter;
(2) judge according to the pass-through state parameter that is provided with in the step (1) whether decode procedure is pass-through state, if pass-through state then will be imported data and directly export; If not pass-through state then gets into step (3);
(3) by the frame length counter input data are counted; Whether the count results according to the total frame length judgment frame long counter that is provided with in the step (1) equals total frame length; If be not equal to total frame length; Then data are write among i the input FIFO, the count results of frame length counter adds 1 simultaneously, gets into step (4) afterwards; If equal total frame length, the data that then read among all input FI FO get into step (5) afterwards; Said i is 1 natural number between the interleave depth parameter, and the initial value of i is 1;
(4) judge whether i equals the interleave depth parameter,, then i is initialized as 1 and returns step (3) afterwards if equal; If be not equal to, then return afterwards step (3) for i the i+1 assignment;
(5) judge that according to the decoding type parameter using any decoding module to carry out RS deciphers,, then use the RS223 decoding module to carry out RS decoding, decoding data are afterwards imported among j the output FIFO, get into step (6) afterwards if the decoding type parameter is 255/223; If the decoding type parameter is 255/239, then use the RS239 decoding module to carry out RS decoding, the data after the decoding are imported among j the output FIFO, get into step (6) afterwards; Said j is 1 natural number between the interleave depth parameter, and the initial value of j is 1;
(6) judge that whether j output FIFO is empty, if empty, then gets into step (7); If be not empty, then reading of data and output from j output FIFO gets into step (8) afterwards;
(7) judge whether j equals the interleave depth parameter,, then return afterwards step (6) for j the j+1 assignment if be not equal to; If equal, then return step (2);
(8) judge whether j equals the interleave depth parameter,, then j is initialized as 1 and returns step (6) afterwards if equal; If be not equal to, then return afterwards step (6) for j the j+1 assignment.
2. according to the said a kind of high-speed parallel RS interpretation method that is used for space communication of claim 1, it is characterized in that the middle RS223 of use of said step (5) decoding module carries out RS decoding and uses the RS239 decoding module to carry out RS decoding and carry out according to following steps:
(a) data that receive are deposited in the receiving sequence buffer memory wait for correction process, simultaneously, the said data that receive with Horner algorithm computation syndrome S, are got into step (b) afterwards;
(b) use the RiBM algorithm to try to achieve error location polynomial and improper value multinomial, get into step (c) afterwards by the syndrome S that obtains in the step (a);
(c) utilize the error location polynomial that obtains in the step (b) to make the searching algorithm mistake in computation position of spending money; Utilize the improper value multinomial that obtains in the step (b) to use Forney algorithm computation improper value simultaneously, according to said errors present and improper value the data of waiting for correction process in the receiving sequence buffer memory in the step (a) are carried out correction process and output afterwards.
3. according to the said a kind of high-speed parallel RS interpretation method that is used for space communication of claim 2, it is characterized in that employed multiplication calculates according to following formula and realizes in said Horner algorithm, RiBM algorithm, money searching algorithm and the Forney algorithm:
C＝AB＝d+Q
Te＝Lb+Q
T?Ub，
Wherein, C is the product of A and B,
α
i∈ 0,1},
α
i∈ 0, and 1}, the vector representation of A is a=[a
0, a
1..., a
M-1]
TThe vector representation of B is b=[b
0, b
1..., b
M-1]
T, d=Lb, e=Ub,
Q is for satisfying α
↑The matrix of=Q α modp (α) and Q are (m-1) * m rank matrixes, and p (α) is GF (2
m) primitive polynomial in territory, α is the root of primitive polynomial, α
↑=[α
m, α
M+1..., α
2m-1]
T
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201010297884 CN101969358B (en) | 2010-09-29 | 2010-09-29 | High-speed parallel RS decoding method for space communication |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201010297884 CN101969358B (en) | 2010-09-29 | 2010-09-29 | High-speed parallel RS decoding method for space communication |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101969358A CN101969358A (en) | 2011-02-09 |
| CN101969358B true CN101969358B (en) | 2012-12-26 |
Family
ID=43548465
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 201010297884 Active CN101969358B (en) | 2010-09-29 | 2010-09-29 | High-speed parallel RS decoding method for space communication |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101969358B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102361460B (en) * | 2011-07-28 | 2013-10-16 | 航天恒星科技有限公司 | General high speed parallel cycle interleaving Viterbi decoding method |
| CN102938653B (en) * | 2012-11-13 | 2016-06-01 | 航天恒星科技有限公司 | A kind of parallel RS decoding method utilizing graphic process unit GPU to realize |
| CN103795425A (en) * | 2014-01-27 | 2014-05-14 | 中国电子科技集团公司第十研究所 | Code rate compatible RS code decoder |
| CN103929209A (en) * | 2014-04-09 | 2014-07-16 | 西安电子科技大学 | High-performance combined RS processor based on FPGA |
| CN114499767B (en) * | 2022-04-14 | 2022-08-05 | 苏州联讯仪器有限公司 | Data transmission system and RS encoding device and method thereof |
| CN116881183A (en) * | 2023-09-06 | 2023-10-13 | 北京融为科技有限公司 | Method and device for processing decoded data |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101262305A (en) * | 2008-04-23 | 2008-09-10 | 中兴通讯股份有限公司 | A Reed-Solomon code coding method and device |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR100515472B1 (en) * | 2002-10-15 | 2005-09-16 | 브이케이 주식회사 | Channel coding and decoding method and multiple-antenna communication systems performing the same |
-
2010
- 2010-09-29 CN CN 201010297884 patent/CN101969358B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101262305A (en) * | 2008-04-23 | 2008-09-10 | 中兴通讯股份有限公司 | A Reed-Solomon code coding method and device |
Non-Patent Citations (4)
| Title |
|---|
| 《CCSDS-RS(255,223)码高速译码器的硬件实现研究》;张拯宁等;《中国空间科学技术》;20091031;第75页-82页 * |
| 《CCSDS标准Reed-Solomon码编码参数的研究》;张拯宁等;《航天器工程》;20090731;第49页-53页 * |
| 张拯宁等.《CCSDS-RS(255 223)码高速译码器的硬件实现研究》.《中国空间科学技术》.2009 |
| 张拯宁等.《CCSDS标准Reed-Solomon码编码参数的研究》.《航天器工程》.2009,第49页-53页. |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101969358A (en) | 2011-02-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101969358B (en) | High-speed parallel RS decoding method for space communication | |
| Forney | Concatenated codes. | |
| CN101453221B (en) | Mapper based on bit weaving code modulation system and mapping process thereof | |
| CN101478314B (en) | Reed-solomon coder-decoder and decoding method thereof | |
| CN1685621B (en) | Method and apparatus for deinterleaving interleaved data stream in a communication system | |
| CN101902228B (en) | Rapid cyclic redundancy check encoding method and device | |
| CN101277119B (en) | Method for complexing hardware of Reed Solomon code decoder as well as low hardware complex degree decoding device | |
| CN102122964A (en) | Implementation method of high-speed reed-solomon (RS) codec based on field programmable gate array (FPGA) | |
| CN105322973B (en) | A kind of RS code coder and coding method | |
| JP7012479B2 (en) | Reed-Solomon Decoder and Decoding Method | |
| CN102231631B (en) | The coding method of RS encoders and RS encoders | |
| CN109525365A (en) | A kind of channel coding and modulating system and method passed applied to unmanned plane figure | |
| CN101777926A (en) | General decoder of Turbo product code and method thereof | |
| CN101779379B (en) | Encoding and decoding using generalized concatenated codes (GCC) | |
| CN101834615B (en) | Implementation method of Reed-Solomon encoder | |
| CN101488762B (en) | Area compact and fast BCH parallel decoding method | |
| CN101764621B (en) | Method for realizing compatibility of short code and subcode in satellite-based (8176, 7156) LDPC coder | |
| CN103023603A (en) | Method for realizing bit-interleaved coded modulation based on low-density parity-check (LDPC) matrix | |
| CN101964664A (en) | Multi-mode Reed-Solomon decoder structure suitable for CMMB | |
| CN101848001B (en) | Data length expanding method of BCH (broadcast Channel) coding and decoding in Flash controller | |
| CN102355331A (en) | Universal multi-mode decoding device | |
| CN102045073A (en) | Method and device for decoding broadcast channel (BCH) code | |
| CN106034007A (en) | Signaling coding modulation method, signaling demodulation decoding method and signaling demodulation decoding device | |
| CN101001089B (en) | Money search method and device in error correction decode | |
| CN101777922B (en) | High-speed and low-delay Berlekamp-Massey iteration decoding circuit for broadcast channel (BCH) decoder |
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 |