CN111404556A - Encoding method, decoding method, device and storage medium - Google Patents
Encoding method, decoding method, device and storage medium Download PDFInfo
- Publication number
- CN111404556A CN111404556A CN202010174423.0A CN202010174423A CN111404556A CN 111404556 A CN111404556 A CN 111404556A CN 202010174423 A CN202010174423 A CN 202010174423A CN 111404556 A CN111404556 A CN 111404556A
- Authority
- CN
- China
- Prior art keywords
- code
- series
- decoding
- mapping
- encoding
- 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
Classifications
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
- H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
- H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
- H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
- H03M13/1105—Decoding
- H03M13/1128—Judging correct decoding and iterative stopping criteria other than syndrome check and upper limit for decoding iterations
Abstract
The invention discloses an encoding method, a decoding method, equipment and a storage medium, which realize the coding without rate codes, preset initial state values at an encoding end and a decoding end, generate a new state value according to the last state value and a random number generator during encoding, only need to use chaotic Kent mapping once during decoding, can obviously reduce the calculation complexity during decoding on the premise of the same information transmission rate and have high safety.
Description
Technical Field
The present invention relates to the field of wireless communications, and in particular, to an encoding method, a decoding method, an apparatus, and a storage medium.
Background
With the progress and development of society and science and technology, the wireless communication technology is rapidly developed and popularized, and plays an increasingly important role in the daily life of people. Efficient and reliable data transmission techniques are receiving increasing attention. In the face of the current increasingly complex communication environment, it is difficult for the transmitter to know accurate channel state information in advance in many cases. The rateless code has the characteristic of code rate self-adaptive channel state transmission, and a transmitting end does not need feedback of a receiving end in the transmission process, so that the rateless code is an efficient and reliable error control technology. Therefore, rateless codes become a solution that can guarantee the reliability and accuracy of data transmission such as satellite communication.
The non-rate code uses a hash function in the compiling process, and the calculation complexity of the compiling and coding method is sharply increased along with the increase of the length of the information sequence and the length of the bit number of each piece of information, so the calculation complexity in the compiling process is high, and the compiling is difficult.
Disclosure of Invention
The following is a summary of the subject matter described in detail herein. This summary is not intended to limit the scope of the claims.
Embodiments of the present invention provide an encoding method, a decoding method, an apparatus, and a storage medium, which reduce the amount of computation during non-rate code compilation on the premise that information transmission rates are the same, thereby reducing the difficulty of compilation.
In a first aspect, an embodiment of the present invention provides an encoding method, including:
acquiring an input information sequence;
and encoding the input information sequence by using Kent mapping to form a rate-free code.
Specifically, encoding the input information sequence using the Kent mapping to form a rate-free code includes:
d equally dividing the input information sequence to make each segment of information sequence equal in length;
processing the D equally divided input information sequences to form corresponding D code series state values by using Kent mapping;
processing the D encoded series of state values using a random number generator to form D output bits;
processing the D output bits using constellation mapping to form the rateless code;
the value D is the ratio of the length of the input information sequence to the number of bits of each piece of information, and the value D is a positive integer.
Specifically, the processing the D-equally divided input information sequences into corresponding D encoding-series state values using the Kent mapping includes:
setting an initial state value spine0；
Using Kent mapping to sequentially map each segment of sequence in the information sequence and the previous state value corresponding to the sequence from front to back to obtain a coding series state value (spine)1，spine2，…，spinei，…，spineD) Wherein a series of state values spine is encoded1Is to pass through the first segment sequence and the initial state value spine0The first encoding series state value to be mapped, encoding series spineiRepresents the ith code series state value, i is more than or equal to 1 and less than or equal to D.
Specifically, the processing the output bits to form the rateless code using constellation mapping includes:
processing the D output bits using the constellation map to form corresponding D constellation points;
the D constellation points jointly form the rateless code;
wherein the constellation mapping includes digital modulation, quadrature amplitude modulation, amplitude keying, and quadrature phase shift keying.
The first aspect of the invention realizes the rate-free code coding based on chaotic Kent mapping, in the coding process, the Kent function is used for processing the information sequence, the output sequence is obtained through constellation mapping, the coding structure is simple, the calculated amount is small, the generated rate-free code is difficult to decipher under the condition of no initial state value, and the code has high safety performance.
In a second aspect, an embodiment of the present invention provides a decoding method, including:
acquiring a rateless code;
processing the rateless codes by using Kent mapping to obtain decoding series state values;
and processing the no-rate code and the decoding series state value to obtain an input information sequence.
Specifically, the processing of the rateless code by using the Kent mapping to obtain a decoding series state value includes:
and processing the initial state value and the rateless code by using Kent mapping to obtain the decoding series state value.
Specifically, the processing the rateless code and the decoding-series state value to obtain the input information sequence includes:
calculating channel noise according to the rateless code transmission channel;
comparing the rateless code to the decoded series of state values using a maximum likelihood rule;
eliminating the interference of the channel noise to the rateless codes;
and obtaining the input information sequence.
The second aspect of the invention realizes the rate-free code decoding based on the chaotic Kent mapping, only needs to use the chaotic Kent mapping once in the decoding process, and can obviously reduce the calculation complexity in the decoding process by using the Kent mapping for decoding.
In a third aspect, an embodiment of the present invention provides an electronic device, which can execute the encoding method according to the first aspect or the decoding method according to the second aspect.
In a fourth aspect, an embodiment of the present invention provides a computer-readable storage medium, including at least: a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the method of the first or second aspect as described above when executing the computer program.
The embodiment of the invention realizes the rate-free code compiling based on the chaotic Kent mapping, the initial state values are preset at the encoding end and the decoding end, the chaotic Kent mapping is only needed to be used once in the decoding process according to the new state value generated by the last state value and the random number generator during the compiling, the calculation complexity in the coding process can be obviously reduced on the premise of the same information transmission rate, and the chaotic Kent coding method has high safety.
Additional features and advantages of the invention will be set forth in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention. The objectives and other advantages of the invention will be realized and attained by the structure particularly pointed out in the written description and claims hereof as well as the appended drawings.
Drawings
FIG. 1 is a flow chart of an encoding method according to an embodiment of the present invention;
FIG. 2 is a flowchart illustrating a decoding method according to another embodiment of the present invention;
FIG. 3 is a diagram illustrating an encoding structure provided by an embodiment of the present invention;
fig. 4 is a decoding structure diagram according to another embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
It should be noted that although functional blocks are partitioned in a schematic diagram of an apparatus and a logical order is shown in a flowchart, in some cases, the steps shown or described may be performed in a different order than the partitioning of blocks in the apparatus or the order in the flowchart. The terms first, second and the like in the description and in the claims, and the drawings described above, are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order.
In the description of the embodiments of the present invention, unless explicitly defined otherwise, terms such as setting, installation, connection and the like should be understood in a broad sense, and those skilled in the art can reasonably determine the specific meanings of the terms in the embodiments of the present invention by combining the specific contents of the technical solutions.
The embodiments of the present invention will be further explained with reference to the drawings.
An embodiment of the invention discloses a coding method of a rateless code.
Fig. 1 is an encoding flow chart. The encoding method as shown in fig. 1, at least comprising the steps of:
step S101: an input information sequence is obtained.
Step S102: the input information sequence is encoded using a Kent mapping to form a rateless code.
In one embodiment, the input information sequence is equally divided into D segments to obtain D segments of information, and the length of each segment of information sequence is equal.
In one embodiment, the value of D depends on the length of the input information sequence and the selected number of bits k of each piece of information, i.e., the value of D is the ratio of the length of the input information sequence to the number of bits of each piece of information, and the value of D is a positive integer.
In one embodiment, the information rate of the rateless code is closer to the shannon channel capacity as the k value is smaller, and the coding complexity is higher as the k value is larger. However, since shannon channel capacity is proportional to the number of bits of information per segment, the computational complexity increases exponentially when the channel capacity increases, without rate coding. That is, increasing the value of k can increase the transmission speed of rateless codes, but the computational complexity increases exponentially. Therefore, to balance the speed of transmission of the rateless codes with the computational complexity, common k values include 2, 3, 4, 5, 6, 7, and 8.
In one embodiment, the expression of the Kent map is:
where a is a given value and 0 ≦ a <1, the input interval for f (x) is 0< x <1, and the output interval for f (x) is 0< f (x) < 1.
In one embodiment, for a given initial state value spine0It can be derived that:
spinei＝f(spinei-1),1≤i≤D
wherein, the initial state value spine0Has a value interval of 0<spine0<1。
In an embodiment, using Kent mapping, each segment of sequence in the information sequence is sequentially mapped with a previous state value corresponding to the sequence from front to back, so as to obtain a coding series state value ═ spine1，spine2，…，spinei，…，spineD) Wherein a series of state values spine is encoded1Is to pass through the first segment sequence and the initial state value spine0The first encoding series state value to be mapped, encoding series spineiRepresents the ith code series state value, i is more than or equal to 1 and less than or equal to D.
In one embodiment, the use of Kent mapping may increase the security of the encoded information sequence. Since the Kent mapping has autocorrelation, a difference of one bit in the information sequence will also result in different state values. The Kent mapping belongs to a chaotic function, the input interval and the output interval of the Kent mapping are the same, and no initial state value spine exists0In the case of (2), it is difficult to decode the information sequence. The Kent mapping has high uniform ergodicity, the iteration process of the Kent mapping is suitable for programmed operation, and the Kent mapping is distributed in all the intervals relatively uniformly, so that the confidentiality of the Kent mapping is high. Most of Kent mapping is applied to image encryption, and the Kent mapping is applied to communication coding, so that the difficulty of information sequence decoding can be greatly increased, even if communication signals are intercepted, decoding is difficult, and further, the communication safety is guaranteed.
In one embodiment, the output bits are processed using constellation mapping to form a rateless code. And processing the output bits by using constellation map mapping to form D constellation points, wherein the D constellation points jointly form a rateless code. The constellation mapping includes digital modulation, quadrature amplitude modulation, amplitude keying, and quadrature phase shift keying. The use of constellation mapping facilitates defining the amplitude and phase of the signal elements, which may improve transmission rates.
In one embodiment, the encoding method uses a Kent mapping to randomly encode information, with each output encoded codeword or symbol being different. The Kent mapping of each information sequence is associated in a serial concatenation mode, that is, the code word or symbol of the next stage contains all the previous code information.
Fig. 2 is a flowchart of a decoding method. The decoding method as shown in fig. 2 at least includes the following steps:
step S201: and acquiring the rateless code.
In one embodiment, the rateless code is a received information sequence encoded using an encoding method, and needs to be decoded before being read.
Step S202: and processing the rateless codes by using Kent mapping to obtain decoding series state values.
In one embodiment, the Kent mapping obtains a series of state values Spine, and the specific process is as follows: obtaining a series of state values { Spinei} and Spinei-1Obtaining a series of state values { spine through Kent mappingi,j},0≤j≤2k1, because of using Kent mapping, only one time of Kent mapping is needed in the calculation process to obtain a series of information sequences { Spinei,j}。
Step S203: and processing the state values of the rateless codes and the decoding series to obtain an input information sequence.
In one embodiment, the rateless code and decoded series of state values are analyzed using maximum likelihood rules. Due to the presence of channel noise, note xi,jFor an output symbol of the ith segment of information, note ni,jMean 0 and variance σ for co-distribution with the AWGN channel2The channel noise distribution of (a), the signal actually received by the decoder is yi,j＝xi,j+ni,j. When the encoding process is finished, the decoder receives
Order to
As one possible value of the input information sequence M. By comparing the decoded series of state values with the rateless code, the input information sequence can be obtained. The maximum likelihood rule is:
in one embodiment, the initial state value spine0Is a numerical value known by the encoding end and the decoding end in advance, as long as the initial state value spine0Within a given interval, the performance of the decoding itself is not affected. Since the Kent mapping is a chaotic function, when the initial state value is unknown, the non-rate code is difficult to decode, and the safety performance of the non-rate code is enhanced.
FIG. 3 is a coding structure diagram, and the coding method shown in FIG. 3 includes inputting an information sequence, a state value, a Kent map, a random number generator RNG, and a path, in the coding process, equally dividing the information in the input information sequence into D segments, each segment having a length of k bits, recording as kbits.
In one embodiment, the coding method equally divides the information D into L information sequences with equal length, each information sequence is represented by m, each information sequence m and the state value spine are used as input of Kent mapping, the output is the next state value, after the coding method determines the coding information to be sent each time, the random number generator RNG sequentially generates different coding code words or symbols under the action of the state value and the path, and the coding information is sent in the form of the path pass after constellation mapping.
Fig. 4 is a decoding structure diagram. The decoding method shown in fig. 4 includes: no rate code, comparison, Kent mapping, state value, input information sequence. In the decoding process, the information sequence and the state value are mapped and compared by Kent to generate an input information sequence.
When the bit number k value of each piece of information is 2, the difference between the computation complexity of coding the rateless code by using the Kent mapping and the computation complexity of coding the rateless code by using the hash function is not obvious, and along with the gradual increase of the bit number k value of each piece of information, when the k value is 8, the computation complexity of using the hash function is obviously higher than the computation complexity of using the Kent mapping.
In one embodiment, each calculation of compiling the rateless code using the Kent mapping and compiling the rateless code using the hash function is equivalent to calculating the number of additions, and finally comparing the two for calculating the number of additions per call. Since the decoding of the rateless codes by using the Kent mapping and the decoding of the rateless codes by using the hash function both use the layer-by-layer node search, the calculation of the two is comparable.
TABLE 1 Kent mapping versus Hash function computation complexity
Table 1 shows the comparison between the computational complexity of the Kent mapping and the hash function, and it can be seen from table 1 that the computational complexity of using the Kent function is about 32% of that of using the hash function. The Kent mapping is used for replacing a hash function, so that the complexity of calculation can be obviously reduced, the difficulty in the encoding process of the rateless code is reduced, and the requirement on the computing capacity of a decoder is reduced.
Table 2 shows that the performance of the Kent mapping and the hash function on the channel is compared, and when the SNR is-5 dB, the information rate of the rateless code compiled by using the Kent mapping and the information rate of the rateless code compiled by using the hash function both reach the upper limit of the shannon channel capacity. In the process that the signal-to-noise ratio is gradually increased, the information rate of the non-rate code compiled by using Kent mapping is basically consistent with the information rate of the non-rate code compiled by using a Hash function, even if the information rate is not reduced by compiling the non-rate code by using the Kent mapping, the calculation complexity is reduced, and the performance of the non-rate code during compiling is improved. In the case where the signal-to-noise ratio (SNR) is high and the k value is close to 8, the encoding process of the input information sequence using the Kent mapping can reduce the computational complexity.
| Signal to noise ratio | Shannon channel capacity | Hash function information rate | Kent mapping information rate |
| -5 | 0.3964 | 0.3964 | 0.3964 |
| 0 | 0.5000 | 0.4835 | 0.4834 |
| 5 | 1.0287 | 0.7157 | 0.7231 |
| 10 | 1.7287 | 1.3101 | 1.3701 |
| 15 | 2.5139 | 1.6803 | 1.7101 |
| 20 | 3.3291 | 1.8723 | 1.8722 |
Table 2 comparison of Kent mapping and hash function performance on channels
As shown in table 2, when the maximum difference between the information rates of the rateless code decoded by using the Kent mapping and the rateless code decoded by using the hash function is SNR of 10dB, the difference between the two is 4.3%, and when the SNR is-5 dB, the information rate encoded by using the hash function is the same as the information rate encoded by using the Kent mapping, and thus the information rates of the two are considered to be substantially the same. Even under the condition that the information rate of the rateless code compiled by the Kent mapping is basically the same as that of the rateless code compiled by the Hash function, the computational complexity of the coding and decoding process is obviously reduced.
In one embodiment, the type of rateless code comprises a Spinal code. Shannon channel capacity can be achieved in both BSC and AWGN channels using the Spinal code.
In one embodiment, the use scenario of the rateless code includes satellite communication and deep space communication.
In an embodiment, the electronic device includes an encoder. The encoder stores an initial state value spine0And the processing unit is used for processing the input information sequence to form a rateless code.
In an embodiment, an electronic device includes a decoder. The decoder stores an initial state value spine0And the decoding module is used for decoding the non-rate code to obtain an input information sequence.
In one embodiment, a computer-readable storage medium stores computer-executable instructions that may perform an encoding method or a decoding method.
It will be understood by those of ordinary skill in the art that all or some of the steps of the methods, systems, functional modules/units in the devices disclosed above may be implemented as software, firmware, hardware, and suitable combinations thereof. In a hardware implementation, the division between functional modules/units mentioned in the above description does not necessarily correspond to the division of physical components; for example, one physical component may have multiple functions, or one function or step may be performed by several physical components in cooperation. Some or all of the physical components may be implemented as software executed by a processor, such as a central processing unit, digital signal processor, or microprocessor, or as hardware, or as an integrated circuit, such as an application specific integrated circuit. Such software may be distributed on computer readable media, which may include computer storage media (or non-transitory media) and communication media (or transitory media). The term computer storage media includes volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data, as is well known to those of ordinary skill in the art. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, Digital Versatile Disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can accessed by a computer. In addition, communication media typically embodies computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism and includes any information delivery media as known to those skilled in the art.
While the preferred embodiments of the present invention have been described in detail, it will be understood by those skilled in the art that the foregoing and various other changes, omissions and deviations in the form and detail thereof may be made without departing from the scope of this invention.
Claims (9)
1. An encoding method, comprising:
acquiring an input information sequence;
and encoding the input information sequence by using Kent mapping to form a rate-free code.
2. The encoding method according to claim 1, wherein said encoding the input information sequence using the Kent mapping to form a rate-free code comprises:
d equally dividing the input information sequence to make each segment of information sequence equal in length;
processing the D equally divided input information sequences to form corresponding D code series state values by using Kent mapping;
processing the D encoded series of state values using a random number generator to form D output bits;
processing the D output bits using constellation mapping to form the rateless code;
the value D is the ratio of the length of the input information sequence to the number of bits of each piece of information, and the value D is a positive integer.
3. The encoding method according to claim 2, wherein said processing the D-equally divided input information sequences into corresponding D encoding-series state values using Kent mapping comprises:
setting an initial state value spine0；
Using Kent mapping to sequentially map each segment of sequence in the information sequence and the previous state value corresponding to the sequence from front to back to obtain a coding series state value (spine)1，spine2，…，spinei，…，spineD) Wherein a series of state values spine is encoded1Is to pass through the first segment sequence and the initial state value spine0The first encoding series state value to be mapped, encoding series spineiRepresents the ith code series state value, i is more than or equal to 1 and less than or equal to D.
4. The encoding method of claim 2, wherein said processing the D output bits into the rateless code using constellation mapping comprises:
processing the D output bits using the constellation map to form corresponding D constellation points;
the D constellation points jointly form the rateless code;
wherein the constellation mapping includes digital modulation, quadrature amplitude modulation, amplitude keying, and quadrature phase shift keying.
5. A method of decoding, comprising:
acquiring a rateless code;
processing the rateless codes by using Kent mapping to obtain decoding series state values;
and processing the no-rate code and the decoding series state value to obtain an input information sequence.
6. The decoding method according to claim 5, wherein said processing said rateless code using Kent mapping to obtain decoded series of state values comprises:
and processing the initial state value and the rateless code by using Kent mapping to obtain the decoding series state value.
7. The decoding method according to claim 5, wherein the processing the rateless code and the decoded series of state values to obtain the input information sequence comprises:
calculating channel noise according to the rateless code transmission channel;
comparing the rateless code to the decoded series of state values using a maximum likelihood rule;
eliminating the interference of the channel noise to the rateless codes;
and obtaining the input information sequence.
8. An electronic device, comprising: a memory, a processor, and a computer program stored on the memory and executable on the processor, wherein: the processor, when executing the computer program, implements the encoding method of any one of claims 1 to 4 and/or the decoding method of any one of claims 5 to 7.
9. A computer-readable storage medium storing computer-executable instructions for causing a computer to perform the encoding method of any one of claims 1 to 4 and/or the decoding method of any one of claims 5 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010174423.0A CN111404556A (en) | 2020-03-13 | 2020-03-13 | Encoding method, decoding method, device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010174423.0A CN111404556A (en) | 2020-03-13 | 2020-03-13 | Encoding method, decoding method, device and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111404556A true CN111404556A (en) | 2020-07-10 |
Family
ID=71432501
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010174423.0A Pending CN111404556A (en) | 2020-03-13 | 2020-03-13 | Encoding method, decoding method, device and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111404556A (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101695016A (en) * | 2009-10-22 | 2010-04-14 | 浙江大学 | Multi-user random access system based on rateless codes and coding and decoding method thereof |
| US20100241928A1 (en) * | 2009-03-18 | 2010-09-23 | Jaehong Kim | Data Processing System Having ECC Encoding and Decoding Circuits Therein with Code Rate Selection Based on Bit Error Rate Detection |
| CN104158622A (en) * | 2014-07-22 | 2014-11-19 | 南京航空航天大学 | Method for transmitting high energy-efficient perceptual information based on LT code significance sampling |
| US20170288703A1 (en) * | 2014-12-22 | 2017-10-05 | Huawei Technologies Co., Ltd. | Polar code encoding method and encoding apparatus |
| CN107566084A (en) * | 2017-07-24 | 2018-01-09 | 同济大学 | A kind of Spinal joint source-channel decoding methods on awgn channel |
| CN110048755A (en) * | 2019-04-09 | 2019-07-23 | 深圳大学 | A kind of millimetre-wave attenuator method and communication system |
-
2020
- 2020-03-13 CN CN202010174423.0A patent/CN111404556A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100241928A1 (en) * | 2009-03-18 | 2010-09-23 | Jaehong Kim | Data Processing System Having ECC Encoding and Decoding Circuits Therein with Code Rate Selection Based on Bit Error Rate Detection |
| CN101695016A (en) * | 2009-10-22 | 2010-04-14 | 浙江大学 | Multi-user random access system based on rateless codes and coding and decoding method thereof |
| CN104158622A (en) * | 2014-07-22 | 2014-11-19 | 南京航空航天大学 | Method for transmitting high energy-efficient perceptual information based on LT code significance sampling |
| US20170288703A1 (en) * | 2014-12-22 | 2017-10-05 | Huawei Technologies Co., Ltd. | Polar code encoding method and encoding apparatus |
| CN107566084A (en) * | 2017-07-24 | 2018-01-09 | 同济大学 | A kind of Spinal joint source-channel decoding methods on awgn channel |
| CN110048755A (en) * | 2019-04-09 | 2019-07-23 | 深圳大学 | A kind of millimetre-wave attenuator method and communication system |
Non-Patent Citations (3)
| Title |
|---|
| 周茜: "混沌理论及应用若干问题的研究" * |
| 周茜: "混沌理论及应用若干问题的研究", 《中国博士学位论文全文数据库基础科学辑》, pages 005 - 8 * |
| 李传虎: "基于纠错码的速率自适应传输方法研究", pages 136 - 196 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| WO2015139160A1 (en) | Hard decision decoding method for ldpc code of dynamic threshold bit-flipping | |
| Wu et al. | Blind recognition of LDPC codes over candidate set | |
| US10797728B1 (en) | Systems and methods for diversity bit-flipping decoding of low-density parity-check codes | |
| US10790857B1 (en) | Systems and methods for using decoders of different complexity in a hybrid decoder architecture | |
| US10924251B2 (en) | Encoding device and method and corresponding decoding device and method | |
| CN107370560A (en) | Coding and speed matching method, the device and equipment of a kind of polarization code | |
| JP2012151839A (en) | Method for performing soft decision decoding of euclidean space reed-muller code | |
| US20220263694A1 (en) | Apparatus for multi-level encoding | |
| EP4122102A1 (en) | List decoding of polarization-adjusted convolutional codes | |
| EP3476052A1 (en) | Coding and decoding of polar codes extended to lengths which are not powers of two | |
| KR100744201B1 (en) | Turbo decoder with circular redundancy code signature comparison | |
| CN114885370A (en) | Semantic communication method and device, electronic equipment and storage medium | |
| US20240048157A1 (en) | Encoding method, decoding method, electronic device and storage medium | |
| CN111478752B (en) | Information coding method and device | |
| CN109698706B (en) | Polarization code incoherent iterative detection method and device based on decision feedback | |
| US11658682B2 (en) | Methods for encoding and decoding sparse code and orthogonal sparse superposition code | |
| CN109412752B (en) | Non-coherent detection receiver, system and method for polarization code | |
| CN111404556A (en) | Encoding method, decoding method, device and storage medium | |
| Romano et al. | Sub-optimal importance sampling for fast simulation of linear block codes over BSC channels | |
| CN114421974A (en) | Polar code BPL decoding method with improved factor graph selection mode | |
| CN113395139A (en) | Convolutional code length blind identification method based on Gaussian column elimination | |
| CN115603858A (en) | Transmission method and device | |
| CN115037313B (en) | LDPC decoding quantization method, device and equipment, and LDPC decoding method and system | |
| Greig | Design techniques for efficient sparse regression codes | |
| RU2801163C1 (en) | Device for multilevel coding |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |