CN102142845A - Compression coding method and device of place name character string in electronic map - Google Patents
Compression coding method and device of place name character string in electronic map Download PDFInfo
- Publication number
- CN102142845A CN102142845A CN2010101029808A CN201010102980A CN102142845A CN 102142845 A CN102142845 A CN 102142845A CN 2010101029808 A CN2010101029808 A CN 2010101029808A CN 201010102980 A CN201010102980 A CN 201010102980A CN 102142845 A CN102142845 A CN 102142845A
- Authority
- CN
- China
- Prior art keywords
- place name
- character string
- chinese character
- tree structure
- name character
- 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.)
- Pending
Links
Images
Abstract
The invention provides a compression coding method and device of a place name character string in an electronic map, belonging to the technical field of electric digital processing. The method comprises the steps of: obtaining a coding value of each Chinese character in the place name character string in the reference of a tree structure dictionary; obtaining quantity of bits required by each Chinese character in the place name character string in the reference of the tree structure dictionary; and writing the coding value of each Chinese character to a corresponding position of a target code so as to be capable of effectively improving compression ratio of the place name character string in the electronic map and lowering space requirement on a place name dictionary.
Description
Technical field
The invention belongs to electric numerical data processing technology field, relate in particular in a kind of electronic chart towards the compaction coding method and the device of the place name character string of bit (position).
Background technology
Place name comprises that address, road name and administrative division title etc. occupy a large amount of memory spaces in cartographic representation, and internal memory and storage medium are had higher requirement, the efficient that a large amount of internal memories uses and the I/O operation can the reduction system.Because the restriction of the function of this embedded device of in-vehicle navigation apparatus itself, it all is limited making the function that can finish, the efficient of function and the data that can store.Therefore effectively the compression place name can be saved memory space with the storage more data, and then reduces the I/O operation, abdicates more resources to finish more function, improves the ability and the efficient of whole system.
In electronic chart, existing place name storage mode has following two kinds:
Mode one, all place name character strings are made a string, the mode that adds length with pointer or subscript is stored then, the redundancy that this mode causes in the time of can reducing independent storage place name character string to a certain extent, but the shared space of pointer itself also is to occupy certain space.For existing most computer, a pointer takies 4 bytes, also can store 2 of the Chinese characters of Unicode (UNICODE), even use the form of subscripts that takies 2 bytes also to be equivalent to a Chinese character.
Mode two utilizes the dictionary join probability to compress, and for example the higher speech of the frequency of occurrences distributes less coding, and then coding is carried out towards the compression of bit (position) or towards the compression of byte (byte).This coded system has higher compression ratio, but dictionary itself has certain redundancy, account for two units possibly and do not share as " Nanjing " and " Nanjing Road East ", in addition its coding be in dictionary explicit storage rather than implicit expression storage, therefore these two kinds of attributes have determined that dictionary itself will take more space, unless handle more data, otherwise compression ratio is lower.
In sum, though in the prior art, place name has been carried out certain compression, but compression ratio is not high, dictionary of place name after the compression still needs a large amount of spaces, especially along with the development of society, the place name that occurs in the unit are is more and more, causes existing place name compress mode can not satisfy the demands.
Summary of the invention
In order to address the above problem, the purpose of this invention is to provide the compaction coding method and the device of place name character string in a kind of electronic chart, effectively improve the compression ratio of place name character string in the electronic chart, reduced the space requirement of dictionary of place name.
In order to achieve the above object, the invention provides the compaction coding method of place name character string in a kind of electronic chart, described method comprises:
Obtain with the tree structure dictionary is the encoded radio of each Chinese character in the described place name character string of reference;
Obtain with the tree structure dictionary is the number of the required bit position of each Chinese character in the described place name character string of reference;
According to the number of the required bit position of described each Chinese character, the encoded radio of described each Chinese character is written on the relevant position of target code.
Preferably, described tree structure dictionary is directed acyclic graph DAWG.
Preferably, described obtaining with the tree structure dictionary is that the step of the encoded radio of each Chinese character in the described place name character string of reference is:
According to being the ordering of each Chinese character in the brotgher of node in the described place name character string of reference with the tree structure dictionary, obtain the encoded radio of each Chinese character in the described place name character string.
Preferably, the described step of obtaining the required bit position number of each Chinese character in the described place name character string is:
According to the number that with the tree structure dictionary is the brotgher of node of Chinese character in the tree structure dictionary in the described place name character string of reference, obtain the number of the required bit position of each Chinese character in the described place name character string.
Preferably, described compressed encoding is with Chinese character, phrase, English character string with to piece together in the single-tone character string any one be unit.
The present invention also provides the compression-encoding device of place name character string in a kind of electronic chart, comprising:
First processing module, being used for obtaining with the tree structure dictionary is the encoded radio of described each Chinese character of place name character string of reference;
Second processing module, being used for obtaining with the tree structure dictionary is the number of the required bit position of described each Chinese character of place name character string of reference;
Coding module is used for the number according to the required bit position of described each Chinese character, and the encoded radio of described each Chinese character is written on the relevant position of target code.
Preferably, also comprise: memory module is used for described place name character string is stored according to the form of directed acyclic graph.
Preferably, described second processing module is used for according to being the number of the brotgher of node of described place name character string Chinese character in the tree structure dictionary of reference with the tree structure dictionary, obtains the number of the required bit position of each Chinese character in the described place name character string.
Preferably, described first processing module is used for obtaining the encoded radio of each Chinese character in the described place name character string according to the tree structure dictionary being ordering in the brotgher of node of described each Chinese character of place name character string in the tree structure dictionary of reference.
As shown from the above technical solution, at first obtaining with the tree structure dictionary is the number of the required bit position of each Chinese character in the encoded radio of each Chinese character in the place name character string of reference and the place name character string; Then according to the number that with the tree structure dictionary is the required bit position of each Chinese character in the place name character string of reference, and utilize bit manipulation that the encoded radio of each Chinese character is written on the relevant position of target code, owing to implied the encoded radio of Chinese character and the number of required bit position in the coded system in the technical program, make coding in the technical program need not to carry out or towards the second-compressed of byte towards bit's, effectively improved the compression ratio of place name character string, reduced the space requirement of dictionary of place name, and the dictionary of place name that encoding compression can be obtained is arranged in the internal memory, has effectively improved the speed of service.
Description of drawings
Fig. 1 is a directed acyclic word figure schematic diagram in the prior art;
Fig. 2 is a directed acyclic word figure schematic diagram one in the embodiments of the invention;
Fig. 3 is the flow chart of place name character string compaction coding method in the electronic chart in the embodiments of the invention;
Fig. 4 is a directed acyclic word figure schematic diagram two in the embodiments of the invention;
Fig. 5 is a place name character string compression coding and decoding schematic flow sheet in the electronic chart in the embodiments of the invention;
Fig. 6 is a place name character string decoding process schematic diagram in the electronic chart in the embodiments of the invention;
Fig. 7 is the structure chart of place name character string compression-encoding device in the electronic chart in the embodiments of the invention.
Embodiment
In the present embodiment, obtain the number of the required bit position of each Chinese character in the encoded radio of each Chinese character in the place name character string and the place name character string; The number of the required bit position of each Chinese character in the base area name character string then, and utilize bit manipulation that the encoded radio of each Chinese character is written on the relevant position of target code.
In the present embodiment, can set in advance a dictionary of place name, and place name character string form according to oriented no figure in this dictionary of place name stores, also be not limited to this certainly, for example also available other tree structure is reference.Referring to Fig. 1, be directed acyclic word figure schematic diagram of the prior art, but the place name character string in this dictionary of place name can adopt directed acyclic word figure DAWG (Directed AcyclicWord Graphs) storage in the present embodiment, directed acyclic word figure is as a kind of space efficiency higher data structure, can be used for the memory address collection.In Fig. 1, be respectively " tap ", " taps ", " top " and " tops " storage representation in directed acyclic word figure.
At present, GBK (Chinese international extended code) Chinese character has more than 20000, and is used for the subclass that place name is it.Often occur in the place name with province, the city, the county, the township, the town, the village, number, the Chinese character of ending is waited in the lane, can reuse the Chinese character of above-mentioned ending among the directed acyclic word figure.There are many Chinese characters identical in addition, can reuse the identical Chinese character of beginning among the directed acyclic word figure, as many cities " Huai Hailu " arranged, " Nanjing Road " etc.Also may be in same city with a road with " South Road, Henan ", " Henan Zhong Lu ", the form name in " North Road, Henan ".Referring to Fig. 2, for above-mentioned place name is stored by the form of directed acyclic word figure.
For the purpose, technical scheme and the advantage that make the embodiment of the invention is clearer,, the embodiment of the invention is done explanation in further detail below in conjunction with embodiment and accompanying drawing.At this, illustrative examples of the present invention and explanation are used to explain the present invention, but not as a limitation of the invention.
As shown in Figure 3, be the flow chart of place name character string compaction coding method in the electronic chart in the embodiments of the invention, concrete steps are as follows:
In in this enforcement, can obtain the encoded radio of each Chinese character in the place name character string, for example adopt formula (1) according to being the ordering of each Chinese character in the brotgher of node in the place name character string of reference with the tree structure dictionary.Certainly do not limit the concrete mode of the encoded radio of each Chinese character in the name character string definitely in the present embodiment.
Encoded radio=(ordering in the brotgher of node) formula (1)
Arrange the 3rd as this Chinese character in the brotgher of node, then the encoded radio of this Chinese character is exactly 3.Referring to Fig. 2, the father node root of Chinese character " river " has a child node, " river " arranges the 0th in the brotgher of node, then Chinese character " river " encoded radio is 0, and the child node in " river " has only one " south ", and " south " seniority among brothers and sisters the 0th, therefore the encoded radio in south is 0, and " south " has three child nodes, be respectively Chinese character " south ", " in ", " north ", and they arrange the 0th respectively in the brotgher of node, the 1st and the 2nd, then Chinese character " south ", " in ", the encoded radio in " north " is respectively " 0 ", " 1 " " 2 ".And end node " EOW " is the child node on " road ", ranks the 0th, so encoded radio is 0.
Step 302, to obtain with the tree structure dictionary be the number of the required bit position of each Chinese character in the place name character string of reference;
For example, can be according to the number that with the tree structure dictionary is the brotgher of node in the place name character string of reference, obtain the number of the required bit position of each Chinese character in the place name character string.Certainly do not limit the concrete mode of the number of the required bit position of each Chinese character in the character string definitely in this enforcements.
In the present embodiment, owing to be coded system towards bit, therefore also need determine the length of encoding, how many positions promptly determine needs to use store this encoded radio.Can determine the length of this encoded radio by the brotgher of node number at this Chinese character place, for example can adopt formula (2) to determine the length of coding.
The length of coding=to the whole [log that gets on
2(brotgher of node number)] formula (2)
Referring to Fig. 2, " South Road, Henan ", " Henan Zhong Lu ", the 3rd Chinese character " south " in " North Road, Henan ", " in " and the brotgher of node number in " north " be 3, then need 2 bit, the brotgher of node number of the 4th Chinese character " road " is 1, then needs 1 bit.The child node of Chinese character among Fig. 3 " road " conduct " capital ", the brotgher of node number on " road " is 4, and needs 2 bit.If the child node of Chinese character " road " conduct " rather ", the brotgher of node number of being somebody's turn to do " road " is 1, then needs 1 bit.Among Fig. 2, end node " EOW " is the child node on " road ", and brotgher of node number has only 1, therefore only needs 1 bit.
With " South Road, Henan ", " Henan Zhong Lu " and " North Road, Henan " is example, and the coding of each Chinese character is as follows:
| First | Second | The 3rd | The 4th | End mark | Coding | Total bit number | |
| The South Road, Henan | 0 | 0 | 00 | 0 | 0 | 000000 | 6 |
| Henan Zhong Lu | 0 | 0 | 01 | 0 | 0 | 000100 | 6 |
| The North Road, Henan | 0 | 0 | 10 | 0 | 0 | 001000 | 6 |
In in this enforcement, end mark is not obviously to place coding, but implicit expression is stored in the dictionary, if arrived " EOW " according to coding lookup, then expression is through with.What the encoded radio of end mark referred to is exactly which child node of a last node, and " EOW " is first child node on " road ", and the encoded radio of " EOW " can be arranged to " 0 ".By above-mentioned coded system, can write down the fullpath of this place name character string in dictionary of place name.
In the present embodiment, compressed encoding can be unit with the Chinese character not only, also can be with character string such as phrase, and the English character string, assembly single-tone character string etc. is a unit, improves compression ratio.
As shown from the above technical solution, at first obtaining with the tree structure dictionary is the number of the required bit position of each Chinese character in the encoded radio of each Chinese character in the place name character string of reference and the place name character string; Then according to the number that with the tree structure dictionary is the required bit position of each Chinese character in the place name character string of reference, and utilize bit manipulation that the encoded radio of each Chinese character is written on the relevant position of target code, owing to implied the encoded radio of Chinese character and the number of required bit position in the coded system in the technical program, make coding in the technical program need not to carry out or towards the second-compressed of byte towards bit's, effectively improved the compression ratio of place name character string, reduced the space requirement of dictionary of place name, and the dictionary of place name that encoding compression can be obtained is arranged in the internal memory, has effectively improved the speed of service.
More than be introduced explanation with a better simply example.For bigger set, the number of the brotgher of node will gradually reduce along with the degree of depth of place layer.Be 10 dictionary to the maximum for a store character number, suppose that the maximum fraternal number of each layer is as shown in the table, then worst case is estimated as 50 bit.And actual required bit number will be less than 32bit.Because the required bit number of each layer is by the fraternal number decision at its place, but not the maximum fraternal number of place layer, above-mentioned layer is used for representing that a Chinese character is in the position of source string, in Fig. 2, Chinese character " road " is the 3rd floor in " He Nanlu ", and in " Henan Zhong Lu " the 4th layer.
| Layer | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 |
| Maximum fraternal number | 2048 | 256 | 129 | 57 | 29 | 15 | 7 | 3 | 2 | 1 |
| The Bit figure place | 11 | 8 | 8 | 6 | 5 | 4 | 3 | 2 | 2 | 1 |
Represented " He Nanlu " among Fig. 4, " South Road, Henan ", " Henan Zhong Lu ", " North Road, Henan ", " Bei Jinglu ", " Bei Jinglu ", " BeiJing Xi Road ", " East Road, Beijing ", " Beijing ", " Nanjing Road ", " West Road, Nanjing ", " Nanjing Road East ", " Nanjing ", " Nanning City ".Under the situation that does not increase node, can also represent " Nanning Zhong Lu " etc., increase in one " sea ", just can represent information such as " Hai Nanlu ", this will increase side information certainly.In Fig. 4, be shown in path in the dictionary of place name, make the character strings such as place name a record cheaply arranged by the variable string table that write down.
Referring to Fig. 5, be place name character string encoding and decoding schematic flow sheet in the electronic chart in the embodiments of the invention, may further comprise the steps:
Step 1, generation dictionary of place name
Just, the place name set as input source, is generated dictionary of place name.And after dictionary of place name generates, also can reach a state preferably to changing dictionary of place name adjustment.
Step 2, compression process
A given character string, once travel through each character, and search dictionary of place name simultaneously, utilize formula (1) to obtain the encoded radio of each Chinese character of character string, the ordering of each Chinese character pairing brotgher of node in character string just, utilize formula (2) to obtain the number of the required bit position of encoded radio then, utilize bit manipulation that encoded radio is write on the relevant position of complete object coding then.
Step 3, decompression process
When decompressing, can provide a bit string, at first utilize formula (2) to obtain the bit length of coding according to children's number of root in the dictionary of place name, utilize the fetch bit operation to obtain coding, just can obtain first Chinese character then, and sign moves to the child node place in dictionary of place name, obtains remaining Chinese character then successively.
Implicit expression has write down end mark in dictionary of place name, and when reading end mark, the expression decompression process finishes.
Referring to Fig. 6, be place name character string decoding process schematic diagram in the electronic chart in the embodiments of the invention, concrete steps are as follows:
In step 602～604, can at first utilize formula (2) to obtain the bit length of coding, utilize the fetch bit operation to obtain coding then, just can obtain first Chinese character then.
In order to realize above-mentioned method embodiment, other embodiment of the present invention also provide the apparatus for encoding of place name character string in a kind of electronic chart.What need at first explanation in addition is; because following embodiment is for realizing aforesaid method embodiment; so this device all is to establish for each step that realizes preceding method; but the present invention is not limited to following embodiment, and any device of said method and module of realizing all should be contained in protection scope of the present invention.And in the following description, the content identical with preceding method omitted at this, to save length.
As shown in Figure 7, be the structure chart of place name character string compression-encoding device in the electronic chart in the embodiments of the invention, this device comprises:
In the present embodiment, this device also comprises: memory module 74, be connected with first processing module 71, and be used for described place name character string is stored according to the form of directed acyclic graph
In the present embodiment, second processing module 72 is used for according to being the number of the place name character string brotgher of node of reference with the tree structure dictionary, obtains the number of the required bit position of each Chinese character in the place name character string.
In the present embodiment, first processing module 71 is used for obtaining the encoded radio of each Chinese character in the place name character string according to being the ordering of each Chinese character of place name character string in the brotgher of node of reference with the tree structure dictionary.
In the present embodiment, compressed encoding can be unit with the Chinese character not only, also can be with character string such as phrase, and the English character string, assembly single-tone character string etc. is a unit, improves compression ratio.
The above only is a preferred implementation of the present invention; should be pointed out that for those skilled in the art, under the prerequisite that does not break away from the principle of the invention; can also make some improvements and modifications, these improvements and modifications also should be considered as protection scope of the present invention.
Claims (9)
1. the compaction coding method of place name character string in the electronic chart is characterized in that described method comprises:
Obtain with the tree structure dictionary is the encoded radio of each Chinese character in the described place name character string of reference;
Obtain with the tree structure dictionary is the number of the required bit position of each Chinese character in the described place name character string of reference;
According to the number of the required bit position of described each Chinese character, the encoded radio of described each Chinese character is written on the relevant position of target code.
2. method according to claim 1 is characterized in that, described tree structure dictionary is directed acyclic graph DAWG.
3. method according to claim 2 is characterized in that, described obtaining with the tree structure dictionary is that the step of the encoded radio of each Chinese character in the described place name character string of reference is:
According to being the ordering of each Chinese character in the brotgher of node in the described place name character string of reference with the tree structure dictionary, obtain the encoded radio of each Chinese character in the described place name character string.
4. method according to claim 3 is characterized in that, the described step of obtaining the required bit position number of each Chinese character in the described place name character string is:
According to the number that with the tree structure dictionary is the brotgher of node of Chinese character in the tree structure dictionary in the described place name character string of reference, obtain the number of the required bit position of each Chinese character in the described place name character string.
5. method according to claim 4 is characterized in that, described compressed encoding is with Chinese character, phrase, English character string and to piece together in the single-tone character string any one be unit.
6. the compression-encoding device of place name character string in the electronic chart is characterized in that, comprising:
First processing module, being used for obtaining with the tree structure dictionary is the encoded radio of described each Chinese character of place name character string of reference;
Second processing module, being used for obtaining with the tree structure dictionary is the number of the required bit position of described each Chinese character of place name character string of reference;
Coding module is used for the number according to the required bit position of described each Chinese character, and the encoded radio of described each Chinese character is written on the relevant position of target code.
7. device according to claim 6 is characterized in that, also comprises:
Memory module is used for described place name character string is stored according to the form of directed acyclic graph.
8. device according to claim 7, it is characterized in that, described second processing module, be used for according to being the number of the brotgher of node of described place name character string Chinese character in the tree structure dictionary of reference, obtain the number of the required bit position of each Chinese character in the described place name character string with the tree structure dictionary.
9. device according to claim 8, it is characterized in that, described first processing module, be used for obtaining the encoded radio of each Chinese character in the described place name character string according to the tree structure dictionary being ordering in the brotgher of node of described each Chinese character of place name character string in the tree structure dictionary of reference.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010101029808A CN102142845A (en) | 2010-01-28 | 2010-01-28 | Compression coding method and device of place name character string in electronic map |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010101029808A CN102142845A (en) | 2010-01-28 | 2010-01-28 | Compression coding method and device of place name character string in electronic map |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102142845A true CN102142845A (en) | 2011-08-03 |
Family
ID=44410116
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010101029808A Pending CN102142845A (en) | 2010-01-28 | 2010-01-28 | Compression coding method and device of place name character string in electronic map |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102142845A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110442844A (en) * | 2019-07-03 | 2019-11-12 | 北京达佳互联信息技术有限公司 | Data processing method, device, electronic equipment and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5717393A (en) * | 1996-02-08 | 1998-02-10 | Fujitsu Limited | Apparatus for data compression and data decompression |
| CN1267963A (en) * | 1999-03-12 | 2000-09-27 | 富士通株式会社 | Data compression equipment and data restorer |
| CN1279537A (en) * | 1999-07-02 | 2001-01-10 | 英业达集团(西安)电子技术有限公司 | Compression method suitable for wide character set document |
| CN101421729A (en) * | 2006-03-03 | 2009-04-29 | 奥多比公司 | The system and method for the directed acyclic graph structures in effective expression and the search database |
-
2010
- 2010-01-28 CN CN2010101029808A patent/CN102142845A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5717393A (en) * | 1996-02-08 | 1998-02-10 | Fujitsu Limited | Apparatus for data compression and data decompression |
| CN1267963A (en) * | 1999-03-12 | 2000-09-27 | 富士通株式会社 | Data compression equipment and data restorer |
| CN1279537A (en) * | 1999-07-02 | 2001-01-10 | 英业达集团(西安)电子技术有限公司 | Compression method suitable for wide character set document |
| CN101421729A (en) * | 2006-03-03 | 2009-04-29 | 奥多比公司 | The system and method for the directed acyclic graph structures in effective expression and the search database |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110442844A (en) * | 2019-07-03 | 2019-11-12 | 北京达佳互联信息技术有限公司 | Data processing method, device, electronic equipment and storage medium |
| CN110442844B (en) * | 2019-07-03 | 2023-09-26 | 北京达佳互联信息技术有限公司 | Data processing method, device, electronic equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101661391B (en) | Object serializing method, object deserializing method, device and system | |
| CN102592160B (en) | Character two-dimension code encoding and decoding method for short message | |
| US9378126B2 (en) | Decompression apparatus and decompression method | |
| CN104283567A (en) | Method for compressing or decompressing name data, and equipment thereof | |
| CN103236847A (en) | Multilayer Hash structure and run coding-based lossless compression method for data | |
| CN104753540A (en) | Data compression method, data decompression method and device | |
| CN104868971A (en) | Interleaving mapping method of LDPC code words, and de-interleaving de-mapping method of LDPC code words | |
| CN101551820B (en) | Generation method and apparatus for index database of points of interest attribute | |
| CN100555879C (en) | A kind of encoder apparatus of LDPC sign indicating number and coding method | |
| CN104868972A (en) | Interleaving mapping method of LDPC code words, and de-interleaving de-mapping method of LDPC code words | |
| WO2012166190A1 (en) | Compression match enumeration | |
| CN101345952B (en) | Data storing and reading method, device and system for client identification card | |
| CN102129873A (en) | Data compression device and method for improving last-stage high-speed caching reliability of computer | |
| CN105376008A (en) | Low density parity check code (LDPC) word interleaving mapping method and LDPC word de-interleaving demapping method | |
| CN102142845A (en) | Compression coding method and device of place name character string in electronic map | |
| CN104901772A (en) | Interleaving and mapping method and de-interleaving and de-mapping method for LDPC code word | |
| CN104021121A (en) | Method, device and server for compressing text data | |
| CN105450333A (en) | Interleaving mapping method and de-interleaving de-mapping method for LDPC code words | |
| CN102508690A (en) | Storing method and decoding method for command line of embedded equipment | |
| CN202602827U (en) | Variable-length decoding device based on universal format code table | |
| CN109491620B (en) | Storage data rewriting method, device, server and storage medium | |
| CN104901773A (en) | Interleaving and mapping method and de-interleaving and de-mapping method for LDPC (Low Density Parity Check) code words | |
| CN102118220B (en) | Method and device for decoding rate matching | |
| CN107094022B (en) | Method for realizing Huffman coding system for VLSI design | |
| CN104868970A (en) | Interleaving mapping method of LDPC code words, and de-interleaving de-mapping method of LDPC code words |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C12 | Rejection of a patent application after its publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20110803 |