CN111211873B - Signal processing method based on redundant remainder system code - Google Patents
Signal processing method based on redundant remainder system code Download PDFInfo
- Publication number
- CN111211873B CN111211873B CN202010033761.2A CN202010033761A CN111211873B CN 111211873 B CN111211873 B CN 111211873B CN 202010033761 A CN202010033761 A CN 202010033761A CN 111211873 B CN111211873 B CN 111211873B
- Authority
- CN
- China
- Prior art keywords
- decoding
- result
- demodulation
- symbol
- reliability
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
- 238000003672 processing method Methods 0.000 title claims abstract description 20
- 239000013598 vector Substances 0.000 claims abstract description 29
- 238000012217 deletion Methods 0.000 claims abstract description 23
- 230000037430 deletion Effects 0.000 claims abstract description 23
- 238000004422 calculation algorithm Methods 0.000 claims abstract description 19
- 238000000034 method Methods 0.000 claims description 35
- 238000004590 computer program Methods 0.000 claims description 17
- 230000008569 process Effects 0.000 claims description 16
- 230000009897 systematic effect Effects 0.000 claims description 14
- 230000006854 communication Effects 0.000 claims description 12
- 238000004891 communication Methods 0.000 claims description 12
- 238000012545 processing Methods 0.000 claims description 12
- 238000012937 correction Methods 0.000 claims description 10
- 238000012216 screening Methods 0.000 claims description 4
- 238000009792 diffusion process Methods 0.000 description 9
- 230000005653 Brownian motion process Effects 0.000 description 7
- 238000004088 simulation Methods 0.000 description 7
- 230000005540 biological transmission Effects 0.000 description 6
- 230000007860 molecular communication Effects 0.000 description 6
- 238000005537 brownian motion Methods 0.000 description 5
- 238000004364 calculation method Methods 0.000 description 5
- 238000010586 diagram Methods 0.000 description 4
- 230000033001 locomotion Effects 0.000 description 4
- 230000006870 function Effects 0.000 description 3
- 239000011159 matrix material Substances 0.000 description 3
- 239000002245 particle Substances 0.000 description 3
- 239000000126 substance Substances 0.000 description 3
- 238000001514 detection method Methods 0.000 description 2
- 230000003993 interaction Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012360 testing method Methods 0.000 description 2
- 102000012440 Acetylcholinesterase Human genes 0.000 description 1
- 108010022752 Acetylcholinesterase Proteins 0.000 description 1
- 102220472851 Potassium voltage-gated channel subfamily KQT member 2_S52E_mutation Human genes 0.000 description 1
- 229940022698 acetylcholinesterase Drugs 0.000 description 1
- 230000009471 action Effects 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 150000001875 compounds Chemical class 0.000 description 1
- 125000004122 cyclic group Chemical group 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005265 energy consumption Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 239000012530 fluid Substances 0.000 description 1
- 230000001788 irregular Effects 0.000 description 1
- 239000007788 liquid Substances 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 210000000715 neuromuscular junction Anatomy 0.000 description 1
- 230000000704 physical effect Effects 0.000 description 1
- 102000004169 proteins and genes Human genes 0.000 description 1
- 108090000623 proteins and genes Proteins 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 230000035945 sensitivity Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
- H04L1/0009—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the channel coding
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0056—Systems characterized by the type of code used
Abstract
The invention relates to a signal processing method based on redundant remainder system code, which comprises the following steps: carrying out redundancy remainder system coding on the information source signal to obtain a coding result; modulating the coding result and sending the coding result to a channel for propagation; receiving a signal from a channel, and demodulating the signal received from the channel to obtain a demodulation result; obtaining the ratio between the maximum value and the secondary maximum value in the demodulation vector corresponding to each symbol in the demodulation result, and comparing the ratio with a preset reliability threshold value to screen out a low-reliability symbol; and decoding the demodulation result by adopting a deletion algorithm according to the number of the low-reliability symbols to obtain a decoding result.
Description
Technical Field
The invention relates to the technical field of communication, in particular to a signal processing method based on redundant remainder system codes.
Background
A Redundant Residue Number System (RRNS) is based on the Residue Number System, and an RRNS code is formed by adding a set of Redundant numbers to the Residue Number System and adding the Redundant numbers to the Residue Number; the RRNS code is divided into two parts, one part is a non-redundant base and consists of k symbols x a Is composed of (1 ≦ a ≦ k), and the other part is a redundant base composed of n-k symbols x b The component (k +1 is more than or equal to b and less than or equal to n), the non-redundant base represents the information bit, and the redundant base represents the check bit. When generating redundant bases, a set of non-redundant modulo m is needed a And a set of redundant modulo m b . These modulo sets must satisfy the following three rules:
1. the modulus consists of pairwise relative prime positive integers;
2. the integer value of the subsequent modulus is greater than the previous modulus (m) 1 <…<m k <m k+1 <…<m n )；
3. Mold M a And M b Must be sufficient to represent 0, M, respectively a -1]And [0,M b -1]All numbers within legal limits; wherein M is i ＝M/m i ，
The purpose of using RRNS codes as channel codes in a communication system is to detect and correct erroneous numbers in the remainder vector, increasing the ability to correct and detect errors. However, how to further promote and apply the scheme based on the RRNS code is still one of the research directions in the field.
Disclosure of Invention
The invention aims to solve the limitation of the prior art and provides a signal processing method based on redundant remainder systematic codes, which is realized by the following technical scheme:
a signal processing method based on redundant remainder system code includes the following steps:
carrying out redundancy remainder systematic coding on the information source signal to obtain a coding result;
modulating the coding result and sending the coding result to a channel for propagation;
receiving a signal from a channel, and demodulating the signal received from the channel to obtain a demodulation result;
obtaining the ratio of the maximum value to the secondary maximum value in the demodulation vector corresponding to each symbol in the demodulation result, and comparing the ratio with a preset reliability threshold value to screen out a low-reliability symbol;
and decoding the demodulation result by adopting a deletion algorithm according to the number of the low-reliability symbols to obtain a decoding result.
Compared with the prior art, the method and the device have the advantages that the demodulation results are screened before decoding, the low-reliability symbols are screened out, and the demodulation results are decoded according to the number of the low-reliability symbols, so that the probability of obtaining correct decoding results by RRNS decoding can be effectively improved, and the reliability of communication is improved.
Further, obtaining the ratio between the maximum value and the sub-maximum value in the demodulation vector corresponding to each symbol in the demodulation result, comparing the ratio with a preset reliability threshold value to screen out low-reliability symbols, and then carrying out comparison so as to obtain the low-reliability symbolsThe ratio lambda between the maximum value and the sub-maximum value in the demodulation vector corresponding to each symbol is obtained in the following way i (i＝1,2,...,n)：
Therein, max 1 Representing the maximum value, max, in the demodulation vector 2 The sub-maximum value in the demodulation vector is represented, and q represents the number of the demodulation vectors;
for λ generated in the above manner i (i =1,2,. Cndot., n) and the reliability threshold λ T Then λ is i >λ T The corresponding symbol is a low reliability symbol.
Further, decoding the demodulation result by using a deletion algorithm according to the number of the low-reliability symbols to obtain a decoding result, comprising the following steps:
using the remaining part of the demodulation result from which the low reliability symbols are deleted and the modulus corresponding to the remaining part as independent [ n-E, k ]]Code y = (y) 1 ,y 2 ,…,y n-E ) Decoding, wherein E is the number of symbol deletions determined according to the number T of the low-reliability symbols; obtaining said [ n-E, k ] in the following manner]Y generated by code in decoding process n-E The value:
wherein the content of the first and second substances,
and when T =0, E = T, and directly decoding the demodulation result to obtain a decoding result.
Further, decoding the demodulation result by using a deletion algorithm according to the number of the low-reliability symbols to obtain a decoding result, and the method further comprises the following steps:
when n-k is>T>When 0, E = T; if for said [ n-E, k]The decoding of the code does not exceed the error correction capability of the decoding, and when Y is equal to Y n-E When the value is not beyond the corresponding legal range, the Y is used n-E And performing modulus operation on the redundant base and the non-redundant base in the demodulation result to obtain a decoding result.
Further, according to the number of the low reliability symbols, decoding the demodulation result by using a deletion algorithm to obtain a decoding result, the method further comprises the following steps:
when n-k>T>0, then E = T; if for said [ n-E, k]The decoding of the code does not exceed the error correction capability of the decoding, and when Y is equal to Y n-E When the value exceeds the corresponding legal range, directly decoding the demodulation result to obtain a decoding result;
when n-k > T >0, then E = T; and if the decoding of the [ n-E, k ] code exceeds the error correction capability of decoding, directly decoding the demodulation result to obtain a decoding result.
Further, decoding the demodulation result by using a deletion algorithm according to the number of the low-reliability symbols to obtain a decoding result, and the method further comprises the following steps:
when T is larger than or equal to n-k, E = n-k, and the rest part is obtained by deleting the first n-k low reliability symbols in the demodulation result; if the remaining portions are smaller than the respective corresponding modes, and when Y is less than Y n-E When the value is not beyond the corresponding legal range, the Y is used n-E And performing modulus calculation on the redundant base and the non-redundant base in the demodulation result to obtain a decoding result.
Further, according to the number of the low reliability symbols, decoding the demodulation result by using a deletion algorithm to obtain a decoding result, the method further comprises the following steps:
when T is larger than or equal to n-k, E = n-k, and the rest part is obtained by deleting the first n-k low reliability symbols in the demodulation result; if the remaining portions are smaller than the respective corresponding modes, and when Y is less than Y n-E When the value exceeds the corresponding legal range, the demodulation result is directly decoded to obtainDecoding results;
when T is larger than or equal to n-k, E = n-k, and the rest part is obtained by deleting the first n-k low reliability symbols in the demodulation result; and if the residual parts are not smaller than the corresponding modes, directly decoding the demodulation result to obtain a decoding result.
A signal processing system based on redundant remainder systematic codes, comprising:
the coding module is used for carrying out redundancy remainder systematic coding on the information source signal to obtain a coding result;
a modulation sending module, configured to modulate the coding result and send the result to a channel for propagation;
the receiving demodulation module is used for receiving signals from the channel and demodulating the signals received from the channel to obtain a demodulation result;
the low-reliability symbol screening module is used for obtaining the ratio of the maximum value to the secondary maximum value in the demodulation vector corresponding to each symbol in the demodulation result, and comparing the ratio with a preset reliability threshold value to screen out a low-reliability symbol;
and the decoding module is used for decoding the demodulation result by adopting a deletion algorithm according to the number of the low-reliability symbols to obtain a decoding result.
The present invention further provides a storage medium, on which a computer program is stored, wherein the computer program, when executed by a processor, implements the steps of the signal processing method based on redundant remainder system code.
The present invention also provides a communication device, comprising a storage medium, a processor, and a computer program stored in the storage medium and executable by the processor, wherein the computer program, when executed by the processor, implements the steps of the aforementioned signal processing method based on redundant remainder system code.
For a better understanding and practice, the invention is described in detail below with reference to the accompanying drawings.
Drawings
FIG. 1 is a flowchart of a method for processing a signal based on redundant remainder system codes according to an embodiment of the present invention;
FIG. 2 is a flowchart of a method for processing a signal based on redundant remainder system codes according to an embodiment of the present invention;
FIG. 3 is a flowchart of a method for processing a signal based on redundant remainder system codes according to an embodiment of the present invention;
FIG. 4 is a flowchart of a method for processing a signal based on redundant remainder systematic codes according to an embodiment of the present invention;
FIG. 5 is a schematic diagram of a signal processing system based on redundant remainder systematic codes according to an embodiment of the present invention;
FIG. 6 is a diagram of a molecular communication 3D environment simulation with a transmitter and receiver distance D according to an embodiment of the present invention;
FIG. 7 is a schematic diagram of bit errors of [20,4] code and [20,6] code under different SNR according to an embodiment of the present invention.
Detailed Description
To make the objects, technical solutions and advantages of the present application more clear, embodiments of the present application will be described in further detail below with reference to the accompanying drawings.
It should be understood that the embodiments described are only some embodiments of the present application, and not all embodiments. All other embodiments obtained by persons of ordinary skill in the art based on the embodiments in the present application without any creative effort belong to the protection scope of the embodiments in the present application.
The terminology used in the embodiments of the present application is for the purpose of describing particular embodiments only and is not intended to be limiting of the embodiments of the present application. As used in the examples of this application and the appended claims, the singular forms "a", "an", and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It should also be understood that the term "and/or" as used herein refers to and encompasses any and all possible combinations of one or more of the associated listed items.
When the following description refers to the accompanying drawings, like numbers in different drawings represent the same or similar elements unless otherwise indicated. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present application. Rather, they are merely examples of apparatus and methods consistent with certain aspects of the application, as detailed in the appended claims. In the description of the present application, it is to be understood that the terms "first," "second," "third," and the like are used solely for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order, nor is it to be construed as indicating or implying relative importance. The specific meaning of the above terms in the present application can be understood by those of ordinary skill in the art as the case may be.
Further, in the description of the present application, "a plurality" means two or more unless otherwise specified. "and/or" describes the association relationship of the associated object, indicating that there may be three relationships, for example, a and/or B, which may indicate: a exists alone, A and B exist simultaneously, and B exists alone. The character "/" generally indicates that the former and latter associated objects are in an "or" relationship.
Example 1
In the present embodiment, the sequence-based signal processing is mainly described from the reception side and the transmission side in a communication system or a communication application environment. The receiving side may be a network device, and the transmitting side may be a terminal device; or the receiving side may be a terminal device and the transmitting side may be a network side. In the following embodiments, a receiving side is taken as a network device, and a transmitting side is taken as a terminal device, but the present invention is not limited thereto.
The terminal device involved in this embodiment may be a user equipment. The user equipment may be a wired device or a wireless device. The wireless device may be a handheld device with wireless connection capability, or other processing device connected to a wireless modem, a mobile terminal communicating with one or more core networks via a radio access network. For example, the wireless terminal may be a mobile phone, a computer, a tablet computer, a Personal Digital Assistant (PDA), a Mobile Internet Device (MID), a wearable device, an e-book reader, and the like. As another example, a wireless terminal can also be a portable, pocket, hand-held, computer-included, or vehicle-mounted mobile device. As another example, the wireless terminal may be a mobile station or an access point.
The network device involved in this embodiment may be a base station. The base stations may include various forms of macro base stations, micro base stations, relay stations, access point base station controllers, transmission and reception points, and the like. The specific names of base stations may vary in systems employing different radio access technologies.
The present embodiment provides a signal processing method based on redundant remainder systematic code, referring to fig. 1 to 4, which is implemented by the following technical solutions:
a signal processing method based on redundant remainder system code includes the following steps:
s1, carrying out redundancy remainder systematic coding on an information source signal to obtain a coding result;
s2, modulating the coding result and sending the coding result to a channel for propagation;
s3, receiving signals from the channel, and demodulating the signals received from the channel to obtain a demodulation result;
s4, obtaining the ratio of the maximum value to the secondary maximum value in the demodulation vector corresponding to each symbol in the demodulation result, and comparing the ratio with a preset reliability threshold value to screen out a low-reliability symbol;
and S5, decoding the demodulation result by adopting a deletion algorithm according to the number of the low-reliability symbols to obtain a decoding result.
Compared with the prior art, the method and the device have the advantages that the demodulation results are screened before decoding, the low-reliability symbols are screened out, and the demodulation results are decoded according to the number of the low-reliability symbols, so that the probability of obtaining correct decoding results by RRNS decoding can be effectively improved, and the reliability of communication is improved.
Specifically, the low reliability symbol is a signal in the transmission process
In an alternative embodiment, the RRNS coding process is as follows:
when RRNS coding is carried out, the transmitted information is putTo information bit (x) 1 ,x 2 ,...,x k ) Then according to the following formula:
wherein M is i ＝M/m i ，
Obtain the X corresponding to this information bit, X must be in the effective dynamic range [0, M ], then use the module (m) 1 ,m 2 ,...,m n ) And performing modulo calculation on the X in sequence.
Obtain corresponding (x) 1 ,x 2 ,...,x n ) And RRNS encoding is completed.
When decoding is carried out, y = (y) for a group of RRNS codes to be decoded 1 ,y 2 ,…,y n )，a 1 ,a 2 ,…,a n Is formed by y 1 ,y 2 ,…,y n The calculation results in:
step 1: for y = (y) 1 ,y 2 ,…,y n ) And a 1 ,a 2 ,…,a n Calculating Δ according to the following formula k+1 ,Δ k+2 ,...,Δ n :
Counting the number of non-zero in the test sample, if the number of non-zero in the test sample does not exceed the value
Jump directly to step 5, otherwise jump to step 2.
Step 2: take out y i I =1, 2.. K +1, calculated respectively according to the formula of step 1
When there is a Y existing legal range
The number of non-zero is not more than
Jump directly to step 5, otherwise jump to step 3.
And 3, step 3: take out y i I =1, 2.., k +2 is calculated according to the formula of step 1, respectively
When there is a Y there is a legal range
Satisfies that the number of non-zero is not more than
Jump directly to the fifth step, otherwise take y i ,(i＝1,2,...,k+i),i>2, repeating the above steps, if it comes
Or else no suitable Y is found, jump to step 4.
And 4, step 4: taking out
Respectively calculating according to the formula of the step 1
When there is a Y existing legal range
Satisfies that the number of non-zero is not more than
Jump directly to the fifth step, otherwise consider the error to exceed
Therefore, the decoding cannot be restored.
And 5: and according to the calculated M, if Y is in a legal range, performing modulo on the redundant base and the non-redundant base by using Y to obtain a decoding result.
In one embodiment, a ratio between a maximum value and a sub-maximum value in a demodulation vector corresponding to each symbol in the demodulation result is obtained, the ratio is compared with a preset reliability threshold value to screen out a low-reliability symbol, and a ratio λ between the maximum value and the sub-maximum value in the demodulation vector corresponding to each symbol is obtained in the following manner i (i＝1,2,...,n)：
Therein, max 1 Representing the maximum value, max, in the demodulation vector 2 Representing the sub maximum value in the demodulation vectors, and q represents the number of the demodulation vectors;
for λ generated in the above manner i (i =1,2,. Cndot., n) and the reliability threshold λ T Then λ i >λ T The corresponding symbol is the low reliability symbol.
Specifically, in the present embodiment, the symbol reliability and λ i Negative correlation, λ i The larger the symbol, the less reliable is, so i >λ T The corresponding symbol is a low reliability symbol.
As another embodiment that is fully equivalent to the previous embodiment and is within the scope of the present invention, the ratio λ between the maximum value and the sub-maximum value in the demodulation vector corresponding to each symbol is obtained as follows i (i＝1,2,...,n)：
For λ generated in the above manner i (i =1,2,. Cndot., n) and the reliability threshold λ T Then λ i <λ T The corresponding symbol is the low reliability symbol.
In contrast to the previous embodiments, in the present embodiment, the symbol reliability and λ i Positive correlation, λ i The smaller the symbol reliability, so i <λ T The corresponding symbol is the low reliability symbol.
Further, decoding the demodulation result by using a deletion algorithm according to the number of the low-reliability symbols to obtain a decoding result, comprising the following steps of:
s51, the rest part of the low reliability symbols in the demodulation result and the corresponding modulus of the rest part are deleted as independent [ n-E, k ]]Code y = (y) 1 ,y 2 ,…,y n-E ) Decoding, wherein E is the number of symbol deletions determined according to the number T of the low-reliability symbols; obtaining said [ n-E, k ] in the following manner]Y generated by code in decoding process n-E The value:
wherein, the first and the second end of the pipe are connected with each other,
and S52a, when T =0, E = T, and directly decoding the demodulation result to obtain a decoding result.
Further, decoding the demodulation result by using a deletion algorithm according to the number of the low-reliability symbols to obtain a decoding result, and the method further comprises the following steps:
s52b, when n-k>T>When 0, E = T; if for said [ n-E, k]The decoding of the code does not exceed the error correction capability of the decoding, and when Y is equal to Y n-E When the value is not beyond the corresponding legal range, the Y is used n-E And performing modulus calculation on the redundant base and the non-redundant base in the demodulation result to obtain a decoding result.
Further, according to the number of the low reliability symbols, decoding the demodulation result by using a deletion algorithm to obtain a decoding result, the method further comprises the following steps:
s52c, when n-k>T>When 0, E = T; if for said [ n-E, k]The decoding of the code does not exceed the error correction capability of the decoding, and when Y is equal to Y n-E When the value exceeds the corresponding legal range, directly decoding the demodulation result to obtain a decoding result;
s52d, when n-k > T >0, then E = T; and if the decoding of the [ n-E, k ] code exceeds the error correction capability of decoding, directly decoding the demodulation result to obtain a decoding result.
Further, decoding the demodulation result by using a deletion algorithm according to the number of the low-reliability symbols to obtain a decoding result, and the method further comprises the following steps:
S52E, when T is larger than or equal to n-k, E = n-k, and the rest part is obtained by deleting the first n-k low reliability symbols in the demodulation result; if the remaining portions are smaller than the respective corresponding modes, and when Y is less than Y n-E If the value does not exceed the corresponding legal range, applying Y n-E Value to the demodulation junctionAnd performing modulus calculation on the redundant base and the non-redundant base in the result to obtain a decoding result.
Further, decoding the demodulation result by using a deletion algorithm according to the number of the low-reliability symbols to obtain a decoding result, and the method further comprises the following steps:
s52f, when T is larger than or equal to n-k, E = n-k, and the rest part is obtained by deleting the first n-k low reliability symbols in the demodulation result; if the remaining portions are smaller than the respective corresponding modes, and when Y is less than Y n-E When the value exceeds the corresponding legal range, directly decoding the demodulation result to obtain a decoding result;
s52g, when T is larger than or equal to n-k, E = n-k, and the rest part is obtained by deleting the first n-k low reliability symbols in the demodulation result; and if the residual parts are not smaller than the corresponding modes, directly decoding the demodulation result to obtain a decoding result.
Specifically, the probability of correctly recovering the symbol through the residual part to binary conversion can be expressed as:
wherein the content of the first and second substances,
and P (r, d) represents the probability that there are d erroneous demodulation results but that these d erroneous demodulation results are exactly contained in r erasure symbols.
With H 0 、H 1 Respectively, indicates the hypothesis that the remaining symbols were demodulated incorrectly or correctly, at H 1 Under the condition of a set lambda T The probability density function PDF can be approximated as:
further, P (r, d):
referring to fig. 5, a signal processing system based on redundant remainder system code includes:
the encoding module 1 is used for carrying out redundancy remainder systematic encoding on the information source signal to obtain an encoding result;
a modulation sending module 2, configured to modulate the coding result and send the result to a channel for propagation;
the receiving and demodulating module 3 is used for receiving signals from the channel and demodulating the signals received from the channel to obtain a demodulation result;
the low-reliability symbol screening module 4 is used for obtaining the ratio between the maximum value and the secondary maximum value in the demodulation vector corresponding to each symbol in the demodulation result, and comparing the ratio with a preset reliability threshold value to screen out the low-reliability symbol;
and the decoding module 5 is used for decoding the demodulation result by adopting a deletion algorithm according to the number of the low-reliability symbols to obtain a decoding result.
The present embodiment further provides a storage medium, on which a computer program is stored, wherein the computer program, when executed by a processor, implements the steps of the signal processing method based on redundant remainder system code.
The present embodiment also provides a communication device, which includes a storage medium, a processor, and a computer program stored in the storage medium and executable by the processor, wherein the computer program, when executed by the processor, implements the steps of the signal processing method based on redundant remainder system code.
Example 2
referring to FIG. 6, a 3D environment simulation diagram of molecular communication with distance D between transmitter and receiver, wherein the transmitter and receiver can be regarded as a sphere with radius r TN And r RN And (4) showing. The pentagons represent the transmitted molecular information, which is transmitted at the transmitter node, in a brownian motion by diffusion, the nature of the diffusion channel playing an important role in the propagation of the molecules after releasing the information molecules. Some of these information molecules diffuse to reach the receptor and form a chemical bond with the receptor on its surface. When they reach the receiver, they are removed from the channel and the properties of these received molecules, such as concentration or type, constitute the received signal. And finally, the digital signals arrive at a receiver and are collected by the receiver, and the digital signals are judged by counting the number of the molecules to obtain the transmitted digital signals. Thus, time is easily divided into equal duration slots in which a single symbol is transmitted. These slots are called symbol intervals, denoted by t s And (4) showing. The information to be transmitted is modulated by some physical property of the information molecules, which may be the number, type or any other property of the information molecules arriving at the receiver.
In this embodiment, the simulation is performed by MATLAB software, and the numerator diffusion channel is an end-to-end numerator simulator that can transmit consecutive symbols, but it cannot ignore discarding inter-symbol interference because it transmits the numerator in consecutive symbol intervals, and it must be considered that the current symbol is affected by the previous symbol, but it still has certain advantages over other simulation systems, and it is more realistic in the receiver. It is possible to simulate a flowing environment with a transmitter and a receiver inside, and molecules, which may be various types of compounds, such as DNA, proteins, etc., are transported from the transmitter to the receiver by diffusion movement.
First, the discharge process of the molecules, the particle sending process is based on the input symbol S Tx (t), type of modulation and signal waveform to modulate the concentration N at the transmitter Tx (t) of (d). The number of released molecules may be increased substantially initially during the duration of a symbol interval, or the molecules may be selected to be transmitted continuously for a duration that depends on the capabilities of the transmitter node, the modulation scheme, or the incoming signal. The emitter node boundaries act as reflective boundaries for the information molecules that are emitted by themselves due to the lack of corresponding acceptor structures. It is more appropriate to release all information molecules at once than to send them continuously for a duration, if symbol demodulation is considered convenient. However, during the symbol duration, the transmitter should also operate, and the peak-to-average-numerator ratio (PAMR) at the transmitter node is defined as:
from PAMR it is known that if there is less space for the transmitter node to store the synthetic information molecules, it is necessary to transmit the synthetic information molecules before the storage area is full. Since emitting molecules only at the beginning of the symbol duration requires a larger molecule storage area and more molecules available for storage. A transmitter node may have less memory area if it extends the transmission to the symbol duration. Depending on the capabilities of the transmitter, a peak may or may not be transmitted at the beginning of the symbol duration. For example, consider two methods of transmitting symbols, one transmitting all the numerators at the beginning of the symbol duration, the other transmitting half the numerator at the beginning of the symbol duration and half the numerator in the middle of the symbol duration. For these cases, the PAMR values transmitted at the beginning of the symbol duration are twice as large as for the other method.
The discharge process of the molecules is described, and the propagation process of the molecules is described. In the foregoing, it was said that a flowing environment was simulated, and the random diffusion motion of information molecules in a fluid was simulated by brownian motion. The diffusion movement is controlled by the resultant force exerted on the information molecules by the liquid molecules caused by the thermal energy. In mathematics, brownian motion is described by the wiener process, which is a continuous-time random process. The wiener process Wt has four characteristics:
1、W 0 ＝0。
2、W t almost certainly continuous
3、W t There are individual increments.
4、W t -W s N (0, t-s). Wherein N (mu, sigma) 2 ) Is expressed with mean μ and variance σ 2 Gaussian distribution of (a).
To simulate brownian motion in an n-dimensional space, time is divided into small intervals and at each successive time step, random motion is applied to each dimension. The information molecules propagate in the environment according to these kinetics. The transmitter, receiver and messenger molecules are modeled as spheres, and the interaction between the messenger molecules is omitted for simplicity.
Finally, the most important process is the receiving process of the molecules, which must be carefully considered when simulating the molecular communication system, the molecules are discharged into the diffusion channel, they are all in irregular brownian motion, the molecules will arrive at the receiver at different times due to the time of arrival of the molecules at the receiver, the interaction force among the molecules, and so on, but only the number of the received molecules at a certain time is considered, because those which do not arrive at the receiver at the specified time will arrive at the receiver in the next time period, which will bring the inter-symbol interference to the following demodulation, in the simulation of this molecular communication system, only the mutual interference of the adjacent four symbols is considered. In nature, whenever a messenger molecule hits the body of a recipient, the molecule is received and removed from the environment. If the receptors do not remove the molecule from the environment, they have other mechanisms to ensure that each molecule contributes only once to the signal (as in the action of acetylcholinesterase in the neuromuscular junction), so after that point the impinging molecule cannot move further, constituting only one signal, a process known as the first impingement process. Of most concern is the probability that these diffusing information molecules will first arrive at a particular location at a particular time. In a one-dimensional environment, there is a closed form solution to the first hit probability function. In one-and two-dimensional environments, in the long run, the diffusing particles strike the receiver with a probability of 1 (cyclic process). However, when considering a three-dimensional environment, the probability of a diffusing particle missing a receiver is also positive. In a three-dimensional environment, the first hit probability for a point source is:
for a three-dimensional environment, the number of impinging molecules before time t is given by:
wherein r is RN The node radius of the receiver, D is the distance between the receiver and the transmitter, t is the transmission time, and D is the diffusion coefficient.
In a simulation environment, a random signal can be generated as an information source signal; specifically, a group of 0,1 symbol sequences are randomly generated, which is suitable for generating any number of symbol types, in the design, a matrix of 10 × 10000 is selected and generated, and data in the matrix are randomly generated at 0 or 1, so that the randomness of information transmitted in the analog communication system is met, the amount of information transmitted is not small, unnecessary errors caused by too little transmitted data are reduced, and the performance of the signal processing method based on the redundant remainder system code of the embodiment can be better detected.
After generating a random signal as a source signal, the following steps are also performed:
s1, carrying out redundancy remainder systematic coding on an information source signal to obtain a coding result;
s2, modulating the coding result and sending the coding result to a channel for propagation;
s3, receiving signals from the channel, and demodulating the signals received from the channel to obtain a demodulation result;
s4, obtaining the ratio of the maximum value to the secondary maximum value in the demodulation vector corresponding to each symbol in the demodulation result, and comparing the ratio with a preset reliability threshold value to screen out a low-reliability symbol;
and S5, decoding the demodulation result by adopting a deletion algorithm according to the number of the low-reliability symbols to obtain a decoding result.
In the Modulation and demodulation processes of the steps S2 and S3, MMSK Modulation, namely (M-ary Molecular Shift Keying) multi-system Molecular Shift Keying Modulation can be selected, the MMSK Modulation needs low energy consumption, different types of Molecular signals are output, and the signals are diffused to a receiver through a channel; meanwhile, the anti-interference performance is very strong, the sensitivity and the signal-to-noise ratio are improved, and the noise is eliminated. In particular, by using a plurality of (M) molecules to transmit M-ary symbol sequences, M types of molecules are used, so that its transmitter must have at least M molecule reservoirs to store different molecules, and its receiver must also have powerful detection functions. The receiver needs not only to be able to receive the number of detection molecules but also to be able to distinguish the kind of molecules.
When a symbol needs to be transmitted, the digital symbol is first modulated by the MMSK into a molecular signal. The transmitter then releases the molecular signal into the channel. Accordingly, when the molecular signal reaches the receiver, the receiver detects the number and number of internal molecular species and saves the number of each molecular species in a vector called the demodulation vector q. Finally, the MMSK demodulator finds the largest number of molecular species by accessing the demodulation vector.
The remaining modifications of the steps in this embodiment are the same as those in embodiment 1, and are not described herein again.
Specifically, for [20,4] code and [20,6] code of RRNS, where the number of redundancies in [20,4] code is 16, and similarly, the [20,6] code is 14, and the modulus is set to [5,7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79], for a set source signal matrix of 10 × 10000, bit Error Rates (BER) at different signal-to-noise ratios (SNR) after both are subjected to the signal processing method based on the redundant remainder system code of this embodiment are shown in fig. 7; it can be seen that the bit error rates of the [20,4] code and the [20,6] code are lower than those of the prior art after the signal processing method based on the redundant remainder system code of the embodiment is adopted, and the effect of improving the communication reliability in the molecular communication is proved.
A signal processing system based on redundant residue number system code, which can be regarded as a molecular communication system using MMSK modulation in this embodiment, includes:
the encoding module 1 is used for carrying out redundancy remainder systematic encoding on the information source signal to obtain an encoding result;
a modulation sending module 2, configured to modulate the coding result and send the result to a channel for propagation;
the receiving and demodulating module 3 is used for receiving signals from the channel and demodulating the signals received from the channel to obtain a demodulation result;
the low-reliability symbol screening module 4 is used for obtaining the ratio between the maximum value and the secondary maximum value in the demodulation vector corresponding to each symbol in the demodulation result, and comparing the ratio with a preset reliability threshold value to screen out a low-reliability symbol;
and the decoding module 5 is configured to decode the demodulation result by using a deletion algorithm according to the number of the low-reliability symbols to obtain a decoding result.
The present embodiment further provides a storage medium, on which a computer program is stored, wherein the computer program, when executed by a processor, implements the steps of the signal processing method based on redundant remainder system code.
The present embodiment further provides a communication device, which includes a storage medium, a processor, and a computer program stored in the storage medium and executable by the processor, wherein the computer program, when executed by the processor, implements the steps of the signal processing method based on redundant remainder system code.
The above-mentioned embodiments only express several embodiments of the present invention, and the description thereof is specific and detailed, but not to be understood as limiting the scope of the invention. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the inventive concept, which falls within the scope of the present invention.
Claims (5)
1. A signal processing method based on redundant remainder system code is characterized by comprising the following steps:
carrying out redundancy remainder systematic coding on the information source signal to obtain a coding result;
modulating the coding result and sending the coding result to a channel for propagation;
receiving a signal from a channel, and demodulating the signal received from the channel to obtain a demodulation result;
obtaining the ratio between the maximum value and the secondary maximum value in the demodulation vector corresponding to each symbol in the demodulation result, and comparing the ratio with a preset reliability threshold value to screen out a low-reliability symbol;
decoding the demodulation result by adopting a deletion algorithm according to the number of the low-reliability symbols to obtain a decoding result, and the method comprises the following steps:
using the remaining part of the demodulation result from which the low reliability symbols are deleted and the modulus corresponding to the remaining part as independent [ n-E, k ]]Code y = (y) 1 ,y 2 ,…,y n-E ) Decoding, wherein E is the number of symbol deletions determined according to the number T of the low-reliability symbols, and k is the number of information bits of the encoding result; obtaining said [ n-E, k ] in the following manner]Y generated by code in decoding process n-E The value:
wherein m is i A mold used in generating the redundant base;
when T =0, E = T, directly decoding the demodulation result to obtain a decoding result;
when n-k is>T>0, then E = T; if for said [ n-E, k]The decoding of the code does not exceed the error correction capability of the decoding when the Y is n-E When the value is not beyond the corresponding legal range, the Y is used n-E Performing modulus on the redundant base and the non-redundant base in the demodulation result to obtain a decoding result, when the Y is n-E When the value exceeds the corresponding legal range, directly decoding the demodulation result to obtain a decoding result; if for said [ n-E, k]If the code decoding exceeds the error correction capability of the decoding, directly decoding the demodulation result to obtain a decoding result;
when T is larger than or equal to n-k, E = n-k, and the rest part is obtained by deleting the first n-k low reliability symbols in the demodulation result; if the remaining portions are smaller than the respective corresponding modes, when Y is less than the respective corresponding mode n-E When the value is not beyond the corresponding legal range, the Y is used n-E Performing modulus on the redundant base and the non-redundant base in the demodulation result to obtain a decoding result, when the Y is n-E When the value exceeds the corresponding legal range, directly decoding the demodulation result to obtain a decoding result; and if the residual parts are not smaller than the corresponding modes, directly decoding the demodulation result to obtain a decoding result.
2. The signal processing method according to claim 1, wherein a ratio between a maximum value and a next maximum value in the demodulation vector corresponding to each symbol in the demodulation result is obtained, the ratio is compared with a preset reliability threshold to screen out a low-reliability symbol, and a ratio λ between a maximum value and a next maximum value in the demodulation vector corresponding to each symbol is obtained as follows i (i＝1,2,...,n)：
Therein, max 1 Representing the maximum value, max, in the demodulation vector 2 The sub-maximum value in the demodulation vector is represented, and q represents the number of the demodulation vectors;
for λ generated in the above manner i (i =1, 2.. N) and the reliability threshold λ T Then λ i >λ T The corresponding symbol is the low reliability symbol.
3. A signal processing system based on redundant remainder systematic codes, comprising:
the coding module is used for carrying out redundancy remainder systematic coding on the information source signal to obtain a coding result;
a modulation sending module, configured to modulate the coding result and send the result to a channel for propagation;
the receiving and demodulating module is used for receiving signals from the channel and demodulating the signals received from the channel to obtain a demodulation result;
the low-reliability symbol screening module is used for obtaining the ratio between the maximum value and the secondary maximum value in the demodulation vector corresponding to each symbol in the demodulation result, and comparing the ratio with a preset reliability threshold value to screen out the low-reliability symbol;
the decoding module is used for decoding the demodulation result by adopting a deletion algorithm according to the number of the low-reliability symbols to obtain a decoding result, and comprises the following steps:
using the remaining part of the low reliability symbol and the modulus corresponding to the remaining part in the demodulation result as independent [ n-E, k ]]Code y = (y) 1 ,y 2 ,…,y n-E ) Decoding, wherein E is the number of symbol deletions determined according to the number T of the low-reliability symbols, and k is the number of information bits of the encoding result; obtaining said [ n-E, k ] in the following manner]Y generated by code in decoding process n-E The value:
wherein m is i A die used in generating the redundant base;
when T =0, E = T, directly decoding the demodulation result to obtain a decoding result;
when n-k>T>0, then E = T; if for said [ n-E, k]The decoding of the code does not exceed the error correction capability of the decoding when the Y is n-E When the value is not beyond the corresponding legal range, the Y is used n-E Performing modulus on the redundant base and the non-redundant base in the demodulation result to obtain a decoding result, when the Y is n-E When the value exceeds the corresponding legal range, directly decoding the demodulation result to obtain a decoding result; if for said [ n-E, k]If the code decoding exceeds the error correction capability of decoding, directly decoding the demodulation result to obtain a decoding result;
when T is larger than or equal to n-k, E = n-k, and the rest part is obtained by deleting the first n-k low reliability symbols in the demodulation result; if the remaining portions are smaller than the respective corresponding modes, when Y is less than the respective corresponding mode n-E When the value is not beyond the corresponding legal range, the Y is used n-E Performing modulus on the redundant base and the non-redundant base in the demodulation result to obtain a decoding result, when the Y is n-E When the value exceeds the corresponding legal range, directly decoding the demodulation result to obtain a decoding result; and if the residual parts are not smaller than the corresponding modes, directly decoding the demodulation result to obtain a decoding result.
4. A storage medium having a computer program stored thereon, the computer program comprising: the computer program implementing the steps of the method for signal processing based on redundant remainder system code according to any of claims 1 to 2 when executed by a processor.
5. A communication device, characterized by: comprising a storage medium, a processor and a computer program stored in the storage medium and executable by the processor, the computer program when executed by the processor implementing the steps of the signal processing method based on redundant remainder system code according to any of claims 1 to 2.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010033761.2A CN111211873B (en) | 2020-01-13 | 2020-01-13 | Signal processing method based on redundant remainder system code |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010033761.2A CN111211873B (en) | 2020-01-13 | 2020-01-13 | Signal processing method based on redundant remainder system code |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111211873A CN111211873A (en) | 2020-05-29 |
| CN111211873B true CN111211873B (en) | 2022-10-04 |
Family
ID=70788161
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010033761.2A Expired - Fee Related CN111211873B (en) | 2020-01-13 | 2020-01-13 | Signal processing method based on redundant remainder system code |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111211873B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112350799B (en) * | 2020-09-23 | 2023-06-13 | 华南师范大学 | Error correction method, system, device and medium for channel coding |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1674567A (en) * | 2004-03-23 | 2005-09-28 | 三洋电机株式会社 | Method and apparatus for detecting signals, and transmitting apparatus and receiving apparatus using the same |
| CN101127754A (en) * | 2006-08-18 | 2008-02-20 | 恩益禧电子股份有限公司 | Symbol timing detection method and apparatus, and preamble detection method and apparatus |
| CN102238710A (en) * | 2010-04-29 | 2011-11-09 | 中兴通讯股份有限公司 | Uplink closed-loop power control method, node B and radio network controller (RNC) |
| CN108494527A (en) * | 2018-03-20 | 2018-09-04 | 清华大学 | A kind of data transmission and reception method based on LoRa |
| CN110224788A (en) * | 2019-05-27 | 2019-09-10 | 中国联合网络通信集团有限公司 | A kind of method and device of data transmission |
| CN110474713A (en) * | 2019-07-01 | 2019-11-19 | 华南师范大学 | A kind of communication system for improving RRNS code coding/decoding process |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10070327B2 (en) * | 2014-04-28 | 2018-09-04 | Verizon Patent And Licensing Inc. | Centralized channel coding and shaping for a multi-node RAN |
-
2020
- 2020-01-13 CN CN202010033761.2A patent/CN111211873B/en not_active Expired - Fee Related
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1674567A (en) * | 2004-03-23 | 2005-09-28 | 三洋电机株式会社 | Method and apparatus for detecting signals, and transmitting apparatus and receiving apparatus using the same |
| CN101127754A (en) * | 2006-08-18 | 2008-02-20 | 恩益禧电子股份有限公司 | Symbol timing detection method and apparatus, and preamble detection method and apparatus |
| CN102238710A (en) * | 2010-04-29 | 2011-11-09 | 中兴通讯股份有限公司 | Uplink closed-loop power control method, node B and radio network controller (RNC) |
| CN108494527A (en) * | 2018-03-20 | 2018-09-04 | 清华大学 | A kind of data transmission and reception method based on LoRa |
| CN110224788A (en) * | 2019-05-27 | 2019-09-10 | 中国联合网络通信集团有限公司 | A kind of method and device of data transmission |
| CN110474713A (en) * | 2019-07-01 | 2019-11-19 | 华南师范大学 | A kind of communication system for improving RRNS code coding/decoding process |
Non-Patent Citations (3)
| Title |
|---|
| "A Robust Detection Algorithm for Real Signals Based on RRNS";Feilong Wu.;《2017 IEEE 17th International Conference on Communication Technology》;20180517;第1-5页 * |
| "基于RRNS纠错算法研究";尹鹏胜;《中国优秀硕士论文全文数据库》;20160315;I136-494 * |
| "基于有限域的LDPC卷积码构造算法";穆丽伟等.;《华南师范大学学报（自然科学版）》;20161231;第1-5页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111211873A (en) | 2020-05-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR101166965B1 (en) | Methods and apparatus for communicating in a peer to peer system where device communications may partially interfere with one another | |
| KR101120239B1 (en) | Methods and apparatus for channel estimation and rate feedback in a peer to peer network | |
| CN107196732B (en) | Anti-eavesdrop coding method based on fountain codes coding | |
| Dissanayake et al. | Interference mitigation in large-scale multiuser molecular communication | |
| CN111480324B (en) | Device and method for detecting mutually interfering information flows | |
| CN101040480A (en) | Dmt symbol repetitioin in the presence of impulse noise | |
| CN111211873B (en) | Signal processing method based on redundant remainder system code | |
| CN108494527A (en) | A kind of data transmission and reception method based on LoRa | |
| CN102571274B (en) | Signal transmitting method applicable to prerotation phase of wireless bidirectional relay system | |
| CN1349700A (en) | Receivers including iterative MAP detection and related methods | |
| Hofmann et al. | Coding in diffusion-based molecular nanonetworks: A comprehensive survey | |
| CN105959104A (en) | Steganalysis method based on Hamming distance distribution | |
| CN106209312B (en) | A kind of cyclic code parameter blind identification using soft-decision | |
| US9203441B2 (en) | Partial packet recovery in wireless networks | |
| Salariseddigh et al. | Deterministic identification for mc isi-poisson channel | |
| CN109525367B (en) | Error detection and adaptive error correction method based on LoRa coding and decoding mechanism | |
| Zare et al. | Receiver design and performance analysis for pulse position modulation technique in diffusion-based molecular communication | |
| CN110474713B (en) | Communication system for improving coding and decoding process of RRNS code | |
| US10313052B2 (en) | Method and device for flexible, selective SSDF relaying | |
| KR20090063922A (en) | Apparatus and method for receiving signal in a communication system | |
| CN114884784B (en) | Constellation point mapping relation generation method, signal transmission method and related device | |
| Gelles et al. | Interactive coding resilient to an unknown number of erasures | |
| US8539301B2 (en) | Message-wise unequal error protection | |
| US11489623B2 (en) | Error correction in network packets | |
| CN108989816A (en) | A kind of coded channel information hidden method based on wavelet transformation |
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 | ||
| CB03 | Change of inventor or designer information | ||
| CB03 | Change of inventor or designer information |
Inventor after: Zhong Yonglin Inventor after: Mu Liwei Inventor before: Mu Liwei Inventor before: Zhong Yonglin |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20221004 |