Wireless communication method and zero-power device

Abstract

The embodiment of the application provides a wireless communication method and zero-power equipment, the method relates to the field of communication, and the method comprises the following steps: performing repeated encoding based on a first sequence to be encoded to obtain a second sequence. The method introduces repeated encoding to increase redundant information, so that when a receiving end decodes the first sequence based on the second sequence, the decoding result of the first sequence can be error-corrected and error-detected, and then the data transmission performance of the zero-power equipment can be improved.

Description

Technical Field

[0001] This application relates to the field of communications, and more specifically, to a wireless communication method and a zero-power device. Background Technology

[0002] Zero-power devices are low in complexity and cost, requiring no maintenance or batteries, and can support energy harvesting and / or backscatter communication, enabling high-density and large-scale deployment at a relatively low cost. However, the data transmission performance of current zero-power devices is poor, and improving this performance remains a problem to be solved. Summary of the Invention

[0003] This application provides a wireless communication method and a zero-power device, which can improve the data transmission performance of the zero-power device.

[0004] In a first aspect, embodiments of this application provide a wireless communication method, the method being applicable to a transmitting device, the method comprising: The second sequence is obtained by repeatedly encoding the first sequence to be encoded.

[0005] Secondly, embodiments of this application provide a wireless communication method, applicable to a receiving device, the method comprising: The first sequence is obtained by repeatedly decoding the second sequence to be decoded.

[0006] Thirdly, embodiments of this application provide a transmitting device for executing the methods described in the first aspect or its various implementations above. Specifically, the transmitting device includes functional modules for executing the methods described in the first aspect or its various implementations above.

[0007] In one implementation, the transmitting device may include a processing unit for performing functions related to information processing. For example, the processing unit may be a processor.

[0008] In one implementation, the transmitting device may include a transmitting unit and / or a receiving unit. The transmitting unit performs functions related to transmitting, and the receiving unit performs functions related to receiving. For example, the transmitting unit may be a transmitter or a receiver. Alternatively, the transmitting device may be a communication chip, and the transmitting unit may be an input circuit or interface of the communication chip, or an output circuit or interface of the communication chip.

[0009] Fourthly, embodiments of this application provide a receiving device for executing the methods described in the second aspect or its various implementations above. Specifically, the receiving device includes functional modules for executing the methods described in the second aspect or its various implementations above.

[0010] In one implementation, the receiving device may include a processing unit for performing functions related to information processing. For example, the processing unit may be a processor.

[0011] In one implementation, the receiving device may include a transmitting unit and / or a receiving unit. The transmitting unit performs functions related to transmitting, and the receiving unit performs functions related to receiving. For example, the transmitting unit may be a transmitter or a receiver, and the receiving unit may be a receiver or a transmitter. Alternatively, the receiving device may be a communication chip, where the receiving unit may be an input circuit or interface of the communication chip, and the transmitting unit may be an output circuit or interface of the communication chip.

[0012] Fifthly, embodiments of this application provide a transmitting device, including a processor and a memory. The memory is used to store a computer program, and the processor is used to call and run the computer program stored in the memory to perform the methods described in the first aspect or its various implementations above.

[0013] In one implementation, there are one or more processors and one or more memories.

[0014] In one implementation, the memory can be integrated with the processor, or the memory can be set separately from the processor.

[0015] In one implementation, the transmitting device further includes a transmitter and a receiver.

[0016] Sixthly, embodiments of this application provide a receiving device, including a processor and a memory. The memory is used to store a computer program, and the processor is used to call and run the computer program stored in the memory to perform the methods described in the second aspect above or in various implementations thereof.

[0017] In one implementation, there are one or more processors and one or more memories.

[0018] In one implementation, the memory can be integrated with the processor, or the memory can be set separately from the processor.

[0019] In one implementation, the receiving device further includes a transmitter and a receiver.

[0020] In a seventh aspect, embodiments of this application provide a chip for implementing the methods of any one of the first to second aspects or their respective implementations described above. Specifically, the chip includes a processor for calling and running a computer program from a memory, causing a device on which the chip is installed to perform the methods of any one of the first to second aspects or their respective implementations described above.

[0021] Eighthly, embodiments of this application provide a computer-readable storage medium for storing a computer program that, when run on a computer, causes the computer to perform any one of the first to second aspects or their respective implementations described above.

[0022] Ninthly, embodiments of this application provide a computer program product, including computer program instructions that cause a computer to perform the methods of any one of the first to second aspects or their respective implementations mentioned above.

[0023] In a tenth aspect, embodiments of this application provide a computer program that, when run on a computer, causes the computer to perform any one of the first to second aspects or their respective implementations described above.

[0024] Based on the above technical solution, the zero-power device performs repeated encoding on the first sequence to be encoded to obtain the second sequence; that is, based on the first sequence, redundant information is increased by introducing repeated encoding, so that when the receiving end decodes the first sequence based on the second sequence, it can perform error correction and error detection on the decoding result of the first sequence, thereby improving the data transmission performance of the zero-power device. Attached Figure Description

[0025] Figure 1 This is a schematic diagram of the communication system provided in an embodiment of this application.

[0026] Figure 2 This is a schematic diagram of a zero-power communication system provided in an embodiment of this application.

[0027] Figure 3 This is a schematic diagram of the energy harvesting principle provided in an embodiment of this application.

[0028] Figure 4 This is a schematic diagram of backscatter communication provided in an embodiment of this application.

[0029] Figure 5 This is a circuit schematic diagram of resistive load modulation provided in an embodiment of this application.

[0030] Figure 6 This is a schematic diagram of the reverse non-return-to-zero encoding provided in the embodiments of this application.

[0031] Figure 7 This is a schematic diagram of the unipolar return-to-zero encoding provided in the embodiments of this application.

[0032] Figure 8 This is a schematic diagram of Manchester encoding provided in an embodiment of this application.

[0033] Figure 9 This is a schematic diagram of Miller encoding provided in the embodiments of this application.

[0034] Figure 10 This is a schematic diagram of the differential biphase encoding provided in the embodiments of this application.

[0035] Figure 11 This is a schematic diagram of the differential encoding provided in the embodiments of this application.

[0036] Figure 12 This is a schematic diagram of data 0, data 1, SOF and EOF in the pulse interval encoding provided in the embodiments of this application.

[0037] Figure 13 This is a schematic diagram of biphase space coding (FM0) provided in the embodiments of this application.

[0038] Figure 14 This is a schematic diagram of the FM0 symbol and FM0 symbol sequence in the biphase space coding (FM0) provided in the embodiments of this application.

[0039] Figure 15 This is a schematic diagram of the OOK modulation method provided in the embodiments of this application.

[0040] Figure 16 This is a schematic flowchart of the wireless communication method provided in the embodiments of this application.

[0041] Figure 17 This is an example of the positional relationship between the check group and the parity bit in the first sequence provided in the embodiments of this application.

[0042] Figure 18 This is another example of the positional relationship between the check group and the parity bit in the first sequence provided in the embodiments of this application.

[0043] Figure 19 This is an example of the interleaving principle provided in the embodiments of this application.

[0044] Figure 20 This is a schematic flowchart of repeated encoding provided in the embodiments of this application.

[0045] Figure 21 This is another illustrative flowchart of the wireless communication method provided in the embodiments of this application.

[0046] Figure 22 This is a schematic block diagram of a zero-power device provided in an embodiment of this application.

[0047] Figure 23 This is another schematic block diagram of the zero-power device provided in the embodiments of this application.

[0048] Figure 24 This is a schematic block diagram of a communication device provided in an embodiment of this application.

[0049] Figure 25 This is a schematic block diagram of the chip provided in the embodiments of this application. Detailed Implementation

[0050] The technical solutions in the embodiments of this application will now be described with reference to the accompanying drawings.

[0051] The embodiments of this application can be applied to various communication systems. For example, the applicable communication systems include, but are not limited to: Global System for Mobile communication (GSM), Code Division Multiple Access (CDMA), Wideband Code Division Multiple Access (WCDMA), General Packet Radio Service (GPRS), Long Term Evolution (LTE), Advanced Long Term Evolution (LTE-A), New Radio (NR), evolution systems of NR, LTE-based access to unlicensed spectrum (LTE-U), NR-based access to unlicensed spectrum (NR-U), Universal Mobile Telecommunication System (UMTS), Wireless Local Area Networks (WLAN), Wireless Fidelity (WiFi), Next Generation Communication Systems, Zero Power Communication Systems, Cellular Internet of Things (IoT), Cellular Passive Internet of Things (CIoT), or other communication systems.

[0052] Cellular Internet of Things (IoT) is a product of the integration of cellular mobile communication networks and the Internet of Things (IoT). It is also known as passive cellular IoT. It consists of network devices and passive terminals. In passive cellular IoT, passive terminals can communicate with other passive terminals through network devices, or they can communicate using device-to-device (D2D) communication. The network devices only need to send carrier signals, i.e., power signals, to power the passive terminals.

[0053] Traditional communication systems typically support a limited number of connections and are easy to implement. However, with the development of communication technology, mobile communication systems will not only support traditional communication, but also support, for example, D2D communication, machine-to-machine (M2M) communication, machine-type communication (MTC), and vehicle-to-vehicle (V2V) communication. The embodiments of this application can also be applied to these communication systems.

[0054] It should be understood that the communication system in this application embodiment can be applied to carrier aggregation (CA) scenarios, dual connectivity (DC) scenarios, and standalone (SA) network deployment scenarios. This application embodiment does not limit the spectrum used for application. For example, this application embodiment can be applied to licensed spectrum or unlicensed spectrum.

[0055] Figure 1 This is a schematic diagram of the communication system 100 provided in an embodiment of this application.

[0056] like Figure 1 As shown, the communication system 100 may include a network device 110, which may be a device that communicates with a terminal device 120 (or a communication terminal, terminal). The network device 110 can provide communication coverage for a specific geographical area and can communicate with terminal devices located within that coverage area.

[0057] For example, network device 110 may be a device for communicating with mobile devices. Network device 110 may be an access point (AP) in WLAN, a base station (BTS) in GSM or CDMA, a base station (NodeB, NB) in WCDMA, an evolved Node B (eNB or eNodeB) in LTE, or a relay station or access point, or a vehicle-mounted device, wearable device, or a network device (gNB) in an NR network, or a network device in a future evolved PLMN network, etc.

[0058] In this system, network device 110 provides services to the cell, and terminal device 120 communicates with the network device through the transmission resources (e.g., frequency domain resources, or spectrum resources) used by the cell. The cell can be the cell corresponding to network device 110 (e.g., base station). The cell can belong to a macro base station or a base station corresponding to a small cell. The small cell can include: metro cell, micro cell, pico cell, femto cell, etc. These small cells have the characteristics of small coverage area and low transmission power, and are suitable for providing high-speed data transmission services.

[0059] For example, terminal equipment 120 may also be referred to as user equipment (UE), access terminal, user unit, user station, mobile station, mobile station, remote station, remote terminal, mobile device, user terminal, terminal, wireless communication equipment, user agent, or user device, etc. Terminal equipment can be a station (STAION, ST) in a WLAN, a cellular phone, cordless phone, Session Initiation Protocol (SIP) phone, Wireless Local Loop (WLL) station, Personal Digital Assistant (PDA) device, handheld device with wireless communication capabilities, computing device or other processing device connected to a wireless modem, vehicle-mounted device, wearable device, and next-generation communication system, such as terminal equipment in an NR network or a terminal equipment in a future evolved Public Land Mobile Network (PLMN) network, or a zero-power device, etc.

[0060] For example, the terminal device 120 can be a wearable device. Wearable devices, also known as wearable smart devices, are a general term for devices that utilize wearable technology to intelligently design and develop everyday wearables, such as glasses, gloves, watches, clothing, and shoes. Wearable devices are portable devices that are worn directly on the body or integrated into the user's clothing or accessories. Wearable devices are not just hardware devices, but also achieve powerful functions through software support, data interaction, and cloud interaction. Broadly speaking, wearable smart devices include those that are feature-rich, large in size, and can achieve complete or partial functions without relying on a smartphone, such as smartwatches or smart glasses, as well as those that focus on a specific application function and require the use of other devices such as smartphones, such as various smart bracelets and smart jewelry for vital sign monitoring.

[0061] For example, the terminal device 120 can be a zero-power device. A zero-power device can be understood as a device whose power consumption is lower than a preset power consumption. For example, this includes passive terminals, and even semi-passive terminals.

[0062] It should be understood that Figure 1 This is merely an example of what is being done and should not be construed as limiting the scope of this application.

[0063] For example, in other alternative embodiments, the communication system 100 may include multiple network devices, and each network device may include a number of other terminal devices within its coverage area. Furthermore, devices with communication functions in the network / system of this application embodiment may be referred to as communication devices. Figure 1 Taking the communication system 100 shown as an example, the communication devices may include a network device 110 and a terminal device 120 with communication functions. The network device 110 and the terminal device 120 may be the specific devices described above, which will not be repeated here. The communication system 100 may also include other communication devices, such as network controllers and mobility management entities, etc. The embodiments of this application do not specifically limit this.

[0064] Furthermore, it should be understood that the terms "system" and "network" are often used interchangeably in this document. The term "and / or" in this document merely describes the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A existing alone, A and B existing simultaneously, or B existing alone. Additionally, the character " / " in this document generally indicates an "or" relationship between the preceding and following related objects. The term "correspondence" in this document can indicate a direct or indirect correspondence between two objects, or an association between them, or a relationship of instruction and being instructed, configuration and being configured, etc. The term "instruction" in this document can be a direct instruction, an indirect instruction, or an association. For example, A instructs B can mean that A directly instructs B, for example, B can be obtained through A; it can also mean that A indirectly instructs B, for example, A instructs C, B can be obtained through C; or it can mean that A and B have an association. The term "predefined" as used herein can be implemented by pre-storing corresponding codes, tables, or other means of indicating relevant information in a device (e.g., including terminal devices and network devices), and this application does not limit the specific implementation method. For example, pre-configuration can refer to what is defined in a protocol. It should also be understood that in the embodiments of this application, the "protocol" can refer to standard protocols in the field of communications, such as the LTE protocol, the NR protocol, and related protocols applied to future communication systems, and this application does not limit this.

[0065] To facilitate understanding of the technical solution provided in this application, the zero-power device and related technologies will be described below.

[0066] Zero-power devices are Radio Frequency Identification (RFID) tags, which utilize spatial coupling of radio frequency signals to achieve contactless automatic transmission and identification of tag information. RFID tags are also known as "radio frequency tags" or "electronic tags." Based on their power supply method, electronic tags can be categorized into active, passive, and semi-passive electronic tags. Active electronic tags, also known as powered tags, are powered by a battery. The battery, memory, and antenna together constitute an active electronic tag, unlike passive RFID tags, which continuously transmit information via a set frequency band until the battery is replaced. Passive electronic tags, also known as passive RFID tags, do not support internal batteries. When a passive electronic tag approaches a reader, the tag is within the near-field range radiated by the reader's antenna. The tag's antenna generates an induced current through electromagnetic induction, which drives the tag's chip circuitry. The chip circuitry then transmits the identification information stored in the tag to the reader via the tag's antenna. Semi-passive electronic tags, also known as semi-active electronic tags, inherit the advantages of passive electronic tags, such as small size, light weight, low price, and long service life. The built-in battery provides power to a small number of circuits inside the chip when there is no reader access. Only when the reader accesses the chip does the built-in battery power the RFID chip to increase the tag's reading and writing distance and improve communication reliability.

[0067] RFID is a wireless communication system. It consists of two parts: electronic tags (TAGs) and readers / writers. Each electronic tag includes a coupling component and a chip; it has a unique electronic code and is placed on the target object to mark it. The reader / writer can not only read information from the electronic tags but also write information to them, while providing the energy needed for communication.

[0068] (1) Communication based on zero-power devices.

[0069] Figure 2 A schematic diagram of the zero-power communication system provided in this application.

[0070] like Figure 2 As shown, a zero-power communication system consists of network equipment and zero-power terminals. The network equipment is used to send wireless power signals and downlink communication signals to the zero-power terminals, and to receive backscattered signals from the zero-power terminals. A basic zero-power terminal includes an energy harvesting module, a backscattered communication module, and a low-power computing module. In addition, the zero-power terminal may also have a memory or sensor to store basic information (such as object identification) or acquire sensor data such as ambient temperature and humidity.

[0071] Zero-power communication, also known as communication based on zero-power terminals, mainly includes radio frequency energy harvesting and backscatter communication as key technologies.

[0072] 1. Power Harvesting (RF).

[0073] Figure 3 A schematic diagram of energy harvesting provided for an embodiment of this application.

[0074] like Figure 3 As shown, the energy harvesting module may include a capacitor C and a resistor R. L The energy harvesting module, based on the principle of electromagnetic induction, harvests energy from spatial electromagnetic waves to obtain the energy needed to drive the zero-power terminal, such as powering low-power demodulation and modulation modules, sensors, and memory access. Therefore, the zero-power terminal does not require a traditional battery. The principle of electromagnetic induction states that a change in the magnetic flux through a closed circuit will induce a current in the circuit. In the context of this application, the capacitor C and resistor R... L It can be used to form a closed circuit. After receiving radio frequency (RF), the radio frequency energy harvesting module can generate an induced current and store the generated induced current in a capacitor C to realize the harvesting of electromagnetic wave energy in space.

[0075] 2. Back Scattering communication.

[0076] Figure 4 A schematic diagram of backscatter communication provided for this application.

[0077] like Figure 4 As shown, when the network device acts as a transmitter (TX), it sends a carrier wave to the zero-power device via an amplifier (AMP). Correspondingly, after receiving the carrier wave from the network, the zero-power device uses energy harvested by its energy harvesting module to drive its logic processing module to process the information to be transmitted. It then loads the information to be transmitted onto the received carrier wave through a variable resistor to obtain a reflected signal, which is finally radiated outwards from the antenna. This information transmission process is called backscatter communication. Correspondingly, when the network device acts as a receiver (RX), it can receive the reflected signal sent by the zero-power device via a low-noise amplifier (LNA). Furthermore, in some possible implementations, the AMP and LNA can each be connected to a voltage indicator light, and an emergency light can be installed between the voltage indicator lights connected to the AMP and LNA.

[0078] It should be noted that, Figure 4The backscatter communication principle illustrated here is explained using zero-power devices and network equipment. In reality, any device with backscatter communication capabilities can implement backscatter communication. Backscatter communication and load modulation are inseparable. Load modulation adjusts and controls the circuit parameters of the zero-power terminal's oscillation circuit according to the data flow rhythm, causing the impedance and phase of the zero-power device to change accordingly, thus completing the modulation process. Load modulation techniques mainly include two methods: resistive load modulation and capacitive load modulation.

[0079] Figure 5 The circuit schematic diagram of resistive load modulation provided in the embodiments of this application is shown.

[0080] like Figure 5 As shown, in resistive load modulation, the resistor R L A resistor R3 is connected in parallel, and the resistor R L This can be called a load modulation resistor, with resistance R. L The branch containing resistor R3 is connected or disconnected based on the control of switch S, which can be controlled by a binary data stream. L The switching on and off of the branch containing resistor R3 will cause a change in the circuit voltage. Furthermore, resistor R... L A resistor R2 can be connected in parallel with an inductor L1, and inductor L1 and inductor L2 can form a resonant circuit. Based on this, R... L The switching on and off of the branch containing resistor R3 causes a change in the circuit voltage, which in turn causes a change in the resonant frequency of the resonant circuit, ultimately achieving amplitude shift keying (ASK) modulation. This means that signal modulation and transmission are achieved by adjusting the amplitude of the backscattered signal from the zero-power terminal. Furthermore, inductor L2 can also be connected to capacitor C2, which can be used to convert the change in the resonant frequency of the resonant circuit into a signal for transmission by the antenna. Similarly, in capacitive load modulation, the switching on and off of the branch containing capacitor C1 and resistor R3 can change the resonant frequency of the resonant circuit, achieving frequency shift keying (FSK) modulation. This means that signal modulation and transmission are achieved by adjusting the operating frequency of the backscattered signal from the zero-power terminal.

[0081] Because zero-power terminals modulate the incoming signal using load modulation, they achieve backscatter communication. Therefore, zero-power terminals have significant advantages: 1. The terminal device does not actively transmit signals, but achieves backscatter communication by modulating the incoming wave signal.

[0082] 2. The terminal device does not rely on traditional active power amplifier transmitters, and uses low-power computing units, which greatly reduces hardware complexity.

[0083] 3. Combined with energy harvesting, battery-free communication can be achieved.

[0084] It should be understood that the terminal device in the aforementioned communication system 100 can be a zero-power device (such as a passive terminal, or even a semi-passive terminal), or even a non-zero-power device, such as a regular terminal, but the regular terminal can perform backscatter communication in some cases.

[0085] (2) Encoding method.

[0086] Data transmitted by zero-power terminals can be represented by binary "1" and "0" using different code forms. Zero-power terminals typically use one of the following encoding methods: Non-Return-to-Zero (NRZ) encoding, Manchester encoding, Unipolar RZ encoding, Differential Biphasic (DBP) encoding, Miller encoding, or differential encoding. In simpler terms, it uses different pulse signals to represent 0 and 1.

[0087] 1. Non-Return Zero (NRZ) encoding.

[0088] Inverse non-return-to-zero encoding uses a high level to represent binary "1" and a low level to represent binary "0", as shown in the example below. Figure 6 As shown. Figure 6 The waveform shown has no gaps between symbols and transmits the code throughout the entire symbol time, hence it is called reverse non-return-to-zero encoding.

[0089] 2. Unipolar Return to Zero encoding.

[0090] When a 1 code is transmitted, a positive current is emitted, but the duration of the positive current is shorter than the duration of a symbol, i.e., a narrow pulse is emitted; when a 0 code is transmitted, no current is emitted at all. The unipolar return-to-zero encoding rule is as follows: Figure 7 As shown. Specifically, comparing inverse non-return-to-zero (NRZ) coding and unipolar return-to-zero (NRZ) coding, both are unipolar codes, but the NRZ coding has a 100% duty cycle, while the NRZ coding has a 50% duty cycle.

[0091] 3. Manchester encoding.

[0092] Manchester coding, also known as split-phase coding or binary coding, distinguishes between 1 and 0 using the different phases of voltage transitions. A high-to-low transition represents 1, and a low-to-high transition represents 0. The Manchester coding rules are as follows: Figure 8 As shown.

[0093] 4. Miller encoding.

[0094] Miller encoding is an improved version of Manchester encoding. In Miller encoding, any edge within half a bit cycle represents a binary 1, while a constant level in the next bit cycle represents a binary 0. In other words, Miller encoding uses a level transition at the bit center to represent data 1, and no level transition at the bit center represents data 0. Furthermore, when consecutive binary 0s occur, the level transition occurs at the end of that bit. The Miller encoding rules are as follows: Figure 9 As shown, Miller encoding generates a level alternation at the beginning of a bit cycle, making it easier for the receiver to reconstruct the bit clock.

[0095] 5. Differential biphase (DBP) coding.

[0096] Differential biphase coding uses any edge in half a bit cycle to represent a binary "0", and no edge to represent a binary "1". Furthermore, the voltage levels are inverted at the beginning of each bit cycle. Therefore, the bit clock is relatively easy to reconstruct for the receiver. The rules of differential biphase coding are as follows: Figure 10 As shown.

[0097] 6. Differential coding.

[0098] In differential coding, each binary "1" to be transmitted causes a change in signal level, while for a binary "0", the signal level remains unchanged. The differential coding rules can be summarized as follows: Figure 11 As shown.

[0099] 7. Pulse Interval Encoding (PIE).

[0100] Pulse Interval Encoding (PIE) is a method of transmitting data from a reader to an electronic tag. PIE encoding uses different time intervals between "0" and "1", based on a continuous, fixed-interval pulse. The repetition period of the pulse varies depending on whether it's "0" or "1". Typically, the duration of each binary code is an integer multiple of one clock cycle. There are four PIE encoding symbols: Data 0, Data 1, Start of Data Frame (SOF), and End of Data Frame (EOF), which are 1, 2, 4, and 4 times the reference time interval (Tari), respectively. The definitions of Data 0, Data 1, SOF, and EOF are as follows: Figure 12 As shown, PIE encoding easily defines cases other than data 0 and data 1. To determine the type of transmitted symbol, the electronic tag needs to measure the interval of the high / low pulse transition shown in the figure.

[0101] 8. Bidirectional spatial coding (FM0).

[0102] Biphase spatial coding (FM0) is the encoding method used by electronic tags to transmit data to readers. The rules of FM0 encoding are: the symbol "0" changes level both in the middle and at the edges of the time interval; the symbol "1" changes level only at the edges of the time interval. The rules of FM0 encoding are as follows: Figure 13 As shown. The characteristics of FM0 encoding: The symbol "0" has three transitions, including one transition at the start of the bit time and one transition at the middle of the bit time; the symbol "1" has one transition at the start of the bit time. Examples of FM0 symbols, FM0 symbol sequences, and encodings can be seen as follows. Figure 14 As shown.

[0103] (3) Application scenarios of zero-power communication.

[0104] Zero-power communication (ZHW) has significant advantages such as extremely low cost, zero power consumption, and small size, and can be widely used in various industries, such as logistics, smart warehousing, smart agriculture, energy and power, and industrial internet for vertical industries; it can also be used in personal applications such as smart wearables and smart homes.

[0105] (4) Power supply signal and trigger signal in zero power communication system.

[0106] Zero-power terminals can harvest energy based on power supply signals.

[0107] For example, the power supply signal can be a base station, smartphone, smart gateway, charging station, micro base station, etc., from the perspective of the power supply signal carrier. From the perspective of frequency band, the power supply signal can be a low-frequency, medium-frequency, or high-frequency signal, etc. From the perspective of waveform, the power supply signal can be a sine wave, square wave, triangular wave, pulse, or rectangular wave, etc. The power supply signal can be a continuous wave or a discontinuous wave (i.e., allowing for a certain period of interruption). The power supply signal can be a signal specified in the 3GPP standard. Examples include the Sounding Reference Signal (SRS), Physical Uplink Shared Channel (PUSCH), Physical Random Access Channel (PRACH), Physical Uplink Control Channel (PUCCH), Physical Downlink Control Channel (PDCCH), Physical Downlink Shared Channel (PDSCH), Physical Broadcast Channel (PBCH), etc.

[0108] It should be noted that since the carrier signal sent by the aforementioned network device can also be used to provide energy to zero-power devices, this carrier signal can also be referred to as a power supply signal.

[0109] The zero-power terminal can perform backscatter communication based on the received trigger signal.

[0110] For example, the trigger signal can be used to schedule or trigger zero-power terminal backscatter communication. The trigger signal carries scheduling information from the network device, or the trigger signal is a scheduling signaling or scheduling message sent by the network device. In terms of the trigger signal carrier, the trigger signal can be a base station, smartphone, smart gateway, etc. In terms of frequency band, the trigger signal can be a low-frequency, medium-frequency, or high-frequency signal, etc. In terms of waveform, the trigger signal can be a sine wave, square wave, triangular wave, pulse, rectangular wave, etc. The trigger signal can be a continuous wave or a discontinuous wave (i.e., allowing for a certain period of interruption). The trigger signal can be a signal specified in the 3GPP standard, such as SRS, PUSCH, PRACH, PUCCH, PDCCH, PDSCH, PBCH, etc.; it may also be a new signal.

[0111] It should be noted that the power supply signal and the trigger signal can be one signal or two independent signals; this application does not make any specific limitation on this.

[0112] For example, in cellular networks, since zero-power devices are not battery-powered, they require a power supply signal from the network device to obtain energy for communication. The power supply signal and the trigger signal can be two separate signals or a single signal. Similarly, in RFID technology, the power supply signal and the trigger signal can be a single signal; in cellular passive IoT technology, they can be two independent signals. These two signals do not need to be transmitted in the same frequency band. For example, the network device can continuously or intermittently transmit a power supply signal in a certain frequency band, allowing the zero-power device to harvest energy. After obtaining energy, the zero-power device can perform corresponding communication processes, such as measurement, channel / signal reception, and channel / signal transmission.

[0113] (5) Classification of zero-power terminals.

[0114] Based on the energy source and usage method of zero-power terminals, zero-power terminals can be divided into the following types: 1. Passive zero-power terminal.

[0115] Zero-power devices do not require an internal battery. When a zero-power device is near a network device (such as a reader in a Radio Frequency Identification (RFID) system), it falls within the near-field range of the network device's antenna radiation. Therefore, the zero-power device's antenna generates an induced current through electromagnetic induction, which drives the device's low-power chip circuitry. This enables demodulation of the forward link signal (downlink, from the network device to the zero-power device) and modulation of the backward link signal (uplink, from the zero-power device to the network device). For backscatter links, the zero-power device uses backscattering to transmit signals.

[0116] As can be seen, passive zero-power devices do not require built-in batteries to drive either the forward or reverse link, making them truly zero-power devices.

[0117] Passive zero-power devices do not require batteries, and their radio frequency and baseband circuits are very simple. For example, they do not require low-noise amplifiers (LNAs), power amplifiers (PAs), crystal oscillators, analog-to-digital conversion (ADCs), etc. Therefore, they have many advantages such as small size, light weight, very low price, and long service life.

[0118] Passive zero-power terminals can also support other energy harvesting methods. By harvesting energy from the environment (such as light energy, heat energy, kinetic energy, mechanical energy, etc.), they can obtain energy for the drive circuit and support the terminal device to communicate.

[0119] 2. Semi-passive zero-power terminal.

[0120] Semi-passive zero-power devices do not have conventional batteries installed, but they can use radio frequency (RF) energy harvesting modules to harvest radio wave energy or use energy harvesting modules to harvest energy from the environment (such as solar energy, thermal energy, mechanical vibration energy, etc.), and store the harvested energy in an energy storage unit (such as a capacitor). After obtaining energy, the energy storage unit can drive the low-power chip circuitry of the zero-power device, enabling demodulation of forward link signals and modulation of backward link signals. For backscatter links, the zero-power device uses backscattering to transmit signals.

[0121] As can be seen, semi-passive zero-power devices do not require built-in batteries to drive either the forward or reverse link. Although they use energy stored in capacitors during operation, the energy comes from the radio energy collected by the energy harvesting module, making them a true zero-power device.

[0122] Semi-passive zero-power devices inherit many advantages of passive zero-power devices, and therefore have many advantages such as small size, light weight, very low price, and long service life.

[0123] 3. Active zero-power terminal.

[0124] In some scenarios, zero-power devices can also be active zero-power devices. These terminals can have a built-in battery (a conventional battery, such as a dry cell battery or a rechargeable lithium battery). The battery powers the low-power chip circuitry of the zero-power device, enabling demodulation of the forward link signal and modulation of the backward link signal. However, for the backscatter link, the zero-power device uses backscattering to transmit the signal. Therefore, the zero power consumption of this type of terminal is mainly reflected in the fact that the signal transmission of the backward link does not require the terminal's own power, but instead uses backscattering. Although active zero-power devices use batteries, their power consumption is extremely low due to ultra-low power communication sampling technology, thus significantly improving battery life compared to existing technologies.

[0125] Active zero-power devices use a built-in battery to power the RFID chip, increasing the tag's read / write distance and improving communication reliability. Therefore, they are used in scenarios with relatively high requirements for communication distance and read latency.

[0126] Some zero-power terminals, such as semi-passive zero-power terminals or active zero-power terminals, can have the ability to actively transmit. That is, in addition to communicating through backscattering, the backlink can also communicate through active transmission.

[0127] Furthermore, the business types of zero-power terminals, along with other IoT business types, will primarily focus on upstream services. Therefore, they can also be categorized based on transmitter type, resulting in the following types of zero-power terminals: 1. Zero-power devices based on backscattering.

[0128] These zero-power devices transmit uplink data using the backscattering method described above. These devices do not have an active transmitter for active transmission, but only a backscattering transmitter. Therefore, when this type of terminal transmits data, a network device needs to provide a carrier wave, and the terminal device uses this carrier wave for backscattering to achieve data transmission.

[0129] 2. Zero-power devices based on active transmitters.

[0130] These zero-power devices use active transmitters with active transmission capabilities for uplink data transmission. Therefore, when sending data, these devices can transmit data using their own active transmitters without requiring a carrier wave from network equipment. Suitable active transmitters for zero-power devices include, for example, ultra-low-power ASK or ultra-low-power FSK transmitters. Based on current implementations, these transmitters can reduce overall power consumption to 400-600µW when transmitting a 100µW signal.

[0131] 3. A zero-power device that simultaneously features backscattering and an active transmitter.

[0132] These terminals can support both backscatter and active transmitters. The terminal can determine which uplink signal transmission method to use based on different conditions (such as battery level and available ambient energy) or the scheduling of network devices: whether to use backscatter or an active transmitter for active transmission.

[0133] (6) Cellular passive Internet of Things.

[0134] The cellular Internet of Things (IoT) is booming, with 3GPP standardizing IoT technologies such as Narrow Band Internet of Things (NB-IoT), Machine Type Communication (MTC), and Reduced Capability (RedCap). However, many IoT communication needs in various scenarios still cannot be met using existing technologies. The main reasons are as follows: 1. Harsh communication environment.

[0135] Some IoT scenarios may face extreme environments such as high temperatures, extremely low temperatures, high humidity, high pressure, high radiation, or high-speed movement. Examples include ultra-high-voltage substations, high-speed train track monitoring, environmental monitoring in frigid regions, and industrial production lines. In these scenarios, existing IoT terminals will be unable to function due to the limitations of conventional power supplies. Furthermore, extreme working environments are also detrimental to IoT maintenance, such as battery replacement.

[0136] 2. The need for extremely small terminal form factors.

[0137] In certain IoT communication scenarios, such as food traceability, commodity distribution, and smart wearables, terminals require extremely small sizes for convenient use in these environments. For example, IoT terminals used for commodity management in the distribution process typically use electronic tags, embedded in very small packages. Furthermore, lightweight wearable devices can enhance the user experience while meeting user needs.

[0138] 3. The need for extremely low-cost IoT communication.

[0139] Numerous IoT communication scenarios require IoT terminals to be sufficiently inexpensive to enhance their competitiveness compared to other alternative technologies. For example, in logistics or warehousing, to facilitate the management of large volumes of goods in circulation, IoT terminals can be attached to each item, enabling precise management of the entire logistics process and lifecycle through communication between the terminal and the logistics network. These scenarios necessitate that IoT terminals be priced competitively.

[0140] Therefore, in order to cover these unmet IoT communication needs, it is also necessary to develop ultra-low cost, extremely small size, battery-free / maintenance-free IoT in cellular networks, and zero-power IoT can meet this need.

[0141] It's worth noting that zero-power IoT can also be called Ambientpower-enabled IoT, or simply Ambient IoT. Specifically, an Ambient IoT device refers to an IoT device that uses various forms of environmental energy, such as radio frequency energy, light energy, solar energy, thermal energy, and mechanical energy. An Ambient IoT device may have no energy storage capacity or very limited energy storage capacity (e.g., using a capacitor with a capacitance of tens of microfarads (µF)).

[0142] Ambient IoT devices can be used in at least the following four scenarios: 1. Object recognition. For example, logistics, production line product management, and supply chain management.

[0143] 2. Environmental monitoring. For example, monitoring of temperature, humidity, and harmful gases in the work environment and natural environment.

[0144] 3. Location tracking. For example, indoor location tracking, smart item finding, and production line item location tracking.

[0145] 4. Intelligent control. For example, intelligent control of various appliances in smart homes (turning on and off air conditioners, adjusting temperature), and intelligent control of various facilities in agricultural greenhouses (automatic irrigation, fertilization).

[0146] In summary, zero-power devices are characterized by low complexity and cost, and can be maintenance-free and battery-free. Zero-power devices can be categorized into passive zero-power terminals, semi-passive zero-power terminals, and active zero-power terminals. They obtain energy for communication by harvesting energy from the environment (such as radio frequency energy, light energy, thermal energy, mechanical energy, and kinetic energy). In terms of communication methods, zero-power devices can support backscattering or, more specifically, active transmission. Furthermore, zero-power devices can be deployed at high density and on a large scale at a relatively low cost. Due to their maintenance-free and battery-free characteristics, they have enormous application potential in industrial sensor networks, smart homes, smart agriculture, logistics and warehousing, smart wearables, and healthcare. Zero-power devices can be integrated with sensor devices for environmental monitoring, hazard warnings, and alarms.

[0147] (7) Duplicate code.

[0148] Noise or interference is always unavoidable in communication channels, inevitably leading to information loss during transmission. In other words, source symbols will be distorted during transmission in noisy channels. To reduce this information loss, effective channel coding is required before the source symbols are input into the channel.

[0149] Channel coding can reduce the probability of errors during transmission, thereby improving the reliability of communication systems. The basic idea of ​​channel coding is to add redundant information, which can be used at the receiving end for error detection or correction. Different coding methods have different error detection and correction capabilities.

[0150] Repetition codes are a very simple channel coding method. Essentially, they involve repeatedly transmitting each symbol to be sent, or encoding each original source symbol into multiple identical symbol elements with the same value as the original symbol. For example, the (3,1) binary repetition code is an encoding method that repeats each bit in the original binary sequence three times, that is, encoding "0" as "000" and each "1" as "111".

[0151] The corresponding decoding process can select the codeword with the most "0"s and "1"s in the received codeword for decoding. For example, the decoding of the (3,1) binary repeat codeword can decode the received "000", "001", "010", and "100" as "0", and the received "011", "101", "110", and "111" as "1". In this way, any bit error that occurs during transmission can be automatically corrected through decoding for each codeword.

[0152] (8) Modulation method of zero power communication.

[0153] Zero-power devices, when communicating with network devices using either backscatter or active transmission, do not generate a carrier wave themselves. Instead, they backscatter the incoming signal using modulation methods such as On-Off Keying (OOK), Amplitude Shift Keying (ASK), Phase Shift Keying (PSK), and Frequency Shift Keying (FSK), resulting in relatively poor data transmission performance. Similarly, zero-power devices supporting active transmission, due to their simple structure and pursuit of low-power communication, typically use modulation methods like OOK, ASK, PSK, and FSK for signal transmission. However, the signal transmission power is generally low, leading to poor data transmission performance as well.

[0154] Figure 15This is a schematic diagram of the OOK modulation method provided in the embodiments of this application.

[0155] like Figure 15 As shown, for the OOK modulation method, the zero-power device modulates the encoded baseband data stream onto the signal received by the zero-power device to obtain a reflected signal, and then sends the reflected signal to the network device. The signal received by the zero-power device can be a high-frequency signal or a specific carrier signal.

[0156] It is worth noting that zero-power devices (or Ambient IoT devices) have a simple structure, low complexity, and low cost. They can harvest energy from the environment (such as light energy, heat energy, radio frequency energy, mechanical energy, kinetic energy, etc.) to obtain the energy required for communication. Zero-power devices can be devices that support at least one of the following communication methods: backscatter communication method and active transmission communication method.

[0157] However, due to the inherent characteristics of zero-power devices, they do not employ complex modulation methods during communication. When transmitting signals to network devices, whether using backscattering or active transmission, data transmission performance is generally worse than that of devices in existing NR systems. Without channel coding, the presence of erroneous data bits in the transmitted data packets can lead to data transmission failures and retransmissions. For zero-power devices, data transmission performance should be improved as much as possible while minimizing the number of retransmissions. Therefore, this application provides a wireless communication method and a zero-power device that can improve the data transmission performance of zero-power devices.

[0158] Specifically, this application involves repeatedly encoding the first sequence to be encoded, the bits in the first sequence, the sequence obtained after sequence mapping, and the bits in the sequence obtained after sequence mapping, thereby improving the data transmission performance of zero-power devices. Optionally, this repeated encoding can support different numbers of repetitions. The number of repetitions used in the repeated encoding can be selected from multiple repetition numbers, which can be configured by the network device and adapted to different scenarios to achieve a trade-off between data transmission error probability and data rate. Optionally, the first sequence can also be a bit sequence with additional parity check bits and / or CRC check bits, so that the receiving device can perform error detection and correction on the received data, further improving the data transmission performance of zero-power devices. Optionally, introducing interleaving and / or first encoding processes for the second sequence can further improve the data transmission performance of zero-power devices.

[0159] Figure 16 This is a schematic flowchart of the wireless communication method 200 provided in the embodiments of this application.

[0160] It should be noted that the wireless communication method 200 can be executed by a transmitting device, which can be a network device or a terminal device. In other words, this wireless communication method is applicable to wireless communication between a transmitting device and a receiving device (including at least one of the following: a terminal device sending data to a network device, a network device sending data to a terminal device, and a terminal device sending data to another terminal device). For example, the terminal device can be a zero-power device, which can be a device supporting at least one of the following communication methods: backscatter communication and active transmission communication. For example, a zero-power device can be a traditional NR terminal with a backscatter communication module loaded or integrated. For ease of description, the method 200 will be described below using a zero-power device as the execution subject.

[0161] like Figure 16 As shown, the wireless communication method 200 may include: S210, the zero-power device repeatedly encodes the first sequence to be encoded to obtain the second sequence.

[0162] For example, the first sequence may include a sequence of data bits.

[0163] The data bit sequence can be communication data sent from a zero-power device to a network device, or communication data sent from a zero-power device to other terminal devices.

[0164] Of course, the first sequence may also include other information, which is not specifically limited in this application.

[0165] For example, the first sequence may also include information for verifying the data bit sequence. This information includes, but is not limited to, Cyclic Redundancy Check (CRC) bits and parity check bits. The information used to verify the data bit sequence may be for verifying the entire data bit sequence, or it may include information for verifying multiple parts of the data bit sequence separately.

[0166] For example, the first sequence may also include a cyclic prefix, which is used by the receiving device to identify or locate the starting position of the data bit sequence when receiving the data bit sequence.

[0167] In this embodiment, the zero-power device performs repeated encoding based on the first sequence to be encoded to obtain the second sequence; that is, based on the first sequence, redundant information is increased by introducing repeated encoding, so that when the receiving end decodes the first sequence based on the second sequence, it can perform error correction and error detection on the decoding result of the first sequence, thereby improving the data transmission performance of the zero-power device.

[0168] It should be noted that zero-power devices have a simple structure, low complexity, and low cost. They can harvest energy from the environment (such as light, heat, radio frequency, mechanical, and kinetic energy) to obtain the energy needed for communication. Zero-power devices can support at least one of the following communication methods: backscatter communication and active transmission communication. Without channel coding, the presence of erroneous data bits in the transmitted data packets will lead to data transmission failure and retransmission. For zero-power devices, data transmission performance should be improved as much as possible while minimizing the number of retransmissions. Therefore, considering that the repetitive coding process is simple and has low complexity, it can improve the data transmission performance of zero-power devices as much as possible without increasing their complexity.

[0169] Furthermore, zero-power devices can also be called "Ambient power-enabled IoT devices" or "Ambient IoT devices." Specifically, an Ambient IoT device refers to an IoT device that uses various types of ambient energy, such as radio frequency energy, light energy, solar energy, thermal energy, and mechanical energy. An Ambient IoT device may have no energy storage capacity or may have very limited energy storage capacity (such as using a capacitor with a capacitance of tens of microfarads (µF)).

[0170] In some embodiments, S210 may include: The zero-power device repeatedly encodes the bit values ​​in the first sequence to obtain the second sequence.

[0171] For example, a zero-power device can repeatedly encode the values ​​of bits in the first sequence based on the number of repetitions (also known as redundancy) of the repeated encoding to obtain the second sequence.

[0172] For example, assuming the number of repetitions of the repetition encoding is N, the zero-power device can repetitively encode the bit values ​​in the first sequence according to Table 1: Table 1

[0173] As shown in Table 1, the zero-power device encodes the bits in the first sequence according to the redundancy N, that is, each bit is repeated N times, encoding "0" as N "0"s and "1" as N "1"s.

[0174] For example, assume that the first sequence is "011" and N = 5, then the second sequence is "000001111111111".

[0175] For the receiving device, the receiving device can perform decoding based on the number of "0"s and "1"s in each codeword (for example, the N bits obtained by repeating encoding 1 bit in the first sequence). For example, for the second sequence to be decoded, the receiving device decodes every 5 consecutive bits to obtain the bits in the first sequence. Typically, the idea of "the minority obeys the majority" can be adopted, and the value with the larger number is used as the decoding result of the codeword. The N bits in each codeword include N1 "1"s and N2 "0"s, where N = N1 + N2: if N1 > N2, the codeword is decoded as "1"; if N1 < N2, the codeword is decoded as "0"; if N1 = N2, it can be judged as "1" or "0" according to a preset rule. Further, based on other information, such as CRC bits or parity check bits, the judgment in the case of N1 = N2 can be made. For example, the receiving device can make a judgment in the case of N1 = N2 based on parity check bits. Specifically, assume that in the first codeword N1 = N2, then the receiving device can determine the decoding result of the first codeword based on the decoded codeword used to generate the parity check bits and the value of this parity check code. Again, the receiving device can make a judgment in the case of N1 = N2 based on CRC bits. Specifically, assume that in the first codeword N1 = N2, then the receiving device can determine the decoding result of the first codeword based on the decoded codeword used to generate the CRC bits and the value of this CRC bit.

[0176] In this embodiment, when the zero-power device performs repeated encoding on the value of the bits in the first sequence, the receiving device has bit-level error correction ability, that is, when there is an error in the repeated code corresponding to a bit, the receiving device can correctly judge the original bit corresponding to the codeword, which can improve the data transmission performance of the zero-power device.

[0177] In some embodiments, S210 may include: The zero-power device performs repeated encoding on the first sequence to obtain the second sequence.

[0178] Exemplarily, the zero-power device can perform repeated encoding on the first sequence based on the number of repetitions of the repeated encoding to obtain the second sequence.

[0179] Exemplarily, assume that the number of repetitions of the repeated encoding (also called redundancy) is N, and the zero-power device can perform repeated encoding on the first sequence to obtain the second sequence formed by N consecutive first sequences.

[0180] For example, assume that the first sequence is "011" and N = 5, then the second sequence is "011011011011011".

[0181] For the receiving device, the receiving device can decode according to the number of "0"s and "1"s in each codeword (for example, the N bits obtained by repeating the encoding of 1 bit in the first sequence). For example, for the second sequence to be decoded, the receiving device can divide the second sequence into 5 "011"s based on the repetition times, and then decode the first bit (i.e., "0") in the first sequence based on the first bit (i.e., 5 "0"s) in the 5 "011"s. Typically, the receiving device can adopt the idea of "the minority obeys the majority" and take the value with the larger number as the decoding result of the codeword. The N bits in each codeword include N1 "1"s and N2 "0"s, where N = N1 + N2: if N1 > N2, the codeword is decoded as "1"; if N1 < N2, the codeword is decoded as "0"; if N1 = N2, it can be judged as "1" or "0" according to a preset rule. Further, the decision in the case of N1 = N2 can be made based on other information, such as CRC bits or parity check bits. For example, the receiving device can make a decision in the case of N1 = N2 based on parity check bits. Specifically, assume that in the first codeword N1 = N2, then the receiving device can determine the decoding result of the first codeword based on the decoded codeword used to generate the parity check bits and the value of the parity check code. Another example is that the receiving device can make a decision in the case of N1 = N2 based on CRC bits. Specifically, assume that in the first codeword N1 = N2, then the receiving device can determine the decoding result of the first codeword based on the decoded codeword used to generate the CRC bits and the value of the CRC bits.

[0182] In this embodiment, when the zero-power device performs repeated encoding on the first sequence, the receiving device has bit-level error correction ability, that is, when there is an error in the repeated code corresponding to a bit, the receiving device can correctly determine the original bit corresponding to the codeword, which can improve the data transmission performance of the zero-power device.

[0183] In some embodiments, if the number of bits of the first sequence is K and the repetition times of the repeated encoding is N, then the number of bits of the second sequence is N×K; where N and K are both positive integers.

[0184] Exemplarily, when the zero-power device performs repeated encoding on the bits in the first sequence, if the number of bits of the first sequence is K and the repetition times of the repeated encoding is N, then the number of bits of the second sequence is N×K. Or, when the zero-power device performs repeated encoding on the first sequence, if the number of bits of the first sequence is K and the repetition times of the repeated encoding is N, then the number of bits of the second sequence is N×K.

[0185] In some embodiments, S210 may include: The zero-power device determines at least one third sequence based on the first sequence; The zero-power device repeatedly encodes the at least one third sequence to obtain the second sequence.

[0186] For example, when a zero-power device performs repeated encoding based on the first sequence, it may first map the first sequence to at least one third sequence, and then perform repeated encoding based on the at least one third sequence to obtain a second sequence.

[0187] In some embodiments, the zero-power device determines the third sequence based on the values ​​of bits in the first sequence.

[0188] For example, the zero-power device first performs sequence mapping on the value of each bit in the first sequence to obtain at least one third sequence, and then performs repeated encoding based on the sequence formed by the at least one third sequence to obtain a second sequence.

[0189] In some embodiments, the zero-power device acquires a first mapping relationship; wherein the first mapping relationship includes a correspondence between a first value and a first candidate sequence and a correspondence between a second value and a second candidate sequence; if the first bit in the first sequence is the first value, then the first candidate sequence is determined as the third sequence; if the first bit is the second value, then the second candidate sequence is determined as the third sequence.

[0190] For example, the first value is 0 and the second value is 1.

[0191] In other words, the zero-power device obtains a first mapping relationship; wherein, the first mapping relationship includes the correspondence between 0 and the first candidate sequence and the correspondence between 1 and the second candidate sequence; if the value of the first bit in the first sequence is 0, then the first candidate sequence is determined as the third sequence; if the value of the first bit is 1, then the second candidate sequence is determined as the third sequence.

[0192] For example, the first value is 1 and the second value is 0.

[0193] In other words, the zero-power device obtains a first mapping relationship; wherein, the first mapping relationship includes the correspondence between 1 and the first candidate sequence and the correspondence between 0 and the second candidate sequence; if the value of the first bit in the first sequence is 1, then the first candidate sequence is determined as the third sequence; if the value of the first bit is 0, then the second candidate sequence is determined as the third sequence.

[0194] For example, the first mapping relationship can be configured by the network device or be predefined, or it can be determined by the zero-power device or determined through negotiation between the zero-power device and the network device. Furthermore, the first mapping relationship can also be a mapping relationship determined by the zero-power device based on multiple mapping relationships from the network device or predefined mapping relationships. For instance, the first mapping relationship can be a mapping relationship among the multiple mapping relationships that matches the number of bits (or the information type, etc.) of the first sequence. The information type of the first sequence includes, but is not limited to, data type and control type.

[0195] In some embodiments, the first candidate sequence and the second candidate sequence have different values ​​at the same bit position.

[0196] For example, the first candidate sequence and the second candidate sequence have different values ​​at each bit position.

[0197] For example, the number of bits in the first candidate sequence and the second candidate sequence is greater than or equal to 2.

[0198] For example, the number of bits in the first candidate sequence and the second candidate sequence can be 2, and the values ​​of the first candidate sequence and the second candidate sequence at the first bit position and the second bit position are different.

[0199] For example, the first mapping relationship can be as shown in Table 2 below: Table 2

[0200] As shown in Table 2, the zero-power device performs sequence mapping on the bits in the first sequence according to Table 2, that is, mapping "1" to "10" and "0" to "01".

[0201] For example, the number of bits in the first candidate sequence and the second candidate sequence can be 4, and the values ​​of the first candidate sequence and the second candidate sequence at the first bit position, the second bit position, the third bit position and the fourth bit position are all different.

[0202] For example, the first mapping relationship can be as shown in Table 3 below: Table 3

[0203] As shown in Table 3, the zero-power device performs sequence mapping on the bits in the first sequence according to Table 3, that is, mapping "1" to "1001" and "0" to "0110".

[0204] For example, the first mapping relationship can be as shown in Table 4 below: Table 4

[0205] As shown in Table 4, the zero-power device performs sequence mapping on the bits in the first sequence according to Table 4, that is, mapping "1" to "1110" and "0" to "0001".

[0206] Of course, Tables 2 to 4 are merely examples of this application and should not be construed as limiting this application. For example, in other alternative embodiments, the third sequence can also be a sequence of other bit lengths or sequences of other values. For example, when both the first candidate sequence and the second candidate sequence have 3 bits, the first candidate sequence and the second candidate sequence can have multiple possible cases. For example, if the first candidate sequence is 001, then the second candidate sequence is 110. Another example is that the first candidate sequence is 010 and the second candidate sequence is 101. Another example is that the first candidate sequence is 100 and the second candidate sequence is 011. Another example is that the first candidate sequence is 011 and the second candidate sequence is 100. Another example is that the first candidate sequence is 101 and the second candidate sequence is 010. Another example is that the first candidate sequence is 110 and the second candidate sequence is 001. Another example is that the first candidate sequence is 000 and the second candidate sequence is 111. For example, the first candidate sequence is 111, and the second candidate sequence is 000.

[0207] For repetitive encoding, assume the first mapping relationship is as shown in Table 2. For example, if the first sequence is "0110", when the zero-power device performs repetitive encoding based on the first sequence to be encoded, it can first map the "0" in the first sequence to "01" and the "1" in the first sequence to "10" to obtain at least one third sequence. That is, the at least one third sequence includes the first "01", the first "10", the second "10" and the second "01". Then, it can perform repetitive encoding based on the sequence formed by the at least one third sequence (that is, the sequence formed by the first "01", the first "10", the second "10" and the second "01", i.e., "01 10 10 01"). That is, the zero-power device can perform repetitive encoding based on "01 10 1001" to obtain the second sequence.

[0208] In some embodiments, the zero-power device first divides the first sequence into at least one coded group; then, based on the value of each coded group in the at least one coded group, it determines the third sequence.

[0209] For example, each of the at least one encoded group comprises one bit or a plurality of consecutive bits.

[0210] In other words, the zero-power device performs sequence mapping on each bit or each consecutive set of bits in the first sequence as an encoding group to obtain at least one third sequence, and then performs repeated encoding on the sequence formed by the at least one third sequence to obtain a second sequence.

[0211] In some embodiments, the zero-power device first obtains a second mapping relationship; wherein the second mapping relationship includes a correspondence between multiple values ​​and multiple candidate sequences; the multiple values ​​include the value of each coded group; then, the zero-power device determines the candidate sequence corresponding to the value of each coded group as the third sequence.

[0212] For example, each of the plurality of values ​​may include a single bit value or a series of consecutive bits.

[0213] For example, the second mapping relationship can be configured by the network device or be predefined, or it can be determined by the zero-power device or determined through negotiation between the zero-power device and the network device. Furthermore, the second mapping relationship can also be a mapping relationship determined by the zero-power device based on a network device or a predefined set of mapping relationships. For instance, the second mapping relationship can be a mapping relationship among the multiple mapping relationships that matches the number of bits (or the information type, etc.) of the first sequence. The information type of the first sequence includes, but is not limited to, data type and control type.

[0214] In some embodiments, the number of the plurality of candidate sequences is positively correlated with the number of bits in each of the plurality of values.

[0215] For example, the larger the number of bits in each of the multiple values, the larger the number of candidate sequences; in other words, the smaller the number of bits in each of the multiple values, the smaller the number of candidate sequences.

[0216] For example, assuming that the number of bits for each of the multiple values ​​is P, then the number of the multiple candidate sequences is 2. P Where P is a positive integer.

[0217] For example, assuming that each of the multiple values ​​has 2 bits, the multiple candidate sequences can have 4 bits.

[0218] For example, the second mapping relationship can be as shown in Table 5 below: Table 5

[0219] As shown in Table 5, the zero-power device divides the bits in the first sequence into at least one encoded group with a bit count of 2 according to Table 5, and performs sequence mapping on each encoded group based on Table 5, that is, mapping "00" to "0101", mapping "01" to "0110", mapping "10" to "1001", and mapping "11" to "1010".

[0220] Of course, Table 5 is merely an example of this application and should not be construed as a limitation thereof. For example, in other alternative embodiments, the candidate sequence may also be a sequence of other bit lengths or other values. For example, a 2-bit coded block may be mapped to a 3-bit third sequence.

[0221] For repetitive encoding, assume the second mapping relationship is as shown in Table 5. When the zero-power device performs repetitive encoding based on the first sequence to be encoded, it can first divide the first sequence into at least one encoding group, and map the encoding group with a value of "00" to "0101", the encoding group with a value of "01" to "0110", the encoding group with a value of "10" to "1001", and the encoding group with a value of "11" to "1010", so as to obtain at least one third sequence. For example, if the first sequence is "0110", the zero-power device divides "0110" into two encoding groups, namely "01" and "10", and then performs sequence mapping on "01" and "10" to obtain the at least one third sequence including "0110" and "1001". Then, it can perform repeated encoding based on the sequence formed by the at least one third sequence (i.e., the sequence formed by "0110" and "1001", i.e. "0110 1001"). That is, the zero-power device can perform repeated encoding based on "0110 1001" to obtain the second sequence.

[0222] In some embodiments, the zero-power device repeatedly encodes the values ​​of the bits in the third sequence to obtain the second sequence.

[0223] For example, a zero-power device may repeatedly encode the bit values ​​in a sequence formed by the at least one third sequence based on the number of repetitions of the repeated encoding (also known as redundancy) to obtain the second sequence.

[0224] For example, assuming the number of repetitions of the repetition encoding is N, the zero-power device can repeatedly encode the bit values ​​in the sequence formed by the at least one third sequence according to Table 6 to obtain the second sequence.

[0225] Table 6

[0226] As shown in Table 6, the zero-power device encodes the bits in the sequence formed by the at least one third sequence according to the redundancy N, that is, each bit is repeated N times, "0" is encoded as N "0"s, and "1" is encoded as N "1"s.

[0227] As an example, assuming the first sequence is "0110", each bit in the first sequence is mapped to a third sequence according to Table 2 above, thus forming at least one third sequence. Specifically, the at least one third sequence includes: a first "01", a first "10", a second "10", and a second "01", i.e., "01 10 10 01". Based on this, a zero-power device can obtain a second sequence by repeatedly encoding the bit values ​​in the sequence formed by the at least one third sequence. For example, if the number of repetitions N=5, then the second sequence is: “00000 11111 11111 00000 11111 00000 00000 11111”.

[0228] As another example, assuming the first sequence is "0110", the zero-power device divides "0110" into two coded groups, namely "01" and "10", and then maps "01" and "10" according to Table 5 to obtain at least one third sequence, which includes "0110" and "1001", i.e., "0110 1001". Based on this, the zero-power device can obtain a second sequence by repeatedly encoding the bit values ​​in the sequence formed by the at least one third sequence. For example, if the number of repetitions N=5, then the second sequence is: “00000 11111 11111 00000 11111 00000 00000 11111”.

[0229] For the receiving device, the receiving device can perform decoding according to the number of "0"s and "1"s in each codeword (for example, 5 bits obtained by repeating the encoding of 1 bit in the sequence formed by the at least one third sequence). For example, for the second sequence to be decoded, the receiving device decodes every 5 consecutive bits to obtain the bits in the sequence formed by the at least one third sequence. Typically, the idea of "the minority obeys the majority" can be adopted, and the value with the larger number is used as the decoding result of the codeword. The N bits in each codeword include N1 "1"s and N2 "0"s, where N = N1 + N2: if N1 > N2, the codeword is decoded as "1"; if N1 < N2, the codeword is decoded as "0"; if N1 = N2, it can be judged as "1" or "0" according to a preset rule. Further, based on other information, such as CRC check bits or parity check bits, the judgment in the case of N1 = N2 can be made. For example, the receiving device can make a judgment in the case of N1 = N2 based on the parity check bits. Specifically, assuming that N1 = N2 in the first codeword, the receiving device can determine the decoding result of the first codeword based on the decoded codeword used to generate the parity check bits and the value of the parity check code. Another example is that the receiving device can make a judgment in the case of N1 = N2 based on the CRC bits. Specifically, assuming that N1 = N2 in the first codeword, the receiving device can determine the decoding result of the first codeword based on the decoded codeword used to generate the CRC bits and the value of the CRC bits. Further, after the receiving device decodes the sequence formed by the at least one third sequence, it can map the third sequence to bits (such as the first mapping relationship) or map the third sequence to an encoded packet (such as the second mapping relationship) according to the mapping relationship involved above, and then obtain the first sequence formed by bits or encoded packets. For example, in one implementation, the zero-power device can calculate the Hamming distance between the third sequence and the candidate sequences corresponding to "1" and "0", and select the value corresponding to the candidate sequence with a smaller Hamming distance as the value of the bit in the first sequence.

[0230] In this embodiment, when the zero-power device performs repeated encoding on the values of the bits in the sequence formed by the at least one third sequence, the receiving device has bit-level error correction ability, that is, when there is an error in the repeated code corresponding to a bit, the receiving device can correctly judge the original bit corresponding to the codeword, which can improve the data transmission performance of the zero-power device.

[0231] In some embodiments, the zero-power device performs repeated encoding on the third sequence to obtain the second sequence.

[0232] Exemplarily, the zero-power device can perform repeated encoding on each of the at least one third sequences based on the number of repeated encodings to obtain the second sequence.

[0233] For example, assuming the number of repetitions (also known as redundancy) of the repeated encoding is N, the zero-power device can repeatedly encode each third sequence to obtain a second sequence. Each third sequence is repeated N times compared to the first sequence.

[0234] For example, assuming the number of repetitions of the repeated encoding is N, the zero-power device can perform sequence mapping according to Tables 2 to 4 to obtain at least one third sequence, and repeatedly encode the third sequence in the sequence formed by the at least one third sequence to obtain the second sequence.

[0235] For example, zero-power devices can perform sequence mapping and repetition encoding according to Table 7: Table 7

[0236] As shown in Table 7, the zero-power device performs sequence mapping on the bits in the first sequence according to Table 7, that is, mapping "1" to "10" and repeatedly encoding it as N "10", mapping "0" to "01" and repeatedly encoding it as N "01".

[0237] For example, zero-power devices can perform sequence mapping and repetition encoding according to Table 8: Table 8

[0238] As shown in Table 8, the zero-power device performs sequence mapping on the bits in the first sequence according to Table 8, that is, mapping "1" to "1001" and repeating it to N "1001", mapping "0" to "0110" and repeating it to N "0110".

[0239] For example, zero-power devices can perform sequence mapping and repetition encoding according to Table 9: Table 9

[0240] As shown in Table 9, the zero-power device performs sequence mapping on the bits in the first sequence according to Table 9, that is, mapping "1" to "1110" and repeating it to N "1110", mapping "0" to "0001" and repeating it to N "0001".

[0241] As an example, assuming the first sequence is "0110", each bit in the first sequence is mapped to a third sequence according to Table 2 above, thus forming at least one third sequence. Specifically, the at least one third sequence includes: a first "01", a first "10", a second "10", and a second "01", i.e., "01 10 10 01". Based on this, a zero-power device can obtain a second sequence by repeatedly encoding the third sequence in the sequence formed by the at least one third sequence. For example, if the number of repetitions N=5, then the second sequence is: “0101010101 1010101010 1010101010 0101010101”.

[0242] As another example, assuming the first sequence is "0110", the zero-power device divides "0110" into two coded groups, namely "01" and "10", and then maps "01" and "10" according to Table 5 to obtain at least one third sequence, which includes "0110" and "1001", i.e., "0110 1001". Based on this, the zero-power device can obtain a second sequence by repeatedly encoding the third sequence in the sequence formed by the at least one third sequence. For example, if the number of repetitions N=5, then the second sequence is: “01100110011001100110 100110011001100110011001”.

[0243] For the receiving device, the receiving device can perform decoding according to the number of "0"s and "1"s in the codeword of each third sequence (for example, 5 bits obtained after repeating and encoding 1 bit in the sequence formed by the at least one third sequence). For example, for the second sequence to be decoded, the receiving device decodes every 5 consecutive third sequences to obtain a third sequence. For example, when the receiving device decodes "0101010101", it divides it into 5 "01"s, and then decodes the first bit (i.e., "0") in this third sequence based on the first bit in the 5 "01"s (i.e., 5 "0"s). Typically, the receiving device can adopt the idea of "the minority obeys the majority" and use the value with the larger number as the decoding result of the codeword. The N bits in each codeword include N1 "1"s and N2 "0"s, where N = N1 + N2: If N1 > N2, the codeword is decoded as "1"; if N1 < N2, the codeword is decoded as "0"; if N1 = N2, it can be judged as "1" or "0" according to a preset rule. Further, based on other information, such as CRC check bits or parity check bits, the decision in the case of N1 = N2 can be made. For example, the receiving device can make a decision in the case of N1 = N2 based on parity check bits. Specifically, assuming N1 = N2 in the first codeword, the receiving device can determine the decoding result of the first codeword based on the decoded codeword used to generate the parity check bit and the value of this parity check code. Another example is that the receiving device can make a decision in the case of N1 = N2 based on CRC bits. Specifically, assuming N1 = N2 in the first codeword, the receiving device can determine the decoding result of the first codeword based on the decoded codeword used to generate the CRC bit and the value of this CRC bit. Further, after the receiving device decodes the sequence formed by the at least one third sequence, it can map the third sequence to a bit according to the first mapping relationship involved above (such as the mapping relationship shown in Table 2) or map the third sequence to an encoded packet according to the second mapping relationship involved above (such as the mapping relationship shown in Table 5), thereby obtaining the first sequence formed by bits or encoded packets. For example, in one implementation, the zero-power device can calculate the Hamming distance between the third sequence and the candidate sequences corresponding to "1" and "0", and select the value corresponding to the candidate sequence with a smaller Hamming distance as the value of the bit in the first sequence.

[0244] In this embodiment, when the zero-power device performs repeated encoding on each of the at least one third sequence, the receiving device has bit-level error correction ability, that is, when there is an error in the repeated code corresponding to a bit, the receiving device can correctly determine the original bit corresponding to the codeword, which can improve the data transmission performance of the zero-power device.

[0245] In some embodiments, the zero-power device repeatedly encodes the sequence formed by the at least one third sequence to obtain the second sequence.

[0246] For example, a zero-power device may repeatedly encode a sequence formed by the at least one third sequence based on the number of repetitions of the repeated encoding to obtain a second sequence.

[0247] For example, assuming the number of repetitions (also known as redundancy) of the repeated encoding is N, a zero-power device can repeatedly encode a sequence formed by the at least one third sequence to obtain a second sequence. This second sequence is repeated N times by the sequence formed by the at least one third sequence compared to the first sequence.

[0248] As an example, assuming the first sequence is "0110", each bit in the first sequence is mapped to a third sequence according to Table 2 above, thus forming at least one third sequence. Specifically, the at least one third sequence includes: a first "01", a first "10", a second "10", and a second "01", i.e., "01 10 10 01". Based on this, a zero-power device can obtain a second sequence by repeatedly encoding the sequence formed by the at least one third sequence. For example, if the number of repetitions N=5, then the second sequence is: “01101001 01101001 01101001 01101001 01101001”.

[0249] As another example, assuming the first sequence is "0110", the zero-power device divides "0110" into two coded groups, namely "01" and "10", and then maps "01" and "10" according to Table 5 to obtain at least one third sequence, which includes "0110" and "1001", i.e., "0110 1001". Based on this, the zero-power device can obtain a second sequence by repeatedly encoding the sequence formed by the at least one third sequence. For example, if the number of repetitions N=5, then the second sequence is: “01101001 01101001 01101001 01101001 01101001”.

[0250] For the receiving device, the receiving device can perform decoding according to the number of "0"s and "1"s in each codeword (for example, 1 bit in the sequence formed by the at least one third sequence, and 5 bits obtained after repeatedly encoding the sequence formed by the at least one third sequence). For example, for the second sequence to be decoded, when the receiving device performs decoding, it divides it into five "01101001", and then decodes the first bit in the sequence formed by the at least one third sequence (i.e., "0") based on the first bit in the five "01101001" (i.e., five "0"s). Typically, the receiving device can adopt the idea of "the minority obeys the majority" and take the value with the larger number as the decoding result of the codeword. The N bits in each codeword include N1 "1"s and N2 "0"s, where N = N1 + N2: If N1 > N2, the codeword is decoded as "1"; if N1 < N2, the codeword is decoded as "0"; if N1 = N2, it can be judged as "1" or "0" according to a preset rule. Further, based on other information, such as CRC check bits or parity check bits, the decision in the case of N1 = N2 can be made. For example, the receiving device can make a decision in the case of N1 = N2 based on parity check bits. Specifically, assuming N1 = N2 in the first codeword, the receiving device can determine the decoding result of the first codeword based on the decoded codeword used to generate the parity check bits and the value of the parity check code. Another example is that the receiving device can make a decision in the case of N1 = N2 based on CRC bits. Specifically, assuming N1 = N2 in the first codeword, the receiving device can determine the decoding result of the first codeword based on the decoded codeword used to generate the CRC bits and the value of the CRC bits. Further, after the receiving device decodes the sequence formed by the at least one third sequence, it can map the third sequence to bits according to the first mapping relationship involved above (such as the mapping relationship shown in Table 2) or map the third sequence to coding groups according to the second mapping relationship involved above (such as the mapping relationship shown in Table 5), thereby obtaining the first sequence formed by bits or coding groups. For example, in one implementation, the zero-power device can calculate the Hamming distance between the third sequence and the candidate sequences corresponding to "1" and "0", and select the value corresponding to the candidate sequence with the smaller Hamming distance as the value of the bits in the first sequence.

[0251] In this embodiment, when the zero-power device repeatedly encodes the at least one third sequence, the receiving device has bit-level error correction ability, that is, when there is an error in the repeated code corresponding to a bit, the receiving device can correctly determine the original bit corresponding to the codeword, which can improve the data transmission performance of the zero-power device.

[0252] In some embodiments, if the number of bits in the first sequence is K, the number of repetitions of the repeated encoding is N, and the number of bits in each of the at least one third sequence is X, then the number of bits in the second sequence is N×X×K; where N, X, and K are all positive integers.

[0253] For example, when a zero-power device maps each bit or multiple consecutive bits in a first sequence to a third sequence, if the number of bits in the first sequence is K, the number of repetitions of the repeated encoding is N, and the number of bits in each sequence of the at least one third sequence is X, then the number of bits in the second sequence is N×X×K; where N, X, and K are all positive integers.

[0254] In some embodiments, the third sequence matches any of the following encoding schemes: Non-Return-to-Zero (NRZ) coding, Manchester coding, Unipolar RZ coding, Miller coding, Differential Biphasic (DBP) coding, Differential coding, Pulse Interval coding, and Bidirectional Spatial coding.

[0255] For example, when the third sequence matches the Manchester code, the first mapping relationship can be the mapping relationship shown in Table 2, or the second mapping relationship can be the mapping relationship shown in Table 5 above.

[0256] For example, when the third sequence matches the RZ code, the first mapping relationship can be the mapping relationship shown in Table 3 above.

[0257] Of course, in other alternative embodiments, the third sequence may also be matched with other encoding methods, and this application does not specifically limit this.

[0258] For example, the third sequence could be a sequence that matches the encoding in the wake-up mechanism.

[0259] The encoding processing for low data rate (LDR) and high data rate (HDR) Wake-Up Radio (WUR) is shown in the table below: Table 10

[0260] As shown in Table 10, for WUR LDR, the encoded bit is "1010" when the input bit is "0" and "0101" when the input bit is "1"; for WUR HDR, the encoded bit is "10" when the input bit is "0" and "01" when the input bit is "1". In the context of the scheme provided in this application, this first mapping relationship can be a mapping relationship between input bits and encoded bits under WUR LDR or WUR HDR. For example, if the first mapping relationship can be a mapping relationship between input bits and encoded bits under WUR LDR, if the value of the first bit in the first sequence is "0", then "1010" is determined as the third sequence; if the value of the first bit is "1", then "0101" is determined as the third sequence. For example, when the first mapping relationship can be the mapping relationship between input bits and encoded bits under WUR HDR, if the value of the first bit in the first sequence is "0", then "10" is determined as the third sequence; if the value of the first bit is "1", then "01" is determined as the third sequence.

[0261] In some embodiments, the first sequence includes a fourth sequence and the CRC bits of the fourth sequence.

[0262] For example, the CRC bit is determined based on the fourth sequence.

[0263] For example, the CRC bit consists of one or more consecutive bits.

[0264] For example, a zero-power device appends M CRC bits to a fourth sequence of Y bits (e.g., Y is a positive integer). (For example, the M CRC bits can be appended at one position in the fourth sequence, or different bits from the M CRC bits can be appended at different positions in the first sequence.) This results in a sequence of length Y+M bits after the CRC bit appending (i.e., the first sequence mentioned above). Then, this first sequence is encoded based on a redundancy of N to obtain an encoded sequence of (Y+M)×N bits (i.e., the second sequence mentioned above). Next, the second sequence is modulated to obtain a modulated signal, which is then transmitted. The modulation method for the second sequence includes, but is not limited to, OOK, ASK, PSK, and FSK modulation.

[0265] Accordingly, the receiver demodulates the received signal to obtain a second sequence of (Y+M)×N bits. Then, through the decoding process corresponding to the repeating code, it obtains a first sequence of length Y+M bits. This first sequence is a bit sequence with CRC bits appended to the fourth sequence. The receiver performs CRC verification based on the CRC polynomial used in CRC encoding. For example, if the CRC check passes, the Y-bit fourth sequence is considered correctly received; otherwise, it is considered incorrectly received, and the fourth sequence data needs to be retransmitted.

[0266] In this embodiment, by introducing the CRC bit, the receiver can support the verification of the signal sent by the zero-power device when receiving the signal, and determine whether the data sent by the zero-power device has been successfully received. In other words, the receiver can support error detection of the data sent by the zero-power device, thereby improving the data transmission performance of the zero-power device.

[0267] In some embodiments, the CRC bits are located after the fourth sequence.

[0268] For example, the last M bits in the first sequence are the CRC bits.

[0269] In some embodiments, the first sequence includes a fourth sequence and at least one parity bit.

[0270] For example, a zero-power device, based on a fourth sequence of Y bits (e.g., Y is a positive integer), adds S (e.g., S is a positive integer) parity bits (e.g., the S parity bits can be added at one position in the fourth sequence, or different bits from the S parity bits can be added at different positions in the first sequence), resulting in a sequence of length Y+S bits after the addition of parity bits (i.e., the first sequence mentioned above). Then, the first sequence is encoded based on a redundancy of N to obtain an encoded sequence of (Y+S)×N bits (i.e., the second sequence mentioned above). Next, the second sequence is modulated to obtain a modulated signal, which is then transmitted. The modulation method of the second sequence includes, but is not limited to, OOK, ASK, PSK, and FSK modulation.

[0271] Accordingly, after demodulating the received signal, the receiver obtains a second sequence of (Y+S)×N bits. Then, through the decoding process corresponding to the repetition code, it obtains a first sequence of length Y+S bits. This first sequence is a bit sequence with parity bits appended to the fourth sequence. The receiving device can use a zero-power device to add these S parity bits to determine the fourth sequence of length Y and the parity bits of length S in the first sequence. Furthermore, if the fourth sequence contains bits to be decided, the receiver can perform parity checking on the bits to be decided according to the method used when encoding the parity bits, and perform error correction through parity checking.

[0272] In this embodiment, by introducing at least one parity check bit, the receiver can support parity checking of the signal sent by the zero-power device when receiving the signal. That is, when the bit transmission in the fourth sequence is incorrect, it can correct the error, thereby improving the data transmission performance of the zero-power device.

[0273] It is worth noting that the at least one parity bit can be used to assist the receiver in error correction processing. Specifically: the bit used to determine the first parity bit among the at least one parity bits, wherein the first parity bit is set to "0" when the number of "1"s is even, otherwise it is set to "1"; or, wherein the first parity bit is set to "1" when the number of "1"s is even, otherwise it is set to "0".

[0274] In some embodiments, the at least one parity bit is located after the fourth sequence.

[0275] For example, the last S bits in the first sequence are parity check bits.

[0276] In some embodiments, the fourth sequence is a sequence to be divided, which is divided into at least one parity group, and the first parity bit in the at least one parity bit is located after the first parity group in the at least one parity group.

[0277] For example, the fourth sequence is divided into at least one check group, each of which is followed by W (W≥1) parity bits. In other words, the first sequence can be obtained by interleaving the at least one check group and the at least one parity bit.

[0278] In some embodiments, the first sequence includes a fourth sequence, a cyclic redundancy check (CRC) bit of the fourth sequence, and at least one parity check bit.

[0279] For example, a zero-power device, based on a fourth sequence of Y bits (e.g., Y is a positive integer), adds M CRC bits (e.g., the M CRC bits can be added at one position in the fourth sequence, or different bits from the M CRC bits can be added at different positions in the first sequence) and S parity bits (e.g., the S parity bits can be added at one position in the fourth sequence, or different bits from the S parity bits can be added at different positions in the first sequence), to obtain a sequence of length Y+M+S bits after adding CRC bits and parity bits (i.e., the first sequence mentioned above). Then, the first sequence is repeatedly encoded based on redundancy N to obtain the second sequence. In one implementation, the zero-power device can directly repeat the encoding of bits in the first sequence to obtain an encoded sequence of (Y+M+S)×N bits (i.e., the second sequence mentioned above). In another implementation, the zero-power device can map each bit in the first sequence to a third sequence of X bits, thereby obtaining at least one third sequence. Then, it repeats the encoding based on the sequence formed by the at least one third sequence to obtain an encoded sequence of (Y+M+S)×X×N bits (i.e., the second sequence mentioned above). In yet another implementation, the zero-power device can divide the first sequence into at least one coded group and map the at least one coded group to at least one third sequence. If the number of bits in the coded group is U and the number of bits in the third sequence is X, then repeating the encoding based on the sequence formed by the at least one third sequence can obtain an encoded sequence of (Y+M+S) / U×X×N bits (i.e., the second sequence mentioned above). After obtaining the second sequence, the zero-power device modulates the second sequence to obtain a modulated signal and then transmits the modulated signal. The modulation method of the second sequence includes, but is not limited to, OOK, ASK, PSK, FSK modulation, etc.

[0280] Correspondingly, after demodulating the received signal, the receiver obtains a second sequence with the number of bits (Y+M+S)×N, (Y+M+S)×X×N, or (Y+M+S) / U×X×N. Then, through the decoding process corresponding to the repeating code and inverse mapping (if necessary), a first sequence of length Y+M+S bits is obtained. This first sequence is a bit sequence with CRC bits and parity bits appended to the fourth sequence. Based on this, on the one hand, the receiver performs CRC verification according to the CRC polynomial used in CRC encoding; specifically, if the CRC verification passes, the fourth sequence of Y bits is considered correctly received; otherwise, the fourth sequence of Y bits is considered incorrectly received, and the data of the fourth sequence needs to be retransmitted. On the other hand, the receiving device can use the method of appending the S parity bits with a zero-power device to determine the fourth sequence of Y bits and the parity bits of S bits in the first sequence; furthermore, if there are bits to be decided in the fourth sequence, the receiver can perform parity verification on the bits to be decided according to the determination method used in the parity bit encoding, and perform error correction through parity verification.

[0281] In this embodiment, by introducing CRC bits and at least one parity check bit, the receiver can support CRC and parity checks on the signals sent by the zero-power device when receiving signals. This not only enables the receiver to detect errors in the data sent by the zero-power device, but also to correct errors when bit transmission errors occur in the fourth sequence, thereby improving the data transmission performance of the zero-power device.

[0282] It is worth noting that when a zero-power device simultaneously adds parity check bits and CRC check bits, there are two processing methods: Method 1: The zero-power device first adds parity check bits (S bits, S>=1) to the fourth sequence (number of bits Y), resulting in a bit sequence with added parity check bits (number of bits Y+S). Then, it performs CRC addition (number of bits M) to obtain a bit sequence with added parity check bits and CRC check bits (number of bits Y+S+M), which is the first sequence. Then, the zero-power device performs repeated encoding based on the first sequence and redundancy N to obtain a second sequence with the number of bits (Y+M+S)×N, (Y+M+S)×X×N, or (Y+M+S) / U×X×N, where X is the number of bits in the third sequence when the bits or coded blocks in the first sequence are mapped to the third sequence, and U is the number of bits in the coded block when the first sequence is divided into at least one coded block and each coded block is mapped to a third sequence.

[0283] Method 2: The zero-power device first adds CRC check bits (number of bits M) to the fourth sequence (number of bits Y), resulting in a bit sequence with added CRC check bits (number of bits Y+M). Then, it adds parity check bits (number of bits S, S>=1) to obtain a bit sequence with added parity check bits and CRC check bits (number of bits Y+M+S), which is the first sequence. Then, the zero-power device performs repeated encoding based on the first sequence and redundancy N to obtain a second sequence with the number of bits (Y+M+S)×N, (Y+M+S)×X×N, or (Y+M+S) / U×X×N, where X is the number of bits in the third sequence when the bits or coded blocks in the first sequence are mapped to the third sequence, and U is the number of bits in the coded block when the first sequence is divided into at least one coded block and each coded block is mapped to a third sequence.

[0284] In some embodiments, the first sequence comprises, in sequence: the fourth sequence, the CRC bit, and the at least one parity check bit.

[0285] For example, the last S bits in the first sequence are the at least one parity check bit, and the M bits preceding the at least one parity check bit are the CRC bits.

[0286] In some embodiments, the first sequence comprises, in sequence: the fourth sequence, the at least one parity check bit, and the CRC bit.

[0287] For example, the last M bits in the first sequence are the CRC bits, and the S bits preceding the CRC bits are the at least one parity check bit.

[0288] In some embodiments, the fourth sequence is a sequence to be divided, which is divided to include at least one parity check group, and the first parity check bit in the at least one parity check bit is located after the first parity check group in the at least one parity check group; the CRC bit is located after the sequence formed by the fourth sequence and the at least one parity check bit.

[0289] For example, W (W is a positive integer) of the first parity bits in the at least one parity bit are located after the first check packet in the at least one check packet. In other words, the fourth sequence is divided into at least one check packet, and each of the at least one check packet is followed by W (W≥1) parity bits. The CRC bit is located after the sequence formed by the fourth sequence and the at least one parity bit. In other words, the CRC bit can be added after the sequence obtained by interleaving the at least one check packet and the at least one parity bit.

[0290] In some embodiments, the sequence formed by the fourth sequence and the CRC bits is a sequence to be divided, and the sequence to be divided includes at least one check group. The first parity check bit in the at least one parity check bit is located after the first check group in the at least one check group.

[0291] For example, W (W is a positive integer) of the first parity check bits are located after the first check packet in the at least one check packet. In other words, the sequence formed by the fourth sequence and the CRC bits is divided into at least one check packet, each of which is followed by W (W≥1) parity check bits. In other words, the CRC bits can be added after the sequence obtained by interleaving the at least one check packet and the at least one parity check bits.

[0292] Figure 17 This is an example of the positional relationship between the check group and the parity bit in the first sequence provided in the embodiments of this application.

[0293] like Figure 17 As shown in (a), a zero-power device can obtain the first sequence by simply appending one or more parity bits to the end of the fourth sequence. Figure 17 As shown in (b), a zero-power device can append one or more parity bits after every L bits (i.e., each parity packet) in the fourth sequence to obtain the first sequence. L can be protocol-defined or indicated by the network device. That is, a zero-power device can divide the Y-bit fourth sequence into Y / L parity packets, appending one or more parity bits after every consecutive L bits. Figure 17As shown in (c), the zero-power device can also add J parity bits, where J can be protocol-defined or indicated by the network device. For example, the zero-power device can divide the sequence to be divided (e.g., the fourth sequence or a sequence formed by the fourth sequence and CRC bits) into P (P≥1, P≤J) check packets, with one or more parity bits appended to each check packet. For example, when P equals J, the zero-power device can divide the sequence to be divided (e.g., the fourth sequence or a sequence formed by the fourth sequence and CRC bits) into J check packets, with one parity bit appended to each check packet, i.e., B1~Bj are scattered and interleaved with J check packets to obtain the first sequence.

[0294] In some embodiments, the check group used to determine the first parity bit in the at least one check group does not overlap with the check group used to determine other parity bits besides the first parity bit in the at least one check group.

[0295] For example, the at least one check group and the at least one parity check bit correspond one-to-one.

[0296] For example, when the number of bits in the at least one parity bit is greater than 1, different parity bits can correspond to different data (i.e., the data used to determine that different parity bits do not overlap). For example, suppose k in the first sequence i k j k m These 3 positions contain parity bits (i <j<m),k i The parity check bit of the position is based on k i Previous bit determination (k) i (Previously there was no parity bit), k j According to k i+1 and k j-1 Between (including k) i+1 and k j-1 The bits of k are determined. m According to and k j+1 and k m-1 Between (including k) j+1 and k m-1 The bits of ) are determined.

[0297] In some embodiments, the first parity bit is determined based on the first parity group.

[0298] For example, the first check packet is any one of the at least one check packets. In other words, any one of the at least one check packets is followed by a parity check bit determined based on that check packet.

[0299] In some embodiments, the check group used to determine the first parity bit in the at least one check group at least partially overlaps with the check group used to determine other parity bits besides the first parity bit in the at least one check group.

[0300] For example, the at least one check group and the at least one parity check bit have a many-to-one correspondence.

[0301] In some embodiments, the first parity bit is determined based on the first parity packet and the parity packet preceding the first parity packet.

[0302] For example, the first check packet is any one of the at least one check packets. In other words, any one of the at least one check packets is followed by a parity bit determined based on the following information: the check packet itself and the check packet preceding it.

[0303] For example, when the number of bits in the at least one parity bit is greater than 1, different parity bits can correspond to different data (i.e., the data used to determine different parity bits at least partially overlap). For example, k i k j k m These 3 positions contain parity bits (i <j<m),k i The parity check bit of the position is based on k i Previous bit determination (k) i (Previously there was no parity bit), k j According to k j Previous bits (excluding k) i The parity bits of the position are determined, k m According to k m Previous bits (excluding k) i and k j The parity bit at the position is determined.

[0304] In some embodiments, the first parity bit is determined based on the first parity packet, the parity packet preceding the first parity packet, and the parity bit that has been determined based on the parity packet preceding the first parity packet from among the at least one parity bit.

[0305] For example, the first check packet is any one of the at least one check packets. In other words, any one of the at least one check packets is followed by a parity bit determined based on the following information: the any one check packet, the check packet preceding the any one check packet, and the parity bit determined based on the check packet preceding the any one check packet.

[0306] For example, when the number of bits in the at least one parity bit is greater than 1, different parity bits can correspond to different data (i.e., the data used to determine different parity bits at least partially overlap). For example, k i k j k m These 3 positions contain parity bits (i <j<m),k i The parity check bit of the position is based on k i Previous bit determination (k) i (Previously there was no parity bit), k j According to k j Previous bits (including k) i The parity bits of the position are determined, k m According to k m Previous bits (including k) i and k j The parity bit at the position is determined.

[0307] Figure 18 This is another example of the positional relationship between the check group and the parity bit in the first sequence provided in the embodiments of this application.

[0308] Assuming the first sequence, or the sequence formed by the first sequence and CRC bits, is divided into two check groups, such as... Figure 18 As shown in (a), in one implementation, the first parity bit is determined based on the first parity block of the two parity blocks and appended to the end of the first parity block; the second parity bit is determined based on the second parity block of the two parity blocks and appended to the end of the second parity block, thus obtaining the first sequence; as shown in (a), Figure 18 As shown in (b) of the figure, in another implementation, the first parity bit is determined based on the first of the two parity blocks and appended to the end of the first parity block, and the second parity bit is determined based on the two parity blocks (which may or may not include the first parity bit) and appended to the end of the second parity block, thus obtaining the first sequence.

[0309] In some embodiments, the fourth sequence is a data bit sequence.

[0310] For example, this data bit sequence can also be referred to as the original data sequence.

[0311] In some embodiments, the method 200 may further include: The zero-power device first obtains the maximum number of bits in each of the at least one check groups; then, it divides each consecutive maximum number of bits in the sequence to be divided into one check group in the at least one check group.

[0312] For example, the maximum number of bits is a positive integer.

[0313] In some embodiments, the number of bits in each check group in the at least one check group is the maximum number of bits.

[0314] For example, if the number of bits in the sequence to be divided is an integer multiple of the maximum number of bits, then the number of bits in each check group in the at least one check group is the maximum number of bits.

[0315] In some embodiments, if the number of undivided bits in the sequence to be divided is less than the maximum number of bits, then the last check group in the at least one check group is obtained based on the undivided bits and the padding bits; wherein the total number of the undivided bits and the padding bits is the maximum number of bits.

[0316] For example, if the number of bits in the sequence to be divided is not an integer multiple of the maximum number of bits, then when the number of undivided bits in the sequence to be divided is less than the maximum number of bits, the zero-power device can obtain the last check group in the at least one check group based on the undivided bits and the padding bits; wherein, the total number of the undivided bits and the padding bits is the maximum number of bits.

[0317] Of course, in other alternative embodiments, if the number of undivided bits in the sequence to be divided is less than the maximum number of bits, the undivided bits may not be discarded, and this application does not specifically limit this.

[0318] In some embodiments, the number of bits in the at least one check packet excluding the last check packet is the maximum number of bits, and the number of bits in the last check packet is less than the maximum number of bits.

[0319] For example, if the number of bits in the sequence to be divided is not an integer multiple of the maximum number of bits, then the number of bits in the at least one check group excluding the last check group is the maximum number of bits, and the number of bits in the last check group is less than the maximum number of bits.

[0320] Of course, in other alternative embodiments, the number of bits in other check packets may be less than the maximum number of bits, and this embodiment does not specifically limit this. For example, in a specific implementation, the number of bits in the check packets other than the first check packet may be the maximum number of bits, and the number of bits in the first check packet may be less than the maximum number of bits.

[0321] In some embodiments, if the number of undivided bits in the sequence to be divided is less than the maximum number of bits, then the undivided bits are determined as the last check group in the at least one check group.

[0322] For example, if the number of bits in the sequence to be divided is not an integer multiple of the maximum number of bits, then when the number of undivided bits in the sequence to be divided is less than the maximum number of bits, the zero-power device can directly determine the undivided bits as the last check group in the at least one check group.

[0323] In some embodiments, the maximum number of bits is configured by a network device, or the maximum number of bits is predefined.

[0324] The predefined maximum number of bits can be achieved by pre-storing corresponding codes, tables, or other methods that can be used to indicate relevant information in the device (e.g., including terminal devices and network devices). This application does not limit the specific implementation method. For example, predefinition can refer to what is defined in a protocol. It should also be understood that in the embodiments of this application, the "protocol" can refer to standard protocols in the field of communication, such as the LTE protocol, the NR protocol, and related protocols applied to future communication systems. This application does not limit this.

[0325] In some embodiments, the zero-power device determines the maximum number of bits based on the number of bits in the sequence to be divided.

[0326] For example, the number of bits in the sequence to be divided is positively correlated with the maximum number of bits. That is, the larger the number of bits in the sequence to be divided, the larger the maximum number of bits. Similarly, the smaller the number of bits in the sequence to be divided, the larger the maximum number of bits.

[0327] In some embodiments, the zero-power device first obtains a third mapping relationship; wherein the third mapping relationship includes a correspondence between multiple values ​​and multiple candidate bit numbers; the multiple values ​​include a third value with the smallest difference from the number of bits in the sequence to be divided; and then the candidate bit number corresponding to the third value is determined as the maximum bit number.

[0328] For example, the third mapping relationship can be configured by the network device or be predefined, or it can be determined by the zero-power device or negotiated by the zero-power device and the network device.

[0329] In some embodiments, the third mapping relationship is a mapping relationship determined by the zero-power device among multiple mapping relationships configured by the network device, or the third mapping relationship is a mapping relationship determined by the zero-power device among multiple predefined mapping relationships.

[0330] For example, the third mapping relationship may be one of the multiple mapping relationships that matches the number of bits (or information type, etc.) of the first sequence. The information type of the first sequence includes, but is not limited to, data type and control type.

[0331] In some embodiments, the zero-power device first obtains a fourth mapping relationship; wherein the fourth mapping relationship includes a correspondence between multiple numerical ranges and multiple bit numbers; the bit number of the sequence to be divided belongs to a first numerical range of the multiple numerical ranges; and then the bit number corresponding to the first numerical range is determined as the maximum bit number.

[0332] For example, the fourth mapping relationship can be configured by the network device or be predefined, or it can be determined by the zero-power device or negotiated by the zero-power device and the network device.

[0333] In some embodiments, the fourth mapping relationship is a mapping relationship determined by the zero-power device among multiple mapping relationships configured in the network device, or the fourth mapping relationship is a mapping relationship determined by the zero-power device among multiple predefined mapping relationships.

[0334] For example, the fourth mapping relationship may be one of the multiple mapping relationships that matches the number of bits (or information type, etc.) of the first sequence. The information type of the first sequence includes, but is not limited to, data type and control type.

[0335] In some embodiments, the zero-power device acquires a fourth value; the fourth value represents the number of the at least one check group and / or the number of the at least one parity bit; and then determines the maximum number of bits based on the number of bits in the sequence to be divided and the fourth value.

[0336] In some embodiments, the zero-power device determines the maximum number of bits based on the ratio of the number of bits in the sequence to be divided to the fourth value.

[0337] For example, the zero-power device directly determines the maximum number of bits as the ratio of the number of bits in the sequence to be divided to the fourth value.

[0338] For example, the zero-power device determines the maximum number of bits by rounding up the ratio of the number of bits in the sequence to be divided to the fourth value. Alternatively, the zero-power device determines the maximum number of bits by rounding down the ratio of the number of bits in the sequence to be divided to the fourth value.

[0339] In some embodiments, the fourth value is configured via a network device, or the fourth value is predefined.

[0340] For example, the fourth value may be a value determined from a plurality of values ​​configured by the network device or a plurality of predefined values. For instance, the fourth value may be a value among the plurality of values ​​that matches the number of bits (or the information type, etc.) of the first sequence. The information type of the first sequence includes, but is not limited to, data type and control type.

[0341] In some embodiments, the method 200 may further include: The zero-power device interleaves the second sequence.

[0342] For example, this interleaving can be achieved using a row-column interleaver, i.e., row-column interleaving, similar to interleaving in NR.

