CN102651653A - Low-complexity joint source-channel encoding and decoding method based on space lattice diagram - Google Patents
Low-complexity joint source-channel encoding and decoding method based on space lattice diagram Download PDFInfo
- Publication number
- CN102651653A CN102651653A CN2011100470944A CN201110047094A CN102651653A CN 102651653 A CN102651653 A CN 102651653A CN 2011100470944 A CN2011100470944 A CN 2011100470944A CN 201110047094 A CN201110047094 A CN 201110047094A CN 102651653 A CN102651653 A CN 102651653A
- Authority
- CN
- China
- Prior art keywords
- symbol
- source
- decoding
- space networks
- low
- 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.)
- Granted
Links
Images
Landscapes
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
The invention relates to a low-complexity joint source-channel encoding and decoding method based on a space lattice diagram. In a low-complexity joint source-channel encoding and decoding system based on the space lattice diagram, each symbol in an information source assembly is endowed with a weight (named a symbol weight) in probability correlation with the symbol. At the encoding end, the symbol sequence has three constraint values, namely an accumulated symbol number, an accumulated bit number and an accumulated symbol weight, after being subjected to variable-length encoding. At the decoding end, the three constraint values are utilized to construct the space lattice diagram, the three-dimensional coordinates of the space lattice diagram respectively signify 'symbol number index', 'bit status index' and 'weight status index'. A redundant status transfer path on the space lattice diagram is removed firstly, then status nodes and status transfer branches on the space lattice diagram are projected on a two-dimensional plane to generate a simplified variable-length information source code lattice diagram, and the symbol-level maximum posterior probability decoding algorithm is adopted to realize the low-complexity joint source-channel encoding and decoding method.
Description
Technical field
The present invention relates to communicate by letter a kind of combined signal source channel decoding method in encoding and decoding field particularly relates to a kind of low-complexity joint message source and channel decoding method based on the space networks trrellis diagram.
Background technology
In present communication system, generally all follow " separation theorem " (Separation Theory) of Shannon, be about to the independent optimization design respectively of source encoding and chnnel coding, can make communication system obtain the forced coding performance.But the prerequisite of " separation theorem " is: no matter source encoding, or chnnel coding, suppose the time delay that can tolerate endless (allow coding block length unlimited); Grasp the statistical property of transmission channel in advance.In reality, constraints such as the complexity of encoding and decoding, the resource of software and hardware and communication delay make practical communication system can't satisfy this condition, and source encoding and chnnel coding can't obtain the optimum code performance respectively, so the performance of piece-rate system is restricted.
For this reason, people have proposed the combined signal source channel decoding method, and its main thought is to utilize after the source encoding in the code word residual redundant information to carry out chnnel coding, with signal source and channel combined design.
In recent years; The combined optimization design problem of information source variable long codes and channel Turbo coding becomes the focus of coding circle research; Scholars have proposed several kinds of combined signal source channel Turbo code decode algorithms, are to decode in the basis but existing algorithm all is a grid chart with bit-level.Bit-level grid chart decoding algorithm can not make full use of the residue redundancy properties of information source variable-length encoding, can not reach optimum coding effect, adopts variable-length symbol incompatible with existing image and video source coding standard simultaneously.Survivor path is many in this grid chart, needs repeatedly iteration for obtaining good interference free performance, and the decoding end amount of calculation is big, and complexity is high.In fact; According to the forced coding theorem, the binary sequence of information source variable length encoder output is to be made up of several Variable Length Codes VLC (Variable Length Coding is called for short VLC) code-word symbol cascade; With the processing unit of VLC code-word symbol as channel decoding; The variable-length coding method that meets information source more can be realized integrated source and channel variable-length decoding, improves the coding and decoding performance.
Summary of the invention
In order to solve the problem that state transitions branch is many, computation complexity is high in traditional elongated source code plane net trrellis diagram; The present invention is through making up a kind of new variable-length symbol grid chart and coding and decoding structure; Proposed a kind of low-complexity joint message source and channel decoding method based on the space networks trrellis diagram, this method has designed a kind of building method and corresponding decoding method of space networks trrellis diagram.
The technical solution adopted for the present invention to solve the technical problems is: in the low-complexity joint message source and channel coding/decoding system based on the space networks trrellis diagram; Each symbol in the information source set is given a weight relevant with this symbol probability, is called " symbol weight ".At coding side; Symbol sebolic addressing has " accumulative total symbolic number ", " accumulative total bit number " and " accumulative total symbol weight " three binding occurrences behind Variable Length Code; Utilize this three binding occurrence structure space networks trrellis diagrams in decoding end; According to the space networks trrellis diagram, symbolization level maximum a posteriori probability decoding algorithm is realized low-complexity joint message source and channel decoding method.The three-dimensional coordinate of space networks trrellis diagram is represented " symbol numbers index ", " bit status index " and " weight state index " respectively.Earlier the redundant state transfer path on the space networks trrellis diagram is removed; Again state node on the space networks trrellis diagram and state transitions branch are projected on the two dimensional surface of " symbol numbers index " and " bit status index "; Transfer relationship in keeping scheming between the state node is constant, generates the variable length source code grid chart of simplifying, according to the variable length source code grid chart of simplifying; Symbolization level maximum a posteriori probability decoding algorithm is realized combined signal source channel decoding.
With respect to the plane net trrellis diagram, the space networks trrellis diagram has been given weights for each symbol, and for decoding end has increased a constraints when making up grid chart, this makes the state transitions branch in the grid chart reduce.More excellent " symbol weight " setting can be simplified elongated source code grid chart largely; And then reduce the complexity and the error sign ratio of elongated symbol level maximum a posteriori probability decoding algorithm largely, can obtain more excellent symbol weight setting through the distinct symbols sequence from same information source set is experimentized.
Can be applied in variable length Turbo code associating coding/decoding system and variable length code separates in the system of coding, combined decoding with convolution code based on the low-complexity joint message source and channel decoding method of space networks trrellis diagram.
The invention has the beneficial effects as follows; Make up the space networks trrellis diagram through giving a weight relevant with this symbol probability to each symbol in the information source set; State transitions numbers of branches in the variable length source code grid chart that has used when having reduced the decoding of symbol level maximum a posteriori probability, thus the amount of calculation that the symbol level maximum a posteriori probability is decoded reduced, reduced error sign ratio simultaneously; Improve combined signal source channel encoding and decoding performance, be applicable to variable length encoding and decoding transmission systems such as image, video compression.
Description of drawings
Fig. 1 is based on the low-complexity joint message source and channel coding/decoding system of space networks trrellis diagram.
Among Fig. 1; 1. Variable Length Code module, 2. symbol sebolic addressing side information computing module, 3. joint source-channel coding module; 4. channel; 5. based on the combined signal source channel decoding module of space networks trrellis diagram, 6. source symbol sequence U, 7. Variable Length Code output code flow; 8. symbol sebolic addressing side information; 9. joint source-channel coding output code flow, the 10. codeword sequence that receives of decoding end, 11. behind combined signal source channel decoding, obtain symbol sebolic addressing is estimated
Fig. 2 is based on the low-complexity joint signal source channel decoding method flow diagram of space networks trrellis diagram.
Fig. 2 is the refinement of module 5 among Fig. 1.Among Fig. 2; 10. the codeword sequence that receives of decoding end; 11. the symbol sebolic addressing that behind combined signal source channel decoding, obtains estimates that
12. is according to side information structure space networks trrellis diagram; 13. the elongated source code grid chart that structure is simplified, 14. symbol level maximum a posteriori probability combined signal source channel decodings.
Fig. 3 space networks trrellis diagram.
15. expression Z coordinates " bit status index v " among Fig. 3; 16. expression Y coordinate " weight state index w "; 17. expression X coordinate " symbol numbers index k ", each scale represent a symbol time at interval, black circles is represented state node among the figure, the possible state transitions of line segment representative between state node; 18. expression grid chart initial condition (k=0, v
0=0, w
0=0); 20, five the possible state transitions branches (this figure be the instance of space networks trrellis diagram, used information source gather and parameter see table 1) of 21,22,23,24 expressions during k=0; 29,30,31,32 be expressed as the intermediateness node; 19. expression grid chart state of termination (k=5, v
5=5, w
5=7); The symbol sebolic addressing path of a complete survival of 20,25,26,27,28 expressions among the figure; Show initial condition 18 beginnings from grid chart, the symbol in the information source of encoding the successively set arrives the state of termination 19 of grid chart through intermediateness node 29,30,31,32.
Table 1 variable length code word and weighted value table
The elongated source code grid chart that Fig. 4 simplifies.
Fig. 4 is the elongated source code grid chart of simplification, is projected on the XZ plane by Fig. 3 to obtain.Wherein, 17. expression abscissas " symbol numbers index k ", each scale representes that a symbol time is at interval; 33. expression ordinate " bit status index v ", 15 in the corresponding diagram 3.Black circles among the figure is represented state node, the possible state transitions of line segment representative between state node; 34. initial condition (k=0, the v of grid chart are represented in expression
0=0), 18 in the corresponding diagram 3; 36,37,38,39,40 represent that respectively five bar states shift branch when k=0, respectively 20,21,22,23,24 in the corresponding diagram 3; 35. state of termination (k=5, the v of expression grid chart
5=5), 19 in the corresponding diagram 3.The symbol sebolic addressing path of a complete survival of 36,41,42,43,44 expressions among the figure; Show initial condition 34 beginnings from grid chart, the symbol in the information source of encoding the successively set arrives the state of termination 35 of grid chart through intermediateness node 45,46,47,48.36,20,25,26,27,28 in 41,42,43, the 44 difference corresponding diagram 3.In 45,46,47, the 48 difference corresponding diagram 3 29,30,31,32.
Embodiment
1. based on the low-complexity joint message source and channel coding/decoding system of space networks trrellis diagram
Low-complexity joint message source and channel coding/decoding system based on the space networks trrellis diagram is as shown in Figure 1.
At first, source symbol sequence 6 gets in Variable Length Code module 1 and the symbol sebolic addressing side information computing module 2 simultaneously, in Variable Length Code module 1, carries out Variable Length Code, output Variable Length Code code stream 7; " adding up symbolic number K, " accumulative total bit number N " and " accumulative total symbol weights W ", these three values exported as side information 8 in symbol sebolic addressing side information computing module 2 compute sign sequences.Again Variable Length Code code stream 7 and symbol sebolic addressing side information 8 are sent into joint source-channel coding module 3 together and encode, the code stream 9 with 3 outputs of joint source-channel coding module sends to channel 4 at last.Decoding end is sent into the codeword sequence that receives 10 based on the combined signal source channel decoding module 5 of space networks trrellis diagram and is decoded, and obtains symbol sebolic addressing estimation
at last
2. based on the low-complexity joint signal source and channel new method of space networks trrellis diagram
Among Fig. 1, source symbol sequence 6 gets in the Variable Length Code module 1 and obtains Variable Length Code code stream 7, simultaneously the side information of module 2 compute sign sequences 6.
The function of side information computing module 2 is that compute sign sequence 6 comprises adding up and (i.e. " accumulative total symbol weights W ") of bit number (i.e. " accumulative total bit number N ") that the code stream after symbol numbers (i.e. " accumulative total symbolic number K "), the variable-length encoding comprises and symbol weight.The computational methods of side information computing module 2 are following: before the coding source symbol sequence 6; The initial value of " accumulative total symbolic number ", " accumulative total bit number " and " accumulative total symbol weight " all is made as 0; A symbol in every then coding source symbol sequence 6 (table 1 is seen in the source symbol set); " accumulative total symbolic number " adds 1, and " accumulative total bit number " adds the variable length code word length l that this symbol is corresponding
i(the coherent reference value is seen table 1), " accumulative total symbol weight " adds this symbol corresponding symbol weight w
iThe rest may be inferred, behind each symbol in the source symbol sequence 6 of having encoded, obtains final " accumulative total symbolic number K ", " accumulative total bit number N " and " accumulative total symbol weights W ".Then, variable length code stream and side information 8 sent in the joint source-channel coding module 3 together encode, the code stream 9 after will encoding at last sends to channel 4.
3. based on the low-complexity joint signal source channel decoding new method of space networks trrellis diagram
As shown in Figure 1, decoding end is sent into the codeword sequence that receives 10 based on the low-complexity joint signal source channel decoding module 5 of space networks trrellis diagram and is decoded.Fig. 2 is the low-complexity joint signal source channel decoding method flow diagram based on the space networks trrellis diagram, is the refinement of module 5 among Fig. 1.As shown in Figure 2; Module 12 is utilized side information " accumulative total symbolic number K ", " accumulative total bit number N " and " accumulative total symbol weights W " three the binding occurrence structure space networks trrellis diagrams in the codeword sequence 10, and three coordinates of space networks trrellis diagram as shown in Figure 3 are represented " symbol numbers index k ", " bit status index v " and " weight state index w " respectively (wherein
Be " number of bits index ", l
MinBe the minimum word length in the variable length code table, each parameter meaning is referring to table 1), the K bar has formed a complete symbol sebolic addressing path by the state transitions branch that the symbol time order links to each other; All symbol sebolic addressing paths are from initial point; The state transitions of a possible state node is as from (k-1, w
K-1, v
K-1) to (k, w
k, v
k) all corresponding code word size is (l
i=v
k-v
K-1) and weighted value be (w
i=w
k-w
K-1) the variable length code word.The side information of codeword sequence " accumulative total symbolic number K ", " accumulative total bit number N " (then add up bit status V=N-K * l
Min) and " accumulative total symbol weights W " determined the space lattice sink of graph, finally all symbol sebolic addressing paths all will converge to this point, and all symbol sebolic addressing paths of not satisfying the three-dimensional constraining condition all will be excluded outside the space networks trrellis diagram.Module 13 projects to state node on the space networks trrellis diagram and state transitions branch on " symbol numbers index " and " bit status index " two dimensional surface then; Form the variable length source code grid chart of simplifying; Module 14 is carried out symbol level maximum a posteriori probability combined signal source channel decoding according to this grid chart, obtains the estimated sequence 11 of source symbol sequence.
4. the construction process of space networks trrellis diagram
The process of module 12 structure space networks trrellis diagrams is following among Fig. 2: symbol is 0 o'clock constantly, and having only initial point is the effective status node.From initial point; At each symbol constantly; For this each state node constantly, travel through all variable length code words, generate this state node to next state transitions branch constantly; Thereby obtain next possible state node of institute constantly, and be not more than V (V=N-K * l at each moment reservation bit state index coordinate figure
Min), weight indexed coordinates value is not more than the state node of W, and up-to symbol is K constantly.Begin the back constantly to the traversal grid chart from K then, delete all through state transitions branch transition can't reach home (K, W; V) state node and constantly the time, do not having the state node of transferring to next state transitions branch constantly, and the state transitions branch that is connected with these disarmed state nodes less than a certain symbol of K; Can obtain starting point is initial point; Terminal point is (K, W, space networks trrellis diagram V).
The information source set is used among table 2 Fig. 3 variable length code word and weighted value table
Fig. 3 is the instance of a space networks trrellis diagram; Wherein Z coordinate 15 expressions " bit status index v "; 16 expressions " weight state index w " of Y coordinate; 17 expressions " symbol numbers index k " of X coordinate, the source symbol set that this grid chart is corresponding comprises 12 different symbols altogether, and the corresponding variable length code word length of these 12 symbols is as shown in table 2 with the weights of giving.
Space lattice figure shown in Figure 3 has represented encoded K=5 symbol, and " accumulative total bit number " N=10 (then adds up bit status V=N-K * l behind the Variable Length Code
Min=5), the instance of " accumulative total symbol weight " W=7.The state transitions of a possible state node (k-1, w
K-1, v
K-1→ k, w
k, v
k) corresponding code word size is (l
i=v
k-v
K-1) and weighted value be (w
i=w
k-w
K-1) variable length code word C
k, C
k∈ { C (0), C (1), C (2), C (3), C (4), C (5), C (6), C (7), C (8), C (9), C (10), C (11) }.Symbol sebolic addressing path in all grid charts is by initial condition 18 (k=0, w
0=0, v
0=0) sets out, converge at state of termination 19 (k=5, w
5=7, v
5=5).State transitions branch in the grid chart is corresponding one by one with the code word in the variable length code table.For example, might code word be 20.C (5) during k=0,21.C (2), 22.C (3), 23.C (1), 24.C (0).
Symbol sebolic addressing path forming process among Fig. 3 is following: after decoding end receives symbol sebolic addressing side information (encoded K=5 symbol, accumulative total bit number N=10 promptly add up bit status V=5, accumulative total symbol weights W=7); Confirm state of termination 19 (k=5, the w of space networks trrellis diagram
5=7, v
5=5), the symbol sebolic addressing path of the survival in the space networks trrellis diagram is all from initial condition 18 (k=0, w
0=0, v
0=0) sets out.Symbol sebolic addressing path with a wherein survival is an example: from 18 beginnings of space networks trrellis diagram initial condition, and the symbol " 5 " of encoding, accumulative total symbol numbers (adding 1) becomes 1; Accumulative total bit status (adding 2) becomes 2; Accumulative total symbol weight (adding 4) becomes 4, and state node is transferred to 29 (k=1, w
1=4, v
1=2), similarly, coded identification " 3 " " 1 " " 0 " " 0 " in succession, the transfer case of state node is following: 30 (k=2, w
2=6, v
2=4), 31 (k=3, w
3=7, v
3=5), 32 (k=4, w
4=7, v
4=5), 19 (k=5, w
5=7, v
5=5).All symbol sebolic addressing paths of satisfying three binding occurrences all should appear among Fig. 3, ungratifiedly then can not appear among Fig. 3.
Fig. 4 has represented the space networks trrellis diagram of Fig. 3 is projected to the elongated source code grid chart that obtains simplifying on the plane at " symbol numbers index " 17 and " bit status index " 15 places; Corresponding with Fig. 3; Initial condition (k=0, the v in the symbol sebolic addressing path of 34 all survivals of expression
0=0), 19 expression state of termination (k=5, v
5=5), 20～24 represent k=0 respectively time institutes might code word, 20.C (5) wherein, 21.C (2), 22.C (3), 23.C (1), 24.C (0).State node during projection among Fig. 3 (k, w
k, v
k) convert state node (k, v among Fig. 4 to
k), the transfer relationship among two figure between the state node remains unchanged, and as in Fig. 3, state node 29 warps 25 are transferred to state node 30, and this relation still remains unchanged in Fig. 4.
Claims (3)
1. low-complexity joint message source and channel decoding method based on the space networks trrellis diagram; It is characterized in that: in symbol level variable length code combined signal source channel coding/decoding system; Each symbol in the information source set is given a symbol weight relevant with this symbol probability; At coding side, symbol sebolic addressing has accumulative total symbolic number, accumulative total bit number and three binding occurrences of accumulative total symbol weight behind Variable Length Code, utilizes this three binding occurrence structure space networks trrellis diagrams in decoding end; The three-dimensional coordinate of space networks trrellis diagram is represented symbol numbers index, bit status index and weight state index respectively; According to the space networks trrellis diagram, symbolization level maximum a posteriori probability decoding algorithm is realized low-complexity joint message source and channel decoding method.
2. the low-complexity joint message source and channel decoding method based on the space networks trrellis diagram according to claim 1; Its characteristic also is: with respect to the plane net trrellis diagram; The space networks trrellis diagram has been given weights for each symbol; More excellent symbol weight setting can be removed the redundant state transfer path on the space networks trrellis diagram, state node on the space networks trrellis diagram and state transitions branch is projected on the two dimensional surface of symbol numbers index and bit status index again, and the transfer relationship in keeping scheming between the state node is constant; Generate the variable length source code grid chart of simplifying; According to the variable length source code grid chart of simplifying, can reduce the complexity and the error sign ratio of elongated symbol level maximum a posteriori probability decoding algorithm, realize the low-complexity joint signal source channel decoding.
3. the low-complexity joint message source and channel decoding method based on the space networks trrellis diagram according to claim 1 and 2, its characteristic also is: be applied in variable length Turbo code associating coding/decoding system and variable length code and separate in the system of coding, combined decoding with convolution code.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110047094.4A CN102651653B (en) | 2011-02-28 | 2011-02-28 | Low-complexity joint source-channel encoding and decoding method based on space lattice diagram |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110047094.4A CN102651653B (en) | 2011-02-28 | 2011-02-28 | Low-complexity joint source-channel encoding and decoding method based on space lattice diagram |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102651653A true CN102651653A (en) | 2012-08-29 |
| CN102651653B CN102651653B (en) | 2015-07-15 |
Family
ID=46693552
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110047094.4A Expired - Fee Related CN102651653B (en) | 2011-02-28 | 2011-02-28 | Low-complexity joint source-channel encoding and decoding method based on space lattice diagram |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102651653B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106559179A (en) * | 2016-12-07 | 2017-04-05 | 天津君邦科技有限公司 | Variable-length symbol-level reversible coding and decoding method for joint information source channel |
| CN108809521A (en) * | 2018-06-26 | 2018-11-13 | 中国联合网络通信集团有限公司 | A kind of variable length decoding method, device and length variable decoder |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050177782A1 (en) * | 2002-05-31 | 2005-08-11 | Jari Parviainen | Method and arrangement for enhancing search through trellis |
| CN101252409A (en) * | 2007-04-12 | 2008-08-27 | 中国科学院研究生院 | New algorithm of combined signal source channel decoding based on symbol level superlattice picture |
-
2011
- 2011-02-28 CN CN201110047094.4A patent/CN102651653B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050177782A1 (en) * | 2002-05-31 | 2005-08-11 | Jari Parviainen | Method and arrangement for enhancing search through trellis |
| CN101252409A (en) * | 2007-04-12 | 2008-08-27 | 中国科学院研究生院 | New algorithm of combined signal source channel decoding based on symbol level superlattice picture |
Non-Patent Citations (1)
| Title |
|---|
| JORG KLIEWER等: ""A-posteriori Probability Decoding of Variable-Length Codes Using a Three-Dimensional Trellis Representation"", 《2003 IEEE》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106559179A (en) * | 2016-12-07 | 2017-04-05 | 天津君邦科技有限公司 | Variable-length symbol-level reversible coding and decoding method for joint information source channel |
| CN108809521A (en) * | 2018-06-26 | 2018-11-13 | 中国联合网络通信集团有限公司 | A kind of variable length decoding method, device and length variable decoder |
| CN108809521B (en) * | 2018-06-26 | 2020-09-11 | 中国联合网络通信集团有限公司 | Variable length decoding method and device and variable length decoder |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102651653B (en) | 2015-07-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106888025B (en) | A kind of cascade Error-correcting Encoding and Decoding method and system based on polarization code | |
| KR101270815B1 (en) | In-place transformations with applications to encoding and decoding various classes of codes | |
| CN1926769B (en) | Method for compressing a set of correlated signals | |
| CN105959015B (en) | LDPC code linear programming interpretation method based on minimum polyhedral model | |
| CN100517983C (en) | Coding-decoding method for integrated source and channel variable-length symbol Turbo | |
| CN103746708A (en) | Method for constructing Polar-LDPC concatenated codes | |
| CN108199723B (en) | Packet Markov superposition coding method based on double recursion | |
| CN115269526B (en) | Method and system for processing semiconductor production data | |
| CN112332864A (en) | Polar code decoding method and system for self-adaptive ordered mobile pruning list | |
| CN101252409B (en) | New algorithm of combined signal source channel decoding based on symbol level superlattice picture | |
| Wang et al. | Optimization design of polar-LDPC concatenated scheme based on deep learning | |
| KR102075946B1 (en) | Method and apparatus for decoding of nonbinary parity-check codes in broadcasting and communication systems | |
| CN102651653B (en) | Low-complexity joint source-channel encoding and decoding method based on space lattice diagram | |
| CN113098529B (en) | Method, system and storage medium for transmitting additional information based on cyclic shift | |
| CN112910474A (en) | Zipper code encoding method based on multi-dimensional coupling | |
| CN102655588B (en) | Joint source-channel decoding method for video/image transmission | |
| CN109639290B (en) | Semi-random grouping superposition coding and decoding method | |
| CN103138769B (en) | A kind of coding method with unequal error protection | |
| CN115913254A (en) | Method for encoding and decoding data transmitted in a communication network and related device | |
| CN102655589B (en) | Based on the combined signal source channel decoding method of variable length code and arithmetic code | |
| CN103208997B (en) | It is a kind of while input/while decoding/side output encoder and decoder structure | |
| CN103532666B (en) | Improve the method for data transmission efficiency and LT code performance in distributed transmission | |
| CN112350737B (en) | Method for transmitting packet information update based on LDPC code | |
| KR101573983B1 (en) | Method of data compressing, method of data recovering, and the apparatuses thereof | |
| Kargı et al. | A Deep Learning Based Decoder for Concatenated Coding Over Deletion Channels |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C53 | Correction of patent of invention or patent application | ||
| CB02 | Change of applicant information |
Address after: 100049, Yuquanlu Road, Beijing No. 19 (a) Applicant after: University of Chinese Academy of Sciences Address before: 100049, Yuquanlu Road, Beijing No. 19 (a) Applicant before: Postgraduate School, Chinese Academy of Sciences |
|
| COR | Change of bibliographic data |
Free format text: CORRECT: APPLICANT; FROM: POSTGRADUATE SCHOOL, CHINESE ACADEMY OF SCIENCES TO: UNIVERSITY OF CHINESE ACADEMY OF SCIENCES |
|
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20150715 Termination date: 20210228 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |