Coding and decoding methods of backscatter communication system and related devices
By combining differential encoding and bit state transfer information, the decoding sensitivity of the backscatter communication system is improved, the problem of low decoding sensitivity is solved, and the reliability and quality of the communication system are enhanced.
Patent Information
- Application Number
- CN202410960883.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-17
- Publication Date
- 2024-11-26
AI Technical Summary
The decoding sensitivity of backscatter communication systems is low, resulting in insufficient communication reliability and accuracy, especially in wireless channels that are susceptible to interference and noise.
By using a decoding method combining differential encoding and bit state transfer information, the input bits of the received symbols are determined by obtaining the sequence to be decoded and the bit state transfer information, and differentially decode the initial decoding sequence to improve the decoding success rate .
The decoding sensitivity of the backscatter communication system is improved, the influence of channel noise and interference is reduced, and the reliability of signal transmission and communication quality is increased.
Smart Images

Figure CN119030576A_ABST
Abstract
Description
Technical Field
[0001] The embodiments of the present specification relate to the field of digital signal processing technology, and specifically to a coding and decoding method and related devices for a backscatter communication system. Background Art
[0002] The backscatter communication system uses the principle of radio frequency signal backscattering to perform contactless data communication through wireless radio frequency, which can achieve the purpose of target identification and data exchange.
[0003] In the related art, when performing wireless communication, the backscatter communication system usually adopts FM0 coding or Miller coding for encoding and adopts maximum likelihood estimation for decoding, and its decoding sensitivity is low. Therefore, the decoding sensitivity of the backscatter communication system in the related art needs to be improved.
[0004] Therefore, there is an urgent need to provide a coding and decoding method to improve the decoding sensitivity of the backscatter communication system. Summary of the invention
[0005] In view of this, multiple embodiments of this specification are dedicated to providing a coding, decoding method and related devices to improve the decoding sensitivity of the backscatter communication system.
[0006] The embodiment of the present specification provides a decoding method for a backscatter communication system, which is applied to a receiver of the backscatter communication system; the decoding method comprises: obtaining a sequence to be decoded and bit state transition information; wherein the sequence to be decoded comprises a plurality of received code elements; the bit state transition information comprises a plurality of state transition path branches, any of the state transition path branches comprises a preceding bit, an input bit and an output code element, the preceding bit and the input bit are any one of bit 0 and bit 1 in a preset bit state, the preceding bit and the input bit are the same or different; for any one of the sequence to be decoded, The method comprises the steps of: determining a correlation value of an output codeword of each state transition path branch relative to the received codeword based on a preset subcarrier; determining an input bit corresponding to the received codeword based on a previous bit corresponding to the received codeword, a correlation value of each output codeword relative to the received codeword, and the bit state transition information, to obtain an initial decoding sequence; wherein the previous bit corresponding to the received codeword is an input bit corresponding to the previous codeword of the received codeword; the initial decoding sequence includes the input bit corresponding to each received codeword; and performing differential decoding on the initial decoding sequence to obtain a differential decoding sequence.
[0007] The embodiment of the present specification provides a coding method for a backscatter communication system, which is applied to a transmitter of the backscatter communication system; the coding method comprises: obtaining an initial data sequence and bit state transition information; wherein the bit state transition information comprises a plurality of state transition path branches, any of the state transition path branches comprises a preceding bit, an input bit and an output symbol, the preceding bit and the input bit are both any one of bit 0 and bit 1 in a preset bit state, and the preceding bit and the input bit are the same or different; differentially encoding the initial data sequence to obtain a differential data sequence; wherein the differential data sequence comprises a plurality of bits, any bit in the differential data sequence is bit 0 or bit 1; sequentially obtaining bits in the differential data sequence as input bits, and determining the output symbol corresponding to the input bit according to the input bit, the preceding bit of the input bit and the bit state transition information; performing subcarrier modulation on each of the output symbols based on a preset subcarrier to obtain a coding sequence.
[0008] The embodiment of the present specification provides a decoding device of a backscatter communication system, which is applied to a receiver of the backscatter communication system; the decoding device comprises: a second acquisition module, which is used to acquire a sequence to be decoded and bit state transition information; wherein the sequence to be decoded comprises a plurality of received code elements; the bit state transition information comprises a plurality of state transition path branches, any of which comprises a preceding bit, an input bit and an output code element, the preceding bit and the input bit are either bit 0 or bit 1 in a preset bit state, and the preceding bit and the input bit are the same or different; a correlation module, which is used to obtain a sequence to be decoded and a bit state transition information for any of the sequence to be decoded A receiving codeword, based on a preset subcarrier, determines the correlation value of the output codeword of each state transition path branch relative to the receiving codeword; an initial decoding module is used to determine the input bit corresponding to the receiving codeword based on the previous bit corresponding to the receiving codeword, the correlation value of each output codeword relative to the receiving codeword and the bit state transition information, so as to obtain an initial decoding sequence; wherein the previous bit corresponding to the receiving codeword is the input bit corresponding to the previous codeword of the receiving codeword; the initial decoding sequence includes the input bit corresponding to each of the receiving codewords; a differential decoding module is used to perform differential decoding on the initial decoding sequence to obtain a differential decoding sequence.
[0009] The embodiment of the present specification provides an encoding device of a backscatter communication system, which is applied to the transmitter of the backscatter communication system; the encoding device includes: a first acquisition module, which is used to obtain an initial data sequence and bit state transition information; wherein the bit state transition information includes multiple state transition path branches, any of the state transition path branches includes a previous bit, an input bit and an output codeword, the previous bit and the input bit are any one of bit 0 and bit 1 in a preset bit state, and the previous bit and the input bit are the same or different; a differential encoding module, which is used to differentially encode the initial data sequence to obtain a differential data sequence; wherein the differential data sequence includes multiple bits, and any bit in the differential data sequence is bit 0 or bit 1; a codeword mapping module, which is used to sequentially obtain bits in the differential data sequence as input bits, and determine the output codeword corresponding to the input bit according to the input bit, the previous bit of the input bit and the bit state transition information; a subcarrier modulation module, which is used to perform subcarrier modulation on each of the output codewords based on a preset subcarrier to obtain a coding sequence.
[0010] An embodiment of the present specification provides a computer device, including a memory and a processor, wherein the memory stores a computer program, and when the processor executes the computer program, the encoding method or the decoding method described in any of the above embodiments is implemented.
[0011] An embodiment of the present specification provides a chip, including a storage unit and a processing unit, wherein the storage unit stores a computer program, and the processing unit implements the encoding method or decoding method described in any of the above embodiments when executing the computer program.
[0012] An embodiment of the present specification provides a computer-readable storage medium having a computer program stored thereon. When the computer program is executed by a processor, the encoding method or the decoding method described in any of the above embodiments is implemented.
[0013] In multiple implementations provided in this specification, a receiver of a backscatter communication system obtains bit state transition information and a sequence to be decoded; wherein the sequence to be decoded includes multiple received code elements, the bit state transition information includes multiple state transition path branches, any state transition path branch includes a previous bit, an input bit and an output code element, the previous bit and the input bit are any one of bit 0 and bit 1 in a preset bit state, and the previous bit and the input bit are the same or different; then, for any received code element in the sequence to be decoded, a correlation value of the output code element of each state transition path branch relative to the received code element is determined based on a preset subcarrier; then, based on the previous bit corresponding to the received code element, the correlation value of each output code element relative to the received code element and the bit state transition information, the input bit corresponding to the received code element is determined to obtain an initial decoding sequence; wherein the previous bit corresponding to the received code element is the input bit corresponding to the previous code element of the received code element; the initial decoding sequence includes the input bit corresponding to each received code element; then, the initial decoding sequence is differentially decoded to obtain a differential decoding sequence, so that the decoding sensitivity of the backscatter communication system can be improved. BRIEF DESCRIPTION OF THE DRAWINGS
[0014] Figure 1 A schematic diagram of a coding method provided in an embodiment of this specification;
[0015] Figure 2a A schematic diagram of a preset symbol state provided for an implementation manner of this specification;
[0016] Figure 2b A schematic diagram of bit state transfer information provided in an embodiment of this specification;
[0017] Figure 3a A schematic diagram of differential encoding provided for an embodiment of this specification;
[0018] Figure 3b A schematic diagram of differential encoding and symbol mapping provided for an embodiment of this specification;
[0019] Figure 3c A schematic diagram of subcarrier modulation provided in an embodiment of this specification;
[0020] Figure 3d A schematic diagram of subcarrier modulation provided in an embodiment of this specification;
[0021] Figure 4 A flowchart of a decoding method provided in an embodiment of this specification;
[0022] Figure 5 A schematic diagram of sampling point offset provided in an embodiment of this specification;
[0023] Figure 6A schematic diagram of bit state transfer information provided in an embodiment of this specification;
[0024] Figure 7 A schematic diagram of real-time weights and cumulative weights provided for implementation of this specification;
[0025] Figure 8 A schematic diagram of a storage bit path table provided for an embodiment of this specification;
[0026] Fig. 9 A flowchart of a decoding method provided in an embodiment of this specification;
[0027] Fig.10 A schematic diagram of an encoding device provided in an embodiment of this specification;
[0028] Fig.11 A schematic diagram of a decoding device provided in an embodiment of this specification;
[0029] Fig.12 A schematic diagram of a computer device provided for embodiments of the present specification. DETAILED DESCRIPTION
[0030] In order to enable those skilled in the art to better understand the solution of this specification, the technical solution in the implementation of this specification will be clearly and completely described below in conjunction with the drawings in the implementation of this specification. Obviously, the described implementation is only a part of the implementation of this specification, not all of the implementations. Based on the implementation in this specification, all other implementations obtained by ordinary technicians in this field without creative work are within the scope of protection of this specification.
[0031] In the related art, when performing wireless communication, the backscatter communication system usually uses FM0 coding or Miller coding for encoding and uses maximum likelihood estimation or Viterbi decoding for decoding, and its decoding sensitivity is low. Therefore, it is necessary to improve the decoding sensitivity of the backscatter communication system, thereby improving the communication reliability of the backscatter communication system.
[0032] The embodiments of this specification provide a scenario example of an encoding method and a decoding method, and the scenario example is a backscatter communication system. In this scenario example, the backscatter communication system may include a transmitter and a receiver, the transmitter may be one of a reader and a tag, the receiver may be the other of the reader and the tag, the transmitter may obtain an initial data sequence for encoding and transmit it to the receiver, and the receiver may decode after receiving the sequence to be decoded.
[0033] In this scenario example, the wireless channel in the backscatter communication system is easily affected by non-ideal factors such as interference, multipath fading and noise, which makes it easy for the signal to be distorted and distorted during transmission, resulting in bit errors. In addition to the above irrational factors, there are also problems such as double wireless channel fading, limited energy and limited computing resources of passive nodes (such as tags, sensors, etc.), so in this scenario example, the communication reliability and communication distance can be improved by adopting a low-power, low-complexity coding scheme.
[0034] For example, the transmitter may be a tag and the receiver may be a reader. After receiving the signal sent by the reader, the tag may use the energy in the signal to activate the internal circuit, then obtain the initial data sequence for encoding and transmit the signal back to the reader. After receiving the return signal, the reader may obtain the sequence to be decoded for decoding.
[0035] As another example, the transmitter may be a reader and the receiver may be a tag. The reader may obtain an initial data sequence for encoding and transmit it to the tag. After receiving the signal sent by the reader, the tag may use the energy in the signal to activate the internal circuit, then obtain the sequence to be decoded from the received signal for decoding, and transmit the signal back to the reader.
[0036] This specification provides a coding method for a backscatter communication system. Figure 1 , Figure 1 It is a flowchart of a coding method provided by this embodiment. This embodiment provides method operation steps as shown in the flowchart, but may include more or fewer operation steps based on conventional or non-creative labor. The order of steps listed in the embodiment is only one execution method among many step execution sequences, and does not represent the only execution sequence. When the actual system or server product is executed, it can be executed in sequence or in parallel according to the method shown in the embodiment (for example, in a parallel processor or multi-threaded processing environment). The coding method can be applied to the transmitter in the backscatter communication system, specifically as Figure 1 As shown, the encoding method may include the following steps.
[0037] Step S110: Obtain an initial data sequence and bit state transition information; wherein the bit state transition information includes multiple state transition path branches, any state transition path branch includes a previous bit, an input bit and an output codeword, the previous bit and the input bit are either bit 0 or bit 1 in a preset bit state, and the previous bit and the input bit are the same or different.
[0038] In some cases, the transmitter may be preset with bit state transition information.
[0039] For example, see Figure 2a, the bit state transfer information may include a preset symbol state, and the preset symbol state may include a first symbol, a second symbol, a third symbol, and a fourth symbol, and the first symbol, the second symbol, the third symbol, and the fourth symbol may be represented by S1(t), S2(t), S3(t), and S4(t), respectively. As an example, the first symbol, the second symbol, the third symbol, and the fourth symbol may also be represented by S1, S2, S3, and S4, respectively. The first symbol is inverse to the fourth symbol, which may mean that the fourth symbol may be obtained by negating the first symbol, and the second symbol is inverse to the third symbol, which may mean that the third symbol may be obtained by negating the second symbol. That is, S4=-S1, S3=-S2.
[0040] For example, see Figure 2b , the bit state transition information may include 4 state transition path branches, each of which may include a preceding bit, an input bit, and an output symbol. As an example, the output symbol of a state transition path branch in the bit state transition information may be any one of the first symbol S1, the second symbol S2, the third symbol S3, and the fourth symbol S4 in the preset symbol state.
[0041] The input bit in each state transition path branch can be mapped or represented by the output code element in the state transition path branch. For example, when the input bit is bit 0, it can correspond to the third code element S3 or the fourth code element S4, and when the input bit is bit 1, it can correspond to the first code element S1 or the second code element S2. In other words, when the input bit is bit 0, it can be mapped or represented by the third code element S3 or the fourth code element S4, and when the input bit is bit 1, it can be mapped or represented by the first code element S1 or the second code element S2.
[0042] The previous bit in each state transition path branch is used to determine the output code element corresponding to the input bit in combination with the input bit. In other words, when the mapping relationship or representation relationship between the input bit and the preset code element state is satisfied, the output code element corresponding to the input bit can be determined by the previous bit. For example, when the input bit is bit 0, the input bit corresponds to S3 or S4. At this time, if the previous bit is bit 0, the output code element is S3, and if the previous bit is bit 1, the output code element is S4.
[0043] Step S120: differentially encode the initial data sequence to obtain a differential data sequence; wherein the differential data sequence includes a plurality of bits, and any bit in the differential data sequence is bit 0 or bit 1.
[0044] In some cases, in order to reduce the problem of received data inversion at the receiver, the transmitter may perform differential encoding on the initial data sequence before performing symbol mapping based on the bit state transition information.
[0045] Specifically, the initial data sequence may be a bit stream, that is, a digital stream composed of binary digits. Each digit in the digital stream is called a bit, and the bit may be bit 0 or bit 1.
[0046] Step S130: sequentially obtain bits in the differential data sequence as input bits, and determine the output code element corresponding to the input bit according to the input bit, the preceding bit of the input bit and the bit state transition information.
[0047] The differential data sequence may be a bit stream after differential encoding.
[0048] Exemplarily, based on the output codewords corresponding to each input bit in the differential coding sequence, a codeword mapping sequence can be obtained; the codeword mapping sequence can include multiple output codewords.
[0049] Step S140: performing subcarrier modulation on each output symbol based on a preset subcarrier to obtain a coding sequence.
[0050] Specifically, performing subcarrier modulation on each output symbol based on a preset subcarrier to obtain a coding sequence may mean performing subcarrier modulation on a symbol mapping sequence including multiple output symbols based on a subcarrier to obtain a coding sequence to be transmitted.
[0051] In the above implementation, the differential coding sequence is obtained by differentially encoding the initial data sequence, and the differential data sequence is symbol mapped based on the preset bit state transfer information and the preset symbol state, and then the symbol mapping sequence including multiple output symbols obtained by symbol mapping is subcarrier modulated to obtain the coded sequence to be transmitted, and the coding complexity is low, the scheme is relatively simple to implement, and the energy consumption and hardware resource consumption in the backscatter communication system or the passive backscatter communication system can be reduced. In addition, compared with Miller coding and Viterbi decoding, the minimum code distance in this implementation is increased, which can effectively reduce the influence of channel noise and interference, reduce the bit error rate of signal transmission, and thus improve the communication quality and the decoding sensitivity of the receiver.
[0052] In some embodiments, please refer to Figure 2b , determining the output symbol corresponding to the input bit according to the input bit, the preceding bit of the input bit and the bit state transition information, may include the following steps:
[0053] In the case where the preceding bit is bit 0, if the input bit is bit 0, the third symbol is used as the output symbol corresponding to the input bit according to the bit state transition information.
[0054] In the case where the preceding bit is bit 0, if the input bit is bit 1, the first codeword is used as the output codeword corresponding to the input bit according to the bit state transition information.
[0055] In the case where the previous bit is bit 1, if the input bit is bit 0, the fourth codeword is used as the output codeword corresponding to the input bit according to the bit state transition information.
[0056] In the case where the previous bit is bit 1, if the input bit is bit 1, the second codeword is used as the output codeword corresponding to the input bit according to the bit state transition information.
[0057] In the above implementation, based on the mapping relationship or representation relationship between the preset bit state of the input bit and the preset codeword state in the bit state transition information, combined with the bit state of the input bit and the bit state of the previous bit, the output codeword corresponding to the input bit can be quickly determined. The scheme is simple to implement and can improve the encoding speed.
[0058] In some implementations, the initial data sequence may include P-1 bits, and the differential data sequence may include P bits, where P is an integer greater than or equal to 2.
[0059] In this embodiment, differential encoding is performed on the initial data sequence to obtain a differential data sequence, which may include the following steps S210-S240:
[0060] Step S210: sequentially obtain P-1 bits in the initial data sequence as the current bit. If the current bit in the initial data sequence is the first bit in the initial data sequence, perform an XOR operation on the current bit in the initial data sequence and bit 0 to obtain a corresponding first XOR operation result.
[0061] Step S220: If the current bit in the initial data sequence is not the first bit in the initial data sequence, perform an XOR operation on the current bit in the initial data sequence and the previous first XOR operation result to obtain a corresponding first XOR operation result.
[0062] By determining the first XOR operation result between the first bit in the initial data sequence and bit 0, and determining the first XOR operation result between the non-first bit in the initial data sequence and the previous first XOR operation result, P-1 first XOR operation results corresponding one-to-one to P-1 bits in the initial data sequence can be obtained.
[0063] Step S230: taking bit 0 as the first bit in the differential data sequence, and determining P-1 bits after the first bit in the differential data sequence according to P-1 first XOR operation results.
[0064] As an example, see Figure 3a, the initial data sequence may be [1 0 0 1 0 1 1 0 0 1], which includes 10 bits, and P=11. The first bit in the initial data sequence is bit 1, and the first bit 1 is different from bit 0, and the first XOR result of the first bit 1 in the initial data sequence is 1. The remaining 9 bits in the initial data sequence are XORed with the previous first XOR result, and the first XOR results of the remaining 9 bits in the initial data sequence are 1, 1, 0, 0, 1, 0, 0, 0, 1, respectively. Then, the first bit in the differential data sequence is determined to be bit 0, and then based on the first XOR results corresponding to each of the 10 bits in the initial data sequence, the differential data sequence is determined to be [01110010001].
[0065] For another example, see Figure 3b , the initial data sequence may be
[01101] , which includes 5 bits, and P = 6. The first XOR result of the first bit 0 in the initial data sequence is 0, and the first XOR results of the remaining 4 bits in the initial data sequence are 1, 0, 0, and 1 respectively. Then, the first bit in the differential data sequence is determined to be bit 0, and then based on the first XOR results corresponding to each of the 5 bits in the initial data sequence, the differential data sequence is determined to be [001001].
[0066] Exemplarily, the differential data sequence can be mapped to symbols based on the bit state transition information to obtain a symbol mapping sequence. In other words, the bits in the differential data sequence can be sequentially obtained as input bits, and the output symbol corresponding to each bit in the differential data sequence can be determined based on the input bit, the previous bit of the input bit, and the bit state transition information to obtain the symbol mapping sequence. As an example, please continue to refer to Figure 3b , by performing codeword mapping on the differential data sequence [001001] based on the preset bit state transition information, a codeword mapping sequence [-1 -1-1 1 1 1 -1-1 -1 11 1] can be obtained. The codeword mapping sequence can reflect the signal waveform or symbol waveform of the output codeword corresponding to each bit in the differential data sequence.
[0067] In the above implementation, a corresponding differential data sequence can be obtained by differentially encoding an initial data sequence, so that subsequent code type mapping is performed to obtain a codeword mapping sequence and the codeword mapping sequence is modulated by a subcarrier, thereby completing the encoding to obtain a coded sequence and transmitting the coded sequence to a receiver for decoding, which can reduce the problem of received data inversion at the receiver.
[0068] In some implementations, any codeword in the preset codeword state consists of two bits, the two bits in the first codeword are both bit 1, and the two bits in the second codeword are bit 1 and bit 0 respectively.
[0069] In this implementation, please continue to refer to Figure 2a Any codeword in the preset codeword state can have a corresponding codeword period T, and the codeword periods of the first codeword S1, the second codeword S2, the third codeword S3 and the fourth codeword S4 are the same.
[0070] Specifically, any codeword in the preset codeword state is composed of two bits, which may mean that the signal waveform of any codeword in the preset codeword state lasts for two pulse periods, or in other words, the signal waveform of any codeword in the preset codeword state includes two pulse waveforms. The two pulse periods lasted by the two pulse waveforms are equal to one codeword period, the pulse waveform in one pulse period corresponds to one bit, the amplitude of the pulse waveform in the pulse period is "1" corresponding to bit 1, and the amplitude of the pulse waveform in the pulse period is "-1" corresponding to bit 0. Exemplarily, the first codeword S1, the second codeword S2, the third codeword S3 and the fourth codeword S4 in the preset codeword state may be (1, 1), (1, -1), (-1, 1), (-1, -1), respectively. Among them, the first code element (1, 1) indicates that the amplitudes of the two pulse waveforms within the code element period T are both "1", the second code element (1, -1) indicates that the amplitudes of the two pulse waveforms within the code element period T are "1" and "-1" respectively, the third code element (-1, 1) indicates that the amplitudes of the two pulse waveforms within the code element period T are "-1" and "1" respectively, and the fourth code element (-1, -1) indicates that the amplitudes of the two pulse waveforms within the code element period T are both "-1".
[0071] In some implementations, the output symbols in the coding sequence have corresponding symbol periods, the subcarriers have corresponding subcarrier periods, and the symbol period is a specified integer multiple of the subcarrier period.
[0072] The symbol period may include a specified integer multiple of subcarrier periods.
[0073] Specifically, the subcarrier coefficient M of the subcarrier may be 2, 4 or 8. The subcarrier coefficient may refer to a division ratio of the subcarrier. It is understandable that the subcarrier coefficient M may be determined according to actual conditions.
[0074] Exemplarily, the specified integer multiple may be determined according to the subcarrier coefficient M. As an example, the specified integer multiple may be equal to the subcarrier coefficient. For example, the specified integer multiple may be 2, 4, or 8.
[0075] For example, see Figure 3cAfter the differential data sequence [001001] is determined based on the initial data sequence
[01101] , and the symbol mapping sequence [-1 -1-1 1 1 1 -1-1 -1 1 11] is determined based on the differential data sequence [001001], subcarrier modulation can be performed on the symbol mapping sequence based on a subcarrier or a subcarrier sequence with a subcarrier coefficient M=2 to obtain a subcarrier modulated coding sequence [1-1 1 -1 1 -1-1 1 -1 1 -1 1 -1 1 -1-1 1 -11 -1 1].
[0076] As an example, performing subcarrier modulation may refer to performing an XOR operation on the symbol mapping sequence and the subcarrier sequence to obtain a modulated coding sequence. Figure 3d , X1 represents the codeword mapping sequence, X2 represents the subcarrier sequence with the subcarrier coefficient M=2, and the modulated coding sequence can be xnor(X1, X2), where xnor(X1, X2) represents the result of the exclusive-OR operation between the codeword mapping sequence X1 and the subcarrier sequence X2, that is, the coding sequence of the subcarrier modulation.
[0077] This specification provides a decoding method for a backscatter communication system. Figure 4 , the decoding method can be applied to the receiver in the backscatter communication system, as shown in Figure 4 As shown, the decoding method may include the following steps.
[0078] Step S310: Obtain a sequence to be decoded and bit state transition information; wherein the sequence to be decoded includes multiple received code elements; the bit state transition information includes multiple state transition path branches, any state transition path branch includes a previous bit, an input bit and an output code element, the previous bit and the input bit are either bit 0 or bit 1 in a preset bit state, and the previous bit and the input bit are the same or different.
[0079] In some cases, the transmitter in the backscatter communication system is encoded in sequence through differential coding, symbol mapping and subcarrier modulation, wherein the symbol mapping is performed based on the bit state transition information. Therefore, after obtaining the sequence to be decoded, the receiver can decode based on the preset bit state transition information and the preset subcarrier to obtain an initial decoding sequence, and perform differential decoding on the initial decoding sequence to obtain the required differential decoding sequence.
[0080] Specifically, the receiver can receive the analog signal sent by the transmitter, perform analog-to-digital conversion on the received analog signals I and Q, respectively, convert them into digital signals, and perform phase rotation on the I digital signal and the Q digital signal to obtain a received signal, that is, a digital composite signal. After determining the received signal, the receiver can obtain a sequence to be decoded from the received signal.
[0081] Exemplarily, the receiver may be preset with bit state transition information, and the codewords in the preset codeword state in the bit state transition information have corresponding codeword periods. The sequence to be decoded may be a bit stream, and the received codewords in the sequence to be decoded are the bit streams grouped according to the codeword period. For example, the signal waveform of any codeword in the preset codeword state lasts for one codeword period or two pulse periods, or in other words, the signal waveform of any codeword in the preset codeword state includes two pulse waveforms, and the pulse waveform within one pulse period corresponds to one bit, that is, the received codewords are grouped in pairs in the sequence to be decoded.
[0082] Step S320: for any received symbol in the sequence to be decoded, determine the correlation value of the output symbol of each state transition path branch relative to the received symbol based on a preset subcarrier.
[0083] In some cases, please continue to see Figure 2b , since there is a mapping relationship or representation relationship between the input bit in the bit state transition information and the output codeword in the state transition path branch, and when the mapping relationship or representation relationship is satisfied, the output codeword corresponding to the input bit is determined by the previous bit. For example, when the input bit is bit 1, the input bit corresponds to S1 or S2. At this time, if the previous bit is bit 0, the output codeword is S1, and if the previous bit is bit 1, the output codeword is S2. Therefore, in order to decode each received codeword in the sequence to be decoded to obtain an initial decoding sequence, the input bit corresponding to each received codeword can be determined based on the output codeword, the previous bit and the input bit in each state transition path branch in the bit state transition information, and the input bits corresponding to each received codeword form an initial decoding sequence.
[0084] Specifically, for any received codeword in the sequence to be decoded, the correlation between the received codeword and the output codeword of each state transition path branch in the bit state transition information can be analyzed to obtain the correlation value between the received codeword and the output codeword of each state transition path branch. The correlation value can represent the similarity between the received codeword and the output codeword in the state transition path branch. Exemplarily, for any state transition path branch in the bit state transition information, the correlation value between the received codeword and the output codeword of the state transition path branch can be used as the real-time weight of the state transition path branch where the output codeword is located. As an example, since the received codeword is subcarrier modulated by the transmitter, when analyzing the correlation between the received codeword and the output codeword of the state transition path branch, the output codeword after subcarrier modulation and the received codeword can be subjected to correlation analysis after the output codeword is subjected to the same subcarrier modulation. In this way, subcarrier demodulation can be indirectly realized while performing correlation without the need for special subcarrier demodulation operation. That is to say, the correlation value obtained by the correlation analysis is subcarrier demodulated by a preset subcarrier.
[0085] Step S330: Based on the previous bit corresponding to the received codeword, the correlation value of each output codeword relative to the received codeword, and the bit state transition information, determine the input bit corresponding to the received codeword to obtain an initial decoding sequence; wherein the previous bit corresponding to the received codeword is the input bit corresponding to the previous codeword of the received codeword; the initial decoding sequence includes the input bit corresponding to each received codeword.
[0086] For example, please refer to Figure 2bIn the bit state transition information, when the input bit is bit 0 or bit 1, it may be jumped from two possible state transition path branches, and the previous bit of one of the two possible state transition path branches is bit 0, and the previous bit of the other is bit 1. Therefore, when decoding any received codeword in the sequence to be decoded, the cumulative weight of the input bit can be determined based on the cumulative weight of the previous bit and the real-time weight of each state transition path branch, and the bit state of the input bit is determined according to the cumulative weight of the input bit. Among them, the previous bit can refer to the input bit of the previous received codeword of the received codeword, and the cumulative weight of the input bit can include the corresponding cumulative weight when the input bit is bit 0 and the corresponding cumulative weight when the input bit is bit 1. Determining the bit state of the input bit according to the cumulative weight of the input bit may refer to comparing the cumulative weight corresponding to the input bit being bit 0 and the cumulative weight corresponding to the input bit being bit 1, using the state transition path branch corresponding to the larger cumulative weight as the optimal path branch of the received codeword, and determining the input bit of the received codeword based on the input bit of the optimal path branch. In this way, based on the input bits corresponding to each of the multiple received codewords in the sequence to be decoded, an initial decoding sequence may be obtained.
[0087] Step S340: performing differential decoding on the initial decoding sequence to obtain a differential decoding sequence.
[0088] In the above implementation, by obtaining a sequence to be decoded, for any received codeword in the sequence to be decoded, the correlation value of the output codeword of each state transition path branch relative to the received codeword is determined, and then, based on the previous bit corresponding to the received codeword, the correlation value of each output codeword relative to the received codeword and the bit state transition information, the input bit corresponding to the received codeword is determined to obtain an initial decoding sequence, and then, the initial decoding sequence is differentially decoded to obtain a differential decoding sequence, so that the decoding success rate can be improved; compared with the maximum likelihood demodulation method of Miller code, the decoding sensitivity can be improved by 2 to 3 dB, and compared with the Viterbi decoding method of Miller code, the decoding sensitivity can be improved by 1 to 2 dB; compared with the Viterbi decoding method, the number of state nodes for decoding is less, and storage resources can be saved under the condition of the same performance.
[0089] In some implementations, the received symbols in the sequence to be decoded may be a target sampling sequence.
[0090] In this implementation, obtaining the sequence to be decoded may include the following steps S410-S420.
[0091] Step S410: oversampling the received signal at multiple time instants based on a sampling window to obtain a target sampling sequence at each time instant; wherein the length of the sampling window is equal to the symbol period of the symbol in the preset symbol state.
[0092] Specifically, the received signal may be oversampled in a sliding manner at multiple time instants based on a sampling window to obtain respective target sampling sequences at multiple time instants.
[0093] Step S420: determining a sequence to be decoded based on respective target sampling sequences at multiple time instants; wherein the multiple target sampling sequences in the sequence to be decoded correspond to the multiple time instants one-to-one.
[0094] In the above implementation, the received signal is oversampled at multiple times based on the sampling window to obtain target sampling sequences at multiple times, and then the corresponding received codewords are determined based on the target sampling sequence. In this way, the sequence to be decoded can be obtained from the received signal.
[0095] In some embodiments, the correlation value between any received codeword and the output codeword of each state transition path branch is calculated, that is, the correlation value between the received codeword and each codeword in the preset codeword state is calculated, please continue to refer to Figure 2a , since the first codeword and the fourth codeword are inverted in the preset codeword state, and the second codeword and the third codeword are inverted in the preset codeword state. Therefore, in order to calculate the correlation value between any received codeword and the output codeword of each state transition path branch, only the correlation value of the received codeword and the two designated codewords in the preset codeword state can be calculated, and the correlation value of the received codeword and the two non-designated codewords in the preset codeword state can be determined based on the correlation value of the received codeword and the two designated codewords. Among them, the two designated codewords are two codewords that are not inverted in the preset codeword state. For example, the two designated codewords can be the first codeword and the second codeword, or can be the first codeword and the third codeword, or can be the third codeword and the fourth codeword, or can be the second codeword and the fourth codeword.
[0096] In some cases, at least some of the symbols in the preset symbol state each correspond to a local sequence for calculating the correlation value, wherein the at least some of the symbols include at least two designated symbols.
[0097] Specifically, the correlation value of the output codeword of the state transition path branch relative to the received codeword may be the correlation value of the local sequence corresponding to the output codeword relative to the target sampling sequence of the received codeword.
[0098] Specifically, any symbol in the preset symbol state in the receiver may correspond to a local sequence, and the local sequence may be obtained by performing subcarrier modulation on the symbol and then oversampling, and the oversampling multiple is the same as the oversampling multiple when the initial sampling sequence or the target sampling sequence is obtained. In this way, when correlating the local sequence and the target sampling sequence to determine the correlation value, there is no need to perform special subcarrier demodulation.
[0099] In this implementation, oversampling the received signal at multiple time instants based on the sampling window to obtain a target sampling sequence corresponding to each time instant may include the following steps S510-S530.
[0100] Step S510: at a current moment among the multiple moments, based on a starting sampling point and a sampling window at the current moment, a plurality of initial sampling sequences at the current moment are acquired from a received signal; wherein the plurality of initial sampling sequences include at least one pre-offset sequence, a non-offset sequence and at least one post-offset sequence.
[0101] In some cases, in order to reduce the cumulative error of the received data due to frequency jitter, the received signal can be offset by 0 to N sampling points to obtain 2N+1 initial sampling sequences. N is a positive integer. Specifically, the offset can be performed based on the position of the initial sampling point.
[0102] Exemplarily, the forward offset sequence, the non-offset sequence, and the backward offset sequence represent initial sampling sequences in which the first sampling point is offset forward, not offset, and offset backward relative to the starting sampling point, respectively.
[0103] As another example, a non-offset sequence may refer to an initial sampling sequence that is determined based on a starting sampling point and is not offset, a front-offset sampling sequence may refer to an initial sampling sequence that is offset forward relative to the non-offset sequence, and a rear-offset sampling sequence may refer to an initial sampling sequence that is offset backward relative to the non-offset sequence.
[0104] Specifically, see Figure 5 At the current moment among the multiple moments, when N is 2, 5 initial sampling sequences D can be obtained by offsetting 2 sampling points before and after the position n of the initial sampling point. -2 , D -1 , D0, D1, D2, where D0 means no offset sequence, D -2 represents the forward offset sequence of 2 sampling points, D -1 represents the forward offset sequence that is offset by 1 sampling point, D1 represents the backward offset sequence that is offset by 1 sampling point, and D2 represents the backward offset sequence that is offset by 2 sampling points. Where m represents the number of sample points in the sequence, that is, it can represent the number of sampling points in the initial sampling sequence.
[0105] Step S520: Correlate each of the multiple initial sampling sequences with the local sequences corresponding to at least part of the codewords in the preset codeword state to obtain multiple correlation values; wherein the multiple correlation values include the correlation value between each of the multiple initial sampling sequences at the current moment and each codeword in the preset codeword state.
[0106] Among them, at least part of the symbols corresponding to the local sequence in the preset symbol state may include at least two designated symbols. That is, at least two designated symbols in the preset symbol state each correspond to a local sequence, and two non-designated symbols in the preset symbol state correspond to the local sequence, or do not correspond to the local sequence.
[0107] Exemplarily, at least part of the symbols corresponding to the local sequence may include a first symbol and a second symbol. Then, for any of the multiple initial sampling sequences, in order to determine the correlation value between the initial sampling sequence and each symbol in the preset symbol state, the correlation value between the initial sampling sequence and the first symbol may be determined based on the local sequence corresponding to the initial sampling sequence and the first symbol, and the correlation value between the initial sampling sequence and the second symbol may be determined based on the local sequence corresponding to the initial sampling sequence and the second symbol. Since the first symbol is inversely proportional to the fourth symbol, and the second symbol is inversely proportional to the third symbol, the correlation value between the initial sampling sequence and the fourth symbol may be determined directly based on the correlation value between the initial sampling sequence and the first symbol, and the correlation value between the initial sampling sequence and the third symbol may be determined directly based on the correlation value between the initial sampling sequence and the second symbol, so that the correlation value between the initial sampling sequence and each symbol in the preset symbol state may be determined. Then, the multiple initial sampling sequences obtained may be traversed to determine the correlation value between each initial sampling sequence and each symbol in the preset symbol state.
[0108] Step S530: Use the initial sampling sequence corresponding to the maximum of the multiple correlation values as the target sampling sequence corresponding to the current moment, and determine the starting sampling point of the next moment based on the target sampling sequence corresponding to the current moment, so as to obtain the target sampling sequence corresponding to the next moment based on the starting sampling point of the next moment, until the oversampling of the received signal is completed.
[0109] For example, please refer to Figure 5 Assuming that the target sampling sequence determined at the current moment is D0, and the starting sampling point of the target sampling sequence D0 is n, then based on the target sampling sequence D0 at the current moment, the position of the starting sampling point at the next moment can be determined to be n+m.
[0110] In the above implementation, the received signal at a certain moment is sampled by shifting it forward and backward respectively, to obtain oversampled waveforms of multiple initial sampling sequences, and correlated with the oversampled waveforms of the local sequence of each codeword in the local preset codeword state respectively, and the initial sampling sequence corresponding to the maximum correlation value is used as the target sampling sequence. In this way, the target sampling sequence can be determined as the best sampling sequence or the best sampling point at that moment, so that the received codeword can be determined based on the target sampling sequence later, and thus the accumulated error caused by frequency jitter in the reception can be reduced.
[0111] Moreover, in the process of determining the target sampling sequence, the correlation value between the target sampling sequence and each code element in the preset code element state is also determined, that is, the correlation value between the received code element corresponding to the target sampling sequence and each code element in the preset code element state is determined, so that it is convenient to subsequently determine the real-time weight of any state transition path branch at the time corresponding to the received code element. In this way, the influence of the received data frequency jitter is reduced when determining the real-time weight of the state transition path branch, and the stability of the receiver in the frequency deviation scenario is improved.
[0112] In some implementations, any initial sampling sequence may include multiple sampling points, and the number of sequence sampling points in each initial sampling sequence is equal.
[0113] Any local sequence may include multiple local sampling points, and the number of sequence sample points of each local sequence is equal. The number of sequence sample points of the initial sampling sequence is equal to the number of sequence sample points of the local sequence.
[0114] In this embodiment, the correlation value can be determined by Formula 1.
[0115]
[0116] Wherein, j∈{-N,…,-2,-1,0,1,2,…,N}, N is a positive integer, j represents the number of forward and backward offsets of the initial sampling sequence. k∈{1,2,3,4}, k represents any one of the first, second, third and fourth symbols in the preset symbol state, C(j,k) represents the correlation value between symbol k and the initial sampling sequence with the number of forward and backward offsets j; n represents the position of the starting sampling point, m represents the number of sequence sample points, d j represents the initial sampling sequence with j front and back offsets, S k Represents the local sequence corresponding to symbol k in the preset symbol state.
[0117] Exemplarily, N can be 2, and the forward and backward offset numbers of the initial sampling sequence are respectively -2, -1, 0, 1, and 2. Another exemplary case is that N can be 1, and the forward and backward offset numbers of the initial sampling sequence are respectively -1, 0, and 1.
[0118] Exemplarily, k=1 represents the first codeword, k=2 represents the second codeword, k=3 represents the third codeword, and k=4 represents the fourth codeword.
[0119] For example, S k The number of sequence samples in is equal to d j The number of sequence samples in .
[0120] In some implementations, the multiple received code elements in the sequence to be decoded are determined according to the target sampling sequence at multiple time instants, that is, the multiple received code elements correspond to the multiple time instants one-to-one.
[0121] In this embodiment, based on the previous bit corresponding to the received codeword, the correlation value of each output codeword relative to the received codeword, and the bit state transition information, the input bit corresponding to the received codeword is determined to obtain the initial decoding sequence, which may include the following steps S610-S640.
[0122] Step S610: sequentially taking a moment among the multiple moments as the current moment, and determining the real-time weight of each of the multiple state transition path branches at the current moment according to the bit state transition information; wherein the real-time weight of the state transition path branch at the current moment is a correlation value of the output codeword of the state transition path branch at the current moment relative to the received codeword at the current moment.
[0123] Among them, taking the moments in the multiple moments as the current moment in sequence means processing in chronological order, that is, the current moment can refer to the latest moment, rather than having to first determine the respective target sampling sequences at the multiple moments and then select one from the multiple moments as the current moment.
[0124] In some cases, see Figure 6 , in the bit state transition information, the preceding bit is any one of bit 0 or bit 1 in the preset bit state, represented by B0 and B1 respectively, the input bit of the state transition path branch represented by the dotted line is bit 0, and the input bit of the state transition path branch represented by the solid line is bit 1. Since the first codeword S1, the second codeword S2, the third codeword S3 and the fourth codeword S4 in the preset codeword state are (1, 1), (1, -1), (-1, 1), (-1, -1) respectively, the output codewords of the four state transition path branches in the bit state transition information are all codewords in the preset codeword state, therefore, the output codewords of the four state transition path branches can be O(1, 1), O(1, -1), O(-1, 1), O(-1, -1) respectively. In addition, at the current moment, it can be determined that there is a correlation value between the received codeword at the current moment and each codeword in the preset codeword state.
[0125] Therefore, at the current moment, based on the correlation value between the received codeword and each codeword in the preset codeword state, the correlation value between the received codeword and the output codeword of each state transition path branch can be directly obtained, and the correlation value between the received codeword and the output codeword of each state transition path branch can be used as the real-time weight of each state transition path branch at the current moment.
[0126] Step S620: Determine the cumulative weight of each bit in the preset bit state at the current moment according to the real-time weights of the multiple state transition path branches at the current moment and the cumulative weight of each bit in the preset bit state at the previous moment.
[0127] For example, please refer to Figure 6 , the cumulative weights of B0 and B1 at the current moment can be determined based on the real-time weights of the state transition path branches O(1,1), O(1,-1), O(-1,1), and O(-1,-1) and the cumulative weights of B0 and B1 at the previous moment.
[0128] Step S630: Determine the bit path table at the current moment based on the accumulated weight of each bit in the preset bit state at the current moment.
[0129] For example, please refer to Figure 6 , the optimal path branch of B0 at the current moment can be determined based on the accumulated weight of B0 at the current moment, and the bit path table of B0 at the current moment can be determined based on the optimal path branch. Similarly, the optimal path branch of B1 at the current moment can be determined based on the accumulated weight of B1 at the current moment, and the bit path table of B1 at the current moment can be determined based on the optimal path branch. Then, based on the accumulated weights of B0 and B1 at the current moment, the bit path table corresponding to the one with the larger accumulated weight can be used as the bit path table at the current moment.
[0130] Step S640: Determine an initial decoding sequence based on the bit path table at the current moment.
[0131] In the above implementation, the cumulative weight of each bit state at the current moment is determined based on the real-time weight of each state transition path branch at the current moment and the cumulative weight of each bit state at the previous moment, so that the optimal path branch for each bit state at the current moment can be determined, and the bit path table at the current moment can be determined based on the optimal path branch at the current moment, and then decoding can be achieved according to the bit path table. In this way, the decoding success rate of the receiver can be improved.
[0132] In some embodiments, the plurality of state transition path branches may include a first path branch, a second path branch, a third path branch, and a fourth path branch. The output code elements of the first path branch, the second path branch, the third path branch, and the fourth path branch are respectively the first code element O(1,1), the second code element O(1,-1), the third code element O(-1,1), and the fourth code element O(-1,-1). The preceding bits of the first path branch and the third path branch are the preceding first bit, the preceding bits of the second path branch and the fourth path branch are the preceding second bit, the input bits of the third path branch and the fourth path branch are the current first bit, and the input bits of the first path branch and the second path branch are the current second bit.
[0133] Among them, the previous first bit may refer to the previous bit being bit 0 in the preset bit state, the previous second bit may refer to the previous bit being bit 1 in the preset bit state, the current first bit may refer to the input bit being bit 0 in the preset bit state, and the current second bit may refer to the input bit being bit 1 in the preset bit state. In other words, the previous first bit and the previous second bit are bit 0 and bit 1 in the preset bit state at the previous moment, respectively, and the current first bit and the current second bit are bit 0 and bit 1 in the preset bit state at the current moment, respectively.
[0134] The real-time weights of the first path branch, the second path branch, the third path branch, and the fourth path branch can be recorded as the first real-time weight, the second real-time weight, the third real-time weight, and the fourth real-time weight, respectively.
[0135] In this embodiment, the cumulative weight of each bit in the preset bit state at the current moment is determined based on the real-time weights of each of the multiple state transition path branches at the current moment and the cumulative weight of each bit in the preset bit state at the previous moment, which can include the following steps S710-S740.
[0136] Step S710: Determine the first sum between the first cumulative weight of the previous item and the third real-time weight at the current moment, and the second sum between the second cumulative weight of the previous item and the fourth real-time weight at the current moment; wherein the first cumulative weight of the previous item is the cumulative weight of the first bit of the previous item, and the second cumulative weight of the previous item is the cumulative weight of the second bit of the previous item.
[0137] Step S720: taking the larger one of the first sum and the second sum as the current first cumulative weight; wherein the current first cumulative weight is the cumulative weight of the current first bit.
[0138] For example, see Figure 7, take the nth moment as the current moment as an example, and the n-1th moment is the moment before the current moment. B0(n-1) represents the first bit of the previous item, B1(n-1) represents the second bit of the previous item, B0(n) represents the current first bit, and B1(n) represents the current second bit. n (S1) represents the first real-time weight of the first path branch of O(1,1), C n (S2) represents the second real-time weight of the second path branch where O(1,-1) is located, C n (S3) represents the third real-time weight of the third path branch where O(-1,1) is located, C n (S4) represents the fourth real-time weight of the fourth path branch where O(-1,-1) is located. The first cumulative weight of the first bit B0(n-1) of the previous item is recorded as L0(n-1), the second cumulative weight of the second bit B1(n-1) of the previous item is recorded as L1(n-1), the current first cumulative weight of the current first bit B0(n) is recorded as L0(n), and the current second cumulative weight of the current second bit B1(n) is recorded as L1(n).
[0139] Exemplarily, the current first cumulative weight can be determined by Formula 2.
[0140] L0(n)=max(L0(n-1)+C n (S3), L1(n-1)+C n (S4)) Formula 2
[0141] Among them, L0(n-1)+C n (S3) is the first sum, L1(n-1)+C n (S4) is the second sum value.
[0142] Step S730: Determine a third sum between the first cumulative weight of the previous item and the first real-time weight at the current moment, and a fourth sum between the second cumulative weight of the previous item and the second real-time weight at the current moment.
[0143] Step S740: taking the larger one of the third sum and the fourth sum as the current second accumulated weight; wherein the current second accumulated weight is the accumulated weight of the current second bit.
[0144] Exemplarily, the current second accumulated weight may be determined by Formula 3.
[0145] L1(n)=max(L0(n-1)+C n (S1), L1(n-1)+C n (S2)) Formula 3
[0146] Among them, L0(n-1)+C n(S1) is the third sum, L1(n-1)+C n (S2) is the fourth sum value.
[0147] Similarly, the n+1th moment can be regarded as the current moment, and the nth moment can be regarded as the moment before the current moment, so as to determine the cumulative weight L0(n+1) of B0(n+1) and the cumulative weight L1(n+1) of B1(n+1) at the n+1th moment. In this way, the cumulative weight of the bit state at each moment in multiple moments can be determined.
[0148] Exemplarily, for B0 at the current moment, the input bits of its corresponding two state transition path branches are both bit 0, and for B1 at the current moment, the input bits of its corresponding two state transition path branches are both bit 1. That is to say, while calculating the cumulative weights of B0 and B1 at the current moment, the input bits of the optimal path branches of B0 and B1 at the current moment are also obtained. Therefore, the bit path table of B0 or B1 at the current moment can be determined based on the bit path table at the previous moment and the input bits of the optimal path branch.
[0149] In some implementations, determining the bit path table at the current moment based on the accumulated weight of each bit in the preset bit state at the current moment may include the following steps S810-S850.
[0150] Step S810: When the current first cumulative weight is the first sum value, determine the current first path table according to the previous first path table and the current first bit; wherein the previous first path table is the bit path table corresponding to the previous first bit, and the current first path table is the bit path table corresponding to the current first bit.
[0151] In some cases, a bit path table can be used to store the input bits for back-decoding. Figure 8 , continue to take the nth moment as the current moment as an example, and the n-1th moment is the moment before the current moment. The first bit B0(n-1) of the previous item and the second bit B1(n-1) of the previous item can both be determined to have corresponding bit path tables. Among them, the bit path table corresponding to the first bit B0(n-1) of the previous item is recorded as the first path table of the previous item, and the bit path table corresponding to the second bit B1(n-1) of the previous item is recorded as the second path table of the previous item. Exemplarily, the first path table of the previous item can be [X1 X2…X n-1 ], the second path table of the previous item can be [Y1 Y2…Y n-1 ].
[0152] For example, please refer to Figure 7 , Figure 8And formula 2, the current first cumulative weight L0(n) is the first sum L0(n-1)+C n In the case of (S3), it means L0(n-1)+C n (S3)>L1(n-1)+C n (S4), namely the first sum L0(n-1)+C n (S3) is greater than the second sum L1(n-1)+C n (S4), then according to the first path table [X1X2…X n-1 ] and the current first bit B0(n), determine that the current first path table corresponding to the current first bit B0(n) is [X1 X2…X n-1 0].
[0153] Step S820: When the current first cumulative weight is the second sum value, determine the current first path table according to the previous second path table and the current first bit; wherein the previous second path table is the bit path table corresponding to the previous second bit.
[0154] For example, please refer to Figure 7 , Figure 8 And formula 2, the current first cumulative weight L0(n) is the second sum L1(n-1)+C n In the case of (S4), it means L0(n-1)+C n (S3)<L1(n-1)+C n (S4), namely the first sum L0(n-1)+C n (S3) is less than the second sum L1(n-1)+C n (S4), then according to the previous second path table [Y1Y2…Y n-1 ] and the current first bit B0(n), determine that the current first path table corresponding to the current first bit B0(n) is [Y1 Y2…Y n-1 0].
[0155] Step S830: When the current second cumulative weight is the third sum, determine the current second path table according to the previous first path table and the current second bit; wherein the current second path table is the bit path table corresponding to the current second bit.
[0156] For example, please refer to Figure 7 , Figure 8 And formula 3, the current second cumulative weight L1(n) is the third sum L0(n-1)+C n In the case of (S1), it means L0(n-1)+C n (S1)>L1(n-1)+Cn (S2), that is, the third sum L0(n-1)+C n (S1) is greater than the fourth sum L1(n-1)+C n (S2), then according to the first path table [X1X2…X n-1 ] and the current second bit B1(n), determine that the current second path table corresponding to the current second bit B1(n) is [X1 X2…X n-1 1].
[0157] Step S840: when the current second accumulated weight is the fourth sum value, determine the current second path table according to the previous second path table and the current second bit.
[0158] For example, please refer to Figure 7 , Figure 8 And formula 3, the current second cumulative weight L1(n) is the fourth sum L0(n-1)+C n In the case of (S2), it means L0(n-1)+C n (S1)<L1(n-1)+C n (S2), that is, the third sum L0(n-1)+C n (S1) is less than the fourth sum L1(n-1)+C n (S2), then according to the previous second path table [Y1Y2…Y n-1 ] and the current second bit B1(n), determine that the current second path table corresponding to the current second bit B1(n) is [Y1 Y2…Y n-1 1].
[0159] Step S850: according to the current first cumulative weight and the current second cumulative weight, one of the current first path table and the current second path table is used as the bit path table at the current moment.
[0160] Exemplarily, the current first cumulative weight L0(n) and the current second cumulative weight L1(n) can be compared, and the path table corresponding to the larger cumulative weight is used as the bit path table at the current moment. For example, if L0(n)>L1(n), the current first path table is used as the bit path table at the current moment, and if L0(n)<L1(n), the current second path table is used as the bit path table at the current moment.
[0161] Among them, the bit path table at the current moment may be a bit path table used for backtracking decoding at the current moment.
[0162] In some implementations, determining the initial decoding sequence based on the bit path table at the current moment may include: determining the initial decoding sequence according to the backtracking depth and the bit path table at the current moment.
[0163] Among them, the backtracking depth is greater than or equal to 1.
[0164] In some cases, the decoding delay depends on the size of the backtracking depth. The smaller the backtracking depth, the smaller the decoding delay.
[0165] Exemplarily, the traceback depth may be set to 1, that is, at the nth time, if L0(n)>L1(n), the n-1th bit in the bit path table of B0(n) at the nth time is output.
[0166] In the above implementation, the minimum backtracking depth can be set to 1. The small backtracking depth and short decoding delay can achieve a relatively ideal decoding effect without increasing the decoding delay, thereby improving the decoding sensitivity and decoding performance of the receiver.
[0167] In some implementations, the initial decoding sequence may include P input bits, and the differential decoding sequence may include P-1 input bits, where P is an integer greater than or equal to 2.
[0168] In this implementation, differential decoding is performed on the initial decoding sequence to obtain a differential decoding sequence, which may include the following steps S910-S920.
[0169] Step S910: sequentially obtain the first P-1 input bits in the initial decoding sequence as the current bit, perform an XOR operation on the current bit and the bit following the current bit in the initial decoding sequence, and obtain a second XOR operation result corresponding to the current bit in the initial decoding sequence.
[0170] In some cases, the transmitter can first perform an XOR operation to achieve differential encoding, and then perform codeword mapping encoding based on the bit state transition information. Therefore, after obtaining the initial decoding sequence based on the bit state transition information, the initial decoding sequence can be differentially decoded to obtain the final differential decoding sequence.
[0171] Step S920: Determine a differential decoding sequence according to P-1 second XOR operation results.
[0172] Exemplarily, assuming that the initial decoding sequence is [001001], the differential decoding sequence after differential decoding is
[01101] .
[0173] This specification provides a decoding method for a backscatter communication system. Fig. 9 , the decoding method can be applied to the receiver in the backscatter communication system, as shown in Fig. 9As shown, the decoding method may include the following steps S1010-S1070.
[0174] Step S1010: receiving data.
[0175] Specifically, the receiver can receive data sent by the transmitter, that is, receive analog signals.
[0176] Step S1020: analog-to-digital conversion signal synthesis.
[0177] Specifically, the receiver can perform analog-to-digital conversion on the received analog signals I and Q, respectively, to convert them into digital signals, and perform phase rotation on the I digital signal and the Q digital signal to obtain a received signal, namely a digital synthesized signal.
[0178] Step S1030: Calculate real-time weights.
[0179] Specifically, based on the starting sampling point at the current moment, multiple initial sampling sequences at the current moment can be obtained from the received signal; wherein the multiple initial sampling sequences include at least one pre-shifted sequence, a non-shifted sequence, and at least one post-shifted sequence; each initial sampling sequence is correlated with the local sequence of the first code element S1 and the local sequence of the second code element S2, respectively, to obtain the correlation value of each initial sampling sequence with the first code element S1 and the second code element S2, and the correlation value of each initial sampling sequence with the third code element S3 and the fourth code element S4 is determined by using the characteristics that the first code element S1 is inversely proportional to the fourth code element S4, and the second code element S2 is inversely proportional to the third code element S3. The initial sampling sequence corresponding to the maximum of the correlation values of the multiple initial sampling sequences with S1, S2, S3, and S4 is used as the target sampling sequence at the current moment, and the received code element is determined based on the target sampling sequence. At the same time, the starting sampling point of the next moment can be determined based on the target sampling sequence, so as to obtain the target sampling sequence of the next moment based on the starting sampling point of the next moment, until the oversampling of the received signal ends.
[0180] Exemplarily, the correlation value may be determined by Formula 1.
[0181] For example, assuming that the number of oversampling points of each pulse waveform symbol is 4, the local sequences corresponding to the first codeword S1 and the second codeword S2 in the preset codeword state can be: S1 = [1 1 1 1 1 1 1 1], S2 = [1 1 1 1 -1-1 -1-1], and the received signal is offset by 0-N sampling points forward and backward respectively. When N = 1, 3 initial sampling sequences are obtained, and the 3 initial sampling sequences include 1 front offset sequence, 1 non-offset sequence and 1 back offset sequence. Based on the local sequence of S1 and the local sequence of S2, the correlation values of the 3 initial sampling sequences with S1 and S2 are calculated, and the initial sampling sequence corresponding to the maximum correlation value is taken as the optimal sampling sequence, that is, the target sampling sequence is obtained, and the correlation values of the target sampling sequence with S1, S2, S3, and S4 are used as the real-time weights of each state transition path branch.
[0182] Step S1040: Calculate the cumulative weight.
[0183] Specifically, a moment among the multiple moments is sequentially taken as the current moment, and the real-time weight of each of the multiple state transition path branches at the current moment is determined according to the bit state transition information; wherein the real-time weight of the state transition path branch at the current moment is a correlation value between an output codeword of the state transition path branch at the current moment and a received codeword at the current moment;
[0184] Specifically, the cumulative weight of each bit in the preset bit state at the current moment can be determined by performing a cumulative calculation based on the real-time weight of each state transition path branch at the current moment and the cumulative weight of each bit in the preset bit state at the previous moment. The bits in the preset bit state include B0(n) and B1(n). For example, for B0(n) at the current moment, the two state transition path branches corresponding to it are the third path branch where O(-1,1) is located and the fourth path branch where O(-1,-1) is located. The cumulative weight of B0(n-1) at the previous moment and the real-time weight of the third path branch where O(-1,1) are cumulatively calculated, and the cumulative weight of B1(n-1) at the previous moment and the real-time weight of the fourth path branch where O(-1,-1) are cumulatively calculated, and the two cumulative calculation results are compared, and the larger of the two cumulative calculation results is used as the cumulative weight of B0(n) at the current moment. Similarly, for B1(n) at the current moment, its corresponding two state transition path branches are the first path branch where O(1,1) is located and the second path branch where O(1,-1) is located. The cumulative weight of B0(n-1) at the previous moment and the real-time weight of the first path branch where O(1,1) is located are cumulatively calculated, and the cumulative weight of B1(n-1) at the previous moment and the real-time weight of the second path branch where O(1,-1) is located are cumulatively calculated. The two cumulative calculation results are compared, and the larger of the two cumulative calculation results is used as the cumulative weight of B1(n) at the current moment, and the bit path table corresponding to the larger cumulative calculation result is stored.
[0185] Step S1050: store the path table.
[0186] Exemplarily, for B0(n) at the current moment, the corresponding input bits of the first path branch where O(1,1) is located and the second path branch where O(1,-1) is located are both bit 0, and for B1(n) at the current moment, the corresponding input bits of the first path branch where O(1,1) is located and the second path branch where O(1,-1) is located are both bit 1. Therefore, while recording the cumulative weight of B0(n) or B1(n) at the current moment, the input bits of the optimal path branch of B0(n) or B1(n) at the current moment are also determined, so that the bit path table of B0(n) or B1(n) at the current moment can be determined according to the input bits of the optimal path branch of B0(n) or B1(n) at the current moment.
[0187] Step S1060: Backtracking decoding.
[0188] Exemplarily, after determining the bit path table of B0(n) or B1(n) at the current moment, the bit path table corresponding to the one with the larger cumulative weight can be back-traced and output according to the cumulative weights of B0(n) and B1(n) at the current moment to obtain an initial decoding sequence.
[0189] Step S1070: differential decoding.
[0190] Specifically, the initial decoding sequence obtained by back-tracing decoding may be differentially decoded to obtain a differential decoding sequence.
[0191] The embodiments of this specification provide a coding device for a backscatter communication system, which is applied to a transmitter of the backscatter communication system. Fig.10 , the encoding device may include a first acquisition module 1010, a differential encoding module 1020, a codeword mapping module 1030 and a subcarrier modulation module 1040.
[0192] The first acquisition module 1010 is used to acquire an initial data sequence and bit state transition information; wherein the bit state transition information includes multiple state transition path branches, any state transition path branch includes a previous bit, an input bit and an output symbol, the previous bit and the input bit are either bit 0 or bit 1 in a preset bit state, and the previous bit and the input bit are the same or different;
[0193] The differential encoding module 1020 is used to perform differential encoding on the initial data sequence to obtain a differential data sequence; wherein the differential data sequence includes a plurality of bits, and any bit in the differential data sequence is bit 0 or bit 1;
[0194] A symbol mapping module 1030 is used to sequentially obtain bits in the differential data sequence as input bits, and determine output symbols corresponding to the input bits according to the input bits, the preceding bits of the input bits, and the bit state transition information;
[0195] The subcarrier modulation module 1040 is used to perform subcarrier modulation on each output symbol based on a preset subcarrier to obtain a coding sequence.
[0196] In some embodiments, the output codeword is one of the first codeword, the second codeword, the third codeword and the fourth codeword in a preset codeword state, the first codeword is inverted with the fourth codeword, and the second codeword is inverted with the third codeword; the codeword mapping module 1030 is also used to: when the previous bit is bit 0, if the input bit is bit 0, use the third codeword as the output codeword corresponding to the input bit according to the bit state transition information, and if the input bit is bit 1, use the first codeword as the output codeword corresponding to the input bit according to the bit state transition information; when the previous bit is bit 1, if the input bit is bit 0, use the fourth codeword as the output codeword corresponding to the input bit according to the bit state transition information, and if the input bit is bit 1, use the second codeword as the output codeword corresponding to the input bit according to the bit state transition information.
[0197] In some embodiments, the initial data sequence includes P-1 bits, and the differential data sequence includes P bits, where P is an integer greater than or equal to 2; the differential encoding module 1020 is also used to: sequentially obtain P-1 bits in the initial data sequence as the current bit, if the current bit in the initial data sequence is the first bit in the initial data sequence, perform an XOR operation on the current bit in the initial data sequence and bit 0 to obtain a corresponding first XOR operation result; if the current bit in the initial data sequence is not the first bit in the initial data sequence, perform an XOR operation on the current bit in the initial data sequence and a previous first XOR operation result to obtain a corresponding first XOR operation result; use bit 0 as the first bit in the differential data sequence, and determine the P-1 bits after the first bit in the differential data sequence based on the P-1 first XOR operation results.
[0198] The embodiments of this specification provide a decoding device for a backscatter communication system, which is applied to a receiver of the backscatter communication system. Fig.11 The decoding device may include a second acquisition module 1110, a correlation module 1120, an initial decoding module 1130 and a differential decoding module 1140.
[0199] The second acquisition module 1110 is used to acquire a sequence to be decoded and bit state transition information; wherein the sequence to be decoded includes multiple received code elements; the bit state transition information includes multiple state transition path branches, any state transition path branch includes a previous bit, an input bit and an output code element, the previous bit and the input bit are any one of bit 0 and bit 1 in a preset bit state, and the previous bit and the input bit are the same or different;
[0200] A correlation module 1120, configured to determine, for any received symbol in the sequence to be decoded, a correlation value of an output symbol of each state transition path branch relative to the received symbol based on a preset subcarrier;
[0201] The initial decoding module 1130 is used to determine the input bit corresponding to the received codeword based on the previous bit corresponding to the received codeword, the correlation value of each output codeword relative to the received codeword, and the bit state transition information, and obtain an initial decoding sequence; wherein the previous bit corresponding to the received codeword is the input bit corresponding to the previous codeword of the received codeword; the initial decoding sequence includes the input bit corresponding to each received codeword;
[0202] The differential decoding module 1140 is used to perform differential decoding on the initial decoding sequence to obtain a differential decoding sequence.
[0203] In some embodiments, the received codewords in the sequence to be decoded are the target sampling sequence; the second acquisition module 1110 is further used to: oversample the received signal at multiple time moments based on the sampling window to obtain the target sampling sequence at each time moment; wherein the length of the sampling window is equal to the codeword period of the codeword in the preset codeword state; determine the sequence to be decoded based on the respective target sampling sequences at multiple time moments; wherein the multiple target sampling sequences in the sequence to be decoded correspond one-to-one to the multiple time moments.
[0204] In some embodiments, the output codeword is one of the first codeword, the second codeword, the third codeword and the fourth codeword in the preset codeword state, any codeword in the preset codeword state is composed of two bits, the first codeword is inverted with the fourth codeword, and the second codeword is inverted with the third codeword; the two bits of the first codeword are both bit 1, and the two bits of the second codeword are bit 1 and bit 0 respectively; the two designated codewords in the preset codeword state each correspond to a local sequence, and the two designated codewords are two codewords that are not inverted in the preset codeword state; the second acquisition module 1110 also includes an oversampling module and an optimal sampling determination module; the oversampling module is used to obtain multiple initial sampling sequences at the current moment from the received signal based on the starting sampling point and the sampling window at the current moment at the current moment among the multiple moments; wherein the multiple initial sampling sequences include at least one pre-shifted sequence, a non-shifted sequence and at least one post-shifted sequence, the pre-shifted sequence The shifted sampling sequence, the non-shifted sampling sequence and the post-shifted sampling sequence respectively represent initial sampling sequences in which the first sampling point is shifted forward, not shifted and shifted backward relative to the starting sampling point; the correlation module 1120 is further used to correlate each of the multiple initial sampling sequences with the local sequences corresponding to at least some of the codewords in the preset codeword state to obtain multiple correlation values; wherein the multiple correlation values include the correlation values between each of the multiple initial sampling sequences at the current moment and each codeword in the preset codeword state; at least some of the codewords include two specified codewords; the best sampling determination module is used to use the initial sampling sequence corresponding to the maximum of the multiple correlation values as the target sampling sequence corresponding to the current moment, and determine the starting sampling point of the next moment of the current moment based on the target sampling sequence corresponding to the current moment, so as to obtain the target sampling sequence corresponding to the next moment based on the starting sampling point of the next moment.
[0205] In some embodiments, any initial sampling sequence includes multiple sampling points, the number of sequence sample points of each initial sampling sequence is equal, any local sequence includes multiple local sampling points, the number of sequence sample points of each local sequence is equal, and the number of sequence sample points of the initial sampling sequence is equal to the number of sequence sample points of the local sequence; the correlation module 1120 is also used to determine the correlation value through formula 1.
[0206] In some embodiments, multiple received code elements in the sequence to be decoded are determined at multiple moments, and the multiple received code elements correspond to the multiple moments one by one; the initial decoding module 1130 includes: a real-time weight determination module, which is used to sequentially take a moment in the multiple moments as the current moment, and determine the real-time weight of each of the multiple state transition path branches at the current moment according to the bit state transition information; wherein the real-time weight of the state transition path branch at the current moment is the correlation value of the output code element of the state transition path branch at the current moment relative to the received code element at the current moment; a cumulative weight determination module, which is used to determine the cumulative weight of each bit in the preset bit state at the current moment according to the real-time weight of each of the multiple state transition path branches at the current moment and the cumulative weight of each bit in the preset bit state at the previous moment; a bit path table storage module, which is used to determine the bit path table at the current moment based on the cumulative weight of each bit in the preset bit state at the current moment; an initial decoding sequence output module, which is used to determine the initial decoding sequence based on the bit path table at the current moment.
[0207] In some embodiments, the cumulative weight determination module is also used to: determine the first sum between the first cumulative weight of the previous item and the third real-time weight at the current moment, and the second sum between the second cumulative weight of the previous item and the fourth real-time weight at the current moment; wherein the first cumulative weight of the previous item is the cumulative weight of the first bit of the previous item, and the second cumulative weight of the previous item is the cumulative weight of the second bit of the previous item; use the larger of the first sum and the second sum as the current first cumulative weight; wherein the current first cumulative weight is the cumulative weight of the current first bit; determine the third sum between the first cumulative weight of the previous item and the first real-time weight at the current moment, and the fourth sum between the second cumulative weight of the previous item and the second real-time weight at the current moment; use the larger of the third sum and the fourth sum as the current second cumulative weight; wherein the current second cumulative weight is the cumulative weight of the current second bit.
[0208] In some embodiments, the bit path table storage module is also used to: when the current first cumulative weight is the first sum value, determine the current first path table according to the previous first path table and the current first bit; wherein the previous first path table is the bit path table corresponding to the previous first bit, and the current first path table is the bit path table corresponding to the current first bit; when the current first cumulative weight is the second sum value, determine the current first path table according to the previous second path table and the current first bit; wherein the previous second path table is the bit path table corresponding to the previous second bit; when the current second cumulative weight is the third sum value, determine the current second path table according to the previous first path table and the current second bit; wherein the current second path table is the bit path table corresponding to the current second bit; when the current second cumulative weight is the fourth sum value, determine the current second path table according to the previous second path table and the current second bit; and according to the current first cumulative weight and the current second cumulative weight, use one of the current first path table and the current second path table as the bit path table at the current moment.
[0209] In some implementations, the initial decoding sequence output module is further used to: determine the initial decoding sequence according to the backtracking depth and the bit path table at the current moment; wherein the backtracking depth is greater than or equal to 1.
[0210] In some embodiments, the initial decoding sequence includes P input bits, and the differential decoding sequence includes P-1 input bits, where P is an integer greater than or equal to 2; the differential decoding module is further used to: sequentially obtain the first P-1 input bits in the initial decoding sequence as the current bit, perform an XOR operation on the current bit and the input bit after the current bit in the initial decoding sequence, and obtain a second XOR operation result corresponding to the current bit in the initial decoding sequence; and determine the differential decoding sequence based on the P-1 second XOR operation results.
[0211] The specific functions and effects achieved by the encoding device or decoding device can be explained in reference to other embodiments of this specification, and will not be repeated here. Each module in the encoding device or decoding device can be implemented in whole or in part by software, hardware, and a combination thereof. Each module can be embedded in or independent of a processor in a computer device in the form of hardware, or can be stored in a memory in a computer device in the form of software, so that the processor can call and execute the operations corresponding to the above modules.
[0212] The embodiment of the present specification also provides a chip, including a storage unit and a processing unit, wherein the storage unit stores a computer program, and the processing unit implements the encoding method or decoding method in any of the above embodiments when executing the computer program.
[0213] The embodiments of this specification also provide a computer-readable storage medium on which a computer program is stored. When the computer program is executed by a computer, the computer executes the encoding method or decoding method in any of the above embodiments.
[0214] The embodiments of this specification also provide a computer program product including instructions, which, when executed by a computer, enables the computer to execute the encoding method or decoding method in any of the above embodiments.
[0215] The embodiments of the present specification also provide a computer device, including a memory and a processor, wherein a computer program is stored in the memory, and when the processor executes the computer program, the encoding method or the decoding method in the above embodiments is implemented.
[0216] In some embodiments, see Fig.12 The computer device may be a terminal, and its internal structure diagram may be as follows: Fig.12 As shown. The computer device includes a processor, a memory, and a communication interface connected through a system bus. Among them, the processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The communication interface of the computer device is used to communicate with an external terminal in a wired or wireless manner, and the wireless manner can be implemented through WIFI, an operator network, MFC (near field communication) or other technologies. When the computer program is executed by the processor, an encoding method or a decoding method is implemented.
[0217] It should be understood that the specific examples herein are only intended to help those skilled in the art to better understand the embodiments of the present specification, rather than to limit the scope of the present invention.
[0218] It can be understood that in the various implementations of this specification, the size of the sequence number of each process does not mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the implementation methods of this specification.
[0219] It can be understood that the various embodiments described in this specification can be implemented individually or in combination, and the embodiments of this specification are not limited to this.
[0220] Unless otherwise specified, all technical and scientific terms used in the embodiments of this specification have the same meaning as those generally understood by those skilled in the art of the technical field of this specification. The terms used in this specification are only for the purpose of describing specific embodiments and are not intended to limit the scope of this specification. The term "and / or" used in this specification includes any and all combinations of one or more related listed items. The singular forms of "a", "above", and "the" used in the embodiments of this specification and the appended claims are also intended to include plural forms, unless the context clearly indicates other meanings.
[0221] It can be understood that the processor of the embodiment of this specification can be an integrated circuit chip with signal processing capabilities. In the implementation process, each step of the above method implementation can be completed by the hardware integrated logic circuit or software instructions in the processor. The above processor can be a general processor, a digital signal processor (Digital SigMalProcessor, DSP), an application-specific integrated circuit (Application Specific IM Integrated Circuit, ASIC), a field programmable gate array (Field Programmable Gate Array, FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components. The disclosed methods, steps and logic block diagrams in the embodiment of this specification can be implemented or executed. The general processor can be a microprocessor or the processor can also be any conventional processor, etc. The steps of the method disclosed in the embodiment of this specification can be directly embodied as a hardware decoding processor to execute, or the hardware and software modules in the decoding processor are combined and executed. The software module can be in a mature storage medium in the field such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory or an electrically erasable programmable memory, a register, etc. The storage medium is in the memory, and the processor reads the information in the memory and completes the steps of the above method in combination with its hardware.
[0222] It is understood that the memory in the embodiments of this specification may be a volatile memory or a non-volatile memory, or may include both volatile and non-volatile memory. Among them, the non-volatile memory may be a read-only memory (ROM), a programmable read-only memory (programmable ROM, PROM), an erasable programmable read-only memory (erasablePROM, EPROM), an electrically erasable programmable read-only memory (EEPROM) or a flash memory. The volatile memory may be a random access memory (RAM). It should be noted that the memory of the systems and methods described herein is intended to include, but is not limited to, these and any other suitable types of memory.
[0223] Those skilled in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this specification.
[0224] Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working processes of the systems, devices and units described above can refer to the corresponding processes in the aforementioned method implementation methods and will not be repeated here.
[0225] The above is only a specific implementation of this specification, but the protection scope of the present invention is not limited thereto. Any person skilled in the art who is familiar with the technical field can easily think of changes or substitutions within the technical scope disclosed in this specification, which should be included in the protection scope of this specification. Therefore, the protection scope of the present invention should be based on the protection scope of the claims.
Claims
1. A decoding method for a backscatter communication system, It is characterized in that A receiver applied to the backscatter communication system; the decoding method comprises: Acquire a sequence to be decoded and bit state transition information; wherein the sequence to be decoded includes a plurality of received code elements; the bit state transition information includes a plurality of state transition path branches, any of the state transition path branches includes a previous bit, an input bit, and an output code element, the previous bit and the input bit are both any one of bit 0 and bit 1 in a preset bit state, and the previous bit and the input bit are the same or different; For any of the received codewords in the sequence to be decoded, determining a correlation value of an output codeword of each of the state transition path branches relative to the received codeword based on a preset subcarrier; Based on the previous bit corresponding to the received codeword, the correlation value of each of the output codewords relative to the received codeword, and the bit state transition information, determine the input bit corresponding to the received codeword to obtain an initial decoding sequence; wherein the previous bit corresponding to the received codeword is the input bit corresponding to the previous codeword of the received codeword; the initial decoding sequence includes the input bit corresponding to each of the received codewords; The initial decoding sequence is differentially decoded to obtain a differential decoding sequence.
2. The decoding method according to claim 1, It is characterized in that The received code elements in the sequence to be decoded are the target sampling sequence; The step of obtaining a sequence to be decoded comprises: Oversampling the received signal at multiple moments based on a sampling window to obtain a target sampling sequence at each moment; wherein the length of the sampling window is equal to the symbol period of the symbol in the preset symbol state; The sequence to be decoded is determined based on the respective target sampling sequences at the multiple moments; wherein the multiple target sampling sequences in the sequence to be decoded correspond to the multiple moments in one-to-one correspondence.
3. The decoding method according to claim 2, It is characterized in that The output symbol is one of a first symbol, a second symbol, a third symbol and a fourth symbol in a preset symbol state, any symbol in the preset symbol state consists of two bits, the first symbol is inverted with the fourth symbol, and the second symbol is inverted with the third symbol; The two bits of the first symbol are both bit 1, and the two bits of the second symbol are bit 1 and bit 0 respectively; the two designated symbols in the preset symbol state each correspond to a local sequence, and the two designated symbols are two symbols in the preset symbol state that are not inverted; The oversampling of the received signal at multiple moments based on the sampling window to obtain a target sampling sequence corresponding to each moment includes: At a current moment among the multiple moments, based on the starting sampling point of the current moment and the sampling window, a plurality of initial sampling sequences at the current moment are acquired from the received signal; wherein the plurality of initial sampling sequences include at least one front-offset sequence, a non-offset sequence and at least one back-offset sequence, and the front-offset sampling sequence, the non-offset sampling sequence and the back-offset sampling sequence respectively represent the initial sampling sequences whose first sampling point is offset forward, not offset and offset backward relative to the starting sampling point; Correlating each of the multiple initial sampling sequences with the local sequence corresponding to at least part of the symbols in the preset symbol state, respectively, to obtain multiple correlation values; wherein the multiple correlation values include the correlation value between each of the multiple initial sampling sequences at the current moment and each symbol in the preset symbol state; the at least part of the symbols include the two designated symbols; The initial sampling sequence corresponding to the maximum of the multiple correlation values is used as the target sampling sequence corresponding to the current moment, and the starting sampling point of the next moment of the current moment is determined based on the target sampling sequence corresponding to the current moment, so as to obtain the target sampling sequence corresponding to the next moment based on the starting sampling point of the next moment.
4. The decoding method according to claim 3, It is characterized in that The local sequence is obtained by oversampling the output codeword after subcarrier modulation according to the subcarrier, so that subcarrier demodulation can be achieved while correlation is performed based on the local sequence; wherein the subcarrier has a corresponding subcarrier period, and the codeword period is a specified integer multiple of the subcarrier period.
5. The decoding method according to claim 3, It is characterized in that Any of the initial sampling sequences includes a plurality of sampling points, and the number of sequence sample points of each of the initial sampling sequences is equal; any of the local sequences includes a plurality of local sampling points, and the number of sequence sample points of each of the local sequences is equal, and the number of sequence sample points of the initial sampling sequence is equal to the number of sequence sample points of the local sequence; The correlation value is determined by the following formula: Wherein, j∈{-N, ..., -2, -1, 0, 1, 2, ..., N}, N is a positive integer, j represents the forward and backward offset number of the initial sampling sequence, k∈{1, 2, 3, 4}, k represents any one of the first codeword, the second codeword, the third codeword and the fourth codeword in the preset codeword state, C(j, k) represents the correlation value between the codeword k and the initial sampling sequence with the forward and backward offset number j; n represents the position of the starting sampling point, m represents the number of sequence sample points, d j represents the initial sampling sequence with j front-back offsets, S k Represents the local sequence corresponding to the codeword k in the preset codeword state.
6. The decoding method according to claim 1, It is characterized in that The plurality of received code elements in the sequence to be decoded are determined at a plurality of time instants, and the plurality of received code elements correspond one-to-one to the plurality of time instants; The step of determining the input bit corresponding to the received codeword based on the previous bit corresponding to the received codeword, the correlation value of each of the output codewords relative to the received codeword, and the bit state transition information to obtain an initial decoding sequence includes: Sequentially taking a moment among the multiple moments as the current moment, and determining the real-time weight of each of the multiple state transition path branches at the current moment according to the bit state transition information; wherein the real-time weight of the state transition path branch at the current moment is a correlation value of the output codeword of the state transition path branch at the current moment relative to the received codeword at the current moment; Determine the cumulative weight of each bit in the preset bit state at the current moment according to the real-time weights of each of the plurality of state transition path branches at the current moment and the cumulative weight of each bit in the preset bit state at the previous moment; Determine a bit path table at the current moment based on the accumulated weight of each bit in the preset bit state at the current moment; The initial decoding sequence is determined based on the bit path table at the current moment.
7. The decoding method according to claim 6, It is characterized in that The multiple state transition path branches include a first path branch, a second path branch, a third path branch and a fourth path branch, and the output code elements of the first path branch, the second path branch, the third path branch and the fourth path branch are respectively the first code element, the second code element, the third code element and the fourth code element; the previous item bits of the first path branch and the third path branch are the previous item first bit, the previous item bits of the second path branch and the fourth path branch are the previous item second bit, the input bits of the third path branch and the fourth path branch are the current first bit, and the input bits of the first path branch and the second path branch are the current second bit; wherein the previous item first bit and the previous item second bit are respectively bit 0 and bit 1 in the preset bit state at the previous moment, and the current first bit and the current second bit are respectively bit 0 and bit 1 in the preset bit state at the current moment.
8. The decoding method according to claim 7, It is characterized in that The real-time weights of the first path branch, the second path branch, the third path branch, and the fourth path branch are respectively the first real-time weight, the second real-time weight, the third real-time weight, and the fourth real-time weight; Determining the cumulative weight of each bit in the preset bit state at the current moment according to the real-time weights of each of the plurality of state transition path branches at the current moment and the cumulative weight of each bit in the preset bit state at the previous moment includes: Determine a first sum value between the first cumulative weight of the previous item and the third real-time weight at the current moment, and a second sum value between the second cumulative weight of the previous item and the fourth real-time weight at the current moment; wherein the first cumulative weight of the previous item is the cumulative weight of the first bit of the previous item, and the second cumulative weight of the previous item is the cumulative weight of the second bit of the previous item; The larger of the first sum and the second sum is used as a current first cumulative weight; wherein the current first cumulative weight is the cumulative weight of the current first bit; Determine a third sum value between the first cumulative weight of the previous item and the first real-time weight at the current moment, and a fourth sum value between the second cumulative weight of the previous item and the second real-time weight at the current moment; The larger one of the third sum and the fourth sum is used as the current second cumulative weight; wherein the current second cumulative weight is the cumulative weight of the current second bit.
9. The decoding method according to claim 8, It is characterized in that The step of determining the bit path table at the current moment based on the accumulated weight of each bit in the preset bit state at the current moment includes: In the case where the current first accumulated weight is the first sum value, determining the current first path table according to the previous first path table and the current first bit; wherein the previous first path table is a bit path table corresponding to the previous first bit, and the current first path table is a bit path table corresponding to the current first bit; In the case where the current first accumulated weight is the second sum value, determining the current first path table according to the previous second path table and the current first bit; wherein the previous second path table is a bit path table corresponding to the previous second bit; In the case where the current second accumulated weight is the third sum, determining the current second path table according to the previous first path table and the current second bit; wherein the current second path table is a bit path table corresponding to the current second bit; When the current second accumulated weight is the fourth sum value, determining the current second path table according to the previous second path table and the current second bit; According to the current first cumulative weight and the current second cumulative weight, one of the current first path table and the current second path table is used as the bit path table at the current moment.
10. The decoding method according to claim 9, It is characterized in that The determining the initial decoding sequence based on the bit path table at the current moment includes: The initial decoding sequence is determined according to the backtracking depth and the bit path table at the current moment; wherein the backtracking depth is greater than or equal to 1.
11. The decoding method according to claim 1, It is characterized in that The initial decoding sequence includes P input bits, and the differential decoding sequence includes P-1 input bits, where P is an integer greater than or equal to 2; performing differential decoding on the initial decoding sequence to obtain a differential decoding sequence includes: Sequentially obtain the first P-1 input bits in the initial decoding sequence as the current bit, and perform an XOR operation on the current bit and an input bit subsequent to the current bit in the initial decoding sequence to obtain a second XOR operation result corresponding to the current bit in the initial decoding sequence; The differential decoding sequence is determined according to P-1 second XOR operation results.
12. A coding method for a backscatter communication system, It is characterized in that A transmitter applied to the backscatter communication system; the encoding method comprises: Acquire an initial data sequence and bit state transition information; wherein the bit state transition information includes a plurality of state transition path branches, any of the state transition path branches includes a preceding bit, an input bit, and an output symbol, the preceding bit and the input bit are both any one of bit 0 and bit 1 in a preset bit state, and the preceding bit and the input bit are the same or different; Performing differential encoding on the initial data sequence to obtain a differential data sequence; wherein the differential data sequence includes a plurality of bits, and any bit in the differential data sequence is bit 0 or bit 1; Sequentially acquiring bits in the differential data sequence as input bits, and determining output symbols corresponding to the input bits according to the input bits, the preceding bits of the input bits, and the bit state transition information; Subcarrier modulation is performed on each of the output code elements based on a preset subcarrier to obtain a coding sequence.
13. The encoding method according to claim 12, It is characterized in that The output symbol is one of a first symbol, a second symbol, a third symbol and a fourth symbol in a preset symbol state, the first symbol is inverted with the fourth symbol, and the second symbol is inverted with the third symbol; The determining, according to the input bit, the preceding bit of the input bit and the bit state transition information, an output symbol corresponding to the input bit comprises: In the case where the preceding bit is bit 0, if the input bit is bit 0, the third codeword is used as the output codeword corresponding to the input bit according to the bit state transition information; if the input bit is bit 1, the first codeword is used as the output codeword corresponding to the input bit according to the bit state transition information; In the case where the previous bit is bit 1, if the input bit is bit 0, the fourth codeword is used as the output codeword corresponding to the input bit according to the bit state transition information; if the input bit is bit 1, the second codeword is used as the output codeword corresponding to the input bit according to the bit state transition information.
14. The encoding method according to any one of claims 12 to 13, It is characterized in that The initial data sequence includes P-1 bits, and the differential data sequence includes P bits, where P is an integer greater than or equal to 2; performing differential encoding on the initial data sequence to obtain a differential data sequence includes: Sequentially obtain P-1 bits in the initial data sequence as the current bit, and if the current bit in the initial data sequence is the first bit in the initial data sequence, perform an XOR operation on the current bit in the initial data sequence and bit 0 to obtain a corresponding first XOR operation result; If the current bit in the initial data sequence is not the first bit in the initial data sequence, performing an XOR operation on the current bit in the initial data sequence and the previous first XOR operation result to obtain a corresponding first XOR operation result; Bit 0 is used as the first bit in the differential data sequence, and P-1 bits after the first bit in the differential data sequence are determined according to P-1 first XOR operation results.
15. The encoding method according to any one of claims 12 to 14, It is characterized in that Any codeword in the preset codeword state consists of two bits, the two bits of the first codeword in the preset codeword state are both bit 1, and the two bits of the second codeword in the preset codeword state are bit 1 and bit 0 respectively.
16. The encoding method according to any one of claims 12 to 15, It is characterized in that The output symbols in the coding sequence have corresponding symbol periods, the subcarriers have corresponding subcarrier periods, and the symbol periods are specified integer multiples of the subcarrier periods.
17. A decoding device for a backscatter communication system, It is characterized in that A receiver applied to the backscatter communication system; the decoding device comprises: A second acquisition module is used to acquire a sequence to be decoded and bit state transition information; wherein the sequence to be decoded includes a plurality of received code elements; the bit state transition information includes a plurality of state transition path branches, any of the state transition path branches includes a previous bit, an input bit and an output code element, the previous bit and the input bit are both any one of bit 0 and bit 1 in a preset bit state, and the previous bit and the input bit are the same or different; A correlation module, configured to determine, for any received codeword in the sequence to be decoded, a correlation value of an output codeword of each state transition path branch relative to the received codeword based on a preset subcarrier; An initial decoding module, configured to determine the input bit corresponding to the received codeword based on the previous bit corresponding to the received codeword, the correlation value of each of the output codewords relative to the received codeword, and the bit state transition information, to obtain an initial decoding sequence; wherein the previous bit corresponding to the received codeword is the input bit corresponding to the previous codeword of the received codeword; and the initial decoding sequence includes the input bit corresponding to each of the received codewords; The differential decoding module is used to perform differential decoding on the initial decoding sequence to obtain a differential decoding sequence.
18. The decoding device according to claim 17, It is characterized in that The received codewords in the sequence to be decoded are the target sampling sequence; the second acquisition module is further used to: oversample the received signal at multiple time moments based on the sampling window to obtain the target sampling sequence at each time moment; wherein the length of the sampling window is equal to the codeword period of the codeword in the preset codeword state; based on the respective target sampling sequences at the multiple time moments, determine the sequence to be decoded; wherein the multiple target sampling sequences in the sequence to be decoded correspond one-to-one to the multiple time moments.
19. The decoding device according to claim 18, It is characterized in that The output symbol is one of a first symbol, a second symbol, a third symbol and a fourth symbol in a preset symbol state, any symbol in the preset symbol state consists of two bits, the first symbol is inverted with the fourth symbol, and the second symbol is inverted with the third symbol; The two bits of the first symbol are both bit 1, and the two bits of the second symbol are bit 1 and bit 0 respectively; the two designated symbols in the preset symbol state each correspond to a local sequence, and the two designated symbols are two symbols in the preset symbol state that are not inverted; the second acquisition module further includes an oversampling module and an optimal sampling determination module; The oversampling module is configured to obtain, at a current moment among the multiple moments, a plurality of initial sampling sequences at the current moment from the received signal based on a starting sampling point at the current moment and the sampling window; wherein the plurality of initial sampling sequences include at least one pre-shifted sequence, a non-shifted sequence and at least one post-shifted sequence, and the pre-shifted sampling sequence, the non-shifted sampling sequence and the post-shifted sampling sequence respectively represent the initial sampling sequences whose first sampling point is shifted forward, not shifted and shifted backward relative to the starting sampling point; The correlation module is further used to correlate each of the multiple initial sampling sequences with the local sequence corresponding to at least part of the symbols in the preset symbol state, to obtain multiple correlation values; wherein the multiple correlation values include the correlation value between each of the multiple initial sampling sequences at the current moment and each symbol in the preset symbol state; the at least part of the symbols include the two designated symbols; The optimal sampling determination module is used to use the initial sampling sequence corresponding to the maximum of the multiple correlation values as the target sampling sequence corresponding to the current moment, and determine the starting sampling point of the next moment of the current moment based on the target sampling sequence corresponding to the current moment, so as to obtain the target sampling sequence corresponding to the next moment based on the starting sampling point of the next moment.
20. The decoding device according to claim 19, It is characterized in that The local sequence is obtained by oversampling the output codeword after subcarrier modulation according to the subcarrier, so that subcarrier demodulation can be achieved while correlation is performed based on the local sequence; wherein the subcarrier has a corresponding subcarrier period, and the codeword period is a specified integer multiple of the subcarrier period.
21. The decoding device according to claim 20, It is characterized in that Any of the initial sampling sequences includes a plurality of sampling points, and the number of sequence sample points of each of the initial sampling sequences is equal; any of the local sequences includes a plurality of local sampling points, and the number of sequence sample points of each of the local sequences is equal, and the number of sequence sample points of the initial sampling sequence is equal to the number of sequence sample points of the local sequence; The correlation module is also used to determine the correlation value by the following formula: Wherein, j∈{-N, ..., -2, -1, 0, 1, 2, ..., N}, N is a positive integer, j represents the forward and backward offset number of the initial sampling sequence, k∈{1, 2, 3, 4}, k represents any one of the first codeword, the second codeword, the third codeword and the fourth codeword in the preset codeword state, C(j, k) represents the correlation value between the codeword k and the initial sampling sequence with the forward and backward offset number j; n represents the position of the starting sampling point, m represents the number of sequence sample points, d j represents the initial sampling sequence with j front and back offsets, S k Represents the local sequence corresponding to the codeword k in the preset codeword state.
22. The decoding device according to claim 17, It is characterized in that The plurality of received code elements in the sequence to be decoded are determined at a plurality of time instants, and the plurality of received code elements correspond one-to-one to the plurality of time instants; The initial decoding module comprises: A real-time weight determination module, used to sequentially take a moment among the multiple moments as the current moment, and determine the real-time weight of each of the multiple state transition path branches at the current moment according to the bit state transition information; wherein the real-time weight of the state transition path branch at the current moment is a correlation value of an output codeword of the state transition path branch at the current moment relative to the received codeword at the current moment; A cumulative weight determination module, used to determine the cumulative weight of each bit in the preset bit state at the current moment according to the real-time weights of each of the plurality of state transition path branches at the current moment and the cumulative weight of each bit in the preset bit state at the previous moment; A bit path table storage module, used to determine the bit path table at the current moment based on the accumulated weight of each bit in the preset bit state at the current moment; The initial decoding sequence output module is used to determine the initial decoding sequence based on the bit path table at the current moment.
23. The decoding device according to claim 22, It is characterized in that The multiple state transition path branches include a first path branch, a second path branch, a third path branch and a fourth path branch, and the output code elements of the first path branch, the second path branch, the third path branch and the fourth path branch are respectively the first code element, the second code element, the third code element and the fourth code element; the previous item bits of the first path branch and the third path branch are the previous item first bit, the previous item bits of the second path branch and the fourth path branch are the previous item second bit, the input bits of the third path branch and the fourth path branch are the current first bit, and the input bits of the first path branch and the second path branch are the current second bit; wherein the previous item first bit and the previous item second bit are respectively bit 0 and bit 1 in the preset bit state at the previous moment, and the current first bit and the current second bit are respectively bit 0 and bit 1 in the preset bit state at the current moment.
24. The decoding device according to claim 23, It is characterized in that The real-time weights of the first path branch, the second path branch, the third path branch, and the fourth path branch are respectively the first real-time weight, the second real-time weight, the third real-time weight, and the fourth real-time weight; The cumulative weight determination module is further used for: Determine a first sum value between the first cumulative weight of the previous item and the third real-time weight at the current moment, and a second sum value between the second cumulative weight of the previous item and the fourth real-time weight at the current moment; wherein the first cumulative weight of the previous item is the cumulative weight of the first bit of the previous item, and the second cumulative weight of the previous item is the cumulative weight of the second bit of the previous item; The larger of the first sum and the second sum is used as a current first cumulative weight; wherein the current first cumulative weight is the cumulative weight of the current first bit; Determine a third sum value between the first cumulative weight of the previous item and the first real-time weight at the current moment, and a fourth sum value between the second cumulative weight of the previous item and the second real-time weight at the current moment; The larger one of the third sum and the fourth sum is used as the current second cumulative weight; wherein the current second cumulative weight is the cumulative weight of the current second bit.
25. The decoding device according to claim 24, It is characterized in that The bit path table storage module is further used for: In the case where the current first accumulated weight is the first sum value, determining the current first path table according to the previous first path table and the current first bit; wherein the previous first path table is a bit path table corresponding to the previous first bit, and the current first path table is a bit path table corresponding to the current first bit; In the case where the current first accumulated weight is the second sum value, determining the current first path table according to the previous second path table and the current first bit; wherein the previous second path table is a bit path table corresponding to the previous second bit; In the case where the current second accumulated weight is the third sum, determining the current second path table according to the previous first path table and the current second bit; wherein the current second path table is a bit path table corresponding to the current second bit; When the current second accumulated weight is the fourth sum value, determining the current second path table according to the previous second path table and the current second bit; According to the current first cumulative weight and the current second cumulative weight, one of the current first path table and the current second path table is used as the bit path table at the current moment.
26. The decoding device according to claim 25, It is characterized in that The initial decoding sequence output module is further used for: The initial decoding sequence is determined according to the backtracking depth and the bit path table at the current moment; wherein the backtracking depth is greater than or equal to 1.
27. The decoding device according to claim 26, It is characterized in that The initial decoding sequence includes P input bits, the differential decoding sequence includes P-1 input bits, and P is an integer greater than or equal to 2; the differential decoding module is further used to: Sequentially obtain the first P-1 input bits in the initial decoding sequence as the current bit, and perform an XOR operation on the current bit and an input bit subsequent to the current bit in the initial decoding sequence to obtain a second XOR operation result corresponding to the current bit in the initial decoding sequence; The differential decoding sequence is determined according to P-1 second XOR operation results.
28. A coding device for a backscatter communication system, It is characterized in that A transmitter applied to the backscatter communication system; the encoding device comprises: A first acquisition module is used to acquire an initial data sequence and bit state transition information; wherein the bit state transition information includes a plurality of state transition path branches, any of the state transition path branches includes a preceding bit, an input bit, and an output symbol, the preceding bit and the input bit are both any one of bit 0 and bit 1 in a preset bit state, and the preceding bit and the input bit are the same or different; A differential encoding module, configured to perform differential encoding on the initial data sequence to obtain a differential data sequence; wherein the differential data sequence includes a plurality of bits, and any bit in the differential data sequence is bit 0 or bit 1; A symbol mapping module, used to sequentially obtain bits in the differential data sequence as input bits, and determine an output symbol corresponding to the input bit according to the input bit, a preceding bit of the input bit and the bit state transition information; The subcarrier modulation module is used to perform subcarrier modulation on each of the output code elements based on a preset subcarrier to obtain a coding sequence.
29. The encoding device according to claim 28, It is characterized in that The output symbol is one of a first symbol, a second symbol, a third symbol and a fourth symbol in a preset symbol state, the first symbol is inverted with the fourth symbol, and the second symbol is inverted with the third symbol; The codeword mapping module is also used for: when the previous bit is bit 0, if the input bit is bit 0, according to the bit state transition information, the third codeword is used as the output codeword corresponding to the input bit; if the input bit is bit 1, according to the bit state transition information, the first codeword is used as the output codeword corresponding to the input bit; when the previous bit is bit 1, if the input bit is bit 0, according to the bit state transition information, the fourth codeword is used as the output codeword corresponding to the input bit; if the input bit is bit 1, according to the bit state transition information, the second codeword is used as the output codeword corresponding to the input bit.
30. The encoding device according to any one of claims 28 to 29, It is characterized in that The initial data sequence includes P-1 bits, and the differential data sequence includes P bits, where P is an integer greater than or equal to 2; The differential encoding module is further used to: sequentially obtain P-1 bits in the initial data sequence as the current bit, and if the current bit in the initial data sequence is the first bit in the initial data sequence, perform an XOR operation on the current bit in the initial data sequence and bit 0 to obtain a corresponding first XOR operation result; If the current bit in the initial data sequence is not the first bit in the initial data sequence, perform an XOR operation on the current bit in the initial data sequence and the previous first XOR operation result to obtain the corresponding first XOR operation result; take bit 0 as the first bit in the differential data sequence, and determine P-1 bits after the first bit in the differential data sequence based on P-1 first XOR operation results.
31. The encoding device according to any one of claims 28 to 30, It is characterized in that Any codeword in the preset codeword state consists of two bits, the two bits of the first codeword in the preset codeword state are both bit 1, and the two bits of the second codeword in the preset codeword state are bit 1 and bit 0 respectively.
32. The encoding device according to any one of claims 28 to 31, It is characterized in that The output symbols in the coding sequence have corresponding symbol periods, the subcarriers have corresponding subcarrier periods, and the symbol periods are specified integer multiples of the subcarrier periods.
33. A computer device comprising a memory and a processor, wherein the memory stores a computer program, It is characterized in that When the processor executes the computer program, the processor implements the decoding method according to any one of claims 1 to 11, or implements the encoding method according to any one of claims 12 to 16.
34. A chip comprising a storage unit and a processing unit, wherein the storage unit stores a computer program. It is characterized in that When the processing unit executes the computer program, the decoding method according to any one of claims 1 to 11 is implemented, or the encoding method according to any one of claims 12 to 16 is implemented.
35. A computer-readable storage medium having a computer program stored thereon, It is characterized in that When the computer program is executed by a processor, the decoding method described in any one of claims 1 to 11 is implemented, or the encoding method described in any one of claims 12 to 16 is implemented.