[0343] For example, when the zero-power device repeatedly encodes the values ​​of the bits in the first sequence, it interleaves them according to the length of the first sequence.

[0344] In this embodiment, when the zero-power device repeatedly encodes the values ​​of the bits in the first sequence, it interleaves the bits according to the length of the first sequence, which can discretely distribute the N consecutive "1"s or "0"s, thereby further improving the data transmission performance of the zero-power device.

[0345] Figure 19 This is an example of the interleaving principle provided in the embodiments of this application.

[0346] like Figure 19 As shown in (a), when the zero-power device repeatedly encodes the values ​​of bits in the first sequence, if the first sequence includes bits 1 to bit k, then the second sequence includes N repetitions of bit 1, N repetitions of bit 2, ..., N repetitions of bit k. After interleaving according to the length of the first sequence, the zero-power device can obtain the following... Figure 19 The sequence described in (b) is the Nth repetition of the second sequence.

[0347] In some embodiments, the method 200 may further include: The second sequence is encoded in the first way.

[0348] For example, the first encoding is used to implement digital-to-analog conversion.

[0349] In some embodiments, the method 200 may further include: The zero-power device modulates the second sequence or the second sequence after the first encoding to obtain a first signal; and then transmits the first signal.

[0350] For example, the first signal is a backscattered signal, or the first signal is a signal actively emitted by a zero-power device.

[0351] In some embodiments, the first sequence includes a prefix sequence; a zero-power device modulates the second sequence or the second sequence after a first encoding to obtain the first signal.

[0352] In some embodiments, the zero-power device adds a prefix sequence to the second sequence or the second sequence after a first encoding to obtain a fifth sequence; then modulates the fifth sequence to obtain a first signal.

[0353] For example, the zero-power device adds the prefix sequence before modulating the second sequence.

[0354] For example, the zero-power device adds the prefix sequence after modulating the second sequence.

[0355] Of course, in other alternative embodiments, the zero-power device may also add the prefix sequence before repeated encoding, and this application does not specifically limit this. In other words, the prefix sequence may participate in encoding (applied before encoding) or may not participate in encoding processing (applied before modulation).

[0356] In some embodiments, the prefix sequence is configured by a network device, or the prefix sequence is predefined, or the prefix sequence is determined based on the number of repetitions of the repeating code.

[0357] For example, different numbers of repetitions can correspond to different prefix sequences.

[0358] For example, the prefix sequence is used by the receiving device to identify the starting position of the data when receiving data.

[0359] In some embodiments, the modulation method used by the second sequence or the sequence after the second sequence is first encoded includes at least one of the following: amplitude shift keying (ASK) modulation, on-off keying (OOK) modulation, frequency shift keying (FSK) modulation, and phase shift keying (PSK) modulation.

[0360] For example, the modulation scheme used in the second sequence after the first encoding includes OOK modulation and ASK modulation.

[0361] OOK modulation and ASK modulation are used to convert 0 and 1 bits into their corresponding levels.

[0362] Of course, the above modulation methods are merely examples and should not be construed as limiting this application. For instance, more complex modulation methods may be used in other alternative embodiments.

[0363] In some embodiments, the first encoding includes at least one of the following: Reverse non-return-to-zero coding, unipolar return-to-zero coding, Manchester coding, Miller coding, differential biphase coding, differential coding, pulse interval coding, and bidirectional spatial coding.

[0364] In some embodiments, the method 200 may further include: The zero-power device sends the second sequence.

[0365] For example, a zero-power device can directly send a second sequence after repeated encoding.

[0366] For example, the second sequence is a backscattered signal, or the second sequence is a signal actively emitted by a zero-power device.

[0367] In some embodiments, the method 200 may further include: The zero-power device determines the number of repetitions of the repetition code based on at least one of the following information from the first sequence: Data block size, bit rate, and communication speed.

[0368] For example, different communication rates correspond to different relationships. For instance, for a given communication rate, different repetition counts N can be determined based on different block sizes and / or different bitrates. Similarly, for a given bitrate, different repetition counts N can be determined based on different block sizes and / or different communication rates. This relationship can be implemented as a base graph (BG).

[0369] It should be noted that the value of the repetition count N affects both data transmission performance and communication data rate. Generally, the larger the repetition count N, the better the data transmission performance, but the lower the corresponding data rate. In this embodiment, considering that the data size transmitted in zero-power communication varies, and the requirements for data transmission performance and communication rate differ in different application scenarios, the zero-power device can determine the repetition count of the repetition encoding based on at least one of the data block size, bit rate, and communication rate. This allows the repetition count N to support multiple values, which is equivalent to determining a suitable value of N according to the actual communication scenario, thus balancing data transmission performance and data transmission rate.

[0370] Of course, in other alternative embodiments, the zero-power device may also determine the number of repetitions of the repeated encoding based on at least one of the following information of the first sequence: the service type of the first sequence, and the application scenario of the zero-power device. The application scenario may also be referred to as the communication scenario.

[0371] In some embodiments, the number of repetitions of the repetition encoding is configured by the network device, or the number of repetitions of the repetition encoding is predefined.

[0372] For example, the number of repetitions in the repeated encoding can be a number of repetitions selected by the zero-power device from multiple repetition numbers. These multiple repetition numbers can be associated with at least one of the following: multiple data block sizes, multiple code rate sizes, multiple communication rate sizes, multiple service types, and multiple application scenarios.

[0373] Figure 20 This is a schematic flowchart of repeated encoding provided in the embodiments of this application.

[0374] After acquiring the fourth sequence, the zero-power device can transmit signals based on this fourth sequence, which is a data bit sequence. For example, in one implementation, such as... Figure 20 As shown in (a), the following steps are performed sequentially: adding parity bits, adding CRC bits, performing repeated encoding, performing interleaving, performing first encoding, and performing modulation to obtain the modulated first signal, which is then transmitted. For example, in another implementation, such as... Figure 20 As shown in (b) of the figure, after the zero-power device obtains the fourth sequence, it sequentially performs additional CRC bits, additional parity bits, repeat encoding, interleaving, first encoding, and modulation to obtain the modulated first signal, and then sends the first signal. The dashed boxes in the figure represent enhancement (optional) methods, which can be selected according to the design in actual implementation.

[0375] certainly, Figure 20 This is merely an example of what is being done and should not be construed as limiting the scope of this application.

[0376] For example, zero-power devices that repeatedly encode pre-modulated sequences or bits within sequences can be extended to repeatedly encode modulated symbols.

[0377] It is worth noting that the configuration methods involving network devices in this application include, but are not limited to, semi-static configuration and dynamic indication. When configuring via dynamic indication, information can be configured directly or an index of information can be configured (i.e., indirect configuration), and this application does not specifically limit this.

[0378] The preferred embodiments of this application have been described in detail above with reference to the accompanying drawings. However, this application is not limited to the specific details of the embodiments described above. Within the scope of the technical concept of this application, various simple modifications can be made to the technical solutions of this application, and these simple modifications all fall within the protection scope of this application. For example, the various specific technical features described in the specific embodiments described above can be combined in any suitable manner without contradiction. To avoid unnecessary repetition, this application will not describe the various possible combinations separately. Furthermore, various different embodiments of this application can also be arbitrarily combined, as long as they do not violate the spirit of this application, they should also be considered as the content disclosed in this application.

[0379] It should also be understood that, in the various method embodiments of this application, the order of the processes mentioned above does not imply 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 embodiments of this application.

[0380] The above text combines Figures 16 to 20 The wireless communication method provided according to the embodiments of this application is described in detail from the perspective of zero-power devices based on repetitive coding. The following will combine... Figure 21 This paper describes the wireless communication method provided according to embodiments of the present application from the perspective of zero-power device based on repeated decoding.

[0381] Figure 21 This is a schematic flowchart of the wireless communication method 300 provided in the embodiments of this application.

[0382] It should be noted that the wireless communication method 300 can be executed by a receiving device, which can be a network device or a terminal device. In other words, this wireless communication method is applicable to wireless communication between a receiving device and a transmitting device (including at least one of the following: a terminal device receiving data sent by a network device, a network device receiving data sent by a terminal device, and a terminal device receiving data sent by another terminal device). For example, the terminal device can be a zero-power device, which can be a device supporting at least one of the following communication methods: backscatter communication and active transmission communication. For example, a zero-power device can be a conventional NR terminal with a loaded or integrated backscatter communication module.

[0383] like Figure 21 As shown, the method 300 may include: S310, based on the second sequence to be decoded, perform repeated decoding to obtain the first sequence.

[0384] In some embodiments, S310 may include: The first sequence is obtained by repeatedly decoding the bit values ​​in the first sequence based on the second sequence.

[0385] In some embodiments, S310 may include: The first sequence is obtained by repeatedly decoding the second sequence.

[0386] In some embodiments, if the number of bits in the second sequence is N×K and the number of repetitions in the repeated decoding is N, then the number of bits in the second sequence is K; where N and K are both positive integers.

[0387] In some embodiments, S310 may include: Based on the second sequence, perform repeated decoding to determine at least one third sequence; The first sequence is determined based on the at least one third sequence.

[0388] In some embodiments, determining the first sequence based on the at least one third sequence includes: Based on the third sequence, the values ​​of the bits in the first sequence are determined.

[0389] In some embodiments, determining the value of a bit in the first sequence based on the third sequence includes: Obtain the first mapping relationship; The first mapping relationship includes the correspondence between the first numerical value and the first candidate sequence, and the correspondence between the second numerical value and the second candidate sequence; If the third sequence is the first candidate sequence, then the first value is determined as the value of the first bit in the first sequence; If the third sequence is the second candidate sequence, then the second value is determined as the value of the first bit.

[0390] In some embodiments, the first candidate sequence and the second candidate sequence have different values ​​at the same bit position.

[0391] In some embodiments, determining the first sequence based on the at least one third sequence includes: The at least one decoded group is determined based on the at least one third sequence; The decoded group includes one or more bits from the first sequence.

[0392] In some embodiments, determining the at least one decoded group based on the at least one third sequence includes: Obtain the second mapping relationship; The second mapping relationship includes the correspondence between multiple values ​​and multiple candidate sequences; the multiple candidate sequences include the at least one third sequence. The value corresponding to each of the at least one third sequence is determined as the decoding group.

[0393] In some embodiments, the number of the plurality of candidate sequences is positively correlated with the number of bits in each of the plurality of values.

[0394] In some embodiments, determining at least one third sequence based on the second sequence through repeated decoding includes: Based on the second sequence, the bit values ​​in the third sequence are repeatedly decoded to determine the at least one third sequence.

[0395] In some embodiments, determining at least one third sequence based on the second sequence through repeated decoding includes: The at least one third sequence is determined by repeatedly decoding the third sequence based on the second sequence.

[0396] In some embodiments, determining at least one third sequence based on the second sequence through repeated decoding includes: The at least one third sequence is determined by repeatedly decoding the sequence formed by the second sequence and the at least one third sequence.

[0397] In some embodiments, if the number of bits in the second sequence is N×X×K, the number of repetitions in the repeated decoding is N, and the number of bits in each of the at least one third sequence is X, then the number of bits in the first sequence is K; where N, X, and K are all positive integers.

[0398] In some embodiments, the third sequence matches any of the following decoding methods: Reverse non-return-to-zero decoding, Manchester decoding, unipolar return-to-zero decoding, Miller decoding, differential biphase decoding, differential decoding, pulse interval decoding, and bidirectional spatial decoding.

[0399] In some embodiments, the first sequence includes a fourth sequence and cyclic redundancy check (CRC) bits of the fourth sequence.

[0400] In some embodiments, the CRC bits are located after the fourth sequence.

[0401] In some embodiments, the first sequence includes a fourth sequence and at least one parity bit.

[0402] In some embodiments, the at least one parity bit is located after the fourth sequence.

[0403] In some embodiments, the fourth sequence is a sequence to be divided, which is divided into at least one parity group, and the first parity bit in the at least one parity bit is located after the first parity group in the at least one parity group.

[0404] In some embodiments, the first sequence includes a fourth sequence, a cyclic redundancy check (CRC) bit of the fourth sequence, and at least one parity check bit.

[0405] In some embodiments, the first sequence comprises, in sequence: the fourth sequence, the CRC bit, and the at least one parity check bit.

[0406] In some embodiments, the first sequence comprises, in sequence: the fourth sequence, the at least one parity check bit, and the CRC bit.

[0407] In some embodiments, the fourth sequence is a sequence to be divided, which is divided to include at least one parity check group, and the first parity check bit in the at least one parity check bit is located after the first parity check group in the at least one parity check group; the CRC bit is located after the sequence formed by the fourth sequence and the at least one parity check bit.

[0408] In some embodiments, the sequence formed by the fourth sequence and the CRC bits is a sequence to be divided, and the sequence to be divided includes at least one check group. The first parity check bit in the at least one parity check bit is located after the first check group in the at least one check group.

[0409] In some embodiments, the check group used to determine the first parity bit in the at least one check group does not overlap with the check group used to determine other parity bits besides the first parity bit in the at least one check group.

[0410] In some embodiments, the first parity bit is determined based on the first parity group.

[0411] In some embodiments, the check group used to determine the first parity bit in the at least one check group at least partially overlaps with the check group used to determine other parity bits besides the first parity bit in the at least one check group.

[0412] In some embodiments, the first parity bit is determined based on the first parity packet and the parity packet preceding the first parity packet.

[0413] In some embodiments, the first parity bit is determined based on the first parity packet, the parity packet preceding the first parity packet, and the parity bit that has been determined based on the parity packet preceding the first parity packet from among the at least one parity bit.

[0414] In some embodiments, the fourth sequence is a data bit sequence.

[0415] In some embodiments, the method 300 may further include: Obtain the maximum number of bits in each check packet of the at least one check packet; In this process, each consecutive maximum number of bits in the sequence to be divided is divided into a check group among the at least one check group.

[0416] In some embodiments, the number of bits in each check group in the at least one check group is the maximum number of bits.

[0417] In some embodiments, the last check packet in the at least one check packet includes padding bits.

[0418] In some embodiments, the number of bits in the at least one check packet excluding the last check packet is the maximum number of bits, and the number of bits in the last check packet is less than the maximum number of bits.

[0419] In some embodiments, the maximum number of bits is configured by a network device, or the maximum number of bits is predefined.

[0420] In some embodiments, obtaining the maximum number of bits for each check group in the at least one check group includes: The maximum number of bits is determined based on the number of bits in the sequence to be divided.

[0421] In some embodiments, determining the maximum number of bits based on the number of bits in the sequence to be divided includes: Obtain the third mapping relationship; The third mapping relationship includes the correspondence between multiple numerical values ​​and multiple candidate bit counts; the multiple numerical values ​​include the third numerical value with the smallest difference from the number of bits in the sequence to be divided. The number of candidate bits corresponding to the third value is determined as the maximum number of bits.

[0422] In some embodiments, the third mapping relationship is a mapping relationship determined by the zero-power device among multiple mapping relationships configured in the network device, or the third mapping relationship is a mapping relationship determined by the zero-power device among multiple predefined mapping relationships.

[0423] In some embodiments, determining the maximum number of bits based on the number of bits in the sequence to be divided includes: Obtain the fourth mapping relationship; The fourth mapping relationship includes a correspondence between multiple numerical ranges and multiple bit counts; the bit count of the sequence to be divided belongs to the first numerical range of the multiple numerical ranges. The number of bits corresponding to the first numerical range is determined as the maximum number of bits.

[0424] In some embodiments, the fourth mapping relationship is a mapping relationship determined by the zero-power device among multiple mapping relationships configured in the network device, or the fourth mapping relationship is a mapping relationship determined by the zero-power device among multiple predefined mapping relationships.

[0425] In some embodiments, obtaining the maximum number of bits for each check group in the at least one check group includes: Obtain a fourth value; the fourth value represents the number of the at least one check packet and / or the number of the at least one parity bit; The maximum number of bits is determined based on the number of bits in the sequence to be divided and the fourth value.

[0426] In some embodiments, determining the maximum number of bits based on the number of bits in the sequence to be divided and the fourth value includes: The maximum number of bits is determined based on the ratio of the number of bits in the sequence to be divided to the fourth value.

[0427] In some embodiments, the fourth value is configured via a network device, or the fourth value is predefined.

[0428] In some embodiments, prior to the repeated decoding based on the second sequence to be decoded, the method further includes: The second sequence is de-interleaved.

[0429] In some embodiments, before performing repeated decoding based on the second sequence to be decoded, the method 300 may further include: The second sequence is then decoded in the first step.

[0430] In some embodiments, prior to S310, the method 300 may further include: Receive the first signal; The first signal is demodulated or the demodulated first signal is decoded to obtain the second sequence.

[0431] In some embodiments, the first sequence includes a prefix sequence.

[0432] In some embodiments, demodulating the first signal or performing a first decoding on the demodulated first signal to obtain the second sequence includes: The first signal is demodulated or the demodulated first signal is decoded in a first manner to obtain a fifth sequence; the fifth sequence includes the second sequence and the prefix sequence.

[0433] In some embodiments, the prefix sequence is configured by a network device, or the prefix sequence is predefined, or the prefix sequence is determined based on the number of repetitions in the repeated decoding.

[0434] In some embodiments, the demodulation method used for the first signal includes at least one of the following: amplitude shift keying (ASK) demodulation, on / off keying (OOK) demodulation, frequency shift keying (FSK) demodulation, and phase shift keying (PSK) demodulation.

[0435] In some embodiments, the first decoding includes at least one of the following: Reverse non-return-to-zero decoding, unipolar return-to-zero decoding, Manchester decoding, Miller decoding, differential biphase decoding, differential decoding, pulse interval decoding, bidirectional spatial decoding.

[0436] In some embodiments, prior to S310, the method 300 may further include: Receive the second sequence.

[0437] In some embodiments, the number of repetitions of the repeated decoding is determined by the zero-power device based on at least one of the following information of the first sequence: data block size, bit rate, and communication rate.

[0438] In some embodiments, the number of repetitions for the repeated decoding is configured by the network device, or the number of repetitions for the repeated decoding is predefined.

[0439] It should be understood that the steps in wireless communication method 300 can refer to the corresponding steps in wireless communication method 200, and for the sake of brevity, they will not be repeated here.

[0440] The above text combined Figures 16 to 21 The method embodiments of this application are described in detail below, in conjunction with... Figures 22 to 25 The following describes in detail the device embodiments of this application.

[0441] Figure 22 This is a schematic block diagram of a transmitting device 400 according to an embodiment of this application. It should be noted that the transmitting device 400 can be a network device or a terminal device. For example, the terminal device can be a zero-power device, which can be a device supporting at least one of the following communication methods: backscatter communication and active transmission communication. For example, a zero-power device can be a conventional NR terminal with a backscatter communication module loaded or integrated.

[0442] like Figure 22 As shown, the transmitting device 400 may include: The encoding unit 410 is used to repeatedly encode the first sequence to be encoded to obtain the second sequence.

[0443] In some embodiments, the encoding unit 410 is specifically used for: The bit values ​​in the first sequence are repeatedly encoded to obtain the second sequence.

[0444] In some embodiments, the encoding unit 410 is specifically used for: The first sequence is repeatedly encoded to obtain the second sequence.

[0445] In some embodiments, if the number of bits in the first sequence is K and the number of repetitions of the repeated encoding is N, then the number of bits in the second sequence is N×K; where N and K are both positive integers.

[0446] In some embodiments, the encoding unit 410 is specifically used for: Based on the first sequence, at least one third sequence is determined; The second sequence is obtained by repeating the encoding based on the at least one third sequence.

[0447] In some embodiments, the encoding unit 410 is specifically used for: The third sequence is determined based on the bit values ​​in the first sequence.

[0448] In some embodiments, the encoding unit 410 is specifically used for: Obtain the first mapping relationship; The first mapping relationship includes the correspondence between the first numerical value and the first candidate sequence, and the correspondence between the second numerical value and the second candidate sequence; If the first bit in the first sequence takes the value of the first value, then the first candidate sequence is determined as the third sequence; If the value of the first bit is the second value, then the second candidate sequence is determined as the third sequence.

[0449] In some embodiments, the first candidate sequence and the second candidate sequence have different values ​​at the same bit position.

[0450] In some embodiments, the encoding unit 410 is specifically used for: Divide the first sequence into at least one coded group; The third sequence is determined based on the value of each of the at least one encoded group.

[0451] In some embodiments, the encoding unit 410 is specifically used for: Obtain the second mapping relationship; The second mapping relationship includes the correspondence between multiple values ​​and multiple candidate sequences; the multiple values ​​include the value of each encoded group. The candidate sequence corresponding to the value of each encoded group is determined as the third sequence.

[0452] In some embodiments, the number of the plurality of candidate sequences is positively correlated with the number of bits in each of the plurality of values.

[0453] In some embodiments, the encoding unit 410 is specifically used for: The values ​​of the bits in the third sequence are repeatedly encoded to obtain the second sequence.

[0454] In some embodiments, the encoding unit 410 is specifically used for: The third sequence is repeatedly encoded to obtain the second sequence.

[0455] In some embodiments, the encoding unit 410 is specifically used for: The sequence formed by the at least one third sequence is repeatedly encoded to obtain the second sequence.

[0456] In some embodiments, if the number of bits in the first sequence is K, the number of repetitions of the repeated encoding is N, and the number of bits in each of the at least one third sequence is X, then the number of bits in the second sequence is N×X×K; where N, X, and K are all positive integers.

[0457] In some embodiments, the third sequence matches any of the following encoding schemes: Reverse non-return-to-zero coding, Manchester coding, unipolar return-to-zero coding, Miller coding, differential biphase coding, differential coding, pulse interval coding, and bidirectional spatial coding.

[0458] In some embodiments, the first sequence includes a fourth sequence and cyclic redundancy check (CRC) bits of the fourth sequence.

[0459] In some embodiments, the CRC bits are located after the fourth sequence.

[0460] In some embodiments, the first sequence includes a fourth sequence and at least one parity bit.

[0461] In some embodiments, the at least one parity bit is located after the fourth sequence.

[0462] In some embodiments, the fourth sequence is a sequence to be divided, which is divided into at least one parity group, and the first parity bit in the at least one parity bit is located after the first parity group in the at least one parity group.

[0463] In some embodiments, the first sequence includes a fourth sequence, a cyclic redundancy check (CRC) bit of the fourth sequence, and at least one parity check bit.

[0464] In some embodiments, the first sequence comprises, in sequence: the fourth sequence, the CRC bit, and the at least one parity check bit.

[0465] In some embodiments, the first sequence comprises, in sequence: the fourth sequence, the at least one parity check bit, and the CRC bit.

[0466] In some embodiments, the fourth sequence is a sequence to be divided, which is divided to include at least one parity check group, and the first parity check bit in the at least one parity check bit is located after the first parity check group in the at least one parity check group; the CRC bit is located after the sequence formed by the fourth sequence and the at least one parity check bit.

[0467] In some embodiments, the sequence formed by the fourth sequence and the CRC bits is a sequence to be divided, and the sequence to be divided includes at least one check group. The first parity check bit in the at least one parity check bit is located after the first check group in the at least one check group.

[0468] In some embodiments, the check group used to determine the first parity bit in the at least one check group does not overlap with the check group used to determine other parity bits besides the first parity bit in the at least one check group.

[0469] In some embodiments, the first parity bit is determined based on the first parity group.

[0470] In some embodiments, the check group used to determine the first parity bit in the at least one check group at least partially overlaps with the check group used to determine other parity bits besides the first parity bit in the at least one check group.

[0471] In some embodiments, the first parity bit is determined based on the first parity packet and the parity packet preceding the first parity packet.

[0472] In some embodiments, the first parity bit is determined based on the first parity packet, the parity packet preceding the first parity packet, and the parity bit that has been determined based on the parity packet preceding the first parity packet from among the at least one parity bit.

[0473] In some embodiments, the fourth sequence is a data bit sequence.

[0474] In some embodiments, the encoding unit 410 is further configured to: Obtain the maximum number of bits in each check packet of the at least one check packet; Each consecutive maximum number of bits in the sequence to be divided is divided into a check group, which is one of the at least one check groups.

[0475] In some embodiments, the number of bits in each check group in the at least one check group is the maximum number of bits.

[0476] In some embodiments, the encoding unit 410 is specifically used for: If the number of undivided bits in the sequence to be divided is less than the maximum number of bits, then the last check group in the at least one check group is obtained based on the undivided bits and the padding bits. The total number of bits including the undivided bits and the padding bits is the maximum number of bits.

[0477] In some embodiments, the number of bits in the at least one check packet excluding the last check packet is the maximum number of bits, and the number of bits in the last check packet is less than the maximum number of bits.

[0478] In some embodiments, the encoding unit 410 is specifically used for: If the number of undivided bits in the sequence to be divided is less than the maximum number of bits, then the undivided bits are determined as the last check group in the at least one check group.

[0479] In some embodiments, the maximum number of bits is configured by a network device, or the maximum number of bits is predefined.

[0480] In some embodiments, the encoding unit 410 is specifically used for: The maximum number of bits is determined based on the number of bits in the sequence to be divided.

[0481] In some embodiments, the encoding unit 410 is specifically used for: Obtain the third mapping relationship; The third mapping relationship includes the correspondence between multiple numerical values ​​and multiple candidate bit counts; the multiple numerical values ​​include the third numerical value with the smallest difference from the number of bits in the sequence to be divided. The number of candidate bits corresponding to the third value is determined as the maximum number of bits.

[0482] In some embodiments, the third mapping relationship is a mapping relationship determined by the zero-power device among multiple mapping relationships configured by the network device, or the third mapping relationship is a mapping relationship determined by the zero-power device among multiple predefined mapping relationships.

[0483] In some embodiments, the encoding unit 410 is specifically used for: Obtain the fourth mapping relationship; The fourth mapping relationship includes a correspondence between multiple numerical ranges and multiple bit counts; the bit count of the sequence to be divided belongs to the first numerical range of the multiple numerical ranges. The number of bits corresponding to the first numerical range is determined as the maximum number of bits.

[0484] In some embodiments, the fourth mapping relationship is a mapping relationship determined by the zero-power device among multiple mapping relationships configured in the network device, or the fourth mapping relationship is a mapping relationship determined by the zero-power device among multiple predefined mapping relationships.

[0485] In some embodiments, the encoding unit 410 is specifically used for: Obtain a fourth value; the fourth value represents the number of the at least one check packet and / or the number of the at least one parity bit; The maximum number of bits is determined based on the number of bits in the sequence to be divided and the fourth value.

[0486] In some embodiments, the encoding unit 410 is specifically used for: The maximum number of bits is determined based on the ratio of the number of bits in the sequence to be divided to the fourth value.

[0487] In some embodiments, the fourth value is configured via a network device, or the fourth value is predefined.

[0488] In some embodiments, the encoding unit 410 is further configured to: The second sequence is interleaved.

[0489] In some embodiments, the encoding unit 410 is further configured to: The second sequence is encoded in the first way.

[0490] In some embodiments, the encoding unit 410 is further configured to: A first signal is obtained by modulating the second sequence or the second sequence after the first encoding. Send the first signal.

[0491] In some embodiments, the first sequence includes a prefix sequence; the encoding unit 410 is specifically used for: The first signal is obtained by modulating the second sequence or the second sequence after the first encoding.

[0492] In some embodiments, the encoding unit 410 is specifically used for: The fifth sequence is obtained by adding the prefix sequence to the second sequence or the second sequence after the first encoding. The fifth sequence is modulated to obtain the first signal.

[0493] In some embodiments, the prefix sequence is configured by a network device, or the prefix sequence is predefined, or the prefix sequence is determined based on the number of repetitions of the repeating code.

[0494] In some embodiments, the modulation method used by the second sequence or the sequence after the second sequence is first encoded includes at least one of the following: amplitude shift keying (ASK) modulation, on-off keying (OOK) modulation, frequency shift keying (FSK) modulation, and phase shift keying (PSK) modulation.

[0495] In some embodiments, the first encoding includes at least one of the following: Reverse non-return-to-zero coding, unipolar return-to-zero coding, Manchester coding, Miller coding, differential biphase coding, differential coding, pulse interval coding, and bidirectional spatial coding.

[0496] In some embodiments, the encoding unit 410 is further configured to: Send the second sequence.

[0497] In some embodiments, the encoding unit 410 is further configured to: The number of repetitions of the repetition code is determined based on at least one of the following information from the first sequence: Data block size, bit rate, and communication speed.

[0498] In some embodiments, the number of repetitions of the repetition encoding is configured by the network device, or the number of repetitions of the repetition encoding is predefined.

[0499] It should be understood that the apparatus embodiments and method embodiments can correspond to each other, and similar descriptions can be referred to the method embodiments. Specifically, Figure 22 The transmitting device 400 shown can correspond to the corresponding subject in the method 200 of the present application embodiment, and the foregoing and other operations and / or functions of each unit in the transmitting device 400 are respectively to implement the corresponding processes in the various methods provided in the present application embodiment. For the sake of brevity, they will not be described in detail here.

[0500] Figure 23 This is a schematic block diagram of a receiving device 500 according to an embodiment of this application. It should be noted that the receiving device 500 can be a network device or a terminal device. For example, the terminal device can be a zero-power device, which can be a device supporting at least one of the following communication methods: backscatter communication and active transmission communication. For example, a zero-power device can be a conventional NR terminal with a backscatter communication module loaded or integrated.

[0501] like Figure 23 As shown, the receiving device 500 may include: The decoding unit 510 is used to repeatedly decode the second sequence to be decoded to obtain the first sequence.

[0502] In some embodiments, the decoding unit 510 is specifically used for: The first sequence is obtained by repeatedly decoding the bit values ​​in the first sequence based on the second sequence.

[0503] In some embodiments, the decoding unit 510 is specifically used for: The first sequence is obtained by repeatedly decoding the second sequence.

[0504] In some embodiments, if the number of bits in the second sequence is N×K and the number of repetitions in the repeated decoding is N, then the number of bits in the second sequence is K; where N and K are both positive integers.

[0505] In some embodiments, the decoding unit 510 is specifically used for: Based on the second sequence, perform repeated decoding to determine at least one third sequence; The first sequence is determined based on the at least one third sequence.

[0506] In some embodiments, the decoding unit 510 is specifically used for: Based on the third sequence, the values ​​of the bits in the first sequence are determined.

[0507] In some embodiments, the decoding unit 510 is specifically used for: Obtain the first mapping relationship; The first mapping relationship includes the correspondence between the first numerical value and the first candidate sequence, and the correspondence between the second numerical value and the second candidate sequence; If the third sequence is the first candidate sequence, then the first value is determined as the value of the first bit in the first sequence; If the third sequence is the second candidate sequence, then the second value is determined as the value of the first bit.

[0508] In some embodiments, the first candidate sequence and the second candidate sequence have different values ​​at the same bit position.

[0509] In some embodiments, the decoding unit 510 is specifically used for: The at least one decoded group is determined based on the at least one third sequence; The decoded group includes one or more bits from the first sequence.

[0510] In some embodiments, the decoding unit 510 is specifically used for: Obtain the second mapping relationship; The second mapping relationship includes the correspondence between multiple values ​​and multiple candidate sequences; the multiple candidate sequences include the at least one third sequence. The value corresponding to each of the at least one third sequence is determined as the decoding group.

[0511] In some embodiments, the number of the plurality of candidate sequences is positively correlated with the number of bits in each of the plurality of values.

[0512] In some embodiments, the decoding unit 510 is specifically used for: Based on the second sequence, the bit values ​​in the third sequence are repeatedly decoded to determine the at least one third sequence.

[0513] In some embodiments, the decoding unit 510 is specifically used for: The at least one third sequence is determined by repeatedly decoding the third sequence based on the second sequence.

[0514] In some embodiments, the decoding unit 510 is specifically used for: The at least one third sequence is determined by repeatedly decoding the sequence formed by the second sequence and the at least one third sequence.

[0515] In some embodiments, if the number of bits in the second sequence is N×X×K, the number of repetitions in the repeated decoding is N, and the number of bits in each of the at least one third sequence is X, then the number of bits in the first sequence is K; where N, X, and K are all positive integers.

[0516] In some embodiments, the third sequence matches any of the following decoding methods: Reverse non-return-to-zero decoding, Manchester decoding, unipolar return-to-zero decoding, Miller decoding, differential biphase decoding, differential decoding, pulse interval decoding, and bidirectional spatial decoding.

[0517] In some embodiments, the first sequence includes a fourth sequence and cyclic redundancy check (CRC) bits of the fourth sequence.

[0518] In some embodiments, the CRC bits are located after the fourth sequence.

[0519] In some embodiments, the first sequence includes a fourth sequence and at least one parity bit.

[0520] In some embodiments, the at least one parity bit is located after the fourth sequence.

[0521] In some embodiments, the fourth sequence is a sequence to be divided, which is divided into at least one parity group, and the first parity bit in the at least one parity bit is located after the first parity group in the at least one parity group.

[0522] In some embodiments, the first sequence includes a fourth sequence, a cyclic redundancy check (CRC) bit of the fourth sequence, and at least one parity check bit.

[0523] In some embodiments, the first sequence comprises, in sequence: the fourth sequence, the CRC bit, and the at least one parity check bit.

[0524] In some embodiments, the first sequence comprises, in sequence: the fourth sequence, the at least one parity check bit, and the CRC bit.

[0525] In some embodiments, the fourth sequence is a sequence to be divided, which is divided to include at least one parity check group, and the first parity check bit in the at least one parity check bit is located after the first parity check group in the at least one parity check group; the CRC bit is located after the sequence formed by the fourth sequence and the at least one parity check bit.

[0526] In some embodiments, the sequence formed by the fourth sequence and the CRC bits is a sequence to be divided, and the sequence to be divided includes at least one check group. The first parity check bit in the at least one parity check bit is located after the first check group in the at least one check group.

[0527] In some embodiments, the check group used to determine the first parity bit in the at least one check group does not overlap with the check group used to determine other parity bits besides the first parity bit in the at least one check group.

[0528] In some embodiments, the first parity bit is determined based on the first parity group.

[0529] In some embodiments, the check group used to determine the first parity bit in the at least one check group at least partially overlaps with the check group used to determine other parity bits besides the first parity bit in the at least one check group.

[0530] In some embodiments, the first parity bit is determined based on the first parity packet and the parity packet preceding the first parity packet.

[0531] In some embodiments, the first parity bit is determined based on the first parity packet, the parity packet preceding the first parity packet, and the parity bit that has been determined based on the parity packet preceding the first parity packet from among the at least one parity bit.

[0532] In some embodiments, the fourth sequence is a data bit sequence.

[0533] In some embodiments, the decoding unit 510 is further configured to: Obtain the maximum number of bits in each check packet of the at least one check packet; In this process, each consecutive maximum number of bits in the sequence to be divided is divided into a check group among the at least one check group.

[0534] In some embodiments, the number of bits in each check group in the at least one check group is the maximum number of bits.

[0535] In some embodiments, the last check packet in the at least one check packet includes padding bits.

[0536] In some embodiments, the number of bits in the at least one check packet excluding the last check packet is the maximum number of bits, and the number of bits in the last check packet is less than the maximum number of bits.

[0537] In some embodiments, the maximum number of bits is configured by a network device, or the maximum number of bits is predefined.

[0538] In some embodiments, the decoding unit 510 is specifically used for: The maximum number of bits is determined based on the number of bits in the sequence to be divided.

[0539] In some embodiments, the decoding unit 510 is specifically used for: Obtain the third mapping relationship; The third mapping relationship includes the correspondence between multiple numerical values ​​and multiple candidate bit counts; the multiple numerical values ​​include the third numerical value with the smallest difference from the number of bits in the sequence to be divided. The number of candidate bits corresponding to the third value is determined as the maximum number of bits.

[0540] In some embodiments, the third mapping relationship is a mapping relationship determined by the zero-power device among multiple mapping relationships configured in the network device, or the third mapping relationship is a mapping relationship determined by the zero-power device among multiple predefined mapping relationships.

[0541] In some embodiments, the decoding unit 510 is specifically used for: Obtain the fourth mapping relationship; The fourth mapping relationship includes a correspondence between multiple numerical ranges and multiple bit counts; the bit count of the sequence to be divided belongs to the first numerical range of the multiple numerical ranges. The number of bits corresponding to the first numerical range is determined as the maximum number of bits.

[0542] In some embodiments, the fourth mapping relationship is a mapping relationship determined by the zero-power device among multiple mapping relationships configured in the network device, or the fourth mapping relationship is a mapping relationship determined by the zero-power device among multiple predefined mapping relationships.

[0543] In some embodiments, the decoding unit 510 is specifically used for: Obtain a fourth value; the fourth value represents the number of the at least one check packet and / or the number of the at least one parity bit; The maximum number of bits is determined based on the number of bits in the sequence to be divided and the fourth value.

[0544] In some embodiments, the decoding unit 510 is specifically used for: The maximum number of bits is determined based on the ratio of the number of bits in the sequence to be divided to the fourth value.

[0545] In some embodiments, the fourth value is configured via a network device, or the fourth value is predefined.

[0546] In some embodiments, before the decoding unit 510 performs repeated decoding based on the second sequence to be decoded, it is further configured to: The second sequence is de-interleaved.

[0547] In some embodiments, before the decoding unit 510 performs repeated decoding based on the second sequence to be decoded, it is further configured to: The second sequence is then decoded in the first step.

[0548] In some embodiments, the decoding unit 510 is further configured to: Receive the first signal; The first signal is demodulated or the demodulated first signal is decoded to obtain the second sequence.

[0549] In some embodiments, the first sequence includes a prefix sequence.

[0550] In some embodiments, the decoding unit 510 is specifically used for: The first signal is demodulated or the demodulated first signal is decoded in a first manner to obtain a fifth sequence; the fifth sequence includes the second sequence and the prefix sequence.

[0551] In some embodiments, the prefix sequence is configured by a network device, or the prefix sequence is predefined, or the prefix sequence is determined based on the number of repetitions in the repeated decoding.

[0552] In some embodiments, the demodulation method used for the first signal includes at least one of the following: amplitude shift keying (ASK) demodulation, on / off keying (OOK) demodulation, frequency shift keying (FSK) demodulation, and phase shift keying (PSK) demodulation.

[0553] In some embodiments, the first decoding includes at least one of the following: Reverse non-return-to-zero decoding, unipolar return-to-zero decoding, Manchester decoding, Miller decoding, differential biphase decoding, differential decoding, pulse interval decoding, bidirectional spatial decoding.

[0554] In some embodiments, before the decoding unit 510 performs repeated decoding based on the second sequence to be decoded, it is further configured to: Receive the second sequence.

[0555] In some embodiments, the number of repetitions of the repeated decoding is determined by the zero-power device based on at least one of the following information of the first sequence: data block size, bit rate, and communication rate.

[0556] In some embodiments, the number of repetitions for the repeated decoding is configured by the network device, or the number of repetitions for the repeated decoding is predefined.

[0557] It should be understood that the apparatus embodiments and method embodiments can correspond to each other, and similar descriptions can be referred to the method embodiments. Specifically, Figure 23 The receiving device 500 shown can correspond to the corresponding subject in the method 300 of the embodiments of this application, and the foregoing and other operations and / or functions of each unit in the receiving device 500 are respectively to implement the corresponding processes in the various methods provided in the embodiments of this application. For the sake of brevity, they will not be described in detail here.

[0558] The communication device of this application embodiment has been described above from the perspective of functional modules in conjunction with the accompanying drawings. It should be understood that this functional module can be implemented in hardware, in software instructions, or in a combination of hardware and software modules. Specifically, the steps of the method embodiments in this application can be completed by integrated logic circuits in the processor's hardware and / or by software instructions. The steps of the method disclosed in this application embodiment can be directly manifested as execution by a hardware decoding processor, or by a combination of hardware and software modules in the decoding processor. Optionally, the software module can be located in a mature storage medium in the art, such as random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, registers, etc. This storage medium is located in memory, and the processor reads information from the memory and, in conjunction with its hardware, completes the steps in the method embodiments described above.

[0559] For example, the processing unit and communication unit mentioned above can be implemented by a processor and a transceiver, respectively.

[0560] Figure 24 This is a schematic structural diagram of a communication device 600 according to an embodiment of this application.

[0561] like Figure 24 As shown, the communication device 600 may include a processor 610.

[0562] The processor 610 can call and run computer programs from memory to implement the methods in the embodiments of this application.

[0563] like Figure 24 As shown, the communication device 600 may also include a memory 620.

[0564] The memory 620 can be used to store information, as well as code and instructions executed by the processor 610. The processor 610 can call and run computer programs from the memory 620 to implement the methods in the embodiments of this application. The memory 620 can be a separate device independent of the processor 610, or it can be integrated into the processor 610.

[0565] like Figure 24 As shown, the communication device 600 may also include a transceiver 630.

[0566] The processor 610 can control the transceiver 630 to communicate with other devices; specifically, it can send information or data to other devices or receive information or data sent by other devices. The transceiver 630 may include a transmitter and a receiver. The transceiver 630 may further include antennas, and the number of antennas may be one or more.

[0567] It should be understood that the various components in the communication device 600 are connected through a bus system, which includes a data bus, a power bus, a control bus, and a status signal bus.

[0568] It should also be understood that the communication device 600 can be a transmitting device or a receiving device in the embodiments of this application, and the communication device 600 can implement the corresponding processes implemented by the transmitting device or the receiving device in the various methods of the embodiments of this application. That is, the communication device 600 in the embodiments of this application can be the transmitting device 400 in the embodiments of this application, and can be the corresponding subject executing the method 200 according to the embodiments of this application. For the sake of brevity, it will not be described in detail here. Similarly, the communication device 600 in the embodiments of this application can also be the receiving device 500 in the embodiments of this application, and can be the corresponding subject executing the method 300 according to the embodiments of this application. For the sake of brevity, it will not be described in detail here.

[0569] In addition, a chip is also provided in this application embodiment.

[0570] For example, the chip may be an integrated circuit chip with signal processing capabilities, capable of implementing or executing the methods, steps, and logic block diagrams disclosed in the embodiments of this application. The chip may also be referred to as a system-on-a-chip (SoC), system-on-a-chip (SoC), chip system, or system-on-chip (SoC), etc. Optionally, the chip can be applied to various communication devices, enabling the communication device equipped with the chip to execute the methods, steps, and logic block diagrams disclosed in the embodiments of this application.

[0571] Figure 25 This is a schematic structural diagram of chip 700 according to an embodiment of this application.

[0572] like Figure 25 As shown, the chip 700 includes a processor 710.

[0573] The processor 710 can call and run computer programs from memory to implement the methods in the embodiments of this application.

[0574] like Figure 25 As shown, the chip 700 may also include a memory 720.

[0575] The processor 710 can call and run computer programs from the memory 720 to implement the methods in the embodiments of this application. The memory 720 can be used to store instruction information, as well as code, instructions, etc., executed by the processor 710. The memory 720 can be a separate device independent of the processor 710, or it can be integrated into the processor 710.

[0576] like Figure 25As shown, the chip 700 may also include an input interface 730.

[0577] The processor 710 can control the input interface 730 to communicate with other devices or chips, specifically, it can acquire information or data sent by other devices or chips.

[0578] like Figure 25 As shown, the chip 700 may also include an output interface 740.

[0579] The processor 710 can control the output interface 740 to communicate with other devices or chips, specifically, it can output information or data to other devices or chips.

[0580] It should be understood that the chip 700 can be applied to the zero-power device in the embodiments of this application, and can implement the corresponding processes implemented by the zero-power device in the various methods of the embodiments of this application. For the sake of brevity, it will not be described in detail here.

[0581] It should also be understood that the various components in the chip 700 are connected through a bus system, which includes a data bus, a power bus, a control bus, and a status signal bus.

[0582] The processors mentioned above may include, but are not limited to: General-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or other programmable logic devices, discrete component gates or transistor logic devices, discrete hardware components, etc.

[0583] The processor can be used to implement or execute the methods, steps, and logic diagrams disclosed in the embodiments of this application. The steps of the methods disclosed in the embodiments of this application can be directly manifested as being executed by a hardware decoding processor, or executed by a combination of hardware and software modules in the decoding processor. The software modules can reside in random access memory, flash memory, read-only memory, programmable read-only memory, erasable programmable memory, registers, or other mature storage media in the art. This storage medium is located in memory; the processor reads information from the memory and, in conjunction with its hardware, completes the steps of the methods described above.

[0584] The memory mentioned above includes, but is not limited to: Volatile memory and / or non-volatile memory. Non-volatile memory can be read-only memory (ROM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), or flash memory. Volatile memory can be random access memory (RAM), used as an external cache. By way of example, but not limitation, many forms of RAM are available, such as Static RAM (SRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), Double Data Rate SDRAM (DDR SDRAM), Enhanced SDRAM (ESDRAM), Synchronous Link DRAM (SLDRAM), and Direct Rambus RAM (DR RAM).

[0585] It should be noted that the memory described herein is intended to include these and any other suitable types of memory.

[0586] This application also provides a computer-readable storage medium for storing a computer program. The computer-readable storage medium stores one or more programs, which include instructions that, when executed by a portable electronic device including multiple applications, enable the portable electronic device to perform the wireless communication methods provided in this application. For example, the computer-readable storage medium can be applied to a transmitting device in an embodiment of this application, and the computer program causes a computer to execute the corresponding processes implemented by the transmitting device in the various methods of the embodiments of this application; for simplicity, these will not be elaborated further here. As another example, the computer-readable storage medium can be applied to a receiving device in an embodiment of this application, and the computer program causes a computer to execute the corresponding processes implemented by the receiving device in the various methods of the embodiments of this application; for simplicity, these will not be elaborated further here.

[0587] This application also provides a computer program product, including a computer program. For example, this computer program product can be applied to the transmitting device in the embodiments of this application, and the computer program causes the computer to execute the corresponding processes implemented by the transmitting device in the various methods of the embodiments of this application; for simplicity, further details are omitted here. As another example, this computer program product can be applied to the receiving device in the embodiments of this application, and the computer program causes the computer to execute the corresponding processes implemented by the receiving device in the various methods of the embodiments of this application; for simplicity, further details are omitted here.

[0588] This application also provides a computer program. When the computer program is executed by a computer, it enables the computer to perform the wireless communication methods provided in this application. For example, the computer program can be applied to the transmitting device in the embodiments of this application. When the computer program runs on the computer, it causes the computer to execute the corresponding processes implemented by the transmitting device in the various methods of the embodiments of this application. For simplicity, these will not be described in detail here. Similarly, the computer program can be applied to the receiving device in the embodiments of this application. When the computer program runs on the computer, it causes the computer to execute the corresponding processes implemented by the receiving device in the various methods of the embodiments of this application. For simplicity, these will not be described in detail here.

[0589] This application also provides a communication system, which may include the transmitting and receiving devices mentioned above, to form a communication system as described above. Figure 1 The communication system 100 shown will not be described in detail here for the sake of brevity. It should be noted that the term "system" in this article can also be referred to as "network management architecture" or "network system," etc.

[0590] It should also be understood that the terminology used in the embodiments of this application and the appended claims is for the purpose of describing particular embodiments only and is not intended to limit the embodiments of this application. For example, the singular forms “a,” “the,” “the,” and “the” used in the embodiments of this application and the appended claims are also intended to include the plural forms unless the context clearly indicates otherwise.

[0591] Those skilled in the art will recognize that the units and algorithm steps of the various examples 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 implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of the embodiments of this application. If implemented as a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the embodiments of this application, in essence, or the part that contributes to the prior art, or part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the method described in the embodiments of this application. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory, random access memory, magnetic disks, or optical disks.

[0592] Those skilled in the art will also recognize that, for the sake of convenience and brevity, the specific working processes of the systems, devices, and units described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be repeated here. In the several embodiments provided in this application, it should be understood that the disclosed systems, devices, and methods can be implemented in other ways. For example, the division of units, modules, or components in the device embodiments described above is merely a logical functional division; in actual implementation, there may be other division methods. For instance, multiple units, modules, or components may be combined or integrated into another system, or some units, modules, or components may be ignored or not executed. As another example, the units / modules / components described above as separate / displayed components may or may not be physically separated; that is, they may be located in one place or distributed across multiple network units. Some or all of the units / modules / components can be selected according to actual needs to achieve the purpose of the embodiments of this application. Finally, it should be noted that the mutual coupling or direct coupling or communication connection shown or discussed above can be through some interfaces; the indirect coupling or communication connection of devices or units can be electrical, mechanical, or other forms.

[0593] The above description is merely a specific implementation of the embodiments of this application, but the protection scope of the embodiments of this application is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the technical scope disclosed in the embodiments of this application should be included within the protection scope of the embodiments of this application. Therefore, the protection scope of the embodiments of this application should be determined by the protection scope of the claims.

Claims

1. A wireless communication method, characterized in that, The method is applicable to zero-power devices, and the method includes: The second sequence is obtained by repeatedly encoding the first sequence to be encoded.

2. The method according to claim 1, characterized in that, The process of repeatedly encoding the first sequence to be encoded to obtain the second sequence includes: The first sequence is repeatedly encoded to obtain the second sequence.

3. The method according to claim 2, characterized in that, If the number of bits in the first sequence is K and the number of repetitions of the repeated encoding is N, then the number of bits in the second sequence is N×K; where N and K are both positive integers.

4. The method according to claim 1, characterized in that, The process of repeatedly encoding the first sequence to be encoded to obtain the second sequence includes: Based on the first sequence, at least one third sequence is determined; The second sequence is obtained by repeating the encoding based on the at least one third sequence.

5. The method according to claim 4, characterized in that, The step of determining at least one third sequence based on the first sequence includes: The third sequence is determined based on the bit values ​​in the first sequence.

6. The method according to claim 5, characterized in that, Determining the third sequence based on the bit values ​​in the first sequence includes: Obtain the first mapping relationship; The first mapping relationship includes the correspondence between the first numerical value and the first candidate sequence, and the correspondence between the second numerical value and the second candidate sequence; If the first bit in the first sequence takes the value of the first value, then the first candidate sequence is determined as the third sequence; If the value of the first bit is the second value, then the second candidate sequence is determined as the third sequence.

7. The method according to claim 6, characterized in that, The first candidate sequence and the second candidate sequence have different values ​​at the same bit position.

8. The method according to any one of claims 4 to 7, characterized in that, If the number of bits in the first sequence is K, the number of repetitions of the repeated encoding is N, and the number of bits in each of the at least one third sequence is X, then the number of bits in the second sequence is N×X×K; where N, X, and K are all positive integers.

9. The method according to any one of claims 4 to 8, characterized in that, The third sequence matches any of the following encoding methods: Reverse non-return-to-zero coding, Manchester coding, unipolar return-to-zero coding, Miller coding, differential biphase coding, differential coding, pulse interval coding, and bidirectional spatial coding.

10. The method according to any one of claims 1 to 9, characterized in that, The first sequence includes a fourth sequence and a cyclic redundancy check (CRC) bit of the fourth sequence.

11. The method according to claim 10, characterized in that, The CRC bits are located after the fourth sequence.

12. The method according to claim 10 or 11, characterized in that, The fourth sequence is a data bit sequence.

13. The method according to any one of claims 1 to 12, characterized in that, The method further includes: The second sequence is encoded in the first way.

14. The method according to any one of claims 1 to 13, characterized in that, The method further includes: A first signal is obtained by modulating the second sequence or the second sequence after the first encoding. Send the first signal.

15. The method according to claim 14, characterized in that, The process of modulating the second sequence or the second sequence after a first encoding to obtain the first signal includes: The fifth sequence is obtained by adding the prefix sequence to the second sequence or the second sequence after the first encoding. The fifth sequence is modulated to obtain the first signal.

16. The method according to claim 15, characterized in that, The prefix sequence is configured by a network device, or the prefix sequence is predefined, or the prefix sequence is determined according to the number of repetitions of the repeating code.

17. The method according to any one of claims 14 to 16, characterized in that, The modulation method used by the second sequence or the second sequence after the first encoding includes at least one of the following: amplitude shift keying (ASK) modulation, on-off keying (OOK) modulation, frequency shift keying (FSK) modulation, and phase shift keying (PSK) modulation.

18. The method according to any one of claims 13 to 17, characterized in that, The first encoding includes at least one of the following: Reverse non-return-to-zero coding, unipolar return-to-zero coding, Manchester coding, Miller coding, differential biphase coding, differential coding, pulse interval coding, and bidirectional spatial coding.

19. The method according to any one of claims 1 to 18, characterized in that, The number of repetitions of the repeated encoding is configured by the network device, or the number of repetitions of the repeated encoding is predefined.

20. A wireless communication method, characterized in that, The method is applicable to zero-power devices, and the method includes: The first sequence is obtained by repeatedly decoding the second sequence to be decoded.

21. The method according to claim 20, characterized in that, The process of repeatedly decoding the second sequence to be decoded to obtain the first sequence includes: The first sequence is obtained by repeatedly decoding the second sequence.

22. The method according to claim 21, characterized in that, If the number of bits in the second sequence is N×K and the number of repetitions in the repeated decoding is N, then the number of bits in the second sequence is K; where N and K are both positive integers.

23. The method according to claim 20, characterized in that, The process of repeatedly decoding the second sequence to be decoded to obtain the first sequence includes: Based on the second sequence, perform repeated decoding to determine at least one third sequence; The first sequence is determined based on the at least one third sequence.

24. The method according to claim 23, characterized in that, Determining the first sequence based on the at least one third sequence includes: Based on the third sequence, the values ​​of the bits in the first sequence are determined.

25. The method according to claim 24, characterized in that, Determining the value of a bit in the first sequence based on the third sequence includes: Obtain the first mapping relationship; The first mapping relationship includes the correspondence between the first numerical value and the first candidate sequence, and the correspondence between the second numerical value and the second candidate sequence; If the third sequence is the first candidate sequence, then the first value is determined as the value of the first bit in the first sequence; If the third sequence is the second candidate sequence, then the second value is determined as the value of the first bit. The first candidate sequence and the second candidate sequence have different values ​​at the same bit position.

26. The method according to any one of claims 23 to 25, characterized in that, If the number of bits in the second sequence is N×X×K, the number of repetitions in the repeated decoding is N, and the number of bits in each of the at least one third sequence is X, then the number of bits in the first sequence is K; where N, X, and K are all positive integers.

27. The method according to any one of claims 23 to 26, characterized in that, The third sequence matches any of the following decoding methods: inverse non-return-to-zero decoding, Manchester decoding, unipolar return-to-zero decoding, Miller decoding, differential biphase decoding, differential decoding, pulse interval decoding, bidirectional spatial decoding; and / or The first sequence includes a fourth sequence and a cyclic redundancy check (CRC) bit of the fourth sequence, wherein the CRC bit is located after the fourth sequence.

28. The method according to claim 27, characterized in that, The fourth sequence is a data bit sequence.

29. The method according to any one of claims 20 to 28, characterized in that, Before performing repeated decoding based on the second sequence to be decoded, the method further includes: The second sequence is then decoded in the first step.

30. The method according to any one of claims 20 to 29, characterized in that, Before performing repeated decoding based on the second sequence to be decoded, the method further includes: Receive the first signal; The first signal is demodulated or the demodulated first signal is decoded to obtain the second sequence.

31. The method according to claim 30, characterized in that, The step of demodulating the first signal or performing a first decoding on the demodulated first signal to obtain the second sequence includes: The first signal is demodulated or the demodulated first signal is decoded in a first manner to obtain a fifth sequence; the fifth sequence includes the second sequence and the prefix sequence. The prefix sequence is configured by a network device, or the prefix sequence is predefined, or the prefix sequence is determined according to the number of repetitions in the repeated decoding.

32. The method according to claim 30 or 31, characterized in that, The demodulation method used for the first signal includes at least one of the following: amplitude shift keying (ASK) demodulation, on / off keying (OOK) demodulation, frequency shift keying (FSK) demodulation, and phase shift keying (PSK) demodulation; and / or The first decoding includes at least one of the following: inverse non-return-to-zero decoding, unipolar return-to-zero decoding, Manchester decoding, Miller decoding, differential biphase decoding, differential decoding, pulse interval decoding, and bidirectional spatial decoding.

33. The method according to any one of claims 20 to 32, characterized in that, The number of repetitions for the repeated decoding is configured by the network device, or the number of repetitions for the repeated decoding is predefined.

34. A zero-power device, characterized in that, include: The encoding unit is used to repeatedly encode the first sequence to be encoded to obtain the second sequence.

35. A zero-power device, characterized in that, include: The decoding unit is used to repeatedly decode the second sequence to be decoded to obtain the first sequence.

Images